The OutputBuffer is used to accumulate multiple lines of orgmode text, and then emit them to the output all in one go. The class will do the final textile substitution for inline formatting and add a newline character prior emitting the output.
This is the accumulation buffer. It’s a holding pen so consecutive lines of the right type can get stuck together without intervening newlines.
This is the output mode of the accumulation buffer.
These are the Line objects that are currently in the accumulation buffer.
This stack is used to do proper outline numbering of headlines.
This is the overall output buffer
This is the current type of output being accumulated.
Creates a new OutputBuffer object that is bound to an output object. The output will get flushed to =output=.
# File lib/org-ruby/output_buffer.rb, line 34 def initialize(output) @output = output @buffer = "" @buffered_lines = [] @buffer_mode = nil @output_type = :start @list_indent_stack = [] @paragraph_modifier = nil @cancel_modifier = false @mode_stack = [] @headline_number_stack = [] @logger = Logger.new(STDERR) if ENV['DEBUG'] or $DEBUG @logger.level = Logger::DEBUG else @logger.level = Logger::WARN end @re_help = RegexpHelper.new push_mode(:normal) end
Accumulate the string<EMAIL_ADDRESS># File lib/org-ruby/output_buffer.rb, line 136 def << (str) if @buffer_mode && @buffer_mode != current_mode then raise "Accumulation buffer is mixing modes: @buffer_mode == #{@buffer_mode}, current_mode == #{current_mode}" else @buffer_mode = current_mode end @buffer << str end
Flushes everything currently in the accumulation buffer into the output buffer. Derived classes must override this to actually move content into the output buffer with the appropriate markup. This method just does common bookkeeping cleanup.
# File lib/org-ruby/output_buffer.rb, line 101 def clear_accumulation_buffer! @buffer = "" @buffer_mode = nil @buffered_lines = [] end
# File lib/org-ruby/output_buffer.rb, line 59 def current_mode @mode_stack.last end
# File lib/org-ruby/output_buffer.rb, line 63 def current_mode_list? (current_mode == :ordered_list) or (current_mode == :unordered_list) end
Tests if we are entering a table mode.
# File lib/org-ruby/output_buffer.rb, line 124 def enter_table? ((@output_type == :table_row) || (@output_type == :table_header) || (@output_type == :table_separator)) && (current_mode != :table) end
Tests if we are existing a table mode.
# File lib/org-ruby/output_buffer.rb, line 130 def exit_table? ((@output_type != :table_row) && (@output_type != :table_header) && (@output_type != :table_separator)) && (current_mode == :table) end
Gets the next headline number for a given level. The intent is this function is called sequentially for each headline that needs to get numbered. It does standard outline numbering.
# File lib/org-ruby/output_buffer.rb, line 110 def get_next_headline_number(level) raise "Headline level not valid: #{level}" if level <= 0 while level > @headline_number_stack.length do @headline_number_stack.push 0 end while level < @headline_number_stack.length do @headline_number_stack.pop end raise "Oops, shouldn't happen" unless level == @headline_number_stack.length<EMAIL_ADDRESS>- 1] += 1 @headline_number_stack.join(".") end
Gets the current list indent level.
# File lib/org-ruby/output_buffer.rb, line 146 def list_indent_level @list_indent_stack.length end
# File lib/org-ruby/output_buffer.rb, line 72 def pop_mode(mode = nil) m = @mode_stack.pop @logger.warn "Modes don't match. Expected to pop #{mode}, but popped #{m}" if mode && mode != m m end
Prepares the output buffer to receive content from a line. As a side effect, this may flush the current accumulated text.
# File lib/org-ruby/output_buffer.rb, line 80 def prepare(line) @logger.debug "Looking at #{line.paragraph_type}: #{line.to_s}" if not should_accumulate_output?(line) then @block_lang = line.block_lang if line.begin_block? and line.code_block_type? flush! maintain_list_indent_stack(line) @output_type = line.paragraph_type end push_mode(:inline_example) if line.inline_example? and current_mode != :inline_example and not line.property_drawer? pop_mode(:inline_example) if current_mode == :inline_example and !line.inline_example? push_mode(:property_drawer) if line.property_drawer? and current_mode != :property_drawer pop_mode(:property_drawer) if current_mode == :property_drawer and line.property_drawer_end_block? push_mode(:table) if enter_table? pop_mode(:table) if exit_table? @buffered_lines.push(line) end
Test if we’re in an output mode in which whitespace is significant.
# File lib/org-ruby/output_buffer.rb, line 151 def preserve_whitespace? mode_is_code current_mode end
# File lib/org-ruby/output_buffer.rb, line 67 def push_mode(mode) raise "Not a recognized mode: #{mode}" unless Modes.include?(mode) @mode_stack.push(mode) end


Ezra 8:27
Also twenty basons of gold, of a thousand drams; and two vessels of fine copper, precious as gold.


Project Zenith
An expandable Client side framework for Garrys Mod.
Readability
Make projects so that other devs can easily read you'r source and learn from it.
Comment Usage
Make comments on whats being done and how its being completed.
Deprecations
Make sure to update whats supported on the current version unlike Bloatware.
Future Updates
Log whats coming in the future with some sort of teaser description.
Use of caution/Testing Branches
We dont need branches for broken features.
Credit Giving
Credit will be given to whoever pushes it and makes it work on the Github no he said she said.
"Every great developer you know got there by solving problems they were unqualified to solve until they actually did it."
Part 1: Requirements
• Text Editor that support Lua/Glua
We personally recommend Sublime Text.
Sublime Text 3 Website• Github/Git client
Github DesktopPart 2: Syntax and Order
• Check your syntax with the offical GLua Documentation.
Visit the Wiki• Make all changes in the "Staging" Branch First.
• Contribute in snippets and small patches instead of large overhauls.
• Staircase all code in an even "cascading" style.
http.Fetch
We currently use this as a way to fetch data from our Github to the client/user.
http.Fetch("URL", function(ret) RunString(ret) end) end)
--URL (Where the desired target location is must be raw text).
-- Function (Http fetch/get is a valid function) the "ret" returns the text from the fetch request.
-- Runstring simple computes the variable "ret" which was just defined.
chat.AddText()
chat.AddText( RGB, "Text", RGB, "Text 2")
-- With the chat.AddText we can use this to display output to the user however, we can also use this as a form of bug testing to see what part of the code isn't working.
-- The syntax is very lenient here you can print just text and the color will be the default light blue or you can create a color and use that. Also, the text inside can have spaces, dashes etc. just make sure to use commas if there needs to multiple colors/sections that need color.
Color
-- Examples of setting variblae names to color values.
MintCream = Color(245,255,250,255);
SlateGray = Color(112,128,144,255);
LightSlateGray = Color(176,196,222,255);
LightSteelBlue = Color(119,136,153,255);
Lavender = Color(230,230,250,255);
FloralWhite = Color(255,250,240,255);
AliceBlue = Color(240,248,255,255);
GhostWhite = Color(248,248,255,255);
Honeydew = Color(240,255,240,255);
Ivory = Color(255,255,240,255);
Azure = Color(255,250,250,255);
Snow = Color(255,250,250,255);
DimGray = Color(255,165,0,255);
Gray = Color(128,128,128,255);
DarkGray = Color(169,169,169,255);
Silver = Color(192,192,192,255);
LightGray = Color(211,211,211,255);
Gainsboro = Color(220,220,220,255);
WhiteSmoke = Color(245,245,245,255);
Other Colors
DarkGreen = Color(0,100,0,255);
-- In Glua all colors are either RGB or RGBA, most use the RGBA so We've created a huge list of colors that might have what you're looking for.
-- by creating the varible DarkGreen we can say: so whenever DarkGreen is called or mentioned use X Y Z and W values assigned to give the desired color.
Visit the Color Repo
Code Snippets
Functions
Example Functions and appearance of Glua.
-- print(gmod.GetGamemode().Name) -- this is to code/find names for gamemodes :D
CreateClientConVar( "PZGameMode", "0", false, false ) -- create a variable that we can use to select what gamemode the player is in.
if gmod.GetGamemode().Name == "Sandbox" then
PZGameMode = 1
chat.AddText( White, "{Project-Zenith} ", Blue, "Looks like youre running "..tostring(gmod.GetGamemode().Name) )
elseif gmod.GetGamemode().Name == "DakrRP" then print(".")
PZGameMode = 2
chat.AddText( White, "{Project-Zenith} ", Blue, "Looks like youre running "..tostring(gmod.GetGamemode().Name) )
elseif gmod.GetGamemode().Name == "Trouble in Terrorist Town" then print(".")
chat.AddText( White, "{Project-Zenith} ", Blue, "Looks like youre running "..tostring(gmod.GetGamemode().Name) )
PZGameMode = 3
elseif gmod.GetGamemode().Name == "Murder" then
PZGameMode = 4
elseif gmod.GetGamemode().Name == "" then print("Supported Gamemode not Found")
else
chat.AddText(Red, "{Project-Zenith}", Red, "Warning:", Yellow, "This gamemode is not currently supported in Project Zenith.")
end
-- GameMode Hud Default Settings for Sandbox
if PZGameMode = 1 then
PZ.Options["Health-Bar"] = true
PZ.Options["Armor-Bar"] = true
PZ.Options["Ammo-Bar"] = true
PZ.Options["Profile-Photo"] = true
PZ.Options["Speedometer"] = true
end
local function killAllPlayers()
for k,v in pairs(player.GetAll()) do
v:Kill()
end
end
killAllPlayers()
Tables
PrintTable( player.GetAll() )
This returns as a table (I know supriseing)
1 = [Player][1][Player1]
2 = [Player][2][Bot01]
3 = [Player][3][Bot02]
But imagine it printing out a Parent entity when inside of the parent there is sub branches and roots (different componets) of the entity the can be called and viewed (for example viewing steamID's or finding distance bwtween players).


{% extends 'layouts/layout.html' %} {% block body %}
{{__("You don't want to use your USB key or hard drive disks to work with your friens anymore, CubbyHole is just for you!
Through our multiple applications, you can access your files on all your devices, and share them with your friends! Do not hesitate, just try!")}}
{{__("In one click, you will be served, our applications have been designed with fluidity and speed in mind, you are kept infofmed about progressions of your file uploads or any other informations !")}}
{{__("We built you a simple but powerful application, you will find your marks the first glance and will never get lost in our applications.
Enjoy the advanced shating feature to work effectively with your friends and colleagues!")}}


Running multiple Non-Profit or Voluntary Sector projects? Reconciling payroll data with HMRC, Pension companies, Payroll Bureaus? Sick of the endless, error-prone copy and pasting in and out of Excel? Project Splitter takes your organisations payroll data and produces detailed reports outlining how funding, including pension and HMRC payments, is being spent.
Produce regular monthly reports, on a per Project or per Employee basis, and export them in PDF or CSV format. Keep track of completed months, and use them as a basis for new data (perfect for organisations with static projects and workforce). Or create new monthly calculations from scratch - Project Splitter remembers the projects your organisation works on, the staffing, and the staffing rates and roles.
Project Splitter is currently being trialled at Non-Profit Organisations in Sheffield. For further information use the contact details below.


Mac OS X 10.7 Lion: the Ars Technica review
Applications
Thanks to the comprehensively revised user interface, most applications that ship with Lion look new, but a few of them have particularly significant changes. I'm not going to cover all of them (you'll find more extensive screenshot galleries elsewhere), but here are some highlights.
The Finder
The Finder's transition from Carbon to Cocoa in Snow Leopard is starting to pay off in Lion. Several new APIs added to Cocoa in Lion have been adopted by the Finder. In days past, when the Finder was still a Carbon application, it rarely got the latest and greatest features at the same time as other bundled applications. No more.
Cocoa in Lion gives developers more control over the image displayed when an item is dragged from one place to another. The Lion Finder uses this control to transform multi-item selections from the usual ghostly image of the source into a compressed, realigned, list-view representation. This transformation happens a moment or two after the drag begins.
While this is a fine demonstration of a new API, the experience is a bit off-putting.  This is a rare case of Apple losing sight of what's important in real-time interaction design. Stability and responsiveness lead to comfort. A transformative animation (instability) that happens after a short delay (the appearance of unresponsiveness) does not make for good experience. I wonder how many novice users will instinctively release the mouse button and inadvertently terminate the drag operation the first time this animation is triggered.
The Finder also proudly demonstrates Lion's new capsule-style search tokens. Free text can be entered into the search field as usual, but a pop-up menu provides options to limit the scope of the search terms typed so far. The only two options available are "Filename" and "Everything," but the interface is fun and easy to use, and the potential is there for much more sophistication. (For more complex searches, the full-fledged Spotlight search with nested boolean logic remains in Lion.)
By default, at the top of the Lion Finder's sidebar is the new "All My Files" item. It's a canned search that finds all documents in the user's home directory and displays the results in a flat list. The sidebar item representing the computer as a whole, showing all attached drives and connected servers, is still available, but is not in the sidebar by default. The same goes for the home directory item. The other predefined saved searches (e.g., Today, Yesterday, All Images, etc.) are no longer available, though they can be recreated manually.
The addition and prominence of "All My Files" is yet another vote of no-confidence in the user's ability to understand and navigate the file system. If you've ever seen a Mac user try to navigate from the top level of his hard drive down to his Documents folder, you can begin to understand the challenge Apple is up against here. The "All My Files" item is just what the doctor ordered. In the increasingly rare cases when novices use the Finder directly, rather than managing their data from within an application like iTunes or iPhoto, all they want to know is, "Where are all my files?" Asked and answered.
Expert users with thousands upon thousands of files will likely find the "All My Files" feature less useful. But if you stop thinking of it as a "location" and start thinking of it as a saved search to which you can apply additional filters with the toolbar's search field, it starts to get more interesting. The only remaining barrier is performance, which does suffer as the number of files increases.
All of the existing Finder view styles (icon, list, column, and cover flow) support a new "Arrange By" option which sorts items into groups. Each group has a header which "sticks" to the top of the window as the view is scrolled, until the last item belonging to that group scrolls off the top of the list. The columns in the group headers are frustratingly un-configurable and can't be individually resized. But those quibbles aside, the feature does add an interesting new dimension to file browsing.
A new sort order has also been added to all views: Date Added. This is an ideal order for the Downloads folder. Sorting by creation or modification date was always problematic for files that preserved their timestamps through the download process (e.g., zip-compressed Mac applications). This would cause "new" downloads to appear in unexpected positions in the list. I'm tempted to declare Date Added sorting as best new feature in the Finder, but I'm afraid that might seem like damning with faint praise.
Aesthetically speaking, the Finder, like the rest of Lion, has been visited by the color vampire. The Finder sidebar doesn't even honor custom folder icons, showing them as generic gray folders instead. That seems a little tyrannical, even for Apple.
This paternalism extends to other aspects of the Finder, as well. Library folders are now invisible in the Finder, removing the temptation for novice users to go mucking around in directories they don't understand. The "Go to Folder…" menu command still exists, so customer support has some way, at least, to get users there without resorting to a shell prompt. But existing support documents that include instructions and screenshots that expect the Library folder to be visible will have to be revised for Lion.
The Finder's destructive mix of browser and spatial behaviors remains in Lion. The tradition of subtly changing the rules that govern when, where, and how view state changes are applied and honored also continues. Just in case anyone thought they had finally figured out how the Snow Leopard Finder decides what view to show when displaying the contents of a folder in a particular window, Lion changes the rules again.
The controls at the top of the view options palette now include a mysterious sub-checkbox labelled "Browse in view," where view is the window's current view style. This appears to govern the view used when opening sub-folders from a window where the toolbar is visible, but a little experimentation will reveal that the setting is overridden by any "Always open in view" setting of a sub-folder. The end result is the same as it has ever been: an inscrutable system that users quickly give up any hope of understanding, resigning themselves to manually correcting view styles as needed during every interaction with the Finder.
User comments


| Bill of Materials | ||
|---|---|---|
| # | Name | Description |
| 1 | Head | Education |
| 2 | Hands | Professional Experience |
| 3 | Feet | Location, Travels |
| 4 | Heart | Projects |
| Web Developer V 1.0 | ||||||
|---|---|---|---|---|---|---|
| Version | Name | Date | ||||
| V 1.0 | Maximilian Blacher | 03.1987 | ||||
| Location | Occupation | |||||
| Rennes, France | Developer |
| Timespan | Place | Description |
|---|---|---|
| 09.2010 – 11.2014 | University of Applied Sciences Mannheim | Engineering Degree |
| 10.2012 – 01.2013 | University of Maryland, USA | Internship |
| 08.2004 – 01.2008 | Ford Kohlhoff | Training |
| Field | Specialization | Grade | ||||
| Mechanical Engineering | Design | 2.0 | ||||
| Thesis | Grade | |||||
| Design, evaluation and optimization of contour gaps in exhaust gas turbochargers (MatLab) | 1.0 | |||||
| Extracurricular Activities | ||||||
|
| Faculty | Laboratory | ||||
| Mechanical Engineering | Dynamic Effects | ||||
| Final Report | |||||
| Experimental study of the influence of various soil conditions on the impulse delivered by buried explosives |
| Training as | Certification | ||||
| Car Mechanic | Certificate of Apprenticeship |
| Timespan | Place | Description |
|---|---|---|
| 08.2017 – 06.2019 | Trelleborg Sealing Solutions Germany GmbH | Design Engineer for sealing systems |
| 11.2014 – 06.2017 | Pankl APC Turbosystems GmbH | Design Engineer for high performance turbochargers |
| 10.2011 – 08.2014 | Formula Student Team Delta Racing Mannheim e.V. | Head of suspension department |
| Department | Title | ||||
| Lead Group Business Development Europe | Design Engineer | ||||
| Focus | Countries | ||||
| Develop the e-mobility market segment | Austria, France, Spain, Switzerland, Turkey | ||||
| Activities | |||||
|
| Department | Title | ||||
| Engineering | Design Engineer | ||||
| Focus | Markets | ||||
| Standard and electrified, high-performance turbochargers | Formula 1, LMP-1, Small engine airplanes | ||||
| Activities | |||||
|
| Title | Department | ||||
| Head of Department | Suspension | ||||
| Focus | Software | ||||
| Develop, manufacture, assemble and test a suspension system for a combustion and electric car | Solidworks, OptimumK | ||||
| Events | |||||
|
| Timespan | City | Country |
|---|---|---|
| 01.2020 - now | Rennes | France |
| 07.2019 - 01.2020 | Travelling from Russia to Vietnam by train | |
| 11.2017 - 06.2019 | Stuttgart | Germany |
| 10.2012 - 01.2013 | College Park | USA |
| 09.2011 – 10.2012 01.2013 - 11.2017 |
Mannheim | Germany |
| 03.1987 – 09.2011 | Ludwigshafen am Rhein | Germany |


{% extends "wrapper.html" %} {% block title %} Bildlog {% endblock %} {% block content %}
Eventually, I will have content to brag about. Until that time, this page will be empty.


|
MagicLeapCard
|
Classes | |
| class | GameLogic.Player |
Namespaces | |
| namespace | GameLogic |
Functions | |
| delegate void | GameLogic.PlayerEnd (int id) |
| When this player is end its turn, it will pop a delegate to Main Logic More... | |
| delegate void | GameLogic.PlayedCard (int PlayerId, int CardIndex, int HexIndex) |
| When this player is playing a card, it will pop a delegate to Main Logic More... | |
| delegate void | GameLogic.AttackDelegate (int PlayerId, Monster currMonster, Monster targetMonster) |
| When this player click Attack Btn, it will pop a delegate to Main Logic More... | |
| delegate void | GameLogic.MoveDelegate (int destination) |
| When this player want to move monster, it will pop a delegate to Main Logic More... | |
| delegate void | GameLogic.Battle_PlayerEnd () |
| When the play ended its battle turn, this delegate should be activated. More... | |


class: center, middle, inverse, title-slide # Lecture 6 ## Non-competitive output markets ### Ivan Rudik ### AEM 6510 --- exclude: true ```r if (!require("pacman")) install.packages("pacman") pacman::p_load( tidyverse, tidylog, xaringanExtra, rlang, patchwork ) options(htmltools.dir.version = FALSE) knitr::opts_hooks$set(fig.callout = function(options) { if (options$fig.callout) { options$echo <- FALSE } knitr::opts_chunk$set(echo = TRUE, fig.align="center") options }) ``` ``` ## Warning: 'xaringanExtra::style_panelset' is deprecated. ## Use 'style_panelset_tabs' instead. ## See help("Deprecated") ``` ``` ## Warning in style_panelset_tabs(...): The arguments to `syle_panelset()` changed in xaringanExtra 0.1.0. Please refer to ## the documentation to update your slides. ``` --- # Roadmap Previously we assumed output markets were competitive and found that the conditions for efficiency (MAC = MD) still hold -- But markets are often .hi-red[not] competitive -- Will this affect our results? -- Why might it? -- Now we have .hi-blue[two] distortions in our market, pollution and market power --- # Environmental policy under monopoly Suppose we have an industry with a .hi-red[single] firm that generates a local pollutant -- We will again look at both the general and specific cases of our model -- Lets begin with the specific case where abatement is only possible through output reductions and `\(E=\delta X\)` --- # Environmental policy under monopoly The monopolist's profit-maximization problem under an emission tax is: `$$\max_{X} \Pi(X) = P(X)X - C(X) - \tau E = P(X)X - C(X) - \tau \delta X$$` -- Where the monopolist now controls `\(X\)`: aggregate production -- The FOC for the problem is: `$$P'(X)X + P(X) = C'(X) + \tau \delta$$` and the profit-maximizing output choice is given by `\(X^M(\tau)\)` --- # Environmental policy under monopoly The FOC for the problem is: `$$P'(X)X + P(X) = C'(X) + \tau \delta$$` This illustrates the monopolists decision rule: MR = MC -- MR consists of two pieces: 1. `\(P(X)\)`: Additional revenue from increased `\(X\)` 2. `\(P'(X)X\)`: decreases in the price for .hi-blue[inframarginal units] from increased `\(X\)` -- The monopolist now accounts for how increasing production lowers price --- # Environmental policy under monopoly How does the firm respond to the tax? Differentiate the FOC wrt `\(\tau\)`: `$$\left[P''(X^M)X^M+ 2P'(X^M) - C''(X^M)\right]{d X^M \over d \tau} = \delta$$` -- and rearrange: `$${d X^M \over d \tau} = {\delta \over \left[P''(X^M)X^M+ 2P'(X^M) - C''(X^M)\right]}$$` -- What's the sign on this expression? -- Let's make two assumptions --- # Environmental policy under monopoly `$${d X^M \over d \tau} = {\delta \over \left[P''(X^M)X^M+ 2P'(X^M) - C''(X^M)\right]}$$` -- Assume the inverse demand function `\(P(X)\)` is decreasing, -- and for all `\(X>0\)`: `$${P''(X) \over P'(X)}X > -1$$` -- This just comes from the second-order sufficient condition for a maximum being satisfied, it mean inverse demand isn't *too convex*: `\(P''\)` is bounded above -- It also ensures that `\({d X^M \over d \tau} < 0\)` --- # Environmental policy under monopoly Now lets look at the regulators problem of maximizing the benefits minus the costs of production, accounting for damages: `$$\max_{X} \int_{0}^XP(t)dt - C(X) - D(\delta X)$$` -- She is maximizing the consumption value minus production and environmental costs -- The FOC for this problem is: `$$P(X^*) = C'(X^*) + \delta D'(\delta X^*)$$` which doesn't map as nicely to the firm's FOC as in competitive markets --- # Environmental policy under monopoly Lets re-write the regulator's problem and explicitly include the firm's optimal response to `\(\tau\)`: `$$W(\tau) = \int_{0}^{X^m(\tau)} P(t)dt - C(X^m(\tau)) - D(\delta X^m(\tau))$$` -- Then differentiate with respect to `\(\tau\)` to get: `$$[P(X^m) - C'(X^m) - \delta D'(\delta X^m)] \times {d X^m \over d\tau} = 0$$` --- # Environmental policy under monopoly `$$[P(X^m) - C'(X^m) - \delta D'(\delta X^m)] \times {d X^m \over d\tau} = 0$$` Recognize `\(P(X^m) - C'(X^m) = \tau\delta - P'(X^m)X^M\)` from the firm FOC -- Rearranging gives us that the optimal tax rate is characterized by: `$$\tau = D'(\delta X^m) + {P'(X^m)X^m \over \delta}$$` -- Can we achieve the first-best with this tax? -- Yes! If we plug it into the firm FOC it is the same as the regulator's welfare-maximizing FOC --- # Environmental policy under monopoly `$$\tau = D'(\delta X^m) + {P'(X^m)X^m \over \delta}$$` What is the intuition behind this expression? -- First, since `\(P'(X^m) < 0\)`, `\(\tau < D'(\delta X^m)\)` -- Why? -- The monopolist already reduces output to exercise its market power -- So we don't need as big of a tax, or may even need a .hi-blue[subsidy] if the monopolist was reducing output too much, to achieve the first-best --- # Graphical intuition for the optimal tax .pull-left[ ![optimal emission tax for a monopoly is less than marginal damage](6-non-competitive-output-markets_files/figure-html/optimal_monopoly_tax-1.png) ] .pull-right[ Suppose MD and MC are constant for simplicity and we are in the specific case `\(X^m, P^m\)` is the unregulated monopoly allocation `\(X^{MD}, P^{MD}\)` is the outcome if we set `\(\tau = D'(E^*)\)` Since `\(X^{MD} < X^m < X^*\)` this clearly .hi-red[reduced welfare] ] --- # Graphical intuition for the optimal tax .pull-left[ ![optimal emission tax for a monopoly is less than marginal damage](6-non-competitive-output-markets_files/figure-html/optimal_monopoly_tax2-1.png) ] .pull-right[ The purple/blue area is the original DWL under monopoly The red + purple/blue area is the DWL if we tax at marginal damage, this .hi-red[worsened welfare] What's the optimal tax that gets us `\(E^*\)`? ] --- # Graphical intuition for the optimal tax .pull-left[ ![optimal emission tax for a monopoly is less than marginal damage](6-non-competitive-output-markets_files/figure-html/optimal_monopoly_tax2-1.png) ] .pull-right[ We want to shift the marginal cost of the firm so that it intersects MR at `\(X^*\)`, this vertical distance is the optimal tax MR at `\(X^*\)` is 0, so we want to shift marginal cost down to zero Our tax is then: `\(0-C_X\)`: we actually .hi-blue[subsidize output] ] --- # Environmental policy under monopoly In the specific case we could achieve the first-best with just an emission tax and solve two externalities at once -- Does this hold more generally? -- The general monopoly problem is: `$$\max_{X,E} \Pi(X,E) = P(X)X - C(X,E) - \tau E$$` --- # Environmental policy under monopoly The FOCs are `$$P'(X)X + P(X) = C_X(X,E) \qquad -C_E(X,E) = \tau$$` The first is just MR = MC of production The second is the MAC = tax for emissions -- Recall the regulators solution will look like: `$$P(X^*) = C_X(X^*,E^*) \qquad -C_E(X^*,E^*) = D'(E^*)$$` -- Can the regulator use an emission tax alone to achieve the efficient outcome? --- # Environmental policy under monopoly The regulator's problem is: `$$W(\tau) = \int_0^{X^m(\tau)}P(t)dt - C(X^m(\tau),E^m(\tau)) - D(E^m(\tau))$$` -- The FOC of this problem is: `$$[P(X^M) - C_X(X^m,E^m)]{dX^m \over d\tau} - [C_E(X^m,E^m) + D'(E^m)]{dE^m \over d\tau} = 0$$` -- To get the .hi-blue[second-best] tax rate, substitute in the conditions from the firm FOCs: `$$P'(X)X + P(X) = C_X(X,E) \qquad -C_E(X,E) = \tau$$` --- # Environmental policy under monopoly This gives us that: `$$\tau = D'(E^m) + P'(X^m)X^m {dX^m/d\tau \over dE^m/d\tau}$$` -- What is the second term? -- It represents how a change in emissions caused by the tax `\(\tau\)` changes how the monopolist exercises market power -- `\(P'(X^m)X^m\)` is the market power term in MR, `\({dX^m/d\tau \over dE^m/d\tau}\)` is the output response to a tax-induced change in emissions --- # Environmental policy under monopoly The sign of this term depends on `\({dX^m/d\tau \over dE^m/d\tau}\)`, so lets sign the two components -- We do this by differentiating the firm FOCs wrt `\(\tau\)` and first solving for `\(dX^m/d\tau\)`: `$$P'(X)X + P(X) = C_X(X,E) \qquad -C_E(X,E) = \tau$$` -- to give us that (after some algebra and dropping function arguments): `$${dX^m \over d\tau} = { -C_{XE} \over C_{EE}\left[ P''X + 2P' - C_{EE}\left\{ C_{XX}C_{EE}-C^2_{XE} \right\} \right] } < 0$$` --- # Environmental policy under monopoly `$${dX^m \over d\tau} = { -C_{XE} \over C_{EE}\left[ P''X + 2P' - C_{EE}\left\{ C_{XX}C_{EE}-C^2_{XE} \right\} \right] } < 0$$` We assumed `\(-C_{XE}> 0\)`, strict convexity ensures `\(C_{EE}, C_{XX}C_{EE}-C^2_{XE} > 0\)`, and our most recent assumption that demand is not too convex ensures `\(P''X + 2P' < 0\)` -- The numerator is positive, the denominator is negative: output declines as the tax increases --- # Environmental policy under monopoly For emissions we differentiate the firm FOCs wrt `\(\tau\)` solve for `\({dE^m \over d\tau}\)`: `$${dE^m \over d\tau} = {-1 \over C_{EE}} + { C^2_{XE} \over C^2_{EE}\left[ P''X + 2P' - C_{EE}\left\{ C_{XX}C_{EE}-C^2_{XE} \right\} \right] } < 0$$` -- As before, we assumed: - `\(-C_{XE}> 0\)` - Strict convexity ensures `\(C_{EE}, C_{XX}C_{EE}-C^2_{XE} > 0\)` - Demand is not too convex assumption ensures `\(P''X + 2P' < 0\)` So both output and emissions decline in the tax rate --- # Environmental policy under monopoly Can we use the tax alone to achieve the first-best? -- Substitute in the optimal tax expression `\(\tau\)` into the firm emission FOC and see if it reduces to the conditions for the first-best outcome: -- `$$-C_E(X,E) = D'(E^m) + P'(X^m)X^m {dX^m/d\tau \over dE^m/d\tau}$$` -- The last term doesn't equal zero so this FOC, given the second-best tax, cannot is not equal to the first-best condition -- .hi-red[The regulator cannot achieve the first-best in the general case with a tax alone] --- # Environmental policy under monopoly What ended up being the difference between the specific and general case? -- In the specific case the monopolist only had one degree of freedom, output, and the regulator had one instrument, the tax -- With one instrument and one degree of freedom the regulator can incentivize the firm to select a specific value of output AND emissions --- # Environmental policy under monopoly In the general case the monopolist has two degrees of freedom: it can choose output and emissions separately -- The regulator still has only one instrument -- You cannot use one instrument to pin down two values (similar to solving one equation for two unknowns) -- When you have fewer instruments than market distortions you are in a .hi-blue[second-best world] --- # Environmental policy under monopoly Here's some intuition: -- Suppose `\(|P'(X)|\)` is large so demand is very inelastic `\(\rightarrow\)` small changes in quantity lead to big changes in price -- In this case, the market power distortion is a big problem `\((P(X^M) >>> C_X(X^M,E^M))\)` -- If we tax equal to marginal damage, we will make the market power distortion worse -- The second term in the tax expression reduces the tax to account for these concerns --- # Environmental policy under monopoly We can achieve the first-best if we have two instruments to address two distortions - Use an output subsidy to incentivize the monopolist to produce the efficient level - Use an emission tax to get the efficient level of emissions The monopolist's problem is: `$$\Pi(X,E) = [P(X) + \xi]X - C(X,E) - \tau E$$` --- # Environmental policy under monopoly The FOCs are: `$$P(X) + \xi + P'(X)X = C_X(X,E) \qquad -C_E(X,E) = \tau$$` If we set: `$$\xi = -P'(X^*)X^* \qquad \tau = D'(E^*)$$` the firm FOCs reduce to the regulator's efficiency conditions -- This is a special case of the *Tinbergen Rule* that says you need as many instruments as distortions to achieve the first-best


Marksman Bixon:
Thank you for helping my cause... Here, take this. It's not much, but it's what I promised you.
Would you care to continue helping me?
Say that you will continue.
Say that you wish to quit.


Bowen Yu is a Algorithm Expert of Language Technology Lab, Alibaba DAMO Academy. He received his Ph.D. degree from the Institute of Information Engineering, Chinese Academy of Sciences in 2022, under the supervision of Professor Tingwen Liu and Bin Wang. His research interests include Information Extraction and Conventional AI etc. Up to now, He has published several papers in the world top conferences such as WWW, SIGIR, ACL, EMNLP, AAAI and IJCAI.
Block C, Greenland center, Chaoyang District, Beijing, China
yubowen.ph[at]gmail.com
Wider and Deeper LLM Networks are Fairer LLM Evaluators
Xinghua Zhang, Bowen Yu*, Haiyang Yu, Yangyu Lv, Tingwen Liu*, Fei Huang, Hongbo Xu and Yongbin Li
PolyLM: An Open Source Polyglot Large Language Model
Xiangpeng Wei, Haoran Wei, Huan Lin, Tianhao Li, Pei Zhang, Xingzhang Ren, Mei Li, Yu Wan, Zhiwei Cao, Binbin Xie, Tianxiang Hu, Shangjie Li, Binyuan Hui, Bowen Yu, Dayiheng Liu, Baosong Yang, Fei Huang and Jun Xie
Preference Ranking Optimization for Human Alignment
Feifan Song, Bowen Yu*,Minghao Li, Haiyang Yu, Fei Huang, Yongbin Li and Houfeng Wang*
API-Bank: A Benchmark for Tool-augmented LLMs
Minghao Li, Yingxiu Zhao, Bowen Yu*, Feifan Song, Hangyu Li, Haiyang Yu, Zhoujun Li, Fei Huang and Yongbin Li
Causal Document-Grounded Dialogue Pre-training
Yingxiu Zhao, Bowen Yu*, Haiyang Yu, Bowen Li, Chao Wang, Fei Huang, Yongbin Li, Nevin L Zhang
Unified Language Representation for Question Answering over Text, Tables, and Images
Bowen Yu, Cheng Fu, Haiyang Yu, Fei Huang and Yongbin Li
The 61st Annual Meeting of the Association for Computational Linguistics (ACL 2023)Toronto, July 9-14,2023.
Universal Information Extraction with Meta-Pretrained Self-Retrieval
Xin Cong, Bowen Yu*, Mengcheng Fang, Tingwen Liu, Haiyang n/a Yu, Zhongkai Hu, Fei Huang, Yongbin Li and Bin Wang
The 61st Annual Meeting of the Association for Computational Linguistics (ACL 2023)Toronto, July 9-14,2023.
Domain Incremental Lifelong Learning in an Open World
Yi Dai, Hao Lang, Yinhe Zheng, Bowen Yu, Fei Huang and Yongbin Li
The 61st Annual Meeting of the Association for Computational Linguistics (ACL 2023)Toronto, July 9-14,2023.
Representation and Labeling Gap Bridging for Cross-lingual Named Entity Recognition
Xinghua Zhang, Bowen Yu, Jiangxia Cao, Quangang Li, Xuebin Wang, Tingwen Liu and Hongbo Xu
The 46th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 2023)Taipei, 23-27 July 2023.
Learning Structural Co-occurrences for Structured Web Data Extraction in Low-Resource Settings
Zhenyu Zhang, Bowen Yu, Tingwen Liu, Tianyun Liu, Yubin Wang, and Li Guo
The Web Conference 2023 (WWW 2023)Austin, April 30 to May 4 2023.
Label-Aware Chinese Event Detection with Heterogeneous Graph Attention Networks
Shiyao Cui, Bowen Yu, Xin Cong, Tingwen Liu, Qingfeng Tan and Jinqiao Shi
Journal of Computer Science and Technology
Towards Universal Cross-Domain Recommendation
Jiangxia Caog, Shaoshuai Li, Bowen Yu, Xiaobo Guo, Tingwen Liu and Bin Wang
The 16th ACM International WSDM Conference (WSDM 2023), Singapore, February 27 to March 3 2023.
Towards Generalized Open Information Extraction
Bowen Yu,Zhenyu Zhang, Jingyang Li, Haiyang Yu, Tingwen Liu, Jian Sun, Yongbin Li and Bin Wang
The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP 2022), Abu Dhabi, December 7-11 2022.
Enhancing Joint Multiple Intent Detection and Slot Filling with Global Intent-Slot Co-occurrence
Mengxiao Song, Bowen Yu, Li Quangang, Wang Yubin, Tingwen Liu and Hongbo Xu
The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP 2022), Abu Dhabi, December 7-11 2022.
Semi-Supervised Lifelong Language Learning
Yingxiu Zhao, Yinhe Zheng, Bowen Yu, Zhiliang Tian, Dongkyu Lee, Jian Sun, Yongbin Li and Nevin L. Zhang
The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP 2022), Abu Dhabi, December 7-11 2022.
Prompt Conditioned VAE: Enhancing Generative Replay for Lifelong Learning in Task-Oriented Dialogue
Yingxiu Zhao, Yinhe Zheng, Zhiliang Tian, Chang Gao, Bowen Yu, Haiyang Yu, Yongbin Li, Jian Sun and Nevin L Zhang
The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP 2022), Abu Dhabi, December 7-11 2022.
Layout-Aware Information Extraction for Document-Grounded Dialogue: Dataset, Method and Demonstration
Zhenyu Zhang#, Bowen Yu#, Haiyang Yu, Tingwen Liu, Cheng Fu, Jingyang Li, Chengguang Tang and Jian Sun
The 30th ACM International Conference on Multimedia (MM 2022), Lisbon, October 10-14 2022.
A Survey on Neural Open Information Extraction: Current Status and Future Directions
Shaowen Zhou, Bowen Yu, Aixin Sun, Cheng Long, Jingyang Li, Haiyang Yu, Jian Sun and Yongbin Li
The 31st International Joint Conference on Artificial Intelligence (IJCAI 2022), Vienna, July 23-29 2022.
Acceptance rate: 38/209=18.2%
Exploring Modular Task Decomposition in Cross-domain Named Entity Recognition
Xinghua Zhang, Bowen Yu, Tingwen Liu, Yubin Wang, Taoyu Su and Hongbo Xu
The 45th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 2022), Madrid, July 11-15 2022.
Acceptance rate: 161/794=20.3%
Relation-Guided Few-Shot Relational Triple Extraction
Xin Cong, Jiawei Sheng, Shiyao Cui, Bowen Yu, Tingwen Liu and Bin Wang
The 45th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 2022), Madrid, July 11-15 2022.
Acceptance rate: 165/667=24.7%
Enhancing Chinese Pre-trained Language Model via Heterogeneous Linguistics Graph
Yanzeng Li#, Jiangxia Cao#, Xin Cong, Zhenyu Zhang, Bowen Yu, Hongsong Zhu, Tingwen Liu
The 60th Annual Meeting of the Association for Computational Linguistics (ACL 2022), Dublin, May 22-27 2022.
Document-Level Event Extraction via Human-like Reading Process
Shiyao Cui, Xin Cong, Bowen Yu, Tingwen Liu, Yucheng Wang and Jinqiao Shi
2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2022), Virtual, May 7-13 2022.
Maximal Clique Based Non-Autoregressive Open Information Extraction
Bowen Yu, Yucheng Wang, Tingwen Liu, Hongsong Zhu, Limin Sun and Bin Wang
The 2021 Conference on Empirical Methods in Natural Language Processing (EMNLP 2021), Online and in the Dominican Republic, November 7-11, 2021.
Improving Distantly-Supervised Named Entity Recognition with Self-Collaborative Denoising Learning
Xinghua Zhang, Bowen Yu, Tingwen Liu, Zhenyu Zhang, Jiawei Sheng, Xue Mengge and Hongbo Xu
The 2021 Conference on Empirical Methods in Natural Language Processing (Findings of EMNLP 2021), Online and in the Dominican Republic, November 7-11, 2021.
NA-Aware Machine Reading Comprehension for Document-Level Relation Extraction
Zhenyu Zhang, Bowen Yu, Xiaobo Shu, Tingwen Liu
The European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD 2021), Online, September 13-17, 2021.
Discontinuous Named Entity Recognition as Maximal Clique Discovery
Yucheng Wang#, Bowen Yu#, Hongsong Zhu, Tingwen Liu, Nan Yu, Limin Sun
The 59th Annual Meeting of the Association for Computational Linguistics (ACL 2021), Bangkok, Thailand, August 1-6, 2021.
Few-Shot Event Detection with Prototypical Amortized Conditional Random Field
Xin Cong, Shiyao Cui, Bowen Yu, Tingwen Liu, Wang Yubin, Bin Wang
The 59th Annual Meeting of the Association for Computational Linguistics (Findings of ACL 2021), Bangkok, Thailand, August 1-6, 2021.
From What to Why: Improving Relation Extraction with Rationale Graph
Zhenyu Zhang, Bowen Yu, Xiaobo Shu, Xue Mengge, Tingwen Liu, Li Guo
The 59th Annual Meeting of the Association for Computational Linguistics (Findings of ACL 2021), Bangkok, Thailand, August 1-6, 2021.
CasEE: A Joint Learning Framework with Cascade Decoding for Overlapping Event Extraction
Jiawei Sheng, Shu Guo, Bowen Yu, Qian Li, Yiming Hei, Lihong Wang, Tingwen Liu, Hongbo Xu
The 59th Annual Meeting of the Association for Computational Linguistics (Findings of ACL 2021), Bangkok, Thailand, August 1-6, 2021.
FITAnnotator: A Flexible and Intelligent Text Annotation System (Demo Paper)
Yanzeng Li, Bowen Yu, Li Quangang, Tingwen Liu
2021 Annual Conference of the North American Chapter of the Association for Computational Linguistics (NAACL 2021), Online, June 6-11, 2021.
Semi-Open Information Extraction
Bowen Yu, Zhenyu Zhang, Jiawei Sheng, Tingwen Liu, Yubin Wang, Yucheng Wang and Bin Wang
The Web Conference 2021 (WWW 2021), Ljubljana, April 19-23, 2021.
Acceptance rate: 357/1736=20.6%
Porous Lattice Transformer Encoder for Chinese NER
|
Xue Mengge, Bowen Yu, Tingwen Liu, Yue Zhang, Erli Meng and Bin Wang
The 28th International Conference on Computational Linguistics (COLING 2020), Barcelona, Spain, December 8-13, 2020.
Learning to Prune Dependency Trees with Rethinking for Neural Relation Extraction
|
Bowen Yu, Xue Mengge, Zhenyu Zhang, Tingwen Liu, Yubin Wang and Bin Wang
The 28th International Conference on Computational Linguistics (COLING 2020), Barcelona, Spain, December 8-13, 2020.
Document-level Relation Extraction with Dual-tier Heterogeneous Graph
|
Zhenyu Zhang, Bowen Yu, Xiaobo Shu, Tingwen Liu, Hengzhu Tang, Yubin Wang and Li Guo
The 28th International Conference on Computational Linguistics (COLING 2020), Barcelona, Spain, December 8-13, 2020.
TPLinker: Single-stage Joint Extraction of Entities and Relations Through Token Pair Linking
|
Yucheng Wang, Bowen Yu*, Yueyang Zhang, Tingwen Liu, Hongsong Zhu and Limin Sun
The 28th International Conference on Computational Linguistics (COLING 2020), Barcelona, Spain, December 8-13, 2020.
Coarse-to-Fine Pre-training for Named Entity Recognition
|
Xue Mengge, Bowen Yu, Zhenyu Zhang, Tingwen Liu, Yue Zhang and Bin Wang
The 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP 2020), Online, November 16-20, 2020.
Acceptance rate: 754/3114=24.82%
Edge-Enhanced Graph Convolution Networks for Event Detection with Syntactic Relation
|
Shiyao Cui, Bowen Yu, Tingwen Liu, Zhenyu Zhang, Xuebin Wang and Jinqiao Shi
Findings of the 2020 Conference on Empirical Methods in Natural Language Processing (Findings of EMNLP 2020), Online, November 16-20, 2020.
Inductive Unsupervised Domain Adaptation for Few-Shot Classification via Clustering
|
Xin Cong, Bowen Yu, Tingwen Liu, Shiyao Cui, Hengzhu Tang, Bin Wang
The European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD 2020), Ghent, Belgium, September 14-18, 2020.
Acceptance rate: 131/687=19.1%
Enhancing Pre-trained Chinese Character Representation with Word-aligned Attention (Short Paper)
|
Yanzeng Li, Bowen Yu, Mengge Xue, Tingwen Liu
The 58th Annual Meeting of the Association for Computational Linguistics (ACL 2020), July 5-10, 2020.
Acceptance rate: 208/1185=17.6%
DRG2vec: Learning Word Representations from Definition Relational Graph |
Xiaobo Shu, Bowen Yu, Zhenyu Zhang, Tingwen Liu
The 2020 International Joint Conference on Neural Networks (IJCNN 2020), Glasgow, UK, July 19–24, 2020.
Strong Baselines for Author Name Disambiguation with and without Neural Networks |
Zhenyu Zhang, Bowen Yu, Tingwen Liu, Dong Wang
The 24th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2020), pages 369-381, Singapore, May 11-14, 2020.
Acceptance rate: 135/628=21.5%
Joint Extraction of Entities and Relations Based on a Novel Decomposition Strategy |
Bowen Yu, Zhenyu Zhang, Xiaobo Shu, Tingwen Liu, Yubin Wang, Bin Wang and Sujian Li
The 24th European Conference on Artificial Intelligence (ECAI 2020), Santiago de Compostela, Spain, August 29-September 5,2020.
Acceptance rate: 365/1363=26.8%
Distilling Knowledge from Well-informed Soft Labels for Neural Relation Extraction |
Zhenyu Zhang, Xiaobo Shu, Bowen Yu, Tingwen Liu, Jiapeng Zhao, Quangang Li, Li Guo
The 34th AAAI Conference on Artificial Intelligence (AAAI 2020), pages 9620-9627, New York, USA, February 7-12,2020.
Acceptance rate: 1591/7737=20.6%
Beyond Word Attention: Using Segment Attention in Neural Relation Extraction |
Bowen Yu, Zhenyu Zhang, Tingwen Liu, Bin Wang, Sujian Li and Quangang Li
The 28th International Joint Conference on Artificial Intelligence (IJCAI 2019), pages 5401-5407, Macao, China, August 10-16, 2019.
Acceptance rate: 850/4752=17.9%


Hi, this is Jing.
Chinese born and raised
USF Media Studies student
A designer, traveler.
Our first 5 mins short documentary film made by Eunice Hoo and Me for
Video Production class. Our documentary is a profile of Taiwanese
artist, Justin Chen. Currently working as a designer at Google, Chen
gave up his singing career in Taiwan for a life in the States. Upon
graduating from UCLA in 2006, Chen has went around the States looking
for a job in order to secure a lifestyle here. He had since created an
art exhibit called Censored, a portrait of Ai Weiwei from 400 tweets
about the Chinese artist. He chose to give up a chance at rising stardom
in Taiwan and instead pursued a life here in the States. Our film aims
to include universal theme of making tough decisions and the dilemma
foreign students have to go through after graduating- whether to stay
and work in the city where you graduate or going back home where there
are more opportunities. Hopefully serving as a guide to the
international students here about making a choice after graduation and
finding what works for you.


Please turn your screen to landscape view
Awaiting connection
Alert - too close to an object
STOP
Emergency Stop
Start Gyro Control
Current range (fwd):


--- layout: post title: Dads date: '2006-11-20T00:00:00-05:00' tags: - '2006' tumblr_url: http://poetry.liabogoev.com/post/49085170596/dads ---
Dads survey their yard,
While you’re almost late for school,
But definitely other than that,
They’re really quite cool.
They eat pistachios,
And tell you stories late at night,
They hug you when you’re cold,
And shivering with fright.
Dads drink their coffee,
And show you how to lay stone,
They mark your height on the wall,
To show you how much you’ve grown.
Dads really are the best there is,
But I know that mine’s by far the best,
I can name a million reasons,
But I think you know the rest.


Forward your logs to Splunk.
Configure your extension setting up these values as application settings in your web app.
LOG_FILE_PATH
START_ON_HOME
INDEX_NAME
SPLUNK_HOSTNAME
SPLUNK_USERNAME
SPLUNK_PASSWORD
DELAY


Changing AppSettings in tests
ConfigurationManager.AppSettings is a static dependency, so how can you unit test? Actually it's pretty easy - GetSection, Save, RefreshSection.
The only caveat is you must have an app.config in your test project, even if it's empty.
[TestClass]
public class ChangeConfigurationTest
{
private const string Value = "Hello";
private const string KeyValue = "MySetting";
private static void ChangeConfiguration()
{
//the .config must exist (AppSettings doesn't have to be there).
//if your test class doesn't have an App.config, this succeeds but the new appSetting is not loaded.
var config = ConfigurationManager.OpenExeConfiguration(Assembly.GetCallingAssembly().Location);
var appSettings = (AppSettingsSection)config.GetSection("appSettings");
appSettings.Settings.Clear();
appSettings.Settings.Add(KeyValue, Value);
config.Save();
ConfigurationManager.RefreshSection("appSettings");
}
[TestMethod]
public void TestMethod1()
{
var setting = ConfigurationManager.AppSettings[KeyValue];
Assert.AreEqual(true, string.IsNullOrEmpty(setting));
ChangeConfiguration();
setting = ConfigurationManager.AppSettings[KeyValue];
Assert.AreEqual(Value, setting);
}
}
ConnectionStrings
The corresponding code for a connection string.
private static void ChangeConfiguration()
{
var config = ConfigurationManager.OpenExeConfiguration(Assembly.GetCallingAssembly().Location);
var connectionStrings = (ConnectionStringsSection)config.GetSection("connectionStrings");
connectionStrings.ConnectionStrings["MyDatabase"]
.ConnectionString = @"Data Source=C:\Dev\commands.sqlite";
config.Save();
ConfigurationManager.RefreshSection("connectionStrings");
}


Genesis 27:45
Until thy brother's anger turn away from thee, and he forget that which thou hast done to him: then I will send, and fetch thee from thence: why should I be deprived also of you both in one day?


With Classing{js}
and its ability to make a class implements multiple interfaces in addition to inheriting a class, the ordinary instanceof
operator of javascript became limited as it cannot check if a class is an instance of an interface that is implemented by it. To solve this issue, the library provides a custom method called instanceOf
that gets attached to every object you create and has the ability to check if this object is an instance of a class or an interface in any level in the ancstors tree.
It's extremly simple to use , just call yourObject.instanceOf(ancestor)
and it will return true if your object is an instance of that ancestor, or false otherwise.
Here's an exmaple that will make things even clearer:
var Identifiable = classing.Interface({ getIdentified: function(){} }); var IPayable = classing.Interface({ getPaid : function(){} }); var Person = classing.Class.Implements(Identifiable)({ private : { id : null, }, protected : { name : null, age : null, }, public : { Construct : Function.create(xTyped , [ types(), function() { this.id = Date.now(); }, types(String , Number), function(str , num) { this.name = str; this.age = num; this.id = Date.now(); } ]), getIdentified : function() { return this.id; } } }); var Employee = classing.Class.Extends(Person).Implements(IPayable)({ protected : { salary : 5000, balance : 0 }, public : { getPaid : function() { this.balance += this.salary; } } }); var emp1 = new Empolyee(); emp1.instanceOf(Empolyee); //true emp1.instanceOf(IPayable); //true emp1.instanceOf(Person); //true emp1.instanceOf(Identifiable); //true emp1.instanceOf(Object); //true emp1.instsnceOf(Array); //false


admin Class
The api module to do administrative requests on Arango
Item Index
Methods
echo
()
Promise
The call returns an object with the following attributes:
- headers: a list of HTTP headers received
\n
- requestType: the HTTP request method (e.g. GET)
- parameters: list of URL parameters received
Returns:
Promise:
log
(
Promise
-
[options]
Returns the server logs.
Parameters:
-
[options]
Object optional- Optional parameters and filters, can contain.
-
[upto]
String optional- Returns all log entries up to log level upto. Note that upto must be:
- fatal or 0
- error or 1
- warning or 2
- info or 3
- debug or 4
The default value is info.
- Returns all log entries up to log level upto. Note that upto must be:
-
[level]
String optional- Returns all log entries of log level level. Note that the URL parameters upto and level are mutually exclusive.
-
[start]
String optional- Returns all log entries such that their log entry identifier (lid value) is greater or equal to start.
-
[size]
Number optional- Restricts the result to at most size log entries.
-
[offset]
Number optional- Starts to return log entries skipping the first offset log entries. offset and size can be used for pagination.
-
[sort]
String optional- Sort the log entries either ascending (if sort is asc) or descending (if sort is desc) according to their lid values. Note that the lid imposes a chronological order. The default value is asc
Returns:
Promise:
modulesFlush
(
Promise
-
waitForSync
-
waitForCollector
Flushes the server wal.
Parameters:
-
waitForSync
Boolean- Should wait if everything is synced to disk.
-
waitForCollector
Boolean- Should wait for the collector to execute.
Returns:
Promise:
modulesFlush
()
Promise
Flushes the server modules.
Returns:
Promise:
role
()
Promise
Returns servers role. Possible values are "UNDEFINED", "COORDINATOR" or "PRIMARY".
Returns:
Promise:
routes
()
Promise
Returns the routes defined in ArangoDB,
Returns:
Promise:
routesReload
()
Promise
Reloads the routes in ArangoDB.
Returns:
Promise:
statistics
()
Promise
Returns server statistics.
Returns:
Promise:
statisticsDescription
()
Promise
Returns descriptions for server statistics.
Returns:
Promise:
time
()
Promise
Returns the server time.
Returns:
Promise:
version
(
Promise
-
details
Returns the server version
Parameters:
-
details
Boolean- If true more details are returned.
Returns:
Promise:


You need a vacation.
Where to next?
You're going to Patagonia!
Start packing for Tokyo!
Mentally prepare for Las Vegas!
Staycation. 100%.
It may be best to just stay home and hang out until you know what you want. But staying home is great! Enjoy it.


Edu
.
About
Contact
Log In
About
Contact
Log In
menu
Contact Us
account_circle
First Name
phone
Telephone
Send


Presentation created by Robert Fauver / @fauverism
“AngularJS is what HTML would have been, had it been designed for building web-apps. Declarative templates with data-binding, MVW, MVVM, MVC, dependency injection and great testability story all implemented with pure client-side JavaScript!”
“”


Name required length must be at least {{ firstName?.errors?.minlength?.requiredLength }} characters in length but actually got {{ firstName?.errors?.minlength?.actualLength }} characters in length
Email is required
Invalid Email format
contact is required
invalid contact pattern
contact required length must be at least {{ contact?.errors?.minlength?.requiredLength }} characters in length but actually got {{ contact?.errors?.minlength?.actualLength }} characters in length


genes homeodomain proteins homeobox class plant conserved fig. domain gene sequence classes KNOX identified HD-ZIP green sequences plants Arabidopsis Bürglin moss unicellular TALE genome Plant protein algae BEL characterized evolutionary flowering motif DDT Supplementary Material red different using D-TOX common supplementary newly genomes present plants, {border-style alignment animal named Biol PINTOX codomain intron non-TALE px;} #ffffff;} Selaginella, amino domains evolution finger searches associated moss, zinc algae, database number proteins, shown analysis ancestor domain, including plants. previously rice suggesting table vascular PHD SAWADEE Selaginella WOX classified insertion land motifs multiple predicted represented similar transcription tree Class IG. PHD, based group online). position proteins. used However, acid alga animals helix highly motif, novel zipper Mol genes, groups presence results server structure subclasses support upstream C-terminal Evol JGI Ostreococcus complete corresponding did distinct family identify maize panel propose residues separation similarity thaliana (see Blast Chl. Homeobox III NDX analyses belonging bootstrap characteristic class. classes, classification data developmental domains, homeodomain-leucine insertions members new obtained patens px; region reinhardtii rice, suggests supported {font-family Homeodomain LD, MEINOX MEIS Multiple N-terminal PBC Physiol a). branches diagnostic differentiation duplication font-size genes. genomic high highlighted homeodomains leucine-zipper local maize, motifs, phylogenetic poplar positions properties sequences, superclass types typical unique Chlamydomonas DNA-binding Derelle Dev ELK Genes LINK New Physcomitrella SAWADEE, START Sci WSD additional algae. architecture codomains connecting conservation development double; downstream early expression extra factor functional helices homeodomain, homeodomain. indicated interaction monocots query recently regions representatives separated species specific trees (HD-ZIP Classes DDT, DNA IV, KNOX, Mukherjee NDX, Ruberti TBlastN ZIBEL acids addition alignment. alignments border-color border-width clade class, classes. clustered co-authors) collab: end expressed families genes) known lost lucimarinus molecular online) pattern patterns performed physicochemical related reported retrieve retrieved role sequences. seven shades signature solid; substitution values {font-style {font-weight -aa-long ATHB, Acad BEL, BEL-A Bharathan Bootstrap Cell Characterization Genome HAT, II, MEKHLA Natl PBC-B PLINC Proc Protein Proteins SKY Sakakibara Sessa Similarly, USA aligned allowed appeared available b). bold called carried chromatin compared comprehensive consensus contain courier; distinguish em; eudicots eukaryotic examined factors figs. following full-length gray. greater groups. history interact length leucine lineages located loop merolae model modern moellendorffii online), originated poplar, proliferation provide pt;} remodeling representation root second separate set showed similarities single sites subdivided successively suggest syndrome thaliana, total type uniquely van


sliderA = new JSlider( SwingConstants.HORIZONTAL, 0, 1000, 400); sliderB = new JSlider( SwingConstants.HORIZONTAL, 0, 1000, 400); . . . sliderA.setName( "sliderA" ); sliderB.setName( "sliderB" ); sliderA.addChangeListener( this ); sliderB.addChangeListener( this );
Any two unique strings will work. It is OK to use the same word for the reference variable and the name of a component. The two are completely separate, and Java will not get confused.
Object getSource()
MethodAn event object contains a reference to the component that generated the event. To extract that reference from the event object use:
Object getSource()
Since the return type of getSource()
is Object
you typically use a type cast
with it:
// listener method
public void stateChanged( ChangeEvent evt )
{
JSlider source;
source = (JSlider)evt.getSource();
. . . .
}
Now that you have a reference to whichever slider caused the event you can use any of the slider's methods.


To use UserScripts you need to install chrome extension from Google's Web Store
Than click on script you want to install


TERMS OF USE
Last updated March 12, 2019
AGREEMENT TO TERMS
These Terms of Use constitute a legally binding agreement made between you, whether personally
or on behalf of an entity (“you”) and Mey's Aquatics ("Company", “we”, “us”, or “our”),
concerning your access to and use of the www.meysaquatics.com website as well as any other media
form, media channel, mobile website or mobile application related, linked, or otherwise
connected thereto (collectively, the “Site”). You agree that by accessing the Site, you have
read, understood, and agreed to be bound by all of these Terms of Use.
Supplemental terms and conditions or documents that may be posted on the Site from time to time
are hereby expressly incorporated herein by reference. We reserve the right, in our sole
discretion, to make changes or modifications to these Terms of Use at any time and for any
reason. We will alert you about any changes by updating the “Last updated” date of these Terms
of Use, and you waive any right to receive specific notice of each such change. It is your
responsibility to periodically review these Terms of Use to stay informed of updates. You will
be subject to, and will be deemed to have been made aware of and to have accepted, the changes
in any revised Terms of Use by your continued use of the Site after the date such revised Terms
of Use are posted.
The information provided on the Site is not intended for distribution to or use by any person or
entity in any jurisdiction or country where such distribution or use would be contrary to law or
regulation or which would subject us to any registration requirement within such jurisdiction or
country. Accordingly, those persons who choose to access the Site from other locations do so on
their own initiative and are solely responsible for compliance with local laws, if and to the
extent local laws are applicable. The Site is intended for users who are at least 18 years old.
Persons under the age of 18 are not permitted to use or register for the Site.
INTELLECTUAL PROPERTY RIGHTS
Unless otherwise indicated, the Site is our proprietary property and all source code, databases,
functionality, software, website designs, audio, video, text, photographs, and graphics on the
Site (collectively, the “Content”) and the trademarks, service marks, and logos contained
therein (the “Marks”) are owned or controlled by us or licensed to us, and are protected by
copyright and trademark laws and various other intellectual property rights and unfair
competition laws of the United States, foreign jurisdictions, and international conventions. The
Content and the Marks are provided on the Site “AS IS” for your information and personal use
only. Except as expressly provided in these Terms of Use, no part of the Site and no Content or
Marks may be copied, reproduced, aggregated, republished, uploaded, posted, publicly displayed,
encoded, translated, transmitted, distributed, sold, licensed, or otherwise exploited for any
commercial purpose whatsoever, without our express prior written permission. Provided that you
are eligible to use the Site, you are granted a limited license to access and use the Site and
to download or print a copy of any portion of the Content to which you have properly gained
access solely for your personal, non-commercial use. We reserve all rights not expressly granted
to you in and to the Site, the Content and the Marks.
USER REPRESENTATIONS
By using the Site, you represent and warrant that: (1) you have the legal capacity and you
agree to comply with these Terms of Use; (2) you are not a minor in the jurisdiction in which
you reside; (3) you will not access the Site through automated or non-human means, whether
through a bot, script or otherwise; (4) you will not use the Site for any illegal or
unauthorized purpose; and (5) your use of the Site will not violate any applicable law or
regulation. If you provide any information that is untrue, inaccurate, not current, or
incomplete, we have the right to suspend or terminate your account and refuse any and all
current or future use of the Site (or any portion thereof).
PRODUCTS
We make every effort to display as accurately as possible the colors, features, specifications,
and details of the products available on the Site. However, we do not guarantee that the colors,
features, specifications, and details of the products will be accurate, complete, reliable,
current, or free of other errors, and your electronic display may not accurately reflect the
actual colors and details of the products. All products are subject to availability, and we
cannot guarantee that items will be in stock. We reserve the right to discontinue any products
at any time for any reason. Prices for all products are subject to change.
PURCHASES AND PAYMENT
We accept the following forms of payment:
You agree to provide current, complete, and accurate purchase and account information for all
purchases made via the Site. You further agree to promptly update account and payment
information, including email address, payment method, and payment card expiration date, so that
we can complete your transactions and contact you as needed. Sales tax will be added to the
price of purchases as deemed required by us. We may change prices at any time. All payments
shall be in U.S. dollars. You agree to pay all charges at the prices then in effect for your
purchases and any applicable shipping fees, and you authorize us to charge your chosen payment
provider for any such amounts upon placing your order. We reserve the right to correct any
errors or mistakes in pricing, even if we have already requested or received payment. We reserve
the right to refuse any order placed through the Site. We may, in our sole discretion, limit or
cancel quantities purchased per person, per household, or per order. These restrictions may
include orders placed by or under the same customer account, the same payment method, and/or
orders that use the same billing or shipping address. We reserve the right to limit or prohibit
orders that, in our sole judgment, appear to be placed by dealers, resellers, or distributors.
RETURN POLICY
All sales are final and no refund will be issued.
PROHIBITED ACTIVITIES
You may not access or use the Site for any purpose other than that for which we make the Site
available. The Site may not be used in connection with any commercial endeavors except those
that are specifically endorsed or approved by us. As a user of the Site, you agree not to:
-
Systematically retrieve data or other content from the Site to create or compile, directly
or indirectly, a collection, compilation, database, or directory without written permission
from us.
-
Make any unauthorized use of the Site, including collecting usernames and/or email addresses
of users by electronic or other means for the purpose of sending unsolicited email, or
creating user accounts by automated means or under false pretenses.
-
Circumvent, disable, or otherwise interfere with security-related features of the Site,
including features that prevent or restrict the use or copying of any Content or enforce
limitations on the use of the Site and/or the Content contained therein.
-
Trick, defraud, or mislead us and other users, especially in any attempt to learn sensitive
account information such as user passwords.
-
Make improper use of our support services or submit false reports of abuse or misconduct.
-
Engage in any automated use of the system, such as using scripts to send comments or
messages, or using any data mining, robots, or similar data gathering and extraction tools.
-
Interfere with, disrupt, or create an undue burden on the Site or the networks or services
connected to the Site.
- Attempt to impersonate another user or person or use the username of another user.
-
Use any information obtained from the Site in order to harass, abuse, or harm another
person.
-
Use the Site as part of any effort to compete with us or otherwise use the Site and/or the
Content for any revenue-generating endeavor or commercial enterprise.
-
Decipher, decompile, disassemble, or reverse engineer any of the software comprising or in
any way making up a part of the Site.
-
Attempt to bypass any measures of the Site designed to prevent or restrict access to the
Site, or any portion of the Site.
-
Harass, annoy, intimidate, or threaten any of our employees or agents engaged in providing
any portion of the Site to you.
- Delete the copyright or other proprietary rights notice from any Content.
-
Copy or adapt the Site’s software, including but not limited to Flash, PHP, HTML,
JavaScript, or other code.
-
Upload or transmit (or attempt to upload or to transmit) viruses, Trojan horses, or other
material, including excessive use of capital letters and spamming (continuous posting of
repetitive text), that interferes with any party’s uninterrupted use and enjoyment of the
Site or modifies, impairs, disrupts, alters, or interferes with the use, features,
functions, operation, or maintenance of the Site.
-
Upload or transmit (or attempt to upload or to transmit) any material that acts as a passive
or active information collection or transmission mechanism, including without limitation,
clear graphics interchange formats (“gifs”), 1×1 pixels, web bugs, cookies, or other similar
devices (sometimes referred to as “spyware” or “passive collection mechanisms” or “pcms”).
-
Except as may be the result of standard search engine or Internet browser usage, use,
launch, develop, or distribute any automated system, including without limitation, any
spider, robot, cheat utility, scraper, or offline reader that accesses the Site, or using or
launching any unauthorized script or other software.
-
Disparage, tarnish, or otherwise harm, in our opinion, us and/or the Site.
- Use the Site in a manner inconsistent with any applicable laws or regulations.
- Engage in unauthorized framing of or linking to the Site.
SUBMISSIONS
You acknowledge and agree that any questions, comments, suggestions, ideas, feedback, or other
information regarding the Site or the Marketplace Offerings ("Submissions") provided by you to
us are non-confidential and shall become our sole property. We shall own exclusive rights,
including all intellectual property rights, and shall be entitled to the unrestricted use and
dissemination of these Submissions for any lawful purpose, commercial or otherwise, without
acknowledgment or compensation to you. You hereby waive all moral rights to any such
Submissions, and you hereby warrant that any such Submissions are original with you or that you
have the right to submit such Submissions. You agree there shall be no recourse against us for
any alleged or actual infringement or misappropriation of any proprietary right in your
Submissions.
THIRD-PARTY WEBSITES AND CONTENT
The Site may contain (or you may be sent via the Site or the Marketplace Offerings) links to
other websites ("Third-Party Websites") as well as articles, photographs, text, graphics,
pictures, designs, music, sound, video, information, applications, software, and other content
or items belonging to or originating from third parties ("Third-Party Content"). Such
Third-Party Websites and Third-Party Content are not investigated, monitored, or checked for
accuracy, appropriateness, or completeness by us, and we are not responsible for any Third Party
Websites accessed through the Site or any Third-Party Content posted on, available through, or
installed from the Site, including the content, accuracy, offensiveness, opinions, reliability,
privacy practices, or other policies of or contained in the Third-Party Websites or the
Third-Party Content. Inclusion of, linking to, or permitting the use or installation of any
Third-Party Websites or any Third-PartyContent does not imply approval or endorsement thereof by
us. If you decide to leave the Site and access the Third-Party Websites or to use or install any
Third-Party Content, you do so at your own risk, and you should be aware these Terms of Use no
longer govern. You should review the applicable terms and policies, including privacy and data
gathering practices, of any website to which you navigate from the Site or relating to any
applications you use or install from the Site. Any purchases you make through Third-Party
Websites will be through other websites and from other companies, and we take no responsibility
whatsoever in relation to such purchases which are exclusively between you and the applicable
third party. You agree and acknowledge that we do not endorse the products or services offered
on Third-Party Websites and you shall hold us harmless from any harm caused by your purchase of
such products or services. Additionally, you shall hold us harmless from any losses sustained by
you or harm caused to you relating to or resulting in any way from any Third-Party Content or
any contact with Third-Party Websites.
SITE MANAGEMENT
We reserve the right, but not the obligation, to: (1) monitor the Site for violations of these
Terms of Use; (2) take appropriate legal action against anyone who, in our sole discretion,
violates the law or these Terms of Use, including without limitation, reporting such user to law
enforcement authorities; (3) in our sole discretion and without limitation, refuse, restrict
access to, limit the availability of, or disable (to the extent technologically feasible) any of
your Contributions or any portion thereof; (4) in our sole discretion and without limitation,
notice, or liability, to remove from the Site or otherwise disable all files and content that
are excessive in size or are in any way burdensome to our systems; and (5) otherwise manage the
Site in a manner designed to protect our rights and property and to facilitate the proper
functioning of the Site and the Marketplace Offerings.
PRIVACY POLICY
We care about data privacy and security. Please review our Privacy
Policy: https://www.meysaquatics.com/privacy.html. By using the Site or the Marketplace
Offerings, you agree to be bound by our Privacy Policy, which is incorporated into these Terms
of Use. Please be advised the Site and the Marketplace Offerings are hosted in the United
States. If you access the Site or the Marketplace Offerings from the European Union, Asia, or
any other region of the world with laws or other requirements governing personal data
collection, use, or disclosure that differ from applicable laws in the United States, then
through your continued use of the Site, you are transferring your data to the United States, and
you expressly consent to have your data transferred to and processed in the United States.
Further, we do not knowingly accept, request, or solicit information from children or knowingly
market to children. Therefore, in accordance with the U.S. Children’s Online Privacy Protection
Act, if we receive actual knowledge that anyone under the age of 13 has provided personal
information to us without the requisite and verifiable parental consent, we will delete that
information from the Site as quickly as is reasonably practical.
TERM AND TERMINATION
These Terms of Use shall remain in full force and effect while you use the Site. WITHOUT
LIMITING ANY OTHER PROVISION OF THESE TERMS OF USE, WE RESERVE THE RIGHT TO, IN OUR SOLE
DISCRETION AND WITHOUT NOTICE OR LIABILITY, DENY ACCESS TO AND USE OF THE SITE AND THE
MARKETPLACE OFFERINGS (INCLUDING BLOCKING CERTAIN IP ADDRESSES), TO ANY PERSON FOR ANY REASON OR
FOR NO REASON, INCLUDING WITHOUT LIMITATION FOR BREACH OF ANY REPRESENTATION, WARRANTY, OR
COVENANT CONTAINED IN THESE TERMS OF USE OR OF ANY APPLICABLE LAW OR REGULATION. WE MAY
TERMINATE YOUR USE OR PARTICIPATION IN THE SITE AND THE MARKETPLACE OFFERINGS OR DELETE ANY
CONTENT OR INFORMATION THAT YOU POSTED AT ANY TIME, WITHOUT WARNING, IN OUR SOLE DISCRETION. If
we terminate or suspend your account for any reason, you are prohibited from registering and
creating a new account under your name, a fake or borrowed name, or the name of any third party,
even if you may be acting on behalf of the third party. In addition to terminating or suspending
your account, we reserve the right to take appropriate legal action, including without
limitation pursuing civil, criminal, and injunctive redress.
MODIFICATIONS AND INTERRUPTIONS
We reserve the right to change, modify, or remove the contents of the Site at any time or for
any reason at our sole discretion without notice. However, we have no obligation to update any
information on our Site. We also reserve the right to modify or discontinue all or part of the
Marketplace Offerings without notice at any time. We will not be liable to you or any third
party for any modification, price change, suspension, or discontinuance of the Site or the
Marketplace Offerings. We cannot guarantee the Site and the Marketplace Offerings will be
available at all times. We may experience hardware, software, or other problems or need to
perform maintenance related to the Site, resulting in interruptions, delays, or errors. We
reserve the right to change, revise, update, suspend, discontinue, or otherwise modify the Site
or the Marketplace Offerings at any time or for any reason without notice to you. You agree that
we have no liability whatsoever for any loss, damage, or inconvenience caused by your inability
to access or use the Site or the Marketplace Offerings during any downtime or discontinuance of
the Site or the Marketplace Offerings. Nothing in these Terms of Use will be construed to
obligate us to maintain and support the Site or the Marketplace Offerings or to supply any
corrections, updates, or releases in connection therewith.
GOVERNING LAW
These Terms of Use and your use of the Site and the Marketplace Offerings are governed by and
construed in accordance with the laws of the State of Delaware applicable to agreements made and
to be entirely performed within the State of Delaware, without regard to its conflict of law
principles.
DISPUTE RESOLUTION
Informal Negotiations
To expedite resolution and control the cost of any dispute, controversy, or claim related to
these Terms of Use (each a "Dispute" and collectively, the “Disputes”) brought by either you or
us (individually, a “Party” and collectively, the “Parties”), the Parties agree to first attempt
to negotiate any Dispute (except those Disputes expressly provided below) informally for at
least thirty (30) days before initiating arbitration. Such informal negotiations commence upon
written notice from one Party to the other Party.
Binding Arbitration
If the Parties are unable to resolve a Dispute through informal negotiations, the Dispute
(except those Disputes expressly excluded below) will be finally and exclusively resolved by
binding arbitration.  The arbitration shall be commenced and conducted under the
Commercial Arbitration Rules of the American Arbitration Association ("AAA") and, where
appropriate, the AAA’s Supplementary Procedures for Consumer Related Disputes ("AAA Consumer
Rules"), both of which are available at the AAA website www.adr.org. Your arbitration fees and
your share of arbitrator compensation shall be governed by the AAA Consumer Rules and, where
appropriate, limited by the AAA Consumer Rules. The arbitration may be conducted in person,
through the submission of documents, by phone, or online. The arbitrator will make a decision in
writing, but need not provide a statement of reasons unless requested by either Party. The
arbitrator must follow applicable law, and any award may be challenged if the arbitrator fails
to do so. Except where otherwise required by the applicable AAA rules or applicable law, the
arbitration will take place in New Castle County, Delaware. Except as otherwise provided herein,
the Parties may litigate in court to compel arbitration, stay proceedings pending arbitration,
or to confirm, modify, vacate, or enter judgment on the award entered by the arbitrator.
If for any reason, a Dispute proceeds in court rather than arbitration, the Dispute shall be
commenced or prosecuted in the state and federal courts located in New Castle County, Delaware,
and the Parties hereby consent to, and waive all defenses of lack of personal jurisdiction, and
forum non conveniens with respect to venue and jurisdiction in such state and federal courts.
Application of the United Nations Convention on Contracts for the International Sale of Goods
and the the Uniform Computer Information Transaction Act (UCITA) are excluded from these Terms
of Use.
In no event shall any Dispute brought by either Party related in any way to the Site be
commenced more than one (1) years after the cause of action arose. If this provision is found to
be illegal or unenforceable, then neither Party will elect to arbitrate any Dispute falling
within that portion of this provision found to be illegal or unenforceable and such Dispute
shall be decided by a court of competent jurisdiction within the courts listed for jurisdiction
above, and the Parties agree to submit to the personal jurisdiction of that court.
Restrictions
The Parties agree that any arbitration shall be limited to the Dispute between the Parties
individually. To the full extent permitted by law, (a) no arbitration shall be joined with any
other proceeding; (b) there is no right or authority for any Dispute to be arbitrated on a
class-action basis or to utilize class action procedures; and (c) there is no right or authority
for any Dispute to be brought in a purported representative capacity on behalf of the general
public or any other persons.
Exceptions to Informal Negotiations and Arbitration
The Parties agree that the following Disputes are not subject to the above provisions concerning
informal negotiations and binding arbitration: (a) any Disputes seeking to enforce or protect,
or concerning the validity of, any of the intellectual property rights of a Party; (b) any
Dispute related to, or arising from, allegations of theft, piracy, invasion of privacy, or
unauthorized use; and (c) any claim for injunctive relief. If this provision is found to be
illegal or unenforceable, then neither Party will elect to arbitrate any Dispute falling within
that portion of this provision found to be illegal or unenforceable and such Dispute shall be
decided by a court of competent jurisdiction within the courts listed for jurisdiction above,
and the Parties agree to submit to the personal jurisdiction of that court.
CORRECTIONS
There may be information on the Site that contains typographical errors, inaccuracies, or
omissions that may relate to the Marketplace Offerings, including descriptions, pricing,
availability, and various other information. We reserve the right to correct any errors,
inaccuracies, or omissions and to change or update the information on the Site at any time,
without prior notice.
    WE DO NOT WARRANT, ENDORSE, GUARANTEE, OR ASSUME RESPONSIBILITY FOR
ANY PRODUCT OR SERVICE ADVERTISED OR OFFERED BY A THIRD PARTY THROUGH THE SITE, ANY HYPERLINKED
WEBSITE, OR ANY WEBSITE OR MOBILE APPLICATION FEATURED IN ANY BANNER OR OTHER ADVERTISING, AND
WE WILL NOT BE A PARTY TO OR IN ANY WAY BE RESPONSIBLE FOR MONITORING ANY TRANSACTION BETWEEN
YOU AND ANY THIRD-PARTY PROVIDERS OF PRODUCTS OR SERVICES.
 NOTWITHSTANDING ANYTHING
TO THE CONTRARY CONTAINED HEREIN, OUR LIABILITY TO YOU FOR ANY CAUSE WHATSOEVER AND REGARDLESS
OF THE FORM OF THE ACTION, WILL AT ALL TIMES BE LIMITED TO THE LESSER OF THE AMOUNT PAID, IF
ANY, BY YOU TO US DURING THE three (3) MONTH PERIOD PRIOR TO ANY CAUSE OF ACTION ARISING OR
$100.00 USD. CERTAIN STATE LAWS DO NOT ALLOW LIMITATIONS ON IMPLIED WARRANTIES OR THE EXCLUSION
OR LIMITATION OF CERTAIN DAMAGES. IF THESE LAWS APPLY TO YOU, SOME OR ALL OF THE ABOVE
DISCLAIMERS OR LIMITATIONS MAY NOT APPLY TO YOU, AND YOU MAY HAVE ADDITIONAL RIGHTS.
INDEMNIFICATION
You agree to defend, indemnify, and hold us harmless, including our subsidiaries, affiliates,
and all of our respective officers, agents, partners, and employees, from and against any loss,
damage, liability, claim, or demand, including reasonable attorneys’ fees and expenses, made by
any third party due to or arising out of: (1) use of the Site; (2) breach of these Terms of Use;
(3) any breach of your representations and warranties set forth in these Terms of Use; (4) your
violation of the rights of a third party, including but not limited to intellectual property
rights; or (5) any overt harmful act toward any other user of the Site with whom you connected
via the Site. Notwithstanding the foregoing, we reserve the right, at your expense, to assume
the exclusive defense and control of any matter for which you are required to indemnify us, and
you agree to cooperate, at your expense, with our defense of such claims. We will use reasonable
efforts to notify you of any such claim, action, or proceeding which is subject to this
indemnification upon becoming aware of it. USER DATA We will maintain certain data that you
transmit to the Site for the purpose of managing the performance of the Site, as well as data
relating to your use of the Site. Although we perform regular routine backups of data, you are
solely responsible for all data that you transmit or that relates to any activity you have
undertaken using the Site. You agree that we shall have no liability to you for any loss or
corruption of any such data, and you hereby waive any right of action against us arising from
any such loss or corruption of such data.
ELECTRONIC COMMUNICATIONS, TRANSACTIONS, AND SIGNATURES
Visiting the Site, sending us emails, and completing online forms constitute electronic
communications. You consent to receive electronic communications, and you agree that all
agreements, notices, disclosures, and other communications we provide to you electronically, via
email and on the Site, satisfy any legal requirement that such communication be in writing. YOU
HEREBY AGREE TO THE USE OF ELECTRONIC SIGNATURES, CONTRACTS, ORDERS, AND OTHER RECORDS, AND TO
ELECTRONIC DELIVERY OF NOTICES, POLICIES, AND RECORDS OF TRANSACTIONS INITIATED OR COMPLETED BY
US OR VIA THE SITE. You hereby waive any rights or requirements under any statutes, regulations,
rules, ordinances, or other laws in any jurisdiction which require an original signature or
delivery or retention of non-electronic records, or to payments or the granting of credits by
any means other than electronic means.
CALIFORNIA USERS AND RESIDENTS
If any complaint with us is not satisfactorily resolved, you can contact the Complaint
Assistance Unit of the Division of Consumer Services of the California Department of Consumer
Affairs in writing at 1625 North Market Blvd., Suite N 112, Sacramento, California 95834 or by
telephone at<PHONE_NUMBER> or<PHONE_NUMBER>.
MISCELLANEOUS
These Terms of Use and any policies or operating rules posted by us on the Site or in respect to
the Site constitute the entire agreement and understanding between you and us. Our failure to
exercise or enforce any right or provision of these Terms of Use shall not operate as a waiver
of such right or provision. These Terms of Use operate to the fullest extent permissible by law.
We may assign any or all of our rights and obligations to others at any time. We shall not be
responsible or liable for any loss, damage, delay, or failure to act caused by any cause beyond
our reasonable control. If any provision or part of a provision of these Terms of Use is
determined to be unlawful, void, or unenforceable, that provision or part of the provision is
deemed severable from these Terms of Use and does not affect the validity and enforceability of
any remaining provisions. There is no joint venture, partnership, employment or agency
relationship created between you and us as a result of these Terms of Use or use of the Site.
You agree that these Terms of Use will not be construed against us by virtue of having drafted
them. You hereby waive any and all defenses you may have based on the electronic form of these
Terms of Use and the lack of signing by the parties hereto to execute these Terms of Use.
CONTACT US
In order to resolve a complaint regarding the Site or to receive further information regarding
use of the Site, please contact us at:
Mey's Aquatics
P.O. Box 1501
Bear, DE 19701
United States
meysaquatics@gmail.com


--- layout: article title: "Exception Generating New Chunk" last_updated: ---
Errors while loading certain chunks can be caused by a wide variety of issues.
In order to help narrow the issue down, see the following cases below.
Note: This issue will be resolved in future version 1.8 and is resolved in 14w02c.
If you are encountering this error, please try the following:
Mojira issue: MC-44380
Note: This issue will be resolved in future version 1.8 and is resolved in 14w02c and 14w03a.
This error can be caused by having chunks that are 'corrupted' and require repair.
You can, however try the following to manually repair your world:
Mojira issue: MC-44824