STATEWIDE POWER BALLOT
HAWAII GENERAL ELECTION
NOVEMBER 4, 2014
United States Senate
United States House of Representatives - District 1
United States House of Representatives - District 2
Governor and Lieutenant Governor
Hawaii State Senate - District 1
Hawaii State Senate - District 3
Hawaii State Senate - District 4
Hawaii State Senate - District 5
Hawaii State Senate - District 6
Hawaii State Senate - District 12
Hawaii State Senate - District 17
Hawaii State Senate - District 18
Hawaii State Senate - District 21
Hawaii State Senate - District 23
Hawaii State Senate - District 24
Hawaii State House - District 1
Hawaii State House - District 3
Hawaii State House - District 4
Hawaii State House - District 5
Hawaii State House - District 6
Hawaii State House - District 8
Hawaii State House - District 10
Hawaii State House - District 11
Hawaii State House - District 12
Hawaii State House - District 14
Hawaii State House - District 15
Hawaii State House - District 16
Hawaii State House - District 17
Hawaii State House - District 18
Hawaii State House - District 19
Hawaii State House - District 20
Hawaii State House - District 21
Hawaii State House - District 22
Hawaii State House - District 24
Hawaii State House - District 25
Hawaii State House - District 26
Hawaii State House - District 27
Hawaii State House - District 28
Hawaii State House - District 31
Hawaii State House - District 32
Hawaii State House - District 33
Hawaii State House - District 34
Hawaii State House - District 35
Hawaii State House - District 36
Hawaii State House - District 37
Hawaii State House - District 40
Hawaii State House - District 41
Hawaii State House - District 42
Hawaii State House - District 43
Hawaii State House - District 44
Hawaii State House - District 45
Hawaii State House - District 47
Hawaii State House - District 48
Hawaii State House - District 50
Hawaii State House - District 51
Honolulu City Council - District 4
Honolulu City Council - District 6
Hawaii County Council - District 5
Hawaii County Council - District 9
Mayor - Maui
Maui County Council - East Maui
Maui County Council - West Maui
Maui County Council - Wailuku-Waihee-Waikapu
Maui County Council - Kahului
Maui County Council - South Maui
Maui County Council - Makawao-Haiku-Paia
Maui County Council - Upcountry
Maui County Council - Lanai
Maui County Council - Molokai
Mayor - Kauai
Kauai County Council
(you can vote for up to 7)OHA Board of Trustees - Maui Representative
OHA Board of Trustees - At-Large Representatives
(you can vote for up to 3)Amendments to the State Constitution Proposed by the Twenty-Seventh Legislature
(you can vote YES or NO on each proposed amendment)Proposed Amendment to the Hawaii County Charter
(you can vote YES or NO on this proposed amendment)Proposed Amendments to the Maui County Charter
(you can vote YES or NO on each proposed amendment)Proposed Amendment by Voter Initiative to the Maui County Code
(you can vote YES or NO on this proposed amendment)Proposed Amendments to the Kauai County Charter
(you can vote YES or NO on each proposed amendment)The Power Ballot is for informational purposes only and cannot be used to officially vote in the general election. No endorsement of any candidate or party is intended. Candidate information has been gathered from public websites and documents.
Did you find a mistake? Do you have a suggestion?Let us know - Email Civic-Celerator
Special thanks to Corie Tanida of Common Cause Hawaii who coordinated a great group of volunteers - Christine Trecker, Connie Clinton, Dustin Schoedel, Jeanne Ohta and Joe Heaukulani. They all spent many hours doing the candidate research that made the Power Ballot possible.
The amazing web development skills of Jason Axelson were critical for pulling in candidate data from the REST service and smoothing the rough edges of my initial prototype.
Mahalo ka kou! - Da Map Guy (Royce Jones)


Homepage
Orders
Merchandise
Add another store
Location
Minimum number of customer per hour
Maximum number of customers per hour
Average number of cookies per customer
Submit New Store
Sales forecast by location


Reload the page with new sessionThe session will be automatically redirected after 5 seconds.

Reload the page with new sessionThe session will be automatically redirected after 5 seconds.


IU and Sung Si Kyung collaborate on modern Christmas song 'First Winter' MV
by danisurstIU and Sung Si Kyung have come together to release a special holiday song!
On December 9 KST, the two singers dropped the music video for the song "First Winter," a sentimental love song reflecting the emotions of a couple celebrating their first Christmas together. The music video follows a couple separately making their way through scenic parts of Seoul before meeting up in front of a large illuminated Christmas tree in the center of town to exchange wrapped gifts.
The single is the second time the two artists have collaborated together, having previously released the duet "It's You" together back in 2010.
Meanwhile, Sung Si Kyung will be holding encore performances of his 2019 'Song' concert on December 20 and 21 at Jamsil Arena in Seoul.


class: center, middle, inverse, title-slide # 1.3 — Review of Economics & Efficiency ## ECON 315 • Economics of the Law • Spring 2021 ### Ryan Safner
Assistant Professor of Economics
<EMAIL_ADDRESS>ryansafner/lawS21
lawS21.classes.ryansafner.com
--- class: inverse # Outline ### [Exchange, Markets, and Efficiency](#15) ### [Problem: Transaction Costs](#31) ### [Problem: Collective Action](#36) ### [Problem: Public Goods](#41) ### [Problem: Externalities](#46) ### [Problem: Market Power](#59) --- # The Two Major Models of Economics as a “Science” .pull-left[ ## Optimization - Agents have .hi[objectives] they value - Agents face .hi[constraints] - Make .hi[tradeoffs] to maximize objectives within constraints .center[ ![](../images/optimize.jpeg) ] ] -- .pull-right[ ## Equilibrium - Agents .hi[compete] with others over **scarce** resources - Agents .hi[adjust] behaviors based on prices - .hi[Stable outcomes] when adjustments stop .center[ ![](../images/equilibriumbalance.png) ] ] --- # Modeling Individual Choice .pull-left[ - The .hi[consumer's utility maximization problem]: 1. **Choose:** .hi-purple[ ] 2. **In order to maximize:** .hi-green[< utility >] 3. **Subject to:** .hi-red[< income and market prices >] ] .pull-right[ .center[ ![](../images/choices.jpg) ] ] --- # Modeling Firm's Choice .pull-left[ .smallest[ - 1st Stage: .hi-purple[firm's profit maximization problem]: 1. **Choose:** .hi-blue[ < output >] 2. **In order to maximize:** .hi-green[< profits >] - 2nd Stage: .hi-purple[firm's cost minimization problem]: 1. **Choose:** .hi-blue[ < inputs >] 2. **In order to _minimize_:** .hi-green[< cost >] 3. **Subject to:** .hi-red[< producing the optimal output >] ] ] .pull-right[ .center[ ![](https://www.dropbox.com/s/zwows56ydpqj9u6/management.jpg?raw=1) ] ] --- # What Does "Efficiency" Mean? .pull-left[ - Regular sense of the word: - Achieving a .hi-purple[specified goal] with as .hi-purple[few resources as possible] - .hi-green[Examples]: - driving - carrying groceries - producing pencils ] .pull-right[ .center[ ![:scale 65%](../images/benaffleckcoffee.jpg) ] ] --- # Problem: What Goal for Society? .pull-left[ - We will ruminate more on this next class - .hi-purple[Society, government, law, etc. has no single, universally agreed-upon goal] - “Society” is not a choosing agent ] .pull-right[ .center[ ![](../images/benevolentdespot.jpg) ] ] --- # Social Problems .pull-left[ .center[ ![](https://www.dropbox.com/s/mh8owncbsm2lqkv/tugofwar.png?raw=1) ] ] .pull-right[ - .hi[Problem 1]: Resources are scarce, and have multiple, rivalrous uses - .hi[Problem 2]: Different people have different subjective valuations for uses of resources ] --- # The Origins of Exchange I .pull-left[ - Why do we trade? - .hi-purple[Resources are in the wrong place!] - People have *better* uses of resources than they are currently being used! ] .pull-right[ .center[ ![:scale 100%](https://www.dropbox.com/s/2ld8qe9p0mjak0b/exchange.png?raw=1) ] ] --- # The Origins of Exchange II .pull-left[ - *Why* are resources in the wrong place? - .hi-purple[We have the same stuff but different preferences] ] .pull-right[ .center[ ![:scale 65%](https://www.dropbox.com/s/pj6s1y20c3qfyfc/boxlunch.jpg?raw=1) ![:scale 65%](https://www.dropbox.com/s/pj6s1y20c3qfyfc/boxlunch.jpg?raw=1) ] ] --- # The Origins of Exchange III .pull-left[ - *Why* are resources in the wrong place? - .hi-purple[We have different stuff and different preferences] ] .pull-right[ .center[ ![:scale 40%](https://www.dropbox.com/s/vcqojr6k058e8hl/3apples.jpg?raw=1) ![:scale 50%](https://www.dropbox.com/s/xvjphzlwechgip6/3oranges.jpg?raw=1) ] ] --- # Economic Efficiency: First Pass .pull-left[ .hi[Economic efficiency]: degree to which as many people as possible get as much as possible of what they want - degree of .hi-purple[preference satisfaction] - How do we measure this? - Expanding budget set `\(\implies\)` satisfying more goals - Income is a main constraint `\(\implies\)` maximize incomes - GDP per capita: market value of what is produced `\(\iff\)` incomes ] .pull-right[  ] --- # The Economic Point of View .pull-left[ - Preferences are .hi-purple[subjective] - .hi-purple[Egalitarianism]: Nobody's preferences are dismissed - .hi-turquoise[Higher incomes + freedom of choice = greater preference satisfaction] - Harder to directly evaluate outcomes, better to look at basic processes/mechanisms (especially exchange) ] .pull-right[ .center[ ![](../images/developmentasfreedom.jpg) ] ] --- class: inverse, center, middle # Exchange, Markets, and Efficiency --- # Social Problems that Markets Solve Well .pull-left[ .center[ ![](https://www.dropbox.com/s/mh8owncbsm2lqkv/tugofwar.png?raw=1) ] ] .pull-right[ - **Solution**: Prices in a functioning market accurately measure .hi[opportunity cost] of using resources in a particular way - .hi-purple[The price of a resource is the amount someone else is willing to pay to acquire it from its current use/owner] ] --- # Perfectly Competitive Market .pull-left[  ] .pull-right[  ] .smallest[ - In a .hi[competitive market] in .hi[long run equilibrium]: - .hi-purple[Economic profit] is driven to $0; resources (factors of production) optimally allocated - .hi-purple[Allocatively efficient]: `\(p=MC(q)\)`, maximized .blue[CS] `\(+\)` .red[PS] - .hi-purple[Productively efficient]: `\(p=AC(q)_{min}\)` (otherwise firms would enter/exit) ] --- # Allocative Efficiency in Competitive Equilibrium I .pull-left[  ] .pull-right[ - .hi[Allocative efficiency]: resources are allocated to highest-valued uses - Goods are produced up to the point where .blue[marginal benefit] `\(=\)` .red[marginal costs] ] --- # Allocative Efficiency in Competitive Equilibrium II .pull-left[  ] .pull-right[ - **Economic surplus** = .blue[Consumer surplus] + .red[Producer surplus] - Maximized in competitive equilibrium - Resources flow away from those who value them the lowest (min WTA) to those that value them the highest (max WTP) - creating .red[PS] and .blue[CS] - .hi-purple[The social value of resources is **maximized** by allocating them to their highest valued uses!] ] --- # Markets and Pareto Efficiency .pull-left[ .smallest[ - Suppose we start from some initial allocation (.blue[A]) ] ] .pull-right[  ] --- # Markets and Pareto Efficiency .pull-left[ .smallest[ - Suppose we start from some initial allocation (.blue[A]) - .hi[Pareto Improvement]: at least one party is better off, and no party is worse off - .green[D, E, F, G] are improvements - .red[B, C, H, I] are not ] ] .pull-right[  ] --- # Markets and Pareto Efficiency .pull-left[ .smallest[ - Suppose we start from some initial allocation (.blue[A]) - .hi[Pareto Improvement]: at least one party is better off, and no party is worse off - .green[D, E, F, G] are improvements - .red[B, C, H, I] are not - .hi[Pareto optimal/efficient]: no possible Pareto improvements - Set of Pareto efficient points often called the .hi-green[Pareto frontier].magenta[†] - Many possible efficient points! ] .tiny[.magenta[†]I’m simplifying...for full details, see [class 1.8 appendix](https://microf20.classes.ryansafner.com/files/CT_Application_2_Exchange.pdf) about applying consumer theory!] ] .pull-right[  ] --- # Markets and Pareto Efficiency .pull-left[ .smallest[ - Voluntary exchange in markets is a .hi[Pareto improvement] - *In equilibrium*, markets are .hi[Pareto efficient]: there are no more possible Pareto improvements - all gains from trade exhausted, `\(q_S=q_D\)`, no pressure for change - Note Pareto efficiency contains a normative claim about .hi-purple[equity] - It might be possible to improve the *total* welfare of *society* - But if this comes *at the expense of even 1 individual*, it’s not a Pareto improvement! ] ] .pull-right[ .center[ ![](https://www.dropbox.com/s/6k6eqkl6fnnlh7v/handshake.png?raw=1) ] ] --- # Markets and Pareto Efficiency .pull-left[ - Pareto efficiency is conceptual gold standard: allow all welfare-improving exchanges so long as nobody gets harmed - In practice: Pareto efficiency is a *first best* solution - only takes one holdout to disapprove to violate Pareto efficiency ] .pull-right[ .center[ ![](https://www.dropbox.com/s/ukwgvwjmrl15ts0/holdout3.jpg?raw=1) ] ] --- # Markets and Kaldor-Hicks Efficiency .pull-left[ .smallest[ - .hi[Kaldor-Hicks Improvement]: an action improves efficiency its generates more social gains than losses - those made better off could in principle compensate those made worse off - .hi[Kaldor-Hicks efficiency]: no potential Kaldor-Hicks improvements exist - Keeps intuitive appeal of Pareto but more practical - Every Pareto improvement is a KH-improvement (but not the other way around!) - Consider policies where winners' maximum WTP `\(>\)` losers' minimum WTA - Policies should **maximize social value of resources** ] ] .pull-right[ .center[ ![](https://www.dropbox.com/s/y3eo9l6m6jr7d3g/costbenefit.jpg?raw=1) ![](https://www.dropbox.com/s/krmhqn3ryhk9l03/compensate.jpg?raw=1) ] ] --- # Pareto vs. Kaldor-Hicks Efficiency .pull-left[ .smallest[ - .hi-green[Example]: .hi-purple[“eminent domain”] - The “takings clause” of the 5th Amendment to the U.S. Constitution: > “No person shall...be deprived of life, liberty, or property, without due process of law; nor shall private property be taken for public use, without just compensation.” - What is a “public use”? What is “just compensation”? - [*Kelo v. City of New London*](https://en.wikipedia.org/wiki/Kelo_v._City_of_New_London), 545 U.S. 469 (2005 ] ] .pull-right[ .center[ ![:scale 80%](../images/Kilocase.jpg) ] ] --- # Welfare Economics .smallest[ - The .hi[1st Fundamental Welfare Theorem]: markets in competitive equilibrium maximize allocative efficiency of resources and are Pareto efficient - initial endowments does not affect efficiency but does affect final distribution ] -- .smallest[ - The .hi[2nd Fundamental Welfare Theorem]: any desired Pareto efficient distribution can be achieved with a lump-sum tax & transfer scheme, and then allowing markets to work freely - allows a targetted (re)-distribution to be achieved without sacrificing efficiency ] --- # Welfare Economics .smallest[ - **Markets are great when:** 1. They are .hi-purple[Competitive]: many buyers and many sellers 2. They each .hi-purple[equilibrium] (.hi-purple[prices are free to adjust]): absence of transactions costs or policies *preventing prices from adjusting* to meet supply and demand 3. .hi-purple[There are no externalities].magenta[†] are present: costs and benefits are fully internalized by the parties to transactions ] -- .smallest[ - If any of these conditions are not met, we have .hi[market failure] - May be a role for governments, other institutions, or entrepreneurs to fix ] .footnote[.magenta[†] Or public goods, or asymmetric information. But in essence, I am treating these as special cases of more common externalities.] --- class: inverse, center, middle # Problem: Transaction Costs --- # Dis-equilibrated Markets .pull-left[ - To *reach* equilibrium, market prices need to be able to adjust - Shortage: price needs to rise - Surplus: price needs to fall - There are .b[*unrealized* gains from trade] that exist in disequilibrium (shaded) - Buyers & sellers both can be made better off if they can adjust the price ] .pull-right[  ] --- # Dis-equilibrated Markets .pull-left[ .smallest[ - If market prices are *prevented* from adjusting, shortage/surplus becomes *permanent* - Lost .blue[CS] and/or .red[PS]: .b[Deadweight loss (DWL)] - **inefficiency** created by (permanent) diseq. - Various government policies can prevent markets from equilibrating & create DWL: - .hi-purple[Price regulations] (price ceiling like rent control, price floor like minimum wage) - .hi-purple[Taxes, subsidies, tariffs, quotas].magenta[†] - These should have been covered in Principles ] .tiny[.magenta[†] Some may be necessary (taxes fund government), but create market inefficiencies.] ] .pull-right[  ] --- # Transaction Costs and Exchange I .pull-left[ - .hi[Transaction costs]: - .hi-purple[Search costs]: cost of finding trading partners - .hi-purple[Bargaining costs]: cost of reaching an agreement - .hi-purple[Enforcement costs]: **trust** between parties, cost of upholding agreement, dealing with unforeseen contingencies, punishing defection, using police and courts ] .pull-right[ .center[ ![](https://www.dropbox.com/s/r9swgigquy9m6g2/transactionscosts.JPG?raw=1) ] ] --- # Transaction Costs and Exchange II .pull-left[ - With high transaction costs, resources *cannot* be traded - Resources *cannot* be switched to higher-valued uses - If others value goods higher than their current owners, resources are *inefficiently* allocated! ] .pull-right[ .center[ ![](https://www.dropbox.com/s/r9swgigquy9m6g2/transactionscosts.JPG?raw=1) ] ] --- class: inverse, center, middle # Problem: Collective Action --- # Generalizing: Collective Action Problems .pull-left[ - .hi[Collective action problem]: situation where an individual's interest and a group's interest may conflict - Benefits (or costs) of outcome are **nonrival** and flow to *all members* of the group - Decisions & costs need to be incurred by individuals - **Individual preferences** need to aggregate into a **single decision/outcome** ] .pull-right[ .center[ ![](https://www.dropbox.com/s/4xum8hnk9tvrr0i/individualvsgroup.png?raw=1) ] ] --- # Collective Action Problem: Examples I .center[ ![:scale 80%](https://www.dropbox.com/s/gzl0ga0ytz2o8co/concert.jpg?raw=1) ] --- # Collective Action Problem: Examples II .center[ ![:scale 80%](https://www.dropbox.com/s/seu25mb5gulwxqy/trafficjam.png?raw=1) ] --- # Collective Action Costs I .pull-left[ - Groups may share a **common interest** - But **composed of individuals with their own preferences** - Individuals bear the personal cost of contributing - Individuals gain a small share of the benefits of group action - Additionally, **cost of bargaining** to get a group to agree on decision ] .pull-right[ .center[ ![](https://www.dropbox.com/s/4xum8hnk9tvrr0i/individualvsgroup.png?raw=1) ] ] --- class: inverse, center, middle # Problem: Public Goods --- # A Classic Economic Problem .pull-left[ .center[ ![](https://www.dropbox.com/s/dazzqlckce0akou/openland.jpg?raw=1) ] ] .pull-right[ - .hi[Public Good]: a good that is .hi-purple[non-rival] and .hi-purple[non-excludable] - .hi-purple[Rivalry]: one use of a resource removes it from other uses - .hi-purple[Excludability]: ability or right to prevent others from using it (ownership) ] --- # The Free Rider Problem .pull-left[ - Individual bears a **private cost to contribute**, but only gets a **small fraction of the (dispersed) benefit** of a good - If individuals can gain **access** to the good (nonexcludable) **without paying**, may lead to... - .hi[Free riding]: individuals consume the good without paying for it ] .pull-right[ .center[ ![](https://www.dropbox.com/s/evcpgmouveig2p0/freeriding.jpg?raw=1) ] ] --- # Examples? .pull-left[ .center[ ![](https://www.dropbox.com/s/p6jeypz18wnvsjn/park2.png?raw=1) ] ] .pull-right[ .center[ ![:scale 100%](https://www.dropbox.com/s/i4e5a16dy4qzhdq/jetfighter.png?raw=1) ] ] --- # Market Failure from Public Goods .pull-left[ - No incentive for people to contribute and pay for the good - If enough people obtain the benefits without incurring the costs... - **Not profitable** for private market actors to supply it ] .pull-right[ .center[ ![](https://www.dropbox.com/s/5zn7f9vzuxxqx8k/cuttingline.jpg?raw=1) ] ] --- class: inverse, center, middle # Problem: Externalities --- # Supply and Demand: Social Costs & Benefits .pull-left[  ] .pull-right[ - .hi-blue[Demand: marginal social benefit (MSB)] - value to consumers of consuming output - .hi-pink[Supply: marginal social cost (MSC)] - opportunity cost of pulling resources out of other uses - **Equilibrium**: `\(MSB=MSC\)` - using resources efficiently, no *better* alternative uses ] --- # Supply and Demand: Social Costs & Benefits .pull-left[  ] .pull-right[ - **Price system** mitigates costs and benefits of people's actions - People using scarce resources must **account for consequences**: - Pay to pull scarce resources out of other uses in society - Compensated for producing something valuable for others ] --- # Externality .pull-left[ - .hi[Externality]: an action that incurs a cost or a benefit not compensated via prices - Often interpretted as an action that affects (benefits or harms) a third party not privy to the action ] .pull-right[ .center[ ![](https://www.dropbox.com/s/81kvissy1njej61/pollution.png?raw=1) ] ] --- # Externality .pull-left[ - The real problem is that it is .hi-purple[external] to the price system! - People base decisions off of their preferences and opportunity costs of resources for society (captured in prices) - Prices properly negotiate the opportunity costs and provide information to people - But without price, decisions do not .hi-purple[internalize] those effects! ] .pull-right[ .center[ ![](https://www.dropbox.com/s/81kvissy1njej61/pollution.png?raw=1) ] ] --- # Pigouvian Solutions .left-column[ .center[ ![:scale 80%](https://www.dropbox.com/s/ekndrrnmhz2kna6/pigou.png?raw=1) A.C. Pigou 1877-1959 ] ] .right-column[ - 1920, *The Economics of Welfare* - Principle of .hi["payment in accordance with product"] - People should pay average externality of their actions - Markets make you do this automatically - If markets fail, policy can force the market to work again - .hi-purple[Problem with externality is that there is a missing price!] ] --- # Negative Externality .pull-left[  ] .pull-right[ .hi-pink[Marginal _Private_ Cost] to producer is less than .hi-red[Marginal _Social_ Cost] to society **Market Equilibrium (B)** too much `\(q\)` at too low `\(p\)` compared to **Social Optimum (A)** ] --- # Negative Externality .pull-left[  ] .pull-right[ .hi-pink[Marginal _Private_ Cost] to producer is less than .hi-red[Marginal _Social_ Cost] to society **Market Equilibrium (B)** too much `\(q\)` at too low `\(p\)` compared to **Social Optimum (A)** - Overproduction due to external cost ] --- # Negative Externality .pull-left[  ] .pull-right[ .hi-pink[Marginal _Private_ Cost] to producer is less than .hi-red[Marginal _Social_ Cost] to society **Market Equilibrium (B)** too much `\(q\)` at too low `\(p\)` compared to **Social Optimum (A)** - Overproduction due to external cost - A **deadweight loss** from overproduction ] --- # Negative Externality: Pigouvian Solution .left-column[ .center[ ![:scale 80%](https://www.dropbox.com/s/ekndrrnmhz2kna6/pigou.png?raw=1) A.C. Pigou 1877-1959 ] ] .right-column[ - Policy solutions to externalities should .hi-purple[focus on the missing price] - Narrowly tailor policy to create or modify price - "Pigouvian" tax or subsidy ] --- # Negative Externality: Pigouvian Solution .pull-left[  ] .pull-right[ - Set a specific tax `$$t = MSC-MPC$$` - Eliminates the DWL - .hi-purple[Internalizes the externality] into the price system - Producers (and consumers) now consider the true cost to society - `\(MPC\)` (with tax) `\(=MSC\)` ] --- # Another Classic Economic Problem .pull-left[ .center[ ![](https://www.dropbox.com/s/dazzqlckce0akou/openland.jpg?raw=1) ] ] .pull-right[ - .hi[Tragedy of the commons]: multiple people have unrestricted access to the same .hi-purple[rivalrous] resource - .hi-purple[Rivalry]: one use of a resource removes it from other uses .source[Hardin, Garett, 1968, "The Tragedy of the Commons," *Science* 162(3859):1243-1248] ] --- # Another Classic Economic Problem .pull-left[ .center[ ![:scale 100%](https://www.dropbox.com/s/qgnqwqr86wi1nlz/pollutedriver.png?raw=1) ] ] .pull-right[ - Cannot exclude others - No responsibility over outcome - Incentive to **overexploit** and **deplete** resource (before others do) - A negative externality on others ] --- class: inverse, center, middle # Problem: Market Power --- # Perfectly Competitive Market .pull-left[  ] .pull-right[  ] .smallest[ - In a .hi[competitive market] in .hi[long run equilibrium]: - .hi-purple[Economic profit] is driven to $0; resources (factors of production) optimally allocated - .hi-purple[Allocatively efficient]: `\(p=MC(q)\)`, maximized .blue[CS] `\(+\)` .red[PS] - .hi-purple[Productively efficient]: `\(p=AC(q)_{min}\)` (otherwise firms would enter/exit) ] --- # Market Power .pull-left[  ] .pull-right[ - Consider a market with some simplified cost assumptions: - No fixed costs, constant variable costs - implies `\(\color{red}{MC(q)=AC(q)}\)` - If this was a *competitive* market, firms would set `\(p_c=MC(q)\)` and (collectively), industry would produce `\(q_c\)` - .blue[Consumer surplus] maximized ] --- # Market Power .pull-left[  ] .pull-right[ - A **monopolist** faces the *entire* market demand and sets `\((q_m,p_m)\)`: - Sets .purple[`\\(MR(q)\\)`] `\(=\)` .red[`\\(MC(q)\\)`] at `\(q_m\)` - Raises price to .blue[maximum consumers are WTP (Demand)]: `\(p_m\)` - .hi-purple[Restricts output and raises price], compared to competitive market - Earns .hi-green[monopoly profits (`\\(p>AC\\)`)] - Loss of .hi-blue[consumer surplus] ] --- # Market Power .pull-left[  ] .pull-right[ - **Deadweight loss** of surplus destroyed from lost gains from trade - Consumers willing to buy more than `\(q_m\)`, if the monopolist would lower prices! - Monopolist *would* benefit by accepting lower prices to sell more, but this would yield *less* than maximum profits ]


| Opcode | Instruction | 64-Bit Mode | Compat/Leg Mode | Description |
| D9 F5 | FPREM1 | Valid | Valid | Replace ST(0) with the IEEE remainder obtained from dividing ST(0) by ST(1). |
Computes the IEEE remainder obtained from dividing the value in the ST(0) register (the dividend) by the value in the ST(1) register (the divisor or modulus), and stores the result in ST(0). The remainder represents the following value:
Remainder ← ST(0) − (Q ∗ ST(1))
Here, Q is an integer value that is obtained by rounding the floating-point number quotient of [ST(0) / ST(1)]toward the nearest integer value. The magnitude of the remainder is less than or equal to half the magnitude of the modulus, unless a partial remainder was computed (as described below).
This instruction produces an exact result; the precision (inexact) exception does not occur and the rounding control has no effect. The following table shows the results obtained when computing the remainder of various classes of numbers, assuming that underflow does not occur.
ST(1)
| − ∞−0 +0 | − F ±F or −0 − 0 + 0 ± F or + 0 | − 0 **** | + 0 **** | + F ± F or − 0 − 0 + 0 ± F or + 0 | + ∞ST(0) -0 +0 ST(0) | NaN NaN NaN NaN NaN NaN NaN |
| NaN | NaN | NaN | NaN | NaN | NaN | NaN |
Notes: F Means finite floating-point value. * Indicates floating-point invalid-arithmetic-operand (#IA) exception. ** Indicates floating-point zero-divide (#Z) exception.
When the result is 0, its sign is the same as that of the dividend. When the modulus is ∞, the result is equal to the value in ST(0).
The FPREM1 instruction computes the remainder specified in IEEE Standard 754. This instruction operates differently from the FPREM instruction in the way that it rounds the quotient of ST(0) divided by ST(1) to an integer (see the “Operation” section below).
Like the FPREM instruction, FPREM1 computes the remainder through iterative subtraction, but can reduce the exponent of ST(0) by no more than 63 in one execution of the instruction. If the instruction succeeds in producing a remainder that is less than one half the modulus, the operation is complete and the C2 flag in the FPU status word is cleared. Otherwise, C2 is set, and the result in ST(0) is called the partial remainder. The exponent of the partial remainder will be less than the exponent of the original dividend by at least 32. Software can re-execute the instruction (using the partial remainder in ST(0) as the dividend) until C2 is cleared. (Note that while executing such a remainder-computation loop, a higher-priority interrupting routine that needs the FPU can force a context switch in-between the instructions in the loop.)
An important use of the FPREM1 instruction is to reduce the arguments of periodic functions. When reduction is complete, the instruction stores the three least-significant bits of the quotient in the C3, C1, and C0 flags of the FPU
status word. This information is important in argument reduction for the tangent function (using a modulus of π/4), because it locates the original angle in the correct one of eight sectors of the unit circle.
This instruction’s operation is the same in non-64-bit modes and 64-bit mode.
D ← exponent(ST(0)) - exponent(ST(1)); IF D < 64 THEN Q ← Integer(RoundTowardNearestInteger(ST(0) / ST(1))); ST(0) ← ST(0) - (ST(1) ∗ Q); C2 ← 0; C0, C3, C1 ← LeastSignificantBits(Q); (* Q2, Q1, Q0 *) ELSE C2 ← 1; N ← An implementation-dependent number between 32 and 63; QQ ← Integer(TruncateTowardZero((ST(0) ST(0) ← ST(0) - (ST(1) ∗ QQ ∗ 2(D − N)); FI;
| C0 | Set to bit 2 (Q2) of the quotient. |
| C1 | Set to 0 if stack underflow occurred; otherwise, set to least significant bit of quotient (Q0). |
| C2 | Set to 0 if reduction complete; set to 1 if incomplete. |
| C3 | Set to bit 1 (Q1) of the quotient. |
| #IS | Stack underflow occurred. |
| #IA | Source operand is an SNaN value, modulus (divisor) is 0, dividend is ∞, or unsupported format. |
| #D | Source operand is a denormal value. |
| #U | Result is too small for destination format. |
| #NM | CR0.EM[bit 2] or CR0.TS[bit 3] = 1. |
| #MF | If there is a pending x87 FPU exception. |
| #UD | If the LOCK prefix is used. |
Same exceptions as in protected mode.
Same exceptions as in protected mode.
Same exceptions as in protected mode.
Same exceptions as in protected mode.


Sometimes when creating a multi-linear regression model, it’s wise to stratify the y
(target) variable when you split your training and testing data from the total sample (train/test/split). Why would we do this? If you have y
data that is not normally distributed, you may have a situation where your random samples of your sample might not be sufficiently representative of the sample. Meta!
Continue reading
I wasn’t sure what to write about for my first post, but setting up this site has been a fun learning experience–so I’ll write about that. Keep in mind this site and post are still works in progress. While it might not be best practice to draft and iterate on the public facing site, I am doing it anyway :) Break stuff and fix it, right?
Continue reading


Memory Lane is a Community Art Project developed in 7 hours at the Seattle Art + Civics + Code Hackathon by all-star team Ethan Phelps-Goodman, Allie Sterling, Rob Middleton, and Paul Ort. 12/15/2014
Features
- Take a virtual walk through three neighborhoods in 2007 and 2014 – synced side by side.
- Observe and track land use changes
Upcoming features
- View a timeline of historical photos and proposed development plans in a 100m radius from your position.
- View historical satellite imagery synced to your walk
- Take a synced walk - anywhere


Net neutrality affects everyone who uses the Internet. This protest is for all of us. Here’s a big list of creative ways to “Break the Internet” for the 48 hours before the FCC vote. Go wild and Tweet every 10 minutes today, change your job on LinkedIn to “Defending Net Neutrality” or say you’re “Married to the Open Internet” on Facebook. Do whatever you can to get *everyone’s* attention and drive phone calls to Congress. If you run a website or blog, go here.
Change your featured website to battleforthenet.com.
You can join with Snapchat…
Save this photo and upload it to your Snapchat story.
You can join with Facebook…
“Break the Internet” and get everyone’s attention by changing your “Relationship Status.” Get “Married” (to the free and open Internet). Share the status and then immediately add a comment sending people to take action at battleforthenet.com.
a) Go to “About” section of your Facebook page and choose “Family and Relationships” in the left sidebar. Add a relationship status and choose "Married" and hit “Save Changes”.
b) From the top right of the post click on "edit life event". Change the Title to "Free and Open Internet" or "Net Neutrality".
c) Share it and add a comment to the post that says: "I'm married to the free and open Internet! Go to https://www.battleforthenet.com to help defend net neutrality. Change your relationship status to get everyone’s attention. Get involved at https://www.breaktheinternetprotest.org!"
Add a “new job” position to your profile called “Defending Net Neutrality at BattleForTheNet.com”—this will trigger a notification to your network and get more people to take action before the vote. Here’s how:
1. Make sure your settings are set to: “notify people when your profile changes”. Go to the upper right hand corner, choose settings and go to the Privacy tab. Make sure you choose yes on “Sharing profile edits”.
2. Go to your profile and choose the pen to edit. And, add a new position:
3. Here’s some text you can add:
“The FCC is voting to end net neutrality on Dec. 14th. Congress can still stop the vote, but only if we make them. Go to https://www.battleforthenet.com to #StoptheFCC and defend net neutrality before it's too late.
Then, join me in "breaking the Internet" by adding a new job position to your LinkedIn profile too and tell your network how to #stopthefcc: http://breaktheinternetprotest.org”
If you’re a mod, check this thread with CSS you can use to change your theme and “break” your subreddit.
You can join the protest with your site…
You can display a prominent alert on your site that shows the world what the web will look like without net neutrality, and asks your visitors to call Congress. Click here for a demo, grab the code on GitHub, or check out these instructions for Tumblr. None of these will actually block, slow, or paywall your site. But, they will let your users contact their representatives in Congress without having to leave your page. They appear once per user per day and users can easily click away.
Just add this line of code to your site's header:
Or to go epic and be a hero to the Internet, you can completely turn your site red. Here's an example from Reddit and you can get the code on Github. (Visitors can still scroll down to get to your site, but c'mon, this is really epic.)
You can use these banners and images too…
You can even participate on YouTube and Vimeo with this video bumper.
We made a short video reel that explains why net neutrality matters, and how Internet users can tell the FCC and Congress to protect the open web at all costs through BattleForTheNet.com. Add this reel to your online creations starting now. Tell your viewers about the day of action on YouTube, Vimeo, or wherever else you put your videos!
There are square, vertical, and horizontal versions of the bumper for you to download here.
Keep in touch!
Sign up with your email and we'll send you instructions on how to take action and urgent updates leading into the day of action. Forward this to your friends for maximum impact!
Hmmm... That didn't work :/
We’ll send you everything you need to participate. Fight for the Future will email you about work related to this, and you can unsubscribe at any time. If you enter your number (it's optional) Fight for the Future may follow up by SMS, at which point message & data rates apply. You can always text STOP to stop receiving messages. Here’s our Privacy Policy.
We’ll send you everything you need to participate. Demand Progress will email you about work related to this, and you can unsubscribe at any time. Here’s our Privacy Policy.
We will connect you to the offices of your lawmakers.
You can use this script when talking to them -- just introduce yourself, be polite, and say:
"I support 'Title Two' net neutrality rules and I urge you to oppose the FCC's plan to repeal them. Specifically, I'd like you to contact the FCC Chairman and demand he abandon his current plan."


Meet a partner for your best holiday
-
Bradley Hunter
Based in Chicago. I love playing tennis and loud music.
-
Lucas Marsha
I get my inspiration from nature and objects around me. I have a passion to colours, typography and skateboards.
-
Heather Walker
I am a happy person that loves cats and climbing on mountains.
-
Bradley Hunter
Based in Chicago. I love playing tennis and loud music.


Name:
Height:
cm
Date of birth:
Name:
Michael Jordan
Height:
198
cm
Date of birth:
February 17, 1963
Name:
Larry Bird
Height:
206
cm
Date of birth:
December 7, 1956
Name:
Magic Johnson
Height:
206
cm
Date of birth:
August 14, 1959
Add new person
Name
Height
Date of birth
Add person
View model:


{% extends "layout.html" %} {% block page_title %} Employment type {% endblock %} {% block content %} BETA This is a new service – your feedback will help us to improve it. Can the claimant provide these documents today? Yes No {% endblock %}
BETA This is a new service – your feedback will help us to improve it.


Here is the codecola.php, download it, then upload it to a folder of PHP server.
2. Config
//Users can visit modified pages through this address. And pages will save in this folder, so make sure the directory has access to write.
$path = "http://kxt.koubei.com/codecola/";
//Set filename. Filename use timestamp by default.
$fileName = time();


+ Add a Rule for this page
Settings
No Rules are running! You can manage the rules in the settings page.
Rule
Interval
Last Run
Count
Cancel
Rule-1
5 m
00:00 AM
999


UBC Course Scheduler
Calendar
Auto Scheduling
Contact
Term 1
Term 2
Lecture
Tutorial
Lab
Course Code:


Food Rescue
Home
(current)
The Market
My Posts
Contact
About Us
Help
Sign Up
Login
Logout
Put food on the table, not in the landfill
Log In
Sign Up
628
Pounds of Food Saved
71
Current Offerings


Three-Steer Examples
Wireframe:
Seek
Flee
Arrive
Pursue
Evade
Interpose
Wander
Collision Avoidance
Path Following
Leader Following
Queue
Flocking
Animated characters:
Seek
Interpose
Wander
Collision Avoidance
Path Following
Leader Following
Queue
Flocking


So you want to Speak...! *Fist Bump*
*
indicates required
Email Address
*
Preferred First Name
*
Last Name
*
Phone Number
Twitter
LinkedIn
Website
I have a talk ready to go
Yes
No
With a little notice
My talk title
The description of my talk
These are the topics I want to talk about..


Chapter 2 Cross referencing
2.1 Chapters or sections
Always give you sections an additional reference…e.g. # Cross referencing {#crossref}
This gives us two reference points. The first we can use to reference the section name…
- We want to say see the Introduction (or other section label)we use …
[Cross referencing]
giving Cross referencing
But what if we want to reference the section number (e.g. Chapter 1 or section 4.2)
- Just reference the label we gave to the section….see Chapter
\@ref(crossref)
giving see Chapter 2
2.2 Figures, tables, even code chunks
2.2.1 Figures
When you create a figure, table or code chunk there is an option to name the chunk something. Do it!. Don’t be like me and not! Be warned that these chunk names can’t have any fancy or strange characters in them e.g. _. I think a - is allowed, but i’d keep it simple. Here is a figure. In the chunk options after r
i have specified nice-fig, echo=FALSE, fig.cap='Here is a nice figure!', out.width='80%'
To cross reference this just include Figure \@ref(fig:nice-fig)
which gives…Figure 2.1.
2.2.2 Tables
For tables i’d recommend using the kable
package. Here is an example table, same deal as the Figures section with naming the code chunk.
::kable(
knitrhead(iris, 20), caption = 'Here is a nice table!',
booktabs = TRUE
)
| Sepal.Length | Sepal.Width | Petal.Length | Petal.Width | Species |
|---|---|---|---|---|
| 5.1 | 3.5 | 1.4 | 0.2 | setosa |
| 4.9 | 3.0 | 1.4 | 0.2 | setosa |
| 4.7 | 3.2 | 1.3 | 0.2 | setosa |
| 4.6 | 3.1 | 1.5 | 0.2 | setosa |
| 5.0 | 3.6 | 1.4 | 0.2 | setosa |
| 5.4 | 3.9 | 1.7 | 0.4 | setosa |
| 4.6 | 3.4 | 1.4 | 0.3 | setosa |
| 5.0 | 3.4 | 1.5 | 0.2 | setosa |
| 4.4 | 2.9 | 1.4 | 0.2 | setosa |
| 4.9 | 3.1 | 1.5 | 0.1 | setosa |
| 5.4 | 3.7 | 1.5 | 0.2 | setosa |
| 4.8 | 3.4 | 1.6 | 0.2 | setosa |
| 4.8 | 3.0 | 1.4 | 0.1 | setosa |
| 4.3 | 3.0 | 1.1 | 0.1 | setosa |
| 5.8 | 4.0 | 1.2 | 0.2 | setosa |
| 5.7 | 4.4 | 1.5 | 0.4 | setosa |
| 5.4 | 3.9 | 1.3 | 0.4 | setosa |
| 5.1 | 3.5 | 1.4 | 0.3 | setosa |
| 5.7 | 3.8 | 1.7 | 0.3 | setosa |
| 5.1 | 3.8 | 1.5 | 0.3 | setosa |
Now to cite the table it’s just Table \@ref(tab:nice-tab)
, giving Table 2.1
2.3 Citing documents
To cite documents they need to be in a .bib
file, that must be loaded within your index.Rmd
with the bibliography:
argument. Have a look at my index.Rmd
and you will see there are three such files, two that were provided as an example here book.bib
, packages.bib
and one that i added test.bib
. I can simply cite the papers within them using the citation key e.g. [@xie2015]
giving (Xie 2015). Make sure you remove the ones you don’t need.
If you remove the citation from the []
it will give Xie (2015).
When citing multiple authors use a ; [@xie2015; @maclachlan2017urban]
= (Xie 2015; MacLachlan et al. 2017)
To remove the author add a minus sign -@maclachlan2017urban
= (2017)
2.4 Citing using software
Zotero can now continuously update your .bib
file.
To do so:
Download the latest release — the
.xpi
file: https://github.com/retorquere/zotero-better-bibtex/releases/tag/v5.2.108In Zotero > Tools > Add ons > Extensions
Select the cog > Install add on from file
Select the
.xip
> restart Zotero.
On the restart select the default naming convention.
To export the library
File > export
Select Better BibLaTex
Click keep updated
Select the file to save into your Thesis project
Make sure you have the file listed in your
bibliography
in theindex.Rmd
file
You can also manage references using citr
which makes finding them to cite much easier. In RStudio go: Addins (top tool bar) > insert citations.
2.5 Footnotes
To add a footnote use ^[This is a footnote]
to create.1
References
This is a footnote↩


Your browser does not support canvas :(.
Parameters
random seed:
separator trail length:
run delay (ms):
cloud size:
base width:
width variance:
base height:
height variance:
Current Classification
TP
FP
TN
FN
Precision
Recall
F1


DrACO
See also
SeaClouds
draco-types.tosca
DrACO
Discovering Available Cloud Offerings.
Offering type
All
IaaS
PaaS
Cloud provider
Additional requirements
Add requirement..
Add software support..
Clear
Find!


Address: 127.127.23.u
Reference ID: TPTB
Driver ID: PTP-ACTS
Serial Port: /dev/ptbu
; 1200 baud, 8-bits,
no parity
Features: none
Requires: /usr/include/sys/termios.h
header file with
modem control
No further information available.
When enabled by the flag4
fudge flag, every received
timecode is written as-is to the clockstats
file.
time1 time
time2 time
stratum number
refid string
USNO
.
flag1 0 | 1
flag2 0 | 1
flag3 0 | 1
ppsclock
line discipline/streams module if set.
flag4 0 | 1
clockstats
recording if set.
Additional Information


Beo Courses
Our courses range from Beginner level to Advanced levels so that you can get the full spectrum of learning. Integrated into these courses are both video lessons led by professional instructors, along with mini challenges to complete so that you can fully grasp the fundamnetlas and learn the technical tools that are used in the desing world.


Pennmate Notify
When a course opens, you will be notified in real-time via push notification on your device.
See DetailsPennmate Course Plan
Plan your entire schedule intelligently via customizable constraints.
Penn Automate
A self-started project whose goal is to help Penn students automating tasks that are usually repetitive or hard for humans.
When a course opens, you will be notified in real-time via push notification on your device.
See DetailsPlan your entire schedule intelligently via customizable constraints.


[viewBag] title = "Payment Status" url = "/payments/ok" layout = "1default" is_hidden = 0 navigation_hidden = 0 ==
Once your payment is successful, a confirmation email will be sent to your inbox.
Please note: Transfers to your account(s) can only be made during our operating hours - 0900-2000 GMT, 7 days a week.


[§658J-14] Recording of hearing. (a) Except as provided in subsection (b) an arbitration hearing need not be recorded unless:
(1) Otherwise required by law of this State other than this chapter;
(2) Required by the arbitrator;
(3) Provided by the arbitration agreement; or
(4) Requested by a party.
(b) An arbitrator shall require a verbatim recording be made of any part of an arbitration hearing concerning a child-related dispute. [L 2017, c 113, pt of §1]


For more information please don't hesitate to contact us using one of the methods below:
Email<EMAIL_ADDRESS>Phone: 07800 517565
Mailing list coming soon


[gecode-users] Reified max/min
Jonathan MÃ¶rndal
Jonathan.Morndal.7625 at student.uu.se
Wed Apr 18 17:04:22 CEST 2007
Hello all!
I would like to use a reified version of the max/min functions in
Gecode/J. As far as I can see there are none. Is this true, and if so,
are there any "quick fix"?
One idea I had was to model it as numerous inequalities and equalities
instead, but I guess the propagation will not be very good in that case.
Thanks in advance for any help!
/Jonathan
Clarification:
What I want to model exactly:
x_0 = min{x_i,...,x_j}
or
x_1 = min{x_k,...,x_l}
or
...
or
x_p = min{x_m,...,x_n}
My (probably pretty bad) solution would then be
((x_0 \leq x_i and ... and x_0 \leq x_j)
and
(x_0 = x_i or ... or x_0 = x_j))
or
((x_1 \leq x_k and ... and x_1 \leq x_l)
and
(x_1 = x_k or ... or x_1 = x_l))
or
...
or
((x_p \leq x_m and ... and x_p \leq x_n)
and
(x_p = x_m or ... or x_p = x_n))
More information about the gecode-users
mailing list


Javascript can convert an SVG image into PNG/JPEG format and allow the user to download the SVG image in SVG, PNG and JPEG format.
It is a good practice to concatenate and minify all javascript files into a single file for performance reasons. Same is true for CSS.
ES6 is currently not supported by all browsers. A Grunt task can be used to transpile ES6 into browser compatible ES5 using Babel and Browserify.
Less can be compiled into CSS using a Grunt task.
Font and image files are usually copied to the distribution directory during build process. A grunt task can used to do this.
Jade can be compiled into HTML using a Grunt task.


v0.11.0
Nett:
- Add: API to map object properties to specific TOML keys #69
- Refactor: [Breaking Change] Make TOML object factory API fluent #68
Asp.Net:
- Fix: 'Unexpected' exception when loading unsupported TOML types #38
- Fix: Deeper nested config objects loaded correctly #71
v0.10.1
Nett:
- Add: TomlObjects implement
ToString()
#63 - Fix:
Get<object>
automatically maps to equivalent CLR type #63 - Fix: DateTime Read/Write format corruption #66
v0.10.0
Nett:
- Nett is now TOML v0.5.0 compliant
- NuGet packages are strong named by default, '.StrongName' versions of packages are obsolete.
- Refactor: New lexer and parser (improved performance)
- Fix: Inline tables serialized in wrong container #51
v0.9.0
Nett:
- Breaking Change: Rename TomlTimeSpan to TomlDuration
- Breaking Change: TomlDuration uses Go-Like duration format as described in Toml/#514
- Fix: Updating of TomlTables with TableArrayTypes #44
- Fix: Table rows written into wrong section #42
- Fix: NotImplementedException when using table arrays #41
v0.8.0
General:
- Add: .Net Standard 2.0 support
- Add: Nett.AspNet package that integrates TOML into the Asp.Net Core configuration system
- Breaking Change: API changes creating / adding TOML objects in generic TOML
- Removed: Strong named packages
Nett:
- Add: API for updating a TomlTable row
- Add: Dictionary can be serialized directly
Coma:
- Add: API to use custom store implementations for configurations.
- Add: API for combining TOML tables
- Change: The coma configuration API
v0.7.0
Nett:
- Add: Factory methods to allow generic construction of TOML object graphs #21
- Change: Rename Nett internal settings object from 'TomlConfig' to 'TomlSettings'
- Fix: Write key back to file with same type #23
- Fix: Parse errors caused by absent optional whitespace #26
- Fix: Various TOML array parser issues
Coma:
- Add: Settings can be moved between config scopes.
v0.6.3
Nett:
- Fix: Serialize
uint
correctly #16
Coma:
- Fix: Type conversions #17
v0.6.2
Nett:
- Fix: Ignore static properties #15
v0.6.1
Nett:
- Fix: Array of tables serialization #14
v0.6.0
Nett:
- Add: Properties of TOML mapped classes can be ignored via attribute or config
- Add: TomlTable supports Freezable pattern
- Fix: All parser errors include line and column
- Fix: Various invalid TOML cases now cause a parser error as expected
- Removed: Comments merge mode (will be redesigned and added in future version)
Coma:
- Initial release
v0.5.0
- Changed: Configuration API to have clearer syntax and behavior
- Add: implicit cast sets; Guids and Enums are converted automatically
- Fix: Weird formatting and new lines for nested tables
- Fix: Invalid TOML strings produce better parser error message
v0.4.2
- Fix: Float was written as TomlInt when it had no decimal places #8
- Fix: Inline tables read as arrays #7
- Fix: Integer bare keys not working #6
v0.4.1
- Add: Support for short date time formats
- Fix: Writing files is culture invariant
- Fix: Table encoding/decoding when they are used inside table arrays
v0.4.0
- First public preview release


Provides eigenvector-based (geometric) forecast combination methods; also includes simple approaches (simple average, median, trimmed and winsorized mean, inverse rank method) and regression-based combination. Tools for data pre-processing are available in order to deal with common problems in forecast combination (missingness, collinearity).
| Version: | 1.0 |
| Depends: | R (≥ 3.0.2) |
| Imports: | forecast (≥ 7.3), ForecastCombinations (≥ 1.1), ggplot2 (≥ 2.1.0), Matrix (≥ 1.2-6), mtsdi (≥ 0.3.3), psych (≥ 1.6.9) |
| Suggests: | testthat (≥ 1.0.2) |
| Published: | 2016-11-27 |
| Author: | Christoph E. Weiss, Gernot R. Roetzer |
| Maintainer: | Christoph E. Weiss <info at ceweiss.com> |
| BugReports: | https://github.com/ceweiss/GeomComb/issues |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| URL: | https://github.com/ceweiss/GeomComb |
| NeedsCompilation: | no |
| Materials: | README |
| In views: | OfficialStatistics |
| CRAN checks: | GeomComb results |
| Reference manual: | GeomComb.pdf |
| Package source: | GeomComb_1.0.tar.gz |
| Windows binaries: | r-devel: GeomComb_1.0.zip, r-release: GeomComb_1.0.zip, r-oldrel: GeomComb_1.0.zip |
| OS X binaries: | r-release: GeomComb_1.0.tgz, r-oldrel: GeomComb_1.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=GeomComb to link to this page.


Speed up your responsive and retina-aware website with LaziestLoader, a jQuery plugin that loads, from an array of sources, the most appropriate image at the last possible moment, and updates the image after a resize if needed. Custom callbacks and configuration provide even more functionality, like loading non-image elements and generic scroll-based triggers.
Your web-ready files need to be structured so that the name or path includes the width or a slug that represents the width.
Retina images are also supported with either pattern. You can use whatever naming convention you like to specify the retina source.
Your image element should include a default image. A 1px transparent png or gif will work fine. You may also want to add a class to simplify your jQuery selector in a moment.

LaziestLoader works by finding the best-sized source image to match the target image element's current width. Since "img" elements are inline elements, they'll only have as much width at the current image, which will most likely be very small, like a 1px transparent gif. To ensure the plugin works correctly, you need to make sure the "img" element reports the width you want it to be. One way is to force it to fill its container element with CSS.
img.lazy{
display:block;
width: 100%;
}
The most basic method simply sets the src attribute as the element enters the viewport.
// html  // js $('.lazy').laziestloader();
Specify a standard and an optional retina image.
// html  // js $('.lazy').laziestloader();
Basic example always loads the same image, regardess of element width.
// html  // js $('.lazy').laziestloader();
Go beyond a single source by providing a URL that has a width as part of the path or name.
// html  // js $('.lazy').laziestloader();
Load a smaller image, if possible.
// html  // js $('.lazy').laziestloader();
You can select a sized image that doesn't use the width value in the file name or path.
// html  // js $('.lazy').laziestloader();
Pass in a callback to excute custom code after the src attribute has been changed. That's how the updating "elements loaded" bar below works.
//html  // js var totalLoaded = 0; $("img.callback").laziestloader({ threshold: 100}, function() { totalLoaded += 1; $("#total").html(totalLoaded); });
Need fancier logic to determine the source path? You can write your own.
//html  // js $("img.custom").laziestloader({ threshold: 100, getSource: function($el) { var width = $el.width(); var height = Math.round(width * 0.5625); return 'http://placekitten.com/'+width+'/'+height; } });
The best-fit method used internally can also be used in your callbacks and custom source functions. Pass in a target width and an array of possible values to find the best value.
//html  // js $("img.bestfit").laziestloader({ threshold: 100, getSource: function($el) { var width = $().laziestloader.bestFit($el.width(), [200, 700, 900, 1200]); var height = Math.round(width * 0.5625); return 'http://placekitten.com/'+width+'/'+height; } });
Images aren't the only things with 'src' attributes. Try a video.
// html <video class="lazy" autoplay loop data-pattern="http://joshwilliams.com/projects/sunset-flipbook/videos/bridge-{{size}}.mp4" data-widths="[640, 900]"></video> // js $('.lazy').laziestloader();
Often in responsive applications it's useful to set the height of an element before the source is loaded so the element will pre-fill the correct amount of space. In this example, because iFrames also have src attributes but need their sizes specified to be useful, we'll set the height via the plugin. The height is determined by multipling the element width by the 'data-ratio' vaule. Note: This example will not be responsive because the iFrame content from YouTube isn't smart enough to repsond to the changing viewport.
// html  // js $('.iframe').laziestloader({threshold:300});
Need more control than custom source path generation? For example, you might want to completely rewrite the contents of your element. You can have your callback do all the work, sidestepping much of LaziestLoader's functionality.
// html

 // js $('div.override').laziestloader({ threshold: 100, setSourceMode: false // this is the important bit! }, function(){ var height = Math.round($(this).width() * 0.5625); $(this).html('
Boom!
') });
In addition to the "Custom Source Function" using `getSource` example above, there are other optional behaviors that can be configured in the options object.
By default, images are only loaded when the user scrolls to them and they became visible on the screen.
If you want your images to load earlier than that, lets say 200px before they appear on the screen, specify the threshold in the options object.
$("img").laziestloader({threshold: 200});
To increase performance, the position of lazy loading elements are only checked every 250ms while scrolling. If you need to perform the check more often, lower the number. If scroll performance is an issue -- likely if there are lots of elements -- increase the number.
$("img").laziestloader({scrollThrottle: 300});
The crop selection logic works by picking the image that is greater than or equal to the size of the current element. If you prefer to scale smaller images into larger elements, set this between 0 and 100, where the value is the percent width of the containing element you want to subtract from the math logic. The bigger the number, the smaller the image that'll be selected.
$("img").laziestloader({sizeOffsetPercent: 10});
The regular expression used to search your string, to be replaced by the width number or slug. The default is `/{{SIZE}}/ig`, which finds the string `size`, regardless of case, inside of '{' style double brackets. Example: `/path/name-{{size}}.jpg`. Changing this option is useful if, for example, you have Mustache-style templates rendered on the server that would also match the default laziestloader.js pattern and be rendered blank before our client code runs. Many characters have special meaning and can't be used. A nice alternal pattern is:
$("img").laziestloader({sizePattern: /%size%/ig});
In most cases, the plugin needs to set the source attribute of the element. If you want to use the plugin in ways that don't involve simply setting a source attribute, set `setSourceMode` to false and use the callback to completely manage the behavior of the element on trigger.

Replace me

 $('div').laziestloader({ setSourceMode: false }, function(){ $(this).html('

New content

') });
You can trigger element loading without scrolling the element into view.
$("img.lazy").trigger("laziestloader");
LaziestLoader is by Josh Williams. Inspried by Luís Almeida's unveil
LaziestLoader is licensed under the MIT license


switch
statements/expressions with too many case
labels.
Such a long switch statement may be confusing and should probably be refactored.
Sometimes it is not a problem (for example, domain is very complicated and has enums with a lot of constants).
Example:
switch (x) { case 1 -> {} case 2 -> {} case 3 -> {} case 4 -> {} case 5 -> {} case 6 -> {} case 7 -> {} case 8 -> {} case 9 -> {} case 10 -> {} case 11,12,13 -> {} default -> {} }
Use the field below to specify the maximum number of case
labels expected.


 Changes in that folder will automatically get posted to IPFS — Textile ensures that the latest version of your website remains available online even if your computer isn’t. Cool, right?
Do you use Github Pages or S3 to host a simple webpage and love how easy it is? Have you ever added a webpage to IPFS and realized how powerful it could be? Textile Pages now brings the simplicity of S3 and the benefits of IPFS together, offering you a simple, reliable method to host your webpage on IPFS.
Info
Your page is instantly published on your local Textile node and viewable over your local gateway. You can also view it online over any IPFS Gateway, such as, gateway.textile.cafe/ipfs/QmbAcNHrge3qrxHghV91... or ipfs.io/ipfs/QmbAcNHrge3qrxHghV91.... Or, as shown below, you can publish it on your own website and domain.
Setup¶
Start by running the Textile Desktop app.
The Pages app will automatically update your homepage whenever you make edits as long as Textile is running and you are signed into your account.
Warning
Any changes you make in your pages
folder will automatically be published to IPFS and potentially cached or mirrored on external IPFS peers. Do not add private, sensitive, or illegal content to your pages
folder.
Website editing¶
This is your current default webpage. To update it, your Textile account directory,
~/Library/Application Support/Textile/<account>/
The pages app creates a folder here called, pages
in which you will find the index.html
folder containing the current index.html
. That file is your default homepage.
You can open the index.html
in you IDE of choice and begin editing.
Building React, Jekyll, or other websites¶
Update your current website's build steps to use the Pages pages
folder as the target directory to build your website into.
Publishing updates¶
Textile should automatically detect changes in your pages
folder and publish the results. As a response, you should get a new IPFS hash for your website, viewable through any public gateway.
https://gateway.textile.io/ipfs/<hash>
Cloudflare DNS¶
Textile Pages works seamlessly with Cloudflare's DNSLink support, allowing you to publish changes to your webpage over IPFS that are also available at domain names you control.
Cloudflare setup¶
For Textile Pages to automatically update your website, you must enable IPFS in your Cloudflare account manually first.
Read Cloudflare Instructions Here.
Specifically, your DNS records must contain the CNAME
and TXT
records for serving an IPFS hash. Next, you'll setup Textile Pages to update those records with your latest webpage update.
Cloudflare account credentials¶
You need to add four new environmental variables to the computer running Textile Pages.
PAGES_CLOUDFLARE_API_KEY
The API Key of your Cloudflare account.
export PAGES_CLOUDFLARE_API_KEY=<your-cloudflare-api-key>
PAGES_CLOUDFLARE_EMAIL
Your admin email address associated with the API key.
export PAGES_CLOUDFLARE_EMAIL=<your-cloudflare-api-key>
PAGES_DOMAIN_NAME
The top level domain name where your DNS records exist.
export PAGES_DOMAIN_NAME=<e.g. textile.io>
PAGES_IPFS_RECORD
The exact record subdomain and domain you will be updating. For example, it may be the same as PAGES_DOMAIN_NAME
if you are updating your website's root page, or it may be somesubdomain.PAGES_DOMAIN_NAME
if you are targetting a subdomain on your site.
export PAGES_IPFS_RECORD=<e.g. demo.textile.io>
Updating Cloudflare¶
If you have set your ENV
correctly, the next time you update your index.html
a new IPFS has will be generated and your Cloudflare DNS will be updated.
Post update script¶
Cloudflare DNS updates are performed using a post-update script. You can modify this script to manage your Cloudflare updates differently (or perform entirely new tasks).
Find the post update script in
~/Library/Application Support/Textile/<account>/scripts/pages-post-script-<v>.sh
More Resources¶
Join our public Slack, visit our GitHub, follow us on Twitter, and check out the Blog!


| DOSE: T+ 0:00 |
25 mg |
oral |
AMT |
(capsule) |
| T+ 3:00 |
25 mg |
oral |
AMT |
(capsule) |
| T+ 8:30 |
25 mg |
oral |
AMT |
(capsule) |
| T+ 12:00 |
5 hits |
smoked |
Salvia divinorum |
(extract - 10x) |
This past Friday night, me and some buddies of mine decided to seize an opportunity that fell in our collective lap: an old friend of mine offered us some AMT. I acquired 5 capsules, each containing 25 mg of the substance. At 2 pm, 3 of us each ingested one. A fourth friend had to watch his daughter that night (responsibility is a bitch) and couldn't have fun with us. The fifth capsule was an extra that I had gotten, in case another friend wanted to join us (he ended up not wanting to).
I had heard of AMT before, but never knew anything about it until I had the opportunity and desire to take some. I went online, read about it for about an hour, including some published experiences, and kind of hyped it up for myself and my friends. We were expecting something absolutely unforgettable, an experience unlike any other. We were surprised by what actually happened.
Roundabout 3:30, mine started kicking in. I felt like I was mildly rolling, with the jittery body buzz and faint lightheadedness. The other two gentlemen felt nothing at all. That's very strange to me, but one of them is 6'1/205, and the other is 6'3/280. I myself am 6'1/220. I was the only one who felt anything at all, and it was an experience. I was beginning to increase the feeling of rolling, but I think that was due to the meth-like effects of the drug.
At about 5 pm, I ate the spare capsule. I didn't think that the one was going to last me all night, because it hadn't done too much to me yet. I then left our home base to talk to someone about compensation for the failed substance. As I was sitting at his work, talking to him, I began to trip (6:30 pm).  I looked in the mirror in the bathroom and of course my pupils were fully dilated. I then knew that I was in for something that I hadn't expected.
He and I went to someone else's house to make more DXM, and I began tripping really hard. Wood grain panels were swimming, pictures were pulsing, and I had a very pleasurable body feeling. After being there for almost two hours, we left and I returned to home base, where the other two friends had eaten some mushrooms and were themselves tripping in an entirely different manner. They had the fifth capsule that our other friend had wanted to give back to me, so I ate it (10 pm). I now had approximately 75 mg in me.
We had some fun for a while, then another of our roommates came home. She began playing Mario Brothers 2, which is an absolute blast to watch when there's trails on everything. About 1 am, the third pill kicked in. Then I started seeing wonderful patterns in the air, on the ceiling, on posters, from the lava lamp. I was zooming around, and loving every moment of it. Mind you all, my friends were still tripping on their psilocybin, so we all had a great time for a while. I started to ebb, which made me realize that the entire night my trip was ebbing and flowing, i.e. sometimes it was a strong trip and sometimes it was like a strong roll. I don't know if that's normal, I hadn't heard anything about that.
About 2 am, a friend (who had ingested 200 mg of AMT throughout the night) called me and told me that if I had any, I should smoke some salvia. So I said why not, and smoked 5 hits of a bowl that was almost entirely extract. It was only 5, because the fifth floored me with an indescribable pins and needles feeling throughout my body. I then sat down and began watching TV. One of the shroom-zoom team had come down, but the other was still going strong. We turned on Trainspotting (my fellow zoomer had never seen it) and enjoyed that. Unfortunately, I had only gotten about 6 hrs of sleep over the past two nights and was extremely tired, so I passed out sometime around 4 am.
I woke up at 8:30 to a phone call about the Columbia tragedy, and was no longer tripping, though I was considerably stumbling through ideas that I was trying to talk about with a friend who had come over to smoke at 10 am. I don't know if that was due to the salvia, or the AMT, or the marijuana I smoked.
I thoroughly enjoyed my experience, except for the fact that it took so long to kick in. My friends that also did it with me didn't enjoy it, as it didn't work for them. I took higher dosage, spread out over time, and I think that if/when I do it again, I'll follow the same ingestion pattern. It was very pleasurable, but I don't think I'll drive again. That may have been a mistake, as I don't remember the route I took, but I did get to where I needed to go. I wouldn't recommend it, driving that is.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


You are never too far away
Tastes like Home is your one stop for a good reminisce of Mum's cooking.
We make pizza the way mama did.
With flavour, preciseness and a lot of love.

Our pizza is sure to leave you wanting more and missing Mama's love.


This is our luxurious suite. We have '.$luxary->AVAILABLE.' of them.
They have 24/7 room service with a mini-bar stocked with drinks.
We have a phone with unlimited call time to any number.
This is our standard suite. We have '.$standard->AVAILABLE.' of them.
They have 24/5 room service with a mini-bar stocked with drinks.
We have a phone that can call any number.