text stringlengths 8 5.77M |
|---|
{
"type": "bundle",
"id": "bundle--b87265cd-a393-480c-a9d2-ff38c8f82ac6",
"spec_version": "2.0",
"objects": [
{
"id": "relationship--7331b11d-1d5e-4275-ba7e-a83ec4a59259",
"created_by_ref": "identity--c78cb6e5-0c4b-4611-8297-d1b8b55e40b5",
"description": "[CosmicDuke](https://attack.mitre.org/software/S0050) takes periodic screenshots and exfiltrates them.(Citation: F-Secure Cosmicduke)",
"object_marking_refs": [
"marking-definition--fa42a846-8d90-4e51-bc29-71d5b4802168"
],
"external_references": [
{
"source_name": "F-Secure Cosmicduke",
"description": "F-Secure Labs. (2014, July). COSMICDUKE Cosmu with a twist of MiniDuke. Retrieved July 3, 2014.",
"url": "https://www.f-secure.com/documents/996508/1030745/cosmicduke_whitepaper.pdf"
}
],
"source_ref": "malware--2eb9b131-d333-4a48-9eb4-d8dec46c19ee",
"relationship_type": "uses",
"target_ref": "attack-pattern--0259baeb-9f63-4c69-bf10-eb038c390688",
"type": "relationship",
"modified": "2020-03-16T16:36:13.656Z",
"created": "2017-12-14T16:46:06.044Z"
}
]
} |
Harvest One Continues to Show Positive Momentum Across All Business Units
VANCOUVER, May 30, 2019 /CNW/ - Harvest One Cannabis Inc. ("Harvest One" or the "Company") (TSX-V: HVT; OTCQX: HRVOF) today announced the release of its financial and operating results for the three and nine months ended March 31, 2019.
Third Quarter Highlights
Harvest One achieved net revenue of $3.0 million and $8.4 million for the three and nine months ended March 31, 2019 , respectively, representing a 9,058% and 3,877% increase from the same periods in 2018;
and for the three and nine months ended , respectively, representing a 9,058% and 3,877% increase from the same periods in 2018; Harvest One entered into a definitive arrangement agreement to acquire 100% of the issued and outstanding common shares of Delivra Corp. ("Delivra");
Harvest One acquired a majority interest in Greenbelt Greenhouse Ltd. ("Greenbelt"), which allows the Company to control significant production to supply infused formulations of existing brands and new products under development by the Company;
Harvest One's common shares were approved for trading on the OTCQX under the symbol "HRVOF" and commenced trading on January 7, 2019 ;
; United Greeneries entered into a supply agreement with Canada's largest retail pharmacy chain Shoppers Drug Mart ("Shoppers") to supply Satipharm branded medical cannabis products and completed its first shipment to Shoppers in March 2019 ;
largest retail pharmacy chain Shoppers Drug Mart ("Shoppers") to supply Satipharm branded medical cannabis products and completed its first shipment to Shoppers in ; Satipharm entered into a distribution agreement with the medicinal cannabis wholesaler and distributor Health House International Pty Ltd. ("Health House") for distribution of CBD Gelpell® Capsules throughout Australia , New Zealand and Asia ;
, and ; Satipharm re-launched European sales of its recently reformulated CBD Gelpell® capsules; and
Dream Water entered into supply agreements with major retailers Walmart US and Kroger, received the NSF International Certified for Sport® designation, and launched its new packaging.
Management Commentary
Grant Froese, CEO of Harvest One, said, "We are very pleased with our continued progress throughout the quarter. United Greeneries maintained strong recreational sales as we continue to build out capacity in our Mission Road and Lucky Lake facilities. Satipharm commenced selling our CBD Gelpell® capsules online in the UK and Europe. Dream Water posted solid revenues and continues to add key accounts to its already extensive retail distribution network. The initial load ins from these new accounts will be reflected in our fiscal Q4 revenues."
Mr. Froese continued, "Harvest One's third quarter financial results were impacted by the prior quarter's initial load ins in preparation for the legalization of recreational cannabis consumption. During the third quarter, we achieved increasing harvests as we continue to enhance existing facilities and build out new capacity. In preparation for the roll out of value-added products later this year, we also allocated a portion of our inventory accordingly for extraction and future R&D. The impact of these value-added products will be reflected in the financial results in future quarters. Most importantly, we continue to execute on our strategy of being a leading health, wellness, and self-care company."
Summary of Key Financial Results
Three months ended March 31 Nine months ended March 31 Select Financial Information 2019 2018 2019 2018 ($000's, except share and per share amounts) $ $(1) $ $(1) Net revenue 3,023 33 8,444 212 Gross profit 207 1,145 1,913 824 Expenses 5,308 2,509 16,059 6,571 Loss from operations (5,101) (1,365) (14,146) (5,746) Net loss (5,131) (2,425) (14,258) (7,655) Net loss per share – basic and diluted (0.03) (0.02) (0.08) (0.07) Weighted average number of common shares 182,215,534 139,021,262 177,789,938 105,949,749 Adjusted EBITDA(2) (3,302) (2,172) (9,681) (5,749)
(1) Certain expenses for the three and nine months ended March 31, 2018 were reclassified as described in note 2(d) in Harvest One's Q3 2019 consolidated financial statements. (2) Adjusted EBITDA is a non-GAAP measure defined as loss from operations before interest, taxes, depreciation and amortization adjusted for additional fair value items and other non-cash items, and reconciled in Harvest One's Q3 2019 MD&A.
Outlook
United Greeneries continues to expand its indoor growing capacity to meet our target of 20,000 kg annually. This additional capacity, when online, will increase the Company's supply in order to meet existing customer demand for its premium-quality craft indoor grown flower. The Company plans to reach its targeted 20,000 kg annual capacity through: (1) completion of our Lucky Lake Facility coming online in the fourth quarter of calendar 2019; (2) the Mission Road Facility modular expansion, also scheduled for completion in the fourth quarter of calendar 2019; and (3) entering into offtake agreements for the remaining capacity.
As a component of the Company's product development strategy, we will conduct R&D for the next phase of legalization and support the expansion of our product lines including additional health and wellness products, beverages, vape pens, and nutraceuticals using cannabis oil derivative products. Furthermore, the investment in the Greenbelt greenhouse and its 42,000 square foot headhouse provides an ideal location for the Company to add additional capacity to support its extraction and processing strategy.
In the third quarter of calendar 2019 Satipharm expects to expand its product offering with the introduction of new cannabis-infused medical and nutraceutical products currently under formulation. Dream Water is also formulating a CBD-infused version of its product line which it intends to launch throughout its distribution channels in regulated markets in Canada and the US as regulations permit.
About Harvest One Cannabis Inc. (TSX-V: HVT; OTCQX: HRVOF)
Harvest One is a global cannabis company that develops and provides innovative lifestyle and wellness products to consumers and patients in regulated markets around the world. The Company's range of lifestyle solutions is designed to enhance quality of life. Shareholders have significant exposure to the entire cannabis value chain through its wholly-owned subsidiaries: United Greeneries, a Licensed Producer; Satipharm (medical and nutraceutical); and Dream Water Global (consumer); as well as a controlling interest in Greenbelt Greenhouse (greenhouse cultivation and extraction), and a minority interest in Burb Cannabis (retail operations). For more information, please visit www.harvestone.com.
This press release contains "forward-looking statements," which may be identified by the use of words such as, "may," "would," "could," "will," "likely," "expect," "anticipate," "believe," "intend," "plan," "forecast," "project," "estimate," "outlook" and other similar expressions, including statements regarding our growth potential, the sustainability of growth, completion of construction at the BC and Saskatchewan expansion sites, output and production estimates at the BC and Saskatchewan expansion sites, development of new products, demand for our products and the medical and adult-use cannabis markets. Forward-looking statements are not a guarantee of future performance and are based upon a number of estimates and assumptions of management in light of management's experience and perception of trends, current conditions and expected developments, as well as other factors that management believes to be relevant and reasonable in the circumstances, including assumptions in respect of current and future market conditions. Actual results, performance or achievement could differ materially from that expressed in, or implied by, any forward-looking statements in this press release, and, accordingly, you should not place undue reliance on any such forward-looking statements and they are not guarantees of future results. Forward-looking statements involve significant risks, assumptions, uncertainties and other factors that may cause actual future results or anticipated events to differ materially from those expressed or implied in any forward-looking statements. Please see the heading "Risks and Uncertainties" in our 2019 third quarter MD&A which was filed on SEDAR on May 30, 2019 for a discussion of the material risk factors that could cause actual results to differ materially from the forward-looking information. The Company does not undertake to update any forward-looking statements that are included herein, except in accordance with applicable securities laws.
Neither TSX-V nor its Regulation Services Provider (as that term is defined in the policies of the TSX-V) accept responsibility for the adequacy or accuracy of this release.
SOURCE Harvest One Cannabis Inc.
For further information: Investor Relations: Colin Clancy, + 1 (877) 915-7934, [email protected] |
Contributing Factors to Teen Boys with Violent Behavior
Teen violence, which can include bullying, gang activities and aggression toward family and friends, is a problem for every community. Many teens are at risk of becoming violent, so parents need to be aware of the signs and markers that may mean their teenage boy is heading down a violent path.
So, who is at risk? There are several factors that contribute to teenage violence. Of course, the presence of some or all of these risk factors doesn’t mean that a teen will be violent. However, there are some common things that seem to push teen boys toward violence at home, school and in the community.
Here are 5 factors that can contribute to teen violence:
1. Mental Health Issues
Teens who respond with violence and harsh words may be struggling with any number of mental health issues. ADD/ADHD, anxiety, depression, bipolar, and more can trigger negative behavior that includes violence. If teen boys are not be getting any kind of emotional or mental health assistance from trained and licensed professional, the violent behavior usually escalates. Intensive group and individual therapy can help teens with any number of disorders and conditions that can leave teens feeling frustrated and unable to cope.
2. Trauma
It’s often difficult for teenagers to cope with trauma in their lives, such as physical or sexual abuse, adoption and abandonment issues, post-traumatic stress and similar events. Teens often aren’t able to process what has happened to them without counseling and professional therapy, and so they act out in violent ways to communicate their hurt, fear and anger.
3. Home Life
Teens that come from a dysfunctional home, where very harsh or very lax discipline practices are wielded by parents, are more likely to become violent themselves. Domestic abuse situations can further demonstrate to teens that the only way to handle conflict is through physical intimidation. Other family influences toward violence include poverty, low education, low community involvement and low parental involvement in the teenage boy's life.
4. Community Influence
Sometimes, where a teenager lives can have an impact on negative behavior. Socioeconomically disadvantaged neighborhoods and cities can directly influence a community culture that accepts and even encourages violence. Many areas are full of crime and gang activity, which can heighten a teenage boy’s need to act violently. Poverty, neighborhood downturn, lots of unsupervised teens, increased presence in drugs and guns, and other conditions can lead to teens that are more violent.
5. Delinquent Friends
Teen boys who hang around delinquent social groups are also more likely to get involved in violence. Gang activity or other teen groups who regularly get in trouble with the law boost a teenage boy’s chances of becoming violent. Often, teenagers who join up with a group of friends that abuse drugs and alcohol regularly will likely increase in violent behavior.
Parents, teachers and community members should all take a look at the factors that contribute to teen violence and take the necessary steps to intervene in each teenage boy’s life and help them avoid or overcome violent behavior. |
Contents
Description of Service
Lessons Learned
About Felicity Gatchell Today
become even more 'globally' aware seen first hand the grim times and struggles so many have, even if highly educated eg
the fact that my counterpart stated,' if we don't grow it , we don't eat it '!
that 'one' can make a difference.... it was the toughest job I will ever LOVE!! |
Senan Jones
Senan Jones (born 16 October 2000) is an Irish cricketer. He made his Twenty20 debut for Munster Reds in the 2018 Inter-Provincial Trophy on 6 July 2018.
References
External links
Category:2000 births
Category:Living people
Category:Irish cricketers
Category:Place of birth missing (living people)
Category:Munster Reds cricketers |
MANILA, Philippines -- Millions of Filipinos lined up Monday in blazing heat to vote for a president that opinion polls show will likely be a foul-mouthed mayor who gained huge popularity with his pledges to kill criminals and end corruption within six months.
Weary of poverty, corruption and insurgencies in the hinterlands, voters are looking for a radical change at the top, and hope the man to lead it is Rodrigo Duterte, the 71-year-old mayor of the southern Davao city.
An ex-prosecutor, Duterte has peppered his campaign speeches with boasts about his Viagra-fueled sexual prowess and jokes about rape. But Duterte has successfully tapped into discontent and voters appear willing to overlook his foul language.
Get Breaking News Delivered to Your Inbox
"All of you who are into drugs, you sons of bitches, I will really kill you," Duterte told a huge cheering crowd Saturday in his final campaign rally in Manila. "I have no patience, I have no middle ground, either you kill me or I will kill you idiots."
Philippine presidential candidate and Davao city mayor Rodrigo Duterte kisses the Philippine flag during a political campaign rally before the national elections at Rizal park in Manila, Philippines, May 7, 2016. REUTERS
The brash Duterte, who has been compared to U.S. Republican presumptive nominee Donald Trump, has threatened to close down Congress and form a revolutionary government if legislators stonewall his government.
This has alarmed the political establishment, which fears that Duterte will squander the hard-won economic progress under outgoing President Benigno Aquino III. Aquino has called Duterte a threat to democracy, and likened him to Adolf Hitler.
Besides Duterte, former Interior Secretary Mar Roxas, backed by Aquino, and three other candidates are vying to lead one of Asia's liveliest democracies. More than 45,000 candidates are contesting 18,000 national, congressional and local positions in elections that have traditionally been tainted by violence and accusations of cheating, especially in far-flung rural areas. The results are not expected for at least 24 hours, perhaps longer.
At least 15 people have been killed in elections-related violence and more than 4,000 arrested for violating a gun ban, according to police.
"Let us show the world that despite our deep passion and support for our candidates, we can hold elections that are peaceful and orderly and reflect the spirit of democracy," said Aquino, who cast his ballot after standing in line for more than an hour with other voters in a Manila constituency.
Commission on Elections Chairman Andres Bautista said no major glitches were expected in the voting despite the massive logistical challenges. About 55 million Filipinos have registered to vote in 36,000 voting centers across the archipelago of more than 7,100 islands, including in a small fishing village in a Philippine-occupied island in the disputed South China Sea.
In final campaigning Saturday, Aquino warned voters that Duterte could be a dictator in the making and urged them not to support him. He cited the rise of Nazi leader Adolf Hitler as an example of how a despotic leader can gain power and hold on to it without public resistance.
Filipinos have been hypersensitive to potential threats to democracy since they rose in a 1986 "people power" revolt that ousted dictator Ferdinand Marcos, who faced allegations of plundering the poor country and condoning widespread human rights violations by state forces. In 2001, a similar uprising forced Joseph Estrada from the presidency over alleged large-scale corruption.
On the campaign trail, Duterte offered radical promises, including his bold anti-crime pledge and a plan to sail to China's new artificial islands in the disputed South China Sea and plant the Philippine flag there. The other candidates stuck to less audacious reforms.
Duterte's opponents - Roxas, Sen. Grace Poe, Vice President Jejomar Binay and Sen. Miriam Defensor-Santiago - have all criticized him for remarks that threaten the rule of law and the Philippines' hard-won democracy.
"Duterte is completely out of the system, he's out of the box," said political science Prof. Richard Heydarian of De La Salle University in Manila, adding that in the mayor's portrayal of social problems, "there is a gap between the rhetoric and reality but it's working, it's creating panic among a lot of people and rallying them behind Duterte."
Duterte built a political name with his iron-fist approach to fighting crime in Davao city, where he has served as mayor for 22 years. During the campaigning he joked about wanting to be the one to first rape an Australian missionary who was sexually abused and killed by inmates in a 1989 prison riot.
Despite his devil-may-care way with expletives, obscene remarks and allegations of corruption hurled against him, Duterte has led in election polls by more than 10 percentage points over Roxas and Poe. While it may be difficult for rivals to catch up, analysts say the race remains too close to call.
Aquino had a mixed record during his six-year term that ends in June. He presided over an accelerating economy, which had recorded one of the highest growth rates in Asia at an average of 6.2 percent between 2010 and 2015. He also introduced new taxes, more accountability and reforms, including in the judiciary, and cracked down on tax evaders.
But more than a quarter of the country's 100 million people remain mired in poverty, inequality is rampant and an immediate solution to decades-long Muslim and communist insurgencies in the south remains elusive.
Annual debt payments, some dating back to the Marcos years, and limited funds stymie infrastructure improvements and public services, including law enforcement, fueling frequent complaints. |
Det er efterhånden mere end et halvt år siden, at FC Vestsjælland gik konkurs oven på en række succesfulde år. Klubben havde siden dannelsen i 2008 taget turen fra 2. division og op i Superligaen. Man var sågar i pokalfinalen, som man tabte snævert til FCK, men da nedrykningen til 1. division få uger senere var en realitet, så tingene pludselig sorte ud for klubben.
Succesen var nemlig blevet til på et markant overforbrug, hvor klubbens ejere igen og igen måtte dække underskuddene. Det endte altså til sidst i en konkurs og degradering til Sjællandsserien for amatørafdelingen Slagelse B&I's bedste hold, men undervejs var forskellige redningsscenarier i spil.
Ifølge kilder, Tipsbladet har talt med, centralt placeret i FC Vestsjælland var der interesse fra Brøndby-ejeren Jan Bech Andersen i efteråret 2015. Han havde angiveligt planer om at gøre FC Vestsjælland til satellitklub for Brøndby og havde inviteret FCV-ejeren Kurt Andersen til et møde i London. Invitationen blev dog afvist af Kurt Andersen.
Jan Bech Andersen bekræfter, at der har været kontakt mellem parterne, men nedtoner graden af den.
- Der var et par løse samtaler og en forespørgsel, men aldrig noget konkret, og ingen har i henhold til min viden afvist nogle møder, fortæller Jan Bech Andersen til Tipsbladet.
Historien bekræftes også delvist af Kurt Andersen, som dog heller ikke mener, at parterne nåede særligt langt i en eventuel forhandling.
- Jeg har ikke fået noget konkret tilbud fra nogen som helst. Jeg talte i telefon med Jan Bech Andersen engang i oktober eller november om muligheden for at blive satellitklub, men han havde selv så mange problemer dengang, at der ikke rigtigt lå noget bagved det, siger Kurt Andersen.
Og en redning lykkedes som bekendt aldrig, men forbindelsen fortsatte i foråret, da Brøndby tilbød gratis fodbold for FCV's sæsonkortholdere og inviterede klubbens tidligere sponsorer på spisning i forbindelse med kampene.
Ifølge Tipsbladets oplysninger var der også andre muligheder i spil, og en redning af klubben skulle angiveligt have været mulig, men af forskellige mere eller mindre forståelige omstændigheder lykkedes det aldrig.
Læs hele fortællingen om FC Vestsjællands kontroversielle opbygning og afvikling i Tipsbladet, som du køber sammen med Ekstra Bladet fredag. Du kan også købe det online - se hvordan her.
I Tipsbladet fredag får du også:
- Interview med FC København-profilen Benjamin Verbic
- Interview med Vejle-sportschef Steen Thychosen
- Manchester United-scout Tommy Møller Nielsens vurdering af 1. division
- Historien om den engelske landstrænerjagt med fokus på Sam Allardyce
- Interview med EM-helt og ny Randers-keeper Hannes Hálldorsson
- Ugens transferoverblik
- Spiltips
- Resultater |
import { combineReducers } from 'redux';
import form from './form';
import report from './report';
import transaction from './transaction';
import dataImport from './dataImport';
import isMobile from './isMobile';
import isSidebarOpen from './isSidebarOpen';
import settings from './settings';
import sync from './sync';
export default combineReducers({
form,
report,
transaction,
dataImport,
settings,
sync,
isMobile,
isSidebarOpen
});
|
Chorus 706 V is the epitome of a reference, compact bookshelf loudspeaker: a true Focal tradition. Superbly balanced and neutral, its accuracy and definition are ideal for rooms near 20m2 without a drop in perceived volume. |
A coffee, wine and craft beer bar called Pleasant Kafe is in the works at E. Pleasant and N. Jackson streets, on the lower east side.
The cafe will sell items like scones, muffins and yogurt parfaits in the morning and have meat and cheese boards later in the day, said Lorna Stone. She owns the cafe at 1600 N. Jackson St. with her son, Geoffrey, and Eric Seegers. The men's Gato City property management company also owns neighboring homes on the lot. | June 10, 2014»Read Full Blog Post(2) |
Power In The Desert: Ivanpah On The Verge
The giant Ivanpah solar thermal project in the Mojave Desert is now 92 percent complete, developers said this week. The 377-megawatt project consists of three 459-foot-tall towers encircled by arrays of garage-door-sized mirror sets. Those computer-controlled “heliostats” – 153,990 out of 173,500 of which are in place – will reflect the sun onto the receiving towers, heating water to create steam that will drive turbines that produce electricity. |
---
abstract: 'We introduce a new programming language for expressing reversibility, Energy-Efficient Language (Eel), geared toward algorithm design and implementation. Eel is the first language to take advantage of a partially reversible computation model, where programs can be composed of both reversible and irreversible operations. In this model, irreversible operations cost *energy* for every bit of information created or destroyed. To handle programs of varying degrees of reversibility, Eel supports a log stack to automatically trade energy costs for space costs, and introduces many powerful control logic operators including protected conditional, general conditional, protected loops, and general loops. In this paper, we present the design and compiler for the three language levels of Eel along with an interpreter to simulate and annotate incurred energy costs of a program.'
author:
- 'Nirvan Tyagi[^1]'
- Jayson Lynch
- 'Erik D. Demaine'
bibliography:
- 'reversible.bib'
title: 'Toward an Energy Efficient Language and Compiler for (Partially) Reversible Algorithms'
---
Introduction
============
Continued progress in technology has created a world where we are increasingly dependent on computers and computing power. Computer use is greatly increasing and thus becoming a significant energy expenditure for the world. It is estimated that computing consumes more than 3% of the global electricity consumption [@Pavel], growing at a steady rate. Improved energy efficiency of computers translates to savings in money and environmental toll. Additionally, improved energy efficiency would lead to increased longevity of batteries or use of a smaller battery for the same lifespan. This applies most directly to portable devices such as laptops, mobile phones, and watches where battery size and life are of the utmost importance. Finally, improved energy efficiency would lead to faster CPUs. The main bottleneck in increasing clock speeds are cooling constraints. With decreased energy consumption, we can expect to be able to increase CPU speed by roughly the same factor with the same cooling. Given these many motivations, continued improvement of the energy efficiency of computation is an important research field.
**Fundamental limits to efficiency.** If computer energy efficiency continues to progress at a similar rate, we will expect to hit a fundamental limit based in physics and information theory known as Landauer’s limit [@Lan61] within the next 15-60 years. Landauer gives a lower limit for the energy cost of losing one bit of information of $kT\ln 2$ units of energy where $k$ is Boltzmann’s constant and $T$ is temperature: at room temperature $T=20^\circ$C, approximately $2.8\cdot 10^{-21}$ joules or $7.8\cdot 10^{28}$ kilowatt hours. Our current computation systems depend on computing models that require the erasure of information (boolean circuits, random access machines).
**Reversible computation model.** Reversible computation, where the inputs can be recovered from the outputs and no bits of information are lost, is the common approach studied in order to improve computing efficiency beyond Landauer’s limit. In this paper, we consider a variant of the traditional reversible computation model we call *partially* reversible computation [@us], allowing for both reversible and irreversible operations. Traditional models of computation include two main constraints in the asymptotic analysis of algorithms, time and space. However, with the introduction of partially reversible computation, a new natural metric emerges, which we call *energy*. In this model, from Landauer’s principle, reversible computation is free, but creating or destroying bits of information costs energy. The energy cost of an operation is equal to each bit of information created or destroyed and comes from the change in information entropy from inputs to outputs.
**Energy-efficient language (Eel).** We break down the results into two main parts. First, we present a new reversible programming language, Eel. Eel is composed of three language levels with the high-level based on Python and the low-level based on PISA [@Vieri99; @Vieri98]. Eel is the first programming language to take advantage of partially reversible computation. Past research on reversible programming languages has focused on computation which is performed fully reversibly. Eel allows operations to erase bits and incur energy cost. Eel also allows users to indicate operations for reversal and will automatically store the proper information in a log stack (separate from the stack). In addition, we introduce a number of high level control logic operators of varying degrees of reversibility. With the partial reversibility model, Eel brings the time, space, and energy tradeoffs to the forefront.
Second, we present a compiler and interpreter in Java for Eel. We describe the compilation techniques used between the Eel language levels to handle the high level control logic. We also describe the interpreter technique to simulate and annotate the energy costs of program execution. Since general purpose fully-reversible computers are still years away from development, an interpreter that simulates energy costs is valuable for algorithm development and implementation.
Previous Work {#sec:previous-work}
=============
The study of reversible computation to circumvent Landauer’s limit has been a broad area of research for a number of years, ranging from development of reversible hardware, analysis of reversible algorithmic theory, to development of reversible programming languages and computer architecture. The origins of the field can be traced back to Lecerf [@lecerf63] and to Bennett [@Ben73]. Early theory results show that any algorithm can be made reversible with either quadratic space overhead [@Ben89] or with exponential time overhead [@LMT97; @BTV01]. However, it is unknown whether or not any given algorithm can be converted to a reversible version maintaining the same time and space constraints. Some models introduce an algorithmic complexity based on information erased during a computation[@LV96; @us] laying a foundation for partially reversible computing.
Past research on reversible programming languages has focused on fully reversible programming languages and architectures. The first high-level reversible programming languages developed were Janus [@Lutz; @Yoko09] and R[@Fra99]. We understand that there are a set of properties that must be held by all reversible languages [@Yoko08], and that these properties are satisfied in Janus. Fully reversible computer architectures have been built. Pendulum [@Vieri99; @Vieri98], the first reversible architecture built, was introduced along with a reversible low-level instruction set, PISA, which is used as a basic reversible instruction set in many future works. An improved reversible architecture[@Axel07] compatible with PISA introduces a novel technique for handling branches, previously handled with traces, using space to keep track of program counter jumps. Most recently, this architecture has been further improved with the development of Bob [@Thom12] using a slightly modified version of PISA known as BobISA, providing more efficient branch handling and address calculation. The Eel low level language uses an instruction set based on PISA expanded to support irreversible operations.
There exist both a reversible self-interpreter for Janus [@Yoko07] and a partial evaluator for Janus [@Mog11; @Mog12]. There also exist general techniques for compilation between reversible languages [@Axel11] and compilation of regular programs to reversible programs [@Peru99].
Although Eel is still in its early stages of development, it is designed to provide a unique perspective to reversible programming and, specifically, algorithm development. Where Janus is a powerful and mature language for fully reversible programming, the partial reversibility of Eel opens up a whole new set of options for developers. Eel brings forward the tradeoff for irreversible logic between energy cost and space cost in the log stack. Eel introduces new high level control logic operators that represent different options on the energy-space tradeoff spectrum. Additionally, Eel allows for partial reversals of the program for each code block, a useful feature to have for algorithm development. While this is also possible in Janus, it requires a nesting of function calls and uncalls. Overall, the aim of Eel is to provide a reversible language geared toward algorithm design and implementation in a partially reversible model.
Language Design
===============
In this section we discuss some of the design decisions that went into the language. There is an overview of what operations are exposed in each of the three languages written. We also discuss how reversing computation is notated.
Logging and Unrolling {#sec:log-unroll}
---------------------
Eel supports partially reversible programs consisting both of logic blocks that will be reversed and logic blocks that will only be executed in the forward direction. In the high level, to denote a section of code to be reversed, it is placed inside of a `Log` statement to form a log block. The high level is organized into code blocks of varying levels of nesting. An `Unroll` statement indicates the reverse execution of pending log blocks within the block. All log blocks within a code block must be unrolled before exiting to the previous nesting level. This unroll method can be generalized to allow for a more complex unrolling order. See future works section for further discussion.
Some operations in a log block, such as assignments and branching, are not easily reversible. Eel handles these operations by automatically logging information (storing trace information) about the operation using auxilary space when executed in the forward direction. Upon reversal, the logged information is used to reverse the operation and is then zeroed out. The notion of using auxiliary space, or a “history" stack (we call *log stack*), to make irreversible computation reversible has been used in the past for irreversible operations such as memory overwrites and switch branching [@Zul01; @Stod09]. We extend this idea to support higher level control logic operators and see how different assumptions on control logic conditions change what information needs to be logged. A basic example of how the log stack is used for an irreversible assignment operation is in Figure \[fig:unrollexample\]. The assignment operation is irreversible since the information previously stored at the memory location is overwritten. To make the assignment operation reversible, the previous value is stored in and retrieved from the log stack using `LPUSH` and `LPOP` operations. These operations increment and decrement the log pointer and maintain the memory location at the top of the log stack to be zero.
Eel automatically handles logging information for supported control logic operators and irreversible operations, but for more advanced functions additional information may need to be stored. Eel high level provides the `LogPush` command to push an item onto the log stack. `LogPush` can be used to make user-defined functions supported reversibly.
\[fig:unrollexample\]
``` {language="Eel"}
`High Level'
Log:
x += 1
Unroll
`Low Level'
ADD(x,1)
SUB(x,1) //Unroll starts
```
``` {language="Eel"}
`High Level'
Log:
x = 1
Unroll
`Low Level'
LPUSH(x)
ADD(x,1)
SUB(x,1) //Unroll starts
LPOP(x)
```
Language Levels {#sec:lang-levels}
---------------
Eel is designed with three different levels exposing different levels of complexity. The high level language provides a Python-like syntax and common control operators for algorithm development. This is meant to seem familiar and to hide some of the difficulties of working in a partially reversible environment. The intermediate level is stripped down to a simpler set of commands and attempts to resemble working in transdichotomious RAM models of computation. By necessity it also exposes some fairly mechanical parts of execution such as the program and log stacks. It reduces the control logic to a series of jumps. This tries to compromise between readability, clear resource calculations, and expressive power. The low level gives a basic instruction set one might imagine for a semi-reversible computer based off of PISA. Here we have a small number of basic operations where the time, space, and energy costs of each line are clear.
**High Level.** \[sec:high-level\] The high level handles the partial reversibility of Eel with the `Log` and `Unroll` keywords. Placing operations inside of a `Log` block indicates to the compiler that these operations will be reversed. If there is an irreversible operation or control logic operator in a `Log` block, specific information is stored (logged) in the log stack. During an unroll, this information is used to properly reverse the operation and zeroed out.
Variables are not strongly typed and do not have explicit declaration. Instead variables are created the first time they are used. There are interesting questions concerning performance and ease-of-use with respect to typing in reversible programming languages; however, we have not yet been able to explore this substantially.
Basic control logic operators, such as conditionals and loops, are supported at the high level. However, different keywords are used to describe operators of different reversibility. For example, a *protected* conditional is completely reversible and does not require any space in the log, but requires assumptions on the usage of the condition variables. A *general* conditional, with no such assumptions, is not inherently reversible and requires a single bit of information to be stored in the log for reversibility. Table \[tab:high-summary\] summarizes the operators available at the high level and the space required in the log stack to be made reversible. The reversibility of these high level control logic operators is studied in more detail in a companion paper [@us]. In an attempt to simplify the control logic, we note that the current protected operators in the high level provide less expressiveness than other languages such as Janus. However, the intermediate language is fully expressive, and future iterations of the high level can include more complex operators built from the intermediate level. Figure \[fig:highgrammar\] shows the grammar of the high level.
Basic control logic operators, such as conditionals and loops, are supported at the high level. However, different keywords are used to describe operators of different reversibility. For example, a *protected* conditional is completely reversible and does not require any space in the log, but requires assumptions on the usage of the condition variables. A *general* conditional, with no such assumptions, is not inherently reversible and requires a single bit of information to be stored in the log for reversibility. Table \[tab:high-summary\] summarizes the operators available at the high level and the space required in the log stack to be made reversible. The reversibility of these high level control logic operators is studied in more detail in a companion paper [@us]. In an attempt to simplify the control logic, we note that the current protected operators in the high level provide less expressiveness than other languages such as Janus. However, the intermediate language is fully expressive, and future iterations of the high level can include more complex operators built from the intermediate level. Figure \[fig:highgrammar\] shows the grammar of the high level.
\[fig:highgrammar\]
<program> ::= <b> block
<b> ::= <s>\* statement sequence
<s> ::= $x$ ${\otimes}{=}$ <e> | $x =$ <e> assignment ‘PIf’( <e> ): <b> (‘Else’: <b>)? protected conditional ‘If’( <e> ): <b> (‘Else’: <b>)? general conditional ‘PFor’( <s>, <e>, <s> ): <b> protected for loop ‘For’( <s>, <e>, <s> ): <b> general for loop ‘While’( <e> ): <b> general while loop ‘Def’ $q(x, \ldots, x)$: <b> function definition $q(x, \ldots, x)$ function call ‘Log’: <b> log block ‘Unroll’ unroll
<e> ::= $c$ | $x$ | <e> $\odot$ <e> expression
<$\otimes$> ::= $+$ | $-$ | $*$ operators
<$\odot$> ::= $\otimes$ | / | $\leq$ | $\geq$ | $\neq$ | $==$
----------------------- ------------------------ ---------------------- ----------------------
Protected Conditional `PIf`(cond) $0$ \[sec:conditionals\]
General Conditional `If`(cond) $1$ \[sec:conditionals\]
Protected For loop `PFor`(init,cond,incr) $0$ \[sec:loops\]
General For loop `For`(init,cond,incr) $\lceil\lg{l}\rceil$ \[sec:loops\]
General While loop `While`(cond) $\lceil\lg{l}\rceil$ \[sec:loops\]
Function call `Def fxnName`(args) $0$ \[sec:fxns\]
Log Block `Log` \[sec:log-unroll\]
Unroll `Unroll` \[sec:log-unroll\]
----------------------- ------------------------ ---------------------- ----------------------
: Summary of high level control keywords and the amount of space in the log stack required to make reversible if appearing in a log block.[]{data-label="tab:high-summary"}
**Intermediate Level.** \[sec:int-level\] The Eel intermediate language breaks down the high level control logic into jumps and labels. Jumps and labels are separated into two categories: *protected* jumps and *general* jumps. Protected jumps (`PGoto`, `PGotoIf`, `PGotoIfN`) are fully reversible and require no additional space in log stack. A protected conditional jump takes in a forward condition and a backward condition. It uses the assumption that the forward condition will always evaluate the same in the forward direction as the backwards condition in the reverse direction. General jumps (`Goto`, `GotoIf`, `GotoIfN`) do not require this assumption and log a bit in order to reverse. Both protected jumps and general jumps must be paired with a corresponding destination protected label or general label. Jumps and labels have a $1:1$ correspondence.
One strength of the intermediate language lies in the flexibility and variety of the jump operations. Common control logic operators of the high level can be broken down to a simple combination of protected and general jumps. This also allows new operators for the high level to be easily defined in the intermediate language without needing to touch the low level assembly-like code. Figure \[fig:intgrammar\] shows the grammar of the intermediate language.
\[fig:intgrammar\]
<program> ::= <b> block
<b> ::= <s>\* statement sequence
<s> ::= $x$ ${\otimes}{=}$ <e> | $x =$ <e> assignment ‘PGoto’( $l$ ) protected jump ‘PGotoIf’( <e>, <e>, $l$ ) ‘PGotoIfN’( <e>, <e>, $l$ ) ‘PLabel’( $l$ ) ‘Goto’( $l$ ) general jump ‘PGotoIf’( <e>, $l$ ) ‘PGotoIfN’( <e>, $l$ ) ‘Label’( $l$ ) ‘Def’ $q(x, \ldots, x)$ function definition ‘Call’ $q(x, \ldots, x)$ function call ‘Log’: <b> log block ‘Unroll’ unroll ‘LogPush’($x$) log stack modification
<e> ::= $c$ | $x$ | <e> $\odot$ <e> expression
<$\otimes$> ::= $+$ | $-$ | $*$ operators
<$\odot$> ::= $\otimes$ | / | $\leq$ | $\geq$ | $\neq$ | $==$
**Low Level.**\[sec:low-level\] The low level language consists of basic assembly-level instructions that are assumed to be built into a reversible machine. Since Eel is designed for a partial reversibility model, a number of irreversible operations are also supported. Table \[tab:low-summary\] lists the operations available at the low level. Jump operations are completely reversible and require every Goto instruction to be paired with the corresponding Comefrom instruction (`GOTOIFN` with `CMFRMIFN`). The comefrom statement is necessary in instructing the machine on bookkeeping of the program counter during jumps.
The low level also introduces various “special" memory locations that are reserved for specific uses. These are the program counter (`pc`), log pointer (`lp`), and stack pointer (`sp`).
[|l|l|]{} &\
\
`ADD`$(a,b)$ & $a += b$\
`SUB`$(a,b)$ & $a -= b$\
`MULT`$(a,b)$ & $a *= b$\
`NEG`$(a)$ & $a *= -1$\
`SWAP`$(a,b)$ & values $a$ and $b$ swap\
`LPUSH`$(x)$ & push $x$ to log stack\
`LPOP`$(x)$ & pop $x$ from log stack\
`PUSH`$(x)$ & push $x$ to stack\
`POP`$(x)$ & pop $x$ from stack\
[|l|l|]{}\
`MOVE`$(a,b)$ & $a = b$\
`AND`$(a,b)$ & $a = a\wedge b$\
`OR`$(a,b)$ & $a = a\vee b$\
\
`GOTO`$(l)$ & jump to $l$\
`GOTOIF`$(b,l)$ & jump to $l$ if $b$\
`GOTOIFN`$(b,l)$ & jump to $l$ if not $b$\
`CMFRM`$(l)$ & comefrom $l$\
`CMFRMIF`$(b,l)$ & comefrom $l$ if $b$\
`CMFRMIFN`$(b,l)$ & comefrom $l$ if not $b$\
Correct Program Conventions {#sec:convention}
===========================
An Eel program is a code block of a sequence of statements. Statements consist of various operations and control logic which themselves can contain code blocks nested within. We model the statement execution flow of a code block as a series of forward blocks, log blocks, and unroll statements. Unroll statements trigger the reverse execution of all “un-reversed" log blocks in the code block executed prior to the statement. If there are no pending log blocks, the Unroll statement is skipped. Every log block must be unrolled before the end of the block (synonymous to putting an unroll statement at the end of every block).
Call the set of all forward blocks, log blocks, and unrolls in a code block, $\mathcal{B}$. Let $\mathcal{B} = \mathcal{R} \: \cup \: \mathcal{F} \: \cup \: \mathcal{U}$ be the union of three distinct sets $r \in \mathcal{R}$ of log blocks, $f \in \mathcal{F}$ of forward blocks, and $u \in \mathcal{U}$ of unrolls. Every element $r$ has an element in $\mathcal{U}$ corresponding to the unroll that triggers the reverse execution of $r$, notated by $u_r$. Note that a single $u$ can satisfy the reverse execution of many $r$. The set $\mathcal{B}$ has a strict universal ordering where for all $b_i, b_j \in \mathcal{B}$, $b_i \prec b_j$ if $b_i$ occurs first in the Eel program.
Every block $b$ can be modeled as taking an input set of variables $V(b)$, executing block code, and returning the same set of variables with potentially modified values. The input and output *values* of the variables are denoted $\mathcal{V}_{in}(b)$ and $\mathcal{V}_{out}(b)$. We also care about the subset of these variables that were modified, denoted by $V_{mod}(b)$. For guaranteed correct reversal of log block $r$, we desire that $\mathcal{V}_{out}(r) = \mathcal{V}_{in}(u_r)$. To receive this property, all forward blocks between $r$ and $u_r$ must not irreversibly modify any of the variables $V(r) = V(u_r)$.
$$\forall r \: \forall f \;\;\; (\: r \prec f \prec u_r \:) \;\; \to \;\; \big( \: V(r) \cup V_{mod}(f) \: = \: \emptyset \: \big)$$
In addition to the variable modification among blocks, for a log block to be correctly reversed, control logic *within* the block must be correct. This means that the requirements for all protected conditionals and for loops are satisfied. In protected conditionals, the variables in the condition cannot be modified within the conditional. In protected for loops, the variable controlling the loop cannot be modified within the loop.
It is possible for users to purposefully break these rules and still create a program that compiles and executes as they wanted. However, this requires careful variable bookkeeping and falls outside the intended use cases of the language.
Control Logic Operators {#sec:control-logic}
=======================
Eel supports conditionals, loops, and function calls in the high level. These control logic operators are handled reversibly using the log stack. Since these operators are largely broken down in the intermediate level, we start by examining the reversibility of the jump operations. High level control operators are then built directly from intermediate jump operations, avoiding the low level. Examples are given using a log block followed by an unroll, but in general, the unroll statement need not directly follow the log block. The compilation of control logic outside of a log block is not shown here since it does not use the log stack and is compiled standardly. We note that the incorrect use of control logic and log blocks can result in an incorrect reversal and we examine this issue in the Correct Program Conventions section.
Jumps {#sec:jumps}
-----
The jump operations of the intermediate level are the building blocks for all of the high level control logic operators. The jump operations are divided into two main classes, protected jumps (fully reversible) and general jumps (require 1 logged bit). Because of their reversibility assumptions, these two classes are semantically different and are compiled differently.
Jumps are paired with labels of the same class (protected or general). In our design, we require a one-to-one pairing of jumps to labels. It is possible to support a many-to-one matching of jumps to labels, but additional information is required to be logged for reversal. Both classes support conditional jumps which use the suffixes `If` and `IfN` corresponding to jumping if the condition is non-zero or zero respectively.
In the low level, jumps can be performed by a reversible update to the program counter (`pc`). However, by allowing changes to the program counter, we can no longer assume every line was reached from the previous line by an increment to the `pc`. This creates an irreversible situation. To deal with this, every jump instruction is paired with a comefrom instruction. The Comefrom statement is used to properly handle the manipulation of the `pc`. Since the jump requires the manipulation of the `pc`, one might imagine this value being swapped or copied and manipulated. The comefrom statement performs the necessary cleaning of that value. This is necessary within the computer but not exposed at the assembly level, which is why the Comefrom simply appears to be a label or no-op.
**Protected jumps.** \[sec:protected-jumps\] Protected jumps are fully reversible and do not use any space in the log stack. A *protected* jump contains a “backward" condition which can be evaluated in the reverse direction to indicate whether the jump was executed in the forward direction.
Consider the protected conditional jump (`PGotoIf`). It takes the form:\
`PGotoIf(fwdcond, bwdcond, label)`. In the forward direction, if the forward condition is true, jump to `label`. Upon reaching the label location when reversing, if the backward condition is true, jump to original jump start location. This gives the requirement that the backward condition evaluates to true if and only if the forward condition evaluated to true for the proper code to be reversed. With this assumption, we can evaluate the backward condition to determine if the jump was executed in the forward direction without additional information stored in the log stack.
**General jumps.** \[sec:general-jumps\] General jumps are used when the condition evaluated to decide the execution of the jump in the forward direction is not preserved and thus cannot be re-evaluated in the backward direction. In this case, we log a bit of information to the log stack to represent whether or not the jump was executed. A general jump takes the form: `GotoIf(cond, label)` where the jump to `label` is executed if `cond` is true.
In the forward direction, every time a label is reached, it was the result of either (1) increment from the line above or (2) the execution of a jump. In case (1), a 0-bit is logged, and in case (2), a 1-bit is logged. Therefore in the reverse direction, whenever a label is reached, the top bit of the log stack indicates whether to reverse the jump.
Conditional statements {#sec:conditionals}
----------------------
Eel high level distinguishes between two types of conditional statements, *protected* conditionals and *general* conditionals. In a protected conditional, the condition variables are not modified within the conditional statement.
Protected conditionals are implemented reversibly using protected jumps. If the condition variables are not modified within the conditional statement, the condition can be reevaluated after the execution of the conditional to see if the statement was executed. Thus, the condition can be used as both the forward condition and backward condition of the intermediate level protected jump. Note that this is a stronger assumption than the protected jump in the intermediate language which separates the forward and backward conditions. Figure \[fig:protected-conditional\] shows an example of an unsatisfied protected conditional.
The implementation of general conditionals is analogous to protected conditionals. Because the condition is subject to change in the conditional statement, the value of the condition is logged upon forward execution. This logged value is used in the backward direction to determine if the conditional statement was executed.
``` {language="Eel"}
`High Level - Unsatisfied Protected Conditional'
Log:
x = 1
PIf(x):
x -= 1
[logic block]
Unroll
```
For and While loops {#sec:loops}
-------------------
Eel high level distinguishes between two types of for loops, *protected* for loops and *general* for loops. Protected for loops use no space in the log stack. Figure \[fig:protected-for\] shows the compilation of a protected for loop. General for loops require the number of loop iterations $l$ to be logged using $\lg{l}$ bits in the log stack.
A protected for loop takes the form: `PFor(init(x), cond(x), incr(x))`. An initial value `init(x)`, a terminating expression `cond(x)`, and a reversible incrementation function `incr(x)`. A protected for loop requires (1) the incrementation function `incr(x)` is the only modifier to `x` in the loop, and (2) the termination condition `cond(x)` is determined only by `x` and no other modified variables in the loop. With these assumptions, a protected for loop can be implemented fully reversibly. The protected for loop can be undone by reversing the incrementation function and unrolling each loop until `x` matches the initialization value. Protected jumps are used to implement the protected for loop with no space in log stack.
``` {language="Eel"}
`Protected For Loop'
`High Level'
Log:
PFor(init(x), cond(x), incr(x)):
[loop logic block]
[end logic block]
Unroll
```
``` {language="Eel"}
`Intermediate Level'
Log:
init(x)
PLabel(start-label) //checks if x == init
PGotoIfEq(cond(x), cond(x), end-label) //ends if cond(x)
[loop logic block]
incr(x) //increments x
PGotoIfNeq(x != init, x != init, start-label) //loops
PLabel(end-label)
[end logic block]
Unroll
```
A general for loop is of the form: `For(init(), cond(), incr())`. The general for loop keeps track of the number of loop iterations $l$ in the forward direction. It does not rely on the initialization variable being protected, only that the loop terminates. However, if we use general jumps, a bit of information is stored per loop and $l$ space in the log stack is required. Instead, we maintain and store a separate loop counter in the log stack using $\lg{l}$ bits. Protected jumps are then used with the general for loop condition in the forward direction and decrementation of the loop counter in the backward direction. Figure \[fig:general-for\] shows the compilation of a general for loop. General while loops are handled in the same way as general for loops. The initialization variable and incrementation function are disregarded.
``` {language="Eel"}
`General For Loop'
`High Level'
Log:
For(init(), cond(), incr()):
[loop logic block]
[end logic block]
Unroll
```
``` {language="Eel"}
`Intermediate Level'
Log:
init()
l = 0
PLabel(start-label)
PGotoIfEq(cond(), cond(), end-label) //ends loop if cond()
[loop logic block]
incr() //incrementation function
l += 1 //increment loop counter
PGotoIfEq(l > 0, l > 0, start-label) //restarts loop
PLabel(end-label)
LPush(l) //push loop counter to log
[end logic block]
Unroll
```
Function calls {#sec:fxns}
--------------
Reversible function calls are handled in a similar manner to normal ones. The function arguments and return pointer are pushed to the regular stack. The arguments are passed by reference, so changes to a variable effect it outside the scope of the function unless a local copy is made. Different from normal functions, for every reversible function in the high level, two versions of the function are created in the low level. One is the regular function used in the forward direction, while the other is the unrolled version used in the backward direction to reverse. Since the locations of these functions are known, protected jumps can be used to enter and exit. Thus, functions require no additional space in the log stack than what is needed for the function logic itself. Eel functions use a pointer passing parameter model taking in and modifying parameter memory locations. Figure \[fig:fxn-call\] shows the compilation of a function call.
``` {language="Eel"}
`Function Call'
`High Level'
Def FXN(x):
[fxn logic block]
Log:
[logic block 1]
FXN(x)
[logic block 2]
Unroll
```
``` {language="Eel"}
`Intermediate Level'
Def FXN(x):
[fxn logic block]
Log:
[logic block 1]
Call FXN(x)
[logic block 2]
Unroll
```
``` {language="Eel"}
`Low Level'
//Def FXN(x): //FXN-start
CMFRM(mem[sp-1]) //where fxn was called from
ADD(x, mem[sp-2]) //pulls input from stack
[fxn logic block]
GOTO(mem[sp-1]) //returns to program
//FXN-end
//Def RFXN(x): //RFXN-start
CMFRM(mem[sp-1]) //where fxn was called from
ADD(x, mem[sp-2]) //pulls input from stack
[reverse fxn logic block]
GOTO(mem[sp-1]) //returns to program
//RFXN-end
[logic block 1]
PUSH(x)
PUSH(A)
GOTO(FXN-start) //jump to fxn
CMFRM(FXN-end) //A
POP(A)
POP(x)
[logic block 2]
[reverse of logic block 2] //Unroll starts
PUSH(x)
PUSH(B)
GOTO(RFXN-start) //jump to reverse fxn
CMFRM(RFXN-end) //B
POP(B)
POP(x)
[reverse of logic block 1]
```
Energy Simulation {#sec:energy}
=================
Since we can’t actually run our code on a semi-reversible computer, we add additional annotation to estimate the energy cost of our programs. We find this useful in two directions. First, comparing our results against theoretical predictions of the energy cost and scaling of algorithms allows us to check for inefficiencies in the compiler. Second, if our code only uses well examined transformation we can use an implementation of an algorithm as a check against the analysis of its time, space, and energy complexity.
The energy costs for an operation are defined by the change in entropy or information across the inputs to the outputs. In particular, we follow the model used in [@us] where one calculates $\log \left(\frac{I}{O} \right)$ Where $I$ is the size of the input space of the function and $O$ is the size of the output space of the function. This means the energy cost only depends on the instructions being called, not on the values being passed into that function. For example, this would mean an irreversible AND of two bits would always be charged $1$ unit of energy, even though an output of $0$ would tell us that both inputs had to be $0$. The appropriateness of this model either in an exact, or average case setting will depend on details of the computer architecture.
In high level programming languages, energy costs are hard to calculate since they are masked by high level control logic and complex expressions. One of the reasons Eel is designed to have multiple levels of compilation is to reveal these energy costs in the lower levels. The simplest way to calculate energy costs is in the low level language. Here the input and output spaces are small and the energy cost can be calculated on a line by line basis. Each instruction modifies only one input and since we have a restricted instruction set, each instruction’s energy cost is individually evaluated. At the low level, instructions are batched into two different energy costs, 0 and $w$, where $w$ is the word size.
After calculating energy cost per line at the level, the compiler can backtrack to the intermediate and high level language and annotate each line with the costs incurred by the corresponding generated low/intermediate lines. The simulation takes the same time and space requirements of running the actual program. The annotation takes the form, `(E, L)`, representing the energy cost and space in log stack cost respectively. Logic in log blocks will incur no energy cost and instead may incur log stack cost. Conversely, logic not in log blocks will not incur any log stack cost, but may incur energy cost.
Conclusion and Future Work
==========================
Eel is a new reversible programming language that supports a partially reversible model. The key contributions of this project are as follows:
1. Development of Eel (language + compiler) and description of three language levels.
2. Introduction of the log stack as a way to make design decisions between energy cost and space cost.
3. Introduction of new high-level control logic and compilation techniques for protected conditional, general conditional, protected loops, and general loops.
4. Development of an interpreter for energy simulation and annotation.
Eel is intended to be a prototype for what partially-reversible languages may look like in the future, and to serve as a platform for the development of partially-reversible algorithms. A programming language allows us to be precise about the computations being done and serves as a platform to help verify theoretical results about partial reversibility. Because many usual programming assumptions do not hold in this model, working with Eel can help build new intuition. With the goal of algorithm development in mind, Eel has included annotation of estimated time, space, and energy costs of programs. Through the development of the Eel language and compiler, we have built a strong foundation upon which future research and development of reversible algorithms can be conducted. Once a few more important features are added, the ability to actually run algorithms and count the resource usage of a program will give a powerful tool for checking algorithmic results.
Several further features are necessary to achieve these goals of being a tool for algorithmic design and a prototype language for a future computing environment. First, the implementation of standard data structures are necessary for many algorithms. Many of the results for efficient data structures [@us] in the partially reversible model are themselves not obvious and their implementation would also be a good confirmation of those results. Second, we would like to implement some of the memory management and garbage collection algorithms which have been developed. Third, only a simple version of log and unroll was implemented, which does not contain as much expressive power as we might want. Currently, the language only allows unrolling log blocks in order, but especially in data structures, we would like to be able to unroll code in dynamic orders. This extension could be implemented with multiple log stacks, or a more complicated data structure underlying the log and unroll system. Fourth, some of the transformations performed by the compiler lack optimization, and thus may make an algorithm seem less efficient than anticipated. A final practical direction is to consider hybrid programming models which mix standard irreversible computation with reversible core subroutines, for use in a future hybrid architecture combining traditional CPUs with a reversible accelerator or co-processor.
**Acknowledgements.** We thank Geronimo Mirano for useful discussion in differentiating and developing our language levels. We also thank Maria L. Messick and Licheng Rao for help in early programming of the Eel compiler.
[^1]: MIT Computer Science and Artificial Intelligence Laboratory, 32 Vassar Street, Cambridge, MA 02139, USA, [{edemaine,jaysonl,geronm,ntyagi}@mit.edu]({edemaine,jaysonl,geronm,ntyagi}@mit.edu). Supported in part by the MIT Energy Initiative and by MADALGO — Center for Massive Data Algorithmics — a Center of the Danish National Research Foundation.
|
Scrap new land transaction rules: Social Democratic Party of India
Members of the Social Democratic Party of India gathered in protest on Saturday to demand that the government abolish Form 9 and Form 11 (that deal with taxes and other fees while transacting land) of the Karnataka Panchayat Raj Rules.
Akbar Ali, SDPI District General Secretary, said the present regulations, which have been applied for areas coming under Mangalore Urban Development Authority here, have made it “nearly impossible” to buy, sell, convert or develop land.
“The rule is causing numerous problems in the district where there are many marginal landowners,” he said. Landowners and buyers have to already contend with 11-e map, power of attorney, stamping rules among others, and this has only added to their problems, said the protesters.
According to the party, the new rules view the land as a “single layout”. “If you have one acre of land, 45 per cent of it should be garden, parking, roads, among others.
“Permission of MUDA was required for conversion of agricultural land, or handing over of land as inheritance. Records of rights, tenancy and crops have to be taken from taluk office, while documents should be given to the local gram panchayat (under MUDA limits). Because of this, a marginal farmer has to run to various departments to collect various documents. The law does not make any sense here,” said Mr. Ali. |
Kill the Messenger
Jeremy Renner, Mary Elizabeth Winstead and Rosemarie DeWitt star in the dramatic thriller Kill the Messenger, inspired by the books ‘Kill the Messenger’ by Nick Schou and ‘Dark Alliance’ by Gary Webb. Check out the movie trailer, photos and movie poster below. A reporter becomes the target of a vicious smear campaign after he exposes the CIA’s role in arming Contra rebels.
Plot Summary
Two-time Academy Award nominee Jeremy Renner stars as Gary Webb, the real-life dedicated reporter for The San Jose Mercury-News. In the 1990s, Webb uncovered the Central Intelligence Agency’s role in importing cocaine into California that was sold to raise money for the Nicaraguan Contras rebel army. Supported by his wife and children, Webb pursued the story and went public with his evidence. When targeted for a vicious smear campaign by the CIA and rival journalists, Webb found himself fighting for his reputation and his family. |
from ..builder import DETECTORS
from .single_stage import SingleStageDetector
@DETECTORS.register_module()
class RetinaNet(SingleStageDetector):
"""Implementation of `RetinaNet <https://arxiv.org/abs/1708.02002>`_"""
def __init__(self,
backbone,
neck,
bbox_head,
train_cfg=None,
test_cfg=None,
pretrained=None):
super(RetinaNet, self).__init__(backbone, neck, bbox_head, train_cfg,
test_cfg, pretrained)
|
<?php
/**
* Copyright © Magento, Inc. All rights reserved.
* See COPYING.txt for license details.
*/
namespace Magento\CatalogSearch\Test\Unit\Model\Search;
use Magento\Catalog\Model\ResourceModel\Product\Attribute\CollectionFactory;
use Magento\CatalogSearch\Model\Adapter\Mysql\Filter\AliasResolver;
use Magento\Framework\Search\Request\FilterInterface;
use Magento\Framework\Search\Request\QueryInterface;
use \Magento\Framework\TestFramework\Unit\Helper\ObjectManager;
use Magento\CatalogSearch\Model\Search\FiltersExtractor;
use Magento\CatalogSearch\Model\Search\FilterMapper\FilterStrategyInterface;
use Magento\Framework\App\Config\ScopeConfigInterface;
use Magento\Framework\Search\Request\Filter\Term;
/**
* Test for \Magento\CatalogSearch\Model\Search\TableMapper
*
* @SuppressWarnings(PHPMD.CouplingBetweenObjects)
* @deprecated
* @see \Magento\ElasticSearch
*/
class TableMapperTest extends \PHPUnit\Framework\TestCase
{
/**
* @var AliasResolver|\PHPUnit_Framework_MockObject_MockObject
*/
private $aliasResolver;
/**
* @var \Magento\CatalogSearch\Model\Search\TableMapper
*/
private $tableMapper;
/**
* @var FiltersExtractor|\PHPUnit_Framework_MockObject_MockObject
*/
private $filterExtractorMock;
/**
* @var FilterStrategyInterface|\PHPUnit_Framework_MockObject_MockObject
*/
private $filterStrategy;
protected function setUp()
{
$objectManager = new ObjectManager($this);
$resource = $this->getMockBuilder(\Magento\Framework\App\ResourceConnection::class)
->disableOriginalConstructor()
->getMock();
$storeManager = $this->getMockBuilder(\Magento\Store\Model\StoreManagerInterface::class)
->disableOriginalConstructor()
->getMock();
$attributeCollectionFactory = $this->getMockBuilder(CollectionFactory::class)
->setMethods(['create'])
->disableOriginalConstructor()
->getMock();
$eavConfig = $this->getMockBuilder(\Magento\Eav\Model\Config::class)
->setMethods(['getAttribute'])
->disableOriginalConstructor()
->getMock();
$scopeConfig = $this->getMockBuilder(ScopeConfigInterface::class)
->disableOriginalConstructor()
->getMockForAbstractClass();
$this->aliasResolver = $this->getMockBuilder(AliasResolver::class)
->disableOriginalConstructor()
->getMock();
$this->filterExtractorMock = $this->getMockBuilder(FiltersExtractor::class)
->disableOriginalConstructor()
->getMock();
$this->filterStrategy = $this->getMockBuilder(FilterStrategyInterface::class)
->disableOriginalConstructor()
->getMockForAbstractClass();
$this->tableMapper = $objectManager->getObject(
\Magento\CatalogSearch\Model\Search\TableMapper::class,
[
'resource' => $resource,
'storeManager' => $storeManager,
'attributeCollectionFactory' => $attributeCollectionFactory,
'eavConfig' => $eavConfig,
'scopeConfig' => $scopeConfig,
'filterStrategy' => $this->filterStrategy,
'aliasResolver' => $this->aliasResolver,
'filtersExtractor' => $this->filterExtractorMock
]
);
}
public function testRequestHasNoFilters()
{
$select = $this->getSelectMock();
$request = $this->getRequestMock();
$query = $this->getQueryMock();
$request
->method('getQuery')
->willReturn($query);
$this->filterExtractorMock
->method('extractFiltersFromQuery')
->with($query)
->willReturn([]);
$this->aliasResolver
->expects($this->never())
->method('getAlias');
$this->filterStrategy
->expects($this->never())
->method('apply');
$this->tableMapper->addTables($select, $request);
}
public function testRequestHasDifferentFilters()
{
$select = $this->getSelectMock();
$request = $this->getRequestMock();
$query = $this->getQueryMock();
$filters = $this->getDifferentFiltersMock();
$request
->method('getQuery')
->willReturn($query);
$this->filterExtractorMock
->method('extractFiltersFromQuery')
->with($query)
->willReturn($filters);
$consecutiveFilters = array_map(
function ($filter) {
return [$filter];
},
$filters
);
$this->aliasResolver
->expects($this->exactly(count($filters)))
->method('getAlias')
->withConsecutive(...$consecutiveFilters)
->willReturnCallback(
function (FilterInterface $filter) {
return $filter->getField() . '_alias';
}
);
$consecutiveFilters = array_map(
function ($filter) use ($select) {
return [$filter, $select];
},
$filters
);
$this->filterStrategy
->expects($this->exactly(count($filters)))
->method('apply')
->withConsecutive(...$consecutiveFilters)
->willReturn(true);
$this->tableMapper->addTables($select, $request);
}
public function testRequestHasSameFilters()
{
$select = $this->getSelectMock();
$request = $this->getRequestMock();
$query = $this->getQueryMock();
$filters = $this->getSameFiltersMock();
$uniqueFilters = [$filters[0], $filters[2]];
$request
->method('getQuery')
->willReturn($query);
$this->filterExtractorMock
->method('extractFiltersFromQuery')
->with($query)
->willReturn($filters);
$consecutiveFilters = array_map(
function ($filter) {
return [$filter];
},
$filters
);
$this->aliasResolver
->expects($this->exactly(count($filters)))
->method('getAlias')
->withConsecutive(...$consecutiveFilters)
->willReturnCallback(
function (FilterInterface $filter) {
return $filter->getField() . '_alias';
}
);
$consecutiveUniqueFilters = array_map(
function ($filter) use ($select) {
return [$filter, $select];
},
$uniqueFilters
);
$this->filterStrategy
->expects($this->exactly(count($uniqueFilters)))
->method('apply')
->withConsecutive(...$consecutiveUniqueFilters)
->willReturn(true);
$this->tableMapper->addTables($select, $request);
}
public function testRequestHasUnAppliedFilters()
{
$select = $this->getSelectMock();
$request = $this->getRequestMock();
$query = $this->getQueryMock();
$filters = $this->getSameFiltersMock();
$request
->method('getQuery')
->willReturn($query);
$this->filterExtractorMock
->method('extractFiltersFromQuery')
->with($query)
->willReturn($filters);
$consecutiveFilters = array_map(
function ($filter) {
return [$filter];
},
$filters
);
$this->aliasResolver
->expects($this->exactly(count($filters)))
->method('getAlias')
->withConsecutive(...$consecutiveFilters)
->willReturnCallback(
function (FilterInterface $filter) {
return $filter->getField() . '_alias';
}
);
$consecutiveFilters = array_map(
function ($filter) use ($select) {
return [$filter, $select];
},
$filters
);
$this->filterStrategy
->expects($this->exactly(count($filters)))
->method('apply')
->withConsecutive(...$consecutiveFilters)
->willReturnCallback(
function (FilterInterface $filter) {
return !($filter->getName() === 'name1' || $filter->getName() === 'name3')
? true
: false;
}
);
$this->tableMapper->addTables($select, $request);
}
/**
* @return \PHPUnit_Framework_MockObject_MockObject
*/
private function getSelectMock()
{
return $this->getMockBuilder(\Magento\Framework\DB\Select::class)
->disableOriginalConstructor()
->getMock();
}
/**
* @return \PHPUnit_Framework_MockObject_MockObject
*/
private function getRequestMock()
{
return $this->getMockBuilder(\Magento\Framework\Search\RequestInterface::class)
->disableOriginalConstructor()
->getMock();
}
/**
* @return \PHPUnit_Framework_MockObject_MockObject
*/
private function getQueryMock()
{
return $this->getMockBuilder(QueryInterface::class)
->disableOriginalConstructor()
->getMockForAbstractClass();
}
/**
* @return array
*/
private function getDifferentFiltersMock()
{
$visibilityFilter = $this->getMockBuilder(Term::class)
->setConstructorArgs(['name1', 'value1', 'visibility'])
->setMethods(null)
->getMock();
$customFilter = $this->getMockBuilder(Term::class)
->setConstructorArgs(['name2', 'value2', 'field1'])
->setMethods(null)
->getMock();
$nonCustomFilter = $this->getMockBuilder(Term::class)
->setConstructorArgs(['name3', 'value3', 'field2'])
->setMethods(null)
->getMock();
return [$visibilityFilter, $customFilter, $nonCustomFilter];
}
/**
* @return array
*/
private function getSameFiltersMock()
{
$visibilityFilter1 = $this->getMockBuilder(Term::class)
->setConstructorArgs(['name1', 'value1', 'visibility'])
->setMethods(null)
->getMock();
$visibilityFilter2 = $this->getMockBuilder(Term::class)
->setConstructorArgs(['name2', 'value2', 'visibility'])
->setMethods(null)
->getMock();
$customFilter1 = $this->getMockBuilder(Term::class)
->setConstructorArgs(['name3', 'value3', 'field1'])
->setMethods(null)
->getMock();
$customFilter2 = $this->getMockBuilder(Term::class)
->setConstructorArgs(['name4', 'value4', 'field1'])
->setMethods(null)
->getMock();
return [$visibilityFilter1, $visibilityFilter2, $customFilter1, $customFilter2];
}
}
|
7: Bank protection is in need of minor repairs. River control devices and embankment protection have a little minor damage. Banks and/or channel have minor amounts of drift.
Culverts
7: Shrinkage cracks, light scaling, and insignificant spalling which does not expose reinforcing steel. Insignificant damage caused by drift with no misalignment and not requiring corrective action. Some minor scouring has occurred near curtain walls, wingwalls, or pipes. Metal culverts have a smooth symmetrical curvature with superficial corrosion and no pitting.
Waterway Adequacy:
7: Slight chance of overtopping bridge deck and roadway approaches.
Approach Roadway Alignment:
7: Better than present minimum criteria
Bridge Posting
No posting required: Equal to or above legal loads
Scour Critical Bridges:
8: Bridge foundations determined to be stable for assessed or calculated scour conditions; calculated scour is above top of footing.
Bridge Railings:
1: Inspected feature meets currently acceptable standards.
Transitions:
1: Inspected feature meets currently acceptable standards.
Approach Guardrail:
1: Inspected feature meets currently acceptable standards.
Approach Guardrail Ends:
1: Inspected feature meets currently acceptable standards.
Historical significance:
4: Historical significance is not determinable at this time.
Type of Work Proposed:
Replacement of bridge or other structure because of substandard load carrying capacity or substandard bridge roadway geometry.
Work Done By:
Work to be done by contract
Length of Structure Improvement:
1.40 meters
Bridge Improvement Cost
$348,000
Roadway Improvement Cost
$35,000
Total Project Cost
$383,000
Year of Improvement Cost Estimate:
2017
More Information
Designated Level of Service
Mainline
Route Number:
05017
Inventory Route/Min Vert Clearance:
1.00 meters
LRS Inventory Route:
000CO50170
Bypass/Detour Length:
0.00 kilometers
Toll:
On free road. The structure is toll-free and carries a toll-free highway. |
386 P.2d 396 (1963)
Francis Carter BRADSHAW, Appellant,
v.
BLYSTONE EQUIPMENT CO. OF NEVADA, a Nevada corporation, Respondent.
No. 4624.
Supreme Court of Nevada
November 7, 1963
Rehearing Denied December 2, 1963.
Robert Callister, Las Vegas, Belli, Ashe & Gerry and Lawrence H. Stotter, San Francisco, Cal., for appellant.
Vargas, Dillon & Bartlett and Alex. A. Garroway, Reno, for respondent.
*397 McNAMEE, Justice.
This is an appeal from an order granting respondent's motion, made pursuant to NRCP 50(b), to set aside a verdict and judgment based thereon in favor of appellant and to have judgment entered in respondent's favor.
Appellant sought damages in the court below for personal injuries suffered by him resulting in the loss of his right arm when his clothes became enmeshed in the mechanism of a posthole digger he had rented from respondent.
The first cause of action charges respondent with negligence in renting the equipment to appellant who was unskilled in the use thereof and which equipment was not reasonably safe for its intended use. It is further alleged therein that respondent failed to give appellant safety instructions or warning concerning the danger of the open universal joint of said driller.
The second cause of action alleges that the respondent negligently failed to warn appellant of the danger of the driller's open universal joint when respondent knew, or should have known, of the danger to persons unskilled in the use of such equipment.
The third cause of action is for breach of implied warranty of fitness.
The answer denies negligence and the breach of any implied warranty, and alleges as affirmative defenses contributory negligence and assumption of risk.
The case was tried before a jury which brought in a verdict in favor of appellant in the sum of $51,786.55. At the same time the jury, to the written interrogatory: "If you find that defendant was negligent, state what the act or acts of negligence of the defendant were," answered: "We the Jury find the defendant guilty of unmindful negligence. In the fact due to extenuating circumstances. Failure to properly instruct Plaintiff the risk of danger."
In his written decision on the motion for judgment notwithstanding the verdict, the learned trial judge stated that the accident occurred on the third occasion Bradshaw had rented and used the machinery. He found that no breach of duty was shown.
The answer to the written interrogatory constitutes a finding by the jury that respondent was negligent in failing to give appellant safety instructions concerning the danger of the open universal joint of the driller. This was one of the acts of negligence alleged in appellant's first cause of action. The jury's finding as to specific negligence absolves the respondent from all other acts of negligence alleged in the complaint or mentioned in the evidence. Long v. Foley, 180 Kan. 83, 299 P.2d 63; Stevens v. Allis-Chalmers Mfg. Co., 151 Kan. 638, 100 P.2d 723.
Even if the answer could be construed as a finding that respondent failed to warn appellant of the risk of danger, there was no duty on the part of respondent to warn appellant of a danger obvious to the user. Annot., 76 A.L.R.2d 28 (1961). A liability based on negligence does not exist in the absence of a breach of duty. Long v. Flanigan Warehouse Company, 79 Nev. 241, 382 P.2d 399.
We are not concerned in this case with an article containing a latent defect in its construction as was the situation in Cosgriff Neon Co. v. Mattheus, 78 Nev. 281, 371 P.2d 819. The accident did not occur as a result of a mechanical defect in operation. There was nothing hidden or concealed about the universal joint or its operation, and as stated before, the accident occurred during the third occasion that appellant had rented and used the equipment. Appellant admitted that he walked within six inches of the universal joint while it was in operation, and both appellant and his partner who, at the time was engaged with appellant in the operation of the machinery, testified that they knew the position of the universal joint and that it was plainly *398 visible. There was no reason for either of the operators to be within any dangerous proximity to the universal joint while it was in operation. Appellant at the time of the accident was a bank official. A person of at least ordinary intelligence is charged with the knowledge that an exposed whirling piece of machinery is dangerous and is to be avoided. The lessor owes no duty under such circumstances to warn the lessee of such an obvious danger. 2 Restatement of Torts § 388, Comment i.
"We have not yet reached the state where a manufacturer is under the duty of making a machine accident proof or foolproof. Just as the manufacturer is under no obligation, in order to guard against injury resulting from deterioration, to furnish a machine that will not wear out, see Auld v. Sears, Roebuck & Co., 288 N.Y. 515, 41 N.E.2d 927, affirming 261 App.Div. 918, 25 N.Y.S.2d 491, so he is under no duty to guard against injury from a patent peril or from a source manifestly dangerous. To illustrate, the manufacturer who makes, properly and free of defects, an axe or a buzz saw or an airplane with an exposed propeller, is not to be held liable if one using the axe or the buzz saw is cut by it, or if someone working around the airplane comes in contact with the propeller. In such cases, the manufacturer has the right to expect that such persons will do everything necessary to avoid such contact, for the very nature of the article gives notice and warning of the consequences to be expected, of the injuries to be suffered. In other words, the manufacturer is under no duty to render a machine or other article `more' safe as long as the danger to be avoided is obvious and patent to all." Campo v. Scofield, 301 N.Y. 468, 95 N.E.2d 802.
Appellant maintains that even if the manufacturer was not negligent, respondent, as bailor, was negligent in leasing a machine containing an unguarded universal joint when the custom in the industry was to furnish guards. There is no evidence in the record to show what the custom in the industry is with respect to guards for open universal joints, but even if there were such a custom the failure to furnish a guard would not establish liability. Messina v. Clark Equipment Co., 2 Cir., 263 F.2d 291. In that case, the court stated:
"Upon this appeal the plaintiff contends that in this case the allegations and proof of a general standard among manufacturers to provide safety devices for such machines as that involved here, take the case outside the reach of Campo * * *. But we think these cases make it plain that the manufacturer's liability is limited to hidden defects and concealed dangers."
We conclude that the evidence does not as a matter of law sustain the jury's finding in its answer to the written interrogatory that respondent was negligent in failing to give appellant safety instruction, when the danger of the open universal joint while in operation was apparent to the casual observer.
In holding that the judgment for the appellant cannot be sustained on any charge of negligence, we still must determine whether the judgment was proper under the evidence received in support of the cause of action for breach of implied warranty of fitness.
The respondent leased the posthole digger to appellant and his partner for the particular purpose of drilling holes. In doing so, it impliedly warranted the reasonable suitability of the chattel for that purpose. Annot., 68 A.L.R.2d 854 (1959). This is a common-law warranty. Eastern Motor Express v. A. Maschmeijer, Jr., Inc., 2 Cir., 247 F.2d 826, 65 A.L.R.2d 765. There is nothing in the evidence to show that it did not operate in accordance with appellant's known intended use of it. It is not contended that the equipment contained a latent defect or a hidden danger.
"If a manufacturer does everything necessary to make the machine function properly for the purpose for which it is designed, if the machine is without any latent defect, *399 and if its functioning creates no danger or peril that is not known to the user, then the manufacturer has satisfied the law's demands." Campo v. Scofield, supra. To a greater degree is this statement applicable to a lessor of chattels.
The judgment therefore cannot be supported on the ground of a breach of implied warranty of fitness.
The action of the lower court in setting aside the verdict and judgment thereon and entering judgment in favor of respondent was proper.
Order and judgment appealed from affirmed.
BADT, C.J., and THOMPSON, J., concur.
|
Lillian Freiman (artist)
Lillian Freiman (June 21, 1908 - September 6, 1986) was a Canadian painter who studied in Montreal and France before settling in New York City. Influenced by Edgar Degas and Toulouse-Lautrec, she was known for her subtle interpretations of every day people.
Biography
Frieman was born on June 21, 1908 in Guelph, Ontario. After her family moved to Montreal, she attended the Art Association of Montreal and the École des beaux-arts de Montréal where she studied with Edmond Dyonnet, Emmanuel Fougerat and Robert Mahias.
After attending the Art Students League of New York, Freiman moved to France. There she lived in Paris and Brittany, often using the faces of Bretons as the focus of her work. In 1938 Freiman returned to Canada due to the impending outbreak of World War II. She briefly lived in Toronto before moving to New York City in 1939, where her work often featured orchestras and musicians.
Freiman was influenced by French painters Degas and Toulouse-Lautrec. She predominantly worked in oils and pastels and her work, which often focused on people, was known for its personal and sensitive interpretations. At the time of her death Charles Hill, head curator of the Canadian Art at the National Gallery, noted of her work: "There was a reticent and lyrical quality to it and an economy of line, but she avoided making a strong statement."
Freiman died on September 6, 1986, at the age of 78, in New York. Her works are held in collections including the Art Gallery of Ontario, the Agnes Etherington Art Centre and the McMaster Museum of Art.
References
Category:1908 births
Category:1986 deaths
Category:20th-century Canadian women artists
Category:Art Students League of New York alumni
Category:Canadian women painters
Category:École des beaux-arts de Montréal alumni
Category:People from Guelph |
Q:
On select, another select option would appear
I have been searching the internet for hours and tried many things, but I can't seem to get anything of it working, so now I want to ask you.
If I have an select form like this
<div class="form-group">
<label for="InputmainCat">Main category</label>
<select name="InputmainCat" class="form-control">
<option value="1">a</option>
<option value="2">b</option>
<option value="3">c</option>
<option value="4">d</option>
<option value="5">e</option>
</select>
</div>
When my user picks one from the list, then another select should appear, as they first choose the main category, and then the sub category
So if they pick d, then my code gets the value 4, and list all sub categories with parent category 4
FYI: I am a PHP programmer, I have very little knowledge about java/jquery
Thanks
A:
You can use method change(), I don't know your html but if you put your categories into a iv with id category_n where n is the value foreach subcategories
$('.form-control').change(function(){
var val = $(this).val();
$('#category_' + val).hide();
});
and your div something like:
<div id="category_1" style="display:none;">
<ul>
<li>subcategory 1</li>
<li>subcategory 2</li>
<li>subcategory 3</li>
</ul>
</div>
<div id="category_2" style="display:none;">
<ul>
<li>subcategory 4</li>
<li>subcategory 5</li>
<li>subcategory 6</li>
</ul>
</div>
|
Effect of a computerized brain exercise program on cognitive performance in older adults.
Research indicates an association between stimulating mental activities and better memory performance as people age, but studies on computerized mental stimulation programs are limited. We explored whether computerized brain training exercises improved cognitive performance in older adults. In local retirement communities, a convenience sample was randomized into an intervention group (N = 36), who used a computer program 5 days a week for 20-25 minutes each day, or a wait-list control group (N = 33). All were older adults without dementia (mean age: 81.8 years; SD: 6.1; 67% female). Neuropsychological testing was completed at baseline (Time 1), 2 months (Time 2), and 6 months (Time 3). Three cognitive domains (Immediate Memory, Delayed Memory, Language) were compared in the two groups as a function of time using mixed models. The intervention group used the computerized program (Brain Fitness, Dakim Inc., Santa Monica, CA) for an average of 43 (SD: 4.4) sessions by Time 2 and 81 (SD: 37.5) sessions by Time 3. Mixed models examining cognitive domains as function of time revealed significant group differences in Delayed Memory (F(2,72) = 4.7, p = 0.01) but not Immediate Memory and Language; no significant improvements were noted for the control group. Among all participants, anyone playing at least 40 sessions over the 6 months improved in all three domains (Immediate Memory, Delayed Memory, and Language). Participating in a computerized brain exercise program over 6 months improves cognitive abilities in older adults. These results extend literature indicating the benefit of training exercises, whether in a classroom format or via a computerized self-paced program. |
Q:
What does the JavaScript "Object" function do?
What does the Object function in JavaScript do?
For example, what happens when we do Object(1)?
A:
It forces something to be an object. I've not seen it being used in this way though.
var num = 1;
var obj = Object(num);
alert(typeof num); //displays "number"
alert(typeof obj): //displays "object"
alert(num + "," + obj); //displays "1,1"
The preferred, faster way to create an empty object on which you can put properties and methods on is by using {}. Three possible ways to create an object:
var emptyObj = {};
var emptyObj = new Object();
var emptyObj = new Object; // Object does not need an argument, so this is valid.
|
-0.04?
-1
Let x = 33.2 + -33. Suppose -k = -3*i + k - 6, -5*i - 3*k = 29. Which is the second biggest value? (a) x (b) i (c) -15
b
Let o = 20.8 - 22.7. Let l = o + 2.1. Let k be (-8)/14 - (-4)/(-14). Which is the third biggest value? (a) 0.5 (b) k (c) l
b
Let k = -287 + 283. Which is the third smallest value? (a) 4 (b) k (c) 0.047
a
Let u = 0.1 + -4.1. Let r = 13 + u. Let p = -8.47 + 8.47. Which is the second biggest value? (a) -1 (b) r (c) p
c
Let s = 5 - -25. Let t = s + -29. Let y be ((-15)/(-6))/((-2)/4). Which is the third biggest value? (a) t (b) y (c) -13
c
Let n = -7598/3 - -2533. Which is the second biggest value? (a) n (b) -2.6 (c) 1 (d) -4 (e) 2/7
a
Suppose 2*t - 122 = 128. Let j = t + -84. Let n be (-6)/8 + (j/(-20) - -1). What is the fourth biggest value in 1, -3/7, -2, n?
-2
Suppose -8 = 2*f - 4*f. Let o = -256 - -255.631. Let y = 0.069 + o. Which is the fourth smallest value? (a) f (b) y (c) 5 (d) -0.4
c
Let j be ((-164)/(-56) + -3)*-30. Let g = j - 179/77. Let d = 248/363 + -2/121. Which is the smallest value? (a) d (b) 0.1 (c) g
c
Let w = 7656.61 - 7657. Which is the smallest value? (a) w (b) -0.07 (c) -4 (d) 0.2
c
Suppose -191 - 114 = 5*g. Let i be (4 + 6)/(-20) - (-365)/6. Let r = g + i. Which is the third biggest value? (a) r (b) 1 (c) -2/9 (d) -1/8
c
Let g = 153/14 + -857/56. Let v = 181/56 + g. Which is the third smallest value? (a) 2 (b) v (c) -5
a
Let o = 124/9 - 647/45. Let b = -364 + 34. Let s be 36/b*5/3. What is the third smallest value in o, s, -0.3?
s
Let l = 0.04 + -6.04. Let v = 6.3 + l. Let d = 41045.1 + -41045. Which is the second smallest value? (a) -3 (b) d (c) v
b
Let r be (-4 + 399/102)/(6/8). Which is the fifth biggest value? (a) -1/7 (b) 4 (c) -0.5 (d) r (e) -7
e
Let i = -5266/22029 - -1/1049. Which is the fourth biggest value? (a) 0 (b) 0.2 (c) -2/9 (d) i
d
Suppose -3*f - 5 = -m, -7 = 35*m - 37*m + 3*f. Let t = 4/17 - -58/187. Which is the biggest value? (a) 14 (b) t (c) m (d) 0
a
Let j be 4/3*51285/260. Let k = -1053/4 + j. Which is the biggest value? (a) 3 (b) k (c) -3 (d) -1
a
Let h = -558/17 - 706/51. Let y = -697/15 - h. Which is the fourth biggest value? (a) 133 (b) 5 (c) -5 (d) y
c
Let o = -4842 - -4433. What is the third biggest value in -0.2, o, -3/2?
o
Let p = -101 + 97.815. Let w = p + 0.185. Let n = -0.2 + 0.1. What is the second smallest value in w, -3/2, n?
-3/2
Let u = -31.6 - -102.6. Let g = 69 - u. Let m = -1 - -3. What is the fourth biggest value in -5, m, g, -1?
-5
Let x be ((-2)/6 - -1)/(112/(-63)). What is the second biggest value in -2/11, -0.4, 1/4, -2, x?
-2/11
Let p be 2/(-2)*2/1. Let k = -0.972 - -0.94. Let y = -5.032 - k. What is the smallest value in 0.3, 5, p, y?
y
Let l = -14567.71 + 14569. Which is the fourth biggest value? (a) -1/4 (b) l (c) 0.5 (d) 2/19
a
Let h be 36*(-13)/(-2184) + -4 + 4. Which is the fourth biggest value? (a) 14 (b) h (c) 3/5 (d) 0.5
b
Let i = -5572 - -5572.4. Let u = -4.7 + 5. What is the smallest value in i, u, -4, 3?
-4
Let g be (-185)/60 + (-16)/(-8) - 3/(-12). What is the second biggest value in -46, 17, 2, g?
2
Let o = -42.4 - -42. Let b = -0.3 + -4.8. Let i = 8.1 + b. What is the biggest value in o, -4, i, 2/35?
i
Suppose -5*m = 375 - 385. Which is the third smallest value? (a) -46 (b) -0.88 (c) m
c
Let l = -21205/3 + 7067. Which is the third smallest value? (a) -3/5 (b) -78 (c) 4/7 (d) l (e) -0.1
a
Let v = -2434 - -2431. What is the third biggest value in v, 0.09, -1/5, 3/5, 4?
0.09
Let w = -0.6965 - 0.0835. Let s = -1.14 + -0.64. Let v = w - s. Which is the smallest value? (a) -2 (b) -26 (c) -0.3 (d) v
b
Let j = -1.366 + 4.366. Which is the biggest value? (a) -2/9 (b) j (c) 8 (d) -2
c
Let a = -8659 + 8658.96. What is the third smallest value in 2, a, 0.16?
2
Let w = -205.5 - -601. Let q = w + -396. Which is the fourth smallest value? (a) 62 (b) q (c) 4 (d) -2
a
Let h = 5775 - 5774. What is the second smallest value in h, 406, -5, -0.9?
-0.9
Let z = -23543/7 + 3365. Which is the second smallest value? (a) -5 (b) z (c) 3 (d) -2/19
d
Suppose -41*w = 2*a - 38*w - 130, 0 = -5*w - 20. Suppose 87*j = 16*j + a. Let s = 0.07 - -3.93. What is the third smallest value in -2, s, -4, j?
j
Let i = 2268 + -6805/3. Which is the second biggest value? (a) -2/9 (b) -0.3 (c) i (d) -374
b
Suppose -v - 3*v - 8 = 0. Let g be 8 - 47 - (v - 1). Which is the second biggest value? (a) 3/4 (b) g (c) 2/9
c
Let h be -2*5/((-45)/2). Let n = 20 + -11. Let j = n + -9. Which is the biggest value? (a) j (b) h (c) -1/3
b
Let v = 14413 + -14408. What is the second smallest value in 0.3, 2/3, -2, v, 28?
0.3
Let o(g) = 2*g**2 - 118*g + 1056. Let m be o(11). Let n = -29/5 + 309/55. Which is the second biggest value? (a) -3 (b) n (c) 0.04 (d) m
d
Let h = -119.38 + 117.38. What is the third biggest value in h, -20, 3, -1/5?
h
Let g = -0.7527 - -0.8527. Let j = 8258063 + -10776772727/1305. Let u = 2/261 - j. Which is the fourth biggest value? (a) u (b) 0 (c) g (d) 1/3
b
Let m = -13.2 - 72.8. Let p = -87 - m. Let y = p - 10. Which is the second smallest value? (a) y (b) 1/5 (c) -0.2
c
Suppose 0 = 4*o - 0*o - 20. Let h = -1.03 - -1.486. Let u = h - -0.044. What is the second smallest value in 0.4, u, o?
u
Let a = -95.94259 - -0.05259. Let y = 96 + a. What is the biggest value in y, -5, -1?
y
Let k = -6 - -10. Let o(b) = 4*b**3 + 668*b**2 - 10*b - 1659. Let y be o(-167). What is the third smallest value in k, y, -3/2?
y
Let i be (-2)/8 - (1 + -2). Let a = -6473 + 6473.4. What is the third biggest value in -2/11, a, i?
-2/11
Let s = 6 + -6. Let y = -3/1460 + 2953/16060. Which is the third biggest value? (a) s (b) y (c) 0.1 (d) -2
a
Let n be -4*((-6)/44)/(-3). Let s = 854 - 407. Let g = 446.6 - s. What is the fourth biggest value in g, -0.5, n, 0?
-0.5
Let u = 45.7 - 40.7. Which is the fourth smallest value? (a) 0 (b) -0.4 (c) u (d) 16 (e) -1/8
c
Let f = -144833/5 + 28969. Which is the biggest value? (a) -456 (b) 6/5 (c) f
c
Let r be (6 + 1)*341/217. Which is the biggest value? (a) r (b) -32 (c) -3
a
Let q = 6479 + -6479. Which is the biggest value? (a) 0.5 (b) -14 (c) 4/3 (d) 2 (e) q
d
Let z = 251 - 250.415. Let u = z - -3.415. Which is the third biggest value? (a) 2/23 (b) u (c) 171 (d) 2/3
d
Let h = -0.0527 + -4.9473. Let l = 130 - 126. What is the third smallest value in 0.5, l, h, 5?
l
Let f = 1290 + -980.5. Let p = f - 309. Which is the second smallest value? (a) -0.036 (b) p (c) -1
a
Let i = -8.337 - -5.337. What is the smallest value in 730, i, 0.3?
i
Suppose -3*d - 1630 = -1645. What is the smallest value in 1/5, -0.3, d?
-0.3
Let i = 95/4 - 24. Let t = 17.3 + -17. What is the second smallest value in 2, -2, t, i?
i
Let b = -11/892 + 117/446. What is the fourth smallest value in 1, 0.7, b, -28, -1/7?
0.7
Let w = 2140/2457 + 96/91. What is the second biggest value in -6, 3, w?
w
Let f = 254/585 - -2/195. Let g = -4 - 18. Let n = -21.85 - g. What is the third smallest value in 4, n, -0.4, f?
f
Let c = -24.18 - -24.217. What is the third biggest value in 0.1, c, 128, 4?
0.1
Let q be (-51)/(-36) - (-2)/(-3). Let d = -0.23 - 0.07. Let c = 783834.8 - 783835. What is the second smallest value in q, c, d, -5/4?
d
Let l = 16/5 + -3. Let o be (33/(-12) - -2) + (-189)/(-28). Let f be 3*(o/30)/(-1). Which is the fourth biggest value? (a) f (b) -1 (c) l (d) -0.4
b
Suppose 41 - 321 = -28*j. Let r be (j/(-225)*-12)/(2/5). What is the smallest value in 1, r, 0.6, -3?
-3
Let v(j) = -3*j + 28. Let q be v(9). What is the smallest value in 0.04, 2/15, q, 7/5?
0.04
Let r = 2.6 - 3. Let y = -335.5 + 3.5. Let s = y + 331.7. Which is the second biggest value? (a) r (b) s (c) 0.04
b
Let k = -246 - -435. Let f = k + -192. What is the second smallest value in -1/6, 2/7, 2, f?
-1/6
Suppose 8*r + 8*r - 112 = 0. Let q be (-13)/r + (-42)/(-49). Let v = 1.3 + -5.3. Which is the third smallest value? (a) q (b) 0 (c) 0.8 (d) v
b
Let l = 7893.99 - 7894. What is the fifth smallest value in 5, l, 2/63, -0.02, -0.3?
5
Let o be 6/(-15) + 26/(-60). Let m(i) = i. Let z be m(-3). Let f = -1134.8 - -1134.3. Which is the smallest value? (a) z (b) f (c) o (d) 0.3
a
|
Identifying themselves as police officers, four gunmen carried out the home invasion about 7:15 a.m. in the 800 block of Castlemaine Court. Birmingham police spokesman Sgt. Johnny Williams Jr. said he wasn't sure how many victims were in the home at the time.
The group arrived at the home in a black Chevrolet Suburban. They fled the scene in the same Suburban, but also stole the victim's red Toyota Camry. Among the items stole were the keys to several Birmingham-area package stores owned by a victim.
The victim declined to comment to AL.com, but said he wasn't injured in the holdup. Williams said the only suspect description is that of four black males.
Birmingham police this afternoon released surveillance photos of both the SUV and the victim's stolen Camry. Authorities ask anyone with information to call Crimestoppers at 254-7777. Tips to Crimestoppers can remain anonymous and the organization offers up to $5,000 for information leading to an arrest and conviction in the case. |
German's dope ban
Wednesday 25 January 1995 00:02 BST
Click to followThe Independent Online
The former German international striker, Roland Wohl- farth, has been banned with immediate effect for taking drugs.
The German football federation (DFB) said yesterday that the former Bayern Munich forward, who now plays for Bochum in the Bundesliga, tested positive for a stimulant at an indoor tournament in Leipzig on 5 January.
Wohlfarth, a former leading goalscorer in the German First Division, is the first player to face proceedings in Germany for drug abuse, although other former professionals have admitted to doping in the past.
The 31-year-old forward, who recently returned to play in Germany from the French club St Etienne, has admitted that he had taken the appetite suppressant Recatol, which contained the banned stimulant Norephedrine.
"We were informed on Friday," the Bochum coach, Klaus Toppmoller, said. "The news has hit us like a bomb - It was stupid of him.
"Roland Wohlfarth should have got some information from the doctor about the drug in question."
While admitting to taking the suppressant, Wohlfarth said he did not know that he was taking a banned substance. "It was a shock for me when I got the result of the test. I did not know what I was taking," he said.
Following a major debate about the misuse of drugs last year the DFB has increased its drugs-testing programme and is carrying out random tests at indoor tournaments for the first time as well as testing during training in the First and Second Divisions.
The Bundesliga is taking its traditional winter break and most clubs are currently involved in indoor tournaments.
Wohlfarth faces a ban of at least four weeks. It is unclear how severe the punishment meted out by the DFB will be on the player since there are no similar incidences of drug abuse in the German game to which officials can refer.
Doping has become a major controversy in the game in recent months after the Argentinian player, Diego Maradona, was banned after testing positive for drugs at last year's World Cup finals.
Last month the England international midfielder, Paul Merson, of Arsenal, admitted to using cocaine as well as being an alcoholic. Merson was admitted to a rehabilitation clinic although he has not been charged with any offence by the Football Association. He has just resumed training with Arsenal but has not yet played in a match.
In Germany the former national team goalkeeper, Toni Schumacher, caused a furore when he wrote a controversial book containing doping accusations in the game. Last year a former Bundesliga player also admitted to taking drugs over a long period. |
# vim:set ft= ts=4 sw=4 et fdm=marker:
use t::SRegex 'no_plan';
run_tests();
__DATA__
=== TEST 1: testinput1:2729
--- re: (bc+d$|ef*g.|h?i(j|k))
--- s eval: "bcdd"
=== TEST 2: testinput1:2732
--- re: ((((((((((a))))))))))
--- s eval: "a"
=== TEST 3: testinput1:2738
--- re: (((((((((a)))))))))
--- s eval: "a"
=== TEST 4: testinput1:2741
--- re: multiple words of text
--- s eval: "*** Failers"
=== TEST 5: testinput1:2742
--- re: multiple words of text
--- s eval: "aa"
=== TEST 6: testinput1:2743
--- re: multiple words of text
--- s eval: "uh-uh"
=== TEST 7: testinput1:2746
--- re: multiple words
--- s eval: "multiple words, yeah"
=== TEST 8: testinput1:2749
--- re: (.*)c(.*)
--- s eval: "abcde"
=== TEST 9: testinput1:2752
--- re: \((.*), (.*)\)
--- s eval: "(a, b)"
=== TEST 10: testinput1:2757
--- re: abcd
--- s eval: "abcd"
=== TEST 11: testinput1:2760
--- re: a(bc)d
--- s eval: "abcd"
=== TEST 12: testinput1:2763
--- re: a[-]?c
--- s eval: "ac"
=== TEST 13: testinput1:2790
--- re: abc
--- s eval: "ABC"
--- flags: i
=== TEST 14: testinput1:2791
--- re: abc
--- s eval: "XABCY"
--- flags: i
=== TEST 15: testinput1:2792
--- re: abc
--- s eval: "ABABC"
--- flags: i
=== TEST 16: testinput1:2793
--- re: abc
--- s eval: "*** Failers"
--- flags: i
=== TEST 17: testinput1:2794
--- re: abc
--- s eval: "aaxabxbaxbbx"
--- flags: i
=== TEST 18: testinput1:2795
--- re: abc
--- s eval: "XBC"
--- flags: i
=== TEST 19: testinput1:2796
--- re: abc
--- s eval: "AXC"
--- flags: i
=== TEST 20: testinput1:2797
--- re: abc
--- s eval: "ABX"
--- flags: i
=== TEST 21: testinput1:2800
--- re: ab*c
--- s eval: "ABC"
--- flags: i
=== TEST 22: testinput1:2803
--- re: ab*bc
--- s eval: "ABC"
--- flags: i
=== TEST 23: testinput1:2804
--- re: ab*bc
--- s eval: "ABBC"
--- flags: i
=== TEST 24: testinput1:2807
--- re: ab*?bc
--- s eval: "ABBBBC"
--- flags: i
=== TEST 25: testinput1:2810
--- re: ab{0,}?bc
--- s eval: "ABBBBC"
--- flags: i
=== TEST 26: testinput1:2813
--- re: ab+?bc
--- s eval: "ABBC"
--- flags: i
=== TEST 27: testinput1:2816
--- re: ab+bc
--- s eval: "*** Failers"
--- flags: i
=== TEST 28: testinput1:2817
--- re: ab+bc
--- s eval: "ABC"
--- flags: i
=== TEST 29: testinput1:2818
--- re: ab+bc
--- s eval: "ABQ"
--- flags: i
=== TEST 30: testinput1:2823
--- re: ab+bc
--- s eval: "ABBBBC"
--- flags: i
=== TEST 31: testinput1:2826
--- re: ab{1,}?bc
--- s eval: "ABBBBC"
--- flags: i
=== TEST 32: testinput1:2829
--- re: ab{1,3}?bc
--- s eval: "ABBBBC"
--- flags: i
=== TEST 33: testinput1:2832
--- re: ab{3,4}?bc
--- s eval: "ABBBBC"
--- flags: i
=== TEST 34: testinput1:2835
--- re: ab{4,5}?bc
--- s eval: "*** Failers"
--- flags: i
=== TEST 35: testinput1:2836
--- re: ab{4,5}?bc
--- s eval: "ABQ"
--- flags: i
=== TEST 36: testinput1:2837
--- re: ab{4,5}?bc
--- s eval: "ABBBBC"
--- flags: i
=== TEST 37: testinput1:2840
--- re: ab??bc
--- s eval: "ABBC"
--- flags: i
=== TEST 38: testinput1:2841
--- re: ab??bc
--- s eval: "ABC"
--- flags: i
=== TEST 39: testinput1:2844
--- re: ab{0,1}?bc
--- s eval: "ABC"
--- flags: i
=== TEST 40: testinput1:2849
--- re: ab??c
--- s eval: "ABC"
--- flags: i
=== TEST 41: testinput1:2852
--- re: ab{0,1}?c
--- s eval: "ABC"
--- flags: i
=== TEST 42: testinput1:2855
--- re: ^abc$
--- s eval: "ABC"
--- flags: i
=== TEST 43: testinput1:2856
--- re: ^abc$
--- s eval: "*** Failers"
--- flags: i
=== TEST 44: testinput1:2857
--- re: ^abc$
--- s eval: "ABBBBC"
--- flags: i
=== TEST 45: testinput1:2858
--- re: ^abc$
--- s eval: "ABCC"
--- flags: i
=== TEST 46: testinput1:2861
--- re: ^abc
--- s eval: "ABCC"
--- flags: i
=== TEST 47: testinput1:2866
--- re: abc$
--- s eval: "AABC"
--- flags: i
=== TEST 48: testinput1:2869
--- re: ^
--- s eval: "ABC"
--- flags: i
=== TEST 49: testinput1:2872
--- re: $
--- s eval: "ABC"
--- flags: i
=== TEST 50: testinput1:2875
--- re: a.c
--- s eval: "ABC"
--- flags: i
|
Why join the Thailand Fitness Training Camp? It’s a life-changing experience that gives you the opportunity to devote serious time to your health and fitness. You will feel better, look better and gain new self-confidence.
No matter what your current level of fitness is, you can join the fitness training camp. Everyone is there with the same goal and that is to get fitter. This trip is about meeting people, while exploring a beautiful country and improving your all-round well-being at the same time. It’s the perfect combination for people who want to remain active, and then enjoy some well-deserved rest time at a beautiful resort in stunning surroudings.
Inclusions
Pre-departure information
Online buddy list before travelling
Airport pick-up from Phuket
Accommodation
Introduction orientation session by our rep
Access to all training equipment and 3-storey gym (also on Sundays)
Specialised strength & technique classes, 5 days a week focusing on different areas
All group body fit training sessions 6 days a week
All group weights training sessions 6 days a week
Optional yoga sessions 5 days a week
Obstacle course training (our most mentally and physically challenging class)
Nutrition seminar - we will help you create the best meal plan for you!
2 meals a day
Excursions: Beachfront runs & workout sessions, Big Buddha run (transport included)
Option to join Muay Thai classes 2 sessions a week
Brand new abs on departure!
Itinerary
Fitness Boot Camp Phuket with Standard Accommodation
World-Class CrossFit Style Training
It can be hard to get motivated to take your fitness training to the next level back home. One of the many great things about the fitness training camp is that you can take the time to devote to your health and fitness with no distractions. Not only that, but you will be supported 100% by our team of world-class fitness training professionals. For many it’s the push they’ve been needing.
It’s the facilities, trainers and the training that really set this camp apart. It’s not just the quantity of the workouts (you could train up to 8 hours a day in theory) - it’s the quality. We are constantly improving our fitness routines by incorporating the latest methods and techniques.
On average there can be 50-100 people training at the camp from all over the world, and it is not unusual to be working out with celebrities, professional athletes and fitness professionals who are on holiday and want to get in shape.
Program Highlights
- Whether you want to get stronger, lose weight or just generally want to be fitter and healthier we can tailormake the ideal fitness training programme for you.
- This is a holiday as much as a bootcamp. It’s the perfect blend of relaxation and fitness training.
- It works! You will be amazed at your fitness improving efficiently with personal training mentor sessions every week.
- It’s really motivating - especially when training with people who all want the same thing!
- There is nothing stopping you from reaching your fitness goals with access to a comprehensive gym and training equipment.
- We use proven advanced fitness training techniques coupled with various different classes, so no matter what your fitness goals we can help you smash them. All of our fitness programs are taught by professional fitness trainers.
- This trip is about you, and improving your personal fitness with a plan based on your level and fitness goals in a supportive group environment.
- Nutritional requirements are taken care of. You don’t have to worry about what you eat, we have a dedicated meal plan to complement your fitness goals.
- Discover new ways to stay fit while trying new sports like Muay Thai & yoga (no extra costs).
- The fully equipped 3-floor fitness center is open full time from Monday to Sunday (no group sessions on Sundays) so there is no limit to how much you can train with unlimited gym access and a huge outdoor world-class training facility. There are always fitness trainers able to advise you and guide you throughout your workouts.
- We will also take you on fun and effective beach training excursions.
- You will meet like-minded people and make lifelong friends. If you are traveling alone, you won’t be on your own for long, as it’s a very welcoming environment and we will hook you up on Facebook prior to arrival.
Arrival & Introduction
You will be picked up from Phuket International Airport and taken to your accommodation. Settle in and relax before a briefing given by our representative on the Sunday evening. First thing on Monday morning you will walk to the training facility located a couple of minutes away and have your introduction. You will meet your fitness trainers, be shown around the camp and get introduced to the timetable. We advise you come prepared for training straight after your introduction, so be sure to bring your gear: shorts, sneakers, t-shirt, towel and water.
Training Schedule
Your training schedule includes group workout sessions from Monday to Saturday with gym access 7 days a week, although Sundays are mostly taken off for a well-deserved rest.
1) Early Morning Yoga
If you wish you can start with a good stretch in the morning by joining the yoga class for an hour before the ‘real’ work begins. It’s a great way to stretch and warm up your muscles, and it improves flexibility and balance.
2) Boot Camp Cardio Sessions
The boot camp training consists of high cardio (fat burning) exercising, using highly advanced techniques 6 days a week from Monday to Saturday. These classes vary from Strength & Conditioning, Cross Training, Bodyfit, Spinning and Boxercise. They are designed to increase your fitness fast and effectively. The groups typically have people training with moderate or peak physical condition, which works well as the exercises are modified depending on your fitness level and ability so no one is left behind.
3) Open Matt Sessions
The whole camp is at your disposal to do our own workout including equipment such as battle ropes, assault course, med ball, torsonater and olympic weightlifting bars with plates.
4) Olympic Weightlifting
Recommended for those who have little or no experience with lifts. Performing this type of exercises will help you increase power, speed, flexibility and strength.
5) S&C (Strength & Conditioning)
Whether you are a beginner or an advanced athlete, this training system will develop power, endurance, speed, agility, core strength, enable you become more flexible as well as promote weight loss. A variety of exercising techniques and equipment to ensure no session is ever repeated exactly. Join this class Mon-Fri afternoons at 17:00.
6) Beach Training (on Saturdays)
The unique environment offers us an opportunity to run through some imaginative routines, which take advantage of both the sun and the sea to ensure you get the best beach training to remember.
7) Boxercise
A different and fun class (twice a week on Tuesdays and Thursdays 16:00-17:00) on basic boxing techniques where the pace is kept high to maximize calorie burn in the fat burning zone. Get fit without getting hit!
8) Navy Seal Military Assault Course
Our ex Navy seal coach will push you to your utmost limits. This is probably the most challenging class we offer and that our fitness trainers run 3 times per week on Mondays, Wednesdays and Fridays at 16:00-17:00. The record is 1.52 min so that is what we are aiming for to beat.
10) Muay Thai
This is not a Muay Thai training camp, we specialize in fitness. However, if you want to try some Muay Thai we have developed a partnership with a Muay Thai Camp next door and you are able to participate there (2 sessions a week are included).
12) Zumba Fitness (on Tuesdays & Thursdays)
Get in shape by dancing! This is the perfect class if you are having a rest day, or if you would like to learn more Zumba fitness moves and choreographed dancing. Have fun and burn calories!
13) Big Buddha Run (on Thursdays)
This optional activity outside the Boot Camp takes you to the famous Big Buddha for a jog, hike or walk. At your own pace. Transport back and forth is included.
14) Outdoor Training Area
The majority of the workouts and classes take place in the outdoor training area, but there is also an outdoor training area that is fully loaded for pretty much any fitness session you could wish for. We have a running track, assault course, full crossfit set-up not to mention an on-site protein and supplement bar.
No class is mandatory, and no one is going to force you to get out of bed, but we highly recommend that you make the most of your stay with us!
Optional Extra - Personal Trainer Sessions
Personal trainer sessions can be booked locally at an extra cost. These sessions are designed to monitor your progress, and to guide your fitness regime so that you arrive at your desired goals. During these weekly sessions you can develop the ideal schedule, diet and supplement plan as well as give you that little extra push you might need.
Pre-Departure Info
We give you lots of support prior to arriving at the camp. After booking, we will set you up with an online buddy list so you can chat with other people going to the camp, or people already training at the camp before you even set off. You will also receive a detailed pre-departure pack for you to familiarise yourself with the program before you go.
Periods with Limited Training
During Songkran (13-15 Apr) and New Year´s Day, there will be limited training sessions.
Oversigt
What’s included?
Ekstra udgifter på rejsen
None
Activities
The location in Phuket is superb and there is plenty to do in the area. The beaches are a short taxi drive away, and there are little bars and restaurants located nearby, but it’s not really a drinking culture. This is a fitness training bubble, where you will find healthy eating restaurants, fruit shake bars, spas and Thai massage shops. Heaven to ease those aching muscles.
Accommodation
The standard ensuite accommodation option gives you a clean, comfortable room with air conditioning, private bathroom, fridge, desk, Wi-Fi and cable TV. This modern resort hotel has free high speed internet, a nice pool and clean and comfy ensuite rooms with a balcony.
Local transport
Arrival transfer from Phuket International Airport included
Meals
The meal plan (which starts on the first Monday) will be discussed during the introduction. We take care of all of your nutritional requirements during the training, and provide you with a healthy, delicious menu consisting of two meals a day from Monday to Saturday.
You are free to choose which combination of 2 meals you take between breakfast, lunch and dinner. So you will need to budget for one meal per day at the cost of between 2-5 EUR. The delicious healthy options in the meal plan will help you tone up, lose weight or build muscle extremely quickly. You can buy water at the resort or the training camp.
Vær venligst opmærksom på
Visa
Please check the visa requirements for Thailand.
Frequently Asked QuestionsHow fit do I have to be before I join?
We get people of all fitness levels joining the camp. Do not worry that you will not be able to keep up, just focus on your own fitness level and progress. We guarantee you will see an improvement.
What kind of results can I expect?
Everyone is different, and everyone has different goals. Some people are unfit and others have a reasonably good level of fitness when they begin. No matter what category you fit into, you will benefit from spending time training here.
There is a very motivating, social and supportive atmosphere at the camp as everyone supports each other in reaching their goals. Combined with the superb trainers, numerous and varied scheduled group training classes, and a world-class training facility and gym, there really is nothing that can hold you back. Exercising is quite addictive once you get into it!
How long should I go for?
The majority of people stay between 2 and 6 weeks. Two weeks is enough to start seeing some good results. Staying short-term, the main benefit you will take with you is the knowledge of how to maintain and improve your health and fitness back home along with a solid fitness routine. If you are really serious about improving your fitness and well-being, then make this a life-changing trip and go long-term and experience a complete physical and mental transformation.
Can I train if I have an existing injury?
Because each exercise can be tailored to the abilities of everyone in the class, no matter what your fitness level, you are able to join the fitness boot camp even if you have an existing sports injury. Simply make the trainers aware of your own personal physical circumstances and they can tailor the exercises accordingly. |
Liquid crystal panels are used in a broad range of applications, such as display devices in industrial appliances and medical appliances, not only in television sets and mobile phones. In general, a liquid crystal panel includes: a pair of substrates that face each other; and liquid crystal enclosed between the pair of substrates. In one of the substrates, there are formed thin film transistors for driving respective pixels, and electrodes for applying voltage to the liquid crystal. A thin film formed of an oriented material is applied on the electrodes, and an oriented film that orients the liquid crystal in a certain direction is formed by applying orientation treatment to the thin film. On the other substrate, a color filter layer is formed as necessary. The color filter layer is formed by arranging pixels including pigments of different colors, for example, red, green and blue. Adjacent pixels are partitioned by a light blocking black matrix. A common electrode is formed on the color filter layer as necessary. Furthermore, a thin film formed of an oriented film material, such as polyimide, is applied thereon, and is subjected to orientation treatment, to form an oriented film that orients the liquid crystal to a certain direction.
As one example of the orientation treatment, rubbing treatment can be cited. The rubbing treatment is treatment in which the thin film is rubbed in a predetermined orientation direction with a rubbing roller around which rubbing cloth, which is a friction member, is wound. The thin film that has undergone the rubbing treatment has an orientation regulating capability for orienting liquid crystal in a certain direction. As one example of non-contact orientation treatment, photo-alignment treatment can be cited. The photo-alignment treatment is treatment that provides an orientation regulating capability to the thin film by irradiating the thin film with ultraviolet rays such that chemical bonds of macromolecules in the oriented film material is decomposed, isomerized and dimerized.
After applying orientation treatment to both substrates, a liquid crystal layer is formed between the substrates. There are various techniques to form a liquid crystal layer. One of the techniques includes: applying a sealant on one substrate in a rectangular frame form a part of which is opened; adhering the substrates together; and injecting liquid crystal material between the substrate from the opening. Another technique includes: applying sealant on one substrate in a rectangular frame form; dropping liquid crystal in a region surrounded by the sealant; and thereafter adhering the substrates together. Then, by adhering polarization plates onto the resulting body after forming a liquid crystal layer between the substrates, a liquid crystal panel is completed. The completed liquid crystal panel undergoes a display inspection, so that a liquid crystal panel without a display defect is shipped as a product.
In recent years, the pixel size per unit area of liquid crystal panels has become small as a result of highly minute structures, and thus the number of pixels is increasing. Accordingly, the probability of pixel defect is increasing. Pixel defects in the liquid crystal panel come from breaking and short circuit of wires and electrodes, damages on the surface of the oriented film made by orientation treatment, and residue of foreign matters in the liquid crystal panel, for example. Examples of defects caused by a foreign matter in the liquid crystal panel include: a pixel defect that a foreign matter or a region around the foreign matter is seen darkly when the panel displays a white screen; and another pixel defect that the foreign matter or a region around the foreign matter is seen whitely when the panel displays a black screen. The former is called a dark spot and the latter is called a bright spot.
Here, examples of the operational modes of a liquid crystal panel include: a TN (Twisted Nematic) mode; an IPS (In Plane Switching) mode, and a VA (Vertical Alignment) mode. Among these modes, demands for the IPS mode are increasing because it has a wide viewing angle and changes in tones and colors according to the viewing angle are small.
The IPS mode is a normally black mode where a black screen is displayed when voltage is not applied. Accordingly, when there is a bright spot defect, the bright spot can always be seen because of light of the backlight provided in the liquid crystal panel even if no voltage is applied, and thus image quality is deteriorated. Accordingly, there is an increased importance in modifying the bright spots especially for a liquid crystal panel in the IPS mode.
Consequently, the cause of bright spots has been examined for modifying the bright spots. It turned out that there are two causes of bright spots. First, a bright spot results from transmission or scattering of light in a foreign matter itself. Second, a bright spot results from orientation abnormality of the liquid crystal in the circumference of a foreign matter.
The first bright spot that results from transmission or scattering of light in the foreign matter itself appears because the foreign matter, which has characteristics of transmitting light in the visible light region and/or of scattering light, makes a difference in transmittance from a portion without the foreign matter in a liquid crystal panel. In this case, since a bright spot appears as a result of light passing through the foreign matter itself or scattered in the foreign matter itself, the size of a bright spot is substantially the same as the size of the foreign matter.
The second bright spot that results from orientation abnormality of the liquid crystal in the circumference of the foreign matter appears because a foreign matter, which is organic substance, makes a difference in light transmittance from a portion without the foreign matter in a liquid crystal panel, due to occurrence of orientation abnormality coming from interaction of liquid crystal molecules in the circumference of the foreign matter with molecular chains on the surface of the foreign matter.
Usually, liquid crystal molecules orient in a predetermined direction by orientation treatment. For example, when rubbing treatment is carried out, minute unevenness is formed on a surface of the oriented film by the rubbing treatment, and thus it becomes easy to orient the liquid crystal molecules along grooves caused by the unevenness. This is because the liquid crystal molecules are affected by the unevenness and orient in a direction that results in minimum elastic free energy (direction parallel to the groove) so that elastic strain energy does not become high.
However, it can be considered that the liquid crystal molecules in the circumference of the foreign matter are not oriented along minute grooves formed by the rubbing treatment but are oriented in various directions. It can be considered that this is because the molecular chains on the surface of the foreign matter do not orient in a fixed direction but orient in various directions, and under the influence of this, the direction that the elastic free energy of the liquid crystal molecules in the circumference of the foreign matter is stable is not a fixed direction determined by the orientation treatment. As a result, the orientation abnormality arises in the circumference of the foreign matter, which makes a difference in light transmittance from a portion without a foreign matter in the liquid crystal panel, and thus a bright spot appears.
In many cases, foreign matters that have remained in the panel are: shavings of oriented film material that has remained on the oriented film as a result of, for example, rubbing treatment; or organic substances, such as protein coming from human bodies. Accordingly, there is a high probability of occurrence of a bright spot that results from orientation abnormality of the liquid crystal in the circumference of the foreign matter. In addition, even if the size of a foreign matter is so minute as to be invisible, the size of a bright spot becomes larger than the size of a foreign matter so as to be visible when orientation abnormality arises in the liquid crystal in the circumference of the foreign matter. Accordingly, it is especially important to modify a bright spot that results from orientation abnormality of the liquid crystal in the circumference of the foreign matter.
With respect to the method of modifying a bright spot of a liquid crystal panel, Japanese Unexamined Patent Application Publication (JP-A) No. 2007-065653 discloses a method of manufacturing a liquid crystal display. The liquid crystal display includes a pair of substrates arranged to face each other, and a liquid crystal layer formed between the substrates. The method includes: forming a microhole on a back surface of one of the substrates correspondingly to a portion where a bright spot produced as a result of a foreign matter remaining between the substrates is produced; forming a light blocking substance layer which blocks the bright spot according to light intensity of the bright spot inside the microhole; and irradiating the light blocking substance with ultraviolet rays in order to cure the light blocking substance. According to the method of manufacturing a liquid crystal panel, a light blocking substance layer corresponding to light intensity of the bright spot is formed. Accordingly, the modified portion is not observed in black exceptionally even if the screen is a gray screen, and thus it is possible to improve visual appreciation.
Moreover, JP-A No. 2007-171905 discloses a method of modifying a flat display panel including a first substrate and a second substrate, and at least one foreign matter arranged above either one of the first substrate and the second substrate. The method includes: forming a hole corresponding to the foreign matter on the first substrate or the second substrate; filling the hole with resin; and irradiating the resin with polarized ultraviolet rays. According to such a method of modifying a bright spot, a bright spot produced in the display panel is eliminated. Regarding ultraviolet rays to be used for irradiating the resin, a polarization component parallel to the orientation direction of the oriented film can damage bonds among the molecules of the oriented film. Therefore, damage in the oriented film can be minimized by irradiating the resin with ultraviolet rays of polarization components that are not parallel to the orientation direction of the oriented film and by blocking the polarization component parallel to the orientation direction.
Further, JP-A No. 2000-89231 discloses a method of manufacturing an optical device in which irregularity is modified by irradiating a portion where irregularity based on orientation treatment is produced with ultraviolet rays after forming an oriented film on one side of at least one substrate member of two substrate members at least one of which has translucency, or after enclosing liquid crystal between two substrate members including oriented films and completing the optical device. According to such a method of manufacturing an optical device, display quality improves since irregularity in the oriented film in the optical device is modified by irradiating the portion where irregularity in the oriented film is produced with ultraviolet rays.
The methods described in JP-A Nos. 2007-065653 and 2007-171905 are further described with reference to FIG. 7 and FIGS. 8A and 8B. FIG. 7 is a schematic diagram illustrating a situation that an observer views a liquid crystal panel from the front and a situation that an observer views a liquid crystal panel obliquely (at an angle). The illustrated liquid crystal panel includes a first transparent substrate 11, a second transparent substrate 12, a liquid crystal layer 13 and oriented films 15. FIG. 8A is a schematic diagram illustrating a case where a liquid crystal panel in which a bright spot has been modified by a conventional technique displays a black screen. FIG. 8B is a schematic diagram illustrating a case where a liquid crystal panel in which a bright spot has been modified by a conventional technique displays a white screen. FIGS. 8A and 8B illustrate pixels 51, a black matrix 52 and a light blocking substance layer formation portion 53 in the liquid crystal panel.
Both of the methods described in JP-A Nos. 2007-065653 and 2007-171905 merely shield the bright spot with light blocking substance 25 arranged in a hole 31 and do not modify liquid crystal orientation in the circumference of the foreign matter (see liquid crystal molecules 14 in FIG. 7). Accordingly, as illustrated in FIG. 7, when an observer views the liquid crystal panel around the foreign matter 17 from the front, the observer does not see a bright spot since backlight light 42 is blocked, but when viewing the liquid crystal panel from an oblique direction, the observer sees a bright spot caused by orientation abnormality of liquid crystal in the circumference of the foreign matter 17 because of backlight light 42 that entered the liquid crystal from an oblique direction. In order to block the backlight light 42 that enters the liquid crystal from an oblique direction, it is necessary to form a light blocking substance layer of an area considerably larger than that of the bright spot. In addition, since the bright spot is always shielded with the light blocking substance 25, the blocked part always has a fixed tone irrespective of the tone that should be displayed. Accordingly, as illustrated in FIG. 8A, the blocked part (light blocking substance layer formation portion 53) is not highly distinguishable when the liquid crystal display displays a black or gray screen. However, as illustrated in FIG. 8B, the blocked part can be seen as a dark spot when the liquid crystal display displays a white screen.
In addition, in the method disclosed in JP-A No. 2000-89231, in a case that the optical device is irradiated with ultraviolet rays after the oriented film is formed, a bright spot cannot be modified if a foreign matter or the like enters into the optical device after irradiation of the optical device with ultraviolet rays and before assembling the optical device, and a bright spot and irregularity resulting from, for example, dusts, stuck onto the substrate surface after the irradiation cannot be modified. In another case that the optical device is irradiated with ultraviolet rays after the optical device is assembled, irradiation with ultraviolet rays is carried out via the substrate member. Therefore, the substrate member absorbs ultraviolet rays of wavelength required for modifying the irregularity (or bright spot), and thus the irregularity (or bright spot) cannot be modified by UV irradiation. Further, it is necessary to prepare a mask dedicated for the size and the shape of the irregularity (or bright spot), and thus it is costly. In addition, JP-A No. 2000-89231 does not explicitly indicate a method of modifying a bright spot produced as a result of a foreign matter.
The present invention seeks to solve the problems. |
Commission on Sustainable Development
The United Nations Commission on Sustainable Development (CSD) was a body under the UN Economic and Social Council (ECOSOC) tasked with overseeing the outcomes of the 1992 United Nations Conference on Environment and Development/Earth Summit. It was replaced in 2013 by the High-level Political Forum on Sustainable Development, which meets both under the General Assembly every four years and the ECOSOC in other years.
The CSD was established in December 1992 by General Assembly Resolution A/RES/47/191 as a functional commission of the UN Economic and Social Council, implementing a recommendation in Chapter 38 of Agenda 21, the landmark global agreement reached at the June 1992 United Nations Conference on Environment and Development/Earth Summit held in Rio de Janeiro, Brazil.
CSD 1
CSD 1, the Organizational Session of the CSD was held in June 1993. The Organizational Session focused on a broad range of organizational and administrative issues, reflected in topics of the commission's documents :
Budget implications of draft decisions
Establishing a provisional agenda and a multi-year programme of work
National reporting on implementation of Agenda 21
Information exchange: UN System and donors
UNCED follow-up: international organizations and UN coordination
Coordination of development data
Progress in environmentally sound technology transfer
Government information on financial commitments
Urgent and major emergent issues
United Nations Conference on Trade and Development and Agenda 21 implementation
UNEP and Agenda 21 implementation
Future work
Guidelines for national reporting
Integrating sustainable development into the UN system
CSD 5
In its Fifth Session, the principal focus of the CSD was to prepare for the Five-Year Review of the 1992 Earth Summit, which took the form of the 19th Special Session of the General Assembly, held at UN Headquarters in New York.
CSD 10/World Summit on Sustainable Development
For its Tenth Session the CSD served as the Preparatory Committee for the World Summit on Sustainable Development, held in Johannesburg, South Africa, in December 2002.
See the full article World Summit on Sustainable Development
CSD 12
The Twelfth Session of the CSD is the first substantive session since the Johannesburg Summit - CSD-11 was an organizational session that focused on establishing priorities and an agenda for the second ten-year cycle of the commission. Text below in "quotes" is from the introductory note from the chair - H.E. Børge Brende, Norwegian Minister of the Environment to a description of the organization of work during CSD-12
"The first three days of CSD-12 will serve as the preparatory meeting for the ten-year review of the Barbados Programme of Action (BPoA) for the Sustainable Development of Small Island Developing States.
The bulk of CSD-12 will focus on water, sanitation and human settlements. "The decision of CSD-11 to focus its first Implementation Cycle on Water, Sanitation and Human Settlements bears testimony to the sense of urgency the international community ascribes to these issues."
"Today, water-borne diseases kill a person every ten seconds, the overwhelming majority children, and roughly one in two Sub-Saharan Africans and three in five South Asians lack adequate sanitation. The total number of people living in slums is close to 930 million and is growing at an accelerated rate."
"The CSD-12 Review Session will feature a number of “firsts”. Thematic reviews will feature interactive discussions and will be introduced through keynote presentations, panel discussions and moderated debates. Major Group representatives will join Ministers in interactive dialogues during the High-Level Segment."
CSD 16
The chair was H.E. Francis Nhema, Zimbabwe's Minister of Environment and Tourism.
CSD 18
The 18th session took place in New York in May 2010, focusing on transport, chemicals, waste management, mining, and the ten-year framework of programmes on sustainable consumption and production patterns (SCP).
CSD 19
The 19th session took place in May 2011, as part of the policy cycle from the previous year. No agreement was reached in the negotiations and they eventually collapsed.
United Nations Conference on Sustainable Development
CSD 20 was suspended from its normal rotation, planned in 2012 because the General Assembly had resolved to hold the United Nations Conference on Sustainable Development in Rio as the 20th anniversary to the original conference. United Nations Conference on Sustainable Development would focus on two themes:
Green economy within the context of sustainable development and poverty eradication.
Institutional framework for sustainable development.
With the objectives:
Securing renewed political commitment to sustainable development.
Assessing the progress and implementation gaps in meeting already agreed commitments.
Addressing new and emerging challenges.
CSD 20
Member states decided in resolution 67/203 of 21 December 2012 that the CSD would have its last session immediately prior to the convening of the first meeting of the High-level Political Forum on Sustainable Development in order to ensure a smooth institutional transition. CSD-20 took place in the morning of 20 September 2013.
See the full article United Nations Conference on Sustainable Development.
UNFCCC
CBD
References
External links
Commission on Sustainable Development
UN DESA - Division for Sustainable Development
Sustainable Development Issues Network
Stakeholder Forum
Category:United Nations Economic and Social Council
Category:International sustainability organizations
Category:Organizations established in 1992 |
When La Forge and Wesley complain privately to Riker in Ten Forward about this, he reminds them that Kurn simply has a different style of command and that Klingons believe in obedience and strict adherence to regulations. However, it is notable that the only person Kurn has not been giving a hard time is "the one person who wouldn't really mind it": Worf.
Kurn gives Worf easy assignments and praises him sarcastically for his efficiency during a minor course correction on the bridge. Worf angers at being patronized.
While in a turbolift on his way to the captain's dining room, Riker tells Kurn it took him some getting used to Klingon culture while serving on the Pagh. He offers to assist Kurn with suggestions in working with the crew. Kurn respectfully declines the offer, reminding Riker that on a Klingon ship, he would be killed for such a "suggestion".
A special dinner is prepared at the captain's mess in honor of Kurn, who understands the honor and is prepared to sample some of the food, even though some of it is cooked -- but he doesn't like it, and bluntly explains that it is too bland. La Forge observes that it seems to agree with Worf, earning Worf a contemptuous look from Kurn.
After dinner, filled with rage, Worf goes to Kurn's quarters to demand an explanation. When the other expresses doubt of Worf's Klingon instincts, Worf erupts in a violent outburst. Kurn is pleased and says he's been testing Worf to see just how Klingon he was, revealing that he is really Worf's younger brother.
Kurn explains that when Mogh's family went to Khitomer, he had been left behind with their father's friend, Lorgh, and so escaped the massacre.
Worf explains to Kurn that the Starfleet officer that rescued him was told by the Klingon High Command that he had no living relatives, believing that Kurn was with the family and therefore killed at Khitomer. After the massacre, Lorgh adopted Kurn as his son and kept him in his family. When Kurn reached the age of ascension he was told the truth about his bloodline.
Kurn has sought Worf out because their father, Mogh, is accused of treason by the Klingon High Council. Supposedly, he had given the Romulans defense access codes allowing them to lower the shields of the Khitomer outpost just before the Romulan attack. Kurn had lived all these years, hiding his identity by masquerading as the son of Lorgh, but when he learned of the Council's action he came to Worf, asking him to challenge the judgment as Mogh's elder son.
Picard says that since Worf is accused of a capital crime it would be better if he were standing at Worf's side as he made his challenge, rather than simply granting him shore leave. Picard commands Kurn to set course for the First City of the Klingon homeworld. Kurn is surprised; he hadn't expected the Enterprise itself to change course. Now he respects Worf more deeply than ever.
On the way home, Kurn asks Worf if he can be his Cha'DIch, or ritual second; while Worf is accused, he will not be allowed in any duels or fights. Worf accepts, although he tells Kurn that he must not reveal his true bloodline, reminding Kurn that while on the Enterprise it's proper for Worf to obey Kurn; but in Council, Kurn will have to obey Worf, who is older.
Once they arrive at Qo'noS, Worf and Kurn beam down with Picard and Riker accompanying them. Worf pronounces his challenge before the Council and faces the accusations of Duras, the son of Mogh's greatest rival. Worf acknowledges that he is prepared to face the consequences with his very life if his challenge fails. "I am Worf, son of Mogh. I have come to challenge the lies that have been spoken of my father!", he defiantly states to the High Council.
Duras accuses Worf of forsaking his heritage for the Federation, but Picard tells the council that Worf has served under his command with distinction, earning Picard's admiration and respect. Appealing to the council's better natures, Picard says he trusts their wisdom will guide them to clear Worf's family name and return him to duty. Chancellor K'mpec notes the trust of a commanding officer is admirable and notes it for the record.
Duras testifies that a transmission of access codes went out from the outpost to the Romulan vessels which allowed them to dismantle the outposts' shields. Thousands of Klingons died on Khitomer, including Duras' father. Duras calls Mogh a traitor and because Worf has brought this challenge, Duras calls him a traitor as well, backhanding Worf in the traditions of their people. Duras then rips Worf's baldric off of him, telling Worf he is unworthy to wear the emblems of their people. Worf tells Duras "it is a good day to die, but the day is not yet over."
During a recess of the council, K'mpec meets with Worf and tries to persuade him into abandoning his challenge. Worf reacts with shock and dismay at this seemingly un-Klingon request, even though he understands that K'mpec's personal affection for Mogh may be influencing the request.
Kurn has received a note to meet someone in an isolated corridor; it is Duras. Duras reveals that he knows Kurn's true bloodline and tries to blackmail him into turning against Worf. Kurn refuses, and Duras' assassins attack and seriously wound him.
Although Beverly Crusher reassures Worf that Kurn's wounds are not life-threatening, Worf tells her she should have let him die because he'll be executed anyway. Worf asks Picard to be his Cha'DIch. Picard demurs, but Worf insists that there is no one better qualified. Picard accepts and recites the traditional Klingon words which mean "I accept with honor. May your enemies tremble before you."
Surprised by Worf's new Cha'DIch, Duras questions Picard's valditiy as Cha'DIch but Picard tells Duras that he's not here to command, to which Duras responds that he has to fight as well, which isn't something that is taught by Starfleet. Picard defiantly tells Duras that he is welcome to test that assumption at his leisure.
The Enterprise crew, on Picard's orders, are investigating the Khitomer massacre on their own. The USS Intrepid was the first ship on the scene of the disaster; Data contacts Starfleet for copies of the Intrepid's logs. Meanwhile, La Forge and Data have gotten into the Klingon central information net and discovered that the Klingons recently captured a Romulan ship with information about Khitomer in the ship's logs and that's how they found out about the treachery.
Upon comparing the information in the Klingon archives with the Intrepid logs, La Forge and Data discover that there is a discrepancy in the transmissions. The evidence which supported Mogh's guilt was faked. Another survivor of the Khitomer Massacre, a woman named Kahlest, is found. Picard is told about this by Riker during the second Council session and asks Worf, who says that Kahlest was his nurse and that he thought she had died. Picard tells Worf he must find her and bring her before the Council. Worf recommends that he not go alone, as it is too dangerous. Picard tells him, "Hey, I'm your Cha'DIch."
Using a cloak and keeping the hood up, Picard journeys into the Old City and finds Kahlest's home. Kahlest says she considers her life over after Khitomer and she is waiting to die. Picard tries to persuade Kahlest to accompany him back to the High Council chamber, telling her that the family that she once served proudly needs her again. She refuses, and Picard starts to leave. Just outside Kahlest's door, he is ambushed by Duras' assassins. He manages to overcome one, Kahlest emerges from her home, and throws a knife, killing the other. Kahlest now agrees to accompany Picard back to the High Council for the purpose of testifying for Worf. She also reveals that K'mpec was once romantically interested in her, but she wasn't attracted to him; he was too fat.
Just as K'mpec is about to pronounce judgment on Worf, Picard enters with Kahlest. In a private session, Picard demands that she be allowed to testify in open council in accordance with Klingon law. Duras is almost hysterically against it. K'mpec silences him by asking him if he would really kill an old woman to cover his dishonor. K'mpec's statement makes it clear that the dishonor rests not on Worf but on Duras; Kahlest is free to go. K'mpec tells Kahlest, "It is good to see you again", to which she responds, "You are still fat, K'mpec."
K'mpec privately explains the truth. When Klingons captured the Romulan ship with the records, they learned of the treachery behind the Khitomer Massacre; this soon became common knowledge, and someone had to answer for that treachery. Fortunately, only the Council knew who transmitted his code: not Mogh, but Ja'rod: Duras' father. K'mpec says the Duras family was too powerful and to expose him would likely split the Empire and cause a civil war. In order to avoid that, they decided to use Mogh as a scapegoat, believing that Worf, since he was in Starfleet, would not challenge the judgment. None of them realized that Kurn was Mogh's second child. Picard says this means Worf's challenge was successful. He refuses to hand Worf and Kurn over for execution. When K'mpec threatens to end the alliance with the Federation because of Picard's defiance, Picard reminds him that their alliance is not based on lies. If they must protect their secrets, then so be it but Picard will not allow the needless sacrifice of these two men.
Worf speaks up and says he'll volunteer to die for the sake of the Klingon Empire. Picard begins to object but Worf tells his Cha'DIch to be silent. Worf asks for Kurn's life to be spared. Duras rejects this, as Kurn's honor would then demand revenge. Worf then offers to accept discommendation if Kurn will be allowed to live. K'mpec tells Worf that doing so would be the same as admitting his father's guilt. Worf simply says "So be it." K'mpec states that Worf's heart is truly Klingon, and commands that this will never be spoken of again to anyone. Before they proceed, Worf calls Duras the son of a traitor and backhands him as tradition demands.
Kurn is heartbroken by Worf's decision, telling Picard that he was ready to die for Worf. Picard tells Kurn that he must live in order to restore the honor of Mogh's family. Picard tells Kurn that there will be another day. "Do not forget what he does here today. Do not let your children forget." Picard and Kurn join Worf in the middle of the council chambers and the council members gather in a circle around Worf. Worf says the ritual words, "tlhIH ghIj jIHyoj" ("I fear your judgment"); K'mpec replies, "biHnuch!" ("Coward!"), and one by one, the Council members cross their arms and turn their backs (turning to their right) on him in ritual ostracism. Worf softly tells Kurn that he must do it also. Almost on the verge of tears, Kurn very reluctantly complies, but instead of turning to his right, he turns to his left. The whole assembly having turned their backs, Worf and Picard leave the Council Chamber and return to the Enterprise.
"I imagine it must be very difficult for you to work with a crew that is so different. I would be happy to guide you in that regard, if it would be helpful."
"No Commander, it wouldn't."
"This is not a Klingon ship, sir."
"No Commander, it is not. If it were a Klingon ship, I would've killed you for offering your suggestion."
- Riker and Kurn
"How long has this bird been dead? It appears to have been lying in the sun for quite some time."
"Well it's not dead, it's been replicated. And you do understand that we cook most of our foods..."
"Ah yes, I was told to prepare for that. I shall try some of your burned replicated bird meat."
- Kurn and La Forge
"I never kill anyone at the supper table, Mr. La Forge."
- Kurn
"I am Klingon! If you doubt it, a demonstration can be arranged."
"That is a response of a Klingon. The response I would expect from my older brother."
- Worf and Kurn
"Will you grant my leave, Captain?"
"No - if I understand correctly, a Starfleet officer, a respected member of my crew, could be charged with a capital crime. Your actions on this matter will reflect on this ship, and on the Federation - therefore, it seems only appropriate that your captain should be at your side while you make your challenge... I'm sure you would do no less for me."
- Worf and Picard
"I am Worf, son of Mogh. I have come to challenge the lies that have been spoken of my father!"
- Worf, to the Klingon High Council
"I should've known. Worf was right. It is a good day to die."
"The time has not yet come. It does not have to come for many turns. I know who you are, Kurn, son of Mogh."
"What?!"
"It was a wise choice to hide your family name. Do not err now by embracing it again, for you only embrace death."
"We shall see."
"Worf has made a choice and he will die for it. But you can still be safe. Let him stand alone."
"He is my brother! I will not betray him!!"
"Then you will die for him!!"
- Kurn and Duras
"Are you adjusting to your new environment, Commander?""I find the constraints a bit difficult to conform to. Just a short while ago I had to stop myself from killing Commander Riker."
- Troi and Kurn
"For many turns, the truth about Khitomer has been dormant. Unknown. Now the truth has been revealed. The traitor, Mogh, sent the defense access codes to the Romulan patrol ships, allowing them to destroy the outpost. Thousands died on Khitomer! My father died on Khitomer! Their deaths must be avenged. Your father was a traitor. By posing this challenge, you are a traitor! You will not wear the emblems of our people. You are a fool, and your challenge can only result in a fool's death."
"It is a good day to die, Duras, but the day is not yet over."
- Duras and Worf
"This is not your world, human. You do not command here."
"I'm not here to command."
"Then you must be ready to fight. Something Starfleet does not teach you."
"You may test that assumption at your convenience."
- Duras and Picard
"My appreciation, madam."
- Picard, to Kahlest after she kills a Klingon who was about to murder him
"This Ha'DIbaH should've been fed to the dogs!"
- Worf, pointing at Duras
"You are brave, cha'DIch. Worf chose well."
- Kahlest, after Picard fights off Duras's assassins
"K'mpec would remember Kalest. I caught his eye back then. But he was too fat."
- Kahlest
"It is good to see you again."
"You are still fat, K'mpec."
- K'mpec and Kahlest
"You admit the truth, and yet you expect him to accept punishment? What does this say of an empire who holds honor so dear?"
"The empire will not be destroyed for one family's honor."
"Unacceptable, K'mpec!"
"You have no say in this, cha'DIch!"
"I speak now as the captain of the USS Enterprise and Lieutenant Worf's commanding officer! You will not execute a member of my crew, nor will I turn his brother over to you!"
"This is not the Federation, Picard. If you defy an order of the High Council, the alliance with the Federation could fall to dust."
"The alliance with the Federation is not based on lies, K'mpec. Protect your secrets if you must, but you will not sacrifice these men."
This story began life as two different scripts, one by Drew Deighan which featured Worf's father being accused of treason, and another script by Beth Woods, in which Worf's brother came aboard the Enterprise. Shortly after officially joining the writing staff, Ronald D. Moore was given the two scripts by Michael Piller and asked to combine them into a single story. (TNG Season 3 Blu-ray, episode commentary)
Moore recalled, "I was in love with 'Sins of the Father' and I fought for it when there was some question about which way we were going to go with it. I really like the fact Worf took it on the chin that episode. It said he was willing to stand up and do the right thing for his people, even if they weren't going to do the right thing by him. Patrick and I were at the Saturn Awards together, and he made a really good suggestion. When Worf is asking Picard to be his Cha'DIch, Picard originally says a single Klingon word, but Patrick thought it would be nice if Picard knew the whole line of ritual. At that time there wasn't a formal ritual, and there wasn't one for Kurn either, so I went back and wrote a line for him to say in Klingon and I tied it into Picard." (Captains' Logs: The Unauthorized Complete Trek Voyages, p. 193)
Director Les Landau recalled, "Here was an opportunity to explore the Klingon world in depth from beginning to end. Meaning that Ron Moore came up with a wonderful story which Richard James, the art director, and Jim Mees, the set decorator, had to visualize in terms of set design and set decoration. Additionally, to which Marvin Rush, the cameraman, had to conceptually find a visual representation of what the Klingon world was all about. I think all three of those gentlemen accomplished that task totally. In fact, Richard and Jim went on to win Emmy Awards for that episode, which I'm very proud of. Marvin's work speaks for itself. It was visually one of the most dynamic episodes ever done. It looks like a feature film. There were long detailed conversations about how, conceptually, we should deal with them. Ultimately, Rick Berman gave the final approval for each and every one of the ideas and details, and we showed a world that was heretofore never seen before, and which the audience craves to see more of. I was never one of the original Star Trek fans, however. My attitude was, is and always will be to never see what has come before, but to go where none have before and visualize what is in my thinking and mind as to what the visuals should be, which is dictated by the storyline. We must always come back to the words and what the story is, because without it, we have nothing to tell. After all, film and episodic television is nothing if not telling a story." (Captains' Logs: The Unauthorized Complete Trek Voyages, p. 194)
The design of the Klingon Great Hall (and other sets in the episode) won an Emmy Award for Best Art Direction for Star Trek: The Next Generation production designer Richard James. The exterior of the Great Hall and the surrounding First City was a matte painting created by Syd Dutton at Illusion Arts. (Star Trek Encyclopedia 1st ed., p. 118)
Kahlest tells Picard that Mogh "was loyal to the emperor." However, "Rightful Heir" will later establish that the Klingons haven't had an emperor in 300 years. Thus, we must assume that Kahlest was abstractly referring to the Emperor Kahless and his guiding principles for all Klingons.
This is the only episode where Duras' father, Ja'rod, is actually named.
Picard refers to the Klingon state as the "Klingon Imperial Empire," a redundant designation which was never used again.
Moore remarked, "I thought Tony Todd did a wonderful job as Worf's brother. I was kind of worried, because there's always that hesitation when you're bringing in other family members no one else has even seen. Half the audience is ready to throw things at the screen, and you're thinking, 'This better work.' I was there when he stepped on the stage and made it his own." (Captains' Logs: The Unauthorized Complete Trek Voyages, p. 193)
Moore saw this episode as a turning point towards more continuing story arcs on The Next Generation. He commented, "The biggest decision on this show was the ending...where Worf takes it on the chin and decides to accept his dishonor even though he knows its a lie but he does it for the greater glory of the Empire and he walks out the door and it ends with this sense of 'Oh my God. This has changed Worf forever, and what's going to happen to him next?' And what that did to the franchise overall was it suddenly said there's a continuing story here...As soon as Worf walks out the door with his dishonor it demands a follow-up. And that's why we eventually came back to "Reunion" and "Redemption" and on and on and on. All the Worf stories spring from that moment, and also opened up the whole franchise to the idea that maybe we can do continuing stories. It was really a pivotal moment looking back on how we structured Next Generation." (Chronicles from the Final Frontier, TNG Season 4 DVD special features)
Michael Dorn observed, "There was a lot more involved in it than the writers realized. Things that have to do with Klingon loyalty and honor. They didn't give it its due. You look at Worf in a different light, and I've played him in a different light since that episode. This is not something they have come up with. I'm doing this on my own. Hey, it's their fault. They wrote it. So now, I'm going to carry on with it." (Captains' Logs: The Unauthorized Complete Trek Voyages, pp. 193-194)
The episode was one of three selected for inclusion in the Star Trek: The Next Generation - The Next Level sampler disc intended as a preview of the remastering process for The Next Generation. Amongst the adaptations required to bring the episode up to high-definition quality included a restaging of the opening shot as a digital matte painting, and a new image of Qo'noS by Max Gabl (as the original was output directly to videotape using Video Toaster, and did not exist as a film element). [3]
One complication arose with this episode: thirteen seconds of the original film negative - the first part of the scene in Act Four where Crusher and Riker discuss the discovery of the additional survivor, Kahlest - could not be located. As a result, this sequence had to be upgraded from the standard definition master tape. [4] On 11 April 2012 director Robert Meyer Burnett confirmed that the missing thirteen seconds were located and will be included in the TNG Season 3 Blu-ray, [5] and a preview of the fully-restored scene was included in the TNG Season 1 Blu-ray bonus features. |
Image copyright Getty Images Image caption Cecil the lion, killed in 2015, was a major attraction at a national park in Zimbabwe. His black-fringed mane was an identifying characteristic
Hunting animals that stand out from the crowd because of their impressive horns or lustrous manes could lead to extinction, according to a study.
Research predicts that removing even 5% of high-quality males risks wiping out the entire population, for species under stress in a changing world.
Animals prized by trophy hunters for their horns, antlers or tusks usually have the best genes, say UK scientists.
Removing these could push a species over the edge, they warn.
There is intense global debate over trophy hunting. Some argue that it should be banned or restricted, while others say it can provide valuable revenue for conservation.
Dr Rob Knell of Queen Mary, University of London, who led the research, said the assumption that so-called selective harvesting is not especially threatening to a population of animals does not take into account recent work.
''Because these high-quality males with large secondary sexual traits tend to father a high proportion of the offspring, their 'good genes' can spread rapidly, so populations of strongly sexually selected animals can adapt quickly to new environments,'' he said.
''Removing these males reverses this effect and could have serious and unintended consequences.''
Human hunting is different from natural predation in that big-game trophy hunters target large animals, usually males.
They may be awarded prizes for killing animals with exceptionally large antlers, horns or manes.
And illegal poaching of animals such as elephants for the ivory trade also targets animals with the biggest tusks.
Using a computer simulation model, the scientists were able to predict the impact of selectively targeting males on the basis of their secondary sexual traits.
''If the population is having to adapt to a new environment and you remove even a small proportion of these high quality males, you could drive it to extinction,'' said Dr Knell.
''You're removing the genes from the population that would otherwise allow the population to adapt.''
In the past, human hunting has led to the extinction of many animals, from the zebra-like Quagga, which was once common in Southern Africa, to the Tasmanian tiger of mainland Australia and Tasmania.
Hunting is still legal in many countries; trophy hunting takes place over a larger area in Sub-Saharan Africa than is conserved in national parks.
In the US and Canada, there is also a lucrative trophy hunting industry, for the likes of deer and big-horn sheep.
Some argue that revenue from trophy hunting can support conservation efforts and local livelihoods.
The scientists said age restrictions that allow males to breed before being removed could reduce the impact of trophy hunting.
This is already recommended with some species, such as lions.
"When properly regulated trophy hunting can be a powerful force for conservation which is why we're suggesting a different management approach as opposed to calling for a ban," said Dr Knell.
The study is published in Proceedings of the Royal Society B: Biological Sciences.
Follow Helen on Twitter. |
The parking lot near Cycle Gear was filled with onlookers of a triple murder scene Saturday afternoon. Police say earlier, there was an altercation in the parking lot outside before gun shots rang out.More >>
The parking lot near Cycle Gear was filled with onlookers of a triple murder scene Saturday afternoon. Police say earlier, there was an altercation in the parking lot outside before gun shots rang out. More >>
NORTH CHARLESTON, SC (WCSC) -
New details have emerged in the melee and shooting which left three men dead and one injured at a North Charleston cycle shop over the weekend, but many questions remain.
Arrest warrant affidavits for Ronald Reid, 43, and Barry Stinson, 32, add more context to the frightening and chaotic scene Cycle Gear employees described over the weekend.
Investigators say 41-year-old Maurice Lamark Horry and another man, members of the Real Kingz motorcycle gang, walked into the store located at 4400 Dorchester Road a little after 3:15 p.m. Saturday to buy some merchandise. Employees said Horry and his friend were regular customers of the shop.
A short time later, North Charleston police say Stinson and four other men entered the store and told them to walk outside to the parking lot, where approximately 15 members of a motorcycle gang were waiting.
"We've got shots fired in the parking lot," says employee Stan Foxworthy to a 911 dispatcher."We've got a bunch of motorcyclists out here. They started to fight inside the store, took it outside."
When the two men refused, investigators say Stinson and the other men proceeded to punch and strike one victim. Police say Stinson used what witnesses described as a "paddle stick" to beat the man about the head and body until he collapsed to the ground and lost consciousness.
Stan Foxworthy, an employee, said, "There was just a gaggle of people and fists started flying and that's when everything erupted."
Employees described the fight as unlike anything they had ever seen, saying they saw bodies of grown men tumbling out the door.
About that time, investigators say Horry fled to the parking lot to retrieve a pistol from under the seat of his motorcycle. Witnesses told police Horry pointed his gun at the large group of men and ordered them to back away.
At that time, police say Reid pulled out his own handgun and shot Horry in the chest. Horry returned fire, and shot Reid in the leg before he died, investigators said.
Reid has since confessed to shooting at Horry, according to the affidavit.
Another employee, Jermey Millar said, "I heard 6, 7 shots fired constantly and I ran to the bathroom, shut the door. Even with the door shut I could still hear gun shots outside and screaming and yelling."
During the flurry of gunfire, officers said two other men, 39-year-old Carlos Davis, of Columbia, and 36-year-old Theodore Waymeyers Jr., of Summerville, were also shot. Both men died en route to the hospital. Their murders remain under investigation.
Millar said one man who was attacked made his way back into the store with a gun during the ruckus. "I heard the man that was attacked right here. He was yelling ‘someone call EMS, someone call the cops this guy is dead,'" said Millar.
Millar said the man seemed like he was scared for his life, pointing the gun at the other bikers as they dared him to come outside.
Millar said, "They were mostly telling him ‘just come outside, this will be over easy. You're going to die anyways, probably.'"
Police have not released many details from the incident, and the actual motive behind the attack remains unknown.
"These guys come in, it's a bike gang and they started having an argument," an employee can be heard in a newly released 911 call."Started getting into fist fights and all of a sudden they start popping caps."
Reid was denied bond on a charge of first-degree murder on Monday, while Stinson was issued a $500,000 bond for second-degree assault by mob. Both men are being held in the Charleston County Detention Center. |
Ukrainian Cultural Heritage Village
The Ukrainian Cultural Heritage Village () is an open-air museum that uses costumed historical interpreters to recreate pioneer settlements in east central Alberta, Canada, northeast and east of Edmonton. In particular it shows the lives of Ukrainian Canadian settlers from the years 1899 to 1930. Buildings from surrounding communities have been moved to the historic site and restored to various years within the first part of the twentieth century.
"The Village", as it is colloquially known, has a very strong commitment to historical authenticity and the concept of living history. The Village uses a technique known as first-person interpretation which requires that the costumed performers remain in character at all times (or as much as is feasibly possible). Actors answer all questions as if it is the year their building portrays. Although this technique is startling for some visitors at first, it allows for a much stronger experience of immersion in history than traditional third-person interpretation where the actor acknowledges that he is, in fact, in a museum.
The village is in Lamont County on the Yellowhead highway, on the eastern edge of Elk Island National Park.
Monuments
Alberta Centenary Pioneer Recognition Monument
Cenotaph to the Ukrainian Canadian Soldier
Joseph Olesków Monument – by Leo Mol
Pioneer Family Monument – by Leo Mol
Statue of Vasyl' Stefanyk
Ukrainian Canadian Internment Camp Monument
Chornobyl Disaster Commemorative Cross
Stelmach House
Buildings
The Museum is divided into thematic areas: Overview, Farmsteads, Rural Communities, and Town sites.
Note: the spellings used for names and locations are those from the time to which the building has been restored, and may not match those in use today
Name (indicates the name of the owners or operators of a building and its original location), as well as the time period to which it has been restored
Overview
Provides an introduction to Galician and Bukovynian immigration to Canada by showing the homes of three settler families. Iwan Pylypow was one of two individuals who set off the mass migration of Ukrainians to Canada at the end of the 19th century. His family was Galician. His third house in Canada is preserved at the Village. The second house is that of Mykhailo and Vaselina Hawreliak. The Hawreliaks were a large Ukrainian Bukovynian family who settled in the Shandro area. By the 1920s Mykhailo Hawreliak was quite successful, and the house preserved here has five bedrooms and a cistern that collected rainwater for use in the kitchen. The Nazar Yurko family was also from Bukovyna, but was of Romanian descent.
Pylypow House (Star, Alberta; Built 1906, depicts 1923–1929)
Hawreliak House (Shandro, Alberta; Built 1919, depicts 1925–1928)
Yurko House (Boian, Alberta; Built 1920, depicts 1932)
Farmsteads
Shows different farmyards from different eras/stages of development.
Township Survey Marker (Reconstruction to circa 1892) – marked the corner of a Township (36 square miles), containing 160 acre plots of land for farming that were surveyed prior to the mass influx of European immigration to the Canadian Prairies
The newly arrived immigrants
Burdei – Based on field research and archaeological findings; reconstructed to 1900 - Temporary shelters dug out of the ground or into
the side of a hill were a common feature of the earliest farms of the Ukrainian immigrant settlers.
The Bukovynian settlers
Grekul House (Toporivtsi, Alberta; Built 1915, depicts 1918–1919)
Grekul Granary (Toporivtsi, Alberta; Built 1908-1909, depicts 1918–1919
Grekul Barn (Toporivtsi, Alberta; Built 1915, depicts 1918–1919
Roswiyczuk Granary (North Kotzman, Alberta; Built 1914, depicts 1918)
Makowichuk Barn (South Kotzman, Alberta; Built 1912, depicts 1918)
The Galician settlers
Hlus' House (Buchach, Alberta; Built 1915–1916, depicts 1918)
Hlus' Barn (Buchach, Alberta; Built 1915, depicts 1918)
Hlus' Chicken Coop (Buchach, Alberta; Built 1915, depicts 1918)
Lakusta Barn (Amelia-Cookville, Alberta; Built 1915, depicts 1918)
Lakusta Granary (Amelia-Cookville, Alberta; Built 1912, depicts 1918)
The later immigrants
Slemko House (South Kotzman, Alberta; Built 1912, depicts 1919)
Slemko Granary (South Kotzman, Alberta; Built 1913, depicts 1919)
Slemko Barn (South Kotzman, Alberta Built 1914, depicts 1919)
Pigsty (Based on field research; reconstructed to 1919)
Ukrainian-Canadian farmers
Hewko House (Podola, Alberta; Built 1917–1924, depicts 1930)
Kitt Threshing Machine Shed (Myrnam, Alberta; Built 1922, depicts 1930)
Chernochan Machine Shed (Smoky Lake, Alberta; Built 1915, depicts 1925-1928
Rural community (reflecting 1925–30 time period)
Roadside Shrine (Based on field research; reconstructed to 1919)
Luzan Grocery (Luzan, Alberta; Built 1927, depicts 1929)
Luzan Post Office (Luzan, Alberta; Built 1926, depicts 1929)
Kiew Hall – a community centre; originally independent, later (1930s) affiliated with the Ukrainian Labour Farmer Temple Association (Kiew, Alberta; Built 1924, depicts 1930))
St. Nicholas Russo-Greek Orthodox Church (Kiew, Alberta; Built 1908, depicts 1925–1928)
Kolody Sawmill (Vilna, Alberta; Manufactured 1927, depicts 1929)
"Russia" School and Barn (Musidora, Alberta; Built 1910, depicts 1926–1929)
Russia" School Barn (Musidora, Alberta; Built 1926, depicts 1926–1929)
South River Teacher’s Shack (South River, Alberta; Built 1921, depicts 1927)
St. Nicholas Ukrainian Greek Catholic Church (also known as St. Mary's or Hlus' Church) (Buchach, Alberta; Built 1912, depicts 1930)
Town site (reflecting 1925–30 time period)
St. Vladimir's Ukrainian Greek Orthodox Church (Vegreville, Alberta; Built 1934, depicts 1934–1935)
Wostok Hardware Store (Wostok, Alberta; Built 1937–1938, depicts 1939)
Hilliard Pool Hall (Hilliard, Alberta; Built 1925, depicts 1930)
Hilliard Pool Hall Stable & Garage (Hilliard, Alberta; Built 1925, depicts 1930)
Market Square
Radway Post Office, Telephone Exchange, and Municipal District Office (Radway, Alberta; Built 1920, depicts 1929)
Radway Postmaster’s Garage (Radway, Alberta; Built 1927, depicts 1929)
Radway Livery Barn (Radway, Alberta; Built 1927, depicts 1929)
Pawlenchuk Lot Barn (Smoky Lake, Alberta; Built 1930, depicts 1932)
United Merchants of Alberta General Store (Smoky Lake, Alberta; Built 1932, depicts 1932)
Andrew Alberta Provincial Police Post (Andrew, Alberta; Built 1913, depicts 1925–1928)
Bellis Home Grain Co. Elevator (Bellis, Alberta; Built 1922, depicts 1928)
Bellis Canadian National Railway Station (Bellis, Alberta; Built 1923, depicts 1928)
Morecambe School (Morecambe, Alberta; Built 1929, depicts 1930)
Hilliard Hotel (Hilliard, Alberta; Built 1928, depicts 1929)
Alberta Lumber Co. Office (Lamont, Alberta; Built 1907–1910, depicts 1928)
Alberta Lumber Company Cement Shed (Lamont, Alberta; Built 1906, depicts 1928)
Demchuk Blacksmith Shop (Myrnam, Alberta; Built 1927, depicts 1929)
Demchuk House (Myrnam, Alberta; Built 1928, depicts 1929)
Woodworking Shop (Based on field research; reconstructed to 1930)
Affiliations
The Museum is affiliated with: CMA, CHIN, and Virtual Museum of Canada.
See also
Kalyna Country – an ecomuseum region in East Central Alberta, of which the Village is a part
List of Canadian place names of Ukrainian origin – some of the places where the Village's buildings and machines are from are listed on this page (in the Alberta section)
Narodny dim – community centres with a Ukrainian cultural emphasis concentrated in districts inhabited by Ukrainian Canadians across the Prairie provinces
References
External links
Alberta Community Development – Ukrainian Cultural Heritage Village
University of Alberta – Ukrainian Cultural Heritage Village
Google Map to Ukrainian Cultural Heritage Village from Edmonton, Alberta, Canada Route Map Overhead view
Category:Lamont County
Category:Provincial historic sites of Alberta
Category:Living museums in Canada
Category:Ukrainian-Canadian culture in Alberta
Category:Ukrainian museums in Canada
Category:Open-air museums in Canada
Category:Church museums in Alberta
Category:Farm museums in Alberta
Category:Historic house museums in Alberta
Category:Grain elevator museums in Alberta
Category:Railway station museums in Alberta
Category:Ukrainian culture
Category:1974 establishments in Alberta |
Social Actavis: Soulja Boy Petitions to Keep Lean on Shelves
Global pharmaceutical brand Actavis recently announced that they are discontinuing their “Prometh With Codeine” cough syrup because Drake rapped about the product and Actavis didn’t want to be associated with a Canadian. Well, that wasn’t their reasoning, but I have my suspicions. The extremely popular drug is used to make lean by mixing the product with soda, typically Sprite. Popularized by rappers, some people in the hip hop community are sad to see the drug go. Maybe the saddest of all these dudes is Soulja Boy.
According to extremely relevant media outlet TMZ, Soulja Boy is, “mad as hell” over the decision to discontinue the product. Soulja claims that, “Acatvis is running away from money … they could be selling out everywhere.”
Soulja feels so strongly about the issue that he is “rallying his friends together in a petition drive” to get the drug back on the shelves. However, if Soulja is really about that money, he should just stock up and make that cake himself. Surely the discontinuation is going to drive up the street price of a pint; doesn’t Soulja want to make some motherfuckin’ money?
On a serious note this discontinuation is a good thing. Actavis has already taken many rappers lives, including Pimp C and DJ Screw, and its popularity seems to be at an all time high. It would be disheartening to see another rapper fall due to the addictive cough syrup.
Actavis didn’t take pimp c or screws life. They were sipping barre pharmaceuticals prometh w/ codeine. Hence big moes name barre baby and other rappers of the time rapping about sippin barre not actavis.
T
And there’s already another new company making purple, it’s called trispharma. Slightly different tint of purple and a less sweet taste. |
Sports
Texans Countdown to the Draft – Note: Homegrown Players
Rookie kicker Randy Bullock is set to make a kick. (credit: Anna-Megan Raley/CBS Houston)
The state of Texas has great football passion and pedigree, whether it be at the youth, high school, college or pro level. So it should be no surprise that the Houston Texans have drafted 17 players overall and at least one player in every draft who either went to college or high school in Texas, or is from the Lone Star State.
Below is a look at what players the Houston Texans have drafted who are either from Texas or went to college in Texas. |
Why Practicing Indoors Is More Effective
August 16, 2016
Why Practicing Indoors Is More Effective
How often do you visit the outdoor driving range and mindlessly crank through a bucket of balls? You will often feel like you are making the effort and leave feeling pretty good, albeit in Singapore you feel awfully hot and soaked in sweat! However, there is a common misconception that going to the driving range will ultimately improve your golf game.
Whacking balls into a field is an inexpensive way to get to know the average distances of your clubs, but it isn't a very accurate method.
Range Balls vs Game BallsUnless you're bringing your game balls to the range, you are hitting balls that are designed to be durable and often they won't perform like your preferred game ball. They have different compressions = fly different distances from ball to ball.
Distance MarkersMarkers are generally set up every 50 meters, which leave you guessing the exact distance for the balls you hit in between the markers. The average player has about 7-10 meters in between each properly struck iron. So how do you end up deciding what club to hit 134 meters, for example.
Ball LocationEven if you had perfect vision, determining exactly where your ball lands in a sea of other range balls isn't exactly easy or precise.
Golf simulators, on the other hand, give you precise feedback every single shot. You are given exact calculations of your precise carry and total distance, ball speed, how far shots are missed left or right, and provided with visuals of your actual shot as well as trajectory view and dispersion view. You understand exactly where your ball went, which allows you to adjust and adapt, speeding your learning process with confidence.
Learning indoors on a simulator means you eliminate the hot and sweaty mess after your practice session! Cool and calm people often are able to learn and perform better. Having a private simulator gives beginner golfers the opportunity to practice privately, away from the crowd of golfers you'll find on a driving range - it can get intimidating sometimes.
Indoor golf centers, such as Urban Fairways, are aimed at improving your golf game fast and efficiently in a calm, and relaxing environment. The combination of great music in the background, easy lighting, relaxing drinks, and great quality food and service creates a very unique and easy learning environment. Golf is as much a mental sport as it is a physical one, and as a golf pro, I guarantee you would learn better on a simulator with instant high-tech feedback as opposed to on an outdoor range. |
Assessing the impact of growth hormone deficiency and treatment in adults: development of a new disease-specific measure.
Approximately 50 000 adults in the United States are diagnosed with GH deficiency, which has negative impacts on cognitive functioning, psychological well-being, and quality of life. This paper presents development and validation of a patient-reported outcome measure (PRO), the Treatment-Related Impact Measure-Adult Growth Hormone Deficiency (TRIM-AGHD). The TRIM-AGHD was developed to measure the impact of GH deficiency and its treatment. The development and validation of the TRIM-AGHD was conducted according to the Food and Drug Administration guidance on the development of PROs. Concept elicitation, conducted in three countries included interviews with patients, clinical experts, and literature review. Qualitative data were analyzed based on grounded theory principles, and draft items were cognitively debriefed. The measure underwent psychometric validation in a US clinic-based population. An a priori statistical analysis plan included assessment of the measurement model, reliability, and validity. Item functioning was reviewed using item response theory analyses. Forty-eight patients and six clinical experts participated in concept elicitation and 169 patients completed the validation study. TRIM-AGHD was measured. Factor analysis resulted in four domains: energy level, physical health, emotional health, and cognitive ability. The item response theory confirmed adequate item fit and placement within their domain. Internal consistency ranged from 0.82 to 0.95 and test-retest ranged from 0.80 to 0.92. All prespecified hypotheses for convergent validity and all but two for discriminant validity were met. The final 26-item TRIM-AGHD can be considered a reliable and valid PRO of the impact of disease and treatment for adult GH deficiency. |
Q:
O que é e como funciona o Pós-Processamento de CSS?
O que seria um pós-processamento de CSS? Eu já tinha ouvido falar em CSS pré-processado, como o Gulp faz quando compila um SASS em CSS. Mas recentemente escutei o termo CSS pós-processado e fiquei sem entender direito o que é e como ele funciona.
O que seria esse prática de pós-processar o CSS, quais vantagens ela traz para o CSS? Melhora a performance ou a manutenção do código?
Como de fato funciona esse pós-processamento, o que ele faz com o meu .css?
A:
Um pós-processador de CSS nada mais é que um programa para ajudar no desenvolvimento de códigos CSS.
Igual o SASS?
Não.
pré-processamento vs pós-processamento
Diferente do pré-processamento de códigos (Sass, Lass e Stylus) que, quando processado, seu código é interpretado e é transformado em CSS, o pós-processamento pode atuar diretamente no código CSS para melhorá-lo de alguma forma.
No pré-processamento você instrui a construção do código css. Aqui você tem um controle grande do que será produzido.
No pós-processamento você manda analisar o código e o interpretador altera seguindo suas próprias regras. Você não tem muito controle, até porque o pós-processamento serve para te proteger de si mesmo como veremos a seguir...
[...] quais vantagens ela traz para o CSS? Melhora a performance ou a manutenção do código?
Depende do pós-processador. O cssnano por exemplo, apenas compila o código CSS, apagando comentários e deletando coisas inúteis. Ou seja, pode melhorar a performance.
Um pós-processador que tem o intuito de ajudar na manutenção e na produção do código é o stylelint...
"que ajuda a evitar erros e impor convenções em seus estilos"
Existe também o autoprefixer, o mais famoso, que ajuda no desenvolvimento, gerando os códigos para navegadores distintos e suas respectivas versões. Exemplo:
entrada.css
body {
display: flex;
}
saida.css
body {
display: -webkit-box;
display: -webkit-flex;
display: -ms-flexbox;
display: flex;
}
|
Choosing the best healthcare provider is an important decision. Women’s healthcare is diverse: it begins in early adolescence, continues through childbearing
years, and lasts through menopause and beyond. You need a doctor who is not only knowledgeable but caring, accessible, and willing to take the time to go through your options with you as a human being, not a patient.
We offer a knowledgeable staff, safe and proven procedures, and the latest in medical technology. We are available twenty-four hours a day for our patients’ needs. |
Q:
C3X Polling Strategy - Fewest Answered
I've been playing around with a 3CX PBX system and have been trying to alter a call queue so that members of staff that have had the fewest calls will get called first.
So I have set the call queues polling strategy to "Fewest Answered" however our newest member of staff is complainning that she is now receiving all calls rather then been spread out over the team equally.
My question is what time period is the "Fewest Answered" covering. Is it looking for the fewest answered extension from the whole time the PBX has been running or for that day etc?
A:
Resetting the call statistics for the queue will do it, can also configure it to be done on a schedule.
|
Q:
HTTP Very Low Level Requests By PHP
I was thinking how can I write a function in PHP which will take a single string argument as follows:
function executeHTTP($cmd)
{
//some way to execute $cmd
}
Now $cmd is what it contains...
$cmd = "
POST /action/GetUploadToken HTTP/1.1
Host: gdata.youtube.com
Authorization: AuthSub token="DXAA...sdb8"
GData-Version: 2
X-GData-Key: key=adf15ee97731bca89da876c...a8dc
Content-Length: 1941255
Content-Type: application/atom+xml; charset=UTF-8
<?xml version="1.0"?>
<entry xmlns="http://www.w3.org/2005/Atom"
xmlns:media="http://search.yahoo.com/mrss/"
xmlns:yt="http://gdata.youtube.com/schemas/2007">
<media:group>
<media:title type="plain">Bad Wedding Toast</media:title>
<media:description type="plain">
I gave a bad toast at my friend's wedding.
</media:description>
<media:category
scheme="http://gdata.youtube.com/schemas/2007/categories.cat">People
</media:category>
<media:keywords>toast, wedding</media:keywords>
</media:group>
</entry>
"
Any idea how can I do that?
A:
http://php.net/manual/pl/function.fsockopen.php
|
Allan Cheesman: Return of the Native
Published: 23 July, 2008
After a testing year at BRL Hardy, Allan Cheesman is back in charge at his alma mater, Sainsbury's. Margaret Rand talks to the Big Cheese about company structures, conspiracy theories and the future of the supermarket wine sector.
Allan Cheesman occasionally speculates on what would have happened had he taken the other trainee buyer's job that was advertised internally in 1972 - the one for buying not wine, but cheese. "I suppose I'd be a brie expert, or something." In any case, he would not have got it because it would have been funny, and "that wasn't the Sainsbury's way". If he had had a different name, and had been at the forefront of a cheese revolution instead of a wine revolution, he would probably nevertheless still be working at Sainsbury's. He is a company man through and through; as one source said of him: "There's JS written right through the stick of rock." He likes big company structures and hierarchies and methods; perhaps, in spite of his abrasive reputation, what he really likes is to fit in. Cheesman's ambition from the age of six was to join the Royal Navy. As a child he would be taken to Portsmouth Navy Days, and later on had a cadetship lined up. He passed all the medicals, all the interview boards, and then at the last moment, when he was waiting to join and had a final medical as a rubber stamp, he was told that his eyesight had dropped just below the limit. It is not hard to imagine how painful the blow must have been. He had no university place as an alternative, and went off to work on a building site for six weeks before starting to job hunt. "I still get a lump in my throat if I get on a ferry and go past the ships at Portsmouth." There followed a three-year stint at Barclays DCO - Dominion Colonial and Overseas - which he hated, and on 1 December 1972 he joined Sainsbury's. He knows the date exactly. He knows that it was on 24 July that he joined the wine team; he can tell you the names of every other person in the department at that time, the price of the Cte de Beaune on the Sainsbury's list (54p) and approximately where it came from ("mostly the Rhne and Midi; we never really asked"). He knows that it was on 27 May 1983 that he introduced the ground-breaking Vintage Selection range, which included such wines as Torres Gran Coronas and Pavillon Rouge. ("Miguel Torres Jr never told his father that one of his wines had a supermarket label on it.") He has, in short, a phenomenal memory for such things, and can reel off dates and prices and names by the yard; he cannot, however, remember the passwords for his computer, and keeps them on a yellow sticker under his keyboard. I hope this is not a sackable offence at JS. Because he has, of course, already left Sainsbury's once. Why? His answer was off the record, and will remain so. It was perhaps the only moment in our interview when his guard really came down; leaving must have been a momentous decision. It was not because he was sacked, as some say; nor was it, as others say, because he had not been put on the main board. The conspiracy theory that Cheesman himself has heard, that he was sent to BRL Hardy as a mole, is as wide of the mark as conspiracy theories usually are. But one should perhaps remember that Sainsbury's was going through a period of turmoil at the time: being promoted to a job which involved sitting on 32 committees and having 100 buyers under you at such a time must have been grim, to say the least. Particularly when it was removed from everything you liked doing. Cheesman will not say anything negative about Sainsbury's, but one can speculate that this was the only time that the JS love affair turned sour for him. And so he went to BRL Hardy as marketing director. He describes it as "a brave thing to do", and so it was, not least because it was widely read as a step downwards. How was the culture different? "It was going from big to small, of course. There were communication issues: Australia was 12 hours away if you wanted to telephone, or 26 hours away if you wanted to go there. Time pressures were different, and there were different thought processes. I wasn't in charge of my own destiny. BRL Hardy is vertically integrated, and producing stuff on an annual basis" - which then, of course, had to be sold to retail outlets, which must suddenly have seemed horribly unbiddable. So when he was asked to come back to Sainsbury's, he came. "I've got a new lease of life," he said. "I had a great year at Hardy's, but the last two months have been the best ever." What would he do if Sainsbury's again wanted to promote him away from what he likes best? "I don't think I'd be offered a bigger job now." And then he was off on a riff about Sainsbury's, how the Sainsbury's of mid-2000 is very different from the Sainsbury's of mid-1999, how it is focused now, how there is a can-do attitude, how PR is being stepped up. Then he said: "I admire the competition." Well, I nearly fell off my chair. Best of enemies Now, I cannot vouch for every single thing that Cheesman ever said about the competition when Sainsbury's was riding high in the late 80s. But the impression I was left with, was that he did not say anything nice about them unless it had a sting in the tail. This observation, however, seemed genuinely to surprise him. "It's not true that I never said good things about them. I'm the best of enemies with them all If I'm rude to them, I like them. If I'm coldly polite, watch it." Opinions about him certainly vary. "He's shy, serious, straightforward. What you see is what you get. He gets on with the job." Thus Angela Muir MW. Another source described him as "sharp, chippy and defensive". He said he was surprised the other day when somebody suggested that he was a hard negotiator. "I have a statement which goes, I'm not in business to put you out of business. But I also say, you can have one Rolls-Royce, but not two. You can only push it so far. If you go too far on price and the supplier says yes, the first shipment will be all right and the second will be all right, but the third won't be as good. You get what you pay for. Not squeezing too far on price is the secret. Though if you're in France, 11.55am is a good time to get to the difficult bit Often supermarkets have been accused of a policy of win-lose: I win, you lose. That's had to change." Ups and downs Sainsbury's is certainly notable for keeping its suppliers for a very long time, which argues that there is satisfaction on both sides. But as a wine retailer it has had its ups and downs, seeming at times to lose its way. "I'd like to say it was when I went to fresh produce," said Cheesman. "We were number one for many years; we were pioneering. Then the others caught up. When you have the playing field to yourself, perhaps you get a touch complacent. The others were doing well. And the raw material itself has got better. Twenty-five years ago you had to be really on your toes. Now you still have to be on your toes, but the stuff coming into the sampling room is mostly all pretty good now. "It wasn't so much that we went off, as that the competition caught up. The early 90s were quite a tough time. I wasn't in charge then. The recession was biting, trade was tough, there was a focus on price rather than quality, consumers didn't seem to want own-labels so much any more, and maybe there was less confidence at Sainsbury's." There was always, he said, "a lot of pressure to keep ahead. It's fairly aggressive here." It was partly Cheesman's very success that produced such strong competition. Many buyers have cut their teeth at Sainsbury's; the trade as a whole has benefited hugely from the Cheesman energy. One feels he must have had a very clear vision of what a supermarket wine department could be, but when he described it, it was very much in terms of an evolution of ideas, of the influence of his first bosses in the department, of the way Britain's entry into the EC in 1973 dramatically changed things right at the start of his career. No more Beaune from the Midi, for one thing. For the future, he wants to address the thorny problems of in-store expertise and training, and e-commerce, among others. He reckons he has more autonomy at Sainsbury's now than before, though still within company structures: "It's a role tailored to my strengths." Brie could not have done this. |
feminism – Newshttp://www.bates.edu/news
Wed, 13 Dec 2017 21:31:51 +0000en-UShourly1https://wordpress.org/?v=4.8.3The Arm Rest: Gendered Territory?http://www.bates.edu/news/2009/02/24/gendered-territory/
http://www.bates.edu/news/2009/02/24/gendered-territory/#respondTue, 24 Feb 2009 17:38:11 +0000http://batesviews.net/?p=2741From Stephanie: So, on my way back to Bates at the end of February break I realized something about armrests. Everyone knows the quandry of armrests when using public transportation like planes, trains and buses. I’m not sure if buses have armrests… it’s been a while since I’ve taken a bus but I’m sure they do. The seats are so tiny and this is America so we must have a way to partition our little democratic spaces off. We worked hard for these very dirty rainbow patterned seats, you know the pulling bootstraps and the American dream and so on and goddess knows we shouldn’t have to share. That’s socialist. Anyway buses are of no matter because I want to talk about airplane armrests.
When you’re a women and gender studies major you discuss oppression ALL THE TIME. And we’re not just talking about the big time oppression of sexism in the American workplace, we’re talking about theories down to how high heels were designed to cripple women and keep them in their place. (You can decide what you think of that, I must say I agree but I’m unsure whether I can ascribe it to the Patriarchy or to the fact that for about 2 years now my feet cramp constantly. Perhaps they’re one and the same. Too bad more potassium isn’t the solution to both.)
But anway, you learn all these little things that you’ve always witnessed but never really looked upon as anything much, like how I tend to always sit cross legged. Well, this can be related to the idea which posits that in society, women are expected to take up as little room as possible. Hence why we sit cross legged, it’s a gendered behavior. You don’t see many men sitting cross legged and the ones that do are often viewed as less masculine. It is deemed more masculine to take up space. And whose space do they take? Mine, on an airplane flight from Chicago.
I have never experienced an encroachment of space like this one before. Actually, that’s a lie. I’ve never before experienced such an encroachment of space where the person wasn’t hitting on me. This man must have been the manliest man alive. He was all sorts of splayed, listening to his ipod. His suitcase was not under the seat in front if him but on the floor between his seat and the seat in front of him and his legs were stretched on either side of his suitcase. Not only was his right leg poking into my space but he wasn’t following the safety rules. But that wasn’t the worst of it, the worst of it was the arm rest. He had taken all of it and not just taken it but his elbow was poking into my space, poking me as I bitterly sat scrunched trying to avoid the point of his elbow. Two limbs out of four encroaching. That’s half. That’s a lot.
So I got angry. And then I got angry that I was angry and not doing anything about it. What could I do? I crossed my legs and shrunk towards the aisle because I didn’t want to touch him as I mulled over my options. I ended up using a three-fold approach. I would every once and a while jab his elbow with mine, sending a “I know what you’re doing and I’m aware that this is my space too even though I’m a frail looking tired woman, and ill even let you have the armrest how generous of me just move your elbow.” I also would look scathingly down at the armrest every time his elbow poked me, willing his arm, not to burst into flame because we were on a plane, but to perhaps disintegrate into dust like the humans in Body Snatchers when they would get killed and replaced by alien clones in their sleep. My third approach (this one was my favorite) was to pretend I was asleep the whole way so he would have to “wake me up” to go to the bathroom because I had the aisle seat and it’s SO awkward to attempt to wake up a stranger so you can urinate. I thought that would get him.
Anyway, so that was my experience and it left me wondering if he saw me and thought that he could be disrespectful in that way or if he just had no clue what he was doing. I’m not sure which one is worse. I also thought back to my other plane experiences and I realized that I’ve always worked out an armrest compromise when I am seated next to another woman. Either she takes the front and I the back or vice versa. Her elbow doesn’t sneak over, her legs aren’t splayed, there’s almost an unspoken understanding. Perhaps it results from her on her last flight having to pretend she was asleep so the man next to her would have to hold his pee for 2 and 1/2 hours just to teach him a lesson he probably didn’t get.
So, moral of the story: Men, close your legs and keep your elbows in check. Women, don’t feel afraid to take what’s yours and when all else fails and your in the aisle seat, feign sleep. I know the arm rest isnt big but in the interest of gender equality, let’s compromise.
So I am the Girl Talk of the thesis world. I do mash-ups. That’s my thing. I make my living off of taking other people’s work and smushing it together into something on which I put my name (not without giving due credit of course). But really, I am taking the thought of a 13th century Japanese Zen philosopher and comparing it with a contemporary feminist thinker of technoscience. That’s like combining “The Hallelujah Chorus” with Missy Elliott. And, I can groove to it. Without getting hit in the head or knocked on the ground like the recent Girl Talk show here at Bates.
But the most interesting thing about the comparison of my thesis to mash-up music is that the critiques of both ventures are the same. Concerning mash-up music, debates have been circulating concerning the question of whether a mash-up song should be considered new or not. Is a mash-up song authentic? Is it “real” music? Or is it simply two previously written songs placed together into something that is less novel than it is a rip-off. And what does it mean that computers are so fancy these days that any Joe-shmo can take two of his favorite songs and layer them together? Does that count as authentic? Or does one need to have a certain knowledge about music, about both the songs, about how sounds and beats and rhythms work together?
I face some of those similar questions in my thesis writing process. Can what I produce be considered “original” or “new”? What about authentic? Am I just taking from others?
Unfortunately, because Girl Talk just needs a record deal and I need not to be torn limb from limb by feminists, I have to make sure my methods in this process are unassailable. While thinking two songs are awesome and then having the artists approve their use works for Girl Talk I can’t exactly put that same approach into my methods: I think Dogen and Donna Haraway are awesome and their works are published so I’ll make sure to cite them properly. That won’t fly. I need to contextualize these authors’ thoughts in their specific historical times. Which means I’ve read A LOT about 13th century Japan and A LOT about America post-WWII. And what have I learned so far? I have learned what makes what I’m doing so difficult and GirlTalk has no idea.
The problem with what I am attempting to do is that I am alive. Yes, I’ve discussed this with my advisor, this is actually real. The problem is that I’m alive. How do I fix that problem and still finish my thesis? However, this is a problem that all historians supposedly face- we’re alive and the people we’re talking about often aren’t. So we can’t ask the Coolios for permission to use track 13. I cant ask Dogen if he’s okay with what I’m doing because he’s dead. And I can ask Donna Haraway- and maybe I will once I get a more solidified thesis idea but the fact of the matter is- I’m alive and Haraway’s alive and Dogen’s not and we make an odd threesome.
But I’m optimistic. I’m learning a lot about both thinkers and the times in which they existed. I also learned that I hate Ronald Regan. So here I am: the mash-up philosopher who’s making friends and influencing people. And hating on Ronald Regan. Only with thesis.
Sponsored by the Bates College Republicans, the event is open to the public at no cost.
“Mrs. Schlafly’s talk will focus on the failures of feminism and the importance of the traditional family unit,” said Jonathan Browher, first vice president of the Bates College Republicans and a junior from Meredith, N.H. “She’ll challenge the perpetuated myth that the promotion of women’s rights is incompatible with the conservative movement.”
“With Schlafly’s expertise on women’s issues, the Bates community will have the opportunity to hear some novel ideas and insights about the state of the feminist movement today.”
Phyllis Schlafly has been a national leader of the conservative movement since the publication of her best-selling 1964 book, A Choice Not An Echo (Pere Marquette Press, 1964). She has been a prominent foe of abortion since 1972, when she started the national volunteer organization now called Eagle Forum. In a 10-year battle, Schlafly led the successful national opposition to the Equal Rights Amendment.
An articulate opponent of what she terms the radical feminist movement, Schlafly appears in debate on college campuses more frequently than any other conservative. She was named one of the 100 most important women of the 20th century by the Ladies’ Home Journal.
Schlafly’s monthly newsletter, The Phyllis Schlafly Report, is now in its 38th year. Her syndicated column appears in 100 newspapers, her radio commentaries are heard daily on 460 stations and her radio talk show on education called Phyllis Schlafly Live is heard weekly on 45 stations.
Schlafly is the author or editor of 20 books on subjects as varied as family and feminism, nuclear strategy, education, child care and phonics. Her most recent book, Feminist Fantasies (Spence Publishing, 2003), is a collection of essays on feminism in the media, workplace, home and the military.
Schlafly is a Phi Beta Kappa graduate of Washington University, received a doctorate in law from Washington University Law School and received her master’s in political science from Harvard University.
]]>http://www.bates.edu/news/2007/03/26/phyllis-schlafly/feed/0Catholic chaplain from Harvard discusses feminist journeyhttp://www.bates.edu/news/2002/02/13/catholic-chaplain-harvard/
http://www.bates.edu/news/2002/02/13/catholic-chaplain-harvard/#respondWed, 13 Feb 2002 19:54:58 +0000http://home.bates.edu/?p=22950The Path is Made by Walking: A Catholic Feminist's Journey as a Change Agent at 4:30 p.m. Thursday, Feb. 28, in Skelton Lounge, Chase Hall.]]>Jacqueline Landry, Catholic chaplain at Harvard University, will present a talk titled The Path is Made by Walking: A Catholic Feminist’s Journey as a Change Agent at 4:30 p.m. Thursday, Feb. 28, in Skelton Lounge, Chase Hall. Sponsored by the Chaplain’s office and part of the series Spiritual Journeys: Stories of the Soul 2001-02, the talk is open to the public free of charge.
Raised in a Catholic Worker community, Landry has spent her entire life asking and answering questions such as: Why would any woman stay in a patriarchal faith community? How does change best occur – outside institutions or in them? What does the future of women’s experience and leadership look like in the Catholic Church? Landry will discuss how these and other questions have formed and informed the spiritual journey of a contemporary Catholic woman.
Next in the Spiritual Journeys series is Stephen P. Huyler, freelance cultural anthropologist, author and photographer, who will discuss Meeting God: A Scholar’s 25-Year Encounter with Hinduism in India at 4:30 p.m. Tuesday, March 5, in Skelton Lounge. The talk will be given in conjunction with Huyler’s exhibit Meeting God: Elements of Hindu Devotion in the Chapel, March 1-21. For more information, call 207-786-8272.
]]>http://www.bates.edu/news/2002/02/13/catholic-chaplain-harvard/feed/0Goldstein to discuss "Re-visions: Seeing Torah Through A Feminist Lens"http://www.bates.edu/news/1999/02/25/elyse-goldstein/
http://www.bates.edu/news/1999/02/25/elyse-goldstein/#respondThu, 25 Feb 1999 14:36:07 +0000http://home.bates.edu/?p=30831Elyse Goldstein, rabbi, author and executive director of Kolel: A Center for Liberal Jewish Learning, Thornhill, Ontario, will discuss her book Re-visions: Seeing Torah Through A Feminist Lens from 4:30 to 6 p.m. March 11 in Skelton Lounge, Chase Hall, 56 Campus Ave. The public is invited to attend the Spiritual Journeys lecture at Bates without charge. Call 207-786 8272 for more information.
Goldstein’s book explores specific female characters of the Torah and their interaction with society. Goldstein’s chapters on blood and water discuss the biblical sections on menstruation, challenging women to reappropriate traditional laws concerning the body. Her scholarship on God, goddess, gender and Torah reveals how the traditional masculine image of God has affected women’s spiritual journeys.
Sponsored by the Office of the Chaplain at Bates, the Spiritual Journeys lecture series features speakers from a variety of traditions who tell the stories of their spiritual awakening and development. Speakers are invited to explore how they experience a sense of the holy in their everyday lives, how their perspectives and disciplines have shaped that sacred experience, and how they understand religion as a resource or an obstacle to the life of the soul.
Next in the Spiritual Journeys series will be John P. Streit, dean of St. Paul’s Cathedral Episcopal Diocese of Massachusetts, on Faith, Doubt, and Passion: Companions for an Unlikely Spiritual Journey from 4:30 to 6 p.m. March 19, in Skelton Lounge, Chase Hall. |
Gallery Description:
Angelina Jolie is sultry and stylish in an effortless pulled-back look at the Academy Awards/Oscars 2009. Her hairstyle has lots of body and soft curly texture that show off beautifully her emerald earrings.
Comments
Add a Comment
* Please Add A Comment
Thank you for submission! Your comment will be displayed after getting approval from our administrators. |
1. Introduction {#sec1}
===============
The incidence of isolated Posterior Cruciate Ligament (PCL) in acute knee injuries is low. Ruptured PCL can result in abnormal knee kinematics and increase the risk of subsequent injury to other knee ligament. Nonsurgical treatment is considered appropriate in patient with isolated grade I, II, or grade III patients with mild symptoms and low demand. Surgical treatment with PCL reconstruction is the treatment of choice in patient with symptomatic grade III PCL injury or if concomitant injuries to other knee ligament occur (1).
Different type of autografts have been studied in PCL reconstruction, with hamstring autograft being one of the most common graft used. Hamstring autograft is easy to harvest, and has less donor morbidity compared to Bone-Patellar-Tendon-Bone (BPTB) autograft. While the use of BPTB may allow faster return to sport, it also carries potential disadvantages of anterior knee pain, kneeling pain, and loss of motion (2). The disadvantages of hamstring tendon are unpredictable graft size, potential reduction of hamstring muscle power, and thigh hypotrophy (3). Presence of these disadvantages limit the use of hamstring autograft in athlete who need dominant hamstring power to compete at the highest level. Moreover, even though the incidence of anterior knee pain and kneeling pain after hamstring graft harvesting is fewer than BPTB, if present, it can be very disturbing, especially in Asians who frequently kneel as part of their daily activity. For this particular group of patients, some author tried to evaluate the use of other type of autograft, including the use of Peroneus longus tendon (PLT) autograft.
Peroneus longus tendon autograft was already used in some orthopaedic procedures \[[@bib4],[@bib5]\]. Some authors also have studied its use in ACL reconstruction (6--8), with most of the studies show good clinical result and minimal donor site morbidity of the harvested ankle. Previous biomechanical study also showed that peroneus longus tendon autograft have comparable tensile strength compared to hamstring tendon \[[@bib9]\]. The result of the study mentioned above showed that PLT is a potential graft of choice in knee ligament reconstruction because of the overall good clinical result, low ankle donor site morbidity, no knee donor site morbidity, and comparable tensile strength compared to more popular hamstring tendon. Regardless of the potential, no previous study evaluate the use of PLT autograft in PCL reconstruction.
The purpose of this study was to evaluate the functional outcome and donor site morbidity of PCL reconstruction with peroneus longus tendon autograft in 2-year follow up.
2. Materials and methods {#sec2}
========================
This study was a prospective cohort study with consecutive sampling of patient with PCL injury who underwent PCL reconstruction between October 2015 and June 2016. The diagnosis of chronic ligament rupture was established with clinical examination and imaging (Magnetic resonance imaging, MRI). The following inclusion criteria were adopted \[[@bib1]\]: chronic injury (\>6 months) \[[@bib2]\], presence of an 'isolated' PCL lesion \[also including the presence of slight varus/valgus instability (1+) compared with the contralateral limb\] and \[[@bib3]\] no previous ligamentous surgery. The presence of a posterolateral and/or posteromedial lesion was excluded by clinical examination alone. Fifteen patients fulfilled these criteria and were included in this study. Mean age at the time of injury was 25.86 ± 6.46 years (range 18--38 years). The group consisted of 11 men and 4 women. All patients had chronic injuries with a mean time from original injury to reconstruction of 8 months (range 6--24 months). The injuries occurred during a sports activity in 8 patients (6 soccer, 2 other sports) and during a motor vehicle accident in 7 patients. See [Table 1](#tbl1){ref-type="table"}. At arthroscopy examination, a medial meniscal tear was detected in 2 patients, and a lateral meniscal tear in 1 patient and were excluded from this study. This research work has been reported in line with the STROCSS statement \[[@bib10]\].Table 1Subjects characteristics.Table 1CharacteristicsMeanSDMinMaxNAGE25.866.4618.0038.00SEX MALE11 (73.3) FEMALE4 (26.7)SITE OF INJURY DEXTRA8 (53.3) SINISTRA7 (46.7)INJURY MECHANISM TRAFFIC INJURY7 (46.7) SPORT8 (53.3)GRAFT DIAMETER8.300.657.5010.00
The functional score of the patient were assessed before the surgery and 2-year after the surgery with International Knee Documentation Committee (IKDC) score, Modified Cincinnati Rating System, Lysholm scale, and serial hop test. Donor site morbidity were assessed with American Orthopaedic Foot Ankle Society score and Foot Ankle Disability Index. Thigh circumference measured in 10 cm and 20 cm superior to upper pole of patellar bone in injury site and contralateral healthy site.
2.1. Statistical analysis {#sec2.1}
-------------------------
Lemeshow method was used to calculate sample size. Method is shown below:
The proportion of patient with PCL rupture (p) was found to be around 6% in our study population. With 95% CI, and precision level of 10%, the calculation were (1.96)^2^ x 0.06 x (0.94)/(0.1)^2^ = 24 samples. There were at least 24 patients in each group needed to be included in this study.
The outcomes of continuous measurements (IKDC, Modified Cincinnati, and Lysholm score) were compared between the 2 groups using the Mann-Whitney *U* test. Statistical significance was accepted at *p* \< 0.05. According to this sample calculation, we should enrolled minal 24 patients in one year. In this study, we only took 5 months (October 2015 until February 2016) for patient enrollment.
2.2. Surgical technique {#sec2.2}
-----------------------
A single senior knee surgeon performed all of the PCL reconstruction procedures. The procedure was performed under general anesthesia with the patient in supine position. After brief clinical examination under anesthesia, padded tourniquet was applied in proximal thigh of the affected knee. Anterolateral and anteromedial arthroscopic portals were used for diagnostic arthroscopy. After the diagnosis of PCL rupture is confirmed arthroscopically, PLT autograft was harvested from the ipsilateral ankle.
With the knee in full extension, an approximately 3-cm longitudinal incision was made approximately 2--3 cm above and 1 cm behind the lateral malleolus. The incision was carried through the skin and subcutaneous tissue. After incision of the superficial fascia, peroneus longus and peroneus brevis tendon were identified in the surgical field. After division of the peroneus longus tendon 2--3 cm proximal to the lateral malleolus, the distal part of the tendon was sutured to the peroneus brevis tendon with side to side suture ([Fig. 1](#fig1){ref-type="fig"}, [Fig. 2](#fig2){ref-type="fig"}). Then the peroneus longus tendon was stripped proximally with a tendon stripper and stopped at the level of 4--5 cm from the fibular head to prevent peroneal nerve injury ([Fig. 3](#fig3){ref-type="fig"}).Fig. 1Identification of peroneus longus and peroneus brevis tendon.Fig. 1Fig. 2Tenotomy of peroneus longus tendon.Fig. 2Fig. 3Marked the end of peroneus longus tendon harvest at three fingers bridge below the tip of fibular head.Fig. 3
Synovial and fat-like tissue on the femoral attachment of the PCL remnant was removed carefully to expose the fibers of PCL bundles. The PCL remnants were preserved. The femoral tunnel was placed at 8--10 mm from anterior or distal medial femoral articular margin on a continuous line with the junction of the roof and medial wall of the intercondylar notch. A 2.0 mm Kirschner wire was inserted through the reamer as a guide wire. Over drilling was done with a 5 mm diameter drill (ConMed^©^, USA) using the anterolateral portal. A 2.4-mm pin passed through the femoral tunnel, and reamed using cannulated drill in accordance with graft diameter at the distal portion until 30 mm depth of femoral tunnel.
A posteromedial portal was created under direct vision. The PCL tibial attachment site was completely exposed. A guide pin was inserted through the anteromedial incision within the distal center portion of tibial insertion of PCL, which comes into contact with the posterior edge of retrospinal surface. The tibial hole was made in accordance to graft diameter. A 2.4-mm (blunt leading end) pin was inserted through this hole. A pullout suture was threaded in a retrograde fashion. Using this, the 4-strand hamstring graft pulled through the femoral hole. Proximal femoral fixation obtained with a button (Graftmax^®^, ConMed^©^, USA). Button was flipped outside the medial cortex of the femur. Then, graft was grasped and pulled tightly out of the anterior tibial hole, and a 25--35 mm bioabsorbable screw (BioScrew**®,** ConMed^©^, USA) was inserted at 90° knee flexion while maintaining anterior drawer pull of the tibia.
2.3. Postoperative rehabilitation {#sec2.3}
---------------------------------
The knee was immobilized for 4 week with brace in full extension. Ambulation with non-weight bearing protocol was initiated on the second postoperative day. Quadriceps isometric exercise, and straight-leg raising exercise initiated after 2 week. Protected ROM was gradually increased from 0 to 90° flexion starting from the fourth week. After 8 weeks, progressive knee flexion from 90° to full ROM was exercised gradually. Partial weight bearing was permitted after 4 weeks. Full weight bearing with hamstring-strengthening exercises was permitted after 8 weeks and active knee ROM should progress to complete flexion and extension. Patients usually returned to their normal daily activity and were allowed to exercise on a stationary bike or standing on a single leg starting at 5 months postoperatively. Light sports activities began at 6 months. After 12 months, the patients is evaluated with serial hop test (single hop test and triple hop test) and then cleared for sport activities if the result is good.
2.4. Clinical and functional evaluation {#sec2.4}
---------------------------------------
Post-operative functional outcome (IKDC, Modified Cincinnati, and Lysholm) were recorded two years after surgery with direct patient examination and a guided-interview by a single orthopaedic surgeon outside the surgical team. Donor site morbidity was evaluated with measurement of ankle functional score using AOFAS and FADI score. Serial hop test was assessed at two-years after surgery.
This study was reviewed and approved by the Medical and Health Research Ethics Committee at the Faculty of Medicine of Universitas Gadjah Mada (IRB number KE/1275/11/2018). This study has been registered in a publicly accessible database and having a unique identifying number: researchregistry4760.
2.5. Statistical analysis {#sec2.5}
-------------------------
Statistical data was analysed by an independent statistician. Paired *t*-test was used for comparisons of IKDC, Modified Cincinnati, and Lysholm score from preoperative assessment to 2 years follow-up. Statistical significance was accepted at a *p-*value of \<0.05. FADI, AOFAS, and serial hop test (single hop test and triple hop test) were shown descriptively.
3. Results {#sec3}
==========
During the period of the study, eighteen patients underwent single bundle PCL reconstruction. Three patients were excluded because of concomitant meniscal injury. Fifteen patients fulfilled the inclusion criteria and underwent single bundle PCL reconstruction with peroneus longus autograft. At 2 years follow up, there were fifteen patients which consist of 11 males and 4 females.
3.1. Graft diameter {#sec3.1}
-------------------
Intraoperatively, graft diameter was measured and recorded, with the result shows mean diameter of 8.30 ± 0.65 mm (range 7.5--10 mm). See [Table 1](#tbl1){ref-type="table"}.
3.2. Functional outcome {#sec3.2}
-----------------------
There were significant differences between the preoperative and 2-year postoperative score in IKDC, Modified Cincinnati, and Lysholm score (*p* \< 0.05), as shown in [Table 1](#tbl1){ref-type="table"}. Mean IKDC score was 47.58 ± 11.75 (range 32.20--66.70) pre-operatively and 78.17 ± 4.52 (range 72.40--86.20) at 2 years follow-up. Mean score of Modified Cincinnati was 48.86 ± 12.22 (range 34.00--68.00) pre-operatively and 79.00 ± 4.82 (range 72.00--88.00) at 2 years follow-up. Mean Lysholm score was 49.26 ± 11.54 (range 35.00--68.00) pre-operatively and 80.20 ± 5.04 (range 72.0--90.0) at 2 years follow-up. There were significant differences between pre-operative and 2 years post-operative score in IKDC, Modified Cincinnati, and Lysholm tests (*p* \< 0.05) with majority of the patient with PCL injury reconstructed with peroneus longus tendon had improvement results. See [Table 2](#tbl2){ref-type="table"}. Single hop test and triple hop test after 24 months post operatively shown 95.73 ± 3.08 and 91.86 ± 1.92, respectively. See [Table 3](#tbl3){ref-type="table"}.Table 2Functional outcome.Table 2PRE-OPERATIVEPOST-OPERATIVESIGNIFICANCYMEANSDNORMALITYMEANSDNORMALITYIKDC47.5811.750.07278.174.520.1640.000MODIFIED CINCINNATI48.8612.220.02479.004.820.5490.001TEGNER-LYSHOLM49.2611.540.05680.205.040.5870.000Table 3Donor site morbidity and serial hop test.Table 3MEANSDMINMAXNORMALITYFADI94.802.4290.00100.000.900AOFAS94.462.5690.00100.000.523SINGLE HOP95.733.0890.00100.000.553TRIPLE HOP91.861.9288.0096.000.652
3.3. Thigh circumference {#sec3.3}
------------------------
Result of thigh circumference revealed no difference between injury site and contralateral healthy site (*p* \> 0.05). The mean circumference in 10 cm proximal to upper patellar bone was 42.73 ± 4.33 at injury site and 43.83 ± 4.27 at contralateral healthy site. The mean circumference in 20 cm proximal to upper patellar bone was 49.67 ± 4.60 at injury site and 50.40 ± 4.66 at contralateral healthy site. See [Table 4](#tbl4){ref-type="table"}.Table 4Thigh circumference.Table 4INJURY SITECONTRALATERAL SITESIGNIFICANCYMEANSDMINMAXNORMALITYMEANSDMINMAXNORMALITY10CM THIGH DIAMETER42.734.3336.5053.000.18143.834.2737.054.000.2430.49020CM THIGH DIAMETER49.674.6042.0060.000.93350.404.6641.5061.000.9700.668
3.4. Donor site morbidity {#sec3.4}
-------------------------
For the evaluation of donor site morbidity, ankle functional score is measured with AOFAS and FADI score. The mean of AOFAS score of donor ankle was 94.46 ± 2.56 (range 90.0--100.0) and FADI score was 94.80 ± 2.42 (90.0--100.0). See [Table 3](#tbl3){ref-type="table"}.
4. Discussion {#sec4}
=============
Nonoperative treatment in high grade PCL injury might cause deterioration of knee function with increasing time-lapse after the injury. The deterioration might occurs in less than 5 years after the initial injury based on radiographic finding, patient\'s subjective symptoms, and functional criteria \[[@bib11]\]. Therefore, in this group of patient, reconstruction of the PCL is advocated to return the normal kinematic of the knee and prevent deterioration of knee function.
Previous study have reported that the outcome of PCL reconstruction procedure is influenced by many factors, among the important factors to be considered are graft fixation technique, arthroscopic portals used, bundles addressed, and choice of graft used. Among these factors, choice of graft is one of the most important consideration because it is related to the unique characteristic of each graft. Some graft may be more suitable to certain group of patient related to its advantages, while other type of graft may be more suitable for other related to the potential donor site morbidity. Overall, the consideration for choice of graft in PCL reconstruction is almost the same with ACL, however, the clinical outcome of this two different procedure might be not comparable each other \[[@bib12]\].
Two of the most widely used graft in PCL reconstruction are BPTB autograft and hamstring tendon autograft. Compared to other type of graft, BPTB have the advantage of faster return to sport related to its bone-to-bone tunnel healing. The disadvantage of BPTB including presence of tendon proliferation and fat pad fibrosis that can result in infrapatellar contracture syndrome \[[@bib13]\]. BPTB harvesting also carries substantial risk of anterior knee pain, kneeling pain, loss of motion \[[@bib2]\], and risk of patellar fracture \[[@bib14]\].
Presence of kneeling pain or anterior knee pain might be more disturbing in certain group of patient than other. This is especially true in group of patient who frequently kneel as part of their daily activity, whether it is related to religious activity or tradition. Corry et al. \[[@bib15]\] compared the clinical outcome and donor site morbidity of patient with isolated ACL rupture who underwent ACL reconstruction with hamstring tendon and patellar tendon. From the patellar tendon group, about 55% patient had anterior kneeling pain in the first year that improved to about 31% in the second year, compared to just 6% in the hamstring group both in the first and second year. A meta-analysis in 2015 by Xie et al. \[[@bib2]\] compared the use of BPTB and hamstring tendon autograft, this study showed that the risk ratio for anterior kneeling pain was 1.71 in favour of hamstring tendon, while the risk ratio for kneeling pain was 2.05, also in favour of hamstring tendon. While the percentage of kneeling pain is considered low in the hamstring group compared to the BPTB group, it can be catastrophic if it occur in patient who could not tolerate any kneeling pain.
Hamstring tendon autograft has many advantages compared to BPTB and is gaining popularity in PCL reconstruction. The quadrupled graft or double loop of semitendinosus and gracilis tendons has greater strength than BPTB \[[@bib16],[@bib17]\]. The use of hamstring tendon in PCL reconstruction also showed good clinical outcome. Chan et al. \[[@bib18]\] evaluated the clinical outcome of PCL reconstruction with hamstring tendon during 3--5 years follow up and found significant improvement in knee function, activity level, IKDC classification, Lysholm scores, and muscle strength. Some disadvantages of hamstring tendon autograft harvesting including saphenous nerve injury, thigh hypotrophy, and hamstring muscle power reduction \[[@bib3],[@bib13],[@bib19]\]. Some study also showed inconsistent graft diameter after hamstring tendon harvesting, with most of times the diameter is too small. The relatively small diameter of hamstring tendon might predispose to increased rerupture rate and revision rate after PCL reconstruction. Recent biomechanical study showed that hamstring graft with diameter of 6 mm or 7 mm have significant lower load to failure compared to graft with greater diameter, this study also mentioned a possibility that hamstring graft may not be as strong as previously appreciated in older study \[[@bib20]\]. These disadvantages drove some author to evaluate the use of other source of autograft as an alternative to hamstring graft in cruciate ligament reconstruction.
Previous biomechanical study that compared the tensile strength of peroneus longus tendon, hamstring tendon, patellar tendon, and quadriceps tendon showed that the tensile strength of peroneus longus was comparable to hamstring tendon, and was significantly stronger than patellar tendon and quadriceps tendon \[[@bib21]\]. Some clinical study also showed good clinical result in the use of peroneus longus tendon in ACL reconstruction \[[@bib6], [@bib7], [@bib8]\] while other author already used PLT in PCL reconstruction \[[@bib22]\].
In this study, we found that the mean of peroneus longus graft diameter was 8.30 ± 0.65 mm (range 7.5--10 mm). Previous study stated that graft diameter of more than 8 mm had lower failure rate in ACL reconstruction, with the likelihood of revision rate was 0.82 lower with increasing 0.5 mm in range 7.0--9.0 graft diameter \[[@bib23]\].
The result of this study showed that PCL reconstruction with PLT had significant improvement with good clinical outcome in 2-year follow up based on IKDC, Modified Cincinnati, and Lysholm scores. This result shows that PLT autograft can be used in single bundle PCL reconstruction with good functional outcome of the patient at 2 years follow up. Test for evaluating knee function using single hop test and triple hop test also show good results, which is greater than 90%.
Angthong et al*.* \[[@bib8]\] stated that there were some possible donor site morbidity with peroneus longus tendon harvesting. The potential donor site morbidity including ankle function deterioration and concern of ankle instability. In this study, ankle function is measured with AOFAS and FADI score. The result shows that the function of donor ankle was excellent even after harvesting of peroneus longus tendon. This finding is probably related to intact peroneous brevis muscle that will maintain ankle eversion function. Previous study shows peroneus brevis as a more potent ankle evertor that maintain eversion power of the ankle after peroneus longus harvesting \[[@bib24]\].
The limitations of this study is limited sample size and absence of objective measurement of ankle eversion strength and objective measurement of knee laxity during two years evaluation. However, some of the potential bias is limited by using a single surgeon, same rehabilitation protocol, and also same surgical procedure in all patients.
With the result of this study, the use of peroneus longus as graft of choice in single bundle PCL reconstruction can be encouraged in clinical practice because it shows good functional score and minimal donor site morbidity.
5. Conclusion {#sec5}
=============
Single bundle PCL reconstruction with peroneus longus tendon autograft had improvement functional outcome (IKDC, Modified Cincinnati, Lysholm) and shown excellent ankle function and serial hop test result at two-years evaluation.
Data availability {#sec6}
=================
The data used to support the findings of this study are available from the corresponding author upon request.
Provenance and peer review {#sec7}
==========================
Not commissioned, externally peer reviewed.
Ethical Approval {#sec8}
================
The informed consent form was declared that patient data or samples will be used for educational or research purposes. Our institutional review board also provide an ethical approval with KE/1275/11/2018 as the protocol number.
Sources of funding {#sec9}
==================
The authors declare that this study had no funding resource.
Author contribution {#sec10}
===================
Riky Setyawan and Sholahuddin Rhatomy conceived the study. Sholahuddin performed surgery, collected and analysed data. Riky Setyawan drafted the manuscript, analysed data, and critically revised the manuscript for important intellectual content. Noha Roshadiansyah Soekarno and Asa Ibrahim Zainal Asikin analysed data, prepared and drafted the manuscript. Riky Setyawan and Sholahuddin Rhatomy reviewed and edited manuscript. Riky Setyawan and Sholahuddin Rhatomy facilitated all project-related tasks.
Conflicts of interest {#sec11}
=====================
No potential conflict of interest relevant to this article was reported.
Trial registry number {#sec12}
=====================
None.
Guarantor {#sec13}
=========
Sholahuddin Rhatomy, M.D.
Registration of research studies {#sec14}
================================
This study has been registered in a publicly accessible database and having a unique identifying number: researchregistry4760.
Consent {#sec15}
=======
Written informed consent was obtained from the all of the patients for publication of this case report and accompanying images. A copy of the written consent is available for review by the corresponding author of this journal on request.
Appendix A. Supplementary data {#appsec1}
==============================
The following is the Supplementary data to this article:Multimedia component 1Multimedia component 1Multimedia component 2Multimedia component 2Multimedia component 2Multimedia component 2
We thank patient family, the surgical team and the nursing staff who were involved in the surgery and patients care. This research received no specific grant from any funding agency in the public, commercial, or not-for-profit sectors.
Supplementary data to this article can be found online at <https://doi.org/10.1016/j.amsu.2019.05.009>.
|
Gates Avenue station
Gates Avenue is a local station on the elevated BMT Jamaica Line of the New York City Subway, located at the intersection of Gates Avenue and Broadway in Bushwick, Brooklyn. It is served by the Z train during rush hours in the peak direction and by the J train at all other times.
History
Gates Avenue is the oldest station in the subway system to have been built as a rapid transit station; it has been serving BMT trains for approximately years. While Far Rockaway – Mott Avenue is the oldest station currently in operation in the New York City Subway system, having originally opened in 1869 as a Long Island Rail Road station, that station had an 8-year disruption in service while being converted to subway loading gauge, meaning that Gates Avenue is the system's oldest station in continuous operation.
Gates Avenue was originally opened by the Union Elevated Railroad on May 13, 1885 for the BMT Lexington Avenue Line, and has been in continuous operation since then. The BMT Jamaica Line connected to the station on June 25, 1888. Prior to the Dual Contracts, trains either operated down Broadway to Broadway Ferry (which closed upon the opening of the Williamsburg Bridge tracks to Essex Street) or Lexington Avenue, eventually merging onto the Myrtle Avenue El. The Dual Contracts expanded the BMT Jamaica Line, including Gates Avenue, to three tracks, allowing for express service, as well as expanding service in Manhattan down Nassau Street. In 1950, the Lexington Avenue El closed, resulting in the redirection of all trains to the Williamsburg Bridge.
Station layout
This station has two side platforms and three tracks with the center express track not normally used. Each platform has beige windscreens and red canopies (both with green frames) that run along the entire length except for a small section at both ends.
The 2002 artwork here is called Dream Train by Chris Robinson and features mass transit-related stained glass windows in the station house and the windscreens.
South of this station, the BMT Jamaica Line connected to the BMT Lexington Avenue Line before it ceased operation on October 13, 1950 and some remains are visible. The next stop on the Lexington Avenue El was Reid Avenue on its way to Downtown Brooklyn and Park Row, Manhattan.
Exits
The station has exits on both the west (railroad north) end and the east (railroad south) end of its platforms. Despite the station's name, there is no longer an open exit to Gates Avenue.
On the west end, each platform has a single staircase leading to an elevated station house beneath the tracks. It has a turnstile bank and token booth. Outside fare control, two staircases lead to both eastern corners of Quincy Street and Broadway.
The eastern exits are now emergency exits leading to both western corners of Palmetto Street and Broadway, just east of Gates Avenue. These exits were closed in the 1980s due to high crime. There is a closed station house around the intermediate level of the staircases.
References
External links
Station Reporter — J train
The Subway Nut — Gates Avenue Pictures
MTA's Arts For Transit — Gates Avenue (BMT Jamaica Line)
Quincy Street entrance from Google Maps Street View
Platforms from Google Maps Street View
Gates Avenue Tower at Broadway Elevated Junction: Lexington Avenue Line (BMT) (New York Transit Museum; Flickr)
Category:BMT Jamaica Line stations
Category:1885 establishments in New York (state)
Category:BMT Lexington Avenue Line stations
Category:New York City Subway stations in Brooklyn
Category:New York City Subway stations located aboveground
Category:Railway stations opened in 1885
Category:Bushwick, Brooklyn
Category:Bedford–Stuyvesant, Brooklyn |
Prenti Downs
Prenti Downs Station is a pastoral lease and cattle station located in the Mid West region of Western Australia.
It is situated approximately to the east of Wiluna and north of Laverton. Neighbouring properties include Carnegie and Windidda Stations.
The area is composed of a mixture of landscapes including saltbush dominated clay pans, mulga country and grasslands. The stock can be watered at 34 different water points as well as numerous claypans and fresh water creeks. In 2013 Prenti Downs was carrying a herd of 4,000 shorthorn cattle.
The property was put on the market in 2013, when it occupied an area of ; Prenti Downs was sold in late March 2015 to the Carmody family who have since taken over management of the property. An area of approximately in the middle of the property making up the area of Lake Carnegie was not included in the sale.
See also
List of ranches and stations
List of pastoral leases in Western Australia
References
Category:Homesteads in Western Australia
Category:Pastoral leases in Western Australia
Category:Mid West (Western Australia)
Category:Stations (Australian agriculture) |
Game Lab
Game Lab is a programming environment where you can make simple animations and games with objects and characters that interact with each other. Design an animation or game, code with blocks or JavaScript to make it work, then share your app in seconds.
Ages 13+, all modern browsers, English only
Resources
Try the Computer Science Discoveries unit that introduces Game Lab
Unit 3: Animation and Games
Grades 7 - 9
In Unit 3, students build on their coding experience as they create programmatic images, animations, interactive art, and games. Starting off with simple, primitive shapes and building up to more sophisticated sprite-based games, students become familiar with the programming concepts and the design process computer scientists use daily. They then learn how these simpler constructs can be combined to create more complex programs. In the final project, students develop a personalized, interactive program. Along the way, they practice design, testing, and iteration, as they come to see that failure and debugging are an expected and valuable part of the programming process.
Sample Projects
Explore these sample projects and take the challenge to make them even better
Video library
Some of these videos appear in Unit 3 (Animations and Games) of the
CS Discoveries course
and are displayed here as a quick introduction to each of the main concepts from the unit. Check out each video to see how you can add new features to your project. |
Hydroxyapatite crystals as a local delivery system for cisplatin: adsorption and release of cisplatin in vitro.
This study describes the characteristics of the in vitro binding and release of the anti-tumor drug cisplatin by slurries of synthetic hydroxyapatite crystals carried out in aqueous media. The adsorption of cisplatin by slurries of hydroxyapatite and its release were found to depend significantly on the ionic composition of the aqueous media used. At a constant pH of 7.4, significantly more cisplatin is adsorbed by the hydroxyapatite crystals in the slurry from a chloride-free phosphate buffered solution or a Tris buffered solution than from a buffered phosphate solution containing chloride ions. The amount of hydroxyapatite-bound cisplatin desorbed into solution was also progressively increased as a function of the increasing concentration of chloride in the equilibrating solution. Very little hydroxyapatite-bound cisplatin was released from the crystals in either a Tris or phosphate buffer. These results suggest that it is the hydrated derivatives of cisplatin which are involved in the adsorption of cisplatin by hydroxyapatite crystals. The adsorption data can be expressed as a Freundlich isotherm from which the association constant can be calculated. The rate of release of cisplatin bound to crystals of hydroxyapatite is relatively slow even at the maximum concentration of chloride ions in the phosphate buffer. Approximately 33% of the total cisplatin bound to the crystals of hydroxyapatite was released after 4.25 days. An additional 15% of the remaining cisplatin bound to the hydroxyapatite cyrstals was released after an additional equilibration with fresh buffer for two weeks (58% of the total cisplatin originally bound). These findings suggest that cisplatin bound to slurries of hydroxyapatite crystals may be useful in the local treatment of malignant tumors. |
Update, August 18, 2020 12:25 p.m.: It seems like Amy Schumer's cooking show with husband Chris Fischer just premiered, but now it's already returned for a second season and there are even more delicious bites to be had.
According to Us Weekly, in the second season premiere episode of Amy Schumer Learns to Cook, they made some of their favorite frozen apps but from scratch, like potato skins and potstickers. They also cooked up some fancier fare like ricotta pancakes mixed with a little broccoli (!!!) inside the batter. Of course, Amy had the cocktails flowing (see: a batch of frosty piña coladas) because she truly has the best job on the show.
In a statement about the new episodes, Amy said that the couple teamed up with Food Network to make a donation to Colin Kaepernick’s Know Your Rights Camp in honor of the new season.
Update, April 29, 2020 2:07 p.m.: Amy Schumer's cooking show with husband Chris Fischer is coming soon and we just got a few more details that are making us so pumped to watch.
It turns out the show will feature the couple, their son, his nanny Jane, and their dog cooking in their home in the woods. In fact, Jane will serve as "part-time camera operator when the baby is napping."
They will also be phoning some celebrity friends for advice as Chris prepares the food and Amy makes drinks (fingers crossed for some cameos from Amy's famous friends like Adele and Jennifer Lawrence!).
Amy Schumer Learns to Cook will air with back-to-back half-hour episodes each week. In the first week of eps, they'll cook up things like poached eggs, bacon, homemade latkes, Old-Fashioneds, fried rice, wings, and peanut butter cup cookies. I am already starving.
The show premieres on Monday, May 11 at 10 p.m. on Food Network.
Original, April 12, 2020 5:04 p.m.: Like the rest of us, Amy Schumer has found herself suddenly at home, and part of that includes navigating the kitchen. Unlike the rest of us, she's in quarantine with a professional chef, and her culinary adventures have been captured as part of a brand-new Food Network series.
Discovery announced this weekend that Amy Schumer Learns to Cook will debut later this spring. The series was self-shot at home from quarantine by Schumer and her husband, Chris Fischer, a specialist in farm-to-table cuisine. Eight half-hour episodes will also include a behind-the-scenes look at the celebrity couple's personal life amid this historic moment.
“Amy and Chris will give an unprecedented look at their lives as they are quarantined in their house,” Courtney White, president of the Food Network, said. “Shot entirely themselves, Amy’s boundless humor and Chris’ culinary skills show viewers how they navigate life while at home making the best of these turbulent times with some good laughs and good food.”
Chris will take the lead on food, preparing comfort dishes from farm-fresh ingredients, while Amy will be in charge of mixology. The network teased relatable themes that include: brunch, fridge clean up, pasta night, tacos, and more. Amy is also using her platform to draw attention to two important issues during this time: domestic violence and humane working conditions for farmworkers.
“Chris and I are excited to make this project with Food Network combining our two passions. For Chris, it’s cooking, and for me, eating,” the comedian said. “With everything going on in the world right now, we are so grateful to be able to share an entertaining and informative experience with viewers. And it is more important than ever to look out for one another, so Chris and I will be making donations to causes dear to us: the Coalition of Immokalee Workers’ Fair Food Program and select domestic violence organizations.”
Kristin Salaky News Editor Kristin Salaky is the news editor at Delish.com covering viral foods, product launches, and food trends.
This content is created and maintained by a third party, and imported onto this page to help users provide their email addresses. You may be able to find more information about this and similar content at piano.io |
ATTORNEY FOR APPELLANT
ATTORNEYS FOR APPELLEE,
STEVEN SMITH
David P. Jones
LaPorte, Indiana Michael P. Blaize
Valparaiso, Indiana
Nick J. Thiros
Merrillville, Indiana
ATTORNEY FOR APPELLEE
LOCAL UNION NO. 8 OF THE INTERNATIONAL BROTHERHOOD OF PAINTERS AND ALLIED TRADES
Jennifer Kalas
Hammond, Indiana
IN THE
SUPREME COURT OF INDIANA
INGOLF U. BIEREICHEL, )
)
Appellant (Plaintiff Below), ) 45S03-9812-CV-815
) in the Supreme Court
v. )
) 45A03-9708-CV-265
STEVEN SMITH AND LOCAL UNION ) in the Court of Appeals
NO. 8 OF THE INTERNATIONAL )
BROTHERHOOD OF PAINTERS AND )
ALLIED TRADES, )
)
Appellees (Defendants Below). )
APPEAL FROM THE LAKE SUPERIOR COURT
The Honorable E. Duane Daugherty, Special Judge
Cause No. 45D01-9404-CT-402
December 23, 1998
SHEPARD, Chief Justice.
Appellant Ingolf Biereichel challenges the trial court's grant of partial summary judgment in favor of defendant Local Union No. 8 of the International Brotherhood of Painters and Allied Trades. We reverse.
Procedural Posture and Relevant Facts
On March 21, 1995, Biereichel sued Steven Smith, the International Brotherhood of Painters and Allied Trades, and Local Union No. 8 for injuries suffered from an alleged altercation between Biereichel and Smith.
(footnote: 1) Local Union No. 8 filed a motion for partial summary judgment, which the trial court granted. Biereichel appealed that decision, and the Court of Appeals affirmed.
Biereichel v. Smith
, 693 N.E.2d 634, 635 (Ind. Ct. App. 1998). Biereichel then sought transfer.
Decision
The trial and appellate courts in this case based their rulings on the then-existing common law rule of
Calvary Baptist Church v. Joseph
, 522 N.E.2d 371 (Ind. 1988).
See
(R. at 158-62);
Biereichel
, 693 N.E.2d at 636-38.
Calvary
stood for the proposition that a member of an unincorporated association could not maintain an action against the association itself for a tort committed by another member. 522 N.E.2d at 372-75. We have today abrogated the former common law rule in the case of
Hanson v. Saint Luke's United Methodist Church
, No. 49S02-9804-CV-228 (Ind. Dec. 22, 1998), and we now allow such suits. In the wake of
Hanson
, the grant of partial summary judgment in favor of Local Union No. 8 on the grounds of the common law rule is no longer justified.
Conclusion
We grant transfer and reverse the partial summary judgment granted in favor of Local Union No. 8. We remand to the trial court for proceedings on the merits.
Dickson, Sullivan, Selby, and Boehm, JJ., concur.
FOOTNOTES
1: Though Biereichel's initial complaint also included
Steven Smith and the International Brotherhood of Painters and Allied Trades
, only Local Union No. 8 is a party to this appeal.
|
Serbia protests: President Vucic the target of Belgrade rally Published duration 17 March 2019
image copyright Reuters image caption Protesters clashed with riot police outside the Serbian presidential building on Sunday
Serbian police have used tear gas to clear thousands of protesters trying to blockade the residence of President Aleksandar Vucic in Belgrade.
The protesters - who are demanding greater media freedom and free elections - shouted "Resign!"
But Mr Vucic refused to bow to the pressure, saying: "I am not afraid."
The opposition has been staging largely peaceful rallies for weeks. But tensions escalated on Saturday when crowds stormed the state TV station.
Mr Vucic is a reformed extreme nationalist who now wishes to lead Serbia into the European Union.
What happened on Sunday?
Riot police fired tear gas at the crowds that had gathered outside the presidential residence in the capital.
image copyright Reuters image caption One man holds up a sign reading: "I'm dying, dying to bring you down"
image copyright EPA image caption Huge crowds gathered outside the RTS building on Saturday as some protesters managed to briefly occupy the station
Many in the crowd blew whistles and shouted "He is finished!"
That was the slogan the slogan of the movement that ousted Slobodan Milosevic in October 2000.
Milosevic was president of Serbia and later Yugoslavia during the latter's violent break-up in the 1990s. His government placed severe curbs on independent media.
In 2001, he was transferred to The Hague to face trial on war crimes charges at the International Criminal Tribunal for the Former Yugoslavia. He was found dead in his cell in 2006, before his trial could be completed.
Addressing the cheering crowds on Sunday, opposition activist Borko Stefanovic said: "We shall continue the blockade of the presidency and we will not leave until our demands are met or unless we get firm guarantees that our demands will be met."
The protest was organised as President Vucic was giving a televised address from inside his residence on Saturday's violence.
"Serbia is a democratic country, a country of law and order and Serbia will know how to respond," the president said, branding the protesters "fascists, hooligans and thieves".
image copyright Getty Images image caption Aleksandar Vucic has been Serbia's president since 2017
"They think they have the right, 1,000 of them, to determine the fate of the country," Mr Vucic added, probably underestimating the number of protesters involved.
After the president's address, crowds of people marched from the residence to the city's main police station, demanding that the people who were arrested at the Radio Television of Serbia (RTS) building on Saturday night be released.
Once they arrived, they were again locked in a stand-off with riot police outside the front door of the station.
How did the protests start?
In November last year, Mr Stefanovic - leader of the Serbian Left - was beaten up and left unconscious by a group of young men in dark clothing.
Images of his bloodied face and clothes sparked waves of protests in Belgrade.
Opposition leaders blamed President Vucic for the attacks, and accused him of bringing back an autocratic style of rule reminiscent of the Milosevic era.
Critics also accused the president of reviving nationalism and hate speech in the country.
Who is leading the protests now?
image copyright AFP image caption Bosko Obradovic, leader of the far-right Dveri party, is one of the most prominent figures in the protest movement
Now, one of the most prominent figures in the opposition protest movement is Bosko Obradovic, the leader of the extreme right-wing party Dveri.
He was among those who occupied the public broadcaster RTS's building on Saturday and, according to Balkan Insight, was physically dragged out of the building by police officers.
"We aren't asking for much," Mr Obradovic demanded at the station. "An immediate broadcast with participation of a representative of the organisers of the protests, not of politicians."
Mr Vucic has called Mr Obradovic "a fascist". |
I liked what one of the developers of the next, creepy Silent Hill recently had to say about guns. His team's new game will have guns, but not the way most games have guns.
"We're treating the gun like the gun in The Road by Cormac McCarthy," Brian Gomez, Silent Hill: Downpour's design director said, referring to the acclaimed novel about post-apocalyptic survival. "There is a gun, but there are only three bullets, so how are you going to use them?"
Advertisement
I believe Gomez wasn't being literal. Downpour will have more than three bullets. But I know what he's saying, and I like it.
Gomez and two other men on the creative team for one of the next notable Xbox 360 and PlayStation 3 horror games, this year's Silent Hill: Downpour, showed me a slice of the game at E3 earlier this month. Like good game previewers, they said the right things while showing something promising. It's a game that, series fans will probably be happy to hear, doesn't operate with the rush of an action game. It's a crawl in darkness.
This new Silent HIll, made by Konami and the young Czech studio Vatra Games, is bleak and spooky. Its lead character is Murphy Pendleton, a prisoner who crawls himself out of a crashed prison bus to find himself on the outskirts of the town of Silent Hill.
Gomez and his colleagues showed Pendleton using a flashlight as he carefully explored the dark town, solved some puzzles and, later, fended off monstrous enemies. They said they wanted to make a game that felt like classic Silent Hill, but felt they could do it without filling the game with Pyramid Head, creepy nurses or other series hallmarks. Instead, they promise a new adventure but one that will be true to the rhythms of, say, a Silent Hill 2.
Advertisement
They want players to focus on exploration and survival, and they want to spare them some old Silent Hill frustrations. You shouldn't expect to find doors that won't open. See a door... enter it. You won't have to waste time finding keys. See a lock...bash it open with a crow bar. You shouldn't expect to be stymied by puzzles or combat, each of which can be tuned by the player to different difficulty levels. And you won't have to worry about simplicity. If a player cranks the puzzle difficulty to high, Pendleton will stop muttering hints.
I watched the developers make Pendleton skulk through shacks and a tram station. A mailman showed up out of nowhere, and he certainly seemed creepy. We got to a diner which was transformed in a flash into a nightmare version of the "real" world, a transformation to a different reality that the developers promise will seem more warped as the game progresses. Nightmare versions of the world will eventually seem as if they were designed by M.C. Escher, they teased.
And through it all, Pendleton will have to be a survivor. He won't be a hero with a big arsenal of guns. He'll be armed with what he can carry in his hands (thankfully he can latch his flashlight to his belt). His melee weapons will break. And his enemies will probably send him running, as was the case with a pair of "screamers" that tried to distract and then attack our hero. Pendleton can fight, but it's going to be tough. When it rains, as it will often do thanks to the game's randomized weather system, even more aggressive enemies will show up.
Most of the story of this game is a mystery for now. Part of the point of playing a Silent Hill is to figure out what is going on—and even who our protagonist is. That's the case here too in what the developers say is physically the largest Silent Hill yet, in terms of indoor and outdoor spaces. Size isn't the chief quality that makes a game of this type good, of course. It's writing and mood, pacing and the ability to instill fear in the player. The potential is there for a wonderfully unpleasant journey, a game in which bullets won't help much and where the joy will emerge via a bleak quest to survive a new visit to the demented Silent Hill. |
In a case where panels constituting an automobile and the like are fixed to each other, there is a case wherein water-tightness and the like are required for a fixing portion by a screw grommet. In this case, the sealing between the attachment hole formed in the panel and the like and the screw grommet, and the sealing between the screw grommet and a screw which is screwed thereinto, are required. In such case, conventionally, a washer-like body with elasticity on a lower face side of a flange of the screw grommet was disposed, and also the washer-like body with the elasticity on a lower face side of a head of the screw was disposed.
Incidentally, as a screw grommet wherein an opening of a screwing hole of screw means is covered by a hot-melt material, there is a screw grommet shown in Patent Document 1. Also, as a screw grommet with a structure comprising a seal washer on a lower face of the flange, there is a screw grommet shown in Patent Document 2.
Patent Document 1: Japanese Unexamined Patent Publication No. S58-24646
Patent Document 2: Japanese Utility Model Publication No. H06-24220 |
Q:
unreal engine -waitmutes-2015 exited with code 255
when i make a new c++ project in ue4(doesnt matter version because same problem with most 4.8-4.11)it gives me:
The following modules are missing or build with a different engine version:UE4Editor-test.dll
Would you like to rebuild them now?
i press yes and it gives me:
test could not be compiled.try rebuilding from source manually.
when i build the "source" in VS2015 , i get
:MSB3073 The command ""C/:Program Files (x86)\Epic Games\4.11\Engine\Build\BatchFiles\Rebuild.bat" testEditor Win64 Development "C:\Users\usr\Documents\Unreal Projects\test\test.uproject" -waitmutex -2015" exited with code 255.
so i cant open the project made for C++ (no for blueprints) in the editor.
Any help appreciated!!
A:
It seems this is a known issue:
https://answers.unrealengine.com/questions/185309/cant-compile.html (I know it's old but it seems to be a problem UE4 likes to run into sometimes)
Scraped from the link below above for attempting to fix this error:
Rebuild your project: https://www.youtube.com/watch?v=5J4ocSzoDK8 (delete your .sln files and your Binary/Win64 folder. Right-click .uproject and "generate visual studio files"
If this doesnt work, if you're using the Unreal Launcher: try building from source: https://docs.unrealengine.com/latest/INT/Programming/Development/BuildingUnrealEngine/
If this still doesn't work, I'd reinstall Visual Studio (update it to newest version if you're on an older version) and try again with a from-source version of UE4. (I sure hope this last one works. VS + UE4 setup is a hefty download)
Hopefully one of these helps :)
|
Video: Ricky van Wolfswinkel on target in Norwich City’s 2-0 development win over Leicester City
Ricky van Wolfswinkel was on target in Norwich City's 2-0 development win over Leicester City's U21s at Colney on Monday afternoon. Picture by Simon Finlay Archant Norfolk.
Ricky van Wolfswinkel scored in front of the watching Alex Neil as Norwich City’s development squad beat Leicester City’s Under-21s 2-0 at Colney on Monday afternoon.
Share Email this article to a friend To send a link to this page you must be logged in.
Van Wolfswinkel slotted a close range second-half goal after pouncing on a errant back pass to seal the victory, after Vadis Odjidja had scored prior to the interval.
The duo were included as over-age outfield players in a strong-looking home side which also featured the likes of Liverpool loanee Andre Wisdom, Josh Murphy and Harry Toffolo.
New summer signing Jake Kean also made an appearance and the former Blackburn keeper denied Jacob Blyth on numerous occasions in a competitive work-out in front of Neil and his coaching staff.
Van Wolfswinkel span away down the right in the 14th minute before picking out Jamar Loza who lashed over from 14 yards.
Toffolo and Odjidja then combined for the Dutchman but his snap header was gathered by John Maddison in a bright start from the striker.
The Belgian international then whipped in another inviting cross headed clear by Ryan Watson before Murphy’s deflected hit spun through to Maddison. Callum Elder’s near post block foiled van Wolfswinkel shortly afterwards when he looked favourite to attack Wisdom’s inviting cross.
Afolabi Coker was fortunate to escape with an errant back pass in the 32nd minute for the hosts, but Harry Panayiotou sliced wide of Kean’s far post.
Murphy then produced a trademark burst and low cross but there were no takers in yellow inside the six yard box.
City finally opened the scoring in the 38th minute when Odjidja raced clear onto Murphy’s pass before guiding a right-footed effort past Maddison from 18 yards.
Kean denied Blyth with an acrobatic tip over in the 40th minute after the Leicester forward had risen between Coker and Michee Efete.
Blyth then was left unmarked again seconds later but screwed a follow-up header wide from the edge of the area.
Leicester tried to up the pace after the interval, but Maddison denied Murphy with a sharp stop in the 56th minute when the Norwich midfielder looked to poise to double the hosts’ lead.
Odjidja’s right-footed swerving effort flew wide from 20 yards with City probing but Kean kept Norwich in front with a brave block to foil Blyth in the 69th minute.
Van Wolfswinkel notched from close range after rounding Maddison following a swift raid down the Norwich right sparked by Reece Hall-Johnson which ended with a a weak back pass from the Foxes’ defender towards his keeper anticpated by the striker, who departed before the restart.
Kean renewed personal rivalries with Blyth in the 83rd minute with the same outcome, although the home keeper required treatment after appearing to take the impact in the stomach.
Odjidja cut inside Ben Chilwell in the closing stages only to drag his left-footed shot at Maddison.
• Norwich City U21s: Kean, Wisdom (Hall-Johnson 71), Toffolo, Thompson, Coker, Efete, Odjidja, McGrandles, van Wolfswinkel (Norman 75), Loza (King 61), Murphy. Subs (not used): Killip, Grant.
• Goals: Odjidja (38), van Wolfswinkel (74)
• Booking: Norman (foul on Choudhury, 84)
• Leicester City U21s: Maddison, Sesay, Chilwell, McCourt, Elder, Moore, Doodoo (Choudhury 73), Watson, Blyth, Panayioutou, Fox (Ndukwu 64). Subs (not used): Davis, Smith-Varnam, Stanekvicius.
• Booking: Choudhury (foul on Norman, 84)
• Referee: A Da Costa
If you value what this story gives you, please consider supporting the Eastern Daily Press. Click the link in the orange box above for details. |
The Astounding Jim Beaver
I recently made a case to a friend that Jim Beaver had played some role in so many of the best tv shows in the last few years that Mad Men best find a place for him or risk becoming obsolete. Ok, so that’s a bit of an exaggeration and Mad Men’s probably gonna continue to be awesome even if they don’t find a way to fit Jim Beaver into those Sterling Draper Pryce offices (or just Sterling Draper now, is it?), but seriously wouldn’t this show, and most others, be improved by his presence?
I’m glad to see I’m not the only one to notice his ubiquitous ability to improve upon already entertaining tv shows. The AVClub wrote about how what defines a Jim Beaver role is the eagerness of writers to take a perhaps simplistic character and add considerable depth once they realize what they have in the actor playing him. They offer up the examples of Sheriff Parlow on Justified – who ends up becoming a much more fascinating character as this last season progresses (possibly too late SPOILER ALERT: avoid reading the AVClub article if you’re not caught up), Bobby Singer on Supernatural, and Ellsworth on Deadwood. Each of these characters was originally intended for a smaller or simpler role in the show, but ended up becoming someone special to the plot, the other characters, and the viewers as the shows progressed.
He’s also shown up in smaller roles on a few other shows with varying levels of critical acclaim: Breaking Bad, Dexter, and Big Love; all adding to an extensive imdb page full of impressive character roles played over the last few decades.
In addition, he’s built up a reputation for being one of the actors most inclined to interact directly with fans of the shows he’s on and engage with them in intellectual discussions, as well as provide stories from on set. In turns out that the man who repeatedly plays characters who viewers just wanna hug, off set inhabits the kind of real-life persona that, well, people just wanna hug. |
Changing geographies of care: employing the concept of therapeutic landscapes as a framework in examining home space.
Changes in health care service delivery have resulted in the transfer of care from formal spaces such as hospitals and institutions towards informal settings such as home. Due to the degree of this transfer, it is increasingly important for geographers to explore the experience and meaning of these changing geographies of care in order to reveal and understand the impact and effect on particular individuals and places. Recognizing that the home environment not only designates a dwelling but also represents a multitude of meanings (such as personal identity, security and privacy) that likely vary according to class, ethnicity and family size (among other socio-demographic variables), it presents a complex site for study. This paper suggests research directions to further understand the role of caregiving in contributing to the experience and meaning of the home environment by informal caregivers, the majority of which are women. Using a political economy approach, this paper first reviews the reorganization of health care services and discusses how this is reshaping the experience of informal caregivers at home. A review of the place identity literature contextualizes the specific discussion of the literature on the meaning of home, both of which are then critically examined. Next, the concept of therapeutic landscapes is discussed as an idealized framework to explore the health-promoting properties of home on informal caregivers. Questions for research are outlined before conclusions highlight how research on home space can allow a better understanding of the impact and effect of caregiving on family caregivers and the places where they live. Such research can inform the changes and trends in health care service policy. |
For this episode of MilLiberty, Caleb is joined by Zuri Davis, who has frequented the program several times and is an influential writer in the liberty movement. They spend their time on the program discussing as much relevant news as they can fit within an hour. Spanning from John McCain’s Read more…
This episode of MilLiberty welcomes Alex Merced on the program. Alex is the Vice Chair of the Libertarian National Committee, and he speaks with Caleb about the state of the Libertarian Party as well as his plan for growth in 2018 and beyond.
After Senator John McCain passed away, the political world divided into two equally damaging and unhealthy factions. On one side, some of the very people who ran his name through the mud in 2008 were almost deifying him. On the other side, some people who claim to care about individualism Read more… |
h. Which is the closest to -0.1? (a) 1/8 (b) 20 (c) r
a
Let d = 2/29 - 35/87. Let q = -117.9 + 39. Let k = 79 + q. Which is the closest to -1/2? (a) d (b) -2/19 (c) k
a
Let z be ((-360)/6)/(-6) - 0. Suppose z*j - j = -8*j. Which is the nearest to j? (a) 0.05 (b) -6/7 (c) 0.3
a
Let g be (-432)/(-180)*1/3. What is the nearest to -0.94 in -1/5, g, -1?
-1
Let s = -2.6196 - 0.3804. What is the closest to 84 in -0.4, 2, s?
2
Let z be (-301)/28 - -4 - -6 - 0. What is the nearest to z in -2.5, 3, 0.02?
0.02
Let g = -0.075 - -0.175. Which is the nearest to -3? (a) 2 (b) 264 (c) g
c
Let q be (-3)/(-12)*-2*(-25 + 26). What is the closest to q in 8, 2, -2, -5?
-2
Let y be (-1)/(-3) - (-8)/3. Let s(v) = v**3 - 34*v**2 - 55*v - 99. Let h be s(35). Let w = h - -801. Which is the nearest to 2/5? (a) y (b) 1 (c) w
b
Let u = 0.53596 + -0.33596. Let d = -289/4 + 73. What is the closest to d in 2, u, 2/15?
u
Let u be (2/(-6))/(7059/362). Which is the nearest to -2/15? (a) u (b) -3 (c) -2
a
Let i = 0.2 - 0.1. Let s be 512/720*25 - 18. Which is the nearest to i? (a) 4 (b) s (c) 1
b
Suppose -2595 = -5633*g + 3038. Let p be 0 + (-1)/1 + 0. What is the closest to -1 in 2/9, -1.3, p, g?
p
Let j(u) = u - 15. Let c be j(12). Let k = 0.1 - 0.3. Let h = 1791 - 14329/8. What is the nearest to h in k, c, -0.3?
k
Let j be (-416 - -412)*(2/6 - (-21)/(-144)). What is the closest to -1/2 in -0.1, j, 5, 26?
j
Let d = -23 + 29. Let o = -0.7619 + -0.2381. What is the nearest to d in o, 5, 0.1?
5
Let g = -35 + 64. Let j = 30 - g. Let l = -1.1 + 1.2. What is the nearest to l in 0.3, j, -1/6?
0.3
Let j = 12882 - 12877. Which is the closest to j? (a) -18 (b) 5 (c) -3/8
b
Suppose 3*f + y - 19 = -3*y, -4*y + 4 = 0. Let z = 3487.7 + -3488. Which is the closest to 1? (a) 0.015 (b) z (c) f
a
Suppose -55*p + 60*p = 4*k - 16, 24 = -4*k - 5*p. Which is the closest to -2? (a) 3/2 (b) k (c) 39 (d) -0.6
b
Let d = -1.97 - 0.03. Suppose -p + 2*p + 1 = 0. Let x be 39 - 11 - (7 - -24). Which is the nearest to 0? (a) p (b) x (c) d
a
Let o be (1 - -1) + 622/12 - 3/(-18). What is the nearest to -1 in -1/4, o, 2?
-1/4
Let d be (35/(-45))/((-372)/72 + 4). Suppose -2*c + 5*c - x = -7, 3*c + 3*x - 9 = 0. What is the closest to d in 0.5, -4, c, -1/3?
0.5
Let r(y) = 10*y - 55. Let f = 16 - 11. Let o be r(f). Which is the closest to 30? (a) o (b) -1/3 (c) -1/4
c
Suppose 0 = 5*j + 3*l - 1, 6*l - 2*l = -j - 10. Which is the closest to j? (a) 3/8 (b) 14 (c) 3 (d) -0.2
c
Let s be 5 + -2 + (-3)/2. Let u be (4806/504 - 9) + (3 - 26/8). What is the nearest to -6/11 in 4/5, -5, s, u?
u
Suppose d = 3*d + 298. Let u = -1045/7 - d. Which is the nearest to 6/7? (a) 1 (b) -2 (c) u
a
Let k = -1156.2 + 1154.1. Let w = 1.5 - -0.5. Let y = k + w. Which is the nearest to 1? (a) 2/7 (b) y (c) 1/5
a
Let n = 223 + -223. Suppose -s = -2*s. Suppose s = 2*m - 5*m. Which is the closest to m? (a) n (b) -2/3 (c) -4
a
Let h = 101.037 - 0.037. Let t = -170 + h. Let f = t - -66. What is the closest to -0.1 in f, 2, -6?
2
Suppose 0 = -6*x + 1212 + 60. Let u = -211 + x. Which is the nearest to u? (a) 5 (b) 3/5 (c) -0.8
b
Let o = 5 - 5.1. Let y be ((-278)/(-1251))/((-6)/(-3)). Which is the nearest to y? (a) o (b) 0.1 (c) -2 (d) 0.2
b
Let r = 2616/13 + -609554/3029. Which is the closest to r? (a) -3 (b) 0.2 (c) -1/9 (d) -1/6
c
Let v = -222.859 + 223. Let i = -0.041 + v. What is the closest to i in -3, 1/12, -1?
1/12
Let x = 0.2 + -0.2. Let y = 1.7109 + -1.7109. What is the closest to y in x, -1/2, 2/31?
x
Let g = 1800 + -1794. What is the closest to -14 in -1, g, -0.2?
-1
Let r be 1444/1596 - (-100)/(-175). Suppose -4*j = -y - 1, -5*y - 5*j = 10 + 20. What is the nearest to r in -20, -1/5, y?
-1/5
Suppose -47*j + 50*j + k = -18, -34 = j + 5*k. Which is the closest to j? (a) 4 (b) 1 (c) 22 (d) 0.5
d
Let j = 288837 + -291282.06. Let v = j - -2404. Let y = v + 41. Which is the nearest to y? (a) -2 (b) 0.1 (c) 0
c
Let d = 10.636 - 8.636. Let x = -1 + 1.3. Which is the closest to d? (a) x (b) -2 (c) 0.4
c
Let k = -317/237 + 1/237. Let w = -7/12 - k. What is the closest to 9 in -4, w, -1?
w
Let z = 659 + -634. Which is the closest to -1/2? (a) 1 (b) z (c) 2 (d) 0
d
Let m = 4 + -4.4. Let g = -0.86 - 72.14. Let l = -73.04 - g. Which is the closest to l? (a) m (b) -1/5 (c) -0.1
c
Let s be (154/(-14) - -11) + -3. Which is the nearest to 68? (a) 0.5 (b) -7 (c) s
a
Let u = 2.273 + -2.23. Let d = u - 0.143. What is the nearest to 2/23 in d, 3, -5?
d
Let r = 103/520 + 21/104. Which is the nearest to -1? (a) -1 (b) 44 (c) r
a
Let p = -0.94 + -0.06. Let u(y) = y - 1. Let l be u(3). Let s = -0.8978 - -1.2978. Which is the closest to p? (a) s (b) 0.5 (c) l
a
Let n = -1125 - -1125.1. What is the nearest to 0.09 in 4, n, -0.1, 5/4?
n
Suppose -8*h = -7*h + 6. Let m be (-16)/36*h/12. What is the nearest to 0.1 in -0.1, 26, m?
m
Let h = 1771.7 + -1771.638. What is the closest to -0.02 in h, 3, 2/7?
h
Let f = 0.41022 + -0.01022. Which is the nearest to -1/2? (a) -24 (b) -2/7 (c) -1/2 (d) f
c
Let w = 0.07 - 0.07. Let f = -3798.1 + 3798. Which is the nearest to -0.1? (a) 21 (b) w (c) f
c
Let v = 4/105 - -8/15. Let l = -18329 - -54988/3. Which is the closest to l? (a) v (b) -0.3 (c) -2
a
Let r = 73691/21 - 10526/3. Which is the closest to 10? (a) -0.5 (b) 4 (c) r (d) 1
b
Let z = -25861 - -25824. Let j = -81 - -46. Let i = j - z. Which is the closest to 0? (a) i (b) 4 (c) -0.5
c
Let g = -1858/5 + 13011/35. What is the closest to 4/7 in -0.1, -3/5, -1, g?
g
Let u be (-18)/(-102)*(-68)/72. Let h = -0.9 + 1. Which is the closest to h? (a) u (b) 1 (c) 1/2 (d) 1/7
d
Let g = 4.4 + -5.4. Let f = -0.94 - -4.94. Which is the nearest to -1? (a) 25 (b) g (c) f
b
Let v = 4321.2 - 4321. Which is the closest to 0? (a) 20/3 (b) v (c) 0.3 (d) -1/4
b
Let r = 1143 - 1141. Which is the nearest to r? (a) -2/13 (b) 2/3 (c) 0.09
b
Let o = -1.759 - -0.849. Let n = 0.1 - 0.19. Let q = n + o. What is the closest to -2 in q, -4, 0.01?
q
Let g = -187 + 181. Let r be (-22)/6 + (g - 20/(-2)). Let t = -1.9 - -0.9. Which is the nearest to t? (a) r (b) -0.1 (c) 3
b
Let m = 10.2 + -12.2. Let j = 27 - 7. Let r = 750 + -749.9. Which is the nearest to -1/2? (a) j (b) m (c) r
c
Let f = 83.2 - 76.06. Let o = -7.04 + f. Which is the nearest to o? (a) 3 (b) 6 (c) 0.2 (d) -2
c
Let k = -1399 + 1392.6. What is the nearest to 0 in 0.4, 1/7, k?
1/7
Let z = -23 - -22.8. Let m = 736/77 - 10886/1155. Let r be (-1)/22*(-8)/6. Which is the closest to r? (a) z (b) 4 (c) m
c
Let x = 8.986 - 9.986. What is the nearest to x in -3/8, -2/7, -0.1?
-3/8
Let u = 7803 - 7807. Suppose 0 = -4*x + x + 5*t + 28, 2*x = -3*t - 13. What is the closest to 4 in x, -1, 1/3, u?
x
Let s = -57.93 - -57.83. What is the closest to 674 in 0.2, 4, s?
4
Let j be 1 + 1 - (-305)/(-30) - (-104)/13. Which is the nearest to 0? (a) j (b) -1.2 (c) 20
a
Let w = 0.077 + 1.923. Let y = -194 + 193.99. Which is the nearest to 3/8? (a) -2/15 (b) y (c) w
b
Suppose -3*v = -4*v + 3. Let x = 56413 + -56413. Which is the closest to 0.04? (a) x (b) -2/15 (c) v
a
Let m = 132.8 + -132.7. What is the nearest to -2/3 in 0.3, -0.207, m, 2?
-0.207
Let h = -0.679 - -1.079. Let l be (-1140)/(-4235) - 2/7. Let d = l + -236/363. Which is the nearest to d? (a) 5 (b) -0.1 (c) h
b
Let k = 2309/8 + -289. Suppose -448 = 4*z - 5*o, -2*z = -3*o + 27 + 199. Let q = 106 + z. Which is the nearest to -2/15? (a) k (b) q (c) 4
a
Let x = 23335 - 23264. Which is the closest to 1? (a) -0.22 (b) 4 (c) -4 (d) x
a
Let p = -767.442 + 1.442. Let i = p + 766.7. Which is the nearest to i? (a) 5 (b) 2/17 (c) -2 (d) 4
b
Let g be 17/((-357)/(-70)) + -3. Let h = -2.8 + -12.2. Let c = 14.6 + h. What is the closest to c in 0.4, 0, g?
0
Let p = 665 + -668. What is the closest to p in -4/5, 1/2, 2.9?
-4/5
Let c be (-6)/(-8) + 2/(-8). Suppose -264*a - 1370 - 214 = 132*a. What is the closest to a in c, -1, 1?
-1
Let y = 5433 + -5489. Which is the nearest to -0.1? (a) y (b) -5.2 (c) -5
c
Let n be 1 - 1/((-6)/124). Let d = n - 22. Let h = -15.8 + 11.8. Which is the nearest to 0? (a) h (b) d (c) -0.1
c
Let g = 4 + 71. Let f = g + -75.2. Suppose 0 = |
It’s been more than a few months since we first began discussing the obvious internal conflict between White Hats and Black Hats within the Obama intelligence and national security agencies. Today, we see exactly how bad the fracture has become.
As further evidence of the politicization of the CIA (Central Intelligence), headed by John Brennan; and DNI (Director of National Intelligence) James Clapper, the agencies are refusing to brief congress on their claim the “Russians Hacked the U.S. Election”.
On Monday, House Intelligence Committee Chairman Devin Nunes sent a letter to DNI James Clapper requesting the director immediately brief congress (Friday, December 16th). Both Clapper and Brennan are now refusing to explain their public claims.
On November 17th Director Clapper told congress there was no basis to identify Russia’s involvement in the DNC and Podesta email leaks release by WikiLeaks in the run up to the election.
However, last week the Washington Post and New York Times claimed officials within the DNI and CIA held proof of Russia hacking the election.
There are many people, ourselves included, who see these DNI/CIA stories as truly nothing more than a political stunt from two highly politicized intelligence agencies, with two highly politicized political operatives in Brennan and Clapper.
The fact that both agency heads would refuse to brief congress on the issue is further evidence the entire construct is demonstrably false, intended solely to create an anti-Trump narrative and undermine the incoming presidency.
Here’s the press release from House Intelligence Committee Chairman Devin Nunes:
“It is unacceptable that the Intelligence Community directors would not fulfill the House Intelligence Committee’s request to be briefed tomorrow on the cyber-attacks that occurred during the presidential campaign. The legislative branch is constitutionally vested with oversight responsibility of executive branch agencies, which are obligated to comply with our requests. The Committee is vigorously looking into reports of cyber-attacks during the election campaign, and in particular we want to clarify press reports that the CIA has a new assessment that it has not shared with us. The Committee is deeply concerned that intransigence in sharing intelligence with Congress can enable the manipulation of intelligence for political purposes. The Committee will continue its efforts and will insist that we receive all the necessary cooperation from the relevant leaders of the Intelligence Community.” (read more)
There is mounting evidence the entire President Obama intelligence apparatus has been compromised beyond repair. This is the fundamental reason for the DoD rising up to take charge of National Security. – SEE HERE –
With General Mattis as Secretary of Defense, Michael Flynn as National Security Advisor, General John Kelly as Secretary of Homeland Security, a top-of-class West Point graduate in Mike Pompeo brought in to take over and undoubtedly purge the CIA, and a lame duck struggle breaking out over the NSA with Admiral Mike Rogers, the implications are pretty obvious.
The white hats we have needed within the national security and intelligence departments are responding from a select group within the Defense Department. This DoD surge appears to be why corporate interests are railing against “too many generals”. The DoD generals also appears to be why all of those interests -within all of those corrupted political intel institutions- are going nuts thinking about what lays ahead.
Mounting evidence supports the ongoing thesis the Department of Defense has actually seceded from the political elites. A wonderfully patriotic soft coup has taken place; and with the election of President Donald Trump, the white hats are poised on the horizon to reconstruct a nationalist-minded defense, security and intelligence apparatus.
This is the fundamental paradigm shift many have quietly discussed, yet few imagined possible.
[TOP General Mattis (Trump DoD), General Kelly (Trump DHS) – Bottom (L-R) Mike Pompeo (Trump CIA), Gen. Michael Flynn (Nat Sec), Admiral Mike Rogers (NSA)] |
Thanks for the clarification, I should have checked before posting. Still, it's slightly over 10 percent of the world's sovereign nations, so most countries manage well enough without a separate government district.
That said, the land occupied by the UN headquarters building and the building spaces is administered by the UN, not a part of US territory, even though the UN has agreed to follow US legislation in exchange for access to utilities and emergency services.
This list is itself misleading. Many more capitals are either their own state or independent cities: Paris is its own département, Berlin its own Land, Madrid is an autonomous city. Others are part of small counties and districts that incorporate several suburbs with the capital in order to integrate the working area of the capital. |
<string-array name="india_state_codes">
<item>AN</item>
<item>AP</item>
<item>AR</item>
<item>AS</item>
<item>BR</item>
<item>CH</item>
<item>CG</item>
<item>DN</item>
<item>DD</item>
<item>DL</item>
<item>GA</item>
<item>GJ</item>
<item>HR</item>
<item>HP</item>
<item>JK</item>
<item>JH</item>
<item>KA</item>
<item>KL</item>
<item>LD</item>
<item>MP</item>
<item>MH</item>
<item>MN</item>
<item>ML</item>
<item>MZ</item>
<item>NL</item>
<item>OR</item>
<item>PY</item>
<item>PB</item>
<item>RJ</item>
<item>SK</item>
<item>TN</item>
<item>TR</item>
<item>UK</item>
<item>UP</item>
<item>WB</item>
</string-array>
|
Glossary
media access port
A slot or other opening in a robot where you can insert or remove a tape without having to access the interior of the robot. After you insert a tape, you move it to a slot by using an inject command. Prior to removing a tape, you move it to the port by using an eject command. The inject and eject commands are supported through the add and move screens in the Enterprise Media Manager (EMM) administration interface. |
Customized Yoga & Fitness For Every Body (Oahu only)
I am so happy! This is the happiest I have ever been in my life. My depression is gone, my energy levels are perfect, and I hardly have anxiety any more. I feel like I am flowing through life. Thank you.
–Loren Collier, Army Lactation Nurse
Your inspired, healthy life can start right now!
We love helping you be good to yourself and then seeing you get all excited about your transformation!
How can we help?
I just want to say how grateful I am to Traci & Skya to have learned a foundation for good nutrition and overall health based on science that may not be mainstream, but is powerfully true. Eating well not only changed my physical body, but it helped me let go of alcohol. This healing process also deepened my meditation practice.
Visit Our Blog!
Inspired by our personal experiences healing ourselves and years of working with clients, our mission is to combine traditional knowledge with up to date, independent scientific research to help return nourishing foods and holistic health wisdom to you! The time is now! Come spoon with us! Read More… |
Didier Ruef
Didier Ruef (born 1961) is a Swiss documentary photographer best known for his portrayal of Man & Waste, Recycle & Sustainability, Africa, Man & Animals, Swiss Alpine Farmers and Contemporary Switzerland.
Life and career
Didier Ruef was born in Geneva, Switzerland on July 15, 1961. He graduated from the University of Geneva, where he studied Economics (1981–1984).
In 1985, Ruef went to New York, where he obtained a diploma (1986) in photojournalism at the International Center of Photography (ICP). It was there that he developed his long-term essay of the life of a Puerto Rican family in Spanish Harlem, for which he won the Yann Geoffroy Prize in Milan in 1990. These photographs were exhibited at the Musée de l'Élysée in Lausanne, Switzerland, in 1990.
Since returning to Switzerland in 1987, Ruef started to work as a freelance documentary photographer and photojournalist and has visited all five continents, with a preference for Africa. He has worked on various stories on the human condition in black & white and color.
Ruef was a member of Network Photographers Agency in London from 1991 to 1997. He was a founding member in September 2002 of the Swiss photo agency, Pixsil, which he left in July 2009. Today he works as a freelance photographer., but he is also represented worldwide by the photo agencies Luz Photo Agency, Visum Foto and Redux Pictures.
Ruef has worked with Médecins Sans Frontières, the Global Fund to fight AIDS, tuberculosis and malaria, Heks (Interchurch Aid), Swiss Red Cross, the Syngenta Foundation and the World Council of Churches.
Ruef's pictures are published in numerous magazines and newspapers in Europe, Asia and Northern America.
He won the King Albert Memorial Foundation Prize in 2000 for his book on Swiss mountain farmers (Bauern am Berg, Paysans de nos montagnes, Vita di montagna). This award, among other prizes, was the culmination of a long-term personal project which began in 1993 and completed in 1997. It was made possible with the support of Pro Helvetia for the photography and book in 1998, and an itinerant exhibition which toured Switzerland, Italy, Singapore and Jordan between 1999 and 2002.
In 2000 and 2001, Ruef was commissioned by the Swiss branch of Médecins Sans Frontières (MSF) for an extensive photographic report on daily life in six African countries. These pictures, together with those from numerous other African essays form the basis of a book Afrique Noire, published in 2005. An itinerant exhibition toured Switzerland and France between 2005 and 2007.
In 2007, he was commissioned by the Swiss Foundation DiDé, Dignité en Détention, for a book Enfants Prisonniers on the minors’ jail in Gitarama, Rwanda.
From 1991 to 2011, he has also been involved in a personal project worldwide on the relationship between Man and Waste. He has shot twenty photo essays and has finally published in 2011 the book Recycle, Labor et Fides (French-English) and Edizioni Casagrande (Italian-German).
In the fall of 2018, he has published the book Homo Helveticus by Till Schaap Edition on his beloved country Switzerland.
Awards
Deutscher Fotobuchpreis. Nomination 2012
Swiss Press Photo. First prize for the foreign section. 2006
Fujifilm Euro Press Photo Awards. Swiss prize for the technique section. 2004
Swiss Press Photo. First prize for the foreign section. 2003
Swiss Press Photo. First and third prizes for the foreign section. 2002
King Albert Memorial Foundation for the book Bauern am Berg, OZV Offizin Zürich Verlag. Switzerland. 2000
Schweizerische Arbeitgemeinschaft für die Berggebiete (SAB) Switzerland for the book Bauern am Berg OZV Offizin Zürich Verlag. Switzerland. 1999
Passy's mountain book fair, France, for the book Paysans de nos montagnes, Editions Monographic. 1999
Honorable mention. UNESCO. Japan. 1993
Applied Arts Magazine Awards Annual. USA. 1993
Third black&white prize. Nikon International. Japan. 1991
Yann Geoffroy. Grazia Neri . Milan. Italy. 1990
Second color prize. Nikon International. Japan. 1989
Grand Prix. L'Illustré. Switzerland. 1983
Books
Homo Helveticus. Till Schaap Edition. Switzerland. 2018
Iași – Puncte de vedere. Iași Editura Muzeelor Literare.Iași. Romania. 2015
Afrika, letzte Hoffnung.(Reprint with a new book cover). Pier Paolo Pasolini. Mit Fotografien von Didier Ruef. Corso. Hamburg. Germany. 2015
Bestiarium. QTI. Stabio. Switzerland. 2012
Afrika, letzte Hoffnung. Corso. Hamburg. Germany. 2011
Recycle. Labor et Fides. Switzerland. 2011
Recycle. Casagrande Edizioni. Switzerland. 2011
Enfants Prisonniers. Fondation DiDé, Dignité en Détention. Geneva. Switzerland. 2007
Afrique Noire. Infolio Editions. Switzerland. 2005
Tausendundein Krieg. NP Buchverlag. Austria. 2004
Vita di montagna Edizioni Casagrande. Switzerland. 1998
Paysans de nos montagnes. Editions Monographic. Switzerland. 1998
Bauern am Berg OZV Offizin Zürich Verlag. Switzerland. 1998
Weltenblicke. Reportagefotografie und ihre Medien OZV Offizin Zürich Verlag. Switzerland.1997
Collections
Collezione della Republica e Cantone Ticino. Switzerland.
Collection Charles-Henri Favrod, Saint-Prex. Switzerland.
Fonds cantonal d’art contemporain, Geneva. Switzerland.
Fondation MAST, Bologna, Italy
Fonds pour la photographie, Geneva. Switzerland.
Musée de l'Élysée, Lausanne, Switzerland.
Museo Casa Cavalier Pellanda. Biasca. Switzerland.
Schweizerische Stiftung für die Photographie, Zürich. Switzerland.
Exhibits
Individuals
2016
72 boulevard des écorchés. Cité Séniors, Geneva. Switzerland
2014
Animals’ World. Leica Galerie Salzburg, Austria
Les déchets dans le monde. Printemps de l'environnement: réduisons, réutilisons, recyclons. Ville de Palaiseau. France.
2013
Animals’ World. Leica Gallery. Zingst. Germany.
2007
Afrique Noire. Völkerkundemuseum. Zürich. Switzerland.
2006
Afrique Noire. Itinéraires des Photographes Voyageurs, Bibliothèque Municipale, Bordeaux. France.
2005
Africa Nera. Museo d’arte, Mendrisio. Switzerland
Afrique Noire. Galerie Focale, Nyon. Switzerland.
Schwarzafrica. Coalmine Gallery, Winterthur. Switzerland.
2002
Mountain farming. The Jordan National Gallery of Fine Arts, Amman. Jordan.
2001
Paysans de montagnes. The Substation. Singapore.
Vita di montagna. CCS Centro Culturale Svizzero, Milan. Italy.
Vita di montagna. Forte di Nago, Torbole. Italy.
2000
Bauern am Berg. Museo Nazionale del San Gottardo. Switzerland.
Paysans de nos montagnes. Galerie Focale, Nyon. Switzerland.
1999
Vita di montagna. Castelgrande, Bellinzona. Switzerland.
"Paysans de nos montagnes." Caves de la maison de Courten, Sierre (Switzerland).
1998
Bauern am Berg. Völkerkundemuseum, Zürich. Switzerland.
1993
Gens de la Voirie. MJC St.-Gervais, Geneva. Switzerland.
1991
Spanish Harlem. Family Life. Musée de l'Élysée, Lausanne. Switzerland.
1990
Médecins Sans Frontières in Uganda. Maison du Grütli, Geneva. Switzerland.
Group
2019
Homo Helveticus. Umweltfotofestival Horizonte Zingst. Germany.
2017
Sulle vie dell'illuminazione Il mito dell'India nella cultura occidentale 1808-2017. MASI Lugano. Switzerland.
2016
Révélations. Photographies à Genève. Musée Rath. Geneva. Switzerland.
2015
Sonntag Nachmittag in der Schweiz. Seebad Seewesen. Switzerland.
Recycled. Villa Dutoit. Geneva. Switzerland.
2014
Recycle. Umweltfotofestival Horizonte Zingst. Germany.
Rwanda. Minors in detention. LuganoPhotosDays. October 17–26. Lugano. Switzerland.
2013
Collection Charles-Henri Favrod. Saint-Imier Museum. Switzerland.
Bestiarium. Umweltfotofestival Horizonte Zingst. Germany.
Des Images pour la liberté d’expression. RSF (Reporters Sans frontières). SIG. Geneva. Switzerland.
Des Images pour la liberté d’expression. RSF (Reporters Sans frontières). LuganoPhotoDays. Lugano. Switzerland.
2012
12x7. Museo Casa Cavalier Pellanda. Biasca. Switzerland.
Vestiges. Le Manoir de la Ville de Martigny. Switzerland.
2011
Un mondo di persone (Objective : People's world. WHO). Spazio Villas, Parco di San Giovanni. Trieste. Italy.
2010
Black Africa – Rwanda, Enfants Prisonniers. 10th Shanghai International Photographic Art Exhibition. Exhibition Center of Shanghai. China.
2007
Focale's 25 years . Château de Nyon. Switzerland.
Malnutrition's sensibilisation. Médecins Sans Frontières France. Lille. France
2006
Switzerland by Focale's photographers. La Gallerie Photo, Montpellier. France.
Liberté, Freiheit, Libertà. Reporters Sans Frontières (RSF). Travelling exhibit around Switzerland.
2003
Objective : People's world. WHO, Tirana. Albania.
Le monde selon Focale . Villa Dutoit, Geneva. Switzerland.
1999
O seculo do corpo. Trabalhos fotograficos 1990-1999. Culturgest, Lisbonne. Portugal.
1997
Weltenblicke. Reportagefotografie und ihre Medien. Fotomuseum Winterthur. Switzerland.
De Ketting V. Photofestival Noorderlicht, Ja Groningen. The Netherlands.
1994
Migracoes. Museu da Imagem e do Som (MIS), São Paulo. Brazil.
UNESCO / Accu . World Tour.
1993
World Press Photo. World Tour.
Picture Freedom. Photographers Gallery, London. England.
1991
Voir la Suisse Autrement. Switzerland's 700rd Anniversary. Fribourg. Switzerland.
1988
Triennale internationale de la Photographie. Fribourg. Switzerland.
1986
Central Park. New York. USA.
Lectures
15 June 2019. "Homo Helveticus". Carona Immagina (in Italian) . Ticino, Switzerland.
30 May 2019. "Homo Helveticus". Umweltfotofestival Horizonte Zingst (in German) . Germany.
13 April 2019. "Recycle". Festival dell’Ambiente e della sostenibilità (in Italian). Verdi Theatre. Milan. Italy.
11 April 2019. "Homo Helveticus". (in French). Société de Lecture. Geneva, Switzerland..
29 March 2019. "Reporters Unplugged". Festival Histoire et Cité. Uni Dufour, salle U600 (in French). Geneva. Switzerland.
12 December 2018. "Vita di Montagna". Festival letterario “Leggere le Montagne” (in Italian). Verdi Theatre. Milan. Italy.
12 November 2018. "Sostenibilità nel prisma della fotografia". Università degli studi di Milano (in Italian). Milan. Italy.
21 September 2016. "Sostenibilità e fotografia" with Roberto Antonini (RSI journalist). LuganoPhotoDays (in Italian). Lugano. Switzerland.
31 October 2015. "Recycle". Villa Dutoit (in French). Geneva. Switzerland.
16 October 2013. "Recycle". LuganoPhotoDays (in Italian). Lugano. Switzerland.
27 October 2012. "Fotogiornalismo oggi". Museo Casa Cavalier Pellanda (in Italian). Biasca. Switzerland.
3 April 2012. "Recycle". Société de lecture (in French). Geneva. Switzerland.
26 October 2011. "Recycle". International Center of Photography (in English). New York City. USA
6 October 2011. "Recycle". Lecture for the participants of Unigestion Client conference (in English). Unigestion is a leading independent asset manager. Vevey. Switzerland
7 May 2011. "Recycle". Chiasso Letteraria (in Italian). Galleria Cons Arc. Switzerland.
5 April 2011. "The meaning of photography today" (in German). Canon Switzerland. “Händler Schulung Programm”. Zürich. Switzerland.
22 and 29 September 2010. "A personal view on being a photographer" (in French). Canon Switzerland. “Creative Days Lausanne and Geneva”. Switzerland.
Workshops
2018
Albania. Travel workshop. May 19-27. Albania.
L'art de l'editing photographique. Leica Akademie Switzerland. Humanit’Art gallery. September 1. Geneva. Switzerland.
Italy. Apulia and Matera. Travel workshop. December 5-9. Italy.
2017
Master Class at "Academy of Arts, University of Novi Sad". April 26–27. Novi Sad. Serbia.
2016
LuganoPhotosDays. "Visual Storytelling. The art of reportage". November 12–13. Lugano. Switzerland.
2015
Master Class at "MAZ". March 2–6. Five days. Luzern. Switzerland.
2014
Fotofestival Horizonte Zings. "Fotografie mit einem Augenzwinkern". May 28–29. Zingst. Germany.
LuganoPhotosDays. "Documentary Photography: Just be yourself." October 18–19/25-26. Four days. Lugano. Switzerland.
2013
LuganoPhotosDays. October 12–17. Five days. Lugano. Switzerland.
2005
University of Tulsa. "Photojournalism" October 2005. Three days. University of Tulsa. Photo department. Oklahoma. USA.
CEPV. "Photojournalism". Spring 2005. Five days. Centre d’Enseignement Professionel Vevey (CEPV). Switzerland
2002
Amman."Photojournalism". One day at The Jordan National Gallery of Fine Arts Amman. Jordan.
References
Swiss Press Photo 19. Till Schaap Edition. Switzerland. 2019.
Homo Helveticus. Til Schaap Edition. Switzerland. 2018.
On the Paths of Enlightenment The myth of India in Western Culture 1808-2017. MASI Lugano. Skira. Italy. 2017.
Sulle vie dell'illuminazione Il mito dell'India nella cultura occidentale 1808-2017. MASI Lugano. Skira. Italy. 2017.
Swiss Press Photo 17. Till Schaap Edition. Switzerland. 2017.
25 Swiss Press Photo. Till Schaap Edition. Switzerland. 2016.
Swiss Press Photo 16. Till Schaap Edition. Switzerland. 2016.
Afrika, letzte Hoffnung. Corso. Germany. 2011.
Masterworks of industrial photography. Exhibitions 2013-2014. Mast Foundation.'".http://www.didierruefworkshops.com/masterworks-of-industrial-photography// MAST. Electa. Italy. 2015.
Iași – Puncte de vedere. Iași Editura Muzeelor Literare.Iași. Romania. 2015.
Swiss Press Photo 15. Benteli. Switzerland. 2015.
LuganoPhotoDays 2014.http://www.luganophotodays.ch/events/detenzione-minorile/ LuganoPhotoDays. Lugano. Switzerland. 2014.
Horizonte Zingst 2014. Seetownpublishingzingst. Kur-und Tourismus Gmbh Zingst. Germany. 2014.
Swiss Press Photo 14. Benteli. Switzerland. 2014.
Horizonte Zingst 2013. Seetownpublishingzingst. Kur-und Tourismus Gmbh Zingst. Germany. 2013.
Tout ça. De la collection de Charles-Henri Favrod. Bernard Campiche Editeur. Switzerland. 2012.
Dodicisette. Edizioni Salvioni. Switzerland. 2012.
Bestiarium. QTI. Switzerland. 2012.
Afrika, letzte Hoffnung. Corso. Germany. 2011.
Recycle. Labor et Fides. Switzerland. 2011.
Recycle. Edizioni Casagrande. Switzerland. 2011.
GR Snaps II. Trout. Japan. 2010.
Swiss Press Photo 09. Benteli. Switzerland. 2009.
Swiss Press Photo 08. Benteli. Switzerland. 2008.
Swiss Press Photo 07. Benteli. Switzerland. 2007.
The eye of Switzerland. 15 years of Swiss Press Photo. Benteli. Switzerland. 2006.
Swiss Press Photo 06. Benteli. Switzerland. 2006.
Liberté. Freiheit. Libertà. Editions Reporters Sans Frontières, Switzerland. 2005.
Tausendundein Krieg. Begegnungen am Persichen Golf. Ulrich Ladurner, Didier Ruef. NP Buchverlag. Austria. 2004.
Afrique Noire. Infolio Editions. Switzerland. 2005.
Swiss Press Photo 03. Benteli. Switzerland. 2003.
Swiss Press Photo 02. Benteli. Switzerland. 2002.
Bauern am Berg. Offizin, Zürich. Ulrich Ladurner, Didier Ruef. 1998.
Paysans de nos montagnes. Editions Monographic. Ulrich Ladurner, Didier Ruef. 1998.
Vita di montagna''. Didier Ruef, Ulrich Ladurner. Edizioni Casagrande. Switzerland. 1998.
Notes
External links
Didier Ruef. Official website.
Didier Ruef Workshops.
Luz Photo.Milan
Cosmos Photo. Paris
Galerie Focale. Nyon
Category:Swiss photojournalists
Category:Living people
Category:1961 births
Category:20th-century Swiss photographers
Category:21st-century Swiss photographers
Category:People from Geneva |
Allium oreoprasum
Allium oreoprasum is a species of wild onion native to Central Asia. It has been found in Xinjiang, Tibet, Afghanistan, Kazakhstan, Kyrgyzstan, Pakistan, Tajikistan, Uzbekistan It grows at elevations of 1200–2700 m.
Allium oreoprasum produces clumps of narrow bulbs up to 10 mm in diameter. Scape is up to 40 cm tall. Umbel has only a few flowers. Tepals are white or pale red with a dark purple midvein.
References
oreoprasum
Category:Onions
Category:Flora of temperate Asia
Category:Plants described in 1842
Category:Flora of Pakistan |
To add Carlson, Stuart to your My Comics Page
Upgrade to a GoComics Pro account (only $19.99/yr) and have all of your
favorite comics emailed to you daily! You'll also get unlimited archive
access to decades of comics and an ad-free website and mobile app
experience.
More strip options:
I’ve copied this in elsewhere but, hey, do the RePubs repeat the same discredited 30 year old stories or what? Rebutting their rebuttal then:
The National gop is headed the way of the California gop. “Me and my friends first, followed by nobody else,” isn’t a viable party’s philosophy, at least not in a democracy. Gerrymandering, propagandizing, monopolizing, rigging the tax system (Romney paid 14% on HOW much?) and lying 24/7 about science just isn’t a long term strategy.
It’s a vicious cycle for the GOP. The Democrats do something (or try), GOP pundits get angry and speak as demagoges, normal GOP citizens get wound up and beat their war drums at their GOP Senators and Representatives. GOP congressmen “stick to their guns” about everything and we go nowhere. Perfect and pure representation of their constituents.
"Me and my friends first, followed by nobody else,” isn’t a viable party’s philosophy, at least not in a democracy.
It’s not just that. It’s the shrill criticism that “Obama is always wrong”. Followed with NO alternative options and NO strategic vision. Followed by MORE shrill criticism that “Obama is always wrong”. The ‘Sean Hannity school of politics’.
About Stuart Carlson
Editorial cartoonist Stuart Carlson has the unique ability to look at current events and bring them from that far away place where news is made and into the homes and daily lives of his readers. His material not only targets politicians and recognizable media figures, but it also covers topics that hold up a mirror to everyday Americans and sends them into action, wanting to take on the issues in their own lives. |
import { List } from '../types'
/**
* Converts any `Iterable`, `Iterator` or `ArrayLike` to an `Array`.
* @name arrayFrom<A>(iterable: Iterable<A> | Iterator<A> | List<A>): Array<A>
*/
export function arrayFrom<A>(iterable: Iterable<A> | Iterator<A> | List<A>): Array<A> {
if (isIterator(iterable)) return Array.from(toIterable(iterable))
return Array.from(iterable as Iterable<A> | List<A>)
}
function isIterator<A>(x: any): x is Iterator<A> {
return x && typeof (x as Iterator<A>).next === 'function'
}
function toIterable<A>(iterator: Iterator<A>): Iterable<A> {
return {
[Symbol.iterator]() {
return iterator
},
}
}
|
Save the Children Statement on Yemen
In response to Secretary Mattis and Secretary Pompeo’s comments on the need for a ceasefire in Yemen, Carolyn Miles, Save the Children President & CEO said:
“Save the Children welcomes Secretary of Defense Mattis and Secretary of State Pompeo’s calls for a cessation of hostilities from all parties to the war in Yemen, and a return to the peace table in the next 30 days. This brutal conflict continues to claim the lives of more than 100 children per day – not just from conflict but also from disease and extreme food insecurity, which have been exacerbated by the ongoing violence. We thus also urge the Administration to continue making every effort to help improve humanitarian access for aid organizations providing lifesaving services on the ground, particularly in light of the UN’s warning of an imminent threat of famine facing millions of people.
“For more than three years, Save the Children has insisted that only a political solution will help bring an end to the daily suffering of Yemeni children. In addition to an immediate cessation of hostilities, we strongly urge the warring parties to respect their obligations under international humanitarian law to immediately allow unconditional access for humanitarian aid and commercial imports through all of Yemen’s sea and air ports to prevent further needless loss of life.”
Save the Children gives children in the United States and around the world a healthy start, the opportunity to learn and protection from harm. We invest in childhood — every day, in times of crisis and for our future. Follow us on Facebook, Instagram and Twitter.
Welcome!
We’ll be in touch! By signing up to receive emails from Save the Children you will receive a subscription to our monthly eNews, access to breaking emergency alerts and opportunities to get involved. To ensure delivery of Save the Children emails to your inbox, add support@savechildren.org to your contact list.
An organization you can trust
In fiscal year 2017, 86% of all expenditures went to program services. Find out more.
† By providing my mobile phone number, I opt in to receive text messages and phone calls from Save the Children regarding its lifesaving work. Text STOP to opt out, HELP for help. Message & data rates may apply. |
Denver Union Station is a "Game Changer"
An opening in the SOM-designed canopy over the train platform has am opening that frames the historic Denver Union Station.
The neon sign on top of Denver’s historic Union Station says “Travel by Train,” a reminder of the bygone era when up to 80 trains a day would stop at the busy depot. In recent years, however, the building’s grand waiting room has sat empty except for the few Amtrak passengers waiting to catch the California Zephyr to Chicago or San Francisco.
Ventilation towers for the underground bus station are located next to the light-rail platform.
----- Advertising -----
Today, Union Station, in the city’s Lower Downtown neighborhood, is on the cusp of a major transformation. The Beaux Arts–style depot, built in 1914, is being restored and converted—by Denver firms Tryba Architects and JG Johnson Architects—into a 112-room boutique hotel with shops, offices, and restaurants, opening in July. Meanwhile, in the rail yard behind the station, Skidmore, Owings & Merrill (SOM) has created a multimodal transit hub for buses, light rail, commuter rail, and Amtrak service. The $500 million public-private project is a milestone for sprawling Denver, which has embraced transit in a big way. The metropolitan area’s first light-rail line opened in 1994, and 10 years later, voters approved a $6.5 billion transit program for an additional 122 miles of commuter and light rail. Starting in 2016, Union Station will be the hub for four new commuter lines, including one to Denver International Airport. That “Travel by Train” sign suddenly seems relevant again.
The project’s signature elements, designed by SOM’s Roger Duffy, are a curvy white-fabric canopy that hovers over the train platform and a surprisingly cheerful 980-foot-long underground bus terminal, which opens on May 11. The bus station doubles as a pedestrian concourse that connects an existing light-rail station on the western edge of the 19.5-acre site to the train platform and the terminal. A framework of steel tubes, painted glossy white, supports the 500-foot-long canopy. The structure flares dramatically at the ends and has a long scooped-out section in the middle—a response, Duffy says, to a requirement that views of the historic station remain unobstructed. “One is skeletal and light, the other is heavy and robust. I think they’re very complementary,” he says. The opening, which Duffy calls the “sky hole,” also meant that he didn’t have to add an expensive ventilation system. Given Denver’s 300-plus days of sunshine, complete protection from the elements was deemed unnecessary. The adjacent bus terminal, with 22 bays, replaces a smaller station several blocks away.
Bus stations are typically drab, but SOM’s design makes use of terrazzo floors, yellow tile, and skylights to create an underground space that feels more like an airport concourse than a subterranean transit facility. “It’s a really uplifting, positive experience. I think it brings a sense of nobility that you often don’t get,” says Kristopher Takacs, SOM’s Union Station project manager. Above the terminal is a two-block-long pedestrian plaza with a pavilion at each end—one near the light-rail station, the other near the train platform—connecting commuters to the bus station. (Hargreaves Associates is collaborating with SOM on the site’s landscape design.)
Even before it is completed, the transit hub has already triggered more than $1 billion in private mixed-use development on adjacent property, much of which was also part of the city’s old rail yard. “It’s not just an architectural project,” Takacs says. “It’s a city-building infill project. People want to be in the next great neighborhood, which is right next to a transportation hub.” Takacs estimates that there are 14 development projects in the area currently under construction or in the planning stage.
Urban planner Ken Schroeppel, who blogs about the city’s wave of redevelopment and teaches at the University of Colorado at Denver, adds: “Certainly Union Station is the juggernaut of development in downtown Denver at the moment. And that’s saying a lot, considering how much building is going on throughout the city’s urban core.” Like others, Schroeppel is quick to call Union Station a “game changer” for a city that has already become a model for urban revitalization. “This is going to change the way people in Denver feel about their city,” he says.
To write a comment about this story, please sign in. If this is your first time commenting on this site, you will be required to fill out a brief registration form. Your public username will be the beginning of the email address that you enter into the form (everything before the @ symbol). Other than that, none of the information that you enter will be publically displayed.
We welcome comments from all points of view. Off-topic or abusive comments, however, will be removed at the editors’ discretion. |
<!DOCTYPE html >
<html>
<head>
<title>BSONObject - Casbah Driver - com.mongodb.casbah.query.dsl.BSONType.BSONObject</title>
<meta name="description" content="BSONObject - Casbah Driver - com.mongodb.casbah.query.dsl.BSONType.BSONObject" />
<meta name="keywords" content="BSONObject Casbah Driver com.mongodb.casbah.query.dsl.BSONType.BSONObject" />
<meta http-equiv="content-type" content="text/html; charset=UTF-8" />
<link href="../../../../../lib/template.css" media="screen" type="text/css" rel="stylesheet" />
<link href="../../../../../lib/diagrams.css" media="screen" type="text/css" rel="stylesheet" id="diagrams-css" />
<script type="text/javascript" src="../../../../../lib/jquery.js" id="jquery-js"></script>
<script type="text/javascript" src="../../../../../lib/jquery-ui.js"></script>
<script type="text/javascript" src="../../../../../lib/template.js"></script>
<script type="text/javascript" src="../../../../../lib/tools.tooltip.js"></script>
<script type="text/javascript" src="../../../../../lib/modernizr.custom.js"></script><script type="text/javascript" src="../../../../../lib/diagrams.js" id="diagrams-js"></script>
<script type="text/javascript">
if(top === self) {
var url = '../../../../../index.html';
var hash = 'com.mongodb.casbah.query.dsl.BSONType$$BSONObject$';
var anchor = window.location.hash;
var anchor_opt = '';
if (anchor.length >= 1)
anchor_opt = '@' + anchor.substring(1);
window.location.href = url + '#' + hash + anchor_opt;
}
</script>
</head>
<body class="value">
<div id="definition">
<img alt="Object" src="../../../../../lib/object_big.png" />
<p id="owner"><a href="../../../../package.html" class="extype" name="com">com</a>.<a href="../../../package.html" class="extype" name="com.mongodb">mongodb</a>.<a href="../../package.html" class="extype" name="com.mongodb.casbah">casbah</a>.<a href="../package.html" class="extype" name="com.mongodb.casbah.query">query</a>.<a href="package.html" class="extype" name="com.mongodb.casbah.query.dsl">dsl</a>.<a href="BSONType$.html" class="extype" name="com.mongodb.casbah.query.dsl.BSONType">BSONType</a></p>
<h1>BSONObject</h1><h3><span class="morelinks"><div>Related Doc:
<a href="BSONType$.html" class="extype" name="com.mongodb.casbah.query.dsl.BSONType">package BSONType</a>
</div></span></h3><span class="permalink">
<a href="../../../../../index.html#com.mongodb.casbah.query.dsl.BSONType$$BSONObject$" title="Permalink" target="_top">
<img src="../../../../../lib/permalink.png" alt="Permalink" />
</a>
</span>
</div>
<h4 id="signature" class="signature">
<span class="modifier_kind">
<span class="modifier">implicit </span>
<span class="kind">object</span>
</span>
<span class="symbol">
<span class="name">BSONObject</span><span class="result"> extends <a href="BSONType.html" class="extype" name="com.mongodb.casbah.query.dsl.BSONType">BSONType</a>[<span class="extype" name="org.bson.BSONObject">BSONObject</span>]</span>
</span>
</h4>
<div id="comment" class="fullcommenttop"><div class="toggleContainer block">
<span class="toggle">Linear Supertypes</span>
<div class="superTypes hiddenContent"><a href="BSONType.html" class="extype" name="com.mongodb.casbah.query.dsl.BSONType">BSONType</a>[<span class="extype" name="org.bson.BSONObject">BSONObject</span>], <span class="extype" name="scala.AnyRef">AnyRef</span>, <span class="extype" name="scala.Any">Any</span></div>
</div></div>
<div id="mbrsel">
<div id="textfilter"><span class="pre"></span><span class="input"><input id="mbrsel-input" type="text" accesskey="/" /></span><span class="post"></span></div>
<div id="order">
<span class="filtertype">Ordering</span>
<ol>
<li class="alpha in"><span>Alphabetic</span></li>
<li class="inherit out"><span>By inheritance</span></li>
</ol>
</div>
<div id="ancestors">
<span class="filtertype">Inherited<br />
</span>
<ol id="linearization">
<li class="in" name="com.mongodb.casbah.query.dsl.BSONType.BSONObject"><span>BSONObject</span></li><li class="in" name="com.mongodb.casbah.query.dsl.BSONType"><span>BSONType</span></li><li class="in" name="scala.AnyRef"><span>AnyRef</span></li><li class="in" name="scala.Any"><span>Any</span></li>
</ol>
</div><div id="ancestors">
<span class="filtertype"></span>
<ol>
<li class="hideall out"><span>Hide All</span></li>
<li class="showall in"><span>Show all</span></li>
</ol>
</div>
<div id="visbl">
<span class="filtertype">Visibility</span>
<ol><li class="public in"><span>Public</span></li><li class="all out"><span>All</span></li></ol>
</div>
</div>
<div id="template">
<div id="allMembers">
<div id="values" class="values members">
<h3>Value Members</h3>
<ol><li name="scala.AnyRef#!=" visbl="pub" data-isabs="false" fullComment="yes" group="Ungrouped">
<a id="!=(x$1:Any):Boolean"></a>
<a id="!=(Any):Boolean"></a>
<h4 class="signature">
<span class="modifier_kind">
<span class="modifier">final </span>
<span class="kind">def</span>
</span>
<span class="symbol">
<span title="gt4s: $bang$eq" class="name">!=</span><span class="params">(<span name="arg0">arg0: <span class="extype" name="scala.Any">Any</span></span>)</span><span class="result">: <span class="extype" name="scala.Boolean">Boolean</span></span>
</span>
</h4><span class="permalink">
<a href="../../../../../index.html#com.mongodb.casbah.query.dsl.BSONType$$BSONObject$@!=(x$1:Any):Boolean" title="Permalink" target="_top">
<img src="../../../../../lib/permalink.png" alt="Permalink" />
</a>
</span>
<div class="fullcomment"><dl class="attributes block"> <dt>Definition Classes</dt><dd>AnyRef → Any</dd></dl></div>
</li><li name="scala.AnyRef###" visbl="pub" data-isabs="false" fullComment="yes" group="Ungrouped">
<a id="##():Int"></a>
<a id="##():Int"></a>
<h4 class="signature">
<span class="modifier_kind">
<span class="modifier">final </span>
<span class="kind">def</span>
</span>
<span class="symbol">
<span title="gt4s: $hash$hash" class="name">##</span><span class="params">()</span><span class="result">: <span class="extype" name="scala.Int">Int</span></span>
</span>
</h4><span class="permalink">
<a href="../../../../../index.html#com.mongodb.casbah.query.dsl.BSONType$$BSONObject$@##():Int" title="Permalink" target="_top">
<img src="../../../../../lib/permalink.png" alt="Permalink" />
</a>
</span>
<div class="fullcomment"><dl class="attributes block"> <dt>Definition Classes</dt><dd>AnyRef → Any</dd></dl></div>
</li><li name="scala.AnyRef#==" visbl="pub" data-isabs="false" fullComment="yes" group="Ungrouped">
<a id="==(x$1:Any):Boolean"></a>
<a id="==(Any):Boolean"></a>
<h4 class="signature">
<span class="modifier_kind">
<span class="modifier">final </span>
<span class="kind">def</span>
</span>
<span class="symbol">
<span title="gt4s: $eq$eq" class="name">==</span><span class="params">(<span name="arg0">arg0: <span class="extype" name="scala.Any">Any</span></span>)</span><span class="result">: <span class="extype" name="scala.Boolean">Boolean</span></span>
</span>
</h4><span class="permalink">
<a href="../../../../../index.html#com.mongodb.casbah.query.dsl.BSONType$$BSONObject$@==(x$1:Any):Boolean" title="Permalink" target="_top">
<img src="../../../../../lib/permalink.png" alt="Permalink" />
</a>
</span>
<div class="fullcomment"><dl class="attributes block"> <dt>Definition Classes</dt><dd>AnyRef → Any</dd></dl></div>
</li><li name="scala.Any#asInstanceOf" visbl="pub" data-isabs="false" fullComment="yes" group="Ungrouped">
<a id="asInstanceOf[T0]:T0"></a>
<a id="asInstanceOf[T0]:T0"></a>
<h4 class="signature">
<span class="modifier_kind">
<span class="modifier">final </span>
<span class="kind">def</span>
</span>
<span class="symbol">
<span class="name">asInstanceOf</span><span class="tparams">[<span name="T0">T0</span>]</span><span class="result">: <span class="extype" name="scala.Any.asInstanceOf.T0">T0</span></span>
</span>
</h4><span class="permalink">
<a href="../../../../../index.html#com.mongodb.casbah.query.dsl.BSONType$$BSONObject$@asInstanceOf[T0]:T0" title="Permalink" target="_top">
<img src="../../../../../lib/permalink.png" alt="Permalink" />
</a>
</span>
<div class="fullcomment"><dl class="attributes block"> <dt>Definition Classes</dt><dd>Any</dd></dl></div>
</li><li name="scala.AnyRef#clone" visbl="prt" data-isabs="false" fullComment="yes" group="Ungrouped">
<a id="clone():Object"></a>
<a id="clone():AnyRef"></a>
<h4 class="signature">
<span class="modifier_kind">
<span class="modifier"></span>
<span class="kind">def</span>
</span>
<span class="symbol">
<span class="name">clone</span><span class="params">()</span><span class="result">: <span class="extype" name="scala.AnyRef">AnyRef</span></span>
</span>
</h4><span class="permalink">
<a href="../../../../../index.html#com.mongodb.casbah.query.dsl.BSONType$$BSONObject$@clone():Object" title="Permalink" target="_top">
<img src="../../../../../lib/permalink.png" alt="Permalink" />
</a>
</span>
<div class="fullcomment"><dl class="attributes block"> <dt>Attributes</dt><dd>protected[<a href="../../../../../java$lang.html" class="extype" name="java.lang">java.lang</a>] </dd><dt>Definition Classes</dt><dd>AnyRef</dd><dt>Annotations</dt><dd>
<span class="name">@throws</span><span class="args">(<span>
<span class="defval" name="classOf[java.lang.CloneNotSupportedException]">...</span>
</span>)</span>
</dd></dl></div>
</li><li name="scala.AnyRef#eq" visbl="pub" data-isabs="false" fullComment="yes" group="Ungrouped">
<a id="eq(x$1:AnyRef):Boolean"></a>
<a id="eq(AnyRef):Boolean"></a>
<h4 class="signature">
<span class="modifier_kind">
<span class="modifier">final </span>
<span class="kind">def</span>
</span>
<span class="symbol">
<span class="name">eq</span><span class="params">(<span name="arg0">arg0: <span class="extype" name="scala.AnyRef">AnyRef</span></span>)</span><span class="result">: <span class="extype" name="scala.Boolean">Boolean</span></span>
</span>
</h4><span class="permalink">
<a href="../../../../../index.html#com.mongodb.casbah.query.dsl.BSONType$$BSONObject$@eq(x$1:AnyRef):Boolean" title="Permalink" target="_top">
<img src="../../../../../lib/permalink.png" alt="Permalink" />
</a>
</span>
<div class="fullcomment"><dl class="attributes block"> <dt>Definition Classes</dt><dd>AnyRef</dd></dl></div>
</li><li name="scala.AnyRef#equals" visbl="pub" data-isabs="false" fullComment="yes" group="Ungrouped">
<a id="equals(x$1:Any):Boolean"></a>
<a id="equals(Any):Boolean"></a>
<h4 class="signature">
<span class="modifier_kind">
<span class="modifier"></span>
<span class="kind">def</span>
</span>
<span class="symbol">
<span class="name">equals</span><span class="params">(<span name="arg0">arg0: <span class="extype" name="scala.Any">Any</span></span>)</span><span class="result">: <span class="extype" name="scala.Boolean">Boolean</span></span>
</span>
</h4><span class="permalink">
<a href="../../../../../index.html#com.mongodb.casbah.query.dsl.BSONType$$BSONObject$@equals(x$1:Any):Boolean" title="Permalink" target="_top">
<img src="../../../../../lib/permalink.png" alt="Permalink" />
</a>
</span>
<div class="fullcomment"><dl class="attributes block"> <dt>Definition Classes</dt><dd>AnyRef → Any</dd></dl></div>
</li><li name="scala.AnyRef#finalize" visbl="prt" data-isabs="false" fullComment="yes" group="Ungrouped">
<a id="finalize():Unit"></a>
<a id="finalize():Unit"></a>
<h4 class="signature">
<span class="modifier_kind">
<span class="modifier"></span>
<span class="kind">def</span>
</span>
<span class="symbol">
<span class="name">finalize</span><span class="params">()</span><span class="result">: <span class="extype" name="scala.Unit">Unit</span></span>
</span>
</h4><span class="permalink">
<a href="../../../../../index.html#com.mongodb.casbah.query.dsl.BSONType$$BSONObject$@finalize():Unit" title="Permalink" target="_top">
<img src="../../../../../lib/permalink.png" alt="Permalink" />
</a>
</span>
<div class="fullcomment"><dl class="attributes block"> <dt>Attributes</dt><dd>protected[<a href="../../../../../java$lang.html" class="extype" name="java.lang">java.lang</a>] </dd><dt>Definition Classes</dt><dd>AnyRef</dd><dt>Annotations</dt><dd>
<span class="name">@throws</span><span class="args">(<span>
<span class="symbol">classOf[java.lang.Throwable]</span>
</span>)</span>
</dd></dl></div>
</li><li name="scala.AnyRef#getClass" visbl="pub" data-isabs="false" fullComment="yes" group="Ungrouped">
<a id="getClass():Class[_]"></a>
<a id="getClass():Class[_]"></a>
<h4 class="signature">
<span class="modifier_kind">
<span class="modifier">final </span>
<span class="kind">def</span>
</span>
<span class="symbol">
<span class="name">getClass</span><span class="params">()</span><span class="result">: <span class="extype" name="java.lang.Class">Class</span>[_]</span>
</span>
</h4><span class="permalink">
<a href="../../../../../index.html#com.mongodb.casbah.query.dsl.BSONType$$BSONObject$@getClass():Class[_]" title="Permalink" target="_top">
<img src="../../../../../lib/permalink.png" alt="Permalink" />
</a>
</span>
<div class="fullcomment"><dl class="attributes block"> <dt>Definition Classes</dt><dd>AnyRef → Any</dd></dl></div>
</li><li name="scala.AnyRef#hashCode" visbl="pub" data-isabs="false" fullComment="yes" group="Ungrouped">
<a id="hashCode():Int"></a>
<a id="hashCode():Int"></a>
<h4 class="signature">
<span class="modifier_kind">
<span class="modifier"></span>
<span class="kind">def</span>
</span>
<span class="symbol">
<span class="name">hashCode</span><span class="params">()</span><span class="result">: <span class="extype" name="scala.Int">Int</span></span>
</span>
</h4><span class="permalink">
<a href="../../../../../index.html#com.mongodb.casbah.query.dsl.BSONType$$BSONObject$@hashCode():Int" title="Permalink" target="_top">
<img src="../../../../../lib/permalink.png" alt="Permalink" />
</a>
</span>
<div class="fullcomment"><dl class="attributes block"> <dt>Definition Classes</dt><dd>AnyRef → Any</dd></dl></div>
</li><li name="scala.Any#isInstanceOf" visbl="pub" data-isabs="false" fullComment="yes" group="Ungrouped">
<a id="isInstanceOf[T0]:Boolean"></a>
<a id="isInstanceOf[T0]:Boolean"></a>
<h4 class="signature">
<span class="modifier_kind">
<span class="modifier">final </span>
<span class="kind">def</span>
</span>
<span class="symbol">
<span class="name">isInstanceOf</span><span class="tparams">[<span name="T0">T0</span>]</span><span class="result">: <span class="extype" name="scala.Boolean">Boolean</span></span>
</span>
</h4><span class="permalink">
<a href="../../../../../index.html#com.mongodb.casbah.query.dsl.BSONType$$BSONObject$@isInstanceOf[T0]:Boolean" title="Permalink" target="_top">
<img src="../../../../../lib/permalink.png" alt="Permalink" />
</a>
</span>
<div class="fullcomment"><dl class="attributes block"> <dt>Definition Classes</dt><dd>Any</dd></dl></div>
</li><li name="scala.AnyRef#ne" visbl="pub" data-isabs="false" fullComment="yes" group="Ungrouped">
<a id="ne(x$1:AnyRef):Boolean"></a>
<a id="ne(AnyRef):Boolean"></a>
<h4 class="signature">
<span class="modifier_kind">
<span class="modifier">final </span>
<span class="kind">def</span>
</span>
<span class="symbol">
<span class="name">ne</span><span class="params">(<span name="arg0">arg0: <span class="extype" name="scala.AnyRef">AnyRef</span></span>)</span><span class="result">: <span class="extype" name="scala.Boolean">Boolean</span></span>
</span>
</h4><span class="permalink">
<a href="../../../../../index.html#com.mongodb.casbah.query.dsl.BSONType$$BSONObject$@ne(x$1:AnyRef):Boolean" title="Permalink" target="_top">
<img src="../../../../../lib/permalink.png" alt="Permalink" />
</a>
</span>
<div class="fullcomment"><dl class="attributes block"> <dt>Definition Classes</dt><dd>AnyRef</dd></dl></div>
</li><li name="scala.AnyRef#notify" visbl="pub" data-isabs="false" fullComment="yes" group="Ungrouped">
<a id="notify():Unit"></a>
<a id="notify():Unit"></a>
<h4 class="signature">
<span class="modifier_kind">
<span class="modifier">final </span>
<span class="kind">def</span>
</span>
<span class="symbol">
<span class="name">notify</span><span class="params">()</span><span class="result">: <span class="extype" name="scala.Unit">Unit</span></span>
</span>
</h4><span class="permalink">
<a href="../../../../../index.html#com.mongodb.casbah.query.dsl.BSONType$$BSONObject$@notify():Unit" title="Permalink" target="_top">
<img src="../../../../../lib/permalink.png" alt="Permalink" />
</a>
</span>
<div class="fullcomment"><dl class="attributes block"> <dt>Definition Classes</dt><dd>AnyRef</dd></dl></div>
</li><li name="scala.AnyRef#notifyAll" visbl="pub" data-isabs="false" fullComment="yes" group="Ungrouped">
<a id="notifyAll():Unit"></a>
<a id="notifyAll():Unit"></a>
<h4 class="signature">
<span class="modifier_kind">
<span class="modifier">final </span>
<span class="kind">def</span>
</span>
<span class="symbol">
<span class="name">notifyAll</span><span class="params">()</span><span class="result">: <span class="extype" name="scala.Unit">Unit</span></span>
</span>
</h4><span class="permalink">
<a href="../../../../../index.html#com.mongodb.casbah.query.dsl.BSONType$$BSONObject$@notifyAll():Unit" title="Permalink" target="_top">
<img src="../../../../../lib/permalink.png" alt="Permalink" />
</a>
</span>
<div class="fullcomment"><dl class="attributes block"> <dt>Definition Classes</dt><dd>AnyRef</dd></dl></div>
</li><li name="com.mongodb.casbah.query.dsl.BSONType#operator" visbl="pub" data-isabs="false" fullComment="yes" group="Ungrouped">
<a id="operator:Byte"></a>
<a id="operator:Byte"></a>
<h4 class="signature">
<span class="modifier_kind">
<span class="modifier"></span>
<span class="kind">val</span>
</span>
<span class="symbol">
<span class="name">operator</span><span class="result">: <span class="extype" name="scala.Byte">Byte</span></span>
</span>
</h4><span class="permalink">
<a href="../../../../../index.html#com.mongodb.casbah.query.dsl.BSONType$$BSONObject$@operator:Byte" title="Permalink" target="_top">
<img src="../../../../../lib/permalink.png" alt="Permalink" />
</a>
</span>
<div class="fullcomment"><dl class="attributes block"> <dt>Definition Classes</dt><dd><a href="BSONType.html" class="extype" name="com.mongodb.casbah.query.dsl.BSONType">BSONType</a></dd></dl></div>
</li><li name="scala.AnyRef#synchronized" visbl="pub" data-isabs="false" fullComment="yes" group="Ungrouped">
<a id="synchronized[T0](x$1:=>T0):T0"></a>
<a id="synchronized[T0](⇒T0):T0"></a>
<h4 class="signature">
<span class="modifier_kind">
<span class="modifier">final </span>
<span class="kind">def</span>
</span>
<span class="symbol">
<span class="name">synchronized</span><span class="tparams">[<span name="T0">T0</span>]</span><span class="params">(<span name="arg0">arg0: ⇒ <span class="extype" name="java.lang.AnyRef.synchronized.T0">T0</span></span>)</span><span class="result">: <span class="extype" name="java.lang.AnyRef.synchronized.T0">T0</span></span>
</span>
</h4><span class="permalink">
<a href="../../../../../index.html#com.mongodb.casbah.query.dsl.BSONType$$BSONObject$@synchronized[T0](x$1:=>T0):T0" title="Permalink" target="_top">
<img src="../../../../../lib/permalink.png" alt="Permalink" />
</a>
</span>
<div class="fullcomment"><dl class="attributes block"> <dt>Definition Classes</dt><dd>AnyRef</dd></dl></div>
</li><li name="scala.AnyRef#toString" visbl="pub" data-isabs="false" fullComment="yes" group="Ungrouped">
<a id="toString():String"></a>
<a id="toString():String"></a>
<h4 class="signature">
<span class="modifier_kind">
<span class="modifier"></span>
<span class="kind">def</span>
</span>
<span class="symbol">
<span class="name">toString</span><span class="params">()</span><span class="result">: <span class="extype" name="java.lang.String">String</span></span>
</span>
</h4><span class="permalink">
<a href="../../../../../index.html#com.mongodb.casbah.query.dsl.BSONType$$BSONObject$@toString():String" title="Permalink" target="_top">
<img src="../../../../../lib/permalink.png" alt="Permalink" />
</a>
</span>
<div class="fullcomment"><dl class="attributes block"> <dt>Definition Classes</dt><dd>AnyRef → Any</dd></dl></div>
</li><li name="scala.AnyRef#wait" visbl="pub" data-isabs="false" fullComment="yes" group="Ungrouped">
<a id="wait():Unit"></a>
<a id="wait():Unit"></a>
<h4 class="signature">
<span class="modifier_kind">
<span class="modifier">final </span>
<span class="kind">def</span>
</span>
<span class="symbol">
<span class="name">wait</span><span class="params">()</span><span class="result">: <span class="extype" name="scala.Unit">Unit</span></span>
</span>
</h4><span class="permalink">
<a href="../../../../../index.html#com.mongodb.casbah.query.dsl.BSONType$$BSONObject$@wait():Unit" title="Permalink" target="_top">
<img src="../../../../../lib/permalink.png" alt="Permalink" />
</a>
</span>
<div class="fullcomment"><dl class="attributes block"> <dt>Definition Classes</dt><dd>AnyRef</dd><dt>Annotations</dt><dd>
<span class="name">@throws</span><span class="args">(<span>
<span class="defval" name="classOf[java.lang.InterruptedException]">...</span>
</span>)</span>
</dd></dl></div>
</li><li name="scala.AnyRef#wait" visbl="pub" data-isabs="false" fullComment="yes" group="Ungrouped">
<a id="wait(x$1:Long,x$2:Int):Unit"></a>
<a id="wait(Long,Int):Unit"></a>
<h4 class="signature">
<span class="modifier_kind">
<span class="modifier">final </span>
<span class="kind">def</span>
</span>
<span class="symbol">
<span class="name">wait</span><span class="params">(<span name="arg0">arg0: <span class="extype" name="scala.Long">Long</span></span>, <span name="arg1">arg1: <span class="extype" name="scala.Int">Int</span></span>)</span><span class="result">: <span class="extype" name="scala.Unit">Unit</span></span>
</span>
</h4><span class="permalink">
<a href="../../../../../index.html#com.mongodb.casbah.query.dsl.BSONType$$BSONObject$@wait(x$1:Long,x$2:Int):Unit" title="Permalink" target="_top">
<img src="../../../../../lib/permalink.png" alt="Permalink" />
</a>
</span>
<div class="fullcomment"><dl class="attributes block"> <dt>Definition Classes</dt><dd>AnyRef</dd><dt>Annotations</dt><dd>
<span class="name">@throws</span><span class="args">(<span>
<span class="defval" name="classOf[java.lang.InterruptedException]">...</span>
</span>)</span>
</dd></dl></div>
</li><li name="scala.AnyRef#wait" visbl="pub" data-isabs="false" fullComment="yes" group="Ungrouped">
<a id="wait(x$1:Long):Unit"></a>
<a id="wait(Long):Unit"></a>
<h4 class="signature">
<span class="modifier_kind">
<span class="modifier">final </span>
<span class="kind">def</span>
</span>
<span class="symbol">
<span class="name">wait</span><span class="params">(<span name="arg0">arg0: <span class="extype" name="scala.Long">Long</span></span>)</span><span class="result">: <span class="extype" name="scala.Unit">Unit</span></span>
</span>
</h4><span class="permalink">
<a href="../../../../../index.html#com.mongodb.casbah.query.dsl.BSONType$$BSONObject$@wait(x$1:Long):Unit" title="Permalink" target="_top">
<img src="../../../../../lib/permalink.png" alt="Permalink" />
</a>
</span>
<div class="fullcomment"><dl class="attributes block"> <dt>Definition Classes</dt><dd>AnyRef</dd><dt>Annotations</dt><dd>
<span class="name">@throws</span><span class="args">(<span>
<span class="defval" name="classOf[java.lang.InterruptedException]">...</span>
</span>)</span>
</dd></dl></div>
</li></ol>
</div>
</div>
<div id="inheritedMembers">
<div class="parent" name="com.mongodb.casbah.query.dsl.BSONType">
<h3>Inherited from <a href="BSONType.html" class="extype" name="com.mongodb.casbah.query.dsl.BSONType">BSONType</a>[<span class="extype" name="org.bson.BSONObject">BSONObject</span>]</h3>
</div><div class="parent" name="scala.AnyRef">
<h3>Inherited from <span class="extype" name="scala.AnyRef">AnyRef</span></h3>
</div><div class="parent" name="scala.Any">
<h3>Inherited from <span class="extype" name="scala.Any">Any</span></h3>
</div>
</div>
<div id="groupedMembers">
<div class="group" name="Ungrouped">
<h3>Ungrouped</h3>
</div>
</div>
</div>
<div id="tooltip"></div>
<div id="footer"> </div>
</body>
</html>
|
Q:
Modificar as dimensões do ícone da largura
Boa tarde, em um site que estou desenvolvendo preciso colocar como o estilo do ícone da lista desordenada como uma imagem, mas pelo fato dela ser grande demais eu gostaria apenas de diminuir sua largura. Tentei aqui mas não consegui, segue em anexo o código.
Html:
<div class="instrucoes">
<div class="passo1">
<span>1.</span> <br>
<span>Deve atender aos requisitos básicos</span>
<ul>
<li>
<span>Possuir CNPJ</span>
</li>
<li>
<span>Se enquadrar em um dos programas apoiados pelo banco</span>
</li>
<li>
<span>Pertencer a um dos municípios atendidos</span>
</li>
</ul>
</div>
</div>
Css:
.passo1 ul{
margin-top: 10px;
margin-left: -10px;
list-style-image: url(../images/check-gray.png);
color: var(--fontGray);
font-size: 14px;
}
.passo1 ul li::before {
position: relative !important;
display: flex !important;
width: 20px !important;
}
.passo1 ul li, .passo2 ul li, .passo3 ul li{margin: 25px 0;}
.passo1 span{
color: var(--fontGray) !important;
font-size: 14px !important;
vertical-align: top;
display: inline-block;
}
A:
Infelizmente não é possível controlar o tamanho da imagem usado no list-style-image
Minha sugestão é que já que vc colocou um ::before na sua li que vc coloque a imagem nesse mesmo pseudo-elemento.
Veja esse exemplo, não mudei nada no seu HTML, e no CSS apenas usei o ::before que já tinha lá para colocar a imagem e alinhar das li.
.passo1 ul {
margin-top: 10px;
margin-left: -10px;
list-style:none;
color: var(--fontGray);
font-size: 14px;
}
.passo1 ul li::before {
content: '';
background-image: url(https://placecage.com/60/60);
background-color: red;
width: 20px;
height: 20px;
display:inline-block;
position: relative;
top: -5px;
}
.passo1 ul li,
.passo2 ul li,
.passo3 ul li {
margin: 25px 0;
}
.passo1 span{
color: var(--fontGray) !important;
font-size: 14px !important;
vertical-align: top;
display: inline-block;
}
<div class="instrucoes">
<div class="passo1">
<span>1.</span> <br>
<span>Deve atender aos requisitos básicos</span>
<ul>
<li>
<span>Possuir CNPJ</span>
</li>
<li>
<span>Se enquadrar em um dos programas apoiados pelo banco</span>
</li>
<li>
<span>Pertencer a um dos municípios atendidos</span>
</li>
</ul>
</div>
</div>
Opção 2
Colocar um background na li e controlar o tamanho e a posição com background-size e background-position.
Deixei os comentários no código
Exiba e executa o código abaixo para ver
.passo1 ul {
margin-top: 10px;
margin-left: -10px;
/* list-style-image: url(https://placecage.com/60/60); */
color: var(--fontGray);
font-size: 14px;
}
.passo1 ul li,
.passo2 ul li,
.passo3 ul li {
margin: 25px 0;
padding-left: 2rem;
list-style: none;
background-image: url(https://placecage.com/60/60);
background-repeat: no-repeat;
/* posição da imagem */
background-position: left center;
/* tamanho da imagem */
background-size: 20px;
}
.passo1 span{
color: var(--fontGray) !important;
font-size: 14px !important;
vertical-align: top;
display: inline-block;
}
<div class="instrucoes">
<div class="passo1">
<span>1.</span> <br>
<span>Deve atender aos requisitos básicos</span>
<ul>
<li>
<span>Possuir CNPJ</span>
</li>
<li>
<span>Se enquadrar em um dos programas apoiados pelo banco</span>
</li>
<li>
<span>Pertencer a um dos municípios atendidos</span>
</li>
</ul>
</div>
</div>
|
Q:
scalajs removeEventListener not working if using a scala function
This code does not work as expected (the keydown function still is executed when pressing a key):
import org.scalajs.dom.raw.Event
import org.scalajs.dom.{console, document}
import scala.scalajs.js
def keydown(e: Event) { console.log(e) }
document.addEventListener("keydown", keydown)
document.removeEventListener("keydown", keydown)
This modified code does indeed work as expected:
def keydown_(e: Event) { console.log(e) }
val keydown: js.Function1[Event, Unit] = (e: Event) => keydown_ _
document.addEventListener("keydown", keydown)
document.removeEventListener("keydown", keydown)
Why is so?
And is it possible to remove this extra boilerplate line of code?
A:
Scala Functions and JS Functions are different types, you need to convert from one to another. This is done for you implicitly, but this conversion creates a new instance of JS Function every time the conversion is called.
So calling the conversion multiple times, even if implicitly, you will get a different instance of JS Function every time. Even though those instances wrap the same Scala function, the browser doesn't know that. In order to removeEventListener, you need to provide it with the exact same JS Function reference that you passed to addEventListener, which is why your val example works but def doesn't.
|
Q:
Count number of bits to be flipped to convert A to B
Suppose, I have two numbers A and B. I need to find out how many numbers of bits needed to be changed to convert A to B.
Like:
A = 1101101
B = 1011011
^^ ^^
Here, we need to change 4 bits to convert A to B
How can I do this?
A:
You can simply do this :
int need=__builtin_popcountll(A^B);
cout<<need;
|
Q:
What corresponds to a Zoom value of false in Aspose Cells?
I'm refactoring some Excel Interop code to utilize Aspose Cells. One of the legacy lines of code related to printing a sheet is:
xlSheet.PageSetup.Zoom = false;
Aspose Cells does have a [Sheet].PageSetup.Zoom property, but it is an int, not a bool.
What corresponds to false - 100?
UPDATE
In response to the answer, the legacy (Excel Interop) code is:
xlSheet.PageSetup.FitToPagesWide = 1;
xlSheet.PageSetup.FitToPagesTall = 10;
xlSheet.PageSetup.Zoom = false;
So, the original developer was setting the zoom vals and then saying disregard them? Or am I to understand that setting zoom to false does coincide with setting those values, and as long as I set the FitToPages* properties in Aspose, setting PageSetup.Zoom to false is moot/redundant?
A:
Please note, in Excel Interop the PageSetup.Zoom = false means no zoom has to be applied to the worksheet, and the FitToPagesWide and FitToPagesTall properties control how the worksheet is scaled. If you wish to achieve the same with Aspose.Cells APIs, please set the PageSetup.FitToPagesTall & FitToPagesWide according to the application requirements. Aspose.Cells will automatically ignore any preferences set for Worksheet's zoom.
Note: I am working as Developer Evangelist at Aspose.
|
{ "translations": {
"Uploading..." : "يۈكلەۋاتىدۇ…",
"Cancel" : "ۋاز كەچ",
"Share" : "ھەمبەھىر",
"Pending" : "كۈتۈۋاتىدۇ",
"Shared by" : "ھەمبەھىرلىگۈچى",
"Sharing" : "ھەمبەھىر",
"Password" : "ئىم",
"Name" : "ئاتى",
"Download" : "چۈشۈر"
},"pluralForm" :"nplurals=2; plural=(n != 1);"
} |
Secretary
Treasurer
Ahlulbayt Islamic Society
The SOAS Ahlulbayt Islamic Society (ABSoc) is a student led organisation that aims to unite people regardless of their social or ethnic backgrounds.
Using Islam and its philosophy, we share the belief that “A person is either your brother in faith, or your equal in humanity” - Imam Ali (Peace Be Upon Him) and use it to help encourage peace and justice
We aim to create dialogue, discussion and a free exchange of ideas while utilising the University platform by organising a wide range of events including talks by expert speakers, informal discussion circles, social gatherings and sporting events as well as holding workshops and fundraisers for various causes. |
Q:
Steepest descent to find the solution to a linear system with a Hilbert matrix
I am using the method of steepest descent to figure out the solution to a linear system with a 5x5 Hilbert matrix. I believe the code is fine in the regard that it gives me the right answer.
My problem is that:
I think it is taking too many iterations to get to the right answer. I believe I may have missed something in the algorithm but I'm not sure what at this point.
I am not sure if this is the most effective way to implement the algorithm and additionally, it is a little confusing on which "tol" to pick.
Any insight on these would be appreciated (especially 1.). Thanks!
% Method of Steepest Descent with tol 10^-6
h = hilb(5); %Hilbert 5x5 matrix
b = [1;1;1;1;1]; %solution matrix
solution = zeros(d,1); %Initialization
residual = h*solution - b;
tol = 10^(-6)
count = 0;
while residual'*residual > tol;
roe = (residual'*residual)/(residual'*h*residual);
solution = solution - roe*residual;
residual = h*solution - b;
count = count + 1;
end
count
solution
%Method of Steepest Descent with tol 10^-12
solution = zeros(d,1);
residual = h*solution - b;
tol = 10^(-12)
count = 0;
while residual'*residual > tol;
roe = (residual'*residual)/(residual'*h*residual);
solution = solution - roe*residual;
residual = residual - roe*h*residual;
count = count + 1;
end
count
solution
%another_solution = invhilb(5)*b %Check for solution
A:
I do not have the knowledge to deal with your problem from a mathematical aspect, but from a programming point of view there is a point I could note.
Indeed you are right. It is taking too many iterations until it gets to the result:
Elapsed time is 6.487824 seconds.
count =
292945
When you define a step size to approach a final result, the step length has to be optimized. Otherwise you are either too slow in getting close to the answer or you are passing by the optimal answer several times and making a zigzag around it because your step length is too large.
To optimize the step size, I first form a function according to your script (plus some small modifications):
function [solution, count, T] = SDhilb(d, step)
h = hilb(d);
tic
b = ones(d, 1);
solution = zeros(d, 1);
residual = h * solution - b;
res2 = residual' * residual;
tol = 10^(-6);
count = 0;
while res2 > tol;
roe = res2/(residual' * h * residual);
solution = solution - step * roe * residual; % here the step size appears
residual = h * solution - b;
count = count + 1;
res2 = residual' * residual; % let's calculate this once per iteration
end
T = toc;
Now using this function for a range of step sizes (0.1:0.1:1.3) and couple of Hilbert matrices (d = 2, 3, 4, 5) it is obvious that 1 is not an efficient step size:
Instead, step = 0.9 seems to be much more efficient. let's see how efficient it is in case of hilb(5):
[result, count, T] = SDhilb(5, 0.9)
result =
3.1894
-85.7689
481.4906
-894.8742
519.5830
count =
1633
T =
0.0204
Which is more than two orders of magnitude faster.
In a similar way you can try different values of tol to see how dramatical it can influence the speed. In that case there is no optimal value: The smaller the tolerance, the more time you need to wait.
|
Challenges in biocooperative rehabilitation robotics.
Psychological states such as mood, motivation and engagement are known to be critical for the success of rehabilitation, and encouraging unmotivated stroke patients improves the likelihood of their eventual recovery. Psychological factors can be incorporated into the closed-loop control of biocooperative rehabilitation systems, augmenting the device with critical information about the patient state. However, in rehabilitation robotics, interpretation of psychophysiological measurements is made complex by the multi-task environment, the presence of strenuous physical activity and patient's damage to the central and autonomic nervous systems. The study examines these challenges and proposes possible solutions for implementation in biocooperative control of rehabilitation robots. |
Tick control on eland (Taurotragus oryx) and buffalo (Syncerus caffer) with flumethrin 1% pour-on through a Duncan applicator.
Eland (Taurotragus oryx) and buffalo (Syncerus caffer) in the Game Ranching Research Station at the Mushandike Sanctuary in Zimbabwe were treated with 1% flumethrin pour-on to control unacceptably high tick numbers. The pour-on was at first applied with a drenching gun and later by means of a Duncan Applicator. This device allows contact with a saturated treatment column while the animals consume a specially formulated attractant lick from the feed bin. Tick counts done over 3 summer seasons demonstrated the efficacy both of the pour-on acaricide and the method of application. |
Q:
MS Access Percentages of Column Values
I have a simple Access table called Test, with two columns - Field1 and Field2. The data in the table looks like this.
Field1 Field2
1 2
2 2
2 2
2 1
2 1
I'm trying to return the percentage of times each data type exists in each column. (ie - In Field1, the number 1 exists 20% and the number 2 exists 80%)
I found this query and it works great returning one column at a time.
Select Field1, (Count(Field1)* 100 / (select Count(*) From Test)) as fieldA
FROM Test
Group By Field1;
How would I select both columns? I tried this but it doesn't work.
Select
Field1, (Count(Field1)* 100 / (select Count(*) From Test)) as fieldA,
Field2, (Count(Field2)* 100 / (select Count(*) From Test)) as fieldB
FROM Test
Group By Field1;
Sorry for posting such a simple question. I just started using Access a few days ago.
Thanks,
Anne
A:
One way (of many) to do this is to do two separate queries (one for each field) and wrap them in an outer query like this:
select * from (
SELECT Field1, (Count(Field1)* 100 / (select Count(*) From Test)) as fieldA
FROM Test
GROUP BY Field1
) a
inner join (
SELECT Field2, (Count(Field2)* 100 / (select Count(*) From Test)) as fieldB
FROM Test
GROUP BY Field2
) b on a.Field1 = b.Field2
This would give the following result:
Field1 fieldA Field2 fieldB
1 20 1 40
2 80 2 60
This assumes the same numbers exists in both columns; if it can be that a number only exists in one of the columns you might want to change the inner join to a left join instead.
Edit: As a follow-up to the modifications asked for in the comments to the question (adding more fields) it's worth mentioning that due to the join semantics in Access-SQL it might be easier to take another approach, and save a query for each of the aggregate statement SELECT Field1, (Count(Field1)* 100 / (select Count(*) From Test)) AS fieldA FROM Test GROUP BY Field1; and then use the visual query design tool to build a query that uses the previously saved queries as source.
|
# Contributing to eXist
We welcome all contributions to eXist!
We strongly suggest that you join the [eXist-development mailing](https://lists.sourceforge.net/lists/listinfo/exist-development "eXist Development Mailing List") list and also subscribe to the [eXist-commits mailing list](https://lists.sourceforge.net/lists/listinfo/exist-commits "eXist SCM Commits Mailing List"), so that you can collaborate with the eXist team and be kept up to date with changes to the codebase.
## General Issues
eXist uses the [GitFlow](http://nvie.com/git-model) branching model for development. Specifically, we're using the [AVH Edition of GitFlow tools](https://github.com/petervanderdoes/gitflow) version.
If you're not familiar with GitFlow, check out some of the good tutorials linked in ["Getting Started"](https://github.com/petervanderdoes/gitflow#getting-started) of the GitFlow AVH Edition page. There's also a very good [git-flow cheatsheet](http://danielkummer.github.io/git-flow-cheatsheet/).
If you wish to contribute, the general approach is:
- Fork the repo on GitHub
- `git clone` your fork
- Make sure you've [GitFlow AVH Edition](https://github.com/petervanderdoes/gitflow) installed
- Run `git flow init` on the cloned repo using [these settings](#our-git-flow-init-settings).
- Use Git Flow to *start* a hotfix or feature i.e. `git flow feature start my-feature`.
- Do your stuff! :-)
- Commit to your repo. We like small, atomic commits that don't mix concerns.
- **Do NOT** finish the `hotfix` or `feature` with GitFlow.
- Make sure your branch is based on the latest eXist develop branch before making a pull-request. This will ensure that we can easily merge in your changes. See [Syncing a Fork](#syncing-a-fork).
- Push your hotfix or feature branch to your GitHub using GitFlow: `git flow feature publish my-feature`.
- Send us a Pull Request on GitHub from your branch to our develop branch.
- Once the Pull Request is merged you can delete your branch, you need not finish or merge it, you will however want to sync your develop branch to bring back your changes. See [Syncing a Fork](#syncing-a-fork).
Pull Requests are reviewed and tested before they're merged by the core development team.
However, we have one golden rule, even within the core team: **never merge your own pull request**. This simple-but-important rule ensures that at least two people have considered the change.
Although the following are taken from our [Developer Manifesto](http://www.exist-db.org/exist/apps/doc/devguide_manifesto.xml "eXist Project Developer Manifesto") and [Code Review Guide](http://www.exist-db.org/exist/apps/doc/devguide_codereview.xml "eXist Project Code Review Guide"), the main things that get a Pull Request accepted are:
- **Only change what you need to.** If you must reformat code, keep it in a separate commit to any syntax or functionality changes.
- **Test.** If you fix something prove it, write a test that illustrates the issue before you fix the issue and validate the test. If you add a new feature it needs tests, so that we can understand its intent and try to avoid regressions in future as much as possible.
- **Make sure the appropriate licence header appears at the top of your source code file.** We use [LGPL v2.1](http://opensource.org/licenses/LGPL-2.1 "The GNU Lesser General Public License, version 2.1") for eXist and *strongly* encourage that, but ultimately any compatible [OSI approved license](http://opensource.org/licenses "Open Source Licenses") without further restrictions may be used.
- **Run the full eXist test suite.** We don't accept code that causes regressions.
## Security Issues
***If you find a security vulnerability, do NOT open an issue.***
Any security issues should be submitted directly to <security@exist-db.org>. In order to determine whether you are dealing with a security issue, ask yourself these two questions:
* Can I access something that's not mine, or something I shouldn't have access to?
* Can I disable something for other people?
If the answer to either of those two questions are "yes", then you're probably dealing with a security issue. Note that even if you answer "no" to both questions, you may still be dealing with a security issue, so if you're unsure, just email us at <security@exist-db.org>.
## Versions and Releases
eXist follows a Semantic Versioning scheme, this is further documented in the [eXist Versioning Scheme and Release Process](exist-versioning-release.md) document.
### Porting during Release Candidate development phase
When developing both a stable release and a release-candidate in parallel, this requires commits to be both back- and forward-ported until the release-candidate has become the next stable release.
Under these circumstance pull-request should happen in threes. In normal times, contributors would:
- open a `my-feature-branch` of `develop`
- commit their changes
- open a Pull Request from `my-feature-branch` into `develop`
This is still the default mode, however, when a release candidate is under development, the following two additional steps are necessary:
#### Backport
Assuming the stable is `4.x` and RC is `5.x`
- create a second branch `my-feature-branch-4.x.x` based off `develop-4.x.x`
- [`cherry-pick`](https://git-scm.com/docs/git-cherry-pick) your commits from `my-feature-branch` into `my-feature-branch-4.x.x`
- open a second PR from `my-feature-branch-4.x.x` into `develop-4.x.x` mentioning the original PR in the commit message
### Forward-port
Works just as backport but with `my-feature-branch-5.x.x` and `develop-5.x.x`
During this phase of development the default mode for PRs is to happen in threes one for each develop branch.
## Do I work on a bug-fix using a `feature` or a `hotfix`?
If you want to contribute a *bug-fix*, you need to consider whether this is a `feature` or a `hotfix` in GitFlow terminology.
Making the determination involves considering how the bug-fix is to be applied and how it is to be applied. First, you should carefully read the "Feature branches" and "Hotfix branches" sections from [A successful Git branching model](http://nvie.com/posts/a-successful-git-branching-model/).
If you're still unsure, consider:
- The bug-fix is a hotfix if it is **critical** and needs to go into a very soon to be released revision version i.e. 2.1.n to address an immediate production issue.
- Otherwise it is a feature, i.e. its just standard development towards the next release of eXist.
Even for a bug-fix you should most probably use a `feature`. If you're certain you want to create a `hotfix`, please consider discussing first via the `exist-development` mailing list.
## Help! I am a human, what does this all mean?
- You work in features using GitFlow in your own fork of our repo.
- If you want to push your feature to your fork before you have finished it locally, i.e. for the purposes of backup or collaboration, you can use `git flow feature publish my-feature`.
- You will only ever send Pull Requests between your 'develop' branch and our 'develop' branch. i.e. finished features.
- If you follow the details above and make it easy for us to accept your Pull Requests, they will get accepted and merged quickly!
## Syncing a Fork
Your fork will eventually become out of sync with the upstream repo as others contribute to eXist. To pull upstream changes into your fork, you have two options:
1. [Merging](https://help.github.com/articles/syncing-a-fork).
2. Rebasing.
Rebasing leads to a cleaner revision history which is much easier to follow and is our preferred approach. However, `git rebase` is a very sharp tool and must be used with care. For those new to rebase, we would suggest having a backup of your local (and possibly remote) git repos before continuing. Read on to learn how to sync using rebase.
#### Rebase Example
Lets say that you have a fork of eXist's GitHub repo, and you have been working in your feature branch called `my-feature` for sometime, you are happy with how your work is progressing, but you want to sync so that your changes are based on the latest and greatest changes from eXist. The way to do this using `git rebase` is as follows:
1. If you have any un-committed changes you need to stash them using: `git stash save "changes before rebase"`.
2. If you have not added eXist's GitHub as an upstream remote, you need to do so by running `git remote add upstream https://github.com/exist-db/exist.git`. You can view your existing remotes, by running `git remote -v`.
3. You need to fetch the latest changes from eXist's GitHub: `git fetch upstream`. This will not yet change your local branches in any way.
4. You should first sync your `develop` branch with eXist's `develop` branch. As you always work in feature branches, this should a simple fast-forward by running: `git checkout develop` and then `git rebase upstream/develop`.
1. If all goes well in (4) then you can push your `develop` branch to your remote server (e.g. GitHub) with `git push origin develop`.
5. You can then replay your work in your feature branch `my-feature` atop the lastest changes from the develop branch by running: `git checkout feature/my-feature` and then `git rebase develop`.
1. Should you encounter any conflicts during (5) you can resolve them using `git mergetool` and then `git rebase --continue`.
2. If all goes well in (5), and take care to check your history is correct with `git log`, then you can force push your `feature/my-feature` branch to your remote server (e.g. GitHub) with `git push -f origin feature/my-feature`. *NOTE* the reason you need to use the `-f` to force the push is because the commit ids of your revisions will have changed after the rebase.
Note that it is worth syncing your branches that you are working on relatively frequently to prevent any large rebases which could lead to resolving many conflicting changes where your branch has diverged over a long period of time.
## Our `git-flow init` settings
When we started working with the eXist repo we needed to configure it for GitFlow:
```bash
$ git flow init
Which branch should be used for bringing forth production releases?
- master
Branch name for production releases: [master]
Branch name for "next release" development: [develop]
How to name your supporting branch prefixes?
Feature branches? [feature/]
Release branches? [release/]
Hotfix branches? [hotfix/]
Support branches? [support/]
Version tag prefix? [] eXist-
Hooks and filters directory? [.git/hooks]
```
A new `develop` branch is created, and checked out.
Verify it like this:
```bash
$ git status
# On branch develop
```
As we have already started with GitFlow, when you run `git flow init`, you'll get slightly different prompts--but the same answers apply!
You **must** use the following settings:
```bash
$ git flow init
Which branch should be used for bringing forth production releases?
- develop
Branch name for production releases: [] master
Which branch should be used for integration of the "next release"?
- develop
Branch name for "next release" development: [develop]
How to name your supporting branch prefixes?
Feature branches? [feature/]
Release branches? [release/]
Hotfix branches? [hotfix/]
Support branches? [support/]
Version tag prefix? [] eXist-
Hooks and filters directory? [.git/hooks]
```
|
---
abstract: 'Stochastic bridges are commonly used to impute missing data with a lower sampling rate to generate data with a higher sampling rate, while preserving key properties of the dynamics involved in an unbiased way. While the generation of Brownian bridges and Ornstein-Uhlenbeck bridges is well understood, unbiased generation of such stochastic bridges subject to a given extremum has been less explored in the literature. After a review of known results, we compare two algorithms for generating Brown-ian bridges constrained to a given extremum, one of which generalizes to other diffusions. We further apply this to generate unbiased Ornstein-Uhlenbeck bridges and unconstrained processes, both constrained to a given extremum, along with more tractable numerical approximations of these algorithms. Finally, we consider the case of drift and applications to geometric Brownian motions.'
author:
- 'Andrew Schaug[^1] and Harish Chandra[^2]'
date: 'November, 2019'
title: On Unbiased Simulations of Stochastic Bridges Conditioned on Extrema
---
Background
==========
Stochastic bridges find applications in a wide range of domains from finance to climatology. It is often necessary to interpolate insufficiently frequent time series data stochastically while preserving as much as possible of the dynamics underlying the original data. A natural question then is how to construct a stochastic bridge, i.e., a stochastic process whose end points are known a priori. These have been used for studying spectral statistics of polarization mode dispersion [@S2], modeling fermions trapped in a trap [@DMS], modeling animal movement patterns [@BSAW], valuing financial securities [@CMO] and improving the performance of quasi-Monte Carlo methods for high dimensional problems in computational finance [@LW] [@K]. Sometimes, there is a further need to generate a bridge subject to additional constraints, such as a given mean (see [@M]), or on an extremum. For example, a scenario generator may wish to consider worst-case scenarios where an asset attains a given lowest value to test how a financial instrument would behave under certain unfavorable market conditions, or we may wish to interpolate simulated thermodynamic scenarios where the temperature reaches a certain maximum.
This paper will provide tools for industry to go beyond simple Brownian bridges to allow for some features of more realistic dynamics including drift, geometric Brownian motion and mean reversion, for use in stress tests that condition on extreme values of an asset. For example, the generation of geometric Brownian bridges subject to extrema may be used for the valuation of barrier options whose barrier event has not yet been breached. The algorithms presented in this paper could also be used by banks for data quality remediation problems in VaR models where input time series data is sparse.
We first show how to generate Wiener processes subject to bridge and/or extremum conditions in an unbiased (i.e., measure-preserving) way, and then provide and compare two methods for generating such processes subject to both bridge and extremum conditions. Our first method is much more rapid, while the second generalizes more broadly. We will then consider mean-reverting dynamics by extending this problem to Ornstein-Uhlenbeck processes. Finally, we consider Wiener processes with drift, and geometric Brownian motions, which underlie the Black-Scholes pricing model.
We now introduce some preliminaries. First, we slightly abuse terminology by allowing a Wiener process to start at an arbitrary initial value $a$. A *Brownian bridge* is a Wiener process $X_t$ over $[0, T]$ conditioned on $X_0 = a, X_T = b$. An Ornstein-Uhlenbeck (OU) process is a simple mean-reverting stochastic process $X^{OU}_t$given by the SDE $$\label{ou_sde}dX^{OU}_t = \kappa(\mu - X_t)dt + \sigma dW_t,$$ for some standard Wiener process $W_t$. Then $\mu$ is the mean and $\kappa$ is the *mean reversion rate*. An *Ornstein-Uhlenbeck bridge* is an OU process over a closed interval conditioned on the values at the endpoints.
In section (2) we provide two unbiased constructions of Wiener bridges conditioned on extrema. In section (3) we generalize the second of the methods in section (2) to construct OU bridges conditioned on an extremum, and discuss the numerical and computational concerns and reasonable approximations involved. In section (4) we consider how to construct an *open-ended* (i.e., non-bridge) Ornstein-Uhlenbeck process constrained on an extremum. In section (5) we consider the case of Wiener processes with drift, or equivalently geometric Brownian motions.
First, we discuss those problems already addressed in the literature (1-5), and then those which we address in this paper (6-9).
1. For the sake of completeness, a Wiener process without bridge or extremum conditions has a trivial construction. Computationally, the Euler-Maruyama method may be used, successively incrementing by $\sigma \sqrt{\Delta t}\xi$, where $\xi \sim \mathcal{N}(0, 1)$.
2. An OU process without bridge or extremum conditions may be constructed from a Wiener process $W_t$ directly via equation \[ou\_sde\]. Computationally, the Euler-Maruyama method may be used.
3. A Brownian bridge may be constructed as follows: Given a Wiener process $W_t$ with variance $\sigma^2$ and such that $W_0 = 0$, we set $$X_t = a + \frac{b-a}{T}t + W_t - \frac{W_T}{T} t.$$ Then $X_t$ is a Brownian bridge on $[0, T]$ from $a$ to $b$, also with variance $\sigma^2$. Furthermore, the induced mapping $W_t \mapsto X_t$ has the correct measure, that is, the construction of $X_t$ is unbiased provided the simulation of $W_t$ is unbiased. Equivalently, the SDE for such a Brownian bridge is given by $$X_t = \frac{b-a-X_t}{T}dt + dW_t,\label{sde_bb}$$ with initial condition $X_0 = a$.
4. An OU bridge may be constructed as follows: Given a Brownian bridge $W_t$ with variance $\sigma^2$ over $[0, T]$ such that $W_0 = 0, W_T = b-a$, set $X_0 = a-\mu$ and simulate the SDE $$\label{ou_bridge_sde} dX_t = - \kappa X_t dt + \frac{2\kappa(be^{\kappa(t+T)}-X_te^{2\kappa t})}{e^{2\kappa T}-e^{2\kappa t}}dt + dW_t.$$ Then $\mu + X_t$ is an OU bridge with variance $\sigma^2$ between $a$ and $b$. See [@C] for details.
5. An open-ended (i.e. non-bridge) Wiener process conditioned on an extremum may be constructed as follows. To simulate a Wiener process $X_t$ over an interval $[t_0,T]$ starting at $X_{t_0}=a$ and conditioned on a maximum $M$, we follow the solution for the equivalent dual case (i.e., for the minimum) in [@BPR], following results in [@BCP]. First, assume without loss of generality that $a=0$. Construct a Brownian bridge $W_{br}^M (t)$ from $0$ to $M$ over the same interval $[t_0,T]$. Then, find $t_M$, the *first* time this bridge hits $M$. Take the first portion of this process up to $t_M$, and append potentially repeated reflections as follows: $$W_{0, max-refl}^M(t) = \left\{
\begin{array}{ll}
W_{br}^M(t) & \mbox{if } 0 \le t \le t_{\mathrm{max}} \\
2(\mathrm{min}_{t \le s \le t_M} W_{br}^M(s)) - W_{br}^M(t) & \mbox{if } t_{\mathrm{max}} \le t \le T
\end{array}
\right.$$
This selects $W_{0,max-refl}^M$ as an unbiased Brownian motion starting at 0 with maximum $M$ on the same interval (and no condition at $T$). To construct this for an arbitrary initial point $a$, simply construct $$W_{a, max-refl}^M(t) = a + W_{0, max-refl}^{M-a}(t).$$
6. We discuss an algorithm that constructs an open-ended OU process conditioned on an extremum in section (4).
7. We demonstrate how to construct a Brownian bridge conditioned on an extremum in section (2), in two different ways, and compare the results.
8. We discuss an algorithm that constructs an OU bridge conditioned on an extremum in section (3).
9. We discuss an algorithm that constructs an open-ended Brownian process with positive drift (or equivalently a growing geometric Brownian motion) constrained on an extremum in section (5). The case for bridges with drift follows immediately from case 7 above.
Wiener Bridges Conditioned on Extrema
=====================================
Without loss of generality, consider the space of Brownian bridges $W_t$ on $[0, T]$, with variance $\sigma^2$, $W_0 = a, W_1 = b$, conditioned on a *maximum* $M$. We construct a generator for such processes, unbiased according to the standard measure (induced from the Wiener measure), in two different ways.
Method 1: Construction via Brownian Meanders
--------------------------------------------
By [@I], a ‘standard’ Wiener meander $W^{me, r}_t$ over $[0, 1]$ with $W^{me, r}_0 = 0$ and $W^{me, r}_1 = r$ may be constructed from three standard Wiener bridges $W_t^{1, 2, 3}$ over $[0, 1]$ from 0 to 0 as follows: $$\label{meander_eqn}
W^{me, r}_t = \sqrt{(rt + W_t^1)^2 + (W_t^2)^2 + (W_t^3)^2}.$$ Note that this is a 3-dimensional Bessel process with drift. Furthermore, this construction is unbiased according to the standard measure.
\[meander\_rem\] Note that with the notation above, from the scaling property of Wiener processes and checking the values at the endpoints, it follows that $$W^{me, T, \sigma, (a, b)}_t = a + \sigma\sqrt{T}W^{me, r/(\sigma\sqrt{T})}_t$$ is a Wiener process with variance $\sigma^2$, and values $a$ at $t=0$ and $r$ at $t=T$, with the measure of a conditional Wiener process preserved.
By [@AC], we note that the joint density of the minimum and location of the minimum of a Brownian bridge with variance 1 from $a$ to $b$ over $[0, T]$ is $$\resizebox{.9\hsize}{!}{$p(\mathrm{min}X_t = m, \mathrm{argmin}X_t = \theta) = \frac{(a-m)(b-m)\sqrt{2T}}{\sqrt{\pi \theta^3 (T-\theta)^3}}e^{\frac{(a-b)^2}{2T} - \frac{(a-m)^2}{2\theta}-\frac{(b-m)^2}{2(T-\theta)}}\mathbbm{1}_{\{m<a, m<b\}},$}$$ and the density of the minimum alone is $$\frac{2}{T} (a+b-2m)e^{\frac{-2(a-m)(b-m)}{T}}\mathbbm{1}_{\{m<a, m<b\}}$$ so that the conditional density is, for $m<a, m<b$, $$\begin{aligned}
& p(\mathrm{argmin}_{s\in[0, T]} X_s= \theta \vert \mathrm{min}_{s\in[0, T]} X_s = M) \nonumber\\
& \qquad = \frac{1}{\sqrt{2\pi}}\frac{(a-m)(b-m)}{(a+b-2m)}\left(\frac{T}{\theta(T-\theta)}\right)^{3/2}e^{\frac{(b-a)^2}{2T} + \frac{2(a-m)(b-m)}{T} - \frac{(a-m)^2}{2\theta} - \frac{(b-m)^2}{2(T-\theta)}}. \label{density_argmax_bb}\end{aligned}$$
This only depends on $a, b, m$ through $a-m, b-m, a-b$. Wiener processes with initial value $a$ and standard variation $\sigma$ transform positively and affinely to standard Wiener processes via $x \mapsto x + \frac{x-a}{\sigma}$, so this transformation preserves location of maximum and minimum. This transformation scales all random increments by $\sigma$, so is an isomorphism at the level of measure, and the probability density for the location of the maximum and minimum is preserved.
The minimum of a standard Brownian process is exactly the maximum of its negative, so negating $a, b, m$ in the above formula and setting $M = \mathrm{max}(M_t)$, we find after scaling by $\sigma$ that, for $M>a, M>b$, $$\begin{aligned}
p(\mathrm{argmax}X_t = \theta \vert \mathrm{max} X_t = M) & = \frac{1}{\sqrt{2\pi}\sigma}\frac{(M-a)(M-b)}{(2M-a-b)}\left(\frac{T}{\theta(T-\theta)}\right)^{3/2} \nonumber\\
\label{density_argmax_wiener} & \times e^{\frac{1}{\sigma^2}(\frac{(b-a)^2}{2T} + \frac{2(M-a)(M-b)}{T} - \frac{(M-a)^2}{2\theta} - \frac{(M-b)^2}{2(T-\theta)})}.\end{aligned}$$
This presents the following algorithm:
**Input.** $\sigma, M, T, a, b$
$\theta \leftarrow$ a time randomly generated according to equation \[density\_argmax\_bb\] $W_t^{\mathrm{left}, i}$ for $i = 1, 2, 3 \leftarrow$ standard Wiener processes $W^{me, \theta, \sigma, (0, M-a)}_t \leftarrow$ Wiener meander generated from $W_t^{\mathrm{left}, i}$ $X^{left}_t \leftarrow M - W^{me, \theta, \sigma, (0, M-a)}_{T-t}$ Brownian meander over $[0, \theta]$ from $a$ to $M$ $W_t^{\mathrm{right}, i}$ for $i = 1, 2, 3 \leftarrow$ standard Wiener processes $W^{me, T-\theta, \sigma, (0, M-b)}_{t} \leftarrow$ Wiener meander generated from $W_t^{\mathrm{right}, i}$ $X^{right}_t \leftarrow M - W^{me, T-\theta, \sigma, (0, M-b)}_{t}$ Brownian meander over $[\theta, T]$ from $M$ to $b$ $X_t = $ concatenate($X^{left}_t, X^{right}_t$)
**Output**: $X_t$
Steps 1-5 above generate an unbiased Brownian bridge over $[0, T]$ from $a$ to $b$ with variance $\sigma^2$ and maximum $M$.
Since Wiener processes have stationary independent increments by definition, the selections of the location of the maximum and unscaled meanders are independent, so that in the Wiener measure we have (suppressing the conditions $W_0 = a, W_T = b$): $$\begin{gathered}
p(W_t \vert \mathrm{max}_{s \in [0, T]} W_s = M) = p(\mathrm{argmax}_{s \in [0, T]} W_s = \theta \vert \mathrm{max}_{s \in [0, T]} W_s = M)\\ \times p(W_t|_{[0, \theta]} \vert \mathrm{argmax}_{s \in [0, \theta]}W_s = \theta)p(W_t|_{[\theta, T]} \vert \mathrm{argmax}_{s \in [\theta, T]}W_s = \theta).\end{gathered}$$ Each factor was generated according to its law. The scaling preserves the independence and ensures Brownian meanders of the correct variance, maximum and endpoints, so the resulting process is an unbiased Brownian bridge.
We illustrate a few examples from a Python implementation of \[alg:meanders\] below. First we generate Wiener bridges on $[0, 1]$ from $a = 1$ to $b = 3$ conditioned on a maximum of 5, with $\sigma = 1$:
![Plots of Wiener bridges generated on $[0, 1]$ from $a = 1$ to $b = 3$ conditioned on a maximum of 5, with $\sigma = 1$](W_5_1.PNG "fig:"){width="40.00000%"} ![Plots of Wiener bridges generated on $[0, 1]$ from $a = 1$ to $b = 3$ conditioned on a maximum of 5, with $\sigma = 1$](W_5_1_b.PNG "fig:"){width="40.00000%"}\
We then run this algorithm to generate Brownian bridges on $[0, 1]$ from $a = 1$ to $b = 3$ conditioned on a maximum of 5, with $\sigma = 5$:
![Plots of Wiener bridges generated on $[0, 1]$ from $a = 1$ to $b = 3$ conditioned on a maximum of 5, with $\sigma = 5$](W_5_5.PNG "fig:"){width="40.00000%"} ![Plots of Wiener bridges generated on $[0, 1]$ from $a = 1$ to $b = 3$ conditioned on a maximum of 5, with $\sigma = 5$](W_5_5_b.PNG "fig:"){width="40.00000%"}\
As a final example, we run the algorithm to generate Brownian bridges on $[0, 1]$ from $a = 1$ to $b = 3$ conditioned on a maximum of 30, with $\sigma = 10$:
![Plots of Wiener bridges generated on $[0, 1]$ from $a = 1$ to $b = 3$ conditioned on a maximum of 30, with $\sigma = 10$. The maximum is considered attained within a tolerance of $\varepsilon = 0.1$](W_30_10.PNG "fig:"){width="40.00000%"} ![Plots of Wiener bridges generated on $[0, 1]$ from $a = 1$ to $b = 3$ conditioned on a maximum of 30, with $\sigma = 10$. The maximum is considered attained within a tolerance of $\varepsilon = 0.1$](W_30_10_b.PNG "fig:"){width="40.00000%"}\
As expected, the process is forced far below the initial and final values, having high volatility but being constrained from above (but not below).
Method 2: Construction via Bayesian Increments
----------------------------------------------
### Procedure
We consider the full joint density of the maximum and location of the maximum as provided in [@AC], to simulate the Brownian motion $X_t$ from $X_0=a$ with volatility $\sigma$ conditioned on $X_T=b$ and $\mathrm{max}_{t \in [t_0, T]} X_t = M$, without bias.
First, consider $t\in[t_0,T]$ and assume the standard measure. We start with $t = 0$, $X_t = a$, and successively increment $t$ by $\Delta t$. As we proceed there are two cases:
1. **The process has not yet achieved its maximum.** That is, we assume $X_s<M$ for all $s\in[t_0,t]$. We consider a discrete time increment $\Delta t$ and wish to find the probability density of $\Delta X$. By Bayes’ Law we have, density-wise, $$\begin{aligned}
& p(X_{t+\Delta t}=X + \Delta X \,\vert\, \mathrm{max}_{s \in [t + \Delta t, T]} X_s = M, X_t = b) \nonumber\\
= & p(X_{t+\Delta t} = X + \Delta X \,\vert\, X_t = b )\nonumber\\
\label{bayes_wiener}& \times \frac{p(\mathrm{max}_{s \in [t, T]} X_s = M \,\vert\, X_{t+\Delta t} = X + \Delta X, X_t = b))}{p(\mathrm{max}_{s\in [t, T]} X_s = M \,\vert\ X_t = b)}\end{aligned}$$
Here the condition $X_{t_0}=a$ pertains to every factor but may be suppressed since $X$ has independent and stationary increments.
We find $$p(X_{t+\Delta t} = X + \Delta X \,\vert\, X_t = b) = \frac{1}{\sqrt{2\pi\sigma^2\Delta t}} e^{-(\frac{\Delta X - (b-X)}{T-t} \Delta t)^2/(2\sigma^2 \Delta t)},$$ directly from the SDE for an unconditioned Brownian bridge (equation \[sde\_bb\]).
For the remaining two factors, given the density of the minimum of a Brownian bridge as found in [@AC], the symmetry of Wiener processes allows us to find the density of the maximum of a Brownian bridge by negating $a,b$ and $y$: $$\begin{aligned}
& p(\mathrm{max}_{s\in [t_0, T]}X_s = M \, \vert \, X(t_0) = a, X_t = b)) \nonumber \\
= & \frac{2}{T-t_0} (2M-a-b) e^{\frac{-2(a-M)(b-M))}{T-t_0}} \mathbbm{1}_{\{ M \ge a \}} \mathbbm{1}_{\{M\ge b\}}. \label{density_max_bb}\end{aligned}$$
Briefly suppressing the condition $(X_{t+\Delta t} = X + \Delta X, X_t = b)$, we consider whether the (almost surely unique) maximum is attained between $[t, t+\Delta t]$ or $[t+\Delta t, T]$, and further note that $$\begin{aligned}
& p(\mathrm{max}_{s\in [t, T]}X_s = M) \\
& = p(\mathrm{max}_{[t, t+\Delta t]} X_t = M \vert X_{t+\Delta t} = X_t + \Delta X_t) P(\mathrm{max}_{[t+\Delta t, T]} X_t \le M \vert X_T = b) \\
& + P(\mathrm{max}_{[t, t+\Delta t]}X_t \le M \vert X_{t+\Delta t} = X_t + \Delta X_t)p(\mathrm{max}_{[t+\Delta t, T]} X_t = M \vert X_T = b).\end{aligned}$$
We integrate to find $$\begin{aligned}
& P(\mathrm{max}_{[t_1, t_2]}X_t \le M ) \nonumber\\
& = \int_{-\infty}^M p(\mathrm{max}_{s \in [t+\Delta t, T]} X_s \in dM' \,\vert\, X_{t+\Delta t} = X + \Delta X) dM' \nonumber\\
& = 1-e^{-2(M-a)(M-b)/T}. \label{prob_bound_bb}\end{aligned}$$
As $\Delta t \to 0$, $$p(\mathrm{max}_{[t, t+\Delta t]} X_t = M \vert X_{t+\Delta t} = X+\Delta X) \to 0$$ and $$\vert p(\mathrm{max}_{[t, t+\Delta t]}X_t \le M \vert X_{t+\Delta t} = X + \Delta X) -1\vert \to 0$$ like $\mathcal{O}(\frac{k_1}{\Delta t}e^{-k_2/{\Delta t}})$, and so both are dominated as $\Delta t \to 0$ by the remaining factors in the full quotient, which take the form $$k_1 \frac{T-t-\Delta t}{T-t}e^{k_2(\frac{1}{T-t-\Delta t} - \frac{1}{T-t})}.$$ Thus, for the purposes of computation, as $\Delta t \to 0$ we can take the maximum over $[t+\Delta t, T]$ instead of $[t, T]$ for the numerator, simplifying the expression in implementation when $\Delta t$ is very small. In this paper we keep the full expression.
This gives us an SDE in the first case, as in the algorithm we can select $dX$ at random from this distribution: $$\begin{aligned}
& p(X_{t+\Delta t} = X + \Delta X\, \vert \, \mathrm{max}_{s \in [t+\Delta t, T]} X_s = M, X_t = b) \\
= & \frac{T-t_0}{T-t_0-\Delta t} \frac{2M-X-\Delta X - b}{2M-X-b} e^{2\frac{(X-M)(b-M) - (X+\Delta X - M)(b-M)}{(T-t_0)(T-t_0-\Delta t)}}\\
& \times \frac{1}{\sqrt{2\pi \sigma^2 \Delta t}}e^{-\frac{-(\Delta X - \frac{b-X}{T-t}\Delta t)^2}{2\sigma^2 \Delta t}}\mathbbm{1}_{\{M \ge X + \Delta X\}}\mathbbm{1}_{\{M\ge b\}}.\end{aligned}$$
2. **The process has achieved its maximum already.** In this case we do not require the maximum to be attained on $[t, T]$ (in fact, it almost surely is not), and just require that $X_t$ is bounded from above by $M$ there, so that we have $$\begin{gathered}
P(\mathrm{max}_{s\in [t, b]}X_s \le M \vert X_{t+\Delta t} = X + \Delta X)\\
= P(\mathrm{max}_{s \in [t, t+\Delta t]} X_s \le M \vert X_{t+\Delta t} = X_t+ \Delta X_t)\\
\times P(\mathrm{max}_{s\in [t+\Delta t, T]} X_s \le M \vert X_T = b)\end{gathered}$$ which we can find explicitly from equation \[prob\_bound\_bb\].
3. **Endpoint.** Until now we have assumed that the $X_t$ had an interval of nonzero length to its right. Finally, after incrementing through all but the last value, we must set $X_T = b$.
The whole procedure follows similarly for minima. However, there are numerical considerations beyond those for the usual bounds and stepsizes in numerical integration. For example, to ensure that truncation error does not hinder the pre-extremum/post-extremum bifurcation in the algorithm, we set a range of acceptable closeness $\varepsilon$ to the extremum when we check whether the extremum has been attained. When incrementing, we should also set a range of $L$ possible increments to select from, weighted by the correct probabilities.
### Rectification
After approximating a Wiener process meeting the conditions in an unbiased way, a simple rectification of the conditions as follows is justifiable for practical purposes. That is, given a range of acceptable closeness to the maximum, $\varepsilon$, to ensure that the error does not hinder the pre-extremum/post-extremum bifurcation in the algorithm in this subsection, we scale the final process as follows.
Let $\tilde{M}$ be the actual maximum of the numerically generated bridge. First we adjust to ensure the maximum is attained exactly (rather than within $\varepsilon$) by postcomposing with $$x \mapsto a + \frac{M-a}{\tilde{M}-a}(x-a).$$ Denote the new right-hand end point by $\tilde{b}$. Then, to adjust the final value back to $b$, we replace only that section of the bridge after the maximum by its postcomposition with $$x \mapsto M + \frac{M-b}{M-\tilde{b}}(x-M).$$ Then we have traded one error for another: we have slightly adjusted the dynamics, which may be viewed as having a slight effect on $\sigma$, but the more visible endpoints and maximum are held to exactly.
### Implementation
We present the algorithm below, which may be applied to more general processes.
**Input.** $t_0, T, a, b, M,$ dynamical parameters, $N_{\mathrm{timesteps}}, \delta, \varepsilon, L$
density $\leftarrow$ conditional density of bridge maximum max (for Brownian bridges, given by equation \[density\_max\_bb\]) density density $\leftarrow \int_{\mathrm{min}(a, b)}^{\mathrm{bound}} DensityMax(M'; t_1, t_2, x_1, x_2) dM'$ density density $\leftarrow$ density of increment determined from unconstrained SDE (for Brownian bridges, given by equation \[sde\_bb\]) density pBoundLeft $\leftarrow$ ProbBound(max; $t, t+dt, X, X+dX$) pBoundRight $\leftarrow$ ProbBound(max; $t+dt, T, X+dX, b$) pMax $\leftarrow$ DensityMax(max; $t, T, X, b$) pMaxLeft $\leftarrow$ DensityMax(max; $t, t+dt, X, X+dX$) pMaxRight $\leftarrow$ DensityMax(max; $t+dt, T, X+dX, b$) density $\leftarrow$ DensityIncrementUnconstrained($dX; t, dt, X$)\* (pMaxLeft\*pBoundRight+pBoundLeft\*pMaxRight)/pMax density $\leftarrow$ DensityIncrementUnconstrained($dX; t, dt, X$)\* (pBoundRight+pBoundLeft)/pMax density $dt \leftarrow (b-a)/N_{\mathrm{timesteps}}$ $X_0 \leftarrow a$ first bridge point maxAttained $\leftarrow$ False $X_{\mathrm{min}} \leftarrow$ $X$ such that $\int_{-\infty}^{X_{\mathrm{min}}}$ DensityIncrementUnconstrained($t, t+\Delta t, X, X') dX' < \delta$ $dX_{\mathrm{min}} \leftarrow X_{\mathrm{min}} - X_i$ $dX_{\mathrm{max}} \leftarrow M - X_i$ $dX \leftarrow$ random variable selected according to DensityIncrementMax($t, dt, X_i, dX_i, b$, maxAttained) over interval $[dX_{\mathrm{min}}, dX_{\mathrm{max}}]$ and $L$ steps maxAttained = True $X_{i+1} \leftarrow X_i + dX_i$ $X_{N_{\mathrm{timesteps}}} \leftarrow b$ last bridge point Optional: rectify the vector $(X_i)$ by scaling as in section 2.2.2
**Output.** A time vector $X_i$, approximating the bridge with given dynamics over $[t_0, T]$ from $a$ to $b$ constrained to the maximum $M$.
The choice of $X_{\mathrm{min}}$ may be decided case by case. In general, one approach might be to find when the cumulative probability of the minimum (without constraint to a maximum) $$P(\mathrm{min}_{s \in [a, b]}X_s \le X_{\mathrm{min}} \vert X_0 = a, X_T = b) < \delta,$$ which in turn can be found directly from the probBound function by considering the dual case of the process $-X_t$. In the case of the Brownian bridge constrained to a maximum from $a$ to $b$ at a given $t$, we have $$1-L = e^{-2(a-X_{\mathrm{min}})(b-X_{\mathrm{min}})/T}.$$ Solving for $X_{\mathrm{min}}$, we find $$\frac{a+b}{2} - \frac{1}{2} \sqrt{(a-b)^2-2T\ln (1-L)},$$ the only one of the two solutions less than $a, b$. It would also be possible to compute a new $X_{\mathrm{min}}$ at each step over the interval $[X_t, b]$, but this is slightly more computationally expensive and relies on previous simulations rather than taking account of $a$.
Below we show corresponding unrectified and rectified examples of Wiener bridges generated under method 2 (construction by Bayesian increments) over the time interval $[0, 2]$ from 3 to 4 with standard deviation $1$, conditioned on maximum $5$. We take $N_{\mathrm{timesteps}} = 100, \delta = 10^{-3}$ and $\varepsilon = 0.2$, with $L = 10000$ the number of possible increments from which to make the density-weighted selection at each increment.
![Plots of unrectified and rectified Wiener bridges generated by method 2 on $[0, 1]$ from $a = 1$ to $b = 3$ conditioned on a maximum of 5, with $\sigma = 1$](unrectified_W.PNG "fig:"){width="40.00000%"} ![Plots of unrectified and rectified Wiener bridges generated by method 2 on $[0, 1]$ from $a = 1$ to $b = 3$ conditioned on a maximum of 5, with $\sigma = 1$](rectified_W.PNG "fig:"){width="40.00000%"}\
![Plots of unrectified and rectified Wiener bridges generated by method 2 on $[0, 1]$ from $a = 1$ to $b = 3$ conditioned on a maximum of 5, with $\sigma = 1$](unrectified_W_2.PNG "fig:"){width="40.00000%"} ![Plots of unrectified and rectified Wiener bridges generated by method 2 on $[0, 1]$ from $a = 1$ to $b = 3$ conditioned on a maximum of 5, with $\sigma = 1$](rectified_W_2.PNG "fig:"){width="40.00000%"}\
![Plots of unrectified and rectified Wiener bridges generated by method 2 on $[0, 1]$ from $a = 1$ to $b = 3$ conditioned on a maximum of 5, with $\sigma = 1$](unrectified_W_3.PNG "fig:"){width="40.00000%"} ![Plots of unrectified and rectified Wiener bridges generated by method 2 on $[0, 1]$ from $a = 1$ to $b = 3$ conditioned on a maximum of 5, with $\sigma = 1$](rectified_W_3.PNG "fig:"){width="40.00000%"}\
We note that the results indeed generate bridges subject to the maximal condition, the apparent variance behaves as expected, and the difference between corresponding unrectified and rectified bridges is minor upon inspection.
To test that the numerical generation is reliable, we may verify that the distribution of the argmax also follows the result from [@AC]:
![Density of the location of the maximum of a Brownian bridge from 3 to 4 conditioned on maximum 5, variance 1. Solid (blue): Experimental frequency after 1000 runs as generated by Method 2. Dashed (red): Theoretical density based on equation \[density\_argmax\_wiener\].](frequency_histogram.PNG "fig:"){width="40.00000%"}\
These visibly agree quite closely. We conclude the fit is good and the simulation is successful for the choices made for these numerical parameters.
We note that for the same parameters, Method 1 (construction via Brownian meanders) took 0.004 seconds to generate the bridge and Method 2 (construction via Bayesian increments) took 10.14 seconds [^3]. Both methods are linear in the number of timesteps. Clearly the method using meanders is much faster, but the method of Bayesian increments is more generalizable whenever the unconditioned SDE and the density of the extremum are known.
Ornstein-Uhlenbeck bridges conditioned on extrema
=================================================
We seek a construction of an OU-process $X$ from $X_{t_0}=a$ to $T$ with volatility $\sigma$ conditioned on $X_T=b$ and $\mathrm{max}_{t_0 \le s \le T} X_s = M$, without bias. Again, consider $t\in [t_0, T]$ and assume the standard measure.
We note that it is possible to run through algorithm \[alg:bayesian\_increments\] as before, provided we have the density for a given increment in an unconstrained OU bridge, and the density of the maximum of a general OU bridge. The solution of the latter is a difficult problem, and unfortunately one convergent solution we discuss requires multiple nested loops to compute. Even with a more easily computable approximation, both Python and C++ implementations are still impractically slow on a 2.6GHz Intel CPU. Analysis of results using a GPU are pending further research.
Here and elsewhere, we note that the location of an extremum for any diffusion process is almost surely unique (see [@KS]).
We find in the unconditioned OU bridge case that $$\Delta X \sim \mathcal{N}((-\kappa X_t +2\kappa \frac{(b-\mu)e^{\kappa(T+t)}-X_t\kappa e^{2\kappa t}}{e^{2\kappa T}-e^{2\kappa t}})\Delta t, \sigma \sqrt{\Delta t}),$$ that is $$\begin{aligned}
& p(\mathrm{max}_{s \in [t+\Delta t, T]} X_s = M \,\vert\, X_{t+\Delta t} = X + \Delta X, X_t = b))\\
&= \frac{1}{\sqrt{2\pi \Delta t} \sigma}e^{(\Delta X_t + (\kappa X_t -2\kappa \frac{(b-\mu)e^{\kappa(T+t)}-X_t\kappa e^{2\kappa t}}{e^{2\kappa T}-e^{2\kappa t}})\Delta t)^2/2\sigma^2\Delta t}.\end{aligned}$$
We find from [@CFS] that for a general linear diffusion we have the joint probability density form $$\begin{aligned}
p_{joint} := &\; p(\mathrm{max}_{t \in [t_0, t_1]} X_t = M,X_t=X_t,\mathrm{argmax}_{t \in [t_0, t_1]} X_t=T)\\
= & \;n(t, M-a)n(T-t, M-b)S(M)m(db)dt,
\end{aligned}$$ where $S(y)$ is the scale function, $m(dz)$ is the speed measure for the unconditioned OU process, and $n(s; y)$ is the density of the hitting time of $y$ at $s$ for a process with the same dynamics starting at $0$. Our $M$ and $b$ are given, so we normalize this by $$\int_a^{\infty}\int_{-\infty}^M p_{joint}(M, b, t) db dM$$ to find the conditional probability density.
For linear diffusions with Markov processes given by $$\mathcal{L} f(x) = \frac{1}{2}\sigma(x)^2 f''(x) + b(x)f'(x) - cf(x),$$ we have $$S(x) = \int_c^x e^{-B(y)}dy, \quad m(dx) = \frac{2}{\sigma^2}e^{B(x)}dx,$$ where $$B(x) = \int_0^x \frac{2}{\sigma^2(y)}b(y)dy.$$ The Markov generator of the OU process is $$\mathcal{L} f(x) = \frac{1}{2}\sigma^2 f''(x) + \kappa (\mu - x)f'(x).$$ Therefore, given we set the process to start at time 0, we may take $$S(x) = \int_0^x e^{\frac{\theta}{\sigma^2}(y^2-2\mu y)}dy, \quad m(x) = \frac{2}{\sigma^2}e^{\frac{2}{\sigma^2}\theta(\mu x - \frac{1}{2}x^2)}.$$
The hitting time $n_x(s;y)$ does not have a known easily tractable “analytic” solution but may be efficiently given as the limit of a sequence given by Lipton and Kaushansky (2017) [@LK] based on a method found in Linz [@L], or approximated by other methods detailed further below.
Lipton and Kaushansky proceed by transforming the hitting time problem to a system of equations whose solution depends on the solution to Volterra equations. In particular, they first normalize the OU process to a simpler OU process $$dX_t = \kappa (\mu - X_t) dt + \sigma dW_t \quad \leftrightarrow \quad dX_t = -X_t dt + dW_t,$$ with the same initial value, and then demonstrate that the hitting time $\mathbb{P}_x$-density of a thus normalized OU process starting at $a$ hitting $b$ and evaluated at $t$, is $$\begin{aligned}
n_x(t;a, b) = & 4e^{-2t} \int_0^{\theta} (-3(\theta - \theta')(2-\theta-\theta') + (a(1-\theta) - b(1-\theta'))^2)\\
& \times (a(1-\theta) - b(1-\theta))\frac{\mathrm{exp}(-\frac{(a(1-\theta) - b(1-\theta'))^2}{(\theta-\theta')(2-\theta-\theta')})(1-\theta')\nu^b(\theta')}{\sqrt{\pi (\theta-\theta')^7(2-\theta-\theta')^7}}d\theta'\\
& + 4e^{-t} \int_0^{\theta} (-(\theta - \theta')(2-\theta-\theta') + (a(1-\theta) - b(1-\theta'))^2)\\
& \times \frac{\mathrm{exp}(-\frac{(a(1-\theta) - b(1-\theta'))^2}{(\theta-\theta')(2-\theta-\theta')})(1-\theta')\nu^b(\theta')}{\sqrt{\pi (\theta-\theta')^5(2-\theta-\theta')^5}}d\theta',\end{aligned}$$ for $\theta = 1-e^{-t}$, and where $\nu^b(\theta)$ is the solution to a Volterra-type integral equation of the second kind,
$$\nu^b(\theta) - \frac{2b}{\sqrt{\pi}} \int_0^{\theta} \frac{e^{-b^2\frac{\theta-\theta'}{2-\theta-\theta'}}(1-\theta')\nu^b(\theta')}{\sqrt{(2-\theta-\theta')^3(\theta-\theta')}}d\theta' - 1 = 0.$$
Thus to find the required density, it remains to solve for $\nu^b(\theta)$ above.
We define $$K(\theta, \theta') = -\frac{e^{-b^2\frac{\theta-\theta'}{2-\theta-\theta'}}(1-\theta')\nu^b(\theta')}{\sqrt{(2-\theta-\theta')^3(\theta-\theta')}},$$ the kernel of this integral operator.
Lipton and Kaushansky propose a “block by block” method based on a method found in [@L], based on quadratic interpolation, as follows.
First, define the following functions $$\begin{aligned}
& \alpha(x, y, z) = \frac{z}{2}\int_0^2 \frac{(1-s)(2-s)}{\sqrt{x-y-sz}}ds,\\
& \beta(x, y, z) = z\int_0^2\frac{s(2-s)}{\sqrt{x-y-sz}}ds,\\
& \gamma(x, y, z) = \frac{z}{2}\int_0^2\frac{s(s-1)}{\sqrt{x-y-sz}}ds.\end{aligned}$$
For faster implementation, these evaluate to $$\begin{aligned}
& \left\{
\begin{array}{r}
\alpha (x, y, z) \\
\beta (x, y, z)\\
\gamma (x, y, z)
\end{array}\right\}
= \left\{
\begin{array}{r}
-1\\
2\\
-1
\end{array}\right\}[\frac{1}{z}\xi^5 + \frac{1}{3}(-2\frac{x-y}{z^2} + \left\{\begin{array}{r}
3\\
2\\
1
\end{array}\right\}\frac{1}{z})\xi^3 \\
&\qquad\qquad\qquad\qquad +((\frac{x-y}{z})^2-\left\{\begin{array}{r}
3\\
2\\
1
\end{array}\right\}\frac{x-y}{z} + \left\{\begin{array}{r}
2\\
0\\
0
\end{array}\right\})\xi]_{\sqrt{x-y}}^{\sqrt{x-y-2z}}.\end{aligned}$$
Further, define $$w_{n, i} = \left\{
\begin{array}{ll}
(1-\delta_{i, n-1})\alpha(t_n, t_i, h) + (1-\delta_{i,0})\gamma(t_n, t_i-2h, h), & \mbox{if } i \equiv_2 0 \\
\beta(t_n, t_i-h, h), & \mbox{if } i \equiv_2 1
\end{array}
\right.$$
Then for timesteps $0 = t_0 < t_1 < \ldots < t_N = T$, and a desired stepsize $h$, set $F_0 = f(0)$, repeat the following steps for $m=0$ to $N/2$:
1. For $i = 0, \ldots, 2m$, compute $w_{2m+1, i}, w_{2m+2, i}$.
2. Solve the following system of equations for $[F_{2m+1}, F_{2m+2}]$ and append them to the list of known $F_k$: $$\begin{aligned}
F_{2m+1} = 1 & + (1-\delta_{m0}) \sum_{i=0}^{2m} w_{2m+1, i}K(t_{2m+1}, t_i)F_i\\
& + \alpha(t_{2m+1}, t_{2m}, \frac{h}{2})K(t_{2m+1}, t_{2m})F_{2m}\\
& + \beta (t_{2m+1}, t_{2m}, \frac{h}{2})K(t_{2m+1}, \frac{t_{2m}+t_{2m+1}}{2})\\
& \qquad \qquad \times (\frac{3}{8}F_{2m} + \frac{3}{4}F_{2m+1} - \frac{1}{8} F_{2m+2})\\
& + \gamma(t_{2m+1}, t_{2m}, \frac{h}{2})K(t_{2m+1}, t_{2m+1})F_{2m+1},\\
F_{2m+2} = 1 & + (2-\delta_{m0})\sum_{i=0}^{2m} w_{2m+2, i}K(t_{2m+2}, t_i)F_i\\
& + \alpha(t_{2m+2}, t_{2m}, h)K(t_{2m+2}, t_{2m})F_{2m}\\
& + \beta(t_{2m+2}, t_{2m}, h)K(t_{2m+2}, t_{2m+1})F_{2m+1}\\
& + \gamma(t_{2m+2}, t_{2m}, h) K (t_{2m+2}, t_{2m+2})F_{2m+2}.\end{aligned}$$
Explicitly, at each stage we set $$\begin{aligned}
&[\beta K]_m = \beta(t_{2m+1}, t_{2m}, \frac{h}{2})K(t_{2m+1}, \frac{t_{2m}+t_{2m+1}}{2})\\
&A_m = -1 + \frac{3}{4}[\beta K]_m + \gamma(t_{2m+1}, t_{2m}, \frac{h}{2})K(t_{2m+1}, t_{2m+1})F_{2m+1},\\
&B_m = -\frac{1}{8}[\beta K]_m\\
&C_m = 1 + (1-\delta_{m0})\sum_{i=0}^{2m} w_{2m+1, i} K(t_{2m+1}, t_i)F_i \\
& \qquad\qquad\qquad\qquad + \alpha(t_{2m+1}, t_{2m}, \frac{h}{2})K(t_{2m+1}, t_{2m})F_{2m} + \frac{3}{8}[\beta K]_m F_{2m},\\
&A'_m = \beta(t_{2m+2}, t_{2m}, h)K(t_{2m+2}, t_{2m+1}),\\
&B'_m = \gamma(t_{2m+1}, t_{2m}, \frac{h}{2})K(t_{2m+2}, t_{2m+2}),\\
&C'_m = 1 + (1-\delta_{m0}) \sum_{i=0}^{2m}w_{2m+1, i} K(t_{2m+1}, t_i)F_i\\
& \qquad\qquad\qquad\qquad + \alpha(t_{2m+2}, t_{2m}, h)K(t_{2m+2}, t_{2m})F_{2m}.\end{aligned}$$ Then we have $$\begin{aligned}
&F_{2m+1} = \frac{-C_mB'_m + C'_mB_m}{A_mB'_m - A'_mB_m},\\
&F_{2m+2} = \frac{-A_mC'_m + A'_mC_m}{A_mB'_m - A'_mB_m}.\end{aligned}$$
Then as $N \to \infty$, $F_{2m+1}, F_{2m} \to \nu^b$ pointwise on $t_i$, $0\le i \le N$.
All functions and operations used to find the incremental probability density are continuous, and thus it follows that algorithm \[alg:bayesian\_increments\] simulates an unbiased OU process with the given bridge and extremum conditions.
For implementation purposes, we set $X_{\mathrm{min}}(\delta)$ by solving for $$P(\mathrm{min}_{s \in [a, b]}X_s \le X_{\mathrm{min}} \vert X_0 = a, X_T = b) < \delta$$ numerically by minimizing $$\vert 1 - P(\mathrm{max}_{s\in [a, b]} \tilde{X}_s \le -X_{\mathrm{min}} \vert X_0 = -a, X_T = -b) - \delta \vert,$$ given by the methods in this subsection, and where the dynamics of $\tilde{X}_t = -X_t$ are given by parameters $-\theta, -\kappa, \sigma$. We may cut down on computation time by using an approximation of the hitting time $n_x(s, y)$ found in [@LK] from first-order truncation of the governing Volterra equation to an Abel equation and solving via Laplace transforms. This does not formally converge to the correct result, but greatly decreases computation time, and holds for $t\ll1$. Since the values of $t$ in this context are within the range of the increment $[0, \Delta t]$, we make this assumption. We set $$\nu^{\tilde{M}}(\vartheta) = 2e^{\frac{\tilde{M}^2\vartheta}{2}}\mathcal{N}(\tilde{M}\sqrt{\vartheta}),$$ where $\vartheta = 1-e^{-t}$ and $\tilde{M} = \frac{\sqrt{\kappa}}{\sigma}(M-\mu).$
As before, after approximating an OU process meeting the conditions in an unbiased way, applying the same simple rectification in the algorithms may be justifiable for practical purposes, if the maximum is desired to be reached on one of the actual numerical increments. In this case, such rectification trades errors the constraint variables ($a, b, M$) for errors in the dynamical variables $(\mu, \kappa, \sigma)$, in different ways on either side of the actual maximum.
Open-Ended Ornstein-Uhlenbeck processes conditioned on extrema
==============================================================
The case of open-ended OU processes $X_t$ conditioned on extrema (without loss of generality, a maximum $M$) proceeds mostly as in algorithm \[alg:bayesian\_increments\], except that we do not specify a last value $b$ after the loop, and pMaxLeft and pBoundLeft are computed quite differently from pMaxRight and pBoundRight. In particular, pMaxLeft and pBoundLeft are computed using the density and distribution formulae for the bridge case as in section 3 (since for these we condition on the endpoints of the interval $[t, t+\Delta t]$), while pMaxRight and pBoundRight are computed using the density and distribution for the open-ended case (since we no longer have the condition $X_T = b$).
The density of the increment of the unconstrained open-ended OU process $P(X_{t+\Delta t} = X + \Delta X )$ is given by $$\frac{1}{\sqrt{2\pi dt}\sigma}e^{-\frac{(dX_t-\kappa(X_t-\mu)dt)^2}{2\sigma^2dt}},$$ and $$\begin{aligned}
P_{open}(X_{t+\Delta t} &= X + \Delta X \,\vert\, \mathrm{max}_{s \in [t + \Delta t, T]} X_s = M) \\
& = \int_{-\infty}^M P(X_{t+\Delta t} = X + \Delta X \,\vert\, \mathrm{max}_{s \in [t + \Delta t, T]} X_s = M) db',\end{aligned}$$ where the right-hand side is as in section 3.
$X_{\mathrm{min}}$ may again be solved for numerically, as in section 3. In actual implementation, the last value $X_T$ cannot be given as $b$, and the incremental process assumes an interval of positive length between $t$ and $T$. For this one point we set $X_T = X_{T-\Delta t}$ for simplicity.
Brownian motion with drift and geometric Brown-ian motion conditioned on extrema
================================================================================
We consider the case of drift and geometric Brownian motion, particularly important in quantitative finanace as it underlies the Black-Scholes model. The case for bridges is in fact trivial, since a Brownian motion with drift constrained to bridge conditions is in fact independent of its drift. To see this, consider a Brownian motion with drift $c$ on $[0, T]$ from $a$ to $b-cT$, and add a drift $ct$. Then by the SDE (equation \[sde\_bb\]) we have $$d(X_t+ct) = \frac{b-X_t}{T-t}dt + cdt + dW_t = \frac{b - (X_t+ct)}{T-t}dt + dW_t,$$ which is exactly the same as the original SDE in $X_t+ct$. Therefore, the problem of constructing a Brownian bridge with drift to a given extremum is already solved in (3). A geometric Brownian bridge $X^{geom}_t$ on $[0, T]$ from $a$ to $b$ with maximum $M$ and drift $c$ (with $a, b, M$ all necessarily positive) is then precisely (and in law) given by $e^{Y_t},$ where $Y_t$ is a Brownian bridge on $[0, T]$ from $\mathrm{ln}\,a$ to $\mathrm{ln}\,b$ with maximum $\mathrm{ln}\,M$.
Our construction of an open-ended Brownian motion $X_t$ with given variance $\sigma^2$ and drift $c$ (and correspondingly an open-ended geometric Brownian motion) constrained to a given maximum $M$ over $[0, T]$ relies again on a Bayesian incremental method. If we assume an initial value $a$, a volatility $\sigma$, drift coefficient $c$, then the transformation $X_t \mapsto (X_t-a)/\sigma$ induces an initial value 0, a drift coefficient $\frac{c}{\sigma}$ and a maximum $\frac{M-a}{\sigma}$. The problem is thus equivalent to simulating a Brownian motion $X_t$ with drift $c$ and volatility 1, constrained to a maximum $M$ over $[0, T]$ with initial value 0, which we assume without loss of generality.
The density of the maximum of such a Brownian motion with drift may be found in [@BO], from an application of Girsanov’s theorem: $$p(\mathrm{max}_{s\in[0, t]} X_t \in dM) = \sqrt{\frac{2}{\pi T}}e^{-(M-cT)^2/2T}-2ce^{2cM}N(-\frac{M+cT}{\sqrt{T}})\mathbbm{1}_{\{M\ge0\}}dM. \label{density_max_drift}$$
Integrating and setting the value at infinity to 1, we find that the probability that $X_t$ is bounded by $M$ on $[0, T]$ is $$P(\mathrm{max}_{s\in [0, t]} X_t \le M) = e^{2cM}(\mathcal{N}(\frac{M+cT}{\sqrt{T}})-1) + \mathcal{N}(\frac{M-cT}{\sqrt{T}}).\label{prob_bound_drift}$$
The unconditioned density of an increment $\Delta X$ after a given increment $\Delta t$ is given directly from the defining SDE by $$p(X_{t+\Delta t } = X+ \Delta X) = \frac{1}{\sqrt{2\pi \Delta t}\sigma}e^{\frac{-(\Delta X-c\Delta t)^2}{2\sigma^2\Delta t}}. \label{density_increment_drift}$$
As in section 4, we follow algorithm \[alg:bayesian\_increments\] with the exception that pMaxLeft and pBoundLeft are computed as for the bridge process over $[t, t+\Delta t]$ from $X$ to $X+\Delta X$ (recalling that these are independent of $c$ and are the same as in section 2.2), and pMaxRight and pBoundRight are given for the open-ended case. That is, we define pBoundLeft from equation \[prob\_bound\_bb\], pBoundRight from equation \[prob\_bound\_drift\], pMaxLeft from equation \[density\_max\_bb\], pMaxRight by equation \[density\_max\_drift\], and DensityIncrementUnconstrained from equation \[density\_increment\_drift\].
In our implementation, we find $X_{\mathrm{min}}$ numerically by solving for $$P(\mathrm{min}_{s\in [t_0, T]}X_s \le X_{\mathrm{min}})< \delta.$$ We use a Brent solver to minimize $$\vert e^{2cX_{\mathrm{min}}}(1-\mathcal{N}(\frac{-X_{\mathrm{min}}-cT}{\sqrt{T}})) + (1-\mathcal{N}(\frac{-X_{\mathrm{min}}+cT}{\sqrt{T}})) - \delta \vert.$$ As in section 4, the last value $X_T$ cannot be given by a predefined value $b$, and the incremental process assumes an interval of positive length between $t$ and $T$. For this one point, we assume for simplicity that $X_T = X_{T-\Delta t}$.
We used our implementation to simulate Wiener processes over $[0, 2]$ starting at 3 with drift $c = 1$ and volatility $\sigma = 2$. Numerically, we set $N_{\mathrm{timesteps}} = 100$, $\delta = 10^{-3}$, $\varepsilon = 0.1$, and $L = 1000$. We show examples below.
![Plots of Wiener processes with drift $[0, 1]$ with initial value 3, conditioned on a maximum of 6, with drift coefficient 1 and $\sigma = 2$](drift_example_1.PNG "fig:"){width="40.00000%"} ![Plots of Wiener processes with drift $[0, 1]$ with initial value 3, conditioned on a maximum of 6, with drift coefficient 1 and $\sigma = 2$](drift_example_2.PNG "fig:"){width="40.00000%"}\
![Plots of Wiener processes with drift $[0, 1]$ with initial value 3, conditioned on a maximum of 6, with drift coefficient 1 and $\sigma = 2$](drift_example_3.PNG "fig:"){width="40.00000%"} ![Plots of Wiener processes with drift $[0, 1]$ with initial value 3, conditioned on a maximum of 6, with drift coefficient 1 and $\sigma = 2$](drift_example_4.PNG "fig:"){width="40.00000%"}\
Note that we did not rectify the maximum value. The plots show expected behavior. Mean computation time was 21.69 seconds despite the decrease in $L$ from 10000 to 1000. Setting $L$ to 10000, the mean computation time was 169.47 seconds.[^4] The density of the location of the maximum (unconstrained on the maximum value) is found in [@KS] to be $$p(\mathrm{argmax}_{s\in[0, T]} X_s = \theta) = 2(\frac{e^{-c^2\theta/2}}{\sqrt{2\pi\theta}} + c\mathcal{N}(c\sqrt{\theta}))(\frac{e^{-c^2(T-\theta)/2}}{\sqrt{2\pi(T-\theta)}} - c\mathcal{N}(-c\sqrt{T-\theta})).\label{density_argmax_drift}$$ This density is the same for $c/\sigma$ in our case.
We see similar distributions for 10 bins, after randomly generating the maximum according to equation \[density\_max\_drift\]. We plot both the experimental and theoretical densities for 10 bins below.
![Density of the location of the maximum of a Wiener process constrained to a maximum of 6 over $[0, 2]$, with drift coefficient 1, volatility 2 and initial value 3. Solid (blue): Experimental frequency after 100 runs. Dashed (red): Theoretical density based on equation \[density\_argmax\_drift\]](frequency_histogram_drift_100.PNG "fig:"){width="40.00000%"}\
These appear to agree fairly closely. We conclude that the fit is good and the simulation is successful for the choices made for these numerical parameters.
Finally, we exponentiate to illustrate the case for geometric Brownian motion, which we take over $[0, 2]$, starting at 3, conditioned on a maximum of 6. For the bridge case, we simulate the logarithm with the method of 2.1, and assume a value of 4 at $t = 2$, volatility 2 and exponential drift coefficient 1. We simulate 100 timesteps.
![Plots of Geometric Brownian bridges over $[0, 1]$ from 3 to 4, conditioned on a maximum of 6, with exponential drift coefficient 1 and volatility $\sigma = 2$](GBM_bridge_1.PNG "fig:"){width="40.00000%"} ![Plots of Geometric Brownian bridges over $[0, 1]$ from 3 to 4, conditioned on a maximum of 6, with exponential drift coefficient 1 and volatility $\sigma = 2$](GBM_bridge_2.PNG "fig:"){width="40.00000%"}\
For the open-ended case we simulate 100 timesteps with $\delta = 10^{-3}, \varepsilon = 0.1$ and $L = 1000$. First we take drift coefficient 0.2, with volatility 0.1 and 1 respectively:
![Plots of Geometric Brownian motions over $[0, 1]$ with initial value 3, conditioned on a maximum of 6, with exponential drift coefficient 0.2 and from left to right taking $\sigma = 0.1, \sigma = 0.5, \sigma = 1$](gbm_example_sigma_0p1.PNG "fig:"){width="27.00000%"} ![Plots of Geometric Brownian motions over $[0, 1]$ with initial value 3, conditioned on a maximum of 6, with exponential drift coefficient 0.2 and from left to right taking $\sigma = 0.1, \sigma = 0.5, \sigma = 1$](gbm_example_sigma_0p5.PNG "fig:"){width="27.00000%"} ![Plots of Geometric Brownian motions over $[0, 1]$ with initial value 3, conditioned on a maximum of 6, with exponential drift coefficient 0.2 and from left to right taking $\sigma = 0.1, \sigma = 0.5, \sigma = 1$](gbm_example_sigma_1.PNG "fig:"){width="27.00000%"}\
The simulation meets the maximum condition and the behavior of the simulation as volatility increases as expected.
Increasing the drift coefficient to 0.5, retaining volatility over the same range:
![Plots of Geometric Brownian motions over $[0, 1]$ with initial value 3, conditioned on a maximum of 6, with exponential drift coefficient 0.5 and from left to right taking $\sigma = 0.1, \sigma = 0.5, \sigma = 1$](gbm_example_sigma_0p1_c_0p5.PNG "fig:"){width="27.00000%"} ![Plots of Geometric Brownian motions over $[0, 1]$ with initial value 3, conditioned on a maximum of 6, with exponential drift coefficient 0.5 and from left to right taking $\sigma = 0.1, \sigma = 0.5, \sigma = 1$](gbm_example_sigma_0p5_c_0p5.PNG "fig:"){width="27.00000%"} ![Plots of Geometric Brownian motions over $[0, 1]$ with initial value 3, conditioned on a maximum of 6, with exponential drift coefficient 0.5 and from left to right taking $\sigma = 0.1, \sigma = 0.5, \sigma = 1$](gbm_example_sigma_1_c_0p5.PNG "fig:"){width="27.00000%"}\
This construction lends itself to several applications. If the underlying of an option is known to have attained a given maximum, but the current payoff of the option is not known, its value can be estimated by Monte Carlo simulation over geometric Brownian bridge (i.e., Black-Scholes) scenarios conditioned on a given extremum. Barrier option pricing in particular is sensitive to this condition. We will save these applications for a later paper.
**DECLARATION OF INTEREST**
The authors alone are responsible for the content and writing of this paper. The information and views expressed by the authors are their own and not necessarily those of Ernst & Young LLP or other member firms of the global EY organization.
[^1]: andrew.t.schaug@ey.com
[^2]: harish.chandra@ey.com
[^3]: using a 2.6GHz Intel Core i5-7300U CPU
[^4]: using a 2.6GHz Intel Core i5-7300U CPU
|
{
"name": "Xilinx SSR FFT Digital Reversed Order Fixed Rate16_Length128",
"description": "HLS case",
"flow": "hls",
"platform_whitelist": [
"u200"
],
"platform_blacklist": [],
"part_whitelist": [],
"part_blacklist": [],
"project": "prj_ssr_fft_dro_reg_test_r16_l128",
"solution": "solution1",
"clock": "3.3",
"topfunction": "fft_top",
"top": {
"source": [
"src/main.cpp",
"src/hls_ssr_fft_dro_data_path.hpp",
"src/DEBUG_CONSTANTS.hpp"
],
"cflags": "-I${XF_PROJ_ROOT}/L1/include/hw/vitis_fft/fixed -I${XF_PROJ_ROOT}/L1/tests/common"
},
"testbench": {
"source": [
"src/main.cpp",
"${XF_PROJ_ROOT}/L1/tests/hw/1dfft/fixed/commonFix/verif/fftStimulusIn_L128.verif",
"${XF_PROJ_ROOT}/L1/tests/hw/1dfft/fixed/commonFix/verif/fftGoldenOut_L128.verif"
],
"cflags": "-I${XF_PROJ_ROOT}/L1/include/hw/vitis_fft/fixed -I${XF_PROJ_ROOT}/L1/tests/common",
"ldflags": "",
"argv": {},
"stdmath": false
},
"testinfo": {
"disable": false,
"jobs": [
{
"index": 0,
"dependency": [],
"env": "",
"cmd": "",
"max_memory_MB": 32768,
"max_time_min": {
"hls_vivado_syn": 470,
"hls_csim": 60,
"hls_cosim": 470,
"hls_vivado_impl": 470,
"hls_csynth": 60
}
}
],
"targets": [
"hls_csim",
"hls_csynth",
"hls_cosim",
"hls_vivado_syn",
"hls_vivado_impl"
],
"category": "canary"
}
} |
[The secretory type of persons who have survived a myocardial infarct].
250 persons (117 men and 73 women) with past myocardial infarction, between 19 and 65 years of age, were examined for the secreting quality (or nonsecreting) of ABO(H) antigens in the saliva. The secreting persons were additionally examined for the antigens titer. 38.40% of the persons examined were found to be nonsecreting which is twice as many than are normally found among the Bulgarian population (18.69%). In the group of patients with past myocardial infarction the weak secreting persons were significantly more numerous while the moderate and strong secreting persons were significantly less. The data of the study allow the conclusion that the nonsecreting and the hyposecreting types are a risk factor for myocardial infarction. |
ADAM KATTNIG Host
I was first introduced to X-wing by Asa back in college. We started going to our local game store at the time once we discovered they had a weekly X-wing night, and I have been hooked ever since! My name is Adam, and I am an X-wing-aholic. This has been one of the most rewarding communities to be a part of, and I could not be more excited to be on the Back to Dials team! |
The Liberty acquired 6-5 center Amanda Zahui B from the Dallas Wings, the team announced on Wednesday.
Dallas will get the Liberty’s 2017 first-round draft pick. The Liberty receives Dallas’ 2017 second-round pick.
Zahui B was the second overall pick in the 2015 WNBA draft, selected by the then-Tulsa Shock. She averaged 3.4 points and 2.4 rebounds in 31 games in her rookie season for the Shock, which moved to Dallas after the season and was renamed the Wings. Zahui B shot 33.3 percent (12-for-36) from three-point range and also averaged 0.6 blocks per game.
Zahui B played collegiately at Minnesota and was named a 2015 first-team All-American by The Associated Press. She averaged 16.9 points and 12.2 rebounds per game during her career at Minnesota.
The addition of Zahui B is the latest move for the Liberty, which has also added veteran guards Lindsey Harding, Shoni Schimmel and Shavonte Zellous and 6-4 center Adut Bulgak in last month’s draft. Zahui B gives the Liberty another frontcourt presence to team with All-Star Tina Charles (6-4), Carolyn Swords (6-6) and Kiah Stokes (6-3).
The Liberty opens its 20th WNBA season Saturday in Washington, D.C., against the Mystics and plays Dallas in its home opener on Sunday at Madison Square Garden. |
GI Assault Team
GI Assault Team is a set of miniatures published by Pinnacle/Grenadier.
Contents
GI Assault Team are a set of 10 miniature figures designed for RPGs, complete with weapons, grenades, packs, heavy mortars, and an infrared machine gun.
Reception
Michael Maloney reviewed GI Assault Team in Space Gamer No. 65. Maloney commented that "Overall, this is a nicely-done kit with everything you need. It is worth its price for the figures alone."
References
See also
List of lines of miniatures
Category:Miniature figures |
Arthur Mellows Village College
Arthur Mellows Village College is a secondary school in Glinton in the local authority of Peterborough. The school is an academy with a specialism in technology.
Olympic gymnast Louis Smith and Luke Steele are amongst the famous alumni.
The school is named after a former mayor of Peterborough. It was originally built to serve the villages from Wittering to Eye which form an approximate straight line, the village of Glinton being in the middle. More recently the school developed a broader catchment including pupils from the large Peterborough suburb of Werrington. In the 1970s and 1980s the school was ahead of its time in terms of community links that are an obligation of all schools today. Arthur Mellows offered evening classes and a meeting area for several community groups/clubs and also once had a public library on site. As such the school used to refer to the headteacher using the title "Warden". More recently this was changed for the more recognisable term "Head of College". Originally opened to serve the rural community, green is a prominent colour on the uniform.
References
External links
Arthur Mellows Village College
Category:Academies in Peterborough
Category:Secondary schools in Peterborough |
Near-infrared absorbing polymer nano-particle as a sensitive contrast agent for photo-acoustic imaging.
Polymer nano-particles (PNPs) with a near-infrared (NIR) light absorption were prepared by the nano-emulsion method to develop contrast agents for photo-acoustic (PA) imaging. The PNP containing silicon naphthalocyanine showed a high absorption coefficient up to 10(10) M(-1) cm(-1). This is comparable to plasmonic gold nano-particles, which have been studied as PA contrast agents. For the PNP larger than 100 nm, the enhancement of the PA signal was observed compared to the gold nano-particle with a similar absorption coefficient and size. In the case of the PNP, the heat by the light absorption is confined in the particle due to the low thermal diffusivity of polymer materials. We showed that the strong thermal confinement effect of PNP results in the enhancement of the efficiency of the PA signal generation and that the PA intensity can be enhanced by the increase of the Grüneisen parameter of the matrix polymer of PNP. The PA signal from the PNP of poly(methyl methacrylate) was 9-fold larger than that of gold nano-particles with the same absorption coefficient. We demonstrated that in the in vivo PA imaging the detection limit of PNP was of the order of 10(-13) M. The NIR absorbing PNP will be a promising candidate of a sensitive contrast agent for PA imaging. |
Bundle InformationProducts in this bundle:
Originally designed for Swedish school children in 1978, the K?nken has since become a most well-loved and iconic backpack for children and adults around the world.Made from our durable Vinylon F fabric, which repels moisture better than any other synthetic fabric, the K?nken is unparalleled in its functionality and design.
It's Klean Kanteen's most popular size! The 27oz Classic is ideal for busy, on-the-go folks. Klean's leakproof Loop Cap safeguards your bag or purse. The bottle itself is made of food-grade 18/8 stainless steel that is highly durable and easy to clean.
Product Information
Originally designed for Swedish school children in 1978, the Kanken has since become a most well-loved and iconic backpack for children and adults around the world.Made from our durable Vinylon F fabric, which repels moisture better than any other synthetic fabric, the Knken is unparalleled in its functionality and design. Comes with FREE 27oz Stainless Steel Water Bottle.
Product Features
Comes with FREE 27oz Stainless Steel Water Bottle
Made from durable Vinylon F fabric, which repels moisture better than any other synthetic fabric |
Jeans
From Raw denim to stretch skinnys the right pair of denim jeans are everything to completing your outfit. Here at Xile we like to pride ourselves on being denim specialists and bringing the latest styles to you from some of the top jean brands around including Replay, PRPS, Only & Sons, Edwin, Scotch & Soda and Armani.
No matter what style you are looking for we have your jeans needs sorted with the all the latest releases. In the past decade denim has come a long way and the Xile Jean selection showcases some of the best innovations around. From comfort stretch fits with a cotton elastane construction to Arc pants designed to fit the wearers body shape perfectly. If it's classic that you are looking for then check out our straight, raw denim options from Edwin and Replay.
Make sure to refresh your wardrobe with fresh washes which match the occassion and season. A pair of slim black denims are sure to smarten up any outfit while a bold blue wash is perfect for the Winter time. With free UK delivery on orders over £75 and 15% off your first order the Xile Denim store is the perfect place to upgrade your wardrobe. |
---
http_interactions:
- request:
method: get
uri: https://api.compound.finance/api/v2/ctoken?meta=false
body:
encoding: UTF-8
string: ''
headers:
Connection:
- close
Host:
- api.compound.finance
User-Agent:
- http.rb/5.0.0.pre
response:
status:
code: 200
message: OK
headers:
Date:
- Tue, 03 Mar 2020 04:37:05 GMT
Content-Type:
- application/json; charset=utf-8
Content-Length:
- '6573'
Connection:
- close
Set-Cookie:
- __cfduid=d3c0b0014bd888aa53e3b8deebe95fd641583210225; expires=Thu, 02-Apr-20
04:37:05 GMT; path=/; domain=.compound.finance; HttpOnly; SameSite=Lax; Secure
Cf-Ray:
- 56e0a902fa88a99a-SIN
Accept-Ranges:
- bytes
Access-Control-Allow-Origin:
- "*"
Cache-Control:
- public, max-age=30
Via:
- 1.1 google
Cf-Cache-Status:
- EXPIRED
Access-Control-Allow-Credentials:
- 'true'
Access-Control-Allow-Headers:
- Content-Type
Access-Control-Allow-Methods:
- GET, POST
Access-Control-Expose-Headers:
- ''
Alt-Svc:
- clear
Expect-Ct:
- max-age=604800, report-uri="https://report-uri.cloudflare.com/cdn-cgi/beacon/expect-ct"
X-Request-Id:
- FfixT8k9QK8FfXABDymR
Server:
- cloudflare
body:
encoding: UTF-8
string: '{"cToken":[{"borrow_rate":{"value":"0.023151414073142777670690379"},"cash":{"value":"994820.475645105955637038"},"collateral_factor":{"value":"0.40000000000000000"},"exchange_rate":{"value":"0.020036000349623931"},"interest_rate_model_address":"0xbae04cbf96391086dc643e842b517734e214d698","name":"Compound
Augur","number_of_borrowers":130,"number_of_suppliers":1308,"reserves":{"value":"13.69579700128401850830000000"},"supply_rate":{"value":"0.000198339682411236356328792"},"symbol":"cREP","token_address":"0x158079ee67fce2f58472a96584a73c7ab9ac95c1","total_borrows":{"value":"9670.581838349253794744"},"total_supply":{"value":"50133626.67990309"},"underlying_address":"0x1985365e9f78359a9b6ad760e32412f4a445e862","underlying_name":"Augur","underlying_price":{"value":"0.050266235000000000"},"underlying_symbol":"REP"},{"borrow_rate":{"value":"0.078598559238493546708559057"},"cash":{"value":"15396960.001166"},"collateral_factor":{"value":"0.75000000000000000"},"exchange_rate":{"value":"0.020983693494655912"},"interest_rate_model_address":"0x0c3f8df27e1a00b47653fde878d68d35f00714c0","name":"Compound
USD Coin","number_of_borrowers":458,"number_of_suppliers":3934,"reserves":{"value":"102642.8419741000000000000000"},"supply_rate":{"value":"0.040952477145917216012279394"},"symbol":"cUSDC","token_address":"0x39aa39c021dfbae8fac545936693ac917d5e7563","total_borrows":{"value":"19335958.394110"},"total_supply":{"value":"1650342231.79640831"},"underlying_address":"0xa0b86991c6218b36c1d19d4a2e9eb0ce3606eb48","underlying_name":"USD
Coin","underlying_price":{"value":"0.004421452889419463000000000000"},"underlying_symbol":"USDC"},{"borrow_rate":{"value":"0.020526458880515066047924214"},"cash":{"value":"526383.119416215176753701"},"collateral_factor":{"value":"0.75000000000000000"},"exchange_rate":{"value":"0.020011466912123433"},"interest_rate_model_address":"0x0c3f8df27e1a00b47653fde878d68d35f00714c0","name":"Compound
Ether","number_of_borrowers":308,"number_of_suppliers":4071,"reserves":{"value":"7.491272952424284828400000000"},"supply_rate":{"value":"0.000058374755019012046940051"},"symbol":"cETH","token_address":"0x4ddc2d193948926d02f9b1fe9e1daa0718270ed5","total_borrows":{"value":"1685.573379302160151037"},"total_supply":{"value":"26387930.67202148"},"underlying_address":null,"underlying_name":"Ether","underlying_price":{"value":"1"},"underlying_symbol":"ETH"},{"borrow_rate":{"value":"0.084836943749958268166165998"},"cash":{"value":"7609814.257315822674923486"},"collateral_factor":{"value":"0.75000000000000000"},"exchange_rate":{"value":"0.020296086361401981"},"interest_rate_model_address":"0xec163986cc9a6593d6addcbff5509430d348030f","name":"Compound
Dai","number_of_borrowers":511,"number_of_suppliers":5060,"reserves":{"value":"162778.1061610809427884702500"},"supply_rate":{"value":"0.080748207623138294868235950"},"symbol":"cDAI","token_address":"0x5d3a536e4d6dbd6114cc1ead35777bab948e3643","total_borrows":{"value":"24774353.219711187887182509"},"total_supply":{"value":"1587566627.23621717"},"underlying_address":"0x6b175474e89094c44da98b954eedeac495271d0f","underlying_name":"DAI","underlying_price":{"value":"0.004481912684812349"},"underlying_symbol":"DAI"},{"borrow_rate":{"value":"0.037900888698239322897132902"},"cash":{"value":"5737703.248956299633200623"},"collateral_factor":{"value":"0.60000000000000000"},"exchange_rate":{"value":"0.020219473386521282"},"interest_rate_model_address":"0xbae04cbf96391086dc643e842b517734e214d698","name":"Compound
Basic Attention Token","number_of_borrowers":142,"number_of_suppliers":2152,"reserves":{"value":"1012.105106316127708732100000"},"supply_rate":{"value":"0.001922036902939392894590155"},"symbol":"cBAT","token_address":"0x6c8c6b02e7b2be14d4fa6022dfd6d75921d90e4e","total_borrows":{"value":"349016.421730522559346151"},"total_supply":{"value":"300982495.89612775"},"underlying_address":"0x0d8775f648430679a709e98d2b0cb6250d2887ef","underlying_name":"Basic
Attention Token","underlying_price":{"value":"0.000960412500000000"},"underlying_symbol":"BAT"},{"borrow_rate":{"value":"0.041550627006252823045165494"},"cash":{"value":"4869947.018937880289128120"},"collateral_factor":{"value":"0.60000000000000000"},"exchange_rate":{"value":"0.020056442980580916"},"interest_rate_model_address":"0xbae04cbf96391086dc643e842b517734e214d698","name":"Compound
0x","number_of_borrowers":94,"number_of_suppliers":1641,"reserves":{"value":"1922.955991944949182516800000"},"supply_rate":{"value":"0.002533966046275505184610518"},"symbol":"cZRX","token_address":"0xb3319f5d18bc0d84dd1b4825dcde5d5f7266d407","total_borrows":{"value":"361171.424935805550519128"},"total_supply":{"value":"260723972.48828027"},"underlying_address":"0xe41d2489571d322189246dafa5ebde1f4699f498","underlying_name":"0x","underlying_price":{"value":"0.001050186666666666"},"underlying_symbol":"ZRX"},{"borrow_rate":{"value":"0.025743384446757566673759980"},"cash":{"value":"175.28478685"},"collateral_factor":{"value":"0"},"exchange_rate":{"value":"0.020104840971577156"},"interest_rate_model_address":"0xbae04cbf96391086dc643e842b517734e214d698","name":"Compound
Wrapped BTC","number_of_borrowers":78,"number_of_suppliers":1366,"reserves":{"value":"0.0816727330000000000000000"},"supply_rate":{"value":"0.000413463654725885728058961"},"symbol":"cWBTC","token_address":"0xc11b1268c1a384e55c48c2391d8d480264a3a7f4","total_borrows":{"value":"3.22416191"},"total_supply":{"value":"8874.84145150"},"underlying_address":"0x2260fac5e5542a773aa44fbcfedf7c193bc2c599","underlying_name":"Wrapped
BTC","underlying_price":{"value":"38.40909698782718500000000000"},"underlying_symbol":"WBTC"},{"borrow_rate":{"value":"0.103790690267905280928731345"},"cash":{"value":"1128628.710637571998366506"},"collateral_factor":{"value":"0.75000000000000000"},"exchange_rate":{"value":"0.021278707695888586"},"interest_rate_model_address":"0xa1046abfc2598f48c44fb320d281d3f3c0733c9a","name":"Compound
Sai","number_of_borrowers":398,"number_of_suppliers":6723,"reserves":{"value":"27314.45175214579481896740000"},"supply_rate":{"value":"0.039438879219475146308901807"},"symbol":"cSAI","token_address":"0xf5dce57282a584d2746faf1593d3121fcac444dc","total_borrows":{"value":"772585.139671040095433950"},"total_supply":{"value":"88064530.29657135"},"underlying_address":"0x89d24a6b4ccb1b6faa2625fe562bdd9a23260359","underlying_name":"Sai
(Legacy Dai)","underlying_price":{"value":"0.004481912684812349"},"underlying_symbol":"SAI"}],"error":null,"meta":null,"request":{"addresses":[],"block_number":0,"block_timestamp":0,"meta":"false","network":"mainnet"}}'
http_version:
recorded_at: Tue, 03 Mar 2020 04:37:05 GMT
recorded_with: VCR 4.0.0
|
The molecular mechanisms involved in DNA replication are not yet fully understood because a well defined in vitro system capable of carrying out the entire replication process of double-stranded DNA molecules has not been available. We have recently assembled the purified replication proteins coded by the bacteriophage T4 into in vitro apparatuses capable of efficient replication of double-stranded DNA templates by a process that is semiconservative, discontinuous, faithful and generates product molecules lacking rapidly renaturable hairpin areas. It is planned to use this system composed of 6 extremely pure proteins and pure DNA molecules to approach some of the unanswered problems in replication. We plan to analyze the factors involved in generating the amazingly high fidelity observed in DNA duplication. Using this system we would also determine the special features in the double-stranded DNA template that are recognized by the complex of the replication proteins resulting in the initiation of DNA synthesis. In vivo, DNA exists in a tightly folded complex with proteins and the cell membrane. Using gentle lysis conditions in the presence of low salt and counterions, I have recently isolated the intracellular T4 DNA as compact DNA-protein complexes that serve as excellent templates for in vitro DNA synthesis. This synthesis is further stimulated by the addition of the 6 purified replication proteins. Using this more natural template, we shall study the roles played by the various accessory proteins coded by the phage (the products of DNA-delay and DNA-arrest genes, some of which are membrane components) in DNA replication. It is hoped that these studies will not only lead to a clearer understanding of the mechanism of DNA-replication in prokaryotic cells but will also help us develop methods to identify and isolate proteins carrying out similar processes in eukaryotic cells. |
! Copyright (C) 2013 Imagination Technologies Ltd.
! Licensed under LGPL v2.1 or later, see the file COPYING.LIB in this tarball.
#include <features.h>
.text
.global _strcmp
.type _strcmp,function
!D1Ar1 s1
!D0Ar2 s2
_strcmp:
TST D1Ar1,#3
TSTZ D0Ar2,#3
MOVT D1Re0,#0x0101
ADD D1Re0,D1Re0,#0x0101
BNZ $Lstrcmp_slow
GETD D1Ar3,[D1Ar1+#4++] ! Load 32-bits from s1
GETD D1Ar5,[D0Ar2+#4++] ! Load 32-bits from s2
LSL D0FrT,D1Re0,#7 ! D0FrT = 0x80808080
$Lstrcmp4_loop:
SUB D0Re0,D1Ar3,D1Re0 ! D1Re0 = 0x01010101
MOV D0Ar6,D1Ar3
SUBS D0Ar4,D1Ar3,D1Ar5 ! Calculate difference
XOR D0Ar6,D0Ar6,#-1
GETD D1Ar3,[D1Ar1+#4++] ! Load 32-bits from s1
AND D0Re0,D0Re0,D0Ar6
ANDSZ D0Ar6,D0Re0,D0FrT ! D0FrT = 0x80808080
GETD D1Ar5,[D0Ar2+#4++] ! Load 32-bits from s2
BZ $Lstrcmp4_loop
AND D0Ar6, D0Re0, D0FrT ! D0FrT = 0x80808080
!
! Either they are different or they both contain a NULL + junk
!
$Lstrcmp4_end:
LSLS D0Re0,D0Ar4,#24 ! Was Byte[0] the same?
LSLSZ D0Ar2,D0Ar6,#24 ! Yes: AND they where not zero?
LSLSZ D0Re0,D0Ar4,#16 ! Yes: Was Byte[1] the same?
LSLSZ D0Ar2,D0Ar6,#16 ! Yes: AND they where not zero?
LSLSZ D0Re0,D0Ar4,#8 ! Tes: Was Byte[2] the same?
LSLSZ D0Ar2,D0Ar6,#8 ! Yes: AND they where not zero?
MOVZ D0Re0,D0Ar4 ! Yes: Must by Byte[3] thats the result
ASR D0Re0,D0Re0,#24 ! Sign extend result to integer
MOV PC,D1RtP
!
! Misaligned case, byte at a time
!
$Lstrcmp_slow:
GETB D1Ar3,[D1Ar1++] ! Load char from s1
GETB D1Ar5,[D0Ar2++] ! Load char from s2
CMP D1Ar3,#1 ! Null -> C and NZ, rest -> NC (\1->Z)
CMPNC D1Ar3,D1Ar5 ! NOT Null: Same -> Z, else -> NZ
BZ $Lstrcmp_slow ! NOT Null and Same: Loop
SUB D0Re0,D1Ar3,D1Ar5 ! Generate result
MOV PC,D1RtP
.size _strcmp,.-_strcmp
libc_hidden_def(strcmp)
#ifndef __UCLIBC_HAS_LOCALE__
strong_alias(strcmp,strcoll)
libc_hidden_def(strcoll)
#endif
|
<?php
/**
* Smarty plugin
*
* @package Smarty
* @subpackage PluginsFunction
*/
/**
* Smarty {html_image} function plugin
* Type: function
* Name: html_image
* Date: Feb 24, 2003
* Purpose: format HTML tags for the image
* Examples: {html_image file="/images/masthead.gif"}
* Output: <img src="/images/masthead.gif" width=400 height=23>
* Params:
*
* - file - (required) - file (and path) of image
* - height - (optional) - image height (default actual height)
* - width - (optional) - image width (default actual width)
* - basedir - (optional) - base directory for absolute paths, default is environment variable DOCUMENT_ROOT
* - path_prefix - prefix for path output (optional, default empty)
*
* @link http://www.smarty.net/manual/en/language.function.html.image.php {html_image}
* (Smarty online manual)
* @author Monte Ohrt <monte at ohrt dot com>
* @author credits to Duda <duda@big.hu>
* @version 1.0
*
* @param array $params parameters
* @param Smarty_Internal_Template $template template object
*
* @throws SmartyException
* @return string
* @uses smarty_function_escape_special_chars()
*/
function smarty_function_html_image($params, Smarty_Internal_Template $template)
{
$template->_checkPlugins(
array(
array(
'function' => 'smarty_function_escape_special_chars',
'file' => SMARTY_PLUGINS_DIR . 'shared.escape_special_chars.php'
)
)
);
$alt = '';
$file = '';
$height = '';
$width = '';
$extra = '';
$prefix = '';
$suffix = '';
$path_prefix = '';
$basedir = isset($_SERVER[ 'DOCUMENT_ROOT' ]) ? $_SERVER[ 'DOCUMENT_ROOT' ] : '';
foreach ($params as $_key => $_val) {
switch ($_key) {
case 'file':
case 'height':
case 'width':
case 'dpi':
case 'path_prefix':
case 'basedir':
$$_key = $_val;
break;
case 'alt':
if (!is_array($_val)) {
$$_key = smarty_function_escape_special_chars($_val);
} else {
throw new SmartyException(
"html_image: extra attribute '{$_key}' cannot be an array",
E_USER_NOTICE
);
}
break;
case 'link':
case 'href':
$prefix = '<a href="' . $_val . '">';
$suffix = '</a>';
break;
default:
if (!is_array($_val)) {
$extra .= ' ' . $_key . '="' . smarty_function_escape_special_chars($_val) . '"';
} else {
throw new SmartyException(
"html_image: extra attribute '{$_key}' cannot be an array",
E_USER_NOTICE
);
}
break;
}
}
if (empty($file)) {
trigger_error('html_image: missing \'file\' parameter', E_USER_NOTICE);
return;
}
if ($file[ 0 ] === '/') {
$_image_path = $basedir . $file;
} else {
$_image_path = $file;
}
// strip file protocol
if (stripos($params[ 'file' ], 'file://') === 0) {
$params[ 'file' ] = substr($params[ 'file' ], 7);
}
$protocol = strpos($params[ 'file' ], '://');
if ($protocol !== false) {
$protocol = strtolower(substr($params[ 'file' ], 0, $protocol));
}
if (isset($template->smarty->security_policy)) {
if ($protocol) {
// remote resource (or php stream, …)
if (!$template->smarty->security_policy->isTrustedUri($params[ 'file' ])) {
return;
}
} else {
// local file
if (!$template->smarty->security_policy->isTrustedResourceDir($_image_path)) {
return;
}
}
}
if (!isset($params[ 'width' ]) || !isset($params[ 'height' ])) {
// FIXME: (rodneyrehm) getimagesize() loads the complete file off a remote resource, use custom [jpg,png,gif]header reader!
if (!$_image_data = @getimagesize($_image_path)) {
if (!file_exists($_image_path)) {
trigger_error("html_image: unable to find '{$_image_path}'", E_USER_NOTICE);
return;
} elseif (!is_readable($_image_path)) {
trigger_error("html_image: unable to read '{$_image_path}'", E_USER_NOTICE);
return;
} else {
trigger_error("html_image: '{$_image_path}' is not a valid image file", E_USER_NOTICE);
return;
}
}
if (!isset($params[ 'width' ])) {
$width = $_image_data[ 0 ];
}
if (!isset($params[ 'height' ])) {
$height = $_image_data[ 1 ];
}
}
if (isset($params[ 'dpi' ])) {
if (strstr($_SERVER[ 'HTTP_USER_AGENT' ], 'Mac')) {
// FIXME: (rodneyrehm) wrong dpi assumption
// don't know who thought this up… even if it was true in 1998, it's definitely wrong in 2011.
$dpi_default = 72;
} else {
$dpi_default = 96;
}
$_resize = $dpi_default / $params[ 'dpi' ];
$width = round($width * $_resize);
$height = round($height * $_resize);
}
return $prefix . '<img src="' . $path_prefix . $file . '" alt="' . $alt . '" width="' . $width . '" height="' .
$height . '"' . $extra . ' />' . $suffix;
}
|
More than 130 members of the Boko Haram terrorist group have surrendered to Nigeria's military.
Mohammed Bashir, a man who had posed as the group’s leader Abubakar Shekau in numerous videos, was also been killed in clashes, the military said on Wednesday.
Defence spokesman Major-General Chris Olukolade said: “In the course of those encounters, one Mohammed Bashir, who has been acting or posing on videos as the deceased Abubakar Shekau ... known as leader of the group, died.”
Following the surrender, Nigeria's military has released photographs of dozens of detainees sitting on the floor and the alleged body of the leader.
Over the past five years, the group has killed thousands of people in guerrilla attacks on military installations and against civilians. In the past two months, its ambitions have grown as it has started to seize and hold ground in Nigeria.
After members of the extremist group seized several small towns and declared the area an Isis-style ‘Islamic Caliphate’, Nigeria’s army stepped up its military operations in the rural northeast.
The Nigerian army said that 135 Boko Haram fighters had handed their weapons to troops on Tuesday in the town of Biu, near the epicentre of Boko Haram’s campaign to carve out an extremist Islamist state.
Reports from BBC News citing the country’s military claimed the number was as high as 260, as a further 133 members reportedly surrendered in north-eastern Nigeria.
Last August, Nigeria's military said Shekau may have died of gunshot wounds some weeks after a clash with soldiers.
Following the reports, the man appearing in Boko Haram videos appeared to look different, with a rounder, less narrow face and a wider nose.
In pictures: Nigeria kidnapped schoolgirls Show all 35 1 /35 In pictures: Nigeria kidnapped schoolgirls In pictures: Nigeria kidnapped schoolgirls Nigeria A total of 276 girls were abducted from the northeastern town of Chibok, in Borno state, which has a sizeable Christian community. Some 223 are still missing In pictures: Nigeria kidnapped schoolgirls Nigeria One of the kidnapped girls looks into a camera In pictures: Nigeria kidnapped schoolgirls Nigeria One of the missing girls talking to the camera In pictures: Nigeria kidnapped schoolgirls Nigeria The missing Nigerian schoolgirls, wearing the full-length hijab and praying in an undisclosed rural location. Boko Haram alleging they had converted them to Islam In pictures: Nigeria kidnapped schoolgirls Nigeria Girls wearing the full-length hijab holding a flag reading "There is no god, but Allah" and "Mohammed is Allah's prophet" In pictures: Nigeria kidnapped schoolgirls Nigeria A man claiming to be the leader of Nigerian Islamist extremist group Boko Haram Abubakar Shekau In pictures: Nigeria kidnapped schoolgirls Nigeria Abubakar Shekau speaks on the video In pictures: Nigeria kidnapped schoolgirls Nigeria Girls, wearing the full-length hijab and praying are filmed by an unidentified man (R) in an undisclosed rural location In pictures: Nigeria kidnapped schoolgirls Nigeria Soldiers lead the way as Chibok residents carry placards to protest the abduction of the missing schoolgirls in Maiduguri In pictures: Nigeria kidnapped schoolgirls Nigeria People carry signs as they attend a protest demanding the release of abducted secondary school girls in the remote village of Chibok in Lagos In pictures: Nigeria kidnapped schoolgirls UK Demonstrators hold banners as they protest about the kidnapping of girls in Nigeria, near the Nigerian High Commission in London In pictures: Nigeria kidnapped schoolgirls UK A protester demonstrates against the kidnapping of school girls in Nigeria, outside the Nigerian Embassy in London In pictures: Nigeria kidnapped schoolgirls UK Chief International Correspondent Christiane Amanpour and Prime Minister David Cameron appearing on the BBC1 current affairs programme In pictures: Nigeria kidnapped schoolgirls USA People participate in a "Bring Back Our Girls" campaign demonstration and candlelight vigil in Los Angeles In pictures: Nigeria kidnapped schoolgirls USA Girls holding heart shaped banners in a "Bring Back Our Girls" campaign demonstration and candlelight vigil in Los Angeles In pictures: Nigeria kidnapped schoolgirls South Africa South Africans protest in solidarity against the abduction of hundreds of schoolgirls in Nigeria by the Muslim extremist group Boko Haram and what protesters said was the failure of the Nigerian government and international community to rescue them, during a march to the Nigerian Consulate in Johannesburg In pictures: Nigeria kidnapped schoolgirls South Africa The kidnapping has ignited a viral social media campaign that has brought renewed attention to Boko Haram's campaign of violence, and protests around the world In pictures: Nigeria kidnapped schoolgirls South Africa Some of the hundreds of protests demonstrate outside the Nigeria Consulate to bring attention to the girls abducted in Nigeria, Johannesburg In pictures: Nigeria kidnapped schoolgirls South Africa South Africans from various civil society organisations protest in support of the Nigerian abducted Chibok school girls outside the South African parliament in Cape Town In pictures: Nigeria kidnapped schoolgirls Sri Lanka Participants chant slogans and hold placards during a protest to demand the return of hundreds of school girls abducted by the Boko Haram separatist group at the World Conference on Youth 2014, hosted by Sri Lanka in Colombo In pictures: Nigeria kidnapped schoolgirls USA Karilyn Coates (10) joins others in a candlelight vigil for the more than 300 girls abducted by Boko Haram in Nigeria, at All Souls Unitarian Church in Colorado Springs In pictures: Nigeria kidnapped schoolgirls USA Mia Kuumba, of the District of Columbia, brandishes a wooden stick during a rally in front of the Nigerian embassy in northwest Washington In pictures: Nigeria kidnapped schoolgirls Nigeria Mothers of the missing Chibok school girls abducted by Boko Haram Islamists gather to receive informations from officials. Nigeria's president said that Boko Haram's mass abduction of more than 200 schoolgirls would mark a turning point in the battle against the Islamists, as world powers joined the search to rescue the hostages In pictures: Nigeria kidnapped schoolgirls Nigeria Nana Shettima, the wife of Borno Governor, Kashim Shettima (C) weeps as she speaks with school girls from the government secondary school Chibok that were kidnapped by the Islamic extremist group Boko Haram, and later escaped in Chibok In pictures: Nigeria kidnapped schoolgirls Nigeria Leader of Chibok community in Abuja Hosea Sambido (R) raises a newspaper reporting the death of two of the abducted Chibok school girls during a rally pressing for the girls' release in Abuja, ahead of World Economic Forum In pictures: Nigeria kidnapped schoolgirls Nigeria Femi Falana, a lawyer and human rights activist (C) leads a mass-demonstration calling on the government to increase efforts to rescue the hundreds of missing kidnapped school girls of a government secondary school Chibok in Lagos In pictures: Nigeria kidnapped schoolgirls Nigeria Members of Lagos based civil society groups shout slogans calling for the release of missing Chibok school girls at the state government house in Lagos In pictures: Nigeria kidnapped schoolgirls Nigeria The Islamist group Boko Haram has claimed responsibility for abducting over 200 girls from their school in Chibok, Borno state. Nigerian police offered a reward of 50 million naira (about 310,000 US dollar) to anyone providing a lead on the whereabouts of the more than 200 school girls abducted by Islamist extremist group Boko Haram. Nigerian President Goodluck Jonathan has accepted an offer of help from the United States in tracking down and fighting the terrorists, US officials said In pictures: Nigeria kidnapped schoolgirls Nigeria Nigerians protest over the government's failure to rescue the abducted Chibok school girls in Port Harcourt In pictures: Nigeria kidnapped schoolgirls Nigeria Former Nigerian Education Minister and Vice-President of the World Bank's Africa division (3rd L) Obiageli Ezekwesilieze speaks as she leads a march of Nigeria women and mothers of the kidnapped girls of Chibok, calling for their freedom in Abuja In pictures: Nigeria kidnapped schoolgirls Bring Back Our Girls Michelle Obama tweeted a picture of her supporting the #BringBackOurGirls campaign Twitter In pictures: Nigeria kidnapped schoolgirls Bring Back Our Girls Malala joined calls for the kidnapped girls to be found Twitter/Malala Fund In pictures: Nigeria kidnapped schoolgirls Bring Back Our Girls Leona lewis supports #BringBackOurGirls campaign In pictures: Nigeria kidnapped schoolgirls Bring Back Our Girls Kelly Hoppen tweeted: 'Please make sure you do this, we must stand together and not forget them' In pictures: Nigeria kidnapped schoolgirls Bring Back Our Girls E.L. Rock Star tweeted: 'Join The Movement'
As the group has transformed from a radical but relatively peaceful clerical movement to an insurrection, Shekau had appeared in a number of videos issuing threats and taunting the authorities.
In one such clip, he claimed responsibility for the abduction of 200 schoolgirls from the remote village of Chibok in April, which sparked an international outcry and the '#BringBackOurGirls' social media campaign. The majority remain in captivity.
The surrender comes after one of the more than 200 schoolgirls abducted was freed this week, according to police and a parent of some of the other missing girls.
She is receiving medical attention after she was found running in a village, having spent four days in the bush, said a parent, who has two girls still with the insurgents and who declined to be named. |
Reductions in corticotropin releasing factor-like immunoreactivity in cerebral cortex in Alzheimer's disease, Parkinson's disease, and progressive supranuclear palsy.
Dementias occurring in Alzheimer's disease, Parkinson's disease, and progressive supranuclear palsy are associated with dysfunction and death of neurons in a variety of cell populations, including cholinergic, monoaminergic, and peptidergic systems. In the present investigation of these three disorders, we demonstrated decreased levels of corticotropin releasing factor (CRF)-like immunoreactivity in the frontal, temporal, and occipital poles of the neocortex. Moreover, reductions in peptidergic immunoreactivity correlated with reductions in the activity of choline acetyltransferase, the enzyme that catalyzes the formation of acetylcholine. The reduction in cortical CRF levels may be due to abnormalities of intrinsic cortical neurons or to dysfunction in neurons that contain CRF and innervate cortex. |
function act(c) {
c.expected = {};
c.discriminatorSql = '';
c.newDiscriminatorSql.expect(c.table, c.alias).return(c.discriminatorSql);
c.newSingleCommandCore.expect(c.table, c.subFilter, c.alias).return(c.expected);
c.returned = c.newSut(c.table, c.initialFilter, c.relations);
}
module.exports = act;
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.