Text: Advanced text-to-speech models such as FastSpeech can synthesize speech significantly faster
than previous autoregressive models with comparable quality. The training of FastSpeech model relies on an
autoregressive teacher model for duration prediction and knowledge distillation , which can ease the one-to-many
mapping problem in TTS. However, FastSpeech has several disadvantages: 1) the teacher-student distillation
pipeline is complicated, 2) the duration extracted from the teacher model is not accurate enough, and the target
mel-spectrograms distilled from teacher model suffer from information loss due to data simplification, both of
which limit the voice quality. In this paper, we propose FastSpeech 2, which addresses the issues in FastSpeech
and better solves the one-to-many mapping problem in TTS by 1) directly training the model with ground-truth
target instead of the simplified output from teacher, and 2) introducing more variation information of speech as
conditional inputs. Specifically, we extract duration, pitch and energy from speech waveform and directly take
them as conditional inputs during training and use predicted values during inference. We further design FastSpeech
2s, which is the first attempt to directly generate speech waveform from text in parallel, enjoying the benefit of
full end-to-end training and even faster inference than FastSpeech. Experimental results show that 1) FastSpeech 2
and 2s outperform FastSpeech in voice quality with much simplified training pipeline and reduced training time; 2)
FastSpeech 2 and 2s can match the voice quality of autoregressive models while enjoying much faster inference
speed.
LJ042-0094 (Ground-Truth)
LJ042-0094 (Synthesized)
Text: the soviet authorities denied oswald permission
LJ021-0108 (Ground-Truth)
LJ021-0108 (Synthesized)
Text: from the standpoint of the good of the industries themselves, as well as the general public
interest,
LJ030-0031 (Ground-Truth)
LJ030-0031 (Synthesized)
Text: secret service agents formed a cordon to keep the press and photographers from impeding their
passage and scanned the
crowd for threatening movements.
LJ001-0012 (Ground-Truth)
LJ001-0012 (Synthesized)
Text: especially as no more time is occupied, or cost incurred, in casting, setting, or printing
beautiful letters
LJ011-0202 (Ground-Truth)
LJ011-0202 (Synthesized)
Text: the uncle claimed her. the husband resisted.
LJ006-0114 (Ground-Truth)
LJ006-0114 (Synthesized)
Text: they bought their offices from one another, and were thus considered to have a vested interest
in them.
LJ009-0038 (Ground-Truth)
LJ009-0038 (Synthesized)
Text: in the center of the chapel was the condemned pew, a large dock-like erection painted
black.
LJ006-0161 (Ground-Truth)
LJ006-0161 (Synthesized)
Text: again, a turnkey deposed that his chief did not enter the wards more than once a fortnight.
LJ027-0127 (Ground-Truth)
LJ027-0127 (Synthesized)
Text: while neglecting to maintain his unity of ideal in the case of nearly all the numerous species
of snakes, he should have
added a tiny rudiment in the case of the python
LJ050-0158 (Ground-Truth)
LJ050-0158 (Synthesized)
Text: the department hopes to design a practical system which will fully meet the needs of the
protective research section of
the secret service.
Text: his mother, however, was a little shy of the company for him, and besides she could not always
spare him.
2299_6524_000057_000000 (Ground-Truth)
2299_6524_000057_000000 (Synthesized)
Speaker: 2299
Text: on the arrival at the hut to my chagrin we found it filled with snow.
2388_153731_000003_000000 (Ground-Truth)
2388_153731_000003_000000 (Synthesized)
Speaker: 2388
Text: the story of the first scientific observation of the corona and the prominences is thrillingly
interesting, and in fact dramatic.
3615_14677_000014_000000 (Ground-Truth)
3615_14677_000014_000000 (Synthesized)
Speaker: 3615
Text: beat three eggs with a pinch of salt; add one pint of milk and two thirds of a cup of
flour.
4744_31668_000003_000001 (Ground-Truth)
4744_31668_000003_000001 (Synthesized)
Speaker: 4744
Text: far from morbid naturally, she did her best to deny the thought, and so simple and unartificial
was her type of mind that for weeks together she would wholly lose it.
480_127525_000006_000000 (Ground-Truth)
480_127525_000006_000000 (Synthesized)
Speaker: 480
Text: i tried and found by experiment that the tide kept sweeping us westward until i had laid her
head due east, or just about right angles to the way we ought to go.
5126_27504_000011_000003 (Ground-Truth)
5126_27504_000011_000003 (Synthesized)
Speaker: 5126
Text: it looked as if our luck was dead out, and we began to think our chance of getting across the
border to queensland, and clear out of the colony that way, looked worse every day.
6098_57837_000008_000000 (Ground-Truth)
6098_57837_000008_000000 (Synthesized)
Speaker: 6098
Text: word was sent of their predicament to the nearest fort, and lieutenant pershing was sent with a
small detachment to their rescue.
6544_231862_000065_000001 (Ground-Truth)
6544_231862_000065_000001 (Synthesized)
Speaker: 6544
Text: denzil did look, and uttered a second cry more startling than the first.
968_122545_000053_000000 (Ground-Truth)
968_122545_000053_000000 (Synthesized)
Speaker: 968
Text: the bee fought the window angrily, up and down, up and down, for several minutes; then found the
open glass and whirled
out into the sunshine, joyfully.


Definition of a class for implementing a USB device CDC EEM function. More...
#include <stdint.h>
#include <USBRequests.h>
#include <CDCRequests.h>
#include <CDCNotifications.h>
#include "USBD.h"
#include <USBDDriver.h>
Go to the source code of this file.
Classes | |
| struct | _CDCDEEMPort |
| Struct for USB CDC EEM port function. More... | |
Macros | |
| #define | CDCDEEMPort_INTERRUPT_MAXPACKETSIZE 8 |
| Default CDC interrupt endpoints max packat size (8). More... | |
| #define | CDCDEEMPort_INTERRUPT_INTERVAL_HS 8 |
| Default CDC interrupt endpoint polling rate of High Speed (16ms). More... | |
| #define | CDCDEEMPort_INTERRUPT_INTERVAL_FS 16 |
| Default CDC interrupt endpoint polling rate of Full Speed (16ms). More... | |
| #define | CDCDEEMPort_BULK_MAXPACKETSIZE_HS 512 |
| Default CDC bulk endpoints max packat size (512, for HS actually). More... | |
| #define | CDCDEEMPort_BULK_MAXPACKETSIZE_FS 64 |
| Default CDC bulk endpoints max packat size (64, for FS actually). More... | |
Typedefs | |
| typedef struct _CDCDEEMPort | CDCDEEMPort |
| Struct for USB CDC EEM port function. More... | |
Functions | |
| void | CDCDEEMPort_Initialize (CDCDEEMPort *pCdcd, USBDDriver *pUsbd, uint8_t firstInterface, uint8_t numInterface) |
| Initializes the USB Device CDC serial port function. More... | |
| USBGenericDescriptor * | CDCDEEMPort_ParseInterfaces (CDCDEEMPort *pCdcd, USBGenericDescriptor *pDescriptors, uint32_t dwLength) |
| Parse CDC EEM Port information for CDCDEEMPort instance. More... | |
| uint32_t | CDCDEEMPort_RequestHandler (CDCDEEMPort *pCdcd, const USBGenericRequest *request) |
| Handles CDC-specific SETUP requests. More... | |
| uint32_t | CDCDEEMPort_Write (const CDCDEEMPort *pCdcd, void *pData, uint32_t dwSize, TransferCallback fCallback, void *pArg) |
| Sends a data buffer through the virtual COM port created by the CDC device serial driver. More... | |
| uint32_t | CDCDEEMPort_Read (const CDCDEEMPort *pCdcd, void *pData, uint32_t dwSize, TransferCallback fCallback, void *pArg) |
| Receives data from the host through the virtual COM port created by the CDC device serial driver. More... | |
Definition of a class for implementing a USB device CDC EEM function.


Hello! What residence halls are you looking at today?
Cary Quadrangle
Earhart Hall
Harrison Hall
Hillenbrand Hall
Honors College and Residences
McCutcheon Hall
Owen Hall
Shreve Hall
Tarkington Hall
Wiley Hall
GO


This extension needs a unit test. For now, run it as indicated at the end of this assignment.
So it turns out that numbers can feel things. We define a happy or sad number through this process:
For example, starting with the number 15, our process yields:
- 12 + 52 = 26
- 22 + 62 = 40
- 42 + 02 = 16
- 12 + 62 = 37
- 32 + 72 = 58
Here you can see our number has fallen into the beginning stages of depression...
In this extension you will be designing a program that uses sets to find the sad cycle of a number for an arbitrary power.
In the sadcycle package of your extensions folder, create a SadCycler class.
A long is simply twice as long as an int. I recommend using it here because some of the numbers found in higher base-sad cycles can be quite large.
I highly recommend partitioning the splitting of digits, raising to the power of base, and summing into one method. The trick here is figuring out how to treat every digit in a number as its own entity.
When you done with this extension, you must be cleared by the TA to receive credit.
- Commit all your work to your repository
- Fill in the form below with the relevant information
- Have a TA check your work
- The TA should check your work and then fill in his or her name
- Click OK while the TA watches
- If you request propagation, it does not happen immediately, but should be posted in the next day or so
This demo box is for extension 8.1
Issues: Working on it, stay tuned
The Sharpe ratio is a measure for calculating risk-adjusted return. It was developed by Nobel laureate William F. Sharpe.
Suppose you are considering investing a given amount of money in one of two possible ways:
The Sharpe ratio is calculated with this formula:
RKC need pictureTo calculate average rate of return of x, just add up all the provided returns for each individual stock and divide by the number of stocks.
Assume that for this portfolio, the risk free rate or Rf is 2%.
The portfolio standard deviation can be calculated using this formula:
RKC Do exponentiation using this Stddev = [ (wgt1 ^2 * s1 ^2) + (wgt2 ^2 * s2 ^ 2) + (2 * w1 * w2 * cov12) ] ^ .5where
- wgt1 is the weight of asset 1
- wgt2 is the weight of asset 2
- s1 is the standard deviation of asset 1
- s2 is the standard deviation of asset 2
- cov12 is the covariant of assets 1 and 2
For the purposes of this extension, assume that all the stocks have no correlation with each other and are weighted equally. This means that the covariance between any two stocks is 0 and that the weight of each stock is simply 1/n where n is the number of stocks.
Now that you understand what the Sharpe ratio is, it is time to apply what you have learned.
Directions
Click on the extensions folder and create a new class called CalculateSharpeRatio in the sharperatio package.
Set up the ArgsProcessor to take input from datafiles/stockaccount. This is where the data you will use to calculate the Sharpe ratio comes from.
You will have to create a List of doubles for both the expected returns and the variances in the main method.
After, write up a loop to read in the doubles for the expected returns and another loop for the standard deviations. Once your program has read in these values, you can start making your calculations for the Sharpe ratio.
Calculate the Sharpe ratio and round it to two decimal points then print it out.
When you done with this extension, you must be cleared by the TA to receive credit.
- Commit all your work to your repository
- Fill in the form below with the relevant information
- Have a TA check your work
- The TA should check your work and then fill in his or her name
- Click OK while the TA watches
- If you request propagation, it does not happen immediately, but should be posted in the next day or so
This demo box is for extension 8.2


Loading...
WebXR Physics
The purpose of this project is to provide a technical demonstration of the WebXR API and display its capabilities. Hopefully, it can be an example of how WebXR can be used to create an interactive VR experience within a web browser. The main focus is to act as a sort of virtual physics lab in an attempt to combine education and entertainment.
Our Team
- Alexis Ménard - Project Client
- Jonathan Jones
- Brooks Mikkelsen
- Brandon Mei
- Tim Forsyth
- Evan Brass
Available Experiments
- Planetary Diorama: View the motion of our solar system in 3d.
- Kinematic Sandbox: Understand how local gravity affects objects and manipulate physics.
- Pendulums: See how pendulums are affected by a different local gravity.
- Laser Reflections: Use mirrors to reflect a laser beam and see how it can bounce off of them.


A place for general developer talk – for everyone! | Documentation https://developers.komodoplatform.com | MoreDev Docs - https://docs.komodoplatform.com | Mastering CryptoConditions - https://github.com/KomodoPlatform/Mastering_CryptoConditions
100 messages
Before 05-Dec-19 12:00 AM
jl777c22-Mar-19 05:22 PM
i dont understand how this achieves trustlessness
zack22-Mar-19 05:22 PM
which user are we talking about here? Most people only sync their light node a couple times per week
jl777c22-Mar-19 05:22 PM
doesnt it just create a lot of forks? and do users have some tools to mark the state of the oracles they agree with?
let us ignore the lite nodes as they presumably have no voice
MyName22-Mar-19 05:22 PM
It seems like his issue is semantics and not with what the Komodo CC Oracle does
It seems to me that it's more of a feelz issue of competition to market and economics more than semantics
jl777c22-Mar-19 05:22 PM
so fullnodes
zack22-Mar-19 05:22 PM
The miners are incentivized to mine on the version of history where they can sell the tokens for a profit.
miners, exchanges, and channel hubs are basically the only full nodes in Amoveo
jl777c22-Mar-19 05:23 PM
how do the users tell their node to not follow the mainchain?
it sounds like the Toracles is cool when there are a few number of specific questions to be asked
zack22-Mar-19 05:24 PM
they could sync with either one github profile or another, depending on which version of consensus they want to use.
smk762 - dracocanis ominator22-Mar-19 05:24 PM
only native nodes mining or staking could chose the true chain. Each oracle would need to be a full node at minimum, though done have to min/stake, but if no one does, no new blocks means no forks, so that solves that.
MyName22-Mar-19 05:24 PM
The miners are incentivized to mine on the version of history where they can sell the tokens for a profit.
So, if I pay you more then my data is more "valid" than competing data that pays you less?
1
jl777c22-Mar-19 05:24 PM
that doesnt seem very practical
zack22-Mar-19 05:24 PM
what is more important is how much the users are paying for the different coins on each side of the fork.
The miners can only mine if they are paid enough rewards to cover the cost.
smk762 - dracocanis ominator22-Mar-19 05:24 PM
doesnt imply trust either
jl777c22-Mar-19 05:25 PM
it seems a lot of users need to be actively voting with their node for the Toracles to converge to reality
zack22-Mar-19 05:25 PM
the traders aren't running a full node, but their trades still have the biggest influence on the outcome of the fork
smk762 - dracocanis ominator22-Mar-19 05:25 PM
why would I agree with what is less profitable, regardless of truth?
2
zack22-Mar-19 05:25 PM
in Amoveo a oracleis an on-chain datastructure. like an account or a channel.(edited)
each person is expected to make the most profitable decisions for themselves in Amoveo. we don't assume anyone is altruistic.
jl777c22-Mar-19 05:26 PM
it seems easy to use mechanism for users to disagree with any specific oracle is needed, otherwise there is zero force pushing things toward the actual reality
so users can select from N forks, each with a displayed value of the various oracles states?
MyName22-Mar-19 05:26 PM
each person is expected to make the most profitable decisions for themselves in Amoveo. we don't assume anyone is altruistic.
You do see the ability for that to create manipulated data, right?
zack22-Mar-19 05:27 PM
Neither do we assume that they are not altruistic. It is a secure oracle mechanism.
jl777c22-Mar-19 05:27 PM
so it is trusting that people will pay more for the more true chain
smk762 - dracocanis ominator22-Mar-19 05:27 PM
better to disincentivize inaccurate data than to reward shared delusion
jl777c22-Mar-19 05:27 PM
but it seems there is not any convenient way to select the chain you agree with
zack22-Mar-19 05:27 PM
A basic assumption of Amoveo is that the version of history that is more accurate will have more valuable coins.

Both cannot be true, either it's "secure" or it's "up to the highest bidder"
smk762 - dracocanis ominator22-Mar-19 05:28 PM
can you trust an assumption?
zack22-Mar-19 05:28 PM
if that isn't true, then Amoveo might not work.
jl777c22-Mar-19 05:28 PM
does amoveo have forks all the time?
like all the time
it seems it would need to have competing forks pretty much all the time for there to be a chain with the more valuable coins
otherwise there is just one mainchain
zack22-Mar-19 05:29 PM
Every engineering solution makes some basic assumptions.
Bridge designers have assumptions about the maximum possible load, and the years until the bridge will be replaced.
Bitcoin's basic assumption is that it is always most profitable to mine on the top block.
MyName22-Mar-19 05:29 PM
If I say "grass is blue" and history says "grass is green", then what you describe dictates that I can pay miners to agree that "grass is blue"
zack22-Mar-19 05:29 PM
Amoveo hasn't forked yet
smk762 - dracocanis ominator22-Mar-19 05:29 PM
why not just resync onto the more lucrative chain?
zack22-Mar-19 05:29 PM
There is a balance of powers between traders, exchanges, miners, mining pools, and developers
FishyGuts22-Mar-19 05:29 PM
!kmdtip @zack 9.99
KMD TipBotBOT22-Mar-19 05:29 PM
TipBot
@FishyGuts (FishyGuts#5085)
You tipped @zack9.99 KMD
Alright22-Mar-19 05:30 PM
Can you give me some documentation on your oracles please
FishyGuts22-Mar-19 05:30 PM
!kmdtip @smk762 - dracocanis ominator 9.99
1
KMD TipBotBOT22-Mar-19 05:30 PM
TipBot
@FishyGuts (FishyGuts#5085)
You tipped @smk762 - dracocanis ominator9.99 KMD
FishyGuts22-Mar-19 05:30 PM
!kmdtip @MyName 9.99
KMD TipBotBOT22-Mar-19 05:30 PM
TipBot
@FishyGuts (FishyGuts#5085)
You tipped @MyName9.99 KMD
A blockchain for trust-free markets in financial derivatives - zack-bitcoin/amoveo
jl777c22-Mar-19 05:30 PM
but traders dont seem to know (or care) about what fork has what oracles state. I am confused how there is any reinforcement of the truth
zack22-Mar-19 05:31 PM
what traders are you talking about?
People gambling in the channels before we know the outcome, or people reporting to the on-chain oracle after we know the outcome?
MyName22-Mar-19 05:31 PM
ty @FishyGuts
jl777c22-Mar-19 05:31 PM
maybe theoretically it does, but the current implementation doesnt seem to have all the required things
zack22-Mar-19 05:31 PM
oh, you mean btc/veo traders
FishyGuts22-Mar-19 05:31 PM
These conversations are what I long for in the ecosystem. Thank you guys for having this discussion of minds.
smk762 - dracocanis ominator22-Mar-19 05:31 PM
what does bad question mean?
zack22-Mar-19 05:31 PM
the oracle mechanism has an on-chain tool for moving your money back and forth between each side of the fork
jl777c22-Mar-19 05:32 PM
but you said there hasnt been any forks
Alright22-Mar-19 05:32 PM
Have you heard the good word of cryptoconditions?
1
2
jl777c22-Mar-19 05:32 PM
so there is nothing to choose between
zack22-Mar-19 05:32 PM
right, the nash equilibrium is for one side of the fork to quickly go to zero value and die.
In most cases, it is a fork of 0 blocks long.
jl777c22-Mar-19 05:33 PM
how do the miners know the right state for all the oracles?
MyName22-Mar-19 05:33 PM
really wants to be in "jam/fold" mode every time you type that
zack22-Mar-19 05:33 PM
Before the oracle resolves, you can use it to make a bet.
If the blockchain does fork, then you would win the bet on one side, and lose on the other.
This allows us to move the money between the forks.
jl777c22-Mar-19 05:33 PM
so you have had such forks?
zack22-Mar-19 05:34 PM
we have had contentious oracles, but none resulted in a fork
smk762 - dracocanis ominator22-Mar-19 05:34 PM
so its the miners that lose out for being"wrong"? are all miners oracles?
jl777c22-Mar-19 05:34 PM
how can the miners know the right state for the oracle?
zack22-Mar-19 05:34 PM
the miners just process txs, they don't have to think about oracles generally.
smk762 - dracocanis ominator22-Mar-19 05:34 PM
but what if they end up on wrong chain?
MyName22-Mar-19 05:35 PM
In most cases, it is a fork of 0 blocks long.
Meaning a race situation with an orphan?
smk762 - dracocanis ominator22-Mar-19 05:35 PM
passive investor is never on wrong chain?
zack22-Mar-19 05:35 PM
if an oracle is about to lie, I would release a hard update and tell the miners about it, and they would verify the lie is coming and do the update to make sure that their mining pool will not follow the lying version
smk762 - dracocanis ominator22-Mar-19 05:35 PM
so why mine instaed of buy?
jl777c22-Mar-19 05:35 PM
a hard update? you mean hardfork?
who is policing all the oracles?
polycryptoblog22-Mar-19 05:36 PM
Seems only practical for events where you have enough time to do so
jl777c22-Mar-19 05:36 PM
so everyone is trusting you to be the policeman for all the oracles?
2
3
2
siu - Chainmakers22-Mar-19 05:36 PM
how do you know a oracle is about to "lie"?
zack22-Mar-19 05:36 PM
it would just prevent the mining pool from accepting any block that closes the oracle in a state we have agreed is lying.
jl777c22-Mar-19 05:36 PM
so there is manual intervention?
smk762 - dracocanis ominator22-Mar-19 05:36 PM
I'm just trying to figure out who gets puniched, who doesnt and what thier incentives for participation are
zack22-Mar-19 05:36 PM
The people who bet in an oracle would notice that it is going to lie, and alert me
jl777c22-Mar-19 05:36 PM
with blockchains isnt it assumed that it runs autimatically?
without needing manual oversight?
MyName22-Mar-19 05:36 PM
if an oracle is about to lie, I would release a hard update and tell the miners about it
How is that "trustless" if you get to decide what's a "lie" and what isn't?(edited)
smk762 - dracocanis ominator22-Mar-19 05:36 PM
cant trust a lying oracle
siu - Chainmakers22-Mar-19 05:36 PM
what if you die?
zack22-Mar-19 05:36 PM
no one is going to waste so much money to make us actually have to do this manual intervention.
siu - Chainmakers22-Mar-19 05:37 PM
lies everywhere with no policeman around?
polycryptoblog22-Mar-19 05:37 PM
Don’t be so sure
zack22-Mar-19 05:37 PM
this is the theoretical scenario where someone wastes hundreds of thousands of dollars to test the limits of Amoveo
It would be a wonderful day, since those hundreds of thousands of dollars would be distributed among everyone who participated in defending the truth of the oracle.
jl777c22-Mar-19 05:37 PM
why would it cost so much
polycryptoblog22-Mar-19 05:37 PM
If it is successful, wouldn’t a competitor be incentivized to mess with you(edited)
zack22-Mar-19 05:37 PM
if you make a bet on an obvious lie, other will come to bet against you to take your money.
so you have to bet quite a lot until everyone else runs out of money
Am an honored that you all have such an interest in Amoveo's oracle
smk762 - dracocanis ominator22-Mar-19 05:38 PM
I'm still tryna figure out how a non mining better loses more than aniner on the wrong chain


If you have an existing key set, this action will save over it.
ex: https://github.com/yourname/project.git OR ssh://github.com/yourname/project.git You can find this link on the right side of the repo in a box that says 'https clone url'.


You are viewing an historical archive of past issues. Please
report new issues to the appropriate project issue tracker on
GitHub.
Comments
-
Greg Hurrell
Status changed:
- From: new
- To: open
-
Greg Hurrell
rc3 is a lemon, so wait for rc4 instead:
-
Greg Hurrell
Summary changed:
- From: Trial Rails 3.0.8.rc3
- To: Trial Rails 3.0.8.rc4
-
Greg Hurrell
Summary changed:
- From: Trial Rails 3.0.8.rc4
- To: Update to Rails 3.0.8, and Rails 3.1.0.rc2
-
Greg Hurrell
3.0.8 final is now out, with a security fix. 3.1.0.rc2 is also out, containing the same fix.
# Potential XSS Vulnerability in Ruby on Rails Applications The XSS prevention support in recent versions Ruby on Rails allows some string operations which, when combined with user supplied data, may leave an 'unsafe string' incorrectly considered safe. It is unlikely that applications call these methods, however we are shipping new versions today which prevent their use to ensure they're not called unintentionally. ## How the XSS Prevention Works When strings are rendered to the client, if the string is not marked as "html safe", the string will be automatically escaped and marked as "html safe". Some helper methods automatically return strings already marked as safe. For example: <%= link_to('hello world', @user) %> The `link_to` method will return a string marked as html safe. Since `link_to` returns an "html safe" string (also known as a safe buffer), the text will be output directly, meaning the user sees a link tag rather than escaped HTML. ## The Problem Safe buffers are allowed to be mutated in place via methods like `sub!`. These methods can add unsafe strings to a safe buffer, and the safe buffer will continue to be marked safe. An example problem would be something like this: <%= link_to('hello world', @user).sub!(/hello/, params[:xss]) %> In the above example, an untrusted string (`params[:xss]`) is added to the safe buffer returned by `link_to`, and the untrusted content is successfully sent to the client without being escaped. To prevent this from happening `sub!` and other similar methods will now raise an exception when they are called on a safe buffer. In addition to the in-place versions, some of the versions of these methods which return a copy of the string will incorrectly mark strings as safe. For example: <%= link_to('hello world', @user).sub(/hello/, params[:xss]) %> The new versions will now ensure that *all* strings returned by these methods on safe buffers are marked unsafe. ## Affected versions This problem affects all versions of rails: 3.1.0.rc1, 3.0.7, and 2.3.11. ## The Solution Any methods that mutate the safe buffer without escaping input will now raise an exception. If you need to modify a safe buffer, cast it to a Ruby string first by calling the `to_str` method: <%= link_to('hello world', @user).to_str.sub!(/hello/, params[:xss]) %> ## Upgrading This problem is fixed in Rails 3.1.0.rc2, 3.0.8, and 2.3.12 (with rails_xss) (which will be released in the next hour). If for some reason you cannot upgrade your Rails installation, please apply these patches (also find them attached): * [For 3.1.0.rc1](https://gist.github.com/89d6266cc7875614c5a5) * [For 3.0.7](https://gist.github.com/b2ceb626fc2bcdfe497f) * [For 2.3.11, specifically the rails_xss plugin](https://gist.github.com/392235903426322e0414) ## Thanks Thanks to Bruno Michel of LinuxFr.org and Brett Valantine who each independently reported the issue to us.
-
Greg Hurrell
Summary changed:
- From: Update to Rails 3.0.8, and Rails 3.1.0.rc2
- To: Update to Rails 3.0.8, and Rails 3.1.0.rc3
-
Greg Hurrell
Summary changed:
- From: Update to Rails 3.0.8, and Rails 3.1.0.rc3
- To: Update to Rails 3.0.9.rc1, and Rails 3.1.0.rc3
-
Greg Hurrell
- Rails 3.1.0.rc3 announcement: http://weblog.rubyonrails.org/2011/6/8/ann-rails-3-1-0-rc3-has-been-released
- Rails 3.1.0.rc2 announcement: http://weblog.rubyonrails.org/2011/6/8/ann-rails-3-1-0-rc2-has-been-released
- Rails 3.0.9.rc1 announcement: http://weblog.rubyonrails.org/2011/6/8/ann-rails-3-0-9-rc1-has-been-released
- Rails 3.0.8 announcement: http://weblog.rubyonrails.org/2011/6/8/ann-rails-3-0-8-has-been-released
-
Greg Hurrell
Tried 'em out, but time to try out some more:
- Rails 3.1.0.rc4 release announcement: http://weblog.rubyonrails.org/2011/6/9/ann-rails-3-1-0-rc4-has-been-released
- Rails 3.0.9.rc3 release announcement: http://weblog.rubyonrails.org/2011/6/9/ann-rails-3-0-9-rc3-has-been-released
-
Greg Hurrell
Summary changed:
- From: Update to Rails 3.0.9.rc1, and Rails 3.1.0.rc3
- To: Update to Rails 3.0.9.rc3, and Rails 3.1.0.rc4
-
Greg Hurrell
Summary changed:
- From: Update to Rails 3.0.9.rc3, and Rails 3.1.0.rc4
- To: Update to Rails 3.0.9.rc5, and Rails 3.1.0.rc4
-
Greg Hurrell
Summary changed:
- From: Update to Rails 3.0.9.rc5, and Rails 3.1.0.rc4
- To: Update to Rails 3.0.9, and Rails 3.1.0.rc4
-
Greg Hurrell
http://weblog.rubyonrails.org/2011/6/16/ann-rails-3-0-9-has-been-released
-
Greg Hurrell
Superseded by ticket #1861.
-
Greg Hurrell
Status changed:
- From: open
- To: closed
Add a comment
Comments are now closed for this issue.


iGoogoo
Homepage Blog
These prouduct shows info and fact about the company
Acknowledge
Contributors
- Taisiia Belova
- Helped with the page, visit her web site for more info HERE
- Noel Moser
- Served as inspiration, visit his site for more info HERE
Still Could Do
-
Neatnes -- We could make our webpage nicer and cleaner, and more inviting for people who want to know more about us.
-
Add an interactive menu -- We could make an interactive menu that would lead the users to all of our links.
Technology
We made a functional website.
- HTML
- HTML is the standard markup language for making websites. HTML stands for Hyper Text Markup Language. We used HTML elements to make this website.
- Git
- Github is the platform where we made this webpage
- Workflow
- Workflow is an easy way to organize your tasks and know what are your team mates are working on.
Back To Main Page
Our Twitter


What is your experience of compassionate (or not) leadership?
I personally have never been a strong leader - but I have most definitely come across a few compassionate leaders. There was a girl who I went to high school who ended up getting head girl in our last year of school because she was a compassionate leader and deserved it. She wasn't just any ordinary leader - she didn't have favourites and she was friends with absolutely everyone, and no one ever said a bad word about her. She was an academic and an athlete, religious and musical. She had it all, but she was always so incredibly humble and lead our year group better than anyone could imagine, she always put everyone else first and no matter how busy she was she would still take time out to help others. To me, that is what I consider a compassionate leader.
Do the multiplying goodness meditation. How did you find it?
I found it super uplifiting and instantantiously made me feel more positive although it wasn't exactly realistic because sometimes when you are down its hard to just switch to being positive. I will definitely try this when I am feeling down or stressed.
Do the Tonglen meditation. How did you find it?
I personally think this was more realistic than the Goodness meditation because it lets you accept your struggles and look at them from the outside, then allows us to transform them into positivity. I like being able to accept my struggles rather than pretend they dont exist.
How does the SCARF model apply to your Phase 0 experience so far? How will it apply to bootcamp?
I think it is really applying to my experience well, in all aspects I feel like I have so much support, and certainty I think that it will really slot in well with bootcamp when we are all in the same position and needing to support each other.
Have a difficult conversation. How did it go? (It's a valuable skill, but can take practice to develop!)
I am the eldest child in my family, I have 2 younger siblings. For those that know what its like to be an eldest child I think they will know it comes with alot of responsibility. I have a puppy who can't come with me when I move to AKL for Bootcamp and I will be leaving lots of responsibilities behind when I move away. for me that was a difficult conversation to have with my sister because she will be in a position where she needs to step up and take on the responisbilities I will be leaving behind. I have total faith in her but I did feel alot of guilt. I am slowly learning how to cope in difficult conversations and how to approach them.


T
- the generic type the accumulator will be used onpublic interface Accumulator<T>
Accumultator interface is used to accumulate command line arguments as composite option value. The interface allows custom processing to be done when a new value is to be assigned to an option. For example, when the value type is a collection, instead of overriding the option value with a new collection with a single value, the accumulator can check if a collection container already exists and simply append the new value to the existing collection. Similarly with arrays, accumulators are used to reallocated arrays so that a new value can fit, etc.
Accumulator interface is used with the TypeRegistry
and
TypeMapper
interfaces. Default accumulators are registered for array
and collection types, when automatic mapping is performed. However, any
mapping can be overriden including different or no accumulators for each
type.
| Modifier and Type | Method and Description |
|---|---|
default T |
accumulate(T newValue)
Accumulate on a new value only
|
T |
accumulate(T oldValue,
T newValue)
Perform the accumulate computation
|
static <T> Accumulator<T> |
array()
Default accumulator for all array types
|
static <T extends java.util.Collection<?>> |
collections()
Default accumulator for all collection types.
|
static <T> Accumulator<T> |
identity()
Identity.
|
static <T> Accumulator<T> identity()
T
- the generic typestatic <T extends java.util.Collection<?>> Accumulator<T> collections()
T
- the generic typestatic <T> Accumulator<T> array()
T
- the generic typeT accumulate(T oldValue, T newValue)
oldValue
- previous accumulator valuenewValue
- new accumulator value


{% include 'pages/_back-to-course.navbar.html' %}
00:14
An angular 2 project written in typescript is* transpiled to javascript duri*ng the build process. Which of the following additional features are provided to the developer while programming on typescript over javascript?
Note: There can be multiple correct answers to this question.


{% extends "email_base.html" %} {% block content %}
You have successfully created a new ticket: {{ number }}
{{ ticket.content }}


Currently, there are two types of documenation available.
| Type | Description |
|---|---|
| API documentation |
There isn't property an API for this project as it's ultimately just an executable. But there are quite a lot of details about the individual parts that go into making this project.
The "contents" for the API is a little unusual since this isn't a library. The API is
for the file that will contain the |
| 6581 audio graphs | The 6581 Sound Interface Device is tricky to test since the waveforms it produces are so complex. While proper unit testing is done on the outputs of the waveform and envelope generators, the rest is "tested" by producing graphs of the audio output and figuring out if it looks right. Those graphs are all available here. |


Make sure your port settings are configured correctly for firewalls.
There are several different port settings that need to be considered when using firewalls:
Port that the cache server listens on. This is configurable using the
cache-server
element in cache.xml, on the CacheServer class in Java APIs, and as a command line option to thegfsh start server
command.By default, if not otherwise specified, Geode clients and servers discover each other on a pre-defined port (40404) on the localhost.
Locator port. Geode clients can use the locator to automatically discover cache servers. The locator port is configurable as a command-line option to the
gfsh start locator
command. Locators are used in the peer-to-peer cache deployments to discover other processes. They can be used by clients to locate servers as an alternative to configuring clients with a collection of server addresses and ports.By default, if not otherwise specified, Geode locators use the default port 10334.
Since locators start up the distributed system, locators must also have their ephemeral port range and TCP port accessible to other members through the firewall.
For clients, you configure the client to connect to servers using the client’s pool configuration. The client’s pool configuration has two options: you can create a pool with either a list of server elements or a list of locator elements. For each element, you specify the host and port. The ports specified must be made accessible through your firewall.
Limiting Ephemeral Ports for Peer-to-Peer Membership
By default, Geode assigns ephemeral ports, that is, temporary ports assigned from a designated range, which can encompass a large number of possible ports. When a firewall is present, the ephemeral port range usually must be limited to a much smaller number, for example six. If you are configuring P2P communications through a firewall, you must also set the TCP port for each process and ensure that UDP traffic is allowed through the firewall.
Properties for Firewall and Port Configuration
This table contains properties potentially involved in firewall behavior, with a brief description of each property.
| Configuration area | Property or Setting | Definition |
|---|---|---|
| peer-to-peer config |
|
Specifies whether sockets are shared by the system member’s threads. |
| peer-to-peer config |
|
The list of locators used by system members. The list must be configured consistently for every member of the distributed system. |
| peer-to-peer config |
|
Address used to discover other members of the distributed system. Only used if mcast-port is non-zero. This attribute must be consistent across the distributed system. |
| peer-to-peer config |
|
Port used, along with the mcast-address, for multicast communication with other members of the distributed system. If zero, multicast is disabled for data distribution. |
| peer-to-peer config |
|
The range of ephemeral ports available for unicast UDP messaging and for TCP failure detection in the peer-to-peer distributed system. |
| peer-to-peer config |
|
The TCP port to listen on for cache communications. |
| Configuration Area | Property or Setting | Definition |
|---|---|---|
| cache server config |
|
Hostname or IP address to pass to the client as the location where the server is listening. |
| cache server config |
|
Maximum number of client connections for the server. When the maximum is reached, the server refuses additional client connections. |
| cache server config |
|
Port that the server listens on for client communication. |
Default Port Configurations
Port Name |
Related Configuration Setting | Default Port |
|---|---|---|
Cache Server |
|
40404 |
HTTP |
http-service-port |
7070 |
Locator |
start-locator (for embedded locators) or --port parameter to the gfsh start locator command. |
if not specified upon startup or in the start-locator property, uses default port 10334 |
Membership Port Range |
membership-port-range |
1024 to 65535 |
Memcached Port |
memcached-port |
not set |
Multicast |
mcast-port |
10334 |
RMI |
jmx-manager-port |
1099 |
TCP |
tcp-port |
ephemeral port |
Properties for Firewall and Port Configuration in Multi-Site (WAN) Configurations
Each gateway receiver uses a single port to accept connections from gateway senders in other systems. The configuration of a gateway receiver specifies a range of possible port values to use. Geode selects an available port from the specified range when the gateway receiver starts. Configure your firewall so that the full range of possible port values is accessible by gateway senders from across the WAN.
| Configuration Area | Property or Setting | Definition |
|---|---|---|
| multi-site (WAN) config for gateway sender | hostname-for-senders | Hostname or IP address of the gateway receiver used by gateway senders to connect. |
| multi-site (WAN) config for locator | remote-locators | List of locators (and their ports) that are available on the remote WAN site. |
| multi-site (WAN) config for gateway receiver | start-port and end-port (cache.xml) or --start-port and --end-port parameters to the gfsh start gateway receiver command |
Port range that the gateway receiver can use to listen for gateway sender communication. |


--- title: Barks, Buds, and Berries of Winter date: 2015-01-05 00:00:00 -06:00 categories: - whats-blooming layout: post blog-banner: whats-blooming-now-winter.jpg post-date: January 5, 2015 post-time: 12:04 PM blog-image: wbn-default.jpg ---
Variegated Tatarian Dogwood Cornus alba 'Gouchaultii'
This shrub is well known for it's deep red bark that creates a lovely contrast with the ice and snow of winter. The lower waterfall near the Rose Garden is a must see during your visit.
Seven Son Flower Heptacodium miconioides
Attractive, shedding bark reveals yellow and orange hues along the body of this tree.
Gambel Oak Quercus gambelii
The bright orange and yellow lichens that coat the bark of many of our native oaks are on full display during winter.
Leonard Messel Magnolia Magnolia x loebneri 'Leonard Messel'
An abundance of buds donned with shimmering, white hairs shine in the winter sun atop this stunning magnolia just outside of the Visitor Center.
Yulan Magnolia Magnolia denudata
Last years alien-looking fruits provide inspiration for next years buds on this whimsical tree.
Korean Mountain Ash Sorbus alnifolia
The pinkish fruits that decorate this tree in winter often persist into spring.
Pat Austin ® Rosa 'AUSmum'
Large, ruddy hips stand tall atop sharply thorned stems amongst leaves that persist into winter.
Coralberry Symphoricarpos orbiculatus 'Follis Variegatus'
The berries of this low shrub start the fall a dark pink and develop a deep burgundy color through winter.
Break free from the siren song of home and hearth and enjoy a wonderfully brisk and bright walk through our winter wonderland of oft-hidden winter delights. If you visit soon there is the added bonus of viewing some of the ephemeral sculptural snow drifts that the recent winds have created throughout the Garden.


EPA researchers participate in educational outreach to schools, museums and other locations to teach children about air quality and climate change research. As part of the outreach, researchers have developed several hands-on activities for teachers, including a particulate matter (PM) sensor kit that can be built by students.
You will need Adobe Reader to view some of the files on this page. See EPA’s About PDF page to learn more.- Building your own particle sensor (PDF)(19 pp, 3 MB)


|
lubyk
0.5
|
#include <lua_object.h>
Inherited by lk::Finalizer, lk::Socket, lubyk::ThreadedLuaObject, mdns::Browser, mdns::Registration, midi::In, mimas::GroupBox, mimas::Label, mimas::VBoxLayout, wii::Browser, wii::Remote, and zmq::Socket.
Public Member Functions | |
| LuaObject () throw () | |
| int | luaInit (lua_State *L, void *ptr, const char *type_name) throw () |
| virtual | ~LuaObject () |
| void | luaDestroy () |
Public Attributes | |
| lubyk::Worker * | worker_ |
Protected Member Functions | |
| void | luaCleanup () |
| void | setupSuper (lua_State *L, void *ptr) throw () |
| void | setupMetatable (lua_State *L, const char *type_name) throw () |
Protected Attributes | |
| const char * | class_name_ |
Private Attributes | |
| void ** | userdata_ |
Calls a lua function back.
Definition at line 38 of file lua_object.h.
| lubyk::LuaObject::LuaObject | ( | ) | throw () |
Prepare tables to work with the table based self idion. expects stack to be: ... self if self (last argument) is a table, it is used as self. Otherwise, a new table is created. The method leaves "self" on top of the stack, with self.super = this.
| virtual lubyk::LuaObject::~LuaObject | ( | ) | [virtual] |
| void lubyk::LuaObject::luaCleanup | ( | ) | [protected] |
When using a custom destructor, this method must be called from within the custom destructor.
| void lubyk::LuaObject::luaDestroy | ( | ) |
Reimplemented in mimas::Slider.
| int lubyk::LuaObject::luaInit | ( | lua_State * | L, |
| void * | ptr, | ||
| const char * | type_name | ||
| ) | throw () |
Reimplemented in lubyk::ThreadedLuaObject, and lk::Finalizer.
Referenced by lk::Finalizer::luaInit().
| void lubyk::LuaObject::setupMetatable | ( | lua_State * | L, |
| const char * | type_name | ||
| ) | throw () [protected] |
| void lubyk::LuaObject::setupSuper | ( | lua_State * | L, |
| void * | ptr | ||
| ) | throw () [protected] |
const char* lubyk::LuaObject::class_name_ [protected] |
Definition at line 71 of file lua_object.h.
void** lubyk::LuaObject::userdata_ [private] |
This is used to invalidate the userdata in case the object is deleted out of Lua.
Definition at line 43 of file lua_object.h.
Definition at line 60 of file lua_object.h.


|
Max Iterations:
Amount of times to run
|
|||
|
Optimum Amplicon Size Range:
This will help pick primer pairs that will produce an amplicon in this size range
|
to | ||
|
Max Distance of Target from Primer:
Sets longest distance in reference to another primer
|
|||
|
Background Primers:
List of primer ID's that should be included
|
|
Similar Melting Temperatures:
Minimizes the variation in melting temperatures for primers in the set
|
||||
|
Primer Scores:
Minimizes the individual primer scores for primers in the set to favor high ranking primers
|
||||
|
Cross Dimerization:
Minimizes the number of cross interactions between all primers
|
||||
|
Amplicon Size:
Minimizes distance outside of range of optimal amplicon size
|
||||
|
Target Distance from Primer:
Minimizes distance of primer from target
|


Preparation time
less than 30 mins
Cooking time
over 2 hours
Serves
Makes 20-24
Dietary
To get perfectly fudgy, squishy brownies with minimal effort, pop the cake mixture into a slow-cooker - here's how.
Equipment and preparation: for this recipe you will need a slow cooker.
Line the base of a slow cooker with baking parchment.
Suspend a heatproof bowl over a pan of simmering water, making sure the base of the bowl does not touch the water. Add the chocolate and butter and stir until smooth and melted.
Remove the bowl from the heat, then beat in the sugar until well combined (it will look slightly lumpy, but don’t worry).
Beat in each egg, one at a time, until well combined, then stir in the vanilla extract and fold in the flour. Pour the brownie mixture into the slow cooker.
In the same bowl, mix the cream cheese with the condensed milk (it might look almost curdled, but again, don’t worry). Drop teaspoonfuls of the cream cheese mixture on top of the brownie mixture, one at a time, swirling each through the mixture using a skewer to create a marbled effect. (Don’t mix in the cream cheese completely.)
Put the lid onto the slow cooker and cook the brownies on a high heat for 2-2½ hours, testing them after 2 hours by inserting a skewer into the centre - if the skewer comes out clean, and the top of the brownies look cooked (see tip), the brownies are ready.
Lift the brownies out of the slow cooker using the paper lining to help you and transfer to a wire rack to cool. Do not try to peel the greaseproof paper from the brownies until they have completely cooled.
To serve, cut the brownies into 20-24 small squares. The brownies should be sticky and fudgy inside with crisp, chewy edges.


As a young and aspiring professional, my goals and ambitions are still developing.
When it comes to advertising and marketing, I love both agency and client side work, so I’m still figuring out what I want to do. One thing is for sure though. Through all my short term contracts and projects, I’ve learned that I want something more consistent and long term. Agency or client side, I hope I find that fit soon.


Competitive Equilibria Staking Lending
Transcript By: Bryan Bishop
Tags: Attacks, Proof of work
Category: Conference
Competitive equilibria between staking and on-chain lending
Tarun Chitra
https://twitter.com/kanzure/status/1230581977289379840
https://arxiv.org/pdf/2001.00919v1.pdf
See also “Stress testing decentralized finance” https://diyhpl.us/wiki/transcripts/coordination-of-decentralized-finance-workshop/2020-stanford/stress-testing-decentralized-finance/
Introduction
There have been some odd finanical attacks in the DeFi space and also on staking. This talk aims to show that the threat model for staking is definitively different from that of proof-of-work, and these financial attacks need to be part of the threat model.
Agenda
I’ll go over some high level overview of intuitive market dynamics, then we will build up an agent-based model that correctly goes across multiple participants to stress test staking situations, then we go through the various assumptions, and at a high-level I’ll give some formal probability statements without proofs, and finally I have simulation results to discuss which can give you some idea about how to design a monetary policy.
Overview
Proof-of-stake claims to have a similar security model to proof-of-work, but in a lot of ways the entire security of the network depends on the total quantity staked as well as the relative value of that staked asset. The relative value means you need to make sure there’s not alternative mechanism for yield outside of staking and fees.
On the other hand, on-chain lending allows token-denominated access to liquidity. The on-chain lending market grew from less than $10m in 2018 to roughly $1b today. It has grown significantly, as crypto lending in general has. The key to this is that you have purely on-chain access to non-censorable loans.
In some sense, the security of these proof-of-stake networks can be eroded by on-chain lending and incentives.
Gedanken and lending
Suppose you have a proof-of-stake asset securing a smart contract platform, with on-chain lending on top of this platform. The contract allows people to borrow and lend people at algorithmically determined interest rates. We assume that greater than 50% of users are rational, and we expect them to be utility maximizers. What happens when the interest rate from the lending contract is significantly greater than the staking rate? If you’re rational, then 50% of the users are going to move their stake and move into lending.
How could this happen? When the price of p crashes relative to a secured asset like dollars or bitcoin, the demand to short the asset will go up. When the demand to short goes up, borrowing interest rate goes up, and then lending interest rate goes up, and this leads to a deflationary spiral. This is the high-level idea. But would this actually happen- can this happen? As Bram pointed out, there’s been a number of attacks in the last week proving that there’s rational actors and when there’s enough money in the on-chain ecosystem then people will start taking advantage of it.
Why restrict to decentralized lending and not centralized…? The decentralization means you can’t really stop people from moving their stake and taking this yield. That’s the difference. Also, the fees for doing this attack should probably spike around the time it’s happening. While that’s true, it’s actually quite hard to predict miner and validator behavior with resspect to transaction fees. There was a paper that shows the strategy space is actually quite complicated and has a complex phase diagram.
Exchanges and validators won’t let this happen? Well at that point why not have the exchange run a database for you.
The other question is do rational actors exist- and the flash loan stuff in the past weeks has shown this. This is a bank run on the proof-of-stake network.
Proof-of-work
Why doesn’t this happen in proof-of-work? It’s secured by miner-extractable value which has been analyzed a variety of ways. There’s two components: the hashpower mining the block, and also the economics and fees of the proof-of-work asset. The components aren’t interoperable, you need an exoogenous asste like a hashrate derivative or an oracle to connect the proof-of-work asset to the hashrate directly. In proof-of-stake, that’s not true because the same asset is used to stake the network as for transaction fees. This is by design. In the first bitcointalk.org posts on proof-of-stake, the idea was to take a limit on constantly reinvested proof-of-work where you earn fees with virtualized hashrate. You can’t trustlessly lend proof-of-work security, but you can for proof-of-stake security.
Rational users
We can kind of go to models from finance to see how people model cascading failures and bank runs. The thought experiment reveals a secret: in some sense, rational actors are solving a portfolio allocation problem with staking. They are saying they have a portfolio of stake coins and there’s k ways to make yield, and some of those ways include staking, other ways might include lending, and other things like staking derivatives. A rational actor is constantly rebalancing their portfolio. Say everyone views a portfolio as staked assets and lent assets. We model agents as having different types of risk profiles.
When you’re very risky, one risk profile is to have a rebalance policy where the moment the interest rate spikes then you move all your assets immediately. A more risk adverse user of the system would maybe say oh okay look well if the interest rate in the lending contract is only 5% greater than the staking contract, then I will only move 5% of my assets.
One of the simplest ways of modeling reallocation is modern portfolio theory pioneered by Markowitz in 1953 (1963?). This is how ETFs portfolios rebalance and so on. It only requires two real inputs. One is the alphas- the expected returns over the next period, and the other is a covariance between the assets and the volatility of the assets themselves. You solve this problem by having a strictly convex function where the value x is the portfolio weight- it’s like a vector on the probabilities simplex, it tells you the proportion of each asset you hold, you solve a strongly convex problem given those two components and then you’re done.
We define rational staking agents to be those that optimize their actions based on risk preferences and rewards.
On-chain lending
I won’t go through the whole mechanism of how on-chain lending works and how they have stayed stable so far… Compound has about $250 million ,about 10% of BlockFi one of the main centralized lenders. From the perspective of a user, the way this works is that there’s a smart contract, the contract has a pool of assets, people who lend to that pool can earn interest on every block, and people who borrow- they collateralize a loan by locking up some ethereum, taking out some stablecoin and paying it back over time, and if there’s a default then the lending pool will socialize the risk.
How are interest rates computed? They are computed by what the cryptocurrency community calls “bonding curves” or what is known as market scoring rules. These rules take demand and supply, take deterministic functions of those- like how many tokens you want to borrow, how many people want to lend, and then compute an algorithmic interest rate. In Compound, they define a utilization rate. It’s between 0 and 1 and then you can compute the interest rates from that.
Proof-of-stake model
A minimal viable proof-of-stake model…. you should always be thinking about these things in cryptocurrencies as sampling probability distributions, and you can think of each block update as sampling the stake distribution and then updating it. This resembles like how you construct … in learning.
We’ll have a stake reward schedule, and the other is the validator stake distribution at some time. For each block, we sample a Bournilli random variable to say there’s a static slashing probability to see if they slash, and then given the block rewards we update the validator distributions. But what assumptions did we make?
Assumptions
Let’s talk about why we have to make some assumptions. Modeling these complex systems with many components.. there’s many agents, staking network, lending network. You have to make assumptions so you can reason about these things and have formal results. These assumptions will deviate from reality. If you can explicitly state everyone and where to use everyone similar to axiomization of block rewards, you can slowly relax them and then go to numerical methods for simulation.

Goal of chosen model assumptions
We want to remove all sources of variance and noise from factors that aren’t rebalancing related. There’s synchronous communication, deterministic money supply, no transaction fees, no immediate compounding, and single validator per block. These descriptions of these conditions explain why they are all variance reducing assumptions. These two pictures are just two different proof-of-stake networks- one is the eth2 emission and the other is the settl emission and they sort of violate some of these.
We assume all pseudonymous identities are known to the validators, so we assume syncing. Agent’s can’t choose the order of their transactions so we’re elimiiantgin gvariance due to mempool sniping/gas auctions. Agents draw their risk preference from a static random matrix ensemble: if there’s an equilibrium, then the risk preference distribution should be stationary and otherwise we’re not at equilibrium. The agents choose the risk their volatility is based on the expected epoch time and expected time of the loan, and we always assume there’s a fraction delta of altruistic validators who are always staked. If there’s not some fraction that is staked, then the lending transactions can’t go through and the system isn’t running.
Lending assumptions
And there’s lending assumptions like no external market, which reduces variance. We also assume there’s a constant relative demand relative to the money supply. A few others.
Formal proofs
A review comment I got is don’t drown the audience in any math. There’s a famous paper where he tells mathematicians not to read it…. John Cardy’s excellent SLE paper.
Key results
Lending supply volatility, uniformyl bounds staking outflows. The distributions are completely controlled by the lending fluctuations. There’s a phase transition where the lent supply goes from stricly growing- it evnetually saturates or maximizes- or it oscillates between being lent and not-lent. We’ll see some pictures of that to make it clear. Also, deflationary monetary policy provides poor staking returns and eventually everyone goes to staking.
Variables
There’s change in state, temporal parameters, the lending rate, and a fraction of altruistic state, and a number of other parameters.
Lending supply volatility uniformly bounds stake outflows
… the fluctuations in stake distribution are uniformly bounded by fluctuations in the lent distribution. The next thing is a phase transition that says there’s a lending rate at which basically the lent rate below this value then eventually the total lent quantity goes to zero. There’s an upper bound where if the lending rate is between those two parameters, then you basically never have the lent supply at zero. If the interest rate stays above a certain number, then the lent supply goes to the maximum saturated value.
If you have a deflationary monetary policy like bitcoin, then you are going to have rebalances that are greater than the altruistic amount staked with high probability. If you are polynomial or inflationary schedule then the rebalances will be negligble. There’s some technical reasons for choosing this delta, but this gives you a kind of idea.
Simulation results
We modeled different demand distributions, we did Monte Carlo simulations over this. We use “clamped” geometric brownian motion. We reflect it at boundaries. This is why it’s called clamped. You can model different properties of token distribution like saying some percent is locked at a certain time. You can also talk about margin when there’s margin trading in the system the demand can go higher than the supply.
….
With a phase transition, this is what happens when everything goes to the lent supply. On the right is conciliatory behavior.
Conclusions
A monetary policy in proof-of-stake networks needs to account for on-chain lending. Capital can always be cannibalized by on-chain yield, and the decentralized nature of on-chain lending can’t really be stopped unless there’s admin keys like in bzx attack. We looked at constant demand and other demand distributions, that things match what the theory says.
PoS networks really look like central banks because they have to adjust their monetary policy based on lending activity which is exactly how repos and overnight lending works.
Future work
I’d like to improve the simulation to reflect more realistic conditions ,add in more models for transaction fees showing there’s burstyness you need, and to get it to account for this. Add in other forms of leverage. In the bzx attack, there were a lot of tokens involved. One question is that if you have a PoS asset in a wrapped token and a significant supply is wrapped, can someone execute an attack? Also, we should add in the effects from sharding which is probably complicated.
Sponsorship: These transcripts are sponsored by Blockchain Commons.
Disclaimer: These are unpaid transcriptions, performed in real-time and in-person during the actual source presentation. Due to personal time constraints they are usually not reviewed against the source material once published. Errors are possible. If the original author/speaker or anyone else finds errors of substance, please email me at<EMAIL_ADDRESS>for corrections or contribute online via github/git. I sometimes add annotations to the transcription text. These will always be denoted by a standard editor’s note in parenthesis brackets ((like this)), or in a numbered footnote. I welcome feedback and discussion of these as well.
Tweet: Transcript: “Competitive equilibria between staking and on-chain lending” https://diyhpl.us/wiki/transcripts/stanford-blockchain-conference/2020/competitive-equilibria-staking-lending/ @tarunchitra @CBRStanford #SBC20


I am currently a second-year Ph.D. student working with Prof. Lin Tan in the Department of Computer Science at Purdue University. My research interests are in software engineering, software reliability, and program repair.


whether its a compliment, a service request project or consultation you can reach me by filling the form below


With every month passing we are moving closer towards the spring we want (atleast in my country). So, with a very deep line that I took a whole week to think up ; I am writing the blog post for february just like I do every month.  Though there are no big overhaul just some small tweaks and changes.
Now see an ad.
Wondering what's new we have this month?
AND!!!! THAT'S ALL.
Yeah, really that's all the major changes we did for this release. Initially I planned for more changes but nothing ever goes as planned. Also, We have had to say goodbye to a lot of our favorite devices like Galaxy A30, A40, M30 and Begonia; Pfft good riddance. But we have a lot of newly supported devices with this release like OnePlus 6, Galaxy A10, Redmi K20 and Poco X3 and we are always expanding to support more and more devices.
So, That was everything for this release and see you in March with a big release. Also, If you like how hard I work to bring you awesome and absolutely free software, you can go ahead and gift me some coffee, Buying me a coffee. Also I would like to thanks to Thapsus for buying me some coffee last month.
Well, this was it for this very small update and if you find any bugs do report it to us with logcat coz Logcat or gtfo. As always do follow us on twitter @ProjectSakura_ coz we keep posting fun stuff on it ;)
One more ad lol.
comments powered by DisqusLordShenron is the lead developer of the project. He is also an IT Engg Student and he loves anime and Japanese pop music. When he is not online he is mostly sleeping or busy with some college work.


Detalles Beneficiario
| Nombre | Apellido | Beneficios | Rut | Deadline |
|---|---|---|---|---|
| Herman Beck |
|
1.111.111-1 | May 15, 2015 | |
| Messsy Adam |
|
2.222.222-2 | July 1, 2015 | |
| John Richards |
|
3.333.333-3 | Apr 12, 2015 | |
| Peter Meggik |
|
4.444.444-4 | May 15, 2015 | |
| Edward |
|
5.555.555-5 | May 03, 2015 | |
| John Doe |
|
6.666.666-6 | April 05, 2015 | |
| Henry Tom |
|
7.777.777-7 | June 16, 2015 |


MLOWP - Mixing Logical Operators Without Parentheses
An expression containing multiple logical operators together should be parenthesized properly.
Wrong
boolean a, b, c;
// do something
if ( a || b && c ) {
// do something
return;
}
}
Tip: Use parenthesis to clarify complex logical expression to reader.
Right
boolean a, b, c;
// do something
if ( a || (b && c) ) {
// do something
return;
}
}


{{quiz.assignment.description}}
You got {{quiz.lastAttempt.correctAnswers}} out of {{quiz.questions.length}}!


Ohlone Wilderness 50 km
Fremont CA/USA
Website: ohlone50k.com
Race Winners
(28 runnings)
5:59:59 5:38:12 5:26:40 5:04:36 5:28:02 20 May
2007
4:40:59
5:17:11
21 May
2006
4:49:32
5:35:19
22 May
2005
5:19:02
5:44:00
16 May
2004
4:51:31
5:24:17
18 May
2003
4:57:03
5:38:48
19 May
2002
4:39:18
5:39:30
20 May
2001
5:13:58
5:15:12
21 May
2000
5:07:23
5:36:33
16 May
1999
4:37:17
5:17:10
17 May
1998
4:16:54
5:20:24
18 May 1997
4:22:46
5:33:33
24 May 1996
4:01:39
4:55:08
21 May 1995
4:03:00
5:35:32
22 May
1994
4:55:34
5:32:32
1993
---
---
31 May
1992
4:26:59
5:32:05
02 Jun 1991
4:18:41
5:24:21
20 May 1990
3:53:58
5:30:48
21 May 1989
3:53:53
5:37:14
22 May 1988
4:01:20
5:00:31
24 May 1987
4:29:34
5:21:02
Notes: 1987 was the inaugural year. This race is on trails. The distance for 1987-2001 was 48 km. The 1993 race
was not held because the race director was in paramedic school and there were no volunteers to direct the race.
The 2015 race was postponed from May 17th.
20 Sep
2015
5:05:14
Jean Pommier-5 (51)
6:47:58
Isabel Moleiro (POR)
18 May
2014
4:52:30
Lon Freeman (39,CA/USA)
5:27:35
Darcy Africa (GBR)
19 May
2013
4:54:38
Jean Pommier-4 (49)
5:52:51
Elizabeth Vitalis-6 (48)
20 May
2012
4:49:04
Jean Pommier-3 (48)
Tera Dube (39)
22 May
2011
4:31:20
Leor Pantilat-3
(27)
Keira Henninger (34,CA/USA)
23 May
2010
4:16:28
Leor Pantilat-2
(26)
Elizabeth Vitalis-5 (45)
31 May
2009
4:29:45
Leor Pantilat (25,CA/USA)
Caitlin Smith (28)
18 May
2008
4:57:35
Jean Pommier-2 (44)
Elizabeth
Vitalis-4 (43)
Jean Pommier (43,CA/USA)
Caren Spore (39,CA/USA)
Truman Long (35,CA/USA)
Elizabeth
Vitalis-3 (41)
Graham Cooper (35,CA/USA)
Tera Dube (32,CA/USA)
Lon Freeman (29,CA/USA)
Kami Semick (37,OR/USA)
Simon Mtuy (31,TAN)
Elizabeth
Vitalis-2 (38)
Kevin Sawchuk-2 (36)
Elizabeth Vitalis
(37,CA/USA)
Mike Topper (41,CA/USA)
Emma Davies-2 (36)
Kevin Rumon (39,CA/USA)
Emma Davies (35,CA/USA)
Kevin Sawchuk (33,CA/USA)
Katy Klei (38,CA/USA)
Dave Scott-8 (40)
Suzie Lister-3 (33) + Mo Bartley-2 (43)
Dave Scott-7 (39)
Mo Bartley (42,CA/USA)
Dave Scott-6 (38)
Suzie Lister-2 (31)
Dave Scott-5 (37)
Chrissy Duryea-Ferguson (34,CA/USA)
Alfred Bogenhuber (54,CA/USA)
Suzie Lister (29,CA/USA)
not held
not held
Dave Scott-4 (34)
Melinda Creel-2 (35)
Dave Scott-3 (33)
Melinda Creel (34,CA/USA)
Dave Scott-2 (32)
Pam Martin (31,CA/USA)
Dave Scott (31,CA/USA)
Lynda Locke (29,CA/USA)
Thomas Wood (25,CO/USA)
Kathy d'Onofrio (23,CA/USA)
Michael Duncan (37,CA/USA)
Carol LaPlant (40,CA/USA)
Most Wins
(1987-date)
Men
8
Dave Scott (CA/USA)
1989-92,1995-98
Women
6
Elizabeth Vitalis
(CA/USA)
2002-03,2006,2008,2010,2013
Prize Money
No information on prize money has been received for this race.
Race Time Bias
Insufficient data to calculate the race time bias.
Competitive Level
Insufficient data to calculate the competitive level.
Finishers
Year M+F
2015 111
2014 165
2013 166
2012 219
2011 199
2010 183
2009 155
2008 134
2007 139
2006 114
2005 116
2004 102
2003 92
2002 100
2001 70
2000 45
1999 84
1998 76
1997 69
1996 74
1995 42
1994 49
....
1992 88
1991 82
1990 49
1989 60
1988 51
1987 50
Sum 2884
Last Updated on 21 Jan 2016
Contributors: Juraj Gasparovic (50), Jack Leydig (4), Klaas Loonstra (10)


WITNESS LIST
Property Tax Reform & Relief, Select
September 29, 2016 10:00 AM
Property Tax Reform and Relief
ON:
Altinger, Roland (Harris CAD), Houston, TX
Arceneaux, Denise retired teacher (Self), Bellaire, TX
Barzilla, Chris Chief Appraiser Waller CAD (Waller CAD), Hempstead, TX
Bhakta, Sal Hotel (PSB Hospitality), Seabrook, TX
Essary, Derry Former Mayor Bunker Hill (also providing written testimony) (Self)
Forbes, Dean P. Retired (Firethorn Subdivision), Katy, TX
Garcia, Bernardo Attorney (clients), Houston
Gates, Gwen Realtor (Self)
Gilchrist, Frank Real Estate (ME)
Greene, James "Doc" AV Business (Self)
Hart, Coach Dan Retired of HCAD (also providing written testimony) (Taxpayers For
Equal Appraisal)
Ingram, Keith Director of Elections (Texas Secretary of State, Elections Divisions), Austin,
TX
Jennings, Clayton Professional Engineer , Real Estate Investor (Texas Capital Venture
LLC), Houston, TX
Johnson, Cheryl E Galveston Co. Tax Assessor Collector (also providing written
testimony) (Self & Co. Voters)
Kemp, Gary self (My Tenants & My Partner)
Kushner, Marcia School Librarian/Educator (Self), Houston, TX
LeBas, James fiscal analyst (also providing written testimony) (Tx Chemical Council and
Tx Assn of Manufactures), Austin, TX
Lynn, Andrea Teacher - Director of the Gary J. Lynn Foundation (Self), Houston, TX
Millis, Mark W. CEO - The Millis Group, Inc. (also providing written testimony) (The
Millis Group, Inc. - Personal), S.L., TX
Osenbaugh Sr., John C. property tax consultant (also providing written testimony) (Self),
Hou., TX
Sarlls, Ed Engineer (Self), Katy
Smolensky, David Plumber (Self)
Spears, John Stephen Retired (also providing written testimony) (Self)
Stanart, Stan Harris County Clerk (also providing written testimony) (Self)
Vera, Alan D. Marketing Consultant (Self), Houston
Veseleny, Brenda Real Estate Broker (Self), Seabrook, TX
Vrshek, David P. Retired (Self)
Wardlaw, Laura Stay At Home Mom (Self)
Whitehead, Glen Chief Appraiser (also providing written testimony) (Fort Bend CAD),
Rosenberg, TX
Wiener, Robert A. Geologist (Self), Houston
Wilson, Dave Electrician (Self), Hou, TX
Registering, but not testifying:
ON:
Bettancourt, Tammy CEO (Houston Building Owners & MGRS)
WITNESS LIST
Property Tax Reform & Relief, Select
September 29, 2016 10:00 AM
Chailer, John D. Retired Engineer (Self), Houston, TX
Collins, Sean Inv. Adv. (Self), Missouri City
Ewing, Cordelia (Cordie) H. Account Executive - marketing (Myself as a Homeowner),
Houston, TX
Hearn-Hayes, Dr. Theresa Certified Mediator (District 150)
McMahon, Yvonne (Self)
Messick, Bill Area Manager, Field Studies (Comptroller of Public Accounts), Austin, TX
Smith, Mary Jane Homemaker/Consultant (Self), Houston
Vierra, Chris Spring Branch ISD Trustee / Taxpayer (Self)
Werling, Craig Retired (Self), Missouri City


[[#doIndex]] [[/doIndex]] [[^doIndex]] [[/doIndex]]
Enter your monimus.com username.
Enter the password that accompanies your username.
Now available by invitation only
get invited to my web class


public interface MutableCredential extends Credential
Credential
which supports mutation of its properties.| Modifier and Type | Method and Description |
|---|---|
void |
setEntityId(String newEntityID)
Sets the ID of the entity this credential is for.
|
void |
setPrivateKey(PrivateKey newPrivateKey)
Sets the private key for this credential.
|
void |
setPublicKey(PublicKey newPublicKey)
Sets the public key for this credential.
|
void |
setSecretKey(SecretKey newSecretKey)
Sets the secret key for this credential.
|
void |
setUsageType(UsageType newUsageType)
Sets the usage type for this credential.
|
getCredentialContextSet, getCredentialType, getEntityId, getKeyNames, getPrivateKey, getPublicKey, getSecretKey, getUsageType
void setEntityId(String newEntityID)
newEntityID
- ID of the entity this credential is forvoid setUsageType(UsageType newUsageType)
newUsageType
- usage type for this credentialvoid setPublicKey(PublicKey newPublicKey)
newPublicKey
- public key for this credentialvoid setPrivateKey(PrivateKey newPrivateKey)
newPrivateKey
- private key for this credentialvoid setSecretKey(SecretKey newSecretKey)
newSecretKey
- secret key for this credentialCopyright © 1999–2016 Shibboleth Consortium. All rights reserved.


18+ Aipp Logo Pics. Whether you need a tech logo or startup logo, the brandcrowd can make a unique logo just for you. Find & download free graphic resources for app logo.
Find & download free graphic resources for app logo. Download for free in png, svg, pdf formats 👆. See more of aipp on facebook.
By admin | published april 21, 2016 | full size is × pixels.
We provide you with millions of icons and you can create great software and app logos. Free icons of app store logo in various ui design styles for web, mobile, and graphic design projects. 5,000+ vectors, stock photos & psd files. This logo was used from iphoneos 2 to ios 6.


--- layout: post title: Digital Comics Survey date: '2018-01-31T08:29:23+01:00' categories: - Shoutout picture_url: https://film-Storyboards.tumblr.com/post/170343522556/digital-comics-survey --- Digital Comics Survey


Rapid Links
ALT+V
Add URL
Save
Update
Cancel
Delete
open in new tab?
Yes
No
ALT+B
Add URL
Save
Update
Cancel
Delete
open in new tab?
Yes
No
ALT+N
Add URL
Save
Update
Cancel
Delete
open in new tab?
Yes
No


Menu
Menu
Intro
About me
Blog
Contact Me
Follow me
Resume
Optimal Distribution of Covid-19 Vaccines
Home
/
Blog
/ Optimal Distribution of Covid-19 Vaccines
Optimal Distribution of Covid-19 Vaccines
Leveraging ML for for the optimal Distribution of Covid-19 vaccines in an equitable manner.
Introduction
Brief intro...
The Problem
The problem...
Our Solution
Solution...
Law
Justice
Society
Principles & Morals
Date
April 3, 2017
Share


Quality services, outsanding performance and Transparent Trust
Check Out!We offer high class catering services at parties, office, organisations and all kinds of ceremonies
We supply all kinds of medical consumables and medical equipments to hospitals, clinics and all health centers
We give IT services ranging from oracle reselling, oracle implementation IT consultancy, website designing, software development, Database designing and all sofisticated IT solutions
we do all kinds of civil works, Electrical works and all kinds of construction that you may need.
IT/PROJECTS MANAGER
MANAGING DIRECTOR
Ready to work with us? That's great! Give us a call or send us an email and we will get back to you as soon as possible! You can also chat with us using the chatbox below on this website
0771-414233/0771-840058
We are located at plot 1 kololo Hill drive.


This page demonstrates the use of @Managed properties in Warp with a counter. Counter value: ${counter}


Version 1.0.28
Preview
button to the right of the seriesPreview
button to the right of the seriesText
radio button
in the lower right-hand corner of the windowAnonymize
modeAnonymize
button to the right of the seriesDestination
folder.
To view them, drag them into the application and click the corresponding
Preview
button.


The Asian American Association is made up of undergraduate and graduates students of the University of Tennessee.
AAA UTK promotes awareness of Asian American issues, serves as a representative voice of the Asian American community,
celebrates the diversity and commonalities of Asian Americans, and provides a social support network to our members.
Although the AAA deals primarily with Asian American issues, our membership is not by any means restricted to those of Asian decent.
The Asian American Association welcomes all members of the UT community regardless of race, religion, or national origin to join us in raising cultural awareness
and fostering unity and understanding among Asians, Asian Americans, and all other peoples of the UT community.
The mission of Asian American Association at the University of Tennessee is to create a community in which students can celebrate their culture, discuss social-political issues regarding Asian Americans, underline the importance of diversity, inclusion and solidarity, and have an effective representation on campus.


Price Glacier on Mount Shuksan August 5, 2018 The Price Glacier The Price Glacier of Mt Shuksan. Our route follows the center-right of the image. Nap Rock provided a nice shelter from the rain on our first night. Price Lake Adam walking a tightrope of snow and ice above deep crevasses. Terrain getting steeper and cuts getting deeper. Last section of the upper glacier. Below the summit pyramid. View from the summit pyramid. Snuggling up on a cozy bed of rocks. Heading down toward Lake Anne. Baker in the background. Hell's Highway.


Invast Securities Jan 2018 ⟼ Present
Prototype, design and develop the platform Money Hatch (TBD) with focus on security. Worked with management to plan the project timeline.
Prototype, design and develop the platform Money Hatch (TBD) with focus on security. Worked with management to plan the project timeline.
Front-end teacher from design to demo day of the students' fast paced projects.
Remote contracting for 10+ projects with several companies all over the world. Mainly front-end with some occasional back-end.
VP of non-profit with many roles including website design and workshop instructor. Organized events and lead several projects.
Developed in a variety of languages in the back-end to provide real-time data analysis.
Developed the whole back-end in PHP and MySQL. Implement some front-end features.
Final Year Project with Neural Networks and Natural Language Processing in Javascript.
Industrial Technology Engineering Degree with honors on Circuit Theory.
Modular and flexible framework with modern technology. Fully documented and tested.
Responsive library to have a basic template which grew to become fully-featured.
Global winner developing a Space Helmet.
Several awards through robot prototyping.
Regional winner while in Highschool.


halt/[0,1]
[ISO]halt
halt(
+ExitCode)
Causes an exit from the running process.
Exit status code. Only the lower 8 bits of this value is used.
Causes an exit from the running process with exit code ExitCode. ExitCode defaults to zero which, by convention, signifies a successful exit from the process.
halt/[0,1]
is implemented by raising a reserved exception, which has handler
at the top level; see ref-ere-int.
instantiation_error
type_error
abort/0
, break/0
, runtime_entry/1
, ref-ere-int.


General discussion about Komodo. For useful links and more info click the pinned messages to the right. DON'T DM @jl777
100 messages
Before 05-Dec-19 12:00 AM
Deleted User05-Jul-19 04:51 AM
Great article on the history of Atomic Swaps
Real nice & smooth read
polycryptoblog05-Jul-19 06:17 AM
A@costa2439 Atomic, in this sense , means , the swap happens or it doesn’t . When people reference atomic token swaps, they are just saying a swap of one token for another on a single blockchain. What Komodo does is crosschain swaps . More than 1 chain
SVET505-Jul-19 06:20 AM
@rainbro7 Magnum is really easy to use. Just connect your ledger and manage your fund. You could even claim rewards in magnum. Really looking forward for more smartchains being supported just like Chainzilla.
The next version of Windows 10 was released to testers on April 18th. We’ve been assessing the changes this update brings and wanted to inform Ledger users what it means for them. Windows 10 May ed...
hastrup05-Jul-19 08:10 AM
@PTYX how is it going to get kmd asset on trezor?
farl05-Jul-19 08:34 AM
@LocoMB yes, Trezor needs browser
costa243905-Jul-19 09:04 AM
@polycryptoblog ok, thanks. It's like I thought
Audo05-Jul-19 10:04 AM
@wil yes you are right. We want to position KMD as the default KMD pair too and make it the most liquid base pair on AtomicDEX. We will make a new site for AtomicDEX for the actual product launch.
jl777c05-Jul-19 10:06 AM
we are looking into making KMD work as BNB token does for the dexfees. so the more KMD you have, the lower the dexfees
someone posted that idea and it seems a very good way
5
2
3
we have to make sure it is ok to do
hyperDEX05-Jul-19 10:09 AM
@jl777c will that tie into the 0conf stuff and liquidity multiplier?
Maybe the more KMD you have the bigger the "leverage" to multiply
jl777c05-Jul-19 10:10 AM
not sure that is practical. will be hard enough to have a different set of dexfees based on KMD balance
Audo05-Jul-19 10:11 AM
alternatively the dexfee could be lower for all KMD pairs, promoting the use of KMD
2
2
hyperDEX05-Jul-19 10:13 AM
Oh that is a cool idea
jl777c05-Jul-19 10:17 AM
or both ideas combined
first we need to see if this entangles in any regs, i dont think it would, but you never know
wil05-Jul-19 10:31 AM
@Audo That sounds great! Thanks for your answer.
Andersen05-Jul-19 10:40 AM
As far as I remember in MM2.0 the maker does not pay anything, only the taker pays the commission. There is a good example of how to solve the problem of liquidity. In the Bitmex, every trader using passive limit orders receives a 0.0250% rebate. The fee is paid only by those who use market orders 0.0750% . Thus, every trader using limit orders is interested in becoming a market maker / liquidity provider.
https://i.postimg.cc/1zt3p5dF/fees.pnghttps://www.bitmex.com/app/fees
BitMEX is the world's most advanced P2P crypto-products trading platform and API. Trade with up to 100x leverage with only Bitcoin as collateral.
1
jl777c05-Jul-19 10:46 AM
nSPV fullnode is in testing. it has all the required support for nSPV clients. also the low level rpc -> p2p message -> json result is working from the client side, so now all that is left is to use this to make a reference cli wallet. the nSPV fullnode will affect all normal nodes, so we do have to have an extended testing for this, but the simplicity of the design has allowed for rapid progress. we already can support 870 nSPV clients with a single full node and that seems to be some internally imposed limit. i will look into that later, for now the next step is to get the cli reference wallet done so GUI devs can know what needs to be done.
the nSPV fullnodes will create a decentralized network of nodes to support all the nSPV clients, essentially like a decentralized electrum servers, just built into each fullnode, and also will have nearly full node security for the nSPV clients
Audo05-Jul-19 11:28 AM
negative maker fee sounds like an interesting concept
jl777c05-Jul-19 11:29 AM
we cant do that, as there is no centralized system
maybe a rebate during revshares, but it is complex enough as it is
hyperDEX05-Jul-19 11:43 AM
why not just 0 fees for maker, 0.5 for taker?
Audo05-Jul-19 11:45 AM
we already have 0 fees for all makers regardless of the trading pair
hyperDEX05-Jul-19 11:46 AM
Ah ok
costa243905-Jul-19 12:09 PM
How would that affect dex? really those fees are owned by dex holders(edited)
hyperDEX05-Jul-19 12:16 PM
more users using the dex = more dex fees(edited)
even if the dex fees is slightly discounted
passcombo.com 🏴☠🏴05-Jul-19 12:51 PM
most importantly for dex to be hack-proof. No point in having decentrlized trading while the app will be centralized around some libs which can be vulnerable for malicious code injection. Why people look for dex is hack proof or scam proof, unlike centrlized exchanges, but since code may have central weakness it may be perceived as not as safe as it appears to be in theory(edited)
so to me what is most attractive is not low fees , just security in every aspect
also for the app name / brand is important - it's hard to build brand, but easy to destroy
so my point is everything else I see as secondary - how you calculate fees or even if ui is easy... personally I would pay higher fees and even use less easy UI as long as I believe security(edited)
but of course for many people ui seem more important, but still make no sense to trade security for easy ui building by using3rd party libs to make ui easier and faster; when the news goes around that the app was hacked, nice ui will not be so nice any more
PTYX05-Jul-19 02:30 PM
@hastrup we will likely have chainzilla on trezor in the next month and a half.
Sharifa05-Jul-19 02:32 PM
Hello.
First time i hear about $DEX.
Who's idea is this anyway?
Why not simply using $KMD?
It would benefit all of us.(edited)
@passcombo.com 🏴☠🏴 it has to be a "user-friendly and one-click solution" DEX
Audo05-Jul-19 02:37 PM
Cross-chain atomic swap DEX is superior to proxy token models that have to rely on a blockchain. That blockchain comes like a bottleneck through which all trading has to happen, plus it introduces a security risk as the users have to change their real coins to IOU's.
jl777c05-Jul-19 02:54 PM
any coin that pays out revshares will have a very hard time to maintain listings
Sharifa05-Jul-19 03:15 PM
@jl777c KMD token should be used inside the DEX to pay for network transactions as well as $DEX (just learned of its existence an hour ago ) and ultimately become a rival to BNB
차미숙05-Jul-19 03:16 PM
Any kmd related asset shouldn't get listed
Those assets do not need exchanges anyway
Sharifa05-Jul-19 03:18 PM
@jl777c the team should also open new markets for KMD/$DEX as a token launch platform (Komodo Launchpad) and as an accelerator for crypto startups (instead of Binance Labs -> Komodo Labs).
ComputerGenie 👴👴👴05-Jul-19 03:19 PM
KMD isn't a token and Komodo Labs is a separate project entirely
Sharifa05-Jul-19 03:20 PM
@ComputerGenie 👴👴👴 yeah whatever
ComputerGenie 👴👴👴05-Jul-19 03:20 PM
not "whatever", words matter
차미숙05-Jul-19 03:20 PM
Anyone can open token launch platform on top of kmd
Sharifa05-Jul-19 03:21 PM
@ComputerGenie 👴👴👴 dude, i'm just a KMD holder not a technical person
hastrup05-Jul-19 03:21 PM
@jl777c any coin that pays out revshares will have a very hard time to maintain listing...... Why is that hard? So is revs dex and jumblr hard to maintain on atomicdex?
차미숙05-Jul-19 03:22 PM
Because it is a security if it acts as a stock
Audo05-Jul-19 03:22 PM
He was referring to proxy token DEX solutions where an entity controls and regulates trading & listing
we are building an open source code that anyone can use and no single entity can control
ComputerGenie 👴👴👴05-Jul-19 03:23 PM
@Sharifa I get that, but part of what you're saying is akin to:
Hummer bicycles would be good to haul large amounts of coal
Also, GM should use Audi to produce the next Dodge(edited)
2
Audo05-Jul-19 03:23 PM
AtomicDEX = a product we control, and we can dictate who gets listed and so on.
The product is based on AtomicAPI that is the part no one has direct control over. Anyone can build a DEX with AtomicAPI and choose which coins to list.
jl777c05-Jul-19 03:24 PM
if KMD paid out revshares, bittrex at least would delist it
along with upbit and who knows which other exchanges
Sharifa05-Jul-19 03:24 PM
@jl777c Komodo should also conduct Initial Exchange Offerings. These IEOs are immensely popular.
jl777c05-Jul-19 03:24 PM
no
others are free to conduct them on top of komodo
we cant get involved directly in such things
hastrup05-Jul-19 03:25 PM
And that's why Zaddex is born
Crabby Paddy05-Jul-19 03:27 PM
owerache05-Jul-19 03:27 PM
there is no wrapper nodejs for AtomicApi or any other language? just curls?
Sharifa05-Jul-19 03:28 PM
@jl777c ok i see but the community wants to use KMD not only to get a discount when trading, but also as a payment coin. So that KMD can start to compete with cryptocurrencies like BNB or is this not allowed?
jl777c05-Jul-19 03:28 PM
making KMD into an unregulated security is NOT an option
KMD needs to be squeaky clean. let other things in the ecosystem push the envelope
PTYX05-Jul-19 03:29 PM
@owerache probably coming soon
차미숙05-Jul-19 03:30 PM
supernet and dex should stay off exchanges imo
And crypto too
owerache05-Jul-19 03:31 PM
Okay, I'll do that, but for a developer, the doc is not easy... it won't make adoption any easier.
Sharifa05-Jul-19 03:31 PM
@jl777c does that mean that the value of KMD will NOT grow?
DEX users will be able to utilize KMD to pay transaction fees, isn't it?
I mean like discount on trading fees, KMD as fee for coin listing, etc...(edited)
owerache05-Jul-19 03:32 PM
There's bounty for that, right? if I have time I can do nodejs
TonyL05-Jul-19 03:34 PM
In general you can use any language module/tool which able to make requests since it's an API(edited)
imo description of API is quite clear. Why do you think it's not easy for developers?(edited)
owerache05-Jul-19 03:37 PM
well because it's easier to use some kind of official SDK or Wrapper in your language
TonyL05-Jul-19 03:37 PM
it's an API
owerache05-Jul-19 03:37 PM
example facebook sdk or other ..
TonyL05-Jul-19 03:38 PM
I believe some wrappers / tools will be built on top
jl777c05-Jul-19 03:38 PM
@Sharifa most coins are not security coins, yet their price can go up
TonyL05-Jul-19 03:38 PM
there are just like a 10 RPC calls which producing JSON output
owerache05-Jul-19 03:40 PM
Yes and? imo if you want adoption you invest in tools, right?
jl777c05-Jul-19 03:43 PM
you do realize it is still in beta?
as in, not all things are done yet
writing wrappers will come afterwards, but if anybody wants to do such things, we can work out some bounties
owerache05-Jul-19 03:46 PM
Yes, yes, I realize it's a beta... it was just to help: -(
I was just asking if it was in the pipe..
I'm dev fullstack I preferred to use an official sdk... that was just my opinion
jl777c05-Jul-19 03:51 PM
i think it has a REST (like) interface. not sure how much a wrapper will simplify
but i am not familiar with the other languages than C
owerache05-Jul-19 03:57 PM
Well example I'm on a project with Node react... I'm not going to have fun making calls... I'm going to build a wrapper that will make calls to me
It's a little code to reach the whole community' javascript
Aside from sustained growth in Node.js adoption during 2018, analysis of the past year shows the impact of greater stability in the larger Node ecosystem.
Yassin05-Jul-19 04:41 PM
@Deleted User baned for spam
Sharifa05-Jul-19 04:43 PM
Can someone answer my question:
DEX users will be able to utilize KMD to pay transaction fees, isn't it?
I mean like discount on trading fees, KMD as fee for coin listing, etc...
crumb05-Jul-19 04:46 PM
you don't need to own any KMD to use AtomicDEX. that's the beauty of it. you can swap LTC for ETH and fee is taken only from the 'taker' part of the transaction
I see a lot of questions about if KMD doesnt charge any KMD for usage of its platform “why should anybody hodl KMD”. Implicit in the…
Sharifa05-Jul-19 04:52 PM
@crumb so the buyer always pays fees but the seller never?
Can the taker choose between $DEX & $KMD?
Btw... since when does $DEX exist? Never heard of it before on Komodo's official channels


A step sequencer.
Seq outputs a different modulation value every step. Steps are advanced when it receives a trigger. Seq's output can be attached to Shift's shift input, and when Shift is set to Pitch, Seq can be used to change note values as well.
- 1 ... 32
- The value to output when the trigger reaches the given step. When connecting to Shift, you can select the right modulation output to correspond to a note by double-clicking on the step dial and selecting a note.
- Steps
- The number of steps. Steps beyond this number are ignored.
- Trigger
- When a trigger is received here, Seq advances to the next step. A good source of triggers would be an LFO.
- Change
- How the step shifts from one sequence to the next. See the manual for a description of the various curves. The modulation signal provided to the Trigger specifies where in this curve Seq should be at any time. To do this right, attach an LFO to the Trigger and set the LFO to Saw Up. If you're outputting notes, it'd be best also to turn off Free on the LFO.
- Free
- The sequencer ignores both Note On and Note Off.
- Stop on Release
- The sequencer stops on Note Off.
- Sample
- The sequencer samples the current step value and immediately transitions to it (as opposed to constantly adjusting if the step value is modified in real-time). The Trigger value is ignored, and so is Change.
- Guided
- The incoming value to Trigger doesn't specify the Change curve, but rather specifies which step to move to.
- Display
- A little red dot is displayed to show which step is being played. This is computationally costly, so turn it off when it's not needed.


TERMS AND CONDITIONS
Introduction
These Application/Website Standard Terms and Conditions written on this page shall manage your use of this website.
These Terms will be applied fully and affect to your use of this Application/Website.
By using this Application/Website, you agreed to accept all terms and conditions written in here.
You must not use this Application/Website if you disagree with any of these Application/Website Standard Terms and Conditions.
Minors or people below 18 years old are not allowed to use this Application/Website.
Intellectual Property Rights
Other than the content you own, under these Terms, Subic Jobs and/or its licensors own all the intellectual property rights and materials contained in this Application/Website.
You are granted limited license only for purposes of viewing the material contained on this Application/Website.
Restrictions
You are specifically restricted from all of the following
Publishing any Application/Website material in any other media;
Selling, sublicensing and/or otherwise commercializing any Application/Website material;
Publicly performing and/or showing any Application/Website material;
Using this Application/Website in any way that is or may be damaging to this Application/Website;
Using this Application/Website in any way that impacts user access to this Application/Website;
Using this Application/Website contrary to applicable laws and regulations, or in any way may cause harm to the Application/Website, or to any person or business entity;
Engaging in any data mining, data harvesting, data extracting or any other similar activity in relation to this Application/Website;
Using this Application/Website to engage in any advertising or marketing.
Certain areas of this Application/Website are restricted from being access by you and Subic Jobs may further restrict access by you to any areas of this Application/Website, at any time, in absolute discretion.
Any user ID and password you may have for this Application/Website are confidential and you must maintain confidentiality as well.
Your Content
In these Application/Website Standard Terms and Conditions, “Your Content” shall mean any images or other material you choose to display on this Application/Website.
By displaying Your Content, you grant Subic Jobs a non-exclusive, worldwide irrevocable, sub licensable license to use, reproduce, adapt, publish, translate and distribute it in any and all media.
Your Content must be your own and must not be invading any third-party’s rights.
Subic Jobs reserves the right to remove any of Your Content from this Application/Website at any time without notice.
No warranties
This Application/Website is provided “as is,” with all faults, and Subic Jobs express no representations or warranties, of any kind related to this Application/Website or the materials contained on this Application/Website.
Also, nothing contained on this Application/Website shall be interpreted as advising you.
Limitation of liability
In no event shall Subic Jobs, nor any of its officers, directors and employees, shall be held liable for anything arising out of or in any way connected with your use of this Application/Website whether such liability is under contract.
Subic Jobs, including its officers, directors and employees shall not be held liable for any indirect, consequential or special liability arising out of or in any way related to your use of this Application/Website.
Indemnification
You hereby indemnify to the fullest extent Subic Jobs from and against any and/or all liabilities, costs, demands, causes of action, damages and expenses arising in any way related to your breach of any of the provisions of these Terms.
Severability
If any provision of these Terms is found to be invalid under any applicable law, such provisions shall be deleted without affecting the remaining provisions herein.
Variation of Terms
Subic Jobs is permitted to revise these Terms at any time as it sees fit, and by using this Application/Website you are expected to review these Terms on a regular basis.
Assignment
The Subic Jobs is allowed to assign, transfer, and subcontract its rights and/or obligations under these Terms without any notification.
However, you are not allowed to assign, transfer, or subcontract any of your rights and/or obligations under these Terms.
Entire Agreement
These Terms constitute the entire agreement between Subic Jobs and you in relation to your use of this Website, and supersede all prior agreements and understandings.
Governing Law & Jurisdiction
These Terms will be governed by and interpreted in accordance with the laws of the Republic of the Philippines, and you submit to the non-exclusive jurisdiction of the Republic of the Philippines and its Supreme Court for the resolution of any disputes.
Do you agree to submit all the informations above, so as its Terms and Conditions?


merge view demo
The merge
addon provides an interface for displaying and merging diffs,
either two-way
or three-way.
The left (or center) pane is editable, and the differences with the
other pane(s) are optionally shown live as you edit
it. In the two-way configuration, there are also options to pad changed
sections to align them, and to collapse unchanged
stretches of text.
This addon depends on the google-diff-match-patch library to compute the diffs.


git-patch-id - Compute unique ID for a patch
git patch-id [--stable | --unstable] < <patch>
A "patch ID" is nothing but a sum of SHA-1 of the file diffs associated with a patch, with whitespace and line numbers ignored. As such, it(cqs "reasonably stable", but at the same time also reasonably unique, i.e., two patches that have the same "patch ID" are almost guaranteed to be the same thing.
IOW, you can use this thing to look for likely duplicate commits.
When dealing with git diff-tree output, it takes advantage of the fact that the patch is prefixed with the object name of the commit, and outputs two 40-byte hexadecimal strings. The first string is the patch ID, and the second string is the commit ID. This can be used to make a mapping from patch ID to commit ID.
--stable
Use a "stable" sum of hashes as the patch ID. With this option:
h'-04'(buh'+03'c
Reordering file diffs that make up a patch does not affect the ID. In particular, two patches produced by comparing the same two trees with two different settings for "-O<orderfile>" result in the same patch ID signature, thereby allowing the computed result to be used as a key to index some meta-information about the change between the two trees;
h'-04'(buh'+03'c
Result is different from the value produced by git 1.9 and older or produced when an "unstable" hash (see --unstable below) is configured - even when used on a diff output taken without any use of "-O<orderfile>", thereby making existing databases storing such "unstable" or historical patch-ids unusable.
This is the default if patchid.stable is set to true.
--unstable
Use an "unstable" hash as the patch ID. With this option, the result produced is compatible with the patch-id value produced by git 1.9 and older. Users with pre-existing databases storing patch-ids produced by git 1.9 and older (who do not deal with reordered patches) may want to use this option.
This is the default.
<patch>
The diff to create the ID of.
Part of the git(1) suite