Context: Harvard's 209-acre (85 ha) main campus is centered on Harvard Yard in Cambridge, about 3 miles (5 km) west-northwest of the State House in downtown Boston, and extends into the surrounding Harvard Square neighborhood. Harvard Yard itself contains the central administrative offices and main libraries of the university, academic buildings including Sever Hall and University Hall, Memorial Church, and the majority of the freshman dormitories. Sophomore, junior, and senior undergraduates live in twelve residential Houses, nine of which are south of Harvard Yard along or near the Charles River. The other three are located in a residential neighborhood half a mile northwest of the Yard at the Quadrangle (commonly referred to as the Quad), which formerly housed Radcliffe College students until Radcliffe merged its residential system with Harvard. Each residential house contains rooms for undergraduates, House masters, and resident tutors, as well as a dining hall and library. The facilities were made possible by a gift from Yale University alumnus Edward Harkness.

Question: How many residential dorms house upper class, sophomore, Jr, and Sr students?


Context: All of these processes do not necessarily occur in a single environment, and do not necessarily occur in a single order. The Hawaiian Islands, for example, consist almost entirely of layered basaltic lava flows. The sedimentary sequences of the mid-continental United States and the Grand Canyon in the southwestern United States contain almost-undeformed stacks of sedimentary rocks that have remained in place since Cambrian time. Other areas are much more geologically complex. In the southwestern United States, sedimentary, volcanic, and intrusive rocks have been metamorphosed, faulted, foliated, and folded. Even older rocks, such as the Acasta gneiss of the Slave craton in northwestern Canada, the oldest known rock in the world have been metamorphosed to the point where their origin is undiscernable without laboratory analysis. In addition, these processes can occur in stages. In many places, the Grand Canyon in the southwestern United States being a very visible example, the lower rock units were metamorphosed and deformed, and then deformation ended and the upper, undeformed units were deposited. Although any amount of rock emplacement and rock deformation can occur, and they can occur any number of times, these concepts provide a guide to understanding the geological history of an area.

Question: What has happened to the the rock in the Grand Canyon that is the oldest rock in the world?


Context: Cultural imperialism is when a country's influence is felt in social and cultural circles, i.e. its soft power, such that it changes the moral, cultural and societal worldview of another. This is more than just "foreign" music, television or film becoming popular with young people, but that popular culture changing their own expectations of life and their desire for their own country to become more like the foreign country depicted. For example, depictions of opulent American lifestyles in the soap opera Dallas during the Cold War changed the expectations of Romanians; a more recent example is the influence of smuggled South Korean drama series in North Korea. The importance of soft power is not lost on authoritarian regimes, fighting such influence with bans on foreign popular culture, control of the internet and unauthorised satellite dishes etc. Nor is such a usage of culture recent, as part of Roman imperialism local elites would be exposed to the benefits and luxuries of Roman culture and lifestyle, with the aim that they would then become willing participants.

Question: Which American did not show changed the views of Romanians during the cold war?


Context: One of the claimants of the English throne opposing William the Conqueror, Edgar Atheling, eventually fled to Scotland. King Malcolm III of Scotland married Edgar's sister Margaret, and came into opposition to William who had already disputed Scotland's southern borders. William invaded Scotland in 1072, riding as far as Abernethy where he met up with his fleet of ships. Malcolm submitted, paid homage to William and surrendered his son Duncan as a hostage, beginning a series of arguments as to whether the Scottish Crown owed allegiance to the King of England.

Question: Who was Margaret's brother?


Context: Between Bingen and Bonn, the Middle Rhine flows through the Rhine Gorge, a formation which was created by erosion. The rate of erosion equaled the uplift in the region, such that the river was left at about its original level while the surrounding lands raised. The gorge is quite deep and is the stretch of the river which is known for its many castles and vineyards. It is a UNESCO World Heritage Site (2002) and known as "the Romantic Rhine", with more than 40 castles and fortresses from the Middle Ages and many quaint and lovely country villages.

Question: What flows after Bingen and Bonn?


Myanmar 's pro-democracy leader Aung San Suu Kyi will return home late Friday but will remain in detention after recovering from surgery at a Yangon hospital , her personal physician said .

Myanmar 's pro-democracy leader Aung San Suu Kyi will be kept under house arrest following her release from a hospital where she underwent surgery , her personal physician said Friday .


Robert Walsh , 40 , remained in critical but stable condition Friday at Staten Island University Hospital 's north campus .

Walsh , also 40 , was in critical but stable condition at Staten Island University Hospital last night .


In fiction : Edward P. Jones ( " The Known World " ) and Scott Spencer ( " A Ship Made of Paper " ) .

The fifth nominee for fiction is Scott Spencer , for A Ship Made of Paper .


Because of the accounting charge , the company now says it lost $ 1.04 billion , or 32 cents a share , in the quarter ended June 30 .

Including the charge , the Santa Clara , Calif.-based company said Monday it lost $ 1.04 billion , or 32 cents per share , in the period ending June 30 .


The top rate will go to 4.45 percent for all residents with taxable incomes above $ 500,000 .

For residents with incomes above $ 500,000 , the income-tax rate will increase to 4.45 percent .


The S & P / TSX composite rose 87.74 points on the week , while the TSX Venture Exchange composite gained 44.49 points .

On the week , the Dow Jones industrial average rose 11.56 points , while the Nasdaq Stock Market gained 39.42 points .


Nearly 300 mutinous troops who seized a Manila shopping and apartment complex demanding the government resign gave up and retreated peacefully after some 19 hours .

Mutinous troops who seized a Manila shopping and apartment complex demanding the government resign ended a 19-hour standoff late Sunday and returned to barracks without a shot fired .


" Jeremy 's a good guy , " Barber said , adding : " Jeremy is living the dream life of the New York athlete .

He also said Shockey is " living the dream life of a New York athlete .


Carlson on Tuesday said he would not recuse himself from the case .

Service officials said Carlson refused to recuse himself from the case .


At community colleges , tuition will jump to $ 2,800 from $ 2,500 .

Community college students will see their tuition rise by $ 300 to $ 2,800 or 12 percent .


I don't want the item, I bought it on accident, can I get a refund?


locations to withdraw money


Why am I being charged twice fro a restaurant?


Is a non-electronic card available as well


Do I have to pay for topping up by transfer?


How do I enable contactless pay?


I checked the exchange rate when I withdrew cash. But the actual rate that you applied was different.


My card was taken from me


I cannot prove my own identity.


What kind of documents do I need for the identity check?


Rea Browning "Tony" Culpepper, 87, of Roanoke, went to be with the Lord on Monday, February 28, 2000. He was born in Norfolk and grew up in Charlottesville, moving to Richmond and eventually Roanoke. Tony graduated from Jefferson High School (Class of 1930), working for Turner Drug Company at the time. He was a salesman with Eisele and Company, and was in the U.S. Navy from 1942 to 1945, when he was honorably discharged. After World War II, Mr. Culpepper returned to his job with Eisele and Company, where he worked a total of 28 years. He then worked ten years for Reliance Equipment Company in Roanoke retiring in 1977. After retirement, Tony enjoyed playing golf at Countryside Golf Course, where he made two holes-in-one in 1990 and 1991. Mr. Culpepper enjoyed the fellowship of the Big Lick Kiwanis Club, and was president of the group in 1988. He was an active member of Second Presbyterian Church. Surviving are his wife of 57 years, Elizabeth Michael "Betty" Culpepper; a daughter and son-in-law, Marty and Mike Collingwood, Lexington; a son and daughter-in-law, Rea B. Culpepper, Jr. and Patricia, Charlottesville; five grandchildren, Cindy and Lauren Collingwood, Mike, Erin, and Dianna Cochran; two cousins, James E. McFarland, Jr., Charlottesville, Catherine Ellis, Scottsville. Funeral services will be conducted at 2 p.m. Wednesday from the chapel of Second Presbyterian Church with Dr. George C. Anderson and Dr. Julianne L. Hollingsworth officiating. Interment will follow in Evergreen Burial Park. Flowers are welcome, and memorials may be made to Second Presbyterian Church (214 Mountain Ave., S.W., Roanoke, Va. 24016) or a favorite charity. Friends may call after 2 p.m. Tuesday at Oakey's Roanoke Chapel where the family will be from 7 to 9 p.m. Tuesday.5


Check out our new site Makeup Addiction

add your own caption

add your own caption

add your own caption

add your own caption

add your own caption

add your own caption

add your own caption

add your own caption

add your own caption

add your own caption

add your own caption

not sure if a cartoon for kids... Or hentai porn...


Glutamate agonists for treating schizophrenia have affinity for dopamine D2High and D3 receptors.
Although the glutamate agonist LY 404,039 has been used to treat schizophrenia, its closest congener LY 379,268 has an affinity for both glutamate and dopamine (DA) D2(High) receptors. Considering that all antipsychotics act on dopamine receptors, and considering that another laboratory reported that LY 379,268 did not have any affinity for the D2(High) receptor, it was necessary to examine whether such glutamate agonists have an affinity for D2 and D3 dopamine receptors in vitro. The present data show that 50-200 nM LY 379,268 inhibited the binding of [(3)H]domperidone and [(3)H](+)PHNO to cloned dopamine D2 receptors consistently and reproducibly by 16% with dissociation constants of 2.1 and 2.5 nM at D2(High), respectively. In addition, LY 379,268 inhibited the binding of [(3)H]domperidone and [(3)H](+)PHNO to cloned dopamine D3 receptors with dissociation constants of 130 and 10 nM, respectively. LY 379,268 also inhibited the binding of [(3)H]domperidone to rat striata with a dissociation constant of 22 nM, predicting a clinical antipsychotic dose of 80-100 mg/day. LY 379,268 appears to act as an agonist at D2(High) and as an antagonist at D3, because guanine nucleotide eliminated the competition at D2(High) but had no effect on the competition at D3. The findings indicate that this type of glutamate agonist, LY 379,268, has a significant affinity for D2(High) and D3 receptors.


If there was ever a good reason to shovel antihistamines down your gullet before pressing play, the music of two hockey-playing, caravan-dwelling sisters who recorded their EP in a stable might be it. But before your eyes start to water, Hockeysmith are not about to usher in a new wave of faux-pastoral whimsy. Nor are they rich kids burning through their allowances under the ruse of "finding themselves" in the Cornish wilderness. Hockeysmith manage to distil isolation into noirish electropop, where siren-pure vocals are submerged in crunched up, distorted guitars and swarms of creepy, atonal synth. It's anything but prissy.

Not too long ago, however, Bristol natives Georgie (guitar) and Annie (keyboards) seemed destined for a life in shinpads and skorts. Georgie, a die-hard Nirvana fan, was first to ditch her hockey stick for an axe. Annie, a classical pianist and Destiny's Child and Christina Aguilera fangirl, got as far as the England Under 21s squad though and won a hockey scholarship to the University of Connecticut before music won out.

They're also a band whose surroundings seem to have seeped into their sounds. To make their music, the Hockeysmiths first decamped to an isolated vicarage in south Wales where the eeriness of the place inspired a dark undercurrent in their tracks. Then the sisters bought a caravan near Falmouth for the price of a month's rent in London, ripping out the breakfast bar to make way for surround-sound speakers, the empty fields absorbing endless beat-making experiments. With no Wi-Fi or any phone signal, the pair would stay late after cleaning shifts at a local restaurant to gen up on YouTube music-production tutorials.

Eventually, their campsite's landlord let them turn his stables into a studio and soon they had two tracks that they self-released on their label, Backabelly. They also found an empty fish factory to test those songs out live and began their word-of-mouth Hockey Nights, free parties attended by art students and a curious local called Aphex Twin.

They've played only three shows in what you might call "proper" venues so far but the buzz is already building, with an EP forthcoming on Double Denim and their first headline show this week. Here's hoping that, as they leave the flooded plains of the south-west behind for that other kind of wild in east London, they hold on to the untamed spirit that sets them apart.


A boy sitting in the doorway of a house in a slum .

A shirtless man with a hat works amid metal objects .


A rumpled-looking man carries a bundle of logs in front of a jungle .

a group of people are canoeing down a river through a rainforest .


The back of three people all wearing red vest that say prevention on them .

A group of people are standing on a platform and waiting for the subway train .


A man is being suspended in the air next to the window of a building which he is cleaning .

Two construction workers are sitting up on the side of a building .


two men in orange attire are cleaning up garbage on the street .

A group of people are around a pile of garbage .


A woman is knitting while sitting down at a table .

A woman in a bright fuchsia shirt and glasses is smiling broadly as she holds up a brown knitted item .


two men standing in the snow , one looking at the camera , the other reading a paper by a sign .

Winter enthusiast taking a break under a snow covered pine to enjoy a sandwich .


A little boy skating on his board and ready to take a flip .

A bow does a trick on his skateboard at a skate park .


Two young boys in swimming trunks are in the water looking at each other .

Three babies in hats are playing with toys on the beach .


A young man with a white shirt and bandanna around his neck holding two balloons with another man in the background crossing his arms .

One woman with blond-hair smiles in the foreground while another prepares to blow a noisemaker in the background .


The person trade-off method and the transitivity principle: an example from preferences over age weighting.

The person trade-off (PTO) is increasingly being used to elicit preferences in health.

This paper explores the measurement properties of the PTO method in the context of a study about how members of the public prioritise between patients of different ages.

In particular, it considers whether PTO responses satisfy the transitivity principle; that is, whether one PTO response can be inferred from two other PTO responses.

The results suggest that very few responses to PTO questions satisfy cardinal transitivity condition.

However, this study has produced results that suggest that cardinal transitivity will hold, on average, when respondents who fail to satisfy the ordinal transitivity condition have been excluded from the analysis.

This suggests that future PTO studies should build in checks for ordinal transitivity.


Economy of Azad Kashmir

The economy of Azad Kashmir (Pakistan Administered Kashmir, part of Kashmir administered by Pakistan, is largely a developing one.

The per capita income and provincial GDP estimates of Azad Kashmir are comparatively underrated when compared with development in other regions of the country although Azad Kashmir notably has a literacy rate that is substantially above the national average.

Azad Kashmir's economy is heavily dependent on agriculture, but also relies on remittances sent each year by members of the large Kashmiri diaspora.

The Kashmiris in the United Kingdom have contributed greatly to the development of Azad Kashmir through their in-flow of remittances.

In the southern districts, many men have been recruited into the Pakistani Armed Forces.

Other locals travel to countries in Europe or the Middle East where they work in labour-oriented jobs.

The local tourism industry has potential although is underdeveloped.

Challenges faced by Azad Kashmir's economy include the devastating 2005 Kashmir earthquake, the effects of which the region is still recovering from.

As of Sept 2013, Azad Kashmir's GDP was estimated at $3.2 Billion.

References

Category:Economy of Pakistan by province

{Hari}


Postoperative apnoea and latent myasthenia gravis.

Value of acetylcholine receptor antibody estimation in the differential diagnosis.

We report a case of alcuronium induced postoperative apnoea due to latent myasthenia gravis in a patient with no other clinical manifestations of the disease at presentation.

Acetylcholine receptor antibody estimation was used to confirm the diagnosis.


Foulcrey

Foulcrey  () is a commune in the Moselle department in Grand Est in north-eastern France.

See also

Communes of the Moselle department

Category:Communes of Moselle (department)


Descriptive Analysis is a method of sensory evaluation that identifies, describes and quantitates the sensory attributes of a product.

Descriptive Analysis is a valuable tool for providing information on appearance, aroma, flavor and/or texture of food products, and is used effectively for product and process development, shelf life studies, product improvement, quality assurance and control, and sensory-objective correlations in the food and flavor industry.

Each application is discussed with examples.


Two young guys with shaggy hair look at their hands while hanging out in the yard .


Two young , White males are outside near many bushes .


Two men in green shirts are standing in a yard .


A man in a blue shirt standing in a garden .


Several men in hard hats are operating a giant pulley system .


Workers look down from up above on a piece of equipment .


A child in a pink dress is climbing up a set of stairs in an entry way .


A little girl in a pink dress going into a wooden cabin .


Someone in a blue shirt and hat is standing on stair and leaning against a window .


A man in a blue shirt is standing on a ladder cleaning a window .


Context: def __init__(self, x, y, z, kind='linear', copy=True, bounds_error=False, fill_value=np.nan): """ Initialize a 2D interpolator.


Context: def Construct(s, ij=None, M=None ,N=None, nzmax=100, dtype='d', copy=False): """ Allows constructing a csc_matrix by passing: - data, ij, {M,N,nzmax} a[ij[k,0],ij[k,1]] = data[k] - data, (row, ptr) """ # Moved out of the __init__ function for now for simplicity. # I think this should eventually be moved to be a module-level # function.  Otherwise we overload the __init__ method too much, # given Python's weak type checking.  This should also remove # some code duplication.


Context: def __mul__(self, other):  # implement matrix multiplication and matrix-vector multiplication if isspmatrix(other): return self.matmat(other) elif isscalar(other): new = self.copy() new.data = new.data * other new._dtypechar = new.data.dtypechar new.ftype = _transtabl[new._dtypechar] return new else: return self.matvec(other)


Context: def __pow__(self, other): if isinstance(other, type(3)): raise NotImplementedError elif isscalar(other): new = self.copy() new.data = new.data * other new._dtypechar = new.data.dtypechar new.ftype = _transtabl[new._dtypechar] return new else: ocs = csc_matrix(other) if (ocs.shape != self.shape): raise ValueError, "Inconsistent shapes." dtypechar = _coerce_rules[(self._dtypechar,ocs._dtypechar)] nnz1, nnz2 = self.nnz, ocs.nnz data1, data2 = _convert_data(self.data[:nnz1], ocs.data[:nnz2], dtypechar) func = getattr(sparsetools,_transtabl[dtypechar]+'cscmul') c,rowc,ptrc,ierr = func(data1,self.rowind[:nnz1],self.indptr,data2,ocs.rowind[:nnz2],ocs.indptr) if ierr: raise ValueError, "Ran out of space (but shouldn't have happened)." M, N = self.shape return csc_matrix.Construct(c,(rowc,ptrc),M=M,N=N)


new = csr_matrix((N,M), nzmax=0, dtype=self._dtypechar)

Context: def transpose(self, copy=False): M,N = self.shape new = csr_matrix(N,M,nzmax=0,dtype=self._dtypechar) if copy: new.data = self.data.copy() new.colind = self.rowind.copy() new.indptr = self.indptr.copy() else: new.data = self.data new.colind = self.rowind new.indptr = self.indptr new._check() return new


Context: def __getitem__(self, key): if isinstance(key,types.TupleType): row = key[0] col = key[1] func = getattr(sparsetools,self.ftype+'cscgetel') M, N = self.shape if not (0<=row<M) or not (0<=col<N): raise KeyError, "Index out of bounds." ind, val = func(self.data, self.rowind, self.indptr, row, col) return val elif isinstance(key,type(3)): return self.data[key] else: raise NotImplementedError


Context: def copy(self): M, N = self.shape dtype = self._dtypechar new = csc_matrix.Construct(M, N, nzmax=0, dtype=dtype) new.data = self.data.copy() new.rowind = self.rowind.copy() new.indptr = self.indptr.copy() new._check() return new


Premise: A person on a horse jumps over a broken down airplane.

Hypothesis: A person is training his horse for a competition.


Hypothesis: A person is at a diner, ordering an omelette.


Hypothesis: A person is outdoors, on a horse.


Premise: Children smiling and waving at camera

Hypothesis: They are smiling at their parents


Premise: Children smiling and waving at camera

Hypothesis: There are children present


Premise: Children smiling and waving at camera

Hypothesis: The kids are frowning


Premise: A boy is jumping on skateboard in the middle of a red bridge.

Hypothesis: The boy skates down the sidewalk.


Hypothesis: The boy does a skateboarding trick.


Hypothesis: The boy is wearing safety equipment.


Premise: An older man sits with his orange juice at a small table in a coffee shop while employees in bright colored shirts smile in the background.

Hypothesis: An older man drinks his juice as he waits for his daughter to get off work.


you do know what this is tho


you need the coordinates


Abstract: The frequent occurrence of natural disasters is a major threat to the property and casualties of human beings in recent decades. Disaster prone points can be very closely monitored by augmenting the distribution of wireless sensor networks. However, replacing the battery of electronics regularly remains a significant challenge especially in a remote area. In this study, we report a wind-driven hybridized energy harvester which is designed for rotating energy harvesting and can be integrated with WSN technology to develop a self-powered natural disaster monitoring system. In this harvester, the rotator is directly driven by external rotational motion thus can easily hybridize the TENG with eighteen EMGs. Consequently, the fully packaged WH-EH device combining with the water-proof flexible solar cell can be completely isolated from the harsh wilderness environment. The output feature of TENG of high voltage but low current that perfectly compensate for the differing performance of EMG to achieve an excellent output power of the hybrid device with a broad frequency range. Moreover, the WH-EH is capable of lighting hundreds of LEDs and powering small electronics. The quick-acting charging ability of a capacitor by the WH-EH was conducted effectively in experimental tests. Finally, three self-powered sensor systems enabled by a single WH-EH were discussed and demonstrated, including a temperature sensor for forest fire detection, a vibration sensor for earthquake monitoring and a wireless transceiver for alarm information spreading. Obviously, the invention of the hybridized nanogenerator will be of great importance to promote the development of self-powered wireless sensor networks and provide a sustainable power-supply solution to long-term natural disaster monitoring stations in residential or remote areas.


Abstract: Photoelectrocatalytic cells for water splitting should combine one or two photosensitive units with a water oxidation catalyst at the anode and a hydrogen evolution catalyst at the cathode. In this perspective article, we first show how a chemist can take the naturally occurring multi-electron catalysts for these two electro- and photochemical reactions, photosystem II and hydrogenases, as a source of inspiration for the design of original, efficient and robust molecular catalysts. The focus of this article is given to the immobilisation of these natural or bio-inspired catalysts onto conducting surfaces and the design of electrode and photoelectrode materials for hydrogen evolution/uptake and water oxidation.


"Every turn of the cards changes the situation. A good player isnt
waiting to see the next card. A good player is interpreting the environment and
planning their next move to bet, call or fold before the next card is turned.
The turn of the card and the reaction of the other players dictates which plan
is implemented. The point is that change is planned. Once your followers are
ready for change, you implement the plan."Andrew J. Harvey and Raymond E. Foster (Leadership: Texas Hold 'em
Style).

Articles on Leadership
and Decision Making

Problem Definition
A clear problem definition is the first, and, perhaps, most important step
toward rationally selecting the best alternative. Many dedicated and intelligent
individuals have produced elegant solutions for problems other than those they
were tasked to solve. Therefore, a good executive decision maker participates in
problem definition because this step establishes the goal for everything else
that follows and places a premium on professional judgment.READ MORE

Consensus Team Decision Making
The Westerner and the Japanese man mean something different when they talk of
"making a decision." In the West, all the emphasis is on the answer to the
question. To the Japanese, however, the important element in decision making is
defining the question. The crucial steps are to decide whether there is a need
for a decision and what the decision is about. And it is in that step that the
Japanese aim at attaining consensus. Indeed, it is this step that, to the
Japanese, is the essence of decision. The answer to the question (what the West
considers the decision) follows from its definition. During the process that
precedes the decision, no mention is made of what the answer might be. . . .
Thus the whole process is focused on finding out what the decision is really
about, not what the decision should be.READ MORE

Effective Decision Making
One of the critical, but often overlooked, requirements for effective leadership
is sound decision making. This is especially true as we soar ever higher into
the ranks of middle and upper management. Typically, as this progression occurs,
leaders become more focused on strategic decisions relating to plans, policies,
programs and personnel, and less consumed with day-to-day tactical concerns.
Good decision making, especially in middle and upper management, will therefore
likely increase overall organizational health and effectiveness. Understanding
the meaning and art of deciding, therefore, is paramount.READ MORE

Ethical Decision-Making: The Link Between Ambiguity and
Accountability
A growing body of literature thoroughly examines the topic of ethics in public
service from numerous, contrary, and complementary perspectives. What is ethics
in public service? Ethics in public service is the study of the nature of
morals and moral choices and the rules governing a profession that define
professional conduct (Bruce, 2001, p. xiii). How do we know if it is effective?
Who determines? How do we measure it? In answering these questions it becomes
remarkably clear that there are no absolutes. Nor is there any single school of
thought or theory to guide the inquiry. Why do we try to understand ethics in
public service? The answer is clear: because we intuitively know it makes a
difference.READ MORE

NCOs and Values-Based Decision Making
In the Army of One, senior leaders look to the NCO Corps to embrace a value
system that develops character and to lead soldiers. The Army depends on its
NCOs to create the environment and set the tempo for success in full-spectrum
operations. Successful NCOs anticipate change, exploit every opportunity to meet
the units objectives and motivate their subordinates to higher levels of
productivity to achieve the units goals. Successful sergeants promote Army
Values and take care of soldiers in the process. In short, they are leaders with
values-based decision-making skills.READ ON

Studies in Group Leadership How Should We Decide Elements of
Sound Decision Making
Making decisions and solving problems takes much time and energy. But most
groups allow little time and energy to selecting a decision-making model or to
evaluating the process once the decision has been reached or a solution
attempted. Ideally, decisions arise as a result of judgments and reasoning to a
final conclusion, unfortunately, that is not always the case. Problem solving
involves the organization and arrangement of several decisions so that they will
have some usefulness solving a problem.READ MORE


Pages

Monday, October 11, 2010

Girls Night Out - Smokey Blues

Hi Bellas,

I'm back with another makeup look from my Caress Girls Night Out Event. My friend Karla was wearing a sexy leopard print dress and I wanted to pick makeup that fit the occasion. To me, animal print can often be a neutral color. As a result, I went for a smokey eye (can't go wrong with that), but decided to mix it up.

Click here to see more!A lot of people who aren't used to color get a little scared when you try to apply something outside of the neutral category. The key is to use a "safe" color, in this case silver, and place it on the lid so that it fades into your brighter color. That way, the whole eye isn't too vibrant, but you can still add color in the middle and outer part of the lid. I picked more of a royal blue tone so that it would be a bit more wearable.

I used the bright royal blue from my Best of Both World's Yaby Palette. The color is super rich and pigmented. I also used a darker blue from my Barbie Stila palette as the outer v/contour color.

Karla was one of my last models in my chair. I think I had about 15 minutes to do her makeup...not too shabby right? It helps that I have most of my makeup in palettes...it makes for quick mixing and matching.

I loved how it came out...it really made her eyes pop, and I think the guys agreed because they couldn't keep their hands off her at the club, wink wink.

That's all for now, stay tuned for more makeup breakdowns from Caress Girls Night Out event!

Product Reviews & Company Sponsorships

About Me

Hi Guys, my name is Ren, a 30something Filipino-American residing in Atlanta, and obsessed with everything makeup. I'm a bonafide beauty blogger and freelance makeup artist. All information on this site is my opinion only...please feel free to try out recommended products at techniques at your discretion.

; To improve our website(we continually strive to improve our website offerings based on the information and feedback we receive from you)

; To improve customer service(your information helps us to more effectively respond to your customer service requests and support needs)

How do we protect your information?

We implement a variety of security measures to maintain the safety of your personal information when you enter, submit, or access your personal information.

Do we use cookies?

We do not use cookies.

Do we disclose any information to outside parties?

We do not sell, trade, or otherwise transfer to outside parties your personally identifiable information. This does not include trusted third parties who assist us in operating our website, conducting our business, or servicing you, so long as those parties agree to keep this information confidential. We may also release your information when we believe release is appropriate to comply with the law, enforce our site policies, or protect ours or others rights, property, or safety. However, non-personally identifiable visitor information may be provided to other parties for marketing, advertising, or other uses.

Third party links

Occasionally, at our discretion, we may include or offer third party products or services on our website. These third party sites have separate and independent privacy policies. We therefore have no responsibility or liability for the content and activities of these linked sites. Nonetheless, we seek to protect the integrity of our site and welcome any feedback about these sites.

California Online Privacy Protection Act Compliance

Because we value your privacy we have taken the necessary precautions to be in compliance with the California Online Privacy Protection Act. We therefore will not distribute your personal information to outside parties without your consent.

Childrens Online Privacy Protection Act Compliance

We are in compliance with the requirements of COPPA (Childrens Online Privacy Protection Act), we do not collect any information from anyone under 13 years of age. Our website, products and services are all directed to people who are at least 13 years old or older.

Online Privacy Policy Only

This online privacy policy applies only to information collected through our website and not to information collected offline.


While a variety of pillows exist in the market today, none have the specific purpose of simultaneously giving neck and back support, while also allowing adjustment of the firmness, as well as providing a convenient air pump to inflate the pillows for desired firmness and a convenient storage bag. The present head and chest support kit fills that void. The kit provides a convenient way to store and carry head and neck support pillows. In addition, a user can regulate the desired firmness, thus allowing the pillows to be adjusted to the user's constantly changing needs. The kit comes equipped with a pneumatic pump for quick and easy inflation of the head and chest pillows. The storage bag gives an excellent place to store the components and a means of carrying them.


bitcoin peer peer electronic cash system satoshi nakamoto satoshin www bitcoin org abstract purely peer peer version electronic cash would allow online payments sent directly one party another without going financial institution digital signatures provide part solution main benefits lost trusted third party still required prevent double spending propose solution double spending problem using peer peer network network timestamps transactions hashing ongoing chain hash based proof work forming record cannot changed without redoing proof work longest chain serves proof sequence events witnessed proof came largest pool cpu power long majority cpu power controlled nodes cooperating attack network generate longest chain outpace attackers network requires minimal structure messages broadcast best effort basis nodes leave rejoin network accepting longest proof work chain proof happened gone introduction commerce internet come rely almost exclusively financial institutions serving trusted third parties process electronic payments system works well enough transactions still suffers inherent weaknesses trust based model completely non reversible transactions really possible since financial institutions cannot avoid mediating disputes cost mediation increases transaction costs limiting minimum practical transaction size cutting possibility small casual transactions broader cost loss ability make non reversible payments non reversible services possibility reversal need trust spreads merchants must wary customers hassling information would otherwise need certain percentage fraud accepted unavoidable costs payment uncertainties avoided person using physical currency mechanism exists make payments communications channel without trusted party needed electronic payment system based cryptographic proof instead trust allowing two willing parties transact directly without need trusted third party transactions computationally impractical reverse would protect sellers fraud routine escrow mechanisms could easily implemented protect buyers paper propose solution double spending problem using peer peer distributed timestamp server generate computational proof chronological order transactions system secure long honest nodes collectively control cpu power cooperating group attacker nodes xc transactions define electronic coin chain digital signatures owner transfers coin next digitally signing hash previous transaction public key next owner adding end coin payee verify signatures verify chain ownership transaction transaction transaction owner owner owner public key public key public key haan rash ven yen owner owner owner signature signature wv signature owner owner owner private key private key private key problem course payee verify one owners double spend coin acommon solution introduce trusted central authority mint checks every transaction double spending transaction coin must returned mint issue new coin coins issued directly mint trusted double spent problem solution fate entire money system depends company running mint every transaction go like bank need way payee know previous owners sign earlier transactions purposes earliest transaction one counts care later attempts double spend way confirm absence transaction aware transactions mint based model mint aware transactions decided arrived first accomplish without trusted party transactions must publicly announced need system participants agree single history order received payee needs proof time transaction majority nodes agreed first received timestamp server solution propose begins timestamp server timestamp server works taking hash block items timestamped widely publishing hash newspaper usenet post timestamp proves data must existed time obviously order get hash timestamp includes previous timestamp hash forming chain additional timestamp reinforcing ones ina hash hash block block item item te item item xc proof work implement distributed timestamp server peer peer basis need use proof work system similar adam back hashcash rather newspaper usenet posts proof work involves scanning value hashed sha hash begins number zero bits average work required exponential number zero bits required verified executing single hash timestamp network implement proof work incrementing nonce block value found gives block hash required zero bits cpu effort expended make satisfy proof work block cannot changed without redoing work later blocks chained work change block would include redoing blocks block block prev hash nonce prev hash nonce ox om jl proof work also solves problem determining representation majority decision making majority based one ip address one vote could subverted anyone able allocate many ips proof work essentially one cpu one vote majority decision represented longest chain greatest proof work effort invested ifa majority cpu power controlled honest nodes honest chain grow fastest outpace competing chains modify past block attacker would redo proof work block blocks catch surpass work honest nodes show later probability slower attacker catching diminishes exponentially subsequent blocks added compensate increasing hardware speed varying interest running nodes time proof work difficulty determined moving average targeting average number blocks per hour generated fast difficulty increases network steps run network follows new transactions broadcast nodes node collects new transactions block node works finding difficult proof work block anode finds proof work broadcasts block nodes nodes accept block transactions valid already spent nodes express acceptance block working creating next block chain using hash accepted block previous hash nodes always consider longest chain correct one keep working extending two nodes broadcast different versions next block simultaneously nodes may receive one first case work first one received save branch case becomes longer tie broken next proof work found one branch becomes longer nodes working branch switch longer one xc new transaction broadcasts necessarily need reach nodes long reach many nodes get block long block broadcasts also tolerant dropped messages node receive block request receives next block realizes missed one incentive convention first transaction block special transaction starts new coin owned creator block adds incentive nodes support network provides way initially distribute coins circulation since central authority issue steady addition constant amount new coins analogous gold miners expending resources add gold circulation case cpu time electricity expended incentive also funded transaction fees output value transaction less input value difference transaction fee added incentive value block containing transaction predetermined number coins entered circulation incentive transition entirely transaction fees completely inflation free incentive may help encourage nodes stay honest greedy attacker able assemble cpu power honest nodes would choose using defraud people stealing back payments using generate new coins ought find profitable play rules rules favour new coins everyone else combined undermine system validity wealth reclaiming disk space latest transaction coin buried enough blocks spent transactions discarded save disk space facilitate without breaking block hash transactions hashed merkle tree root included block hash old blocks compacted stubbing branches tree interior hashes need stored block block block header block hash block header block hash root hash root hash oo hash hash ett transactions hashed merkle tree pruning tx fron block block header transactions would bytes suppose blocks generated every minutes bytes mb per year computer systems typically selling gb ram moore law predicting current growth gb per year storage problem even block headers must kept memory xc simplified payment verification possible verify payments without running full network node user needs keep copy block headers longest proof work chain get querying network nodes convinced longest chain obtain merkle branch linking transaction block timestamped check transaction linking place chain see network node accepted blocks added confirm network accepted longest proof work chain block header block header block header ss prev hash nonce prev hash nonce merkle root merkle root merkle root hashot hash merkle branch tx tx verification reliable long honest nodes control network vulnerable network overpowered attacker network nodes verify transactions simplified method fooled attacker fabricated transactions long attacker continue overpower network one strategy protect would accept alerts network nodes detect invalid block prompting user software download full block alerted transactions confirm inconsistency businesses receive frequent payments probably still want run nodes independent security quicker verification combining splitting value although would possible handle coins individually would unwieldy make separate transaction every cent transfer allow value split combined transactions contain multiple inputs outputs normally either single input larger previous transaction multiple inputs combining smaller amounts two outputs one payment one returning change back sender transaction tee noted fan transaction depends several transactions transactions depend many problem never need extract complete standalone copy transaction history ws xc privacy traditional banking model achieves level privacy limiting access information parties involved trusted third party necessity announce transactions publicly precludes method privacy still maintained breaking flow information another place keeping public keys anonymous public see someone sending amount someone else without information linking transaction anyone similar level information released stock exchanges time size individual trades tape made public without telling parties traditional privacy model ti j trusted identities third party counterparty public new privacy model additional firewall new key pair used transaction keep linked common owner linking still unavoidable multi input transactions necessarily reveal inputs owned owner risk owner key revealed linking could reveal transactions belonged owner caleulations consider scenario attacker trying generate alternate chain faster honest chain even accomplished throw system open arbitrary changes creating value thin air taking money never belonged attacker nodes going accept invalid transaction payment honest nodes never accept block containing attacker try change one transactions take back money recently spent race honest chain attacker chain characterized binomial random walk success event honest chain extended one block increasing lead failure event attacker chain extended one block reducing gap probability attacker catching given deficit analogous gambler ruin problem suppose gambler unlimited credit starts deficit plays potentially infinite number trials try reach breakeven calculate probability ever reaches breakeven attacker ever catches honest chain follows p probability honest node finds next block q probability attacker finds next block q probability attacker ever catch z blocks behind ypsa ql py p xc given assumption p qg probability drops exponentially number blocks attacker catch increases odds make lucky lunge forward early chances become vanishingly small falls behind consider long recipient new transaction needs wait sufficiently certain sender change transaction assume sender attacker wants make recipient believe paid switch pay back time passed receiver alerted happens sender hopes late receiver generates new key pair gives public key sender shortly signing prevents sender preparing chain blocks ahead time working continuously lucky enough get far enough ahead executing transaction moment transaction sent dishonest sender starts working secret parallel chain containing alternate version transaction recipient waits transaction added block z blocks linked know exact amount progress attacker made assuming honest blocks took average expected time per block attacker potential progress poisson distribution expected value daz pp get probability attacker could still catch multiply poisson density amount progress could made probability could catch point qip ifks z fo ck ifk z rearranging avoid summing infinite tail distribution z koo ae kl q p converting c code include math h double attackersuccessprobability double q int z double p q double lambda z q p double sum int k k k z k double poisson exp lambda k itt poisson lambda sum poisson pow q p z k return sum xc running results see probability drop exponentially z q z p z p z p z p z p z p z p z p z p z p z p q z p z p z p z p z p zz p z p z p z p z p z p solving p less p q z q z q z q z q z q z q z q z conclusion proposed system electronic transactions without relying trust started usual framework coins made digital signatures provides strong control ownership incomplete without way prevent double spending solve proposed peer peer network using proof work record public history transactions quickly becomes computationally impractical attacker change honest nodes control majority cpu power network robust unstructured simplicity nodes work little coordination need identified since messages routed particular place need delivered best effort basis nodes leave rejoin network accepting proof work chain proof happened gone vote cpu power expressing acceptance valid blocks working extending rejecting invalid blocks refusing work needed rules incentives enforced consensus mechanism xc references w dai b money weidai com bmoney txt h massias x avila j j quisquater design secure timestamping service minimal trust requirements th symposium information theory benelux may haber ws stornetta time stamp digital document journal cryptology vol pages bayer haber w stornetta improving efficiency reliability digital time stamping sequences methods communication security computer science pages haber ws stornetta secure names bit strings proceedings th acm conference computer communications security pages april back hashcash denial service counter measure pdf r c merkle protocols public key cryptosystems proc symposium security privacy ieee computer society pages april w feller introduction probability theory applications


ethereum whitepaper introductory paper originally published vitalik buterin founder ethereum project launch worth noting ethereum like many community driven open source software projects evolved since initial inception several years old maintain paper continues serve useful reference accurate representation ethereum vision learn latest developments ethereum changes protocol made recommend guide researchers academics seeking historical canonical version whitepaper december use pdf next generation smart contract decentralized application platform satoshi nakamoto development bitcoin often hailed radical development money currency first example digital asset simultaneously backing intrinsic value centralized issuer controller however another arguably important part bitcoin experiment underlying blockchain technology tool distributed consensus attention rapidly starting shift aspect bitcoin commonly cited alternative applications blockchain technology include using blockchain digital assets represent custom currencies financial instruments colored coins ownership underlying physical device smart property non fungible assets domain names namecoin well complex applications involving digital assets directly controlled piece code implementing arbitrary rules smart contracts even blockchain based decentralized autonomous organizations daos ethereum intends provide blockchain built fully fledged turing complete programming language used create contracts used encode arbitrary state transition functions allowing users create systems described well many others yet imagined simply writing logic lines code introduction bitcoin existing concepts history concept decentralized digital currency well alternative applications like property registries around decades anonymous e cash protocols mostly reliant cryptographic primitive known chaumian blinding provided currency high degree privacy protocols largely failed gain traction reliance centralized intermediary wei dai b money became first proposal introduce idea creating money solving computational puzzles well decentralized consensus proposal scant details decentralized consensus could actually implemented hal finney introduced concept reusable proofs work system uses ideas b money together adam back computationally difficult hashcash puzzles create concept cryptocurrency fell short ideal relying trusted computing backend decentralized currency first time implemented practice satoshi nakamoto combining established primitives managing ownership public key cryptography consensus algorithm keeping track owns coins known proof work mechanism behind proof work breakthrough space simultaneously solved two problems first provided simple moderately effective consensus algorithm allowing nodes network collectively agree set canonical updates state bitcoin ledger second provided mechanism allowing free entry consensus process solving political problem deciding gets influence consensus simultaneously preventing sybil attacks substituting formal barrier participation requirement registered unique entity particular list economic barrier weight single node consensus voting process directly proportional computing power node brings since alternative approach proposed called proof stake calculating weight node proportional currency holdings computational resources discussion relative merits two approaches beyond scope paper noted approaches used serve backbone cryptocurrency bitcoin state transition system ethereum state transition technical standpoint ledger cryptocurrency bitcoin thought state transition system state consisting ownership status existing bitcoins state transition function takes state transaction outputs new state result standard banking system example state balance sheet transaction request move x b state transition function reduces value account x increases value b account x account less x first place state transition function returns error hence one formally define apply tx error banking system defined apply alice bob send alice bob alice bob apply alice bob send alice bob error state bitcoin collection coins technically unspent transaction outputs utxo minted yet spent utxo denomination owner defined byte address essentially cryptographic public keyfn transaction contains one inputs input containing reference existing utxo cryptographic signature produced private key associated owner address one outputs output containing new utxo added state state transition function apply tx defined roughly follows input tx referenced utxo return error provided signature match owner utxo return error sum denominations input utxo less sum denominations output utxo return error return input utxo removed output utxo added first half first step prevents transaction senders spending coins exist second half first step prevents transaction senders spending people coins second step enforces conservation value order use payment protocol follows suppose alice wants send btc bob first alice look set available utxo owns totals least btc realistically alice able get exactly btc say smallest get creates transaction three inputs two outputs first output btc bob address owner second output remaining btc change owner alice mining ethereum blocks access trustworthy centralized service system would trivial implement could simply coded exactly described using centralized server hard drive keep track state however bitcoin trying build decentralized currency system need combine state transaction system consensus system order ensure everyone agrees order transactions bitcoin decentralized consensus process requires nodes network continuously attempt produce packages transactions called blocks network intended produce roughly one block every ten minutes block containing timestamp nonce reference ie hash previous block list transactions taken place since previous block time creates persistent ever growing blockchain constantly updates represent latest state bitcoin ledger algorithm checking block valid expressed paradigm follows check previous block referenced block exists valid check timestamp block greater previous blockfn less hours future check proof work block valid let state end previous block suppose tx block transaction list n transactions n set apply tx application returns error exit return false return true register n state end block essentially transaction block must provide valid state transition canonical state transaction executed new state note state encoded block way purely abstraction remembered validating node securely computed block starting genesis state sequentially applying every transaction every block additionally note order miner includes transactions block matters two transactions b block b spends utxo created block valid comes b otherwise one validity condition present list found systems requirement proof work precise condition double sha hash every block treated bit number must less dynamically adjusted target time writing approximately purpose make block creation computationally hard thereby preventing sybil attackers remaking entire blockchain favor sha designed completely unpredictable pseudorandom function way create valid block simply trial error repeatedly incrementing nonce seeing new hash matches current target network must make average tries valid block found general target recalibrated network every blocks average new block produced node network every ten minutes order compensate miners computational work miner every block entitled include transaction giving btc nowhere additionally transaction higher total denomination inputs outputs difference also goes miner transaction fee incidentally also mechanism btc issued genesis state contained coins order better understand purpose mining let us examine happens event malicious attacker since bitcoin underlying cryptography known secure attacker target one part bitcoin system protected cryptography directly order transactions attacker strategy simple send btc merchant exchange product preferably rapid delivery digital good wait delivery product produce another transaction sending btc try convince network transaction one came first step taken place minutes miner include transaction block say block number one hour five blocks added chain block blocks indirectly pointing transaction thus confirming point merchant accept payment finalized deliver product since assuming digital good delivery instant attacker creates another transaction sending btc attacker simply releases wild transaction processed miners attempt run apply tx notice tx consumes utxo longer state instead attacker creates fork blockchain starting mining another version block pointing block parent new transaction place old one block data different requires redoing proof work furthermore attacker new version block different hash original blocks point thus original chain attacker new chain completely separate rule fork longest blockchain taken truth legitimate miners work chain attacker alone working chain order attacker make blockchain longest would need computational power rest network combined order catch hence attack merkle trees spv bitcoin left suffices present small number nodes merkle tree give proof validity branch right attempt change part merkle tree eventually lead inconsistency somewhere chain important scalability feature bitcoin block stored multi level data structure hash block actually hash block header roughly byte piece data contains timestamp nonce previous block hash root hash data structure called merkle tree storing transactions block merkle tree type binary tree composed set nodes large number leaf nodes bottom tree containing underlying data set intermediate nodes node hash two children finally single root node also formed hash two children representing top tree purpose merkle tree allow data block delivered piecemeal node download header block one source small part tree relevant another source still assured data correct reason works hashes propagate upward malicious user attempts swap fake transaction bottom merkle tree change cause change node change node finally changing root tree therefore hash block causing protocol register completely different block almost certainly invalid proof work merkle tree protocol arguably essential long term sustainability full node bitcoin network one stores processes entirety every block takes gb disk space bitcoin network april growing gigabyte per month currently viable desktop computers phones later future businesses hobbyists able participate protocol known simplified payment verification spv allows another class nodes exist called light nodes download block headers verify proof work block headers download branches associated transactions relevant allows light nodes determine strong guarantee security status bitcoin transaction current balance downloading small portion entire blockchain alternative blockchain applications idea taking underlying blockchain idea applying concepts also long history nick szabo came concept secure property titles owner authority document describing new advances replicated database technology allow blockchain based system storing registry owns land creating elaborate framework including concepts homesteading adverse possession georgian land tax however unfortunately effective replicated database system available time protocol never implemented practice however bitcoin decentralized consensus developed number alternative applications rapidly began emerge namecoin created namecoin best described decentralized name registration database decentralized protocols like tor bitcoin bitmessage needs way identifying accounts people interact existing solutions kind identifier available pseudorandom hash like lwwpzbqahwjltcibcrhqythaguwy ideally one would like able account name like george however problem one person create account named george someone else use process register george well impersonate solution first file paradigm first registerer succeeds second fails problem perfectly suited bitcoin consensus protocol namecoin oldest successful implementation name registration system using idea colored coins purpose colored coins serve protocol allow people create digital currencies important trivial case currency one unit digital tokens bitcoin blockchain colored coins protocol one issues new currency publicly assigning color specific bitcoin utxo protocol recursively defines color utxo color inputs transaction creating spent special rules apply case mixed color inputs allows users maintain wallets containing utxo specific color send around much like regular bitcoins backtracking blockchain determine color utxo receive metacoins idea behind metacoin protocol lives top bitcoin using bitcoin transactions store metacoin transactions different state transition function apply metacoin protocol cannot prevent invalid metacoin transactions appearing bitcoin blockchain rule added apply tx returns error protocol defaults apply tx provides easy mechanism creating arbitrary cryptocurrency protocol potentially advanced features cannot implemented inside bitcoin low development cost since complexities mining networking already handled bitcoin protocol metacoins used implement classes financial contracts name registration decentralized exchange thus general two approaches toward building consensus protocol building independent network building protocol top bitcoin former approach reasonably successful case applications like namecoin difficult implement individual implementation needs bootstrap independent blockchain well building testing necessary state transition networking code additionally predict set applications decentralized consensus technology follow power law distribution vast majority applications would small warrant blockchain note exist large classes decentralized applications particularly decentralized autonomous organizations need interact bitcoin based approach hand flaw inherit simplified payment verification features bitcoin spv works bitcoin use blockchain depth proxy validity point ancestors transaction go far enough back safe say legitimately part state blockchain based meta protocols hand cannot force blockchain include transactions valid within context protocols hence fully secure spv meta protocol implementation would need backward scan way beginning bitcoin blockchain determine whether certain transactions valid currently light implementations bitcoin based meta protocols rely trusted server provide data arguably highly suboptimal result especially one primary purposes cryptocurrency eliminate need trust scripting even without extensions bitcoin protocol actually facilitate weak version concept smart contracts utxo bitcoin owned public key also complicated script expressed simple stack based programming language paradigm transaction spending utxo must provide data satisfies script indeed even basic public key ownership mechanism implemented via script script takes elliptic curve signature input verifies transaction address owns utxo returns verification successful otherwise complicated scripts exist various additional use cases example one construct script requires signatures two given three private keys validate multisig setup useful corporate accounts secure savings accounts merchant escrow situations scripts also used pay bounties solutions computational problems one even construct script says something like bitcoin utxo provide spv proof sent dogecoin transaction denomination essentially allowing decentralized cross cryptocurrency exchange however scripting language implemented bitcoin several important limitations lack turing completeness say large subset computation bitcoin scripting language supports nearly support everything main category missing loops done avoid infinite loops transaction verification theoretically surmountable obstacle script programmers since loop simulated simply repeating underlying code many times statement lead scripts space inefficient example implementing alternative elliptic curve signature algorithm would likely require repeated multiplication rounds individually included code value blindness way utxo script provide fine grained control amount withdrawn example one powerful use case oracle contract would hedging contract b put worth btc days script sends worth btc rest b would require oracle determine value btc usd even massive improvement terms trust infrastructure requirement fully centralized solutions available however utxo nothing way achieve inefficient hack many utxo varying denominations eg one utxo k every k pick utxo send b lack state utxo either spent unspent opportunity multi stage contracts scripts keep internal state beyond makes hard make multi stage options contracts decentralized exchange offers two stage cryptographic commitment protocols necessary secure computational bounties also means utxo used build simple one contracts complex stateful contracts decentralized organizations makes meta protocols difficult implement binary state combined value blindness also mean another important application withdrawal limits impossible blockchain blindness utxo blind blockchain data nonce timestamp previous block hash severely limits applications gambling several categories depriving scripting language potentially valuable source randomness thus see three approaches building advanced applications top cryptocurrency building new blockchain using scripting top bitcoin building meta protocol top bitcoin building new blockchain allows unlimited freedom building feature set cost development time bootstrapping effort security using scripting easy implement standardize limited capabilities meta protocols easy suffer faults scalability ethereum intend build alternative framework provides even larger gains ease development well even stronger light client properties time allowing applications share economic environment blockchain security ethereum intent ethereum create alternative protocol building decentralized applications providing different set tradeoffs believe useful large class decentralized applications particular emphasis situations rapid development time security small rarely used applications ability different applications efficiently interact important ethereum building essentially ultimate abstract foundational layer blockchain built turing complete programming language allowing anyone write smart contracts decentralized applications create arbitrary rules ownership transaction formats state transition functions bare bones version namecoin written two lines code protocols like currencies reputation systems built twenty smart contracts cryptographic boxes contain value unlock certain conditions met also built top platform vastly power offered bitcoin scripting added powers turing completeness value awareness blockchain awareness state ethereum accounts ethereum state made objects called accounts account byte address state transitions direct transfers value information accounts ethereum account contains four fields nonce counter used make sure transaction processed account current ether balance account contract code present account storage empty default ether main internal crypto fuel ethereum used pay transaction fees general two types accounts externally owned accounts controlled private keys contract accounts controlled contract code externally owned account code one send messages externally owned account creating signing transaction contract account every time contract account receives message code activates allowing read write internal storage send messages create contracts turn note contracts ethereum seen something fulfilled complied rather like autonomous agents live inside ethereum execution environment always executing specific piece code poked message transaction direct control ether balance key value store keep track persistent variables messages transactions term transaction used ethereum refer signed data package stores message sent externally owned account transactions contain recipient message signature identifying sender amount ether transfer sender recipient optional data field startgas value representing maximum number computational steps transaction execution allowed take gasprice value representing fee sender pays per computational step first three standard fields expected cryptocurrency data field function default virtual machine opcode using contract access data example use case contract functioning blockchain domain registration service may wish interpret data passed containing two fields first field domain register second field ip address register contract would read values message data appropriately place storage startgas gasprice fields crucial ethereum anti denial service model order prevent accidental hostile infinite loops computational wastage code transaction required set limit many computational steps code execution use fundamental unit computation gas usually computational step costs gas operations cost higher amounts gas computationally expensive increase amount data must stored part state also fee gas every byte transaction data intent fee system require attacker pay proportionately every resource consume including computation bandwidth storage hence transaction leads network consuming greater amount resources must gas fee roughly proportional increment messages contracts ability send messages contracts messages virtual objects never serialized exist ethereum execution environment message contains sender message implicit recipient message amount ether transfer alongside message optional data field startgas value essentially message like transaction except produced contract external actor message produced contract currently executing code executes call opcode produces executes message like transaction message leads recipient account running code thus contracts relationships contracts exactly way external actors note gas allowance assigned transaction contract applies total gas consumed transaction sub executions example external actor sends transaction b gas b consumes gas sending message c internal execution c consumes gas returning b spend another gas running gas ethereum state transition function ether state transition ethereum state transition function apply tx defined follows check transaction well formed ie right number values signature valid nonce matches nonce sender account return error calculate transaction fee startgas gasprice determine sending address signature subtract fee sender account balance increment sender nonce enough balance spend return error initialize gas startgas take certain quantity gas per byte pay bytes transaction transfer


protocol whitepaper v wow january abstract document describes definitions theory behind aave protocol explaining different aspects implementation contents introduction basic concepts formal definitions protocol architecture lending pool core lending pool data provider lending pool lending pool configurator interest rate strategy governance lendingpool contract deposit redeem borrow repay swap rate liquidation call flash loans tokenization limitations tokenization model stable rate theory lending rate oracle current stable borrow rate rs limitations stable rate positions stable rate rebalancing rebalancing process conclusion introduction birth aave protocol marks aave shift decentralized pp lending strategy direct loan relationship lenders borrowers like ethlend pool based strategy lenders provide liquidity depositing cryptocurrencies pool contract simultaneously contract pooled funds borrowed placing collateral loans need individually matched instead rely pooled funds well amounts borrowed collateral enables instant loans characteristics based state pool simplified scheme protocol presented figure figure aave protocol interest rate borrowers lenders decided algorithmically borrowers depends cost money amount funds available pool specific time funds borrowed pool amount funds available decreases raises interest rate lenders interest rate corresponds earn rate algorithm safeguarding liquidity reserve guarantee withdrawals time basic concepts figure lending pool basics heart lending pool concept reserve every pool holds reserves multiple currencies total amount ethereum defined total liquidity reserve accepts deposits lenders users borrow funds granted lock greater value collateral backs borrow position specific currencies pooled reserves configured collateral borrow positions low risk tokens considered amount one borrow depends currencies deposited still available reserves every reserve specific loan value ltv calculated weighted average different ltvs currencies composing collateral weight ltv equivalent amount collateral eth figure shows example parameters every borrow position opened stable variable rate borrows infinite duration repayment schedule partial full repayments made anytime figure lending pool parameters case price fluctuations borrow position might liquidated liquidation event happens price collateral drops threshold lq called liquidation threshold reaching ratio channels liquidation bonus incentivizes liquidators buy collateral discounted price every reserve specific liquidation threshold following approach ltv calculation average liquidation threshold laq performed dynamically using weighted average liquidation thresholds collateral underlying assets point time borrow position characterized health factor hf function total collateral total borrows determines loan undercollateralized otalcollateralet h la h q f h otalborrowset h otalf eeset h f loan considered undercollateralized liquidated details liquidation found section formal definitions variable description current times current number seconds defined block timestamp tamp tl last updated timestamp last update reserve data tl updated every time timestamp borrow deposit redeem repay swap liquidation event occurs delta time tl tyear seconds number seconds year tyear tyear yearly pe tyear tyear riod lt total liquidity total amount liquidity available reserve decimals value depend decimals currency bs total stable bor total amount liquidity borrowed stable rate decimals value rows depend decimals currency bv total variable total amount liquidity borrowed variable rate decimals value borrows depend decimals currency bt total borrows total amount liquidity borrowed deci bt bs bv mals value depend decimals currency l u utilization rate representing utilization deposited u funds b l l uoptimal target uti utilization rate targeted model beyond variable interest rate rises lization rate sharply rv base variable constant b expressed ray borrow rate rslope interest rate constant representing scaling interest rate versus utilization slope uoptimal u uoptimal expressed ray rslope interest rate constant representing scaling interest rate versus utilization slope uoptimal u uoptimal expressed ray r u r v u slope u uoptimal r optimal v variable borrow rv rate r r r v slope u uoptimal u slope u uoptimal optimal rs stable rate implemented section expressed ray pn p ip r v r average market base stable borrow rate defined platforms mr pn pi v lending rate p r lending rate p v borrowing volume expressed ray variable description stable borrow amount b bnewrs new issued rt bsrt sa sa bs bnew rate rs rt average stable sa user repays amount bx stable rate rt rate borrow rate sa r sx b bx bsrt bxrsx sa b b bx bx check methods decreasetotalborrowsstableandupdateaveragerate increasetotalborrowsstableandupdateaveragerate expressed ray ro overall borrow overall borrow rate reserve calculated ro rate weighted average total variable b borrows b v total stable borrows bs b v rv bs rsa b b rl current liquidity function overall borrow rate ro rl rou rate utilization rate u interest cumulated reserve time ct cumulated liq ct r l tyear c interval uidity index updated whenever borrow deposit repay redeem swap liquidation event occurs c ray reserve normal ongoing interest cumulated reserve r n n l tyear c ized income interest cumulated variable borrows bv bt rv tx bt bt cumulated vari vc vc vc rate r year v updated whenever borrow deposit repay able borrow index redeem swap liquidation event occurs b ray vc bt user cumu variable borrow index specific user stored bt bt vcx vcx vc lated variable bor user opens variable borrow position row index bx user principal balance stored user opens borrow position case multiple borrows borrow balance compounded interest cumulated time becomes new principal borrow balance principal bx plus cumulated interests bxc user com pounded borrow variable position bxc bvc rv tx b b x vcx tyear balance stable position bxc rs tx b x year otalcollateralet h la h q f health factor hf loan considered undercollater hf bt otalf eeset h alized liquidated protocol architecture current implementation protocol follows figure protocol architecture lending pool core lendingpoolcore contract center protocol holds state every reserve assets deposited handles basic logic cumulation indexes calculation interest rates lending pool data provider lendingpooldataprovider contract performs calculations higher layer abstraction lendingpoolcore provides data lendingpool specifically calculates eth equivalent user balances borrow balance collateral balance liquidity balance assess much user allowed borrow health factor aggregates data lendingpoolcore provide high level information lendingpool calculate average loan value average liquidation ratio lending pool lendingpool contract uses lendingpoolcore lendingpooldataprovider interact reserves actions deposit borrow rate swap flash loan redeem repay liquidation one advanced features implemented lendingpool contract tokenization lending position user deposits specific reserve receives corresponding amount atokens tokens map liquidity deposited accrue interests deposited underlying assets atokens minted upon deposit value increases burned redeem liquidated whenever user opens borrow position tokens used collateral locked cannot transferred details tokenization section lending pool configurator lendingpoolconfigurator provides main configuration functions lendingpool lendingpoolcore reserve initialization reserve configuration enable disable borrowing reserve enable disable usage specific reserve collateral lendingpoolconfigurator contract integrated aave protocol governance interest rate strategy interestratestrategy contract holds information needed update interest rates specific reserve implements update interest rates every reserve specific interestratestrategy contract specifically within base strategy contract defaultreserveinterestratestrategy following defined base variable borrow rate rv interest rate slope optimal utilisation rslope interest rate slope beyond optimal utilisation rslope current variable borrow rate rv u r slope u uoptimal r uoptimal v rv r r slope u uoptimal u slope u uoptimal optimal interest rate model allows calibration key interest rates u rv rv u uoptimal rv rv r slope uoptimal interest rate rises sharply take account cost capital stable borrow rate follows model described section governance rights protocol controlled lend token initially aave protocol launched decentralized chain governance based daostack framework evolve fully autonomous protocol chain implies votes binding actions follow vote hard coded must executed understand scope governance important make distinction aave protocol bound evolve allow creation multiple lending pools segregated liquidity parameters permissions type assets aave lending pool first pool aave protocol pool factory update released anyone create pool within aave protocol governance take place two level protocol governance voting weighted lend decisions related protocol parameters upgrades smart contract compared makerdao governance stakeholders vote current future parameters protocol pool governance vote weighted based share pool liquidity expressed atokens votes cover pool specific parameters assets used collateral borrowed pool governance umbrella protocol governance details governance published governance proposal community lendingpool contract actions implemented within lendingpool allow users interact reserve actions follow specific sequence figure lendingpool contract deposit deposit action simplest one particular state check sequence action figure deposit funds redeem redeem action allows users exchange amount atokens underlying asset actual amount redeem calculated using atoken underlying exchange rate ei section action defined follows figure redeem funds borrow borrow action transfers user specific amount underlying asset exchange collateral remains locked flow action described follows figure borrow funds repay repay action allows user repay completely partially borrowed amount plus origination fee accrued interest figure repay loan swap rate swap rate action allows user borrow progress swap variable stable borrow rate figure swap rate liquidation call liquidationcall contract allows external actor purchase part collateral discounted price case liquidation event maximum loan liquidated bring health factor back figure liquidation flash loans flash loan action allow users borrow reserves within single transaction long user returns liquidity taken figure flash loan flash loans temporarily transfer funds smart contract respects iflashloanenabledcontract sol interface address contract parameter action funds transferred method executeoperation executed external contract contract whatever action needed borrowed funds method executeoperation completed check performed verify funds plus fee returned lendingpool contract fee accrued reserve state reserve updated less funds borrowed returned reserve transaction reverted tokenization aave protocol implements tokenization strategy liquidity providers upon deposit depositor receives corresponding amount derivative tokens called aave tokens atokens short map underlying assets balance atokens every depositor grows time driven perpetual accrual interest deposits atokens fully erc compliant atokens also natively implement concept interest rate redirection indeed value accrued time borrowers interest rate payments distinct principal value balance atokens accrued value redirected address effectively splitting balance generated interest call continuous flow accumulated interest time interest stream implement tokenization strategy aave introduced following concepts atoken contract user x balance index value reserve normalized income moment execution x x last action user principal balance bp balance stored balances mapping erc atoken contract principal balance gets updated every action user executes atoken contract deposit redeem transfer liquidation interest rate redirection redirection address ar user decides redirect interest stream another address new redirection address ar provided redirection interest stream performed ar redirected balance bx whenever user redirects interest stream balance user redirecting r added redirected balance br address specified br defined follows bx p b r x p x set users redirecting interest stream user x redirected balance decreases whenever user x x redeems transfers atokens another user redirecting x current balance bc balance returned balanceof function atoken contract defined follows bx bx p r bx bx bx c p r r x bx bx p r r x ix limitations tokenization model described tokenization model many advantages compared widely used exchange rate based approach also drawbacks specifically impossible transfer whole balance given perpetual accrual interest rate way specify exact amount transfer since interest keep accruing even transfer transaction confirmed means exactly balance transfer impossible rather small balance dust balance left account executing transfer note could avoided adding specific logic handle particular edge case would meant adding non standard behavior erc transfer function reason avoided even though relevant issue important note possible completely clear remaining balance either execute another transfer likely transfer remaining dust balance would small accrue interest reasonably short amount time redeem dust balance transfer underlying asset interest stream redirected principal balance means accounts principal balance bp redirect interest users redeem transfer everything interest redirection reset side effect interest generated redirected balance br cannot redirected stable rate theory following chapter explains stable rates applied system limitations implementation fixed rate model top pool complicated indeed fixed rates hard handle algorithmically cost borrowing money varies market conditions liquidity available might therefore situations sudden market changes bank runs handling stable rate borrow positions would need using specific heuristics based time economical constraints following reasoning identified two possible ways handling fixed rates imposing time constraints fixed rates might work perfectly fine time constrained fashion loan stable duration survive extreme market conditions borrower must repay end loan period unfortunately time constrained fixed rate loans suitable specific use case open ended loan would require certain degree ux friction users would need create handle multiple loans different times constraints imposing rates constraints interest rate calculated beginning loan might impacted market conditions keeping staying fixed rate diverges much market readjusted would pure fixed rate open term loan rate might vary throughout loan duration yet users experience actual fixed rates specific time periods enough liquidity available particular implementation chosen integrated aave protocol name stable rate lending rate oracle figure lending rate oracle first component integrated protocol protocol lending rate oracle provide information contracts actual market rates lending platforms centralized decentralized providing average market lending rate mr defined platforms p lending rate r p borrowing volume v pn p ip r v r pn p v market rate updated daily initially aave current stable borrow rate rs current stable borrow rate calculated follows mr u rslope u uoptimal rt uoptimal mr rslope u uoptimal r u slope u uoptimal optimal mr average market lending rate rslope interest rate slope uoptimal increases rate u increases rslope interest rate slope beyond uoptimal increases difference u uoptimal increases u utilization rate note rs impact existing stable rates positions applied new opened positions limitations stable rate positions avoid abuses stable rate loans following limitations applied stable rate borrowing model users cannot deposit collateral liquidity trying borrow eg user deposits million dai collateral tries borrow million dai prevent following attack vector given bs ap r mr ap r rl ap r users might try artificially lower bs value mr depositing huge amount liquidity would cause bs drop borrow liquidity lower rate withdraw liquidity previously deposited cause bs liquidity rate rl raise finally deposit amount borrowed earn interest previously borrowed funds although attack still carried using multiple accounts particular constraint makes attack complicated requires money different collateral currency works well combination interest rate rebalancing next section borrowers able borrow tr available liquidity current borrow rate every specific value bs tr liquidity available single borrower avoid specific borrower would borrow much available liquidity competitive rate stable rate rebalancing last perhaps important constraint stable rate model rate rebalancing work around changes market conditions increased cost money within pool stable rate rebalancing happen two specific situations rebalancing stable rate user x rebalanced recent value bs user could earn interest borrowing bx r stable borrow rate user x l bx rebalancing stable rate user x rebalanced recent value bs bx b b bs rate delta established governance defines window bs rebalance interest rates user pays much interest beyond range rate balanced rebalancing process lendingpool contract exposes function rebalancestableborrowrate address reserve address user allows rebalance stable rate interest specific user anybody call function however direct incentive caller rebalance rate specific user reason aave provide agent periodically monitor stable rates positions rebalance ones deemed necessary rebalance strategy decided offchain agent means users satisfy rebalance conditions may rebalanced immediately since conditions depend liquidity available state market might transitory situations immediate rebalance needed add element centralization protocol even agent stops working anybody call rebalance function lendingpool contract although direct incentive indirect incentive ecosystem fact even agent cease exist depositors might still want trigger rebalance lowest borrow rate positions increase liquidity rate force borrowers close positions increasing available liquidity case rescale instead borrowers direct incentive performing rebalance positions lower interest rate following flowchart explains sequence actions function rebalancestableborrowrate compounded balance accumulated instant rebalance happens affected rebalance figure rebalancing conclusion aave protocol relies lending pool model offer high liquidity loans backed collateral represented atokens derivative tokens accrue interests parameters interest rate loan value token specific aave improves decentralized finance current offering bringing two key innovations lending ecosystem stable rates help borrowers financial planning flash loans borrow without collateral single transaction following launch mainnet aave uphold commitment decentralization additional features pool factory allow anyone launch lending pool based smart contracts governance chain rights represented lend token protocol level updates smart contract atokens pool level pool specific parameters document outline introduction basic concepts formal definitions protocol architecture lending pool core lending pool data provider lending pool lending pool configurator interest rate strategy governance lendingpool contract deposit redeem borrow repay swap rate liquidation call flash loans tokenization limitations tokenization model stable rate theory lending rate oracle current stable borrow rate rs limitations stable rate positions stable rate rebalancing rebalancing process conclusion