I attended a talk on Ethereum few weeks back and was fascinated by the possibilities it provided and started exploring the ecosystem. It is a pretty nascent ecosystem that is catching up fast among the developer community. In this post I will explain the technology behind Ethereum so that we can get started with developing with Ethereum. This assumes you have technology background and basic understanding of blockchain so that we can discuss the Ethereum implementation.
Blockchain provides a de-centralized, peer to peer network where digital assets can be transferred from one peer to another. The major problem we face in a de-centralized network is who will verify the validity of all the transactions taking place? The short answer is everyone.
Imagine a document with some information . Each person in the network keeps a copy of the same document. If there is an update in the document, it is propagated across the network and everyone updates their own copy of the document. Lets say a new person comes with different content in the document, then all the others can verify their copy and detect that the new person is lying and kick him out of the network. This is basically how a blockchain works.
First we need to understand few basic terms to get started.
We can use a cryptographic hash function(SHA256) to convert any string to its equivalent hash. The hash has two unique properties:
The hash produced has one to one mapping with the input string. The same input always produces the same unique hash and no other input can have the same hash.
Even a small change in the input string will lead to a large change in the output hash and thus the input can be easily validated.
The process by which assets are moved from one party to another in the network is known as Transaction. All transactions are recorded and permanently stored.Lets say A wants to transfer 5 Ether to B. Then this is a transaction in the network.
Many transactions are combined together to form a block. Each block consists a unique hash which identifies it in the network. A block is chained to previous block using the hash of the previous block.
The initial block or state of the blockchain that is agreed upon by all the nodes in the network.
As the transactions are added many blocks are created and then they are chained together using their hashes into blockchain network.
A proof of work is a piece of data which is difficult (costly, time-consuming) to produce but easy for others to verify and which satisfies certain requirements. When there is a transaction in the network, any node that tries to process the transaction should solve a cryptographic puzzle for it to be accepted to the block. This is known as proof of work. The work that is to be performed can be done only by trial and error and this has to be performed for any valid transaction in the network before it can become part of the blockchain.
The process of processing a transaction and adding it to the block by carrying out the proof of work is known as mining. The miners(nodes) get the rewards of the transaction once the transaction is accepted as part of the blockchain.
A Merkle tree is a tree in which every non-leaf node is labelled with the hash of the labels of its child nodes. We can verify that the data blocks received from other nodes are received undamaged and unaltered, and even to check that the other nodes do not lie and send fake blocks.
We can now move on to basic working of a blockchain.
Each node starts with genesis block and builds its way up to the “current state” of the blockchain. When it receives a new block each node verifies its hash and thus validates if its a valid block or not and keeps building the chain.
Once there is a transaction in the network, the miner mines it by generating the required proof of work. Then the miner adds it to his copy of the network and propagates the change to the nearby nodes.
All the nodes which receives it will validate the proof of work and then add it to their respective copies. If it is not valid, then the block is not added to the chain.
When there is a conflict in the network , then the “longest chain rule” is applied to resolve it. Lets say two miners claim the same block and both have valid proof of work. Then the longest chain rule is applied which is whichever miner has the longest chain of blocks will be taken as the winner and that is added to the blockchain.
Now that you have got a grasp of blockchain lets move ahead with Ethereum. Ethereum is a decentralized platform that allows us to write applications that run exactly as programmed without any possibility of downtime, censorship, fraud or third party interference. It consists of Ethereum Virtual Machine(EVM) which provides the container in which all the smart contracts can be executed.
Ethereum allows us to write applications on the blockchain and this applications are known as smart contracts. These smart contracts reside on the blockchain and they are immutable in nature, ie. the code cannot be deleted or modified in the blockchain once it is deployed. This can be written using Solidity or other languages, but the most preferred is solidity. It is a turing complete language.
Ether is the cryptocurrency used in the Ethereum blockchain.
In Ethereum, the state is made up of objects called “accounts”, with each account having a 20-byte address and state transitions being direct transfers of value and information between accounts. There are two types of accounts in Ethereum:
Externally owned accounts : These accounts are owned by users, controlled by private keys. An externally owned account has no code, and one can send messages from an externally owned account by creating and signing a transaction.
Contract accounts: These accounts are owned by contract code. In a contract account, every time the contract account receives a message its code activates, allowing it to read and write to internal storage and send other messages or create contracts in turn.
As smart contracts are turing complete any infinity loop or other code can be written and the blockchain can be crashed. To prevent from such attacks Ethereum uses a concept called gas. Gas is nothing but some transaction cost which is paid to execute the transaction using Ether(basic currency in Ethereum chain). Each instruction requires some gas to be executed and the gas is sent along with any call that needs to modify the blockchain.
These are distributed apps that can be built using the smart contracts and providing an interface for the users(accounts). Different kinds of applications can be developed which will interact with smart contracts residing in the blockchain.
We can discuss a basic workflow in Ethereum network for better understanding of how all these concepts work together in unison.
We can write smart contracts and deploy it to Ethereum network. Once deployed these contracts cannot be changed.
Any account or another smart contract in the network can execute these smart contracts functions through transactions.
The smart contracts can be called and executed by sending transactions to the contract. These transactions cost gas and a certain gas should also be sent along with the transaction.
Sometimes we just need to know the state of some contract without modifying the blockchain. These are known as calls and they do not cost any gas.
We can build various Dapps by executing the smart contracts using transactions and calls , thus allowing the user to directly interact the smart contract in different ways.
I believe this post provides basic understanding of the blockchain and Ethereum. In my next post I will provide a detailed guide to getting started with building Dapps using Ethereum.
If you liked this story, feel free to reach out to me at https://kaizencoder.com/.


jl777c
08-Dec-18 06:56 PM
for a given notarization, the notaries are numbered from 0 to 63, the one that is 0 changes each notarization to give each notary equal chance over time to participate in notarization.
now all 64 nodes broadcast to each other their notarization data
along with the info they got from the other notary nodes
based on this, nodes propose the 13 signers for this round such that all of them are in agreement.
at first there is maybe not so many nodes that agree on all details
but the proposal with the most support is switched to by notaries that are not already there, so after several rounds things converge so that we get 13 nodes all in agreement
then this is latched and the 13 nodes generate signatures, broadcast them
all the nodes reconstruct the 13 way signed tx and broadcast it
it is actually quite a process and took a while to get it efficient with a high completion rate
the notaries are tuning their systems to maximize the number of notarizations they participate in and you can ask them about the randomness, it is not possible to know ahead of time which 13 nodes the group will converge to


Initialization of the Elation Framework directory failed. Please review the installation instructions, and run ./elation web init from the command line.
./elation web init


Status codes returned by service.
OK
indicates the response contains a valid result.INVALID_REQUEST
indicates that the provided request was
invalid.
MAX_ELEMENTS_EXCEEDED
indicates that the product of origins and
destinations exceeds the per-query limit.
MAX_DIMENSIONS_EXCEEDED
indicates that the number of origins or
destinations exceeds the per-query limit.
OVER_DAILY_LIMIT
indicates any of the following:
OVER_QUERY_LIMIT
indicates the service has received too many
requests from your application within the allowed time period.
REQUEST_DENIED
indicates that the service denied use of the
Distance Matrix service by your application.
UNKNOWN_ERROR
indicates a Distance Matrix request could not be
processed due to a server error. The request may succeed if you try again.


The Menu Bar
The menu bar appears at the very top of the window, under the application name and logo. The menus here provide many options for I/O, editing, and customizing the look and feel of Onyx.


Dear Love
Dear Love,The poet's poetry,
In the darkest hour,You bring the life some symmetry.
The innocent hearts,do you steal,
Fire and Strength,do you reveal.
An ocean of emotions and sky of hope,
Dear Love,You hold me together like rope.
Dear Love,The writer's story,
In the brightest hour,You share the glory.
Calm and Serene,do you appear,
Bring some peace and help me steer.
Above the Mountains in the sparkling sky,
Dear Love, with you,I would love to fly.
Dear Love,An artists art,
You give the day,a beautiful start.
Result of great imagination and hard-work,
You catch people's eyes and leave them awestruck.
Beside the plains,Along the strip,
Dear Love,with you,I would love a road-trip.
Dear Love,A Comedian's Comedy,
You,my dear,keep my life steady.
Made from the heart,you bring me fun,
Beautiful by nature, just like a Heron.
Along the shore,at the sunset,
Dear Love,I would love to sit beside and have a chat.
Dear Love,A singer's song,
Soft at places,at others so strong.
Born from beautiful voice and words,
Without the lovely singer,
You are just a verse.
Atop the hill, under the Moonshine,
Dear Love, You make me feel divine.
Author:
Ayush Saxena
<EMAIL_ADDRESS>PreviousHomeNext


French Montana rushed to hospital after suffering ‘cardiac issues'
French Montana has reportedly been rushed to hospital after suffering ‘cardiac issues’ at his home in Los Angeles.
The rapper, 35, had been visited by police after they were called out to a possible robbery at his home in Calabasas, and the officers had to call him an ambulance while they were there.
TMZ reports that French Montana – real name Karim Kharbouch – was suffering ‘scary cardiac issues and intense nausea’.
When officers arrived at his house at around 1.30pm on Thursday, they discovered the robbery was a false alarm but noticed French acting out of character.
They said he ‘seemed out of it’ and was suffering severe stomach pains, nausea and an elevated heart rate, which needed checking out in hospital.
French was taken to a nearby hospital and TMZ reports that he is ‘awake and alert’ and receiving treatment including IV fluids, and is expected to be released today.
Advertisement Advertisement
The cause of his issues is suspected to be contaminated food, after sources close to the rapper revealed he has been travelling around Europe and the Middle East in the past few weeks.
French, who previously dated Khloe Kardashian in 2013 and 2014, had been back in his native Morocco visiting family and had recently returned to his home in LA.
He was born and raised in Morocco and made the trip back there to celebrate his birthday with his mum and dad.
Despite the couple not working out, he recently told Haute Living: ‘We are always going to be friends, and the family still remains close.
‘I feel like we had a real dope relationship. There was no bad blood, nobody did something to somebody that we couldn’t come back from. The love was real.’
French is also set to release his third studio album, Montana, this month which will feature collaborations with Post Malone, Cardi B and others.
Got a showbiz story?
If you've got a story, video or pictures get in touch with the Metro.co.uk Entertainment team by emailing us<EMAIL_ADDRESS>calling 020 3615 2145 or by visiting our Submit Stuff page - we'd love to hear from you.


|
F´ Flight Software - C/C++ Documentation
NASA-v1.5.0
A framework for building embedded system applications to NASA flight quality standards.
|
#include <Os/Baremetal/TaskRunner/TaskRunner.hpp>
Public Member Functions | |
| TaskRunner () | |
| < Nothing constructor More... | |
| ~TaskRunner () | |
| void | addTask (Task *task) |
| void | removeTask (Task *task) |
| void | stop () |
| void | run () |
Combination TaskRegistry and task runner. This does the "heavy lifting" for baremetal running of tasks.
Definition at line 19 of file TaskRunner.hpp.
| Os::TaskRunner::TaskRunner | ( | ) |
| Os::TaskRunner::~TaskRunner | ( | ) |
Definition at line 22 of file TaskRunner.cpp.
|
virtual |
Add a task to the registry. These tasks will be run on a bare-metal loop. The function used in this task may be overridden.
| Task* | task: task to be added |
Implements Os::TaskRegistry.
Definition at line 28 of file TaskRunner.cpp.
|
virtual |
Remove a task to the registry. These tasks will no-longer be run.
| Task* | task: task to be removed |
Implements Os::TaskRegistry.
Definition at line 37 of file TaskRunner.cpp.
| void Os::TaskRunner::run | ( | ) |
Run once function call, used to run one pass over tasks
Run once through list of tasks
Definition at line 65 of file TaskRunner.cpp.
| void Os::TaskRunner::stop | ( | ) |


Forum example, built with
django-treebeard
(
source
)
Choose a tree model:
Adjacency List Tree (AL)
Materialized Path Tree (MP)
Nested Sets Tree (NS)


--- layout: post title: Headspringers at Austin Code Camp categories: - Small Talk & Big News status: publish type: post published: true meta: _edit_last: '23' _podPressPostSpecific: a:6:{s:15:"itunes:subtitle";s:15:"##PostExcerpt##";s:14:"itunes:summary";s:15:"##PostExcerpt##";s:15:"itunes:keywords";s:17:"##WordPressCats##";s:13:"itunes:author";s:10:"##Global##";s:15:"itunes:explicit";s:7:"Default";s:12:"itunes:block";s:7:"Default";} s2mail: 'yes' _aioseop_keywords: austin code camp, june 9th, managing your career, building a language, javascript frameworks _aioseop_description: ! 'Headspringers to speak at Austin Code Camp, June 9th, on topics: managing your career, building a language, Javascript frameworks, and more. ' _aioseop_title: Austin Code Camp dsq_thread_id: '834006366' ---
Austin Code Camp has become a running tradition in the Austin area. I still have a t-shirt from 2007 I occasionally mow the yard in! While Austin Code Camp doesn't give out t-shirts anymore, it's still focused on providing FREE sessions for the development community, by members of the community. This year's event is going to be June 9th. You can register over at http://austincodecamp2012.com/.
A number of Headspringers are going to be presenting sessions this year. The subjects cover a lot of varied ground - from introductions to deep dives, and focuses ranging from managing technology to managing your career.
Here's a list of what Headspringers are going to be presenting or facilitating:
Steve Donie – Client Side JavaScript Frameworks
Sharon Cichelli - Crafting your Career
Nolan Egly - Cryptography 101
Alonso Robles - Getting Started with Raven DB
Patrick Lioi - Building a Language
Tim Thomas - Avoiding the Threat of Awful CSS, Web Usability on a Budget
Anne Epstein - Don't Do This in NHibernate, Lightning Talks!
Jeffrey Palermo - Star Schema and Reports, Onion Architecture
We hope to see you there! (Did I mention it's FREE?)


{{capitalizeAll title}}
{{#if category.name '==' "Baby Care"}}
Paraben Free · Cruelty Free · Sensitive & Hypoallergenic
{{else if category.name '==' "Baby Food"}}
No Artifical Flavors or Colors · No Added Sweeteners · Wholesome & Nutritious
{{else if category.name '==' "Clothes"}}
Woven with Handpicked Organic Cotton Fibers
{{else if category.name '==' "Diapers"}}
Comfort Starts at the Tushy
{{else if category.name '==' "Toys"}}
Handcrafted with Natural Dyes & Real Rubber (From Trees - Not Tires)
{{else if category.name '==' "Mommy"}}
Prenatal & Post-Partum Care using Natural Oils and Herbs
{{/if}}


Methods from Class ArrayList
At first, user needs to rate the method, if method is rated as high(range > 50%), user needs to select the reason(s) that make the method important.
Finally, user select the important/valuable sentences corresponding to the important method mentioned in the Java official API reference documentation.


|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object Embryo4D
public class Embryo4D
The highest level class containing all polygon data about an embryo. Stores a
2D array of CellGraph
objects.
| Field Summary | |
|---|---|
boolean |
changed
Has the Embryo been changed since the last save? |
static boolean |
DEBUG_MODE
Toggles debug mode for the entire project (enabling several assert() statements that slow down the code. |
| Constructor Summary | |
|---|---|
Embryo4D(Embryo4D oldEmbryo,
int startT,
int endT,
int refT,
int bottomZ,
int topZ,
int refZ,
double areaChangeMaxZ,
int layersToLookBackZ,
double centroidDistMaxZ,
double areaChangeMaxT,
int layersToLookBackT,
double centroidDistMaxT)
Make a copy an existing Embryo4D. |
|
Embryo4D(int startT,
int endT,
int refT,
int bottomZ,
int topZ,
int refZ,
double areaChangeMaxZ,
int layersToLookBackZ,
double centroidDistMaxZ,
double areaChangeMaxT,
int layersToLookBackT,
double centroidDistMaxT)
Create a new, empty, Embryo4D object. |
| Method Summary | |
|---|---|
void |
addCell(Cell c,
int T,
int Z)
Add Cell c at (T, Z). |
void |
addCellGraph(CellGraph cg,
int T,
int Z)
Add a CellGraph at (T, Z), overwriting any existing CellGraph at that point |
boolean |
anyTracked(int c,
int T)
Was the Cell c tracked at all in this time point T? |
void |
autoAddEdges(int T,
int Z)
Attempts to automatically add edges inside of cells in the CellGraph at (T, Z). |
void |
autoRemoveEdges(int T,
int Z)
For all cells in the image (T, Z), attempt to automatically remove edges. |
int |
bottomLayer()
The bottom layer of the stack as specified by the raw images filenames. |
int |
doNothing(int T)
Do nothing. |
int |
endTime()
The end time of the stack as specified by the raw images filenames. |
Cell |
getCell(int c,
int T,
int Z)
Get Cell c at (T, Z). |
CellGraph |
getCellGraph(int T,
int Z)
Get the cellGraph at (T, Z). |
Cell[] |
getCells(int[] c,
int T,
int Z)
Get Cells with indices in c at (T, Z). |
Cell[] |
getCellStack(int c,
int T)
Get an array of Cell objects along z corresponding to index c and time T. |
Cell[] |
getCellStackTemporal(int c,
int Z)
Get an array of Cell objects along t corresponding to index c and depth Z. |
double |
highestTracked(int c,
int T)
The layer highestZ of the highest tracked Cell for the cell index c at time T. |
boolean |
isEmpty()
Is this Embryo4D empty, or does it contain any CellGraphs? |
boolean |
isTracked()
Does this embryo contain all the necessary CellGraphs? |
boolean |
isTracked(int c,
int t,
int z)
Does the Cell c exist in CellGraph (t, z)? |
double |
lowestTracked(int c,
int T)
The layer lowestZ of the lowest tracked Cell for the cell index c at time T. |
int |
masterLayer()
The reference layer of the stack as specified by the user. |
int |
masterTime()
The reference time of the stack as specified by the user. |
void |
modifyCell(Cell c,
int T,
int Z)
Call this if cell c at (T, Z) has been modified. |
int |
numCells()
The total number of Cells. |
void |
removeAllCellGraphs()
Remove all CellGraphs from the Embryo4D. |
void |
removeCell(Cell c,
int T,
int Z)
Remove Cell c at (TZ). |
void |
removeCellGraph(int T,
int Z)
Remove a CellGraph at (T, Z). |
int |
startTime()
The start time of the stack as specified by the raw images filenames. |
int |
t()
The total number of time points. |
int |
topLayer()
The top layer of the stack as specified by the raw images filenames. |
java.lang.String |
toString()
|
int |
totalCellCount()
Returns the total number of cells in all of CellGraphs of this Embryo4D. |
int |
totalVertexCount()
Returns the total number of vertices in all of CellGraphs of this Embryo4D. |
void |
trackAllCells()
Track all the cells in the embryo; perform a full tracking from scratch. |
int |
translateT(int T)
Convert the image filename index T to the java index t. |
int |
translateZ(int Z)
Convert the image filename index Z to the java index z. |
int |
unTranslateT(int t)
Convert the java index t to the image filename index T. |
int |
unTranslateZ(int z)
Convert the java index z to the image filename index Z. |
int |
Xs()
The x-resolution of each image. |
int |
Ys()
The y-resolution of each image. |
int |
z()
The total number of z-layers. |
| Methods inherited from class java.lang.Object |
|---|
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait |
| Field Detail |
|---|
public static final boolean DEBUG_MODE
public boolean changed
| Constructor Detail |
|---|
public Embryo4D(int startT, int endT, int refT, int bottomZ, int topZ, int refZ, double areaChangeMaxZ, int layersToLookBackZ, double centroidDistMaxZ, double areaChangeMaxT, int layersToLookBackT, double centroidDistMaxT)
public Embryo4D(Embryo4D oldEmbryo, int startT, int endT, int refT, int bottomZ, int topZ, int refZ, double areaChangeMaxZ, int layersToLookBackZ, double centroidDistMaxZ, double areaChangeMaxT, int layersToLookBackT, double centroidDistMaxT)
| Method Detail |
|---|
public int startTime()
public int endTime()
public int masterTime()
public int bottomLayer()
public int topLayer()
public int masterLayer()
public void addCellGraph(CellGraph cg, int T, int Z)
public void removeCellGraph(int T, int Z)
public void removeAllCellGraphs()
public boolean isEmpty()
public boolean isTracked()
public int totalCellCount()
public int totalVertexCount()
public void trackAllCells()
public void addCell(Cell c, int T, int Z)
public void removeCell(Cell c, int T, int Z)
public void modifyCell(Cell c, int T, int Z)
public int t()
public int z()
public int numCells()
public int Ys()
public int Xs()
public int translateT(int T)
public int translateZ(int Z)
public int unTranslateT(int t)
public int unTranslateZ(int z)
public int doNothing(int T)
public CellGraph getCellGraph(int T, int Z)
public Cell[] getCellStack(int c, int T)
public Cell[] getCellStackTemporal(int c, int Z)
public Cell getCell(int c, int T, int Z)
public Cell[] getCells(int[] c, int T, int Z)
public double highestTracked(int c, int T)
public double lowestTracked(int c, int T)
public boolean anyTracked(int c, int T)
public boolean isTracked(int c, int t, int z)
public void autoRemoveEdges(int T, int Z)
public void autoAddEdges(int T, int Z)
T
- timeZ
- depthpublic java.lang.String toString()
toString
in class java.lang.Object
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |


Learn how to use the free tools available in your web browser
A superior option for your coding needs
See the importance of these numbers and security concerns
Understand the techniques behind proper promotion


Doxygen
Doxygen is a software documentation generator system for multiple programming languages. It can generate documentation in different formats (such as HTML, Latex, RTF, PostScript). The documentation tool is useful for the developers, because the documentation is inlined in the source code, which makes it easy to keep in sync with the new revisions of the project. It walks up the source files and even there is no documentation provided it can generate description in terms of UML diagrams - particularly useful when dealing with large codebases.
Cling has online doxygen documentation that could be found here
If you want to be able to browse offline the doxygen documentation you can build your own with:
cd CLING_BUILD_DIR/docs/ make regendoc


Special ringtones clipped from all time World Cup theme song since 1986 - 2018. Download 10 of them below.
1. World Cup Mexico 1986 - Hot Hot Hot
Your browser does not support the audio element. open or download here.
2. World Cup Italia 1990 - To be The Number One
Your browser does not support the audio element. open or download here.
3. World Cup USA 1994 - Glory Land
4. World Cup France 1998 - The Cup of Life
Your browser does not support the audio element. open or download here.
5. World Cup Korea/Japan 2002 - Boom
Your browser does not support the audio element. open or download here.
6. World Cup Germany 2006 - Celebrate the Day
Your browser does not support the audio element. open or download here.
7. World Cup 2010 South Africa - Waka - waka
Your browser does not support the audio element. open or download here.
8. World Cup Brazil 2014 - We are One
Your browser does not support the audio element. open or download here.
9. World Cup Russia 2018 - Live it Up
Your browser does not support the audio element. open or download here.
10. World Cup Russia 2018 - Live it Up (2)
Your browser does not support the audio element. open or download here.


January's Swear of the Month
If you’ve been online any time in the past year (or if you have your butler print out Reddit every morning so you can read it over coffee) you have probably seen someone call someone else a “cuck.” Cuck has joined (though unfortunately not replaced) words like “fag” and “tard,” in the ever-classier lexicon of the alt-right.
December's Swear of the Month
I know what you’re here for, friends. You come expecting a fresh new swear to stuff into your language satchels, like giddy trick-or-treaters at the front door of a crotchety uncle. Ordinarily I would oblige. But the purpose of this swear of the month club has long since expanded beyond the mere coining of neologisms. I have made it my mission not only to arm you with new swears, but with the skill to put your arsenal of swears to good use. And so, with a heavy heart, I must inform you of a crisis that threatens the very heart of sweardom: we have reached peak fuck.
November's Swear of the Month
Many entertainment properties have their own proprietary swears. Battlestar Galactica has “frack”, Firefly has “gorram,” and so on. Most of these seem to have been invented primarily to get around the censors. There’s another reason swears are invented in fictional worlds, though, and the Bladerunner movies exemplify it: the slurs that exist in a world tell us a lot about the world. Don’t worry, I’m not going to spoil the new Bladerunner for you. All I want to talk about is the word “skinjob.”
October's Swear of the Month
Recently it has become fashionable to call people, things, and events “garbage.” Within the last few years, we have taken to calling shitty people “garbage people”, and bad television “garbage television.” Garbage isn’t a new pejorative – one might say the recent trend represents a return to vogue rather than a brand new development – and its popularity is understandable. It’s simple, gracefully evades the censors, and has a full, luxurious mouthfeel. I believe, however, that there is another motive for the resurgence of garbage as an insult; a motive that may yield further swears for our collective use.
September's Swear of the Month
I’ve spent a lot of time talking about “swearing” as a general category. But why is “swearing” a label we use to refer to bad words? In court, one swears to tell the truth. In marriage, one swears to honor and cherish and whatever. When one enters public office, one goes through a “swearing-in” ceremony. And of course we cannot forget about the most sacred type of promise left to us in this age of perfidy: the “pinky-swear.” To swear is to promise in the most sincere and holy of ways, so why is the word also synonymous with “call your dad a shitlord?” Well … because of how sacred those oaths once were, it turns out.
August's Swear of the Month
Just a quick one this month. Here’s three rhyming euphemisms to never say:
July's Swear of the Month
Hello again, fuckers and fuckees, and welcome to this month’s swear.
June's Swear of the Month
This month we’re taking the swear-of-the month club back to its roots, with three invented swears to add to your arsenal.


Advance search : off
Text:
search by:
Name
Size
Element
Race
Boss
search
Name:
Size:
All
Small
Medium
Large
Element:
All
Wind
Earth
Water
Fire
Neutral
Holy
Shadow
Ghost
Undead
Poison
Race:
All
Plant
Brute
Insect
Fish
Demon
Undead
Demi Human
Formless
Dragon
Advance Search
Name
Level
Size
Element
Race
HP
Data from :
http://gamefever.co/2018/11/15/ragnarok-m-ข้อมูลมอนสเตอร์/


First Name : Initials : SurName : Company : Age Group : 10-20 20-30 30-40 40-50 50+ Position : Date Joined : Title : Group : Technical Management Human Resources Marketing Notes :


.col-xs-6 .col-sm-3 Resize your viewport or check it out on your phone for an example..col-xs-6 .col-sm-3 Resize your viewport or check it out on your phone for an example..col-xs-6 .col-sm-3 Resize your viewport or check it out on your phone for an example.
.col-xs-6 .col-sm-3 Resize your viewport or check it out on your phone for an example..col-xs-6 .col-sm-3 Resize your viewport or check it out on your phone for an example..col-xs-6 .col-sm-3 Resize your viewport or check it out on your phone for an example.
html5
css3
javascript
php
linux
office
bootstrap
jquery
temp1
temp2
temp3
temp4
html5
css3
javascript
php


Why Pants?
Supports Multiple Languages
Pants supports Java, Scala, Python, C/C++, Go, Javascript/Node, Thrift, Protobuf and Android code. Adding support for other languages, frameworks and code generators is straightforward.
Designed for large codebases
Pants is a build system designed for codebases that: are large and/or growing rapidly, consist of many subprojects that share a significant amount of code, have complex dependencies on third-party libraries, use a variety of languages, code generators and frameworks.
Helps you organize your code
Increases code reuse. Allows easy collaboration between many authors. Encourages a cohesive codebase where problems are refactored - not worked around. Simplifies dependency management within the codebase. All of the code you run with is visible at a single commit in the repo.


--- layout: post title: Capistrano 2.2.0 Preview post_id: 67 categories: - announcements date: 2008-02-22 21:30:00.000000000 -07:00 author: Jamis permalink: 2008/2/22/capistrano-2-2-0-preview.html ---
Alright, I’m almost ready to unleash this monster on the world, but I’d like a few brave souls to kick the tires. Especially, if you use git or bzr with Capistrano, you might want to give this new version a spin, since it includes a few changes to those SCM modules.
Grab the latest beta gem thus:
gem install --source http://gems.rubyonrails.org capistrano
The significant changes in this release:
FEATURE: Thanks to James Duncan Davidson, Cap 2.2.0 will sport an additional way to define roles. If you have servers that overlap roles, this can DRY things up:
server "host.name", :web, :app |
FEATURE: Rob Holland submitted a patch that makes cap play more nicely with very large numbers of servers. If you had too many, cap would bog down, and you may even get errors from having too many simultaneous connections. You can now specify a :max_hosts
option, and if a task needs to operate on more than that number of servers at once, the server list will be chopped up and fed through the task in pieces.
FEATURE: David Masover gave us a way to define roles dynamically, by passing a block to the role macro:
1 2 3 |
role :app do ["host1", "host2"] end |
This means that if you have a recipe that knows the roles, but won’t know the hosts until runtime (think EC2 and such), you can more easily code for it.
GIT: The git SCM module has the following changes:
And, of course, there are quite a few other smaller changes, too. Check out the CHANGELOG for the full list.
So, kick the tires and report back. If all looks good by the middle of next week or so, we’ll see an official release.


My name is Nathan Kappel, I was born in Regina Saskatchewan and moved to Saskatoon when I was only 3. Ever since I was little, I was always a very curious person. My parents tell me about all the times where I would not listen to what they told me, because I would just have to go try it for myself before I would believe them. I find this funny because still to this day I find myself so interested in so many things, just observing my surroundings and trying to involve myself as much as I can is how I handle the curiosity ive had from such a young age. This is just one of the many traits I have that make me the man I am today.
I have played competitive baseball and football ever since I can remember. Sports have played a huge part of my life, helping me understand the true meaning of both teamwork and friendship. For baseball I have won three provincial title, attended 3 national championships and two western championships. With football, my career ended after high school, I suffered many injuries while playing, so with my health in mind I decided to pursue baseball instead. I still find plenty of joy in watching those sports as well, cheering for the Red Sox, Patriots, Bruins, and Celtics.
Ever since I was old enough to work a job, the lake has been a place for me to unwind and relax. My last four summers have consisted of working 50-60 hours monday to friday with the lake acting like the reward at the end of each week. I am so lucky and grateful to have friends support this "Work hard, Play hard" kind of life. Working hard throughout the week and then spending time away from the city with your closest friends and family is truly how I want to live the rest of my life.
Technology has always been the topic that intrigues my interest the most. Some of the areas that I enjoy learning and reading about are Hardware, AI, Machine learning, Quantum computing, IOT, Security, and Data Science. I spend hours each day reading articles on how each of these fields are advancing and changing our day-to-day lives. Some of my favourite books on these topics are Life 3.0 Being human in the age of artifical intelligence by Max Tegmark and Permanent Record by Edward Snowden. These writers have had extremely successful careers within the industry and by reading there books, My view on technology and the power of it has changed juridically.


Home
About
Submit A Hack
Contact
E-mail:
Name:
Pick a category!
Study
Work
Cooking
Make-up
Decor
Sports
Health
DIY
Tip:
Share your tip!


Get the CDN link for this example.
Additional note: You may not see the borders around the images depending on the browser.


Preparation time
less than 30 mins
Cooking time
1 to 2 hours
Serves
Serves 6-8
Jo Pratt’s spicy chilli con carne is a one-pot wonder: easy to throw together using mostly storecupboard ingredients.
Heat the oil in a large, heavy-based saucepan with a lid and fry the onion and garlic until softened. Increase the heat and add the mince, cooking quickly until browned and breaking down any chunks of meat with a wooden spoon.
Pour in the red wine and boil for 2-3 minutes.
Stir in the tinned tomatoes, tomato purée, fresh chilli or chilli flakes, cumin, coriander, cinnamon, and Worcestershire sauce and crumble in the stock cube. Season well with salt and freshly ground black pepper. Bring to a simmer, cover with a lid and cook over a gentle heat for about 50 minutes to 1 hour, stirring occasionally until the mixture is rich and thickened.
Add the kidney beans and fresh coriander. Cook for a further ten minutes, uncovered, before removing from the heat, adding any extra seasoning if necessary. Serve with rice, guacamole, sour cream and a big green salad.
You need JavaScript to view this clip.
How to brown mince


Video: Ajax and Heracles stage classy on-pitch protest against racism
by Mark BrusAjax and Heracles staged a classy on-pitch protest at the start of their game yesterday.
Watch the video below as the two clubs took a stand against racism by not kicking the ball for the first minute of their match.
This follows recent racist chanting towards Excelsior’s Ahmad Mendes Moreira, and it’s nice to see other Dutch clubs stand with him in solidarity.
There is no place for racism in football or society as a whole, and it would be nice if more clubs could stage protests like this and do what they can to encourage FIFA and UEFA to take stronger action against teams whose fans are guilty of xenophobic chanting.


Vis.js is a dynamic, browser based visualization library. The library is designed to be easy to use, to handle large amounts of dynamic data, and to enable manipulation of and interaction with the data. The library consists of the components DataSet, Timeline, and Graph.
The vis.js library is developed by Almende B.V, as part of the CHAP.
npm install vis
bower install vis
A basic example demonstrating how to use the vis.js timeline is shown below. See the gallery below for more examples.
<!doctype html>   <title>Timeline | Basic demo</title>  <link href="http://visjs.org/dist/vis.css" rel="stylesheet" type="text/css" />

The timeline from vis.js displays different types of data on a timeline.
The graph from vis.js visualizes graphs and networks with customizable styles.
Documentation is available here: Documentation
Copyright (C) 2010-2014 Almende B.V.
Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.


The following example shows how Angular Expressions are evaluated against a scope object.
Angular expressions do not have access to global variables like window, document or location.


User :{{users.login}}
Followers :{{users.followers}}
Following :{{users.following}}
Repo name: {{repo.full_name}}
Description: {{repo.description}}


This app allows you to write, paint, draw whatever you can think of. With multiple colors to choose from.
Say you want to save your creation by taking a picture of it. No problem, just click the frame in the top right corner and take a screenshot without the bottom bar blocking your way.
Inspired to paint then make a masterpiece. You have the tools at your disposal.
Play with multiple setting to get the perfect color, stroke thickness, and translucency.


welcome to exhale
our mission is to help you relax and de-stress with deep breathing and mindfulness techniques
start here!about us
do you often feel stressed and anxious? look no further than exhale, your all-in-one solution to deep breathing and mindfulness!
take me there!


Baochun Bai, Li Cheng, Cheng Lei, Pierre Boulanger, Janelle Harms
(2009).
Learning-based multiview video coding.
Proc. of the 27th Picture Coding Symposium (PCS).
Li Cheng, S. V. N. Vishwanathan
(2007).
Learning to compress images and videos.
Proceedings of the 24th international conference on Machine learning (ICML).
Tiberio Caetano, Li Cheng, Quoc Le, Alex Smola
(2007).
Learning Graph Matching.
IEEE International Conference on Computer Vision (ICCV).
Li Cheng, Feng Jiao, Dale Schuurmans, Shaojun Wang
(2005).
Variational Bayesian image modelling.
Proceedings of the 22nd international conference on Machine learning (ICML).


I have experience with more than 25 different drugs and that's no exaggeration. Everything from the popular weed/shrooms/ecstasy/acid/coke to exotics like 5-meo-amt/amt/amanitas/salvia/5-meo-dipt etc etc etc. and oh yeah, extensive experience with all kinds of pharmaceuticals. Basically, I've tried most all.
Anyhow, that's all in my past. or at least it was. Recently at work I've been extremely stressed out to the max. I do technical support over the phone for a major satellite tv provider. more specific information isn't necessary/safe for me to disclose. I have worked there for years and do among the best job out of all 800+ employees at my site alone. the money is superb but the stress had been really getting to me.
my mission to solve this? Find a pharmaceutical that would make the job easier going and more bearable if not even fun, perhaps. I recalled very much liking the relaxed feeling I would get from such medications as valium or xanax, so I gave those a try. Not really what I was looking for. Seemed to make the day go on forever and ever and just made me feel depressed (duh, they're depressants). I knew from my past that oxycontin would be perfect for taking at work, but not only is it hard to get a steady supply, but it's also extremely expensive! I basically lost all contacts for any other pharmaceuticals since I had quit all drugs some years ago so I was almost to the point of giving up.
Then I realized how one could easily purchase prescription drugs online. Now, most of these online pharmacies charged ridiculous prices among other things. I researched drugs that were so regulated by the FDA that they required a prescription but not regulated enough by the DEA to be really so-called 'illegal'.
 After doing research on these pharmaceuticals I first got an online prescription for Soma and thought it would do me good. Generic soma at a decent price and free overnight delivery. Yippee! well, didn't really care for them. Then I tried tramadol, and here is my experiences in a nutshell.
I pop 4 50mg pills everyday 30 minutes before I leave for work and have been doing this for 2 months now. my performance at work has never been better and both customers and coworkers have wonderful conversations with me all the time at work. Effects last full strength for at -least- 6 to 8 hours off 4 pills and that's no joke. Effects include itching all over the body (like opiates), general sense of feeling great and in a caring, uplifting mood. I also feel sped-up quite a bit, like I'm tweaking a little. I feel without a worry in the world, really. just -really- in a great mood and a very great body/head/mind high like oxycontin but somehow a little differen very very enjoyable.
Now, I never ake this stuff when I'm not going into work. There’s good reason for this. For 1, I'm not a full-fledged druggy anymore. For 2, that would mean I'd have to buy another 100 pills a lot more often than every 30 days, which would arouse much suspicion from online pharmacists.
I have toyed around with popping a little bit of hydrocodone with it at work. I popped 1/2 a 7.5mg hydro when my shift started and the other 1/2 in the middle of my shift. the whole day I felt like I popped a couple oxy 80's and that's no lie. It was extremely intense, extremely euphoric, extremely enjoyable. It was just insane. Almost like rolling on ecstasy.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


CalendarViewController
Undocumented
-
Delegate
Declaration
Swift
var delegate: CalendarViewControllerProtocol?
-
Date
Declaration
Swift
var date: Date = Date()
-
Calendar view
Declaration
Swift
lazy var calendar: FSCalendar =
-
Undocumented
-
Layout setup
Declaration
Swift
func customInit()
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented


ENTER YOUR TEXT BELOW
{% csrf_token%}
Select only one option to get the desired results
Remove Punctuation
Count Charcters
Remove Extra Spaces
Capitalize first letter
Capitalize whole paragraph
Submit Text


STRING is a database of known and predicted protein-protein interactions. The interactions include direct (physical) and indirect (functional) associations; they stem from computational prediction, from knowledge transfer between organisms, and from interactions aggregated from other (primary) databases.
Source: Extract from STRING's About page [2019/03/09]
This plugin was not developed by the STRING team. STRING neither supports nor endorses this work. References to STRING in this plugin are meant only to credit the source of data.
Example queries: 'TP53', 'EGFR TP53'


are you hungry?
what is foodease?
click to learn more!
pick your destination
City of London, England


With Specio, you can explore the tree of life, from the kingdoms down to the species. Specio provides you with information and images about different groups of organisms and their evolutionary relationships.
Starting with the root of all Life on Earth and moving out along diverging branches to individual species, the structure of the tree of life illustrates the genetic connections between all living things. For each group and species, you can find information and pictures coming from the Wikipedia database, ensuring extensiveness and completeness. There are seven ranks in the tree of life: kingdom, phylum, class, order, family, genus, species. Additionally, Domain, which is a level above kingdom, has become popular in recent years. For more information, consult Wikipedia.
Here are some good examples of familiar species to help you familiarize with the tree. Try finding them in the tree!


v2.63 1 March 2017
DRIP Fixed Income is a collection of Java libraries for Instrument/Trading Conventions, Treasury Futures/Options, Funding/Forward/Overnight Curves, Multi-Curve Construction/Valuation, Collateral Valuation and XVA Metric Generation, Calibration and Hedge Attributions, Statistical Curve Construction, Bond RV Metrics, Stochastic Evolution and Option Pricing, Interest Rate Dynamics and Option Pricing, LMM Extensions/Calibrations/Greeks, Algorithmic Differentiation, and Asset Backed Models and Analytics.
DRIP Fixed Income is composed of the following main libraries:
- Instrument/Trading Conventions Library
- Treasury Futures/Options Library
- Funding/Forward/Overnight Curve Library
- Multi-Curve Construction/Valuation Library
- Collateral and XVA Metrics Library
- Position Horizon Analyzer Library
- Statistical Curve Construction Library
- Bond RV Metrics Library
- Stochastic Evolution and Option Pricing Library
- Interest Dynamics and Option Pricing Library
- LMM Extensions, Calibration, and Greeks Library
- Algorithmic Differentiation Library
- Asset Backed Model Library
For Installation, Documentation and Samples, and the associated supporting Numerical Libraries please check out DRIP.
DRIP Core Technical Specifications
DRIP Supporting Technical Specifications
Additional Documentation
Samples (Bonds/Asset Backed)
Samples (Curve/Surface Construction)
Samples (Rates Products Valuation)
Samples (Treasury Bond/Futures)
Samples (Interest Rate Options)
Samples (Stochastic Volatility Pricing)
Samples (Automatic Differentiation Sensitivity)
Samples (Credit Products/Curves)
Samples (XVA Metrics Estimation)
Features
Instrument/Trading Conventions Library
Associations and Exchanges
Date Conventions
- Day Count Conventions
- Business Day Conventions
Overnight and IBOR-like Indexes
- IBOR Indexes - Introduction
- Main IBOR Indices
- Other IBOR Indices
- Overnight Index Definitions
- Overnight Index Committees and Meeting Dates
Over the Counter Instruments
- Forward Rate Agreement
- Interest Rate Swaps
- Vanilla IRS
- Interest Rate Swaps (Basis Swaps: IBORfor IBOR)
- Cross Currency Swaps (IBOR for IBOR)
- Constant Maturity Swaps
- Swap Indexes
- Overnight Indexed Swaps
- Swap Option
- Forex and Forward Swaps
Exchange Traded Instruments
- Overnight Futures
- Short-Term Interest Rate Futures (STIR Futures)
- Currency Specific Futures
- Interest Rate Futures Option - Premium
- Interest Rate Futures Option - Margin
- Bank Bill Futures - AUD Style
- Deliverable Swap (IRS) Futures (PV Quoted)
- Bond Futures (non AUD/NZD)
- Country Specific Bond Futures - USD
- Country Specific Bond Futures - Germany
- Country Specific Bond Futures - Spain
- Country Specific Bond Futures - UK
- Country Specific Bond Futures - Japan
- Options on Bond Futures (non AUD/NZD) - Premium
- Options on Bond Futures (non AUD/NZD) - Margin
- AUD-NZD Bond Futures
Treasury Futures/Options Library
Treasury Futures Trading and Hedging
- Contract Detail Specifications
Identification of the CTD in the Basket
- The Conversion Factor
- Old vs. Active Treasury
- Market Parameters Influencing the CTD Calculation
- Impact of Yield Curve Changes
Valuation of Treasury Futures Contract
- Futures Contract and Mark-To-Market
- Role of the Clearing Corporation
- Delivery Options for the Underlying
- Implied Basis for the Futures
- Net Basis For Treasury Futures
Funding/Forward/Overnight Curve Library
Curve Builder Features
Curve Construction Methodology
- Approach
- State Span Design Components
- Curve Calibration From Instruments/Quotes
- Calibration Considerations
Curve Construction Formulation
- Segment Linear Discount Curve Calibration
- Curve Jacobian
Stream Based Calibration
- Latent State Formulation Metric (LSFM)
- Stream Inference Setup
- Coupon Period Based Calibration Specification
- Stream Based Calibration Specification
- Calibration of Multi-Stream Components
Spaning Splines
- Setup and Formulation
- Challenges with the Spanning Spline Approach
Monotone Descreasing Splines
- Exponential Rational Basis Spline
- Exponential Mixture Basis Set
Hagan-West (2006) Smoothness Preserving Spanning Spline
- Monotone/Convexity Preserving Estimator
- Positivity Preserving
- Ameliorating Estimator
- Harmonic Spline Extension to the Framework above
- Minimal Quadratic Estimator
Extrapolation in Curve Construction
Multi-Pass Curve Construction
- Bear-Sterns Multi-Pass Curve Building Techniques
Transition Spline (Or Stitching Spline)
- Stretch Modeling using Transition Splines
- Stretch Partition/Isolation in Transition Splines
- Knot Insertion vs. Transition Splines
- Overlapping Stretches
Penalizing Exact/Closeness of Fit and Curvature Penalty
Index/Tenor Basis Swaps
- Component Layout and Motivation
- Formulation
Multi-Stretch Merged Curve Construction
- Merge Stretch Calibration
Latent State Manifest Measure Sensitivity
- Float-Float Manifest Measure Sensitivities
- Multi-reset Floating Period
OIS Valuation and Curve Construction
- Base Framework and Environment Setup
- OIS Valuation Extensions and Approximations
- OIS-FX Basis Swap Valuation and Approximations
- Arithmetic Accrual Convexity Correction
- Composed Period Latent State Loadings
Spline Based Credit Curve Calibration
Multi-Curve Construction/Valuation Library
Correlated Multi-Curve Build-out
- Standard FRA Setup
- Standard FRA Options
- No arbitrage and Counter-party Risk Based Standard FRA Formulation
- Market FRA Setup
- Futures
- Multi-Curve Swap Valuation
Cross Currency Basis Swap
- Product Details and Valuation
- Building the CCS Discount Curve
- Custom CCBS Based Curve Construction SKU
- Mark-To-Market Cross-Currency Swap Valuation
- Mark-To-Market Cross-Currency Swap - Valuation Formulation
- Absolute/Relative MTM Application
- Per-Trade Risk Isolation Components
Collateral and XVA Metrics Library
Collateral Agreements and Derivatives Valuation
- Two Collateralized Assets
- Setup pf the Collateral Curve Dynamics
- Collateralized Black-Scholes Formulation
- Collateralization and Funding Derivative Valuation
- Collateral PDE Formulation
- Formward Contract Valuation
- European Style Options
- Cross-Currency Model
- Collateral Choice Model
CVA and Funding Adjustments PDE
- Counterparty Risk and Funding Costs
- Notation, Symbology, and Key PDE's
- Model Setup and the Derivation of the Bilateral Risky PDE
- Using VHat (T, S) and Mark-To-Market at Default
- Using V (T, S) and Mark-To-Market at Default
- Funding and Default Payoff Examples
- Counter-party Funding and PDE Extensions
- Balance Sheet and Funding Cost Management
- Unified Framework for Bilateral Counterpart Risk and Funding Adjustments
- Simple Model for the Impact of Derivative Asset on Balance Sheet and Funding
- Balance Sheet Management to Mitigate Funding Costs
- Funding Strategies and Costs Impact
- Generalized Semi-replication and Pricing PDE
- Semi-replication
- Examples of Different Bond Portfolios
- The Perfect Replication - FCA Vanishes
- Semi-replication with no Shortfall at own Default
- Set-offs
- Semi-replication with a Single Bond
- Burgard and Kjaer (2013) Case Study
Accounting for OTC Derivatives: Funding Adjustments and Re-hypothecation Option
- Status of Currenct FCA/FBA Accounting
- Comaprison between FCA/FBA and FVA/FDA
- OTC vs. Repo Markets
- Modus Operandi of Funding Desks
- MTM and the Asset Liability Symmetry
- Rigorous Framework for Funding Costs
- Funding Set VM RHO Computation
- Shortcomings of Traditional CVA Systems
- Addressing the Shortcomings of FCA/FBA Accounting
- Valuation Adjustment Estimation Framework Setup
- OTC Bookds Funding Set Decomposition
- Inconsistent Booking under the FCA/FBA
- Improvements Offered by the FVA/FDA Accounting
- CET1 Deductions
- "Going Concern" or Defaulable Banks
- Cash Flow Streams Categorization
- Accounting Rules
- Contra-Asset and Contra-Liability Accounting for Credit Risk
- Contra-Asset and Contra-Liability Accounting for Funding
- Accounting Cash Flow Setup Framework
- Cash Flows related to VM Funding
- Cash Flows at Counter-party Default
- Cash Flows at Bank Default
- CVA and DVA
- FVA and FDA
- FCA and FBA
- CA and CL Adjustments
- Own Credit Sensitivities
- Triggers and Close-out Adjustments
- Collateral Triggers and Close-outs
- Incorporating ISDA 1992 Close-outs
- VM Re-hypothecability across Funding Sets
- Trade and Portfolio FTP Estimation
- FTP for FCA/FBA Accounting
- FTP for FVA/FDA Accounting
- Exit Prices and Fair Valuation
- FVA/FDA Accounting
- FCA/FBA Accounting
- Liquidity Spreads, Asset Liability Symmetry, and Alternative Allocations for Excess Collateral
- Working Capital Management and Operations
- Equity Gain and Debt Gain
- Liquidity Based Analysis and Treatment
- Problems with Gain Accounting
- Albanese and Andersen (2014) Case Study
- Case Study Setting and Purpose
- Scenario Estimation of the XVA Metrics
- Product and Scenario Threshold Type Scenarios
- XVA Error Metrics and Incrementals
- Estimation ofthe FCA/FBA - FVA/FDA Mismatch
- Traditional Challenges with Derivative Accounting
- Problems with FCA/FBA Accounting
- FVA/FDA vs. FCA/FBA Enhancement
- Trading Staff Point of View
- Challenges with the XVA Metric Estimation
- Shortfalls of the FVA/FDA Scheme
- Alternate Specialized Value Metrics
Position Horizon Analyzer Library
Convexity Corrections Associated with Margining
Hedging Considerations
Product Curve Effect Attribution
- Market Value Change Explain Components
- Coupon Accrual Intrinsic
- Market Parameters Intrinsic
- Market Parameters Extrinsic
- Market Value Change Effects Formulation
Statistical Curve Construction Library
Inference Based Curve Construction
- Curve Smoothing in Finance
- Bayesian Curve Calibration
- Sequential Curve Estimation
Bond RV Metrics Library
- The Bond RV Measure Set
- Asset Swap Spread
- Bond Basis
- Convexity
- Credit Basis
- Discount Margin
- Duration
- DV01
- G Spread
- I Spread
- Macaulay Duration
- Modified Duration
- Option Adjusted Spread
- Par Asset Swap Spread
- Par Spread
- Par Equivalent CDS Spread (PECS)
- Price
- Spread Over Treasury Benchmark
- Yield
- Yield Basis
- Yield Spread
- Yield01
- Zero Discount Margin (ZDM)
- Z Spread
- Relative Value Cross-Metric Grid
- Basic Measures
Stochastic Evolution and Option Pricing Library
Stochastic Calculus
- Single-Factor Stochastic Calculus
- Multi-Factor Stochastic Calculus
- Risk Neutral Pricing Framework
Black Scholes Methodology
- The Replication Technique
- Capital Asset Pricing Model
- Multi-numeraire Formulation
- First Order Log-normal Black Scholes Greeks
- Second Order Log-normal Black Scholes Greeks
- Third Order Log-normal Black Scholes Greeks
- Time-Dependent Black Scholes
- Local Volatility Models
- Black Normal Model Specification and Dynamics
- Options on Forward
- The Black76 Model
Stochastic Volatility Models: The Heston Model
- Model Specification and Dynamics
- Price Estimation Through Characteristic Functions
- Fourier Inversion in Characteristic Function
Dynamical Latent State Calibration
- Fokker-Planck Equations
- Volatility Observations vs. Calibrations
Interest Rate Dynamics and Option Pricing Library
HJM Model
- Formulation
- Hull-White from HJM
- G2++ - A 2-Factor HJM Model
- HJM to LMM
- HJM PCA
Hull-White Model
- Short-Rate Formulation
- Hull-White Trinomial Tree
- Construction of the Symmetric Trinomial Tree
- Displacing the Nodes of the Trinomial Tree
Market Model fo Interest Rate Dynamics
- Nomenclature and Notation
- The BGM Model
- LIBOR Rate Dynamics
- Relation to the HJM Dynamics
- Existence, Uniqueness, and Regularity of the LIBOR Dynamics Solution
- Upper/Lower Bounds for the LIBOR Rate
- Invariant Measure for the LIBOR Rate
- BGM Cap/Floor Pricing
- Payer Swap Option Pricing
- Payer Swap Option Pricing Simplification
- Mismatched Periods Cap/Swaption Pricing
- Approximate vs. Full Simulation Comparisons
- Typical Model Calibration Results
The SABR Model
LMM Extensions, Calibration, and Greeks Library
LMM Calibration and Greeks Overview
- Robust LMM Calibration Approaches Overview
- Cross-Currency LIBOR Market Model
- LMM Based Greeks Calculation Approaches
- Major Extensions to LMM
- Hedging the Derivatives Cash Flow
- LMM Skew and its Calibration
- LMM Smile and its Calibration
- Cross-Currency Extensions to LMM
- LMM Monte-Carlo Methods and Greeks
- Numerical Methods for LMM Calibration
Algorithmic Differentiation Library
- Algorithmic Differentiation in Finance
- Program Sequence Construction Modes
- Canonicalization - Program Statements Simplification by Decomposition
- Challenges of Automating the Differentiation
- Wengert Representation and Optimal Program Structure Synthesis
- Optimization using Pre-accumulation and Check-Pointing
- Algorithmic Differentiation Financial Application Space Customization
- Sensitivity Generation During Curve Construction
- Curve Jacobian
- Stochastic Entity Evolution - Sensitivity Formulation
- Sensitivities to Stochastic State Variates and Dynamical Parameters
- State Variate Evolution Constrained by Splines
- Formulation of the Evolution of the Stochastic Variate Self-Jacbian
- Correlated Stochastic Variates Evolution
- LMM Forward Rate Evolution
- Formulation of the Pay-off Function Stochastic Evolution
- Path Greeks
- Pay-off Sensitivity to the Correlation Matrix
- Algorithmic Differentiation in Pay-off Sensitivities Calculation
- Bermudan Swap Option Sensitivities Formulation
- Bermudan Swap Option Sensitivites Greek Estimation
- LSM Methodology
- NTD Basket Sensitivities Product Formulation
- Basket Options
Asset Backed Model Library
- Overview of the Credit Model Methodology
- Scope of the Model
- Data Model Construction Rules
- Loan Data Quality Rules
- Lending Club Loan Level Data
- Loan Credit Model Implementation
- Credit Model Selection Methodology
- Regressor Contribution Weights
- Empirical Analysis of Seasoning Effects
- Analysis of the Vintage/Cohort Effects
- Analysis of the Empirical Seasonality Effects
- CPR and CDR Curve Estimation
- Credit Model Enhancements
Contact
lakshmi@synergicdesign.com


|
.NET Framework | |||||||||
| PREV TYPE NEXT TYPE | FRAMES NO FRAMES | |||||||||
| SUMMARY: INNER | FIELD | CONST | PROP | METHOD | OP | EVENT | DETAIL: FIELD | CONST | PROP | METHOD | OP | EVENT |
This interface describes a character stream that maintains line and column number positions of the characters. It also has the capability to backup the stream to some extent. An implementation of this interface is used in the TokenManager implementation generated by JavaCCParser. All the methods except backup can be implemented in any fashion. backup needs to be implemented correctly for the correct operation of the lexer. Rest of the methods are all used to get information like line number, column number and the String that constitutes a token and are not used by the lexer. Hence their implementation won't affect the generated lexer's operation.
| Property Summary | |
|---|---|
| int | BeginColumn |
| int | BeginLine |
| int | Column |
| int | EndColumn |
| int | EndLine |
| int | Line |
| Method Summary | |
|---|---|
| void |
backup(int amount) Returns the column position of the character last read. Returns the line number of the character last read. Returns the column number of the last character for current token (being matched after the last call to BeginTOken). Returns the line number of the last character for current token (being matched after the last call to BeginTOken). Returns the column number of the first character for current token (being matched after the last call to BeginTOken). Returns the line number of the first character for current token (being matched after the last call to BeginTOken). Backs up the input stream by amount steps. Lexer calls this method if it had already read some characters, but could not use them to match a (longer) token. So, they will be used again as the prefix of the next token and it is the implemetation's responsibility to do this right. |
| char |
BeginToken() Returns the next character that marks the beginning of the next token. All characters must remain in the buffer between two successive calls to this method to implement backup correctly. |
| void |
Done() The lexer calls this function to indicate that it is done with the stream and hence implementations can free any resources held by this class. Again, the body of this function can be just empty and it will not affect the lexer's operation. |
| string |
GetImage() Returns a string made up of characters from the marked token beginning to the current buffer position. Implementations have the choice of returning anything that they want to. For example, for efficiency, one might decide to just return null, which is a valid implementation. |
| char[] |
GetSuffix(int len) Returns an array of characters that make up the suffix of length 'len' for the currently matched token. This is used to build up the matched string for use in actions in the case of MORE. A simple and inefficient implementation of this is as follows : { String t = GetImage(); return t.substring(t.length() - len, t.length()).toCharArray(); } |
| char |
readChar() Returns the next character from the selected input. The method of selecting the input is the responsibility of the class implementing this interface. Can throw any java.io.IOException. |
| Property Detail |
|---|
public int BeginColumn
public int BeginLine
public int Column
public int EndColumn
public int EndLine
public int Line
| Method Detail |
|---|
public void backup(int amount)
Returns the column position of the character last read. Returns the line number of the character last read. Returns the column number of the last character for current token (being matched after the last call to BeginTOken). Returns the line number of the last character for current token (being matched after the last call to BeginTOken). Returns the column number of the first character for current token (being matched after the last call to BeginTOken). Returns the line number of the first character for current token (being matched after the last call to BeginTOken). Backs up the input stream by amount steps. Lexer calls this method if it had already read some characters, but could not use them to match a (longer) token. So, they will be used again as the prefix of the next token and it is the implemetation's responsibility to do this right.
public char BeginToken()
Returns the next character that marks the beginning of the next token. All characters must remain in the buffer between two successive calls to this method to implement backup correctly.
public void Done()
The lexer calls this function to indicate that it is done with the stream and hence implementations can free any resources held by this class. Again, the body of this function can be just empty and it will not affect the lexer's operation.
public string GetImage()
Returns a string made up of characters from the marked token beginning to the current buffer position. Implementations have the choice of returning anything that they want to. For example, for efficiency, one might decide to just return null, which is a valid implementation.
public char[] GetSuffix(int len)
Returns an array of characters that make up the suffix of length 'len' for the currently matched token. This is used to build up the matched string for use in actions in the case of MORE. A simple and inefficient implementation of this is as follows : { String t = GetImage(); return t.substring(t.length() - len, t.length()).toCharArray(); }
public char readChar()
Returns the next character from the selected input. The method of selecting the input is the responsibility of the class implementing this interface. Can throw any java.io.IOException.
|
.NET Framework | |||||||||
| PREV TYPE NEXT TYPE | FRAMES NO FRAMES | |||||||||
| SUMMARY: INNER | FIELD | CONST | PROP | METHOD | OP | EVENT | DETAIL: FIELD | CONST | PROP | METHOD | OP | EVENT |


--- layout: post title: A json-rpc implementation in C++ date: 2014-11-17 13:15:41.000000000 -08:00 type: post published: true status: publish categories: - Programming tags: [] meta: _publicize_pending: '1' _edit_last: '53481042' geo_public: '0' author: login: allenbo email<EMAIL_ADDRESS>display_name: allenbo first_name: '' last_name: '' ---
Recently I developed an rpc library in C++ based on json formatted communication. The code is on github.
This implementation is just another toy project I did due to boring engineer life at bay area and it doesn't guarantee any stability for your significant and serious work. But if you happen to be interested in rpc protocol and wonder how it works, you may want to check it out and play with it.
My json-rpc will need you to write an spec file, in json format, to generate a stub file, which needs you to fill up the functions, or shall we call it services, and then compile to binary. You need to specify the name of your service, the serializable classes and the services. After you finish the spec file, you could use that little program under bin/ to generate the stub file. You can find more details on github.
Then the only thing you need to do is fill up those functions you want the server to support. Please notice the rpc implementation itself doesn't protect your functions in multiply threaded mode. If there is some critical area you need to protect, you have to do that on your own in generated service class.
Anyway, have fun with json-rpc.


*** User 2017-05-05 19:58:43.084 ***
19:58:43.084 [info] Disabling blocking sync...
*** User 2017-05-05 19:58:43.088 ***
19:58:43.088 [info] Configured peer_service_manager partisan_default_peer_service_manager on node 'node-1@MacBook-Pro-de-Anne-France'
*** User 2017-05-05 19:58:44.591 ***
19:58:44.590 [info] Enabling membership...
*** User 2017-05-05 19:58:44.592 ***
19:58:44.592 [info] Disabling blocking sync...
*** User 2017-05-05 19:58:44.597 ***
19:58:44.597 [info] Configured peer_service_manager partisan_default_peer_service_manager on node 'node-2@MacBook-Pro-de-Anne-France'
*** User 2017-05-05 19:58:46.136 ***
19:58:46.136 [info] Enabling membership...
*** User 2017-05-05 19:58:46.137 ***
19:58:46.137 [info] Disabling blocking sync...
*** User 2017-05-05 19:58:46.142 ***
19:58:46.142 [info] Configured peer_service_manager partisan_default_peer_service_manager on node 'node-3@MacBook-Pro-de-Anne-France'
*** User 2017-05-05 19:58:46.415 ***
Joining node: 'node-3@MacBook-Pro-de-Anne-France' to 'runner@MacBook-Pro-de-Anne-France' at port 56180
*** User 2017-05-05 19:58:46.416 ***
Joining issued: 'node-3@MacBook-Pro-de-Anne-France' to 'runner@MacBook-Pro-de-Anne-France' at port 56180
*** User 2017-05-05 19:58:46.416 ***
Joining node: 'node-2@MacBook-Pro-de-Anne-France' to 'runner@MacBook-Pro-de-Anne-France' at port 56163
*** User 2017-05-05 19:58:46.417 ***
Joining issued: 'node-2@MacBook-Pro-de-Anne-France' to 'runner@MacBook-Pro-de-Anne-France' at port 56163
*** User 2017-05-05 19:58:46.418 ***
Joining node: 'node-1@MacBook-Pro-de-Anne-France' to 'runner@MacBook-Pro-de-Anne-France' at port 56151
*** User 2017-05-05 19:58:46.419 ***
Joining issued: 'node-1@MacBook-Pro-de-Anne-France' to 'runner@MacBook-Pro-de-Anne-France' at port 56151
*** User 2017-05-05 19:58:46.480 ***
Waiting for join to complete with manager: partisan_default_peer_service_manager
*** User 2017-05-05 19:58:46.481 ***
Finished.
*** CT 2017-05-05 19:58:46.481 *** COVER INFO
Adding nodes to cover test: ['runner@MacBook-Pro-de-Anne-France']
*** CT 2017-05-05 19:58:46.490 *** COVER INFO
Successfully added nodes to cover test: []
*** User 2017-05-05 19:58:46.490 ***
Manager: partisan_default_peer_service_manager
*** User 2017-05-05 19:58:46.490 ***
19:58:46.490 [info] Nodes: ['runner@MacBook-Pro-de-Anne-France','node-3@MacBook-Pro-de-Anne-France','node-2@MacBook-Pro-de-Anne-France','node-1@MacBook-Pro-de-Anne-France']
*** User 2017-05-05 19:58:46.490 ***
19:58:46.490 [info] Waiting for cluster to stabilize.
*** User 2017-05-05 19:58:56.493 ***
Case finished: membership_test
*** User 2017-05-05 19:59:03.547 ***
19:59:03.547 [info] Application lasp exited with reason: stopped
*** User 2017-05-05 19:59:03.548 ***
19:59:03.548 [info] Application partisan exited with reason: stopped
=== Ended at 2017-05-05 19:59:03
=== successfully completed test case
=== Returned value: ok
Test run history
| Top level test index


Interoperability
With the number of deployments of the server, we can say with confidence that the server is interoperable with the widest possible range of devices and operating systems. In addition, we follow all available (and lead) RFC's and SDO specifications.
Given the Open Source nature of the server, most vendors test their products with FreeRADIUS before shipping them to their customers. This practice is recommended, as there are well over 50,000 deployments of the server. It is very likely, therefore, that customer using FreeRADIUS will buy vendor equipment. If the equipment is not interoperable with FreeRADIUS, then those sales will be lost.
There have been a number of cases in the past where a particular vendor's product did not interoperate with the server.
We recognize that there may be bugs in the server. However, given the in-depth testing that the server receives before every release, those bugs tend to be found quickly, and therefore short-lived.


--- layout: post title: Punctuated equilibrium for tapping? date: 2006-05-26 00:00:00 categories: interfaces-&-interaction mobile ---
Does this indicate punctuated equilibrium for tapping? The Nokia 5500 "...uses the built-in sensor to control some of the phone functions by… tapping. For example to skip to the next song just tap it twice on the right side. To listen the previous song, tap it twice on the left side. No need for dedicated buttons."
And at the same time, FP JackJack sends me this lovely video of tilt sensors tied into Exposé.


{% extends 'staticpages/navbar.html' %} {% load staticfiles %} {% block content %} {% load quiz_tags %} {% load i18n %} {% block page_title %}
Exam title: {{ quiz.title }}
You answered {{ score }} questions correctly out of {{ max_score }}, giving you {{ percent }} percent correct.
Progress:
Review the questions below and try the exam again in the future.
The previous question:
{{ previous.previous_question }}
Your answer was {{ previous.previous_answer }} which is {{ previous.previous_outcome }}
Explanation:
{{ previous.previous_question.explanation }}
{{ question.content }}
{% correct_answer_for_all_with_users_incorrect question incorrect_questions %} {% endfor %} {% else %}You have already seen answers after each question so we are not displaying them again here.
{% endif %} {% endblock %} {% endblock %}


SMTP Relays are third-party services you can hand off the responsability of getting the mail delivered. They can be useful when, for example, port 25 is blocked.
Here, you can configure an authenticated SMTP relay (for example, SendGrid) over port 587.


Someone Please Make This Phone I'm Begging You
These are the simple things I want in a phone.  Believe it or not I actually DO want to be able to reach the top of the screen
- 120Hz refresh rate
- OLED or AMOLED
- 1080p or somethin close.  Put a small bezel on the top with the camera (one, not two or three) in it
- Oh look, there's a bezel in the top due to the camera. PUT THE SAME SIZED BEZEL ON THE BOTTOM.  No way man unheard of
- Woweee that's so much space! Might as well add a nice little MULTICOLORED notification light
- Buttons that need to be on the sides of the phone include:
- Individual volume buttons
- Power button with built-in fingerprint scanner
- Extra button with two-stage press, for photos. ALSO REPROGRAMMABLE
- Notification slider (more optional than anything else in this stupid list)
- Ports
- 3.5mm headphone jack (you can do it, I believe in you)
- USB-C
- Dual-Sim tray, but the 2nd sim slot can act as a micro SD card slot
- Cameras
- Main camera
- Ultrawide
- Telephoto
- That's it. THAT'S IT. STOP ADDING CAMERAS
- Cameras are FLUSH WITH THE BACK OF THE PHONE
- Various other features
- Wireless charging
- Best bluetooth that is available at the time
- At least a 4000 mAh battery with Sony's Power Sense or whatever
- Do like last year's processor or something idk. We actually don't need the fastest one anymore
- Body
- idk I'm not picky. Make it look like an old Xperia phone or something.
 USE THE EXTRA SPACE FOR BATTERY
- Glass or plastic back is fine as long as the sides are a metal of some kind.
- Front bezels need to be black.
That's it guys. For real. Really actually that's it. Not that hard.
 Make it $1000, overpriced to hell, I'd still buy it.
I'd like to ask for 3+ years of FEATURE updates, but I don't care that much anymore. I'd buy it if you never updated it again.

Go Back


"I'm looking for the unexpected. I'm looking for things I've never seen before."
SERVICES
COFFEE
Apple pie icing sweet. Brownie jelly-o applicake applicake sweet roll liquorice bear claw. Jujubes carrot cake cotton candy sweet tart brownie. Tiramisu applicake jujubes.
INSTANT
Apple pie icing sweet. Brownie jelly-o applicake applicake sweet roll liquorice bear claw. Jujubes carrot cake cotton candy sweet tart brownie. Tiramisu applicake jujubes.
SERIOUS
Apple pie icing sweet. Brownie jelly-o applicake applicake sweet roll liquorice bear claw. Jujubes carrot cake cotton candy sweet tart brownie. Tiramisu applicake jujubes.
FRAME
Apple pie icing sweet. Brownie jelly-o applicake applicake sweet roll liquorice bear claw. Jujubes carrot cake cotton candy sweet tart brownie. Tiramisu applicake jujubes.
PORTFOLIO
JUST DEFAULT SECTION
Bear claw marzipan bear claw applicake I love muffin. Lemon drops gummi bears pastry gummi bears sesame snaps I love unerdwear.com. Soufflé cotton candy dessert candy ice cream wafer gummies cheesecake brownie.
Muffin chupa chups jelly beans sweet pie applicake. Croissant chocolate cake I love pudding. Ice cream I love powder pudding apple pie marshmallow. Cupcake marzipan oat cake bonbon I love candy canes toffee.
Unerdwear cookie liquorice. Cake donut cupcake lollipop soufflé candy. Chocolate oat cake @cheesecake tootsie roll.
WHO IS JOHN DOE?
Bear claw marzipan bear claw applicake I love muffin. Lemon drops gummi bears pastry gummi bears sesame snaps I love unerdwear.com. Soufflé cotton candy dessert candy ice cream wafer gummies cheesecake brownie.
Muffin chupa chups jelly beans sweet pie applicake. Croissant chocolate cake I love pudding. Ice cream I love powder pudding apple pie marshmallow. Cupcake marzipan oat cake bonbon I love candy canes toffee.
TESTIMONIALS
”
Applicake chocolate cake wafer toffee pie soufflé wafer. Tart marshmallow wafer macaroon cheesecake jelly. Gingerbread cookie soufflé sweet roll sweet roll jelly-o.
CONTACT
Jujubes bear claw croissant wafer sweet lemon drops brownie chocolate bar. Sweet lollipop halvah tootsie roll cake fruitcake. Chocolate cake chocolate bar gingerbread lollipop tart. Jujubes bear claw donut chupa chups.
Linda Newman
W325 State Road 123
Mondovi, WI(Wisconsin) 98746-54321
(715) 946 - 1234


Next:
Discrete Univariate Distributions
, Up:
Distribution Generators
6.3.1 Continuous Univariate Distributions
DRANDBETA
: Generate a vector of variates from a Beta distribution
DRANDCAUCHY
: Generate a vector of variates from a Cauchy distribution
DRANDCHISQUARED
: Generate a vector of variates from a Chi-squared distribution
DRANDEXPONENTIAL
: Generate a vector of variates from an Exponential distribution
DRANDF
: Generate a vector of variates from an F distribution
DRANDGAMMA
: Generate a vector of variates from a Gamma distribution
DRANDGAUSSIAN
: Generate a vector of variates from a Gaussian distribution
DRANDLOGISTIC
: Generate a vector of variates from a Logistic distribution
DRANDLOGNORMAL
: Generate a vector of variates from a Log Normal distribution
DRANDSTUDENTST
: Generate a vector of variates from a Students T distribution
DRANDTRIANGULAR
: Generate a vector of variates from a Triangular distribution
DRANDUNIFORM
: Generate a vector of variates from a Uniform distribution
DRANDVONMISES
: Generate a vector of variates from a Von Mises distribution
DRANDWEIBULL
: Generate a vector of variates from a Weibull distribution


This error is optional and not enabled by default.
Problematic code:
partial_path='example'
curl "http://example.com/$partial_path_version/explain.html"
Correct code:
partial_path='example'
curl "http://example.com/${partial_path}_version/explain.html"
Rationale:
If a variable gets called, and there is a string that gets appended to the variable that could get misinterpreted as possibly part of the name of the variable. Then it will not call the right variable.
Related resources:


BuDA: A Bottom-Up Default Analysis Platform for Macrofinancial Analysis
Jorge A. Chan-Lau
Institute for Capacity and Development, International Monetary Fund Credit Research Initiative, National University of Singapore
Joint work with J.-C. Duan, W. Miao, and the Credit Research Initiative team of the National University of Singapore
International Monetary Fund March 15, 2018
Outline
◻ Conceptual framework
◻ Modeling methodology
◻ Differences with other approaches
◻ Surveillance applications
◻ Using BuDA
Part 1: Conceptual Framework
The macrofinancial challenge
◻ Analyze "What-if" macro-financial scenarios
◻ Project default risk of individual firms (financial/non-financial)
◻ Model should accommodate Big Data
The macrofinancial challenge
China: financial firms, 1-year PD distribution
Our solution
BuDA: A Bottom-Up Default Analysis Platform
Computational platform developed by Jin-Chuan Duan and Weimin Miao, National University of Singapore, and Jorge A. Chan-Lau, International Monetary Fund, with the support of the staff of the Credit Risk Initiative, Risk Management Institute, National University of Singapore
BuDA forecasting approach
BuDA forecasting approach
◻ Matlab interactive toolbox
◻ Thirty nine (39) countries
◻ 10000+ publicly listed firms
◻ Can expand to 100+ countries
Current coverage
| G-7 countries | ||||||
| Canada | France | Germany | Italy | Japan | UK | USA |
| Advanced Europe | ||||
| Austria | Belgium | Finland | Greece | Ireland |
| Luxembourg | Portugal | Spain | The Netherlands | |
| Asia | ||||
| China | Hong Kong SAR | Taiwan POC | India | Indonesia |
| Malaysia | Singapore | Thailand | The Philippines | |
| EMEA economies | ||||
| Kenya | Mauritius | Nigeria | South Africa | Turkey |
| United Arab Emirates | ||||
| Latin America and the Caribbean | ||||
| Argentina | Brazil | Chile | Colombia | Jamaica |
| Mexico | Peru | Venezuela | ||
BuDA Surveillance Applications
2016 Article IV Canada
2016 Article IV Chile
2016 Article IV Indonesia
2016 Article IV United Arab Emirates
2016 WHD Regional Economic Outlook
2017 FSAP China
2017 FSAP Japan
Japan, median 1-year PD of financial firms, scenario analysis
China, median 1-year PD of financial firms, scenario analysis
Part 2:Modeling methodology
A two step approach
◻ Use scenario variables to project risk factors
◻ Project PDs using projected risk factors
Risk factors for forecasting PDs
Part 2A:PD Modeling
Default and insolvency
◻ Default: failure to pay or deliver
◻ Insolvency: asset value < liability values
◻ Cash-flow insolvency: Liquidity-driven default
Types of default risk models
◻ Structural models, i.e. Merton-type
◻ Reduced form models, i.e. Intensity models
Reduced form models
◻ Statistical relationship between default and predictors
◻ Choice of predictors
◻ Economic intuition
◻ Data mining
◻ BuDA: Duan-Sun-Wang (DSW) forward intensity model
◻ Can model term structure of default
◻ Captures other exits
Other exits matter
DSW model (2012, J. of Econometrics)
◻ Two poisson processes
◻ Default/bankruptcy
◻ Other exits
◻ Forward intensities depend on risk factors
◻ Pseudo maximum likelihood estimation
DSW model data
◻ Sample: 1991 - present, monthly data
◻ Default events
◻ Bloomberg
◻ Corporate announcements
◻ Credit rating agencies
◻ News sources
◻ Financial data
◻ Bloomberg BackOffice
◻ Compustat
DSW model monthly calibration
◻ Calibration groups
◻ North America
◻ Europe
◻ Asia-Pacific Advanced Economies
◻ Asia-Pacific Developing Economies
◻ EM Latam, Middle East, Africa
◻ China
◻ India
DSW prediction accuracy
Part 2B:Risk factor modeling
Common risk factor
◻ Regress common risk factors on covariates and lagged values
$ \Delta X_{m,t} = \beta^{X}_{m,0} + \sum_{k=1}^{n} \beta^{X}_{m,k} Z_{k,t} + \gamma^{X}_{m,1} X_{m,t-1} + \gamma^{X}_{m,2} X_{m,t-2} + \epsilon^{X}_{m,t}$
where:
$X_m: \text{ common risk factors, } m = 1, 2$
$Z_k: \text{ } kth \text{ scenario variable}$
Firm specific risk factor
◻ Regress average industry risk factor on covariates and lagged values
$ \Delta {\bar{Y}}_{i,j,t} = \beta^{Y}_{i,j,0} + \sum_{k=1}^{n} \beta^{Y}_{i,j,k} Z_{k,t} + \gamma^{Y}_{i,j,1} {\bar{Y}}_{i,j,t-1} + \gamma^{Y}_{i,j,2} {\bar{Y}}_{i,j,t-2} + \epsilon^{Y}_{i,j,t}$
where:
$Y_{i,j}:\text{ }ith \text{ country industry average of firm specific risk factor } j$
$Z_k: \text{ } kth \text{ scenario variable}$
Risk factor regression accuracy
Firm-specific risk factor projection for individual firms
Part 3:BuDA and Moody's KMV
Issues
◻ BuDA PD < Moody's EDF (Low, medium risk firms)
◻ BuDA PD > Moody's EDF (high risk firms)
◻ Potential reasons
◻ Moody's does not model PDs
◻ Different calibration samples
◻ Moody's does not model other exits
Moody's EDF Methodology
Moody's EDF Calibration
Part 4:Surveillance Applications
2016 Article IV Chile
2016 Article IV Chile
2016 Article IV Chile
Part 5:Using BuDA
Appendix:More resources
BuDA Web Page
◻ Link: https://jchanlauimf.github.io/BuDAWeb/
◻ Check the BuDA web page for:
◻ Complete documentation on methodology
◻ Links to surveillance documents
◻ Instructions on downloading BuDA


--- layout: post title: "Github Actions" date: 2021-09-08 20:15:10 +0200 categories: jekyll update background: "/img/posts/devops.jpg" ---
CI is a practice which facilitates merging code to the main branch and/or commiting code to your branch continuously. By introducing a CI pipeline in Github actions for example, a commit to your branch or merge attempt to the main branch (depending on what triggers you choose to use), triggers a series of automated steps. These steps may involve running the code build, unit tests, code analysis and more.
If a new branch were to pass all of the automated steps in the pipeline without any errors, a merge to the main branch is possible and may continue to the next stage e.g. deployment to the cloud. Should any of the steps fail, the development team may go through the error report, so that they may fix the issues and the merge attempt is prevented from progressing to any further stages.
As to describe this proccess, the pipeline acts as a safety net between commits that may "break" the application and a fully functional deployment.
By aiming at merging to the main branch often and in short iterations, running automated builds and tests continously through out development, developers can catch any errors early in the development stage. Reducing time spent trying to find and fix bugs as well as preventing them from reaching deployment.
As a first step, a .github directory is needed in my repository, this is where all Github specific files should be located. In this directory I introduce a workflows directory, this directory should contain my workflow yaml file, what I name this file besides from the .yaml extension is not important.
Once I have my yaml file, I start off by naming my workflow, this will be displayed in my repository's actions page once I trigger the workflow.
The next step is to add the "on:" event which specifies on what event github should trigger the workflow.
Now I have to specify what jobs and steps to run once this event is triggered, I start by naming my job. In my case I choose to build the application and run my unit tests in this job, I find: "Run build and tests" a suitable name for this.
Next my workflow needs to know what virtual enviroment to use to run this on, in my case i prefer to use linux ubuntu since performence is slightly faster.
Now I have to consider what steps I need in order to run the build and to run the unit tests. In my case in order to run a build I need access to the code, which can be done by using the - uses: actions/checkout@v2 statement, this step clones the code from the repository to the virtual environment. Since this application is running on the .NET framework I need to make sure the virtual environment has that installed aswell, by using the - uses: actions/setup-dotnet@v1 statement and specifying a dotnet version to match this projects dotnet version.
My yaml file now looks like this:
Now I am all set up to continue to the last two steps, running the build and unit tests. I simply tell these steps to run a dotnet build and dotnet test against the virtual environment and by providing the specific path each step should by running in. Now the final result of my workflow file end up looking like this:
My automated workflow now triggers everytime I make a commit in this repository, running the steps and notifies me if any errors occurs in either the build or any of the unit tests.
By implementing a CI pipeline to my repository, facilitates developing new features to my projects by catching errors at an early stage, reducing time spent trying to locate it. A nice feature Github Actions use, is notifying any occuring errors by email if I happen to overlook the latest commits workflow result. Although, this feature may also be irritating when getting stuck on an error, by flooding my mail with notifications.


Observable value that will update with the current user on user change
This observable indicates the current state of the service
Placehlolder to check if a token update is needed. Not used with Forms authentication
Disposes the service, the state and currentUser observables
Returns the current user value
Logs in with the provided credentials
The username for the login
The password for the login
Logs out and destroys the current session
Static Factory Method for attaching the service to a Repository object
The repository instance
Additional options for loading User content
Generated using TypeDoc
Authentication Service class for using Forms authentication through OData Actions


In Eugene, we categorize the rules into the following types of constraints: counting, positional, pairing. To formally define the semantics of the rules, we define N as the length/size of the genetic design.
Counting Rules
Counting rules constraint the number of occurrences of specific genetic elements in a design. We define the cardinality of genetic elements as follows: |α| is the number of occurrences of α in the design.
| Rule | Description | Formalization | Examples |
|---|---|---|---|
| CONTAINS α | α must appear at least once | 0 < |α| ≤ N |
CONTAINS p CONTAINS t |
| α EXACTLY n | α must appear exactly n times |
|α| == n 0 ≤ |α| ≤ N | p EXACTLY 1 |
| α MORETHAN n | α must appear more than n times |
|α| > n 0 > n > N |
c MORETHAN 1 |
| α NOTMORETHAN n | α not must appear more than n times |
0 ≤ |α| ≤ n 0 > n > N |
p NOTMORETHAN 1 |
Positional Rules
Positional rules constraint the location of occurrence of genetic elements. To formalize the semantics of the positional rule, we define the position predicate as position(α) = i with 1 ≤ i ≤ N. α can only appear on non-constraint positions in the genetic design.
| Rule | Description | Formalization | Examples |
|---|---|---|---|
| STARTSWITH α | α must appear at the first position | ∃α: position(α) = 1 | STARTSWITH p |
| ENDSWITH α | α must appear at the last position | ∃α: position(α) = N | ENDSWITH t |
|
α AFTER β α ALL_AFTER β |
If α appears in the design, then all β components must precede all α components |
|α| ≥ 1 ⇒ Ɐα, β position(α) > position(β) |
c AFTER r t ALL_AFTER p |
| α SOMEAFTER β | If α appears in the design, then at least one β component must precede at least one α component |
|α| ≥ 1 ⇒ ∃α, β position(α) > position(β) |
p SOME_AFTER t |
|
α BEFORE β α ALL_BEFORE β |
If α appears in the design, then all α components must precede all β components |
|α| ≥ 1 ⇒ Ɐα, β position(α) < position(β) |
r BEFORE c p ALL_BEFORE t |
| α SOME_BEFORE β | If α appears in the design, then at least one α component must precede at least one β component |
|α| ≥ 1 ⇒ ∃α, β position(α) < position(β) |
t SOME_BEFORE p |
α NEXTTO β α ALL_NEXTTO β |
If α appears in the design, then all β components must appear immediately before or after all α components |
|α| ≥ 1 ⇒ Ɐα, β position(α) == position(β) - 1 ∨ position(α) == position(β) + 1 |
r NEXTTO p r ALL_NEXTTO c |
| α SOME_NEXTTO β | If α appears in the design, then at least one β component must appear immediately before or after at least one α component |
|α| ≥ 1 ⇒ ∃α, β position(α) == position(β) - 1 ∨ position(α) == position(β) + 1 |
p SOME_NEXTTO t |
Paring Rules
Pairing rules constrain the pair-wise appearance of genetic elements. For example, various elements cannot occur in a genetic system by themselves.
| Rule | Description | Formalization | Examples |
|---|---|---|---|
| α WITH β | α and β must appear together | |α| ≥ 1 ∧ |β| ≥ 1 |
p WITH t r WITH c |
| α NOTWITH β | α and β must appear but not both |
|α| ≥ 1 ⇒ |β| == 0 ∧ |β| ≥ 1 ⇒ |α| == 0 |
t1 NOTWITH t2 p1 OR p2 |
| α THEN β | If α appears, then β must appear |
|α| ≥ 1 ⇒ |β| ≥ 1 |
p THEN t t IMPLIES p |


2014-03-07 To F.
2014-03-07
Greetings F.,
I just meditated and I don’t know if I see lighter or darker. But I am emptier. My interior is clearer.
First of all, thank you. Thank you for all that you have taught me and continue to teach me. Since the day I met you, every chat, conversation, or email with you has been very fruitful for me. The last lesson you have given me has been to recognize that lots of work remains to be done with humanity. Even so, we are still on the right track. Thank you.
I’m sorry to tell you this, it grieves me greatly, but lately you make me sad. I am sorry to see that the person T. introduced me at El Gallinero about 4 years ago (time flies, isn’t it?) Has changed so much. That person for whom I put on a shirt, to give a good image. That person that appeared in espadrilles, with a mane, earrings and white pants that looked like pajamas. T. incorruptible. Without prejudice, he accepted us and admired who we were and what we could be; not because of what we appeared to be. It didn’t matter the attire if our spirit was on the path we had chosen, or that we still had to choose. Each his, his own way. Way to be discovered and traveled, which to this day we continue discovering and traveling.
I am sorry to tell you that you have disappointed me greatly. Seriously, I’m sorry. It was my fault, I admit it. For not being empty. For having expectations. Expectations about educated people, about wise people. To think that these would keep their humanity intact through the passing of the years.
At first, I thought about sending you a text full of authors and references, but, I suppose that like Watson, discoverer of DNA, the references and the previous and subsequent demonstrations do not have much depth in your iron spirit. Also, by the way, I don’t want to give you any references: because I don’t know them, because I don’t have time to look for them, and because you could answer me with ten references in response to each one I put.
So I will try to appeal to your humanity, which, as a human being, I am sure you still have.  I want to ask you if human beings do not deserve equality and respect just because they are human beings. If they do not deserve to be treated fairly, justly, because they belong to the human condition. If, due to their inherent and intrinsic human dignity, they do not deserve the love and appreciation of other people. If we should not fight to try to achieve equality, even if it is artificial and invented, but that allows all people to try to find their way without others putting obstacles in their way and prevent it. Even if we show that blacks are dumber, and that women write worse. Don’t they both deserve to have the same opportunities to study or write? Aren’t they human beings too? Aren’t they people?
I will believe the lies of equality, if the consequences are positive for humanity. And I will forget the truths of the differences if they lead us to segregation and violence between people, between brothers. The world, like science, is built by people. And we all decide whether we want to live in a world where blacks are dumber and women write worse (even if it’s true), or one where we are all equal and have access to the same opportunities in a fair and impartial way (even if we aren’t the same). Sometimes I need to lie to myself and fool myself. Then I empty myself and forgot about self-deception. I forget the truth. I give myself new opportunities. Unprejudiced.
I consider that segregation and prejudice are not beneficial for humanity, and cause behaviors guided by hatred and ignorance in human beings. On the contrary, curiosity, even if it kills cats, brings people closer to each other. Curiosity and knowledge prevent the development of prejudice and are medicine for racism. Respect and love are forged with trust and cooperation. Opportunities for learning and experiences are needed. It is essential to look into the unknown. Observe each situation with new eyes.
I think that people are in the world to help each other and not to trip us up. The person you are helping today may be vital to you in the future. It can be the fundamental help that removes the obstacle that you alone cannot move. I like to think that the human being has come this far for his ability to love, and not for his ability to destroy. For his altruism, for putting the common interest before his own. For focusing on others.
 Just as women are women because you are a man. I am trying to abandon my point of view centered on myself. Stop comparing myself with the world, taking as a reference my point of view, my characteristics, the person that I am. I don’t want to compare, neither with me, nor between them, nor with anything. I want to take people as individual beings. What they are. Leave the categories, stereotypes and prejudices aside.
Thus, I want to empty myself and be able to fill myself over and over again. Be empty. Forget all the science and references. For or against equality. Run into the living beings of the planet, with each object and with each new experience free of past influences. As if it were the first time. New water over and over again. Trying that my only prejudice is lack of prejudices.
I have been educated as a Scout, and the motto “Leave this world a little better than you found it.” has made quite an impact on my personality. In part, that’s why I’m sending you this letter.
I have no time left. Sorry Fernando.
As a last thought, appreciate what you have accomplished. It’s easy to blame you, but I decided to breathe. From the hatred that your emails caused me at first, I have been able to pass to a deep sadness when I realized the transformation you have undergone these years. Now there is only left an infinite gratitude to the beautiful person who has caused me to write this letter.
Thank you very much F.
Carlos
Leuven 2014-03-07


Back to Home
What is SMART Padala?
Menu
List of Partner Banks
BDO
BPI
Metrobank
PSBank
BancNet
RCBC
Sterling Bank
Citystate Bank
Allied Bank
CTBC
DBP
Security Bank
AUB


Organizations often have specific processes for registering users, subscribing to services, or defining prices. Usually, such processes include approval processes and are modeled and automated with a process control system.
For specific actions performed by users or triggered by the platform, the platform provides a way to interact with such process control systems: Triggers can be configured which are invoked when the actions are carried out in the platform. The triggers start the corresponding process in the process control system. If approval for an action is required, the action is suspended until it is approved or rejected in the process control system. If no approval is required, the action is instantly executed.
As a prerequisite for controlling actions by processes, a notification service must exist and be deployed. This service forms the interface between the platform and the process control system. For details on implementing such a service, contact the platform operator.
You can see the actions that are subject to process control on the Manage processes page. On this page, you can abort suspended actions and delete aborted ones.
On the Process triggers page, you can view all triggers configured for your organization. You can add, update, or delete triggers.
To manage the triggers of your organization:


2 writes to Finished
System.Management.Automation (2)
engine\remoting\client\Job.cs (2)
902
Finished
= null,
944
Finished
= gotResultEvent,
2 references to Finished
System.Management.Automation (2)
engine\remoting\common\psstreamobject.cs (2)
473
if (cmdletMethodInvoker.
Finished
!= null)
475
cmdletMethodInvoker.
Finished
.Set();