A place for general developer talk – for everyone! | Documentation https://developers.komodoplatform.com | MoreDev Docs - https://docs.komodoplatform.com | Mastering CryptoConditions - https://github.com/KomodoPlatform/Mastering_CryptoConditions
100 messages
Before 05-Dec-19 12:00 AM
MyName22-Mar-19 09:08 PM
You can't admit that the space is out of consensus on terms, meanings, and definitions and then decide to be the sole determiner of what is/isn't a "lie", a "truth", or even "wrong".
You may have opinions on the subject, but you don't get to be the centralized decider of fact
zack22-Mar-19 09:08 PM
it could be a long scam
jl777c22-Mar-19 09:08 PM
ok, so you provide good data for a year so you can run away with a days worth of subscriber fees
0.3% loss
if the subscriptions are made daily
zack22-Mar-19 09:08 PM
its not the subscriber fees that are important
jl777c22-Mar-19 09:08 PM
not any disaster
zack22-Mar-19 09:09 PM
you are using this data for something, right?
jl777c22-Mar-19 09:09 PM
oracles CC does not use it
zack22-Mar-19 09:09 PM
for example, if we have a trusted feed to tell us the result of political elections, there could be some money at stake
jl777c22-Mar-19 09:09 PM
other things use oracles CC to manage offchain data onchain
zack22-Mar-19 09:09 PM
so if someone lied about the data, they could make the market for the political election break, and steal money from everyone who was gambling on the election
dukeleto22-Mar-19 09:09 PM
people choose the oracles they trust, KMD doesn't force users to trust a given oracle
siu - Chainmakers22-Mar-19 09:09 PM
We are discusing techinical approaches here, could you stop saying "scam" and liars when referring to komodo?(edited)
dukeleto22-Mar-19 09:11 PM
This discussion is the best way to spend a layover (with ). Hopefully y'all are still going at my next layover
siu - Chainmakers22-Mar-19 09:11 PM
Lol
jl777c22-Mar-19 09:11 PM
oracles CC is low level
it is meant to be used by other CC to do things
Alright22-Mar-19 09:11 PM
we should rename it "blockchain oracles CC"
siu - Chainmakers22-Mar-19 09:11 PM
Have a nice flight @dukeleto
1
dukeleto22-Mar-19 09:11 PM
"make sure you trust this" oracle CC
2
jl777c22-Mar-19 09:12 PM
what is done is outside the scope of oracles CC, oracles CC does the datafee, pay per data point
if people go making all sort of technical assumptions from 4 word summaries and dont read the explanation paragraphs, that is really out of our control
zack22-Mar-19 09:12 PM
Oracles CC it is not an oracle. You can't use it to bring data about reality onto the blockchain.
It brings some data that some guy decided to say, and it may or may not be a lie.
MyName22-Mar-19 09:13 PM
Instead you are trusting some person to put some data that may or may not be related to reality onto the blockchain.
There is no cryptoeconomic guarantees that the data on-chain has any relationship to reality.
An how does that differ from Amoveo?
You've stated that you can manually "hard update" to stop an oracle "about to lie", what "cryptoeconomic guarantees" exist to ensure that what you do "may or may not be related to reality"?
zack22-Mar-19 09:13 PM
it is a trusted feed. you are trusting someone to feed you some info.
mrlynch22-Mar-19 09:13 PM
and that's what an oracle does
jl777c22-Mar-19 09:13 PM
that is implicit in data publisher
siu - Chainmakers22-Mar-19 09:13 PM
You may or not be a lie, but i would have already stopped paying for your data feed by now.
mrlynch22-Mar-19 09:13 PM
bring off-chain data on-chain
MyName22-Mar-19 09:13 PM
it is a trusted feed. you are trusting someone to feed you some info.
and Amoveo users are trusting that you will not maliciously "hard update"
jl777c22-Mar-19 09:13 PM
also explicitly explained in the paragraph
dukeleto22-Mar-19 09:14 PM
@zack from what I see, Amoveo is a trusted feed as well, given the reality of 51% attacks and you telling exchanges which git repo to use, and various other reasons
zack22-Mar-19 09:14 PM
if I can steal $100 000 by breaking an election market, I really don't care that I wont be paid $10 or whatever in fees for my trusted feed.
mrlynch22-Mar-19 09:14 PM
also, this
we will do an update to prevent that oracle from being able to close on a lying outcome.
is quite the opposite of trustless
jl777c22-Mar-19 09:15 PM
what election market?
we are not making betting markets with oracles CC
it is a data market
zack22-Mar-19 09:15 PM
you intend to use the data for something, right?
jl777c22-Mar-19 09:15 PM
one use is the gateways CC that has multisig signers for tokenizing crypto
the signers are trusted to safekeep the deposited crypto and redeem it when the tokens are redeemed
MyName22-Mar-19 09:16 PM
if I can steal $100 000 by breaking an election market, I really don't care that I wont be paid $10 or whatever in fees for my trusted feed.
if I can win $100 000 by betting, I really don't care that I have to pay you $10 or whatever to manually "hard update". (adjusted down from earlier to match)
jl777c22-Mar-19 09:16 PM
they are also trusted to post merkle data onchain
zack22-Mar-19 09:16 PM
The Komodo oracle CC is not meant to be used to support any betting, or determine who gets any money. Do I have that correct?
Regnar22-Mar-19 09:16 PM
It's meant to put off-chain data on-chain
jl777c22-Mar-19 09:16 PM
oracles CC itself is low level and is for offchain data -> onchain for a data fee
that is the scope for oracles CC
zack22-Mar-19 09:17 PM
@Regnar well, it does not do that. It only puts data that some guy decided to put on-chain. You have no idea if it is accurate or not.
jl777c22-Mar-19 09:17 PM
using the standard definition for oracle
siu - Chainmakers22-Mar-19 09:17 PM
An assetchain project then sets the trust scheme they prefer
jl777c22-Mar-19 09:17 PM
for gateways CC, the same nodes signing the multisig are posting data to the oracles CC
zack22-Mar-19 09:17 PM
just because some guy wants to put data on-chain doesn't mean it is an accurate reflection of the state of the world.
jl777c22-Mar-19 09:18 PM
so if you are willing to trust the MofN signers with your BTC deposit, you surely are ok to trust them to post valid merkle data
Regnar22-Mar-19 09:18 PM
well, it does not do that. It only puts **data** that some guy decided to put **on-chain**. You have no idea if it is accurate or not.
jl777c22-Mar-19 09:18 PM
you have to specifically subscribe to a specific publisher
zack22-Mar-19 09:18 PM
Komodo trusts M of N signers with bitcoin deposits? that doesn't sound trustless
jl777c22-Mar-19 09:19 PM
gateways CC uses automated multisig for a federated tokenization of external crypto
zack22-Mar-19 09:19 PM
giving people the freedom to choose who to subscribe to does not make it trustless
jl777c22-Mar-19 09:19 PM
did I claim it was trustless?
MyName22-Mar-19 09:19 PM
@zackInstead you are trusting some person to put some data that may or may not be related to reality onto the blockchain.
There is no cryptoeconomic guarantees that the data on-chain has any relationship to reality.
An how does that differ from Amoveo?
You've stated that you can manually "hard update" to stop an oracle "about to lie", what "cryptoeconomic guarantees" exist to ensure that what you do "may or may not be related to reality"?
This is an important distinction, so I'll keep asking until you answer....
siu - Chainmakers22-Mar-19 09:19 PM
Leave him alone guys, at this point he is trolling
1
zack22-Mar-19 09:20 PM
In Amoveo we use synthetic assets to allow people to hold cryptocurrency from other blockchains. That way it can be trustless.
MyName22-Mar-19 09:20 PM
cannot be out-trolled
mrlynch22-Mar-19 09:20 PM
@MyName that's fhe 6th time he ignored the question... maybe lucky no 7?
Regnar22-Mar-19 09:20 PM
He almost HAS to be trolling now.
jl777c22-Mar-19 09:20 PM
who has the privkeys to the BTC
3
MyName22-Mar-19 09:20 PM
@zackInstead you are trusting some person to put some data that may or may not be related to reality onto the blockchain.
There is no cryptoeconomic guarantees that the data on-chain has any relationship to reality.
An how does that differ from Amoveo?
You've stated that you can manually "hard update" to stop an oracle "about to lie", what "cryptoeconomic guarantees" exist to ensure that what you do "may or may not be related to reality"?
This is an important distinction, so I'll keep asking until you answer....
1
TonyL22-Mar-19 09:21 PM
How can we sure that we are not living in matrix. Live is trustless
jl777c22-Mar-19 09:21 PM
how can amoveo blockchain trustlessly store BTC ?
zack22-Mar-19 09:21 PM
@jl777c a synthetic asset is a kind of financial derivative. there are no actual bitcoin involved.
2
It is an asset that stays the same value as bitcoin, but is priced in VEO
This way we can fit it inside of state channels.
jl777c22-Mar-19 09:21 PM
oh, just a cash settled, but who backs the value of volatility?
Regnar22-Mar-19 09:21 PM
Oh this just gets funnier and funnier
mrlynch22-Mar-19 09:22 PM
ehr ma gherd... you must be trolling
jl777c22-Mar-19 09:22 PM
what if bitcoin goes 4x very quickly? who pays?
zack22-Mar-19 09:22 PM
The smart contract in the channel has margins and leverage that can be customized
ComputerGenie 👴👴👴22-Mar-19 09:22 PM
maybe if I use a name with pretty colors....
@zackInstead you are trusting some person to put some data that may or may not be related to reality onto the blockchain.
There is no cryptoeconomic guarantees that the data on-chain has any relationship to reality.
An how does that differ from Amoveo?
You've stated that you can manually "hard update" to stop an oracle "about to lie", what "cryptoeconomic guarantees" exist to ensure that what you do "may or may not be related to reality"?
This is an important distinction, so I'll keep asking until you answer....
mrlynch22-Mar-19 09:22 PM
8th time
Regnar22-Mar-19 09:22 PM
^ I may start printing t-shirts of that
1
zack22-Mar-19 09:22 PM
if the price exceeds the margins, then all the money in the channel is owned by one party or the other. You can't earn more than 100% of the money in the channel.
mrlynch22-Mar-19 09:23 PM
can we get to 10? do we have a bid for 10?
jl777c22-Mar-19 09:23 PM
ok, so it is again for betting purpose only
3
Regnar22-Mar-19 09:23 PM
We need a trustless oracle to tell us when we get to 10... I don't trust Genie
4
jl777c22-Mar-19 09:23 PM
which is fine, but the gateways CC has a different purpose, to tokenize BTC onchain
zack22-Mar-19 09:23 PM
the language is turing complete, im just telling about stablecoins as an example
jl777c22-Mar-19 09:23 PM
and it uses multisig, which makes it clear those signers are trusted with the BTC deposit
so using oracles CC is withing the existing trust level, and there is no extra risk from using oracles CC, even though oracles CC isnt trustless
zack22-Mar-19 09:24 PM
putting trustful bitcoin onto a blockchain is a bad strategy, it is better to be trustless.

ComputerGenie 👴👴👴22-Mar-19 09:24 PM
@zackInstead you are trusting some person to put some data that may or may not be related to reality onto the blockchain.
There is no cryptoeconomic guarantees that the data on-chain has any relationship to reality.
An how does that differ from Amoveo?
You've stated that you can manually "hard update" to stop an oracle "about to lie", what "cryptoeconomic guarantees" exist to ensure that what you do "may or may not be related to reality"?
This is an important distinction, so I'll keep asking until you answer....
mrlynch22-Mar-19 09:25 PM
and we have a 9 from the gentleman with the pink unicorn... can we get an answer? or a bid for 10?!
1
ComputerGenie 👴👴👴22-Mar-19 09:25 PM
or he can just admit he's wrong and I can get back to work
mrlynch22-Mar-19 09:26 PM
this is too good
Regnar22-Mar-19 09:26 PM
@zackInstead you are trusting some person to put some data that may or may not be related to reality onto the blockchain.
There is no cryptoeconomic guarantees that the data on-chain has any relationship to reality.
An how does that differ from Amoveo?
You've stated that you can manually "hard update" to stop an oracle "about to lie", what "cryptoeconomic guarantees" exist to ensure that what you do "may or may not be related to reality"?
This is an important distinction, so I'll keep asking until you answer....
sφldat22-Mar-19 09:26 PM
Regnar22-Mar-19 09:26 PM
doge for 10.
zack22-Mar-19 09:26 PM
@zack Instead you are trusting some person to put some data that may or may not be related to reality onto the blockchain.
There is no cryptoeconomic guarantees that the data on-chain has any relationship to reality. An how does that differ from Amoveo? You've stated that you can manually "hard update" to stop an oracle "about to lie", what "cryptoeconomic guarantees" exist to ensure that what you do "may or may not be related to reality"? This is an important distinction, so I'll keep asking until you answer....
11 points!
2
1
mrlynch22-Mar-19 09:26 PM
and we have 10 times the same question... answer please? @zack
we were expecting an answer from you, not the same question... if you can't answer, we sure as hell can't and i'm not very trustful of this


The Christmas season is a wonderful time, but it can also bring along with it stress and anxiety, especially for those whose children are fighting for their lives. Help us provide a general gift card to allow families to use however they need, and bring them a little hope and joy this holiday season.
Sponsor a Family TodayLook back on how you and the community helped families at Christmas time!
← 2017


Preparing for China - Expectations
Updated on | By DJ Strouse | Permalink
What I expect for my summer internship in Shanghai.
This summer, I will be interning for an international sales and marketing company in Shanghai, China through a fellowship program known as the USC Global Fellows Program (formerly Freeman Fellows). In total, 32 students from my university will work abroad in Shanghai, Beijing, Taipei, Hong Kong, and Tokyo. Last week, at a pre-trip mixer for the 32 students joining me on this program, an old friend of mine, Associate Director of the USC U.S.-China Institute Clayton Dube, and I were discussing topics for an article or blog about my travels and he suggested I document the surprises that I encounter. The best way to do so, of course, is to first document what I expect.
The People
My impression of Shanghai is that its the ‘London of the East’ (or maybe the ‘Hong Kong of a bit farther West’). I expect that most of the people I will meet will be multilingual expats who did not grow up in Shanghai but moved there seeking great opportunity. I assume most will work for banks and consulting companies. I don’t expect good scientific conversation but I do expect to encounter minds eager to probe global economic trends. I expect that a growing city like Shanghai also won’t foster an active community of social entrepreneurs. I therefore don’t expect much conversation on social entrepreneurship either[[^1]].
[^1]: Note: Much of my time back at university is spent working on international water projects in Honduras and India with Engineers Without Borders and the Deshpande Foundation, respectively.
I expect to find a large socioeconomic divide. I expect to encounter many disenchanted villagers from outside the city who came seeking livlihoods but are either unemployed or subsisting on lower wages than expected. At the same time, I expect to meet many extremely wealthy young Chinese who see Shanghai as a dream city.
I expect those in the middle and upper classes to view China as the inevitable successor to the United States’ sole superpower throne. I expect that they’ll focus on China’s economic growth rather than its human rights violations, mistreatment of journalists, and lack of democracy and that I’ll be hard pressed to find any signs of dissatisfaction with the government. Among the lower class though, I expect to encounter complaints that the gov’t ignores them and focuses only on courting international companies and catering to the rich.
I expect that, inside Shanghai, the Chinese won’t blink twice at an American college student. They may, however, harbor a bit of resentment. I expect that our reputation abroad is one of laziness and undue wealth. Still, I expect that the people of Shanghai will be very hospitable and often treat us to dinners, karoake nights, and toasts. Outside Shanghai, I expect that similar hospitality, no such harbored feelings of resentment, and a heavy dose of admiration. I expect that our reputation here is one of great intelligence, wealth, and generosity.
The City
First, as one of the fastest growing cities in world history, I expect to find little Chinese culture and history in Shanghai. I expect that the government is far more focused on fostering economic growth than preserving local culture.
Second, I expect the first few weeks to spend the first two weeks on a traveler’s high - overcome by the sensory blitz induced by the brights lights of the skyline, the olfactory clash of wet markets, and the constant chatter of street vendors. After the first two weeks though, I expect the ever-present crowds and concrete to begin to impinge upon my sense of freedom.
At this point, I’ll solve both the above problems by staging weekly treks to the quiter, more culturally rich cities of Hanzhou, Suzhou, and Nanjing among others. I expect this will keep me energized for the remainder of my stay.
I don’t expect home sickness or culture shock, as I’ve previously spent a month backpacking across western Europe and a week in Hong Kong.
I expect to jog around the city every morning and to not run out of places to explore in the 8 weeks that I’m there. I’ve heard the Bund is fall of Chinese practicing tai-chi every morning and I expect to run slalom among them.
The Job
This is perhaps the most hazy part of my journey. I know the name of my company and the name of my boss and that’s it. I haven’t been told my position, hours, dress code, or anything else. That said, copious amounts of speculation follow.
Despite the fact that he earned an MBA in the States, I expect that my boss will expect little of an American college student. I expect not to receive many responsibilites during my first week, but I’ll press for a challenge and I expect my boss will respond well. I expect to have my own project that I’m responsible to see through to completion. I expect that it will involve traveling around Shanghai and visiting clients.
I could never study business. I’m a double major in Electrical Engineering and Physics and dropped the only business class I ever took because I found it intensely boring. Nevertheless, I expect to thoroughly enjoy this internship. I expect to be challenged, to learn the subtle differences between the way Chinese and Americans conduct business, and to make lifelong friends of my boss and co-workers (considering that they’ll be my main link to the people of the city in a place in which I have no contacts).
The Food
I expect to encounter the variety of restaurants and cuisines characteristic of a wealthy, international city. As my fellowship stipend includes meals, I expect to experience this full range of cuisines. Since our apartment has a kitchen, I also expect moderate success in replicating these dishes at home (yet, when you’ve got a food stipend, I can’t expect much cooking to happen).
My Group
Six other USC students will be traveling with me; sophomore economics major Brian Tenenbaum, junior business major Emma Browne, junior entrepreneurship major Chris Mora, sophomore business major Aven Wright, and sophomore business major Mike Gawlik.
I expect that we’ll all grow extremely close by the end of the trip. I expect Chris and Brian to search out every networking opportunity they can find. I expect to spend Friday nights with Brian, schmoozing the Jewish community of Shanghai at the local Chabad house. I expect that each of them will join me for at least one weekend foray out of the city.
I leave this post open to revision for the next two weeks, but on May 29, the day I leave, I’m foregoing further edits and leaving this as a relic of my naivity.


In order to make a successful pull request, you must design a web page adhering to the recommendations as given below.
It would help for you to look into the given ideas, before you proceed to work on the web page.
You may use BootStrap, which has been used in all of the other web pages of this project.
You may want to look into template inheritance and see how it has been used in this project to simplify the initial steps of the task list.
You should look into how to link static files from the project into the specific html in django, this will be essential to insert images into the web page.
Feel free to commit and push to your branch as soon as you are done with one or the other feature. This allows us to evaluate your submission better.
Any sort of self promotion is alright, but, it should only link to your professional works.
Keep a note of the fact that this web page must be created in the file named front_end_submission.html
The task list below, is in a particular order and must not be mixed up.
A navigation bar with the same brand, and links as the one in the home page.
A large image of the WSoC logo, which you can find in the static folder of the django project, to be placed as a banner for the web page.
A large heading for the web page which says "FRONT END"
Dummy text, or Lorem Ipsum text as a paragraph.
The following part will be in two sections. Left and Right.
Left : A subtitle with the text "Web Development".
Left : Lorem Ipsum Paragraph text under the subtitle
Right : An Image of the bread doggo in the static folder directory, in a square shaped format.
(Optional) Right : Make a caption for bread doggo.
Footer for the Web Page, with the text "copyright:none"


Torri Gate (Game Icon)
CC Lemon Can (Unused)
Menu Button 1 (Unused)
Menu Button 2 (Unused)
Menu Button 3 (Unused)
Skybox - Sides (Placeholder)
Skybox - Bottom (Placeholder)
Skybox - Top (Placeholder)
Stairs & Mountain Texture (Placeholder)


This is one of the most inspiring interviews I've ever done. In this interview with Jesse Powell you will learn the full story of Kraken Exchange, how it all...
Interesting interview of CEX exchange ceo , gives an in sight into why dex might be the futur @jl777c(edited)
maki12-Nov-19 03:52 PM
@LocoMB where is official upcoming hardfork statement?(edited)
Lennart12-Nov-19 04:24 PM
I'm just thinking if the term DEFI should be used here and there when communicating with the public / in marketing
isn't Atomic Dex kind of decentralized finance anyway?
just watched DavinciJ15'S latest video, he's talking about defi-projects being the new hype in the next bullphase
just a random 2 cents..
ComputerGenie 👴👴👴12-Nov-19 04:27 PM
"Do you think they'll let me into the party tonight?"
"Defi."
Lennart12-Nov-19 05:08 PM
yeah, kinda
tomsmith2612-Nov-19 05:12 PM
I have just read this article : Komodo to lead blockchain revolution with quantum-safe cryptography By Naushad K. Cherrayil 4 hours ago World Of Tech
I can believe that KMD will be the best cryptocurrency and platform for the future digital world
Documentation for developers building on the Komodo Platform
mrdotboson13-Nov-19 05:15 AM
Is there something like Metamask but for Komodo?
gcharang13-Nov-19 06:54 AM
@mrdotboson we have a static html wallet which uses nSPV
so, you run a lightweight program on your computer (tiny storage and RAM requirements, no download of blockchain)
then access it through a browser
not exactly like metamask
Oszy13-Nov-19 07:02 AM
Metamask isn't just a "browser extension wallet", it's used to have access to different ETH chains for dApps(edited)
gcharang13-Nov-19 07:46 AM
nSPV can access different Smart Chains and Antara modules on them too
Oszy13-Nov-19 08:06 AM
Yes, if there will ever be such extension built, it will be "something like" Metamask
Petrus13-Nov-19 09:13 AM
Hey guys, anyone knows what the status is of the old school Supernet asset?
Good to see the NAV got rid of the iota and strat holdings
CHMEX13-Nov-19 09:25 AM
Yep and #1 kmd holder
Oszy13-Nov-19 11:00 AM
Imagine the 5% reward on that
Lennart13-Nov-19 12:48 PM
what does NAV mean? thx
CHMEX13-Nov-19 12:49 PM
Net asset value
The value of the assets it holds
Lennart13-Nov-19 12:50 PM
so as a supernet holder you hope/trust the kmd team / jl777 to make wise investment strategies, right?
ComputerGenie 👴👴👴13-Nov-19 12:55 PM
I trust that since they are invested as well and they prefer to make profit as opposed to lose their investments(edited)
My trust comes from that, not implicitly that they are team members
Cryptoon13-Nov-19 12:59 PM
They have the most at stake to do well
1
crumb13-Nov-19 01:01 PM
plus SuperNET holds a lot of revenue generating assets, so it's a healthy strategy of organic growth, instead of just wild speculations
Lennart13-Nov-19 01:02 PM
thank you. I only want to understand it better. Is "they" primarily JL777? Assetholders receive revenues from revenue-generating assets, for example if some holding would be proof of stake, that revenue would go to Supernet holders? also DEX fees, KMD rewards.. right? Tha value of the supernet coin comes from it's holdings, or above mentioned NAV
thx for explaining(edited)
CHMEX13-Nov-19 01:02 PM
jl has sad in the past if there are enough peole ( power by holding) who wish to liquidate an asset he will do it.
Mark8113-Nov-19 01:03 PM
CRYPTO asset is getting nearer that 1 Million usd mark everyday now...
ComputerGenie 👴👴👴13-Nov-19 01:03 PM
can't find the dam'd chart of how it all works
CHMEX13-Nov-19 01:03 PM
>> Is "they" primarily JL777
yes he has the keys
>>can't find the dam'd chart of how it all works
one sec
This is v of superNET eco system map. Based on the inicial ANN of superNET(UNITY) asset https:bitcointalk.orgindex.php?topic=, SuperNet ecosystem Before Tech...
https://dexstats.info/assetinfo.php Assets from issuer Jl777 BOTS Total Coin Supply: 1,000,000 Currently, the BOTS asset chain derives its value from the fact that it collects 15% of all dex fees on BarterDEX. This feature is simply a part of the original concept of the BOTS ...
ComputerGenie 👴👴👴13-Nov-19 01:05 PM
yeah, that
CHMEX13-Nov-19 01:05 PM
and thats the most common one which is easier to understand ^
Lennart13-Nov-19 01:10 PM
yeah i know that one. but it doesnt explain much. for example "50%" to holders makes sense for DEX but for Supernet..? What 50%? Where does it come from etc. But i have a somewhat clearer picture now
also how is the payout scheme? when revenues achieve 1 mio usd value?
CHMEX13-Nov-19 01:11 PM
Supernet holds DEX and CRYPTO
once the DEX and CRYPTO dividends are paid SUpernet get it's share
and that share is passed to the holder at 50%
btw CRYPTO has again 800kUSD in holdings
in december 2017 SN send dividends to holders received via crypto
I hope that makes sense?
Is This the Best Decentralised Atomic Swap Exchange of All? Update November 2019 I am joined by Jason Brown, Head of Business Dev at Komodo. We discuss how K...
Is this the best #peertopeer #decentralised mobile exchange? No escrow, only true cross-chain #atomicswaps?
https://t.co/nAd1aO72iS
@AtomicDex #binance #dex @KomodoPlatform $kmd @bennydoda01 @VerusCommunity
ComputerGenie 👴👴👴13-Nov-19 03:29 PM
are you going to link all shares of it too?
Acura13-Nov-19 03:31 PM
wang13-Nov-19 04:08 PM
Fellows, I represent a large mining pool, may I talk to one of the admi here?
@PTYX , this is Wang from AXE team
1
Cryptoon13-Nov-19 04:32 PM
You can ask in #komodo-team
PTYX13-Nov-19 04:42 PM
@Cryptoon i got the info, i've passed it along to ca333.
Cryptoon13-Nov-19 05:16 PM
27aume13-Nov-19 06:26 PM
Congrats on the stable coin listungs guys!
Lennart13-Nov-19 06:31 PM
yes, very nice! I also like that you mentioned "decentralized finance" in the last sentence
only need that Komodo-ecosystem stablecoin now(edited)
5 Stablecoins Added to AtomicDEX
Komodo team announces the addition of five stablecoins to their AtomicDEX exchange
@KomodoPlatform @AtomicDex $KMD
@DailyChainNews
https://t.co/Po5Q51L1Ik
tips greatly appreciated, ty
`RCpttc1QuP8b91EgcXDEXix1hYrf6XbqyY`
1
Jamie_Gillian14-Nov-19 10:49 AM
Hello
hastrup14-Nov-19 11:19 AM
Hi
Cryptoon14-Nov-19 12:46 PM
hello
Coffee... With or without milk?
ComputerGenie 👴👴👴14-Nov-19 12:50 PM
real milk or store-bought milk?(edited)
SHossain14-Nov-19 12:52 PM
only black coffee with lots of sugar or just coffee in a sugar pot
1
2
Cryptoon14-Nov-19 12:54 PM
@ComputerGenie 👴👴👴 you tap your milk directly from the cow into the cup? :p
crumb14-Nov-19 12:54 PM
there's enough sugar in coffee, when the spoon stands straight up
ComputerGenie 👴👴👴14-Nov-19 12:54 PM
@Cryptoon not that directly, but all "milk" in the US stores is 20-40% water(edited)
Cryptoon14-Nov-19 12:55 PM
Seriously?
crumb14-Nov-19 12:55 PM
yeah, most store milk is complete crap
Cryptoon14-Nov-19 12:55 PM
dont think that's even legal in EU
ComputerGenie 👴👴👴14-Nov-19 12:56 PM
it has to be "re-added" due to the loss during pasteurization, and they fudge the numbers for profit
crumb14-Nov-19 12:57 PM
check out the expiration dates on that store milk @Cryptoon . normal milk spoils in couple of days. some store milk has expiration dates few weeks
also try to cook something with real milk vs store bought stuff. you'll see the difference
1
Cryptoon14-Nov-19 12:58 PM
also with UHT?
ComputerGenie 👴👴👴14-Nov-19 01:05 PM
UHT "...can be stored at room temperature"
There may be a bit of science that I'm missing here, but 45 years of being around cows tells me that :(edited)


--- title: "Making it" tags: [ tools, make, starport, blogging, web ] date: "2008-01-08 23:01" picture: "hacker glider" options: "preformatted backdated" itemid: "2940" layout: post ---
"If you want something to get done, ask a busy person to do it." I haven't been accomplishing much lately, so obviously I'm not busy enough.
There are several seemingly-unrelated projects going on in the household
at the moment: I'm starting my next album, the
They're all more closely related than one might think.
You see, I'm a geek. I think nothing of writing a big pile of Makefile templates and Perl scripts to cobble an album, a songbook, and multiple websites together from the same set of sources. The Cat is emphatically not a geek, she wants to be able to type recipes in, maybe to a text editor or a blog client, and have them magically assembled into a cookbook. And a website, of course. Hmmm.
Meanwhile, I've been dissatisfied with the available "content management
systems" (a category which includes blogs and wikis as well as monstrous
enterprise document management systems like Alfresco (which is pretty damned
cool, but then I like monsters, not just ponies and monkeys. But
I digress). Partly this is because most of them don't let me use my own
version-control tools and my own editor, and essentially none of
them take advantage of make
.
Not even ikiwiki and blosxom, which probably come closest to what I've been working on.
I like my tools. They pull together metadata from a variety of places, including (for example) song lyric files, recording projects, and local metadata files, and build CD masters, ripped files, playlists, annotated track listings, and multiple web pages. They could do that for cookbooks, too. Or blogs.
What make
is, fundamentally, a program for working out
dependencies and following rules to run the commands that rebuild
whatever depends on the files that changed since the last time you did
it. This is just what ikiwiki and blosxom do, only they do it with massive Perl
scripts that rumble over your directory tree and figure out what's been
changed and follow rules to... Right. Why reinvent make
?
The tools have to allow varying degrees of participation: public comments similar to blogs, but also more intense collaboration on editing and recording. I'm not going to be shipping pre-order bonus disks this time around: I want to sell subscriptions to the development process.
... So that's the plan: to refactor my CD, concert, and web tools so that they work for assembling books and blogs as well, publish to hardcopy as well as on multiple websites, and do it in a way that's extensible (with plug-ins), collaborative, and simple enough to be used by non-geeks.
I'm probably going to need a lot of help with that last part.


Bedazzled
Harold Ramis's movies are often difficult to review because they're just so good and solid it's hard to pick up on a particular aspect or niche and write around. "Bedazzled" is a good example of this.  It's certainly nothing genius but it is funny and entertaining.
Brendan Fraser stars as Elliot Richards, a geeky dork who works as a tech support operator at a computer company. Elliot is the kind of guy who's in a deep state of loser denial: he tries to fit in with the other guys in the office by talking in outdated slang and constantly fake smiling and laughing but they all politely reject him. One of the first scenes shows him talking to an African-American co-worker asking him if he wants to play basketball after work and says, "Make sure you tell me the right time to be there because last time when I showed up you guys were all leaving."
You can pretty much get the grasp of Fraser's character in just the first few scenes. Everyone knows someone like this so you're not just laughing at the character being funny in a comedy, you're laughing because you've seen this type of person do the type of things he does.  And thankfully Ramis doesn't resort to a lot of slapstick and sight gags (a la Kramer on "Seinfeld"), he just gives Elliot a lot of good lines and Fraser does a good job in playing the character.
Of course whenever you have a nerd you have to have a bombshell for him to secretly be in love with. Frances O'Connor plays that character, a pretty brunette named Alison who is surprised when Elliot approaches her in a bar trying to make casual conversation and of course politely rejects him.
Enter Elizabeth Hurley as the devil who knows how desperate Elliot and he'd be an easy target for a soul exchange. I think this is the first movie where the devil comes in the form of a woman and a hot chick at that. Hurley is as sexy as the role requires her to be. She oozes attraction and doesn't have to try very hard to persuade Elliot to trade his soul for seven wishes. It's predictable of course but it's not forced or trite - kind of cartoony but with a naughty adult appeal.
And so Elliot proceeds to make his wishes, each involves a major lifestyle change that he thinks would be the key to getting Alison.
I think a rule of movies, or pretty much any medium of fiction, is that if you make a wish to a wish granter you'll get it but there will be a price to pay for it. Edgar Allen Poe's "The Monkey's Paw" is a classic example of this and "Bedazzled" works in much the same way. Elliot wishes to be rich and powerful and married to Alison so the devil turns him into a Colombian drug lord whose wife is cheating on him. Technically he got his wish.
That's how all the wishes Elliot makes turn out. He gets what he wishes for but they're all fulfilled as literally as he asked for them. There's a scene where Elliot wishes he could be the most sensitive guy in the world because he knows women want that in men, but even that backfires on him. That scene takes place on a beach and every time Elliot turns to look at the sunset he weeps and it drives Alison crazy.
What "Bedazzled" secretly has going for it is the satire at work during every wish sequence. The sensitivity wish is a great example of this. Another is when Elliot becomes a pro basketball player and we see the announcers talking about how he's broken every record Michael Jordan and Wilt Chamberlain ever set. After the game he's interviewed by a reporter saying jargon so inane it's hilarious. He can't answer any question flat-out, he just says, "It was a team effort... you gotta give 110%... you can't give up." Meanwhile sweat is pouring down his face so hard it soaks the reporter.
The film maintains balance by not making the surprises too ridiculous - they're fluffy and iconic enough to work in a mainstream movie. You know, the kind of stuff that might happen in a Jim Carrey flick only without the gross-out factor. Fraser is able to effectively hold his own in every outrageous scenario and still keep Elliot in character. The film utilizes the supporting characters in a "Wizard Of Oz" way where they are all play roles within each wish scenario. Orlando Jones (the 7-Up guy) is the best of them, however, the others are a little weak (think of a sub-par "Saturday Night Live" sketch).
The ending's a nice breath of fresh air. Sure it's as standard as they come but it's not corny or sappy or anything so annoying as most comedies tend to rely on for effect.
All in all "Bedazzled" works because it's put together well and doesn't try to be anything it's not. It has potential to be an innovative satire but works fine as a plain old "ha ha" comedy.
GRADE: B
------------------------------------------------------------------------ You can also read this review at: http://www.epinions.com/mvie-review-51A3-237574FC-39F4D434-prod3 And other reviews on the same topic at: http://www.epinions.com/mvie Check out my profile page at: http://www.epinions.com/user-chad9976 Chad'z Movie Page is back! In-depth reviews of nearly all mainstream films playing at your local cineplex. There's also reviews of a few classic films and some of your personal favorites.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


def GetPronunciationRules(path, name):
with utf8.open(path) as reader:
rules = reader.read()
return icu.Transliterator.createFromRules(
name, rules, icu.UTransDirection.FORWARD)
def GetPronunciationRules(path, name):
rules = utf8.GetContents(path)
transliterator = icu.Transliterator.createFromRules(
name, rules, icu.UTransDirection.FORWARD)
return transliterator
def GetSampaToIpaMapping(path):


NDFileTIFF inherits from NDPluginFile. This plugin saves data in the TIFF file format, which is a popular file format for storing images. There is TIFF support for almost all languages and programs such as IDL and Matlab.
The TIFF plugin supports all 8 NDArray data types (signed and unsigned 8, 16, 32 bit integers, 32 and 64 bit floating point. It supports all color modes (Mono, RGB1, RGB2, and RGB3). Note that many TIFF readers do not support 16 or 32 bit integer TIFF files, floating point TIFF files, and 16 or 32 bit color files. NDFileTIFF is limited to a single array per file, but capture and stream mode are supported by writing multiple TIFF files.
Tests were done with IDL, ImageJ, and the Python Imaging Library (PIL) to read TIFF files with all 8 data types. IDL can read all 8 types, although it does not support signed 8-bit integers so it treats them as unsigned. ImageJ can read all types except NDFloat64. PIL cannot read NDInt8, NDUInt32, or NDFloat64.
The TIFF plugin writes all NDAttributes attached to the NDArray as TIFF ASCII file tags, up to a maximum of 490 tags. These tags start with number 65000. For historical reasons first 4 tags do not have labels. These are the following NDArray class members converted to ASCII:
Tags starting with 65004 are the NDAttributes in the NDArray converted to ASCII with attribute name, followed by a colon and the attribute value. This information can be displayed, for example, with the tiffinfo program:
>tiffinfo ~/scratch/test_001.tif TIFF Directory at offset 0x400008 (4194312) Image Width: 1024 Image Length: 1024 Bits/Sample: 32 Sample Format: IEEE floating point Compression Scheme: None Photometric Interpretation: min-is-black Samples/Pixel: 1 Rows/Strip: 1024 Planar Configuration: single image plane Make: Unknown Model: Unknown Software: EPICS areaDetector Tag 65000: 854478417.972736 Tag 65001: 3059 Tag 65002: 854478418 Tag 65003: 1977554 Tag 65010: ColorMode:0 Tag 65011: RingCurrent:100.010157 Tag 65012: RingCurrent_EGU:mA Tag 65013: ID_Energy:42.181675 Tag 65014: ID_Energy_EGU:keV Tag 65015: ImageCounter:3059 Tag 65016: MaxSizeX:1024 Tag 65017: MaxSizeY:1024 Tag 65018: CameraModel:Basic simulator Tag 65019: AttributesFileParam:simDetectorAttributes.xml Tag 65020: AttributesFileNative:1139 Tag 65021: AttributesFileString:simDetectorAttributes.xml Tag 65022: CameraManufacturer:Simulated detector Tag 65023: Pi:3.141593 Tag 65024: E:2.718282 Tag 65025: Ten:10 Tag 65026: Gettysburg:Four score and seven years ago our fathers
If there is an NDAttribute of type NDAttrString named TIFFImageDescription then this attribute is written to the TIFFTAG_IMAGEDESCRIPTION tag in the TIFF file. This is the output of tiffinfo on a file written by the TIFF plugin. The data is from a Pilatus detector. The areaDetector ADPilatus driver reads the TIFFTAG_IMAGEDESCRIPTION data from the original TIFF file that camserver writes, and adds it to the NDArray as the TIFFImageDescription attribute. Note that the ImageDescription data is present twice, both in the standard TIFF ImageDesciption tag and in user tag 65010 in the TIFF file with all other NDAttributes. This is OK because some data processing code may expect to find the information in one location or the other.
>tiffinfo ~/scratch/pilatus_test_000.tif TIFF Directory at offset 0x5cbdc (379868) Image Width: 487 Image Length: 195 Bits/Sample: 32 Sample Format: signed integer Compression Scheme: None Photometric Interpretation: min-is-black Samples/Pixel: 1 Rows/Strip: 195 Planar Configuration: single image plane ImageDescription: # Pixel_size 172e-6 m x 172e-6 m # Silicon sensor, thickness 0.000320 m # Exposure_time 1.0000000 s # Exposure_period 1.0000000 s # Tau = 203.0e-09 s # Count_cutoff 1390572 counts # Threshold_setting: 7000 eV # Gain_setting: mid gain (vrf = -0.200) # N_excluded_pixels = 0 # Excluded_pixels: (nil) # Flat_field: (nil) # Trim_file: p100k0118_E10000_T7000_vrf_m0p20.bin # Image_path: .../Data/gpd_user/data/idc/2017/run1/setup_603/setup/images/ # Wavelength 1.54000 A # Energy_range (0, 0) eV # Detector_distance 1.00000 m # Detector_Voffset 0.00000 m # Beam_xy (0.00, 0.00) pixels # Flux 0.000000 # Filter_transmission 1.0000 # Start_angle 0.0000 deg. # Angle_increment 0.1000 deg. # Detector_2theta 0.0000 deg. # Polarization 0.990 # Alpha 0.0000 deg. # Kappa 0.0000 deg. # Phi 0.0000 deg. # Phi_increment 0.1000 deg. # Omega 0.0000 deg. # Omega_increment 0.1000 deg. # Chi 0.0000 deg. # Chi_increment 0.1000 deg. # Oscillation_axis X, CW # N_oscillations 1 Make: Unknown Model: Unknown Software: EPICS areaDetector Tag 65000: 854479056.813133 Tag 65001: 1 Tag 65002: 854479058 Tag 65003: 208583261 Tag 65010: TIFFImageDescription:# Pixel_size 172e-6 m x 172e-6 m # Silicon sensor, thickness 0.000320 m # Exposure_time 1.0000000 s # Exposure_period 1.0000000 s # Tau = 203.0e-09 s # Count_cutoff 1390572 counts # Threshold_setting: 7000 eV # Gain_setting: mid gain (vrf = -0.200) # N_excluded_pixels = 0 # Excluded_pixels: (nil) # Flat_field: (nil) # Trim_file: p100k0118_E10000_T7000_vrf_m0p20.bin # Image_path: .../Data/gpd_user/data/idc/2017/run1/setup_603/setup/images/ # Wavelength 1.54000 A # Energy_range (0, 0) eV # Detector_distance 1.00000 m # Detector_Voffset 0.00000 m # Beam_xy (0.00, 0.00) pixels # Flux 0.000000 # Filter_transmission 1.0000 # Start_angle 0.0000 deg. # Angle_increment 0.1000 deg. # Detector_2theta 0.0000 deg. # Polarization 0.990 # Alpha 0.0000 deg. # Kappa 0.0000 deg. # Phi 0.0000 deg. # Phi_increment 0.1000 deg. # Omega 0.0000 deg. # Omega_increment 0.1000 deg. # Chi 0.0000 deg. # Chi_increment 0.1000 deg. # Oscillation_axis X, CW # N_oscillations 1
The NDFileNetTIFF class documentation describes this class in detail.
The NDFileTIFF plugin is created with the NDFileTIFFConfigure command, either from C/C++ or from the EPICS IOC shell.
NDFileTIFFConfigure (const char *portName, int queueSize, int blockingCallbacks, const char *NDArrayPort, int NDArrayAddr, size_t maxMemory, int priority, int stackSize)
For details on the meaning of the parameters to this function refer to the detailed documentation on the NDFileTIFFConfigure function in the NDFileTIFF.cpp documentation and in the documentation for the constructor for the NDFileTIFF class.


--- layout: archive title: Zulip Chat Archive permalink: /stream/113489-new-members/topic/list.2Enth_le.html ---
hey y'all, looking at the implementation of list.nth_le
, and i was confused about how the definition works
ref: https://github.com/leanprover/lean/blob/master/library/init/data/list/basic.lean#L90-L93
@[simp] def nth_le : Π (l : list α) (n), n < l.length → α | [] n h := absurd h (not_lt_zero n) | (a :: l) 0 h := a | (a :: l) (n+1) h := nth_le l n (le_of_succ_le_succ h)
in particular, how can it use le_of_succ_le_succ
on h
when h
is defining a strict inequality? i'm trying to replicate similar behavior but Lean is complaining about the differences in equality
On nat, a < b
is defined to mean a + 1 <= b
so this is a bit of a dirty hack
example (a b : ℕ) : a < b ↔ a + 1 ≤ b := iff.rfl
hahaha oh no that is definitely a dirty hack
For more readability they should also apply a + 1 <= b -> a < b
but this theorem might not even be in the library because it's true by definition :-/
maybe nat.lt_of_succ_le
?
lemma lt_of_succ_le {a b : ℕ} (h : succ a ≤ b) : a < b := h
-- from core.
i'll just provide a more explicit proof--i'm rewriting some code for the purposes of a presentation on why SWEs should like dependent typing so it's better if it's more explicit
Note that the core library already has a lemma called nat.lt_of_succ_lt_succ
(see this link, where it's just defined as a synonym for le_of_succ_le_succ
, but with the right type annotation)
Last updated: Apr 24 2020 at 19:02 UTC


Hi, I’m Nikolaus and I’m a PhD student in Visual Analytics at TU Wien (my publications). I was formerly employed by Artory (2017–2019) and Zalando (2014–2017). When I have time I like to do random programming things, mostly to learn.
This is an overview of some projects I did so far, with the occasional blog post mixed in:
-
{{ range where .Site.Pages ".Section" "in" (slice "project" "post") }}
{{ if eq .Kind "page" }}
- {{ if in .Params.tags "post" }}✍{{ end }} {{.Title}} {{ end }} {{ end }}


{{ .Hugo.Generator }}
{{ .Title }}
{{ $baseURL := .Site.BaseURL }}
Toggle navigation
Cr
i
mson K
i
ndness
About
About Crimson Kindness
Officers {{ .Site.Params.academicYear }}
Join
Events
Shop
Contact


Looking to flat share
$250-$400 Weekly Budget
No Other Requirements
Average Review: ★ ★ ★ ★ ★
Looking to flat share
$250-$400 Weekly Budget
No Other Requirements
Average Review: ★ ★ ★ ★ ★
Looking to for private room
$400-500 Weekly Budget
Must have car park
Average Review: ★ ★ ★ ★ ★
Looking to room share
$250-$300 Weekly Budget
No Other Requirements
Average Review: ★ ★ ★ ★ ★
Looking to flat share
$250-$400 Weekly Budget
Short term
Average Review: ★ ★ ★ ★ ☆
Looking to flat share
$250-$400 Weekly Budget
No Other Requirements
Average Review: ★ ★ ★ ★ ☆


Student Registration Form
FIRST NAME* :
LAST NAME* :
CLASS* :
PASSING YEAR :
PERCENTAGE OF MARKS :
Gender Male Female


Functions for exploring and visualising estimation results
obtained with BayesX, a free software for estimating structured additive
regression models (<http://www.BayesX.org>). In addition,
functions that allow to read, write and manipulate map objects that are required in spatial
analyses performed with BayesX.
| Version: |
0.3-0 |
| Depends: |
shapefiles |
| Imports: |
sp, maptools, colorspace, coda, splines, methods |
| Suggests: |
spdep, akima, gpclib, rgeos |
| Published: |
2018-05-18 |
| Author: |
Nikolaus Umlauf [aut, cre],
Thomas Kneib [aut],
Nadja Klein [aut],
Felix Heinzl [ctb],
Andreas Brezger [ctb],
Daniel Sabanes Bove [ctb] |
| Maintainer: |
Nikolaus Umlauf <Nikolaus.Umlauf at uibk.ac.at> |
| License: |
GPL-2 | GPL-3 |
| NeedsCompilation: |
no |
| Materials: |
ChangeLog |
| In views: |
Bayesian |
| CRAN checks: |
BayesX results |


similarity.Rmd
Reproducing tutorial on similarity.
First preprocess the corpus.
library(gensimr)
set.seed(42) # rerproducability
# sample data
data(corpus, package = "gensimr")
print(corpus)
#> [1] "Human machine interface for lab abc computer applications"
#> [2] "A survey of user opinion of computer system response time"
#> [3] "The EPS user interface management system"
#> [4] "System and human system engineering testing of EPS"
#> [5] "Relation of user perceived response time to error measurement"
#> [6] "The generation of random binary unordered trees"
#> [7] "The intersection graph of paths in trees"
#> [8] "Graph minors IV Widths of trees and well quasi ordering"
#> [9] "Graph minors A survey"
# preprocess corpus
docs <- prepare_documents(corpus)
#> → Preprocessing 9 documents
#> ← 9 documents after perprocessing
docs[[1]] # print first preprocessed document
#> [[1]]
#> [1] "human"
#>
#> [[2]]
#> [1] "interface"
#>
#> [[3]]
#> [1] "computer"
Once preprocessed we can build a dictionary.
dictionary <- corpora_dictionary(docs)
A dictionary essentially assigns an integer to each term.
doc2bow
simply applies the method of the same name to every documents (see example below); it counts the number of occurrences of each distinct word, converts the word to its integer word id and returns the result as a sparse vector.
# native method to a single document
dictionary$doc2bow(docs[[1]])
#> [(0, 1), (1, 1), (2, 1)]
# apply to all documents
corpus_bow <- doc2bow(dictionary, docs)
Then serialise to matrix market format, the function returns the path to the file (this is saved on disk for efficiency), if no path is passed then a temp file is created. Here we set auto_delete
to FALSE
otherwise the corpus is deleted after first use. Note this means you should manually delete it with delete_mmcorpus
.
(corpus_mm <- serialize_mmcorpus(corpus_bow, auto_delete = FALSE))
#> ℹ Path: /var/folders/n9/ys9t1h091jq80g4hww24v8g0n7v578/T//Rtmpl238UF/file440237cac478.mm
#> ✔ Temp file
#> ✖ Delete after use
Then initialise a model, we’re going to use a Latent Similarity Indexing method later on (model_lsi
) which requires td-idf.
tfidf <- model_tfidf(corpus_mm)
We can then use the model to transform our original corpus.
corpus_transformed <- wrap(tfidf, corpus_bow)
Now we can compare similarity between our preprocessed corpus and a new document.
lsi <- model_lsi(corpus_transformed, id2word = dictionary)
mm <- read_serialized_mmcorpus(corpus_mm)
new_document <- "A human and computer interaction"
preprocessed_new_document <- preprocess(new_document, min_freq = 0)
vec_bow <- doc2bow(dictionary, preprocessed_new_document)
vec_lsi <- wrap(lsi, vec_bow)
wrapped_lsi <- wrap(lsi, mm)
index <- similarity_matrix(wrapped_lsi)
sims <- wrap(index, vec_lsi)
get_similarity(sims)
#> # A tibble: 9 x 2
#> doc cosine
#> <dbl> <dbl>
#> 1 0 6.02e- 1
#> 2 3 4.32e- 1
#> 3 8 1.12e- 8
#> 4 5 0.
#> 5 6 -9.31e-10
#> 6 7 -7.45e- 9
#> 7 1 -2.39e- 2
#> 8 2 -2.93e- 2
#> 9 4 -3.62e- 2
You can also compare documents in the corpora with one another. The method is slightly different to improve computational efficiency. Note that we set the number of features to the number of words in the dictionary.
The visualisation (matrix of cosine similarities) reveals the two clusters of documents again: as stated in table 2 from this paper, the example corpus (data(corpus)
) essentially has two classes of documents. First five are about human-computer interaction and the other four are about graphs.
# build model
index2 <- similarity(corpus_mm, num_features = reticulate::py_len(dictionary))
# query all similarities
sims <- wrap(index2, corpus_bow, to_r = TRUE)
sims_long <- reshape2::melt(sims)
library(ggplot2)
#> Warning: package 'ggplot2' was built under R version 3.5.2
sims_long %>%
dplyr::mutate_at(dplyr::vars(c("Var1", "Var2")), as.factor) %>%
ggplot(aes(Var1, Var2)) +
geom_tile(aes(fill = value)) +
theme(
panel.background = element_rect(fill = "#f4f1e6"),
plot.background = element_rect(fill = "#f4f1e6"),
legend.background = element_rect(fill = "#f4f1e6")
) +
xlab("Document") +
ylab("Document")
Clean up, delete the corpus.
delete_mmcorpus(corpus_mm)
#> ✔ Temp unlinked


A Canvas is the generic drawable control. Most things come from Canvas. I['ve] [plan to] include[d] a chunk of drawing and text routines to make this an effective base as well as unifying BackColor, Caption etc...
TGUI_Master is a special GUI_Element which is designed to be a parent and draw nothing but itself. Its a special case because it can be given a surface to draw upon
:Generic Checkbox Object. Click to change its value. Can also act as a radio button by changing the ExcGroup to be less then 0 (and the same as the other now radio buttons). It only looks through one level of parent for siblings of a CheckBox type.
:Generic Testbox Object. It could probably still be classified as unfinished owing to the fact that its cursor is still a caret('ˆ'), clicks don't move the cursor and it sticks to showing the left side of its contents


|
Power Platform Developer
SSW Sydney
Are you a low-code developer who wants to work with our team of Microsoft full-stack developers and designers on a wide variety of exciting corporate projects?
This role requires someone who can work closely with clients, think critically, and create the right solution for the right job. The crucial skills for this role include Microsoft Power Platform and ideally Dynamics 365.
Read More
|
|
Full Stack .NET Developer
SSW Sydney, Brisbane, Melbourne, Newcastle
This role requires great communication skills and solid experience in delivering production-ready web solutions. You will be working with our expert developers and designers in a wide variety of exciting enterprise projects.
This role requires someone who can work closely with clients, think critically, and create the right solution for the right job. .NET experience is a must.
Read More
|


The Rdbhost.com service provides SQL databases accessible with the full power of SQL, directly from the browser, or from your remote Python app.
The Rdbhdb module provides a Python DB API v2 interface for working with SQL databases hosted on Rdbhost.com. As of version 0.9.6, it also supports asynchronous access under the Asyncio framework.
For this module to be at all useful, you need an account on Rdbhost.com; accounts are free and easy to create, at the http://www.rdbhost.com website. Once logged into your account, visit the ‘Role Manager’ page and cut and paste the super role name and authcode.
The module works with Python 2.5 and up, or Python 3.1 and up. The Asyncio features are only available for version 3.4 (and I assume 3.3 with Asyncio installed).
Installation:
pip install rdbhdb
Import the module, using version specific import syntax.
Python 2:
from rdbhdb import rdbhdb
from rdbhdb import extensions
Python 3:
import rdbhdb
from rdbhdb import extensions
The extensions submodule is optional, and provides dictionary style cursors.
Open a connection with the connect function. If you are using Asyncio, add a keyword parameter asyncio=True.
conn = rdbhdb.connect(<role>, <authcode>)
conn = rdbhdb.connect(<role>, <authcode>, asyncio=True)
Create a cursor from the connection. If you want a dictionary cursor, provide a cursor factory, and if you are using Asyncio, use an async cursor factory:
cur = conn.cursor()
dictCur = conn.cursor(cursor_factory=extensions.DictCursor)
asyncCur = conn.cursor(cursor_factory=extensions.AsyncDictCursor)
To submit a query to the server, use one of the .execute methods:
cur.execute(<sql>, <params>)
cur.executemany(<sql>, <set of params>)
The sql can be one SQL statement, or an aggregate of multiple statements joined with ‘;’. Params can be a list or a dictionary, depending on value of .paramstyle. For .executemany(), params is a list of param sets, each of which is a dictionary or list.
With Asyncio, these methods are coroutines, and call them with yield from:
yield from cur.execute(<sql>, <params>)
You can, alternatively, use callbacks by creating a Future and attaching the callback:
task = asyncio.Task(cur.execute(<sql>, <params<))
task.add_done_callback(when_done)
yield from async.wait([task])
If the query will yield more than 100 records, and you do not provide an explicit LIMIT clause in the query, the execute call will raise an exception. With an explicit LIMIT clause, you can retrieve up to 1000 records.
After the execute method returns, the data is available on the cursor using the .fetch methods:
row = cur.fetchone()
rows = cur.fetchmany(<ct>)
rows = cur.fetchall()
Each of these can be called repeatedly, until all data is received. These are plain methods, even under Asyncio, as the data is on the client already when the .execute completes, and there is no further fetching wait.
If the sql was multiple statements, then each will have its own set of results, and .nextset will advance to the next. Each statement will have a result set, possibly empty.
cur.execute('SELECT 1 AS one; SELECT 2 AS two;',)
first = cur.fetchall() # ({'one': 1}, )
cur.nextset() # True
second = cur.fetchall() # ({'two': 2}, )
cur.nextset() # None
String data provided as parameters can be unicode or ‘utf-8’ encoded strings. Data that is to be handled as binary (no decoding) should be bytes type in Python 3 or buffer in Python 2.
Some attributes of the cursor, required by the API, are:
.description = tuple of tuples, one tuple for each field/column
each field-tuple is (name, type_code, None, None, None, None, None)
type_code is the PostgreSQL field type code for the field.
.rowcount = how many rows were retrieved by cursor.
.array_size = default count for .fetchmany()
Some additional methods of the cursor are:
.close() - closes cursor. further use raises exception.
The connection objects have the following methods:
.close() - closes connection. further use raises exception.
.commit() - a noop, as each request is automatically wrapped in a transaction, with closing commit.
The API defines this, but has no meaning for the Rdbhost implementaion.:
.rollback() - not implemented, so use will raise exception.


Faraway Domes in Warialda wins NSW Tourism Award
by Madeline LinkOut in the scrub of Warialda an unusual white dome is the only sign of life.
It's Faraway Domes, a glamping experience started by the Munsie farming family once they'd sold all their stock in the drought.
The foray into customer service paid off, it's just earned them a gold NSW Tourism Award for New Tourism Business.
"It was a big risk, but in January this year we had fully de-stocked our cattle and there was no income from the farming operation," Kate Munsie said.
READ MORE:
- Moree man named first Aboriginal chair of basin community committee
- Farmer and filmmaker team up to turn sh** into smiles
- Jail for trespasse: Marshall lauds historic right to farm bill
"We saw a niche in the market to invite city people to come and experience the bush, and give back to struggling communities."
The dome has been such a success that the family has lodged a development application for a second.
The new dome would be big enough to accommodate families and a few kilometres from the original on the 10,000-acre property, Ms Munsie said.
"It's a family-run business and everyone has been able to bring their skills to it," she said.
"All our feedback has been really positive and we're very proud of it because it's been a lot of hard work.
"The elevated deck that looks over the valley with the outdoor bathtub has been a hit so we'll keep that for the second dome."
A plunge pool is in the works for the existing dome, and the second could see style inspiration from Ms Munsie's recent trip to South America.
"It's top secret at the moment but we're drawing inspiration from everywhere," she said.
The win earns Faraway Domes an automatic entry into the Australian Tourism Awards in Canberra in 2020.
Among the region's winners was the Nundle Woolen Mill with silver for Cultural Tourism.


|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object java.util.AbstractMap org.apache.commons.collections.map.AbstractHashedMap
public class AbstractHashedMap
An abstract implementation of a hash-based map which provides numerous points for subclasses to override.
This class implements all the features necessary for a subclass hash-based map.
Key-value entries are stored in instances of the HashEntry
class,
which can be overridden and replaced. The iterators can similarly be replaced,
without the need to replace the KeySet, EntrySet and Values view classes.
Overridable methods are provided to change the default hashing behaviour, and to change how entries are added to and removed from the map. Hopefully, all you need for unusual subclasses is here.
NOTE: From Commons Collections 3.1 this class extends AbstractMap. This is to provide backwards compatibility for ReferenceMap between v3.0 and v3.1. This extends clause will be removed in v4.0.
| Nested Class Summary | |
|---|---|
protected static class |
AbstractHashedMap.EntrySet
EntrySet implementation. |
protected static class |
AbstractHashedMap.EntrySetIterator
EntrySet iterator. |
protected static class |
AbstractHashedMap.HashEntry
HashEntry used to store the data. |
protected static class |
AbstractHashedMap.HashIterator
Base Iterator |
protected static class |
AbstractHashedMap.HashMapIterator
MapIterator implementation. |
protected static class |
AbstractHashedMap.KeySet
KeySet implementation. |
protected static class |
AbstractHashedMap.KeySetIterator
KeySet iterator. |
protected static class |
AbstractHashedMap.Values
Values implementation. |
protected static class |
AbstractHashedMap.ValuesIterator
Values iterator. |
| Nested classes/interfaces inherited from interface java.util.Map |
|---|
java.util.Map.Entry |
| Field Summary | |
|---|---|
protected AbstractHashedMap.HashEntry[] |
data
Map entries |
protected static int |
DEFAULT_CAPACITY
The default capacity to use |
protected static float |
DEFAULT_LOAD_FACTOR
The default load factor to use |
protected static int |
DEFAULT_THRESHOLD
The default threshold to use |
protected AbstractHashedMap.EntrySet |
entrySet
Entry set |
protected static java.lang.String |
GETKEY_INVALID
|
protected static java.lang.String |
GETVALUE_INVALID
|
protected AbstractHashedMap.KeySet |
keySet
Key set |
protected float |
loadFactor
Load factor, normally 0.75 |
protected static int |
MAXIMUM_CAPACITY
The maximum capacity allowed |
protected int |
modCount
Modification count for iterators |
protected static java.lang.String |
NO_NEXT_ENTRY
|
protected static java.lang.String |
NO_PREVIOUS_ENTRY
|
protected static java.lang.Object |
NULL
An object for masking null |
protected static java.lang.String |
REMOVE_INVALID
|
protected static java.lang.String |
SETVALUE_INVALID
|
protected int |
size
The size of the map |
protected int |
threshold
Size at which to rehash |
protected AbstractHashedMap.Values |
values
Values |
| Constructor Summary | |
|---|---|
protected |
AbstractHashedMap()
Constructor only used in deserialization, do not use otherwise. |
protected |
AbstractHashedMap(int initialCapacity)
Constructs a new, empty map with the specified initial capacity and default load factor. |
protected |
AbstractHashedMap(int initialCapacity,
float loadFactor)
Constructs a new, empty map with the specified initial capacity and load factor. |
protected |
AbstractHashedMap(int initialCapacity,
float loadFactor,
int threshold)
Constructor which performs no validation on the passed in parameters. |
protected |
AbstractHashedMap(java.util.Map map)
Constructor copying elements from another map. |
| Method Summary | |
|---|---|
protected void |
addEntry(AbstractHashedMap.HashEntry entry,
int hashIndex)
Adds an entry into this map. |
protected void |
addMapping(int hashIndex,
int hashCode,
java.lang.Object key,
java.lang.Object value)
Adds a new key-value mapping into this map. |
protected int |
calculateNewCapacity(int proposedCapacity)
Calculates the new capacity of the map. |
protected int |
calculateThreshold(int newCapacity,
float factor)
Calculates the new threshold of the map, where it will be resized. |
protected void |
checkCapacity()
Checks the capacity of the map and enlarges it if necessary. |
void |
clear()
Clears the map, resetting the size to zero and nullifying references to avoid garbage collection issues. |
protected java.lang.Object |
clone()
Clones the map without cloning the keys or values. |
boolean |
containsKey(java.lang.Object key)
Checks whether the map contains the specified key. |
boolean |
containsValue(java.lang.Object value)
Checks whether the map contains the specified value. |
protected java.lang.Object |
convertKey(java.lang.Object key)
Converts input keys to another object for storage in the map. |
protected AbstractHashedMap.HashEntry |
createEntry(AbstractHashedMap.HashEntry next,
int hashCode,
java.lang.Object key,
java.lang.Object value)
Creates an entry to store the key-value data. |
protected java.util.Iterator |
createEntrySetIterator()
Creates an entry set iterator. |
protected java.util.Iterator |
createKeySetIterator()
Creates a key set iterator. |
protected java.util.Iterator |
createValuesIterator()
Creates a values iterator. |
protected void |
destroyEntry(AbstractHashedMap.HashEntry entry)
Kills an entry ready for the garbage collector. |
protected void |
doReadObject(java.io.ObjectInputStream in)
Reads the map data from the stream. |
protected void |
doWriteObject(java.io.ObjectOutputStream out)
Writes the map data to the stream. |
protected void |
ensureCapacity(int newCapacity)
Changes the size of the data structure to the capacity proposed. |
protected int |
entryHashCode(AbstractHashedMap.HashEntry entry)
Gets the hashCode field from a HashEntry . |
protected java.lang.Object |
entryKey(AbstractHashedMap.HashEntry entry)
Gets the key field from a HashEntry . |
protected AbstractHashedMap.HashEntry |
entryNext(AbstractHashedMap.HashEntry entry)
Gets the next field from a HashEntry . |
java.util.Set |
entrySet()
Gets the entrySet view of the map. |
protected java.lang.Object |
entryValue(AbstractHashedMap.HashEntry entry)
Gets the value field from a HashEntry . |
boolean |
equals(java.lang.Object obj)
Compares this map with another. |
java.lang.Object |
get(java.lang.Object key)
Gets the value mapped to the key specified. |
protected AbstractHashedMap.HashEntry |
getEntry(java.lang.Object key)
Gets the entry mapped to the key specified. |
protected int |
hash(java.lang.Object key)
Gets the hash code for the key specified. |
int |
hashCode()
Gets the standard Map hashCode. |
protected int |
hashIndex(int hashCode,
int dataSize)
Gets the index into the data storage for the hashCode specified. |
protected void |
init()
Initialise subclasses during construction, cloning or deserialization. |
boolean |
isEmpty()
Checks whether the map is currently empty. |
protected boolean |
isEqualKey(java.lang.Object key1,
java.lang.Object key2)
Compares two keys, in internal converted form, to see if they are equal. |
protected boolean |
isEqualValue(java.lang.Object value1,
java.lang.Object value2)
Compares two values, in external form, to see if they are equal. |
java.util.Set |
keySet()
Gets the keySet view of the map. |
MapIterator |
mapIterator()
Gets an iterator over the map. |
java.lang.Object |
put(java.lang.Object key,
java.lang.Object value)
Puts a key-value mapping into this map. |
void |
putAll(java.util.Map map)
Puts all the values from the specified map into this map. |
java.lang.Object |
remove(java.lang.Object key)
Removes the specified mapping from this map. |
protected void |
removeEntry(AbstractHashedMap.HashEntry entry,
int hashIndex,
AbstractHashedMap.HashEntry previous)
Removes an entry from the chain stored in a particular index. |
protected void |
removeMapping(AbstractHashedMap.HashEntry entry,
int hashIndex,
AbstractHashedMap.HashEntry previous)
Removes a mapping from the map. |
protected void |
reuseEntry(AbstractHashedMap.HashEntry entry,
int hashIndex,
int hashCode,
java.lang.Object key,
java.lang.Object value)
Reuses an existing key-value mapping, storing completely new data. |
int |
size()
Gets the size of the map. |
java.lang.String |
toString()
Gets the map as a String. |
protected void |
updateEntry(AbstractHashedMap.HashEntry entry,
java.lang.Object newValue)
Updates an existing key-value mapping to change the value. |
java.util.Collection |
values()
Gets the values view of the map. |
| Methods inherited from class java.lang.Object |
|---|
finalize, getClass, notify, notifyAll, wait, wait, wait |
| Field Detail |
|---|
protected static final java.lang.String NO_NEXT_ENTRY
protected static final java.lang.String NO_PREVIOUS_ENTRY
protected static final java.lang.String REMOVE_INVALID
protected static final java.lang.String GETKEY_INVALID
protected static final java.lang.String GETVALUE_INVALID
protected static final java.lang.String SETVALUE_INVALID
protected static final int DEFAULT_CAPACITY
protected static final int DEFAULT_THRESHOLD
protected static final float DEFAULT_LOAD_FACTOR
protected static final int MAXIMUM_CAPACITY
protected static final java.lang.Object NULL
protected transient float loadFactor
protected transient int size
protected transient AbstractHashedMap.HashEntry[] data
protected transient int threshold
protected transient int modCount
protected transient AbstractHashedMap.EntrySet entrySet
protected transient AbstractHashedMap.KeySet keySet
protected transient AbstractHashedMap.Values values
| Constructor Detail |
|---|
protected AbstractHashedMap()
protected AbstractHashedMap(int initialCapacity, float loadFactor, int threshold)
initialCapacity
- the initial capacity, must be a power of twoloadFactor
- the load factor, must be > 0.0f and generally < 1.0fthreshold
- the threshold, must be sensibleprotected AbstractHashedMap(int initialCapacity)
initialCapacity
- the initial capacity
java.lang.IllegalArgumentException
- if the initial capacity is less than oneprotected AbstractHashedMap(int initialCapacity, float loadFactor)
initialCapacity
- the initial capacityloadFactor
- the load factor
java.lang.IllegalArgumentException
- if the initial capacity is less than one
java.lang.IllegalArgumentException
- if the load factor is less than or equal to zeroprotected AbstractHashedMap(java.util.Map map)
map
- the map to copy
java.lang.NullPointerException
- if the map is null| Method Detail |
|---|
protected void init()
public java.lang.Object get(java.lang.Object key)
get
in interface java.util.Map
get
in class java.util.AbstractMap
key
- the key
public int size()
size
in interface java.util.Map
size
in class java.util.AbstractMap
public boolean isEmpty()
isEmpty
in interface java.util.Map
isEmpty
in class java.util.AbstractMap
public boolean containsKey(java.lang.Object key)
containsKey
in interface java.util.Map
containsKey
in class java.util.AbstractMap
key
- the key to search for
public boolean containsValue(java.lang.Object value)
containsValue
in interface java.util.Map
containsValue
in class java.util.AbstractMap
value
- the value to search for
public java.lang.Object put(java.lang.Object key, java.lang.Object value)
put
in interface java.util.Map
put
in class java.util.AbstractMap
key
- the key to addvalue
- the value to add
public void putAll(java.util.Map map)
This implementation iterates around the specified map and
uses put(Object, Object)
.
putAll
in interface java.util.Map
putAll
in class java.util.AbstractMap
map
- the map to add
java.lang.NullPointerException
- if the map is nullpublic java.lang.Object remove(java.lang.Object key)
remove
in interface java.util.Map
remove
in class java.util.AbstractMap
key
- the mapping to remove
public void clear()
clear
in interface java.util.Map
clear
in class java.util.AbstractMap
protected java.lang.Object convertKey(java.lang.Object key)
The reverse conversion can be changed, if required, by overriding the getKey() method in the hash entry.
key
- the key convert
protected int hash(java.lang.Object key)
key
- the key to get a hash code for
protected boolean isEqualKey(java.lang.Object key1, java.lang.Object key2)
key1
- the first key to compare passed in from outsidekey2
- the second key extracted from the entry via entry.key
protected boolean isEqualValue(java.lang.Object value1, java.lang.Object value2)
value1
- the first value to compare passed in from outsidevalue2
- the second value extracted from the entry via getValue()
protected int hashIndex(int hashCode, int dataSize)
hashCode
- the hash code to usedataSize
- the size of the data to pick a bucket from
protected AbstractHashedMap.HashEntry getEntry(java.lang.Object key)
This method exists for subclasses that may need to perform a multi-step process accessing the entry. The public methods in this class don't use this method to gain a small performance boost.
key
- the key
protected void updateEntry(AbstractHashedMap.HashEntry entry, java.lang.Object newValue)
This implementation calls setValue()
on the entry.
Subclasses could override to handle changes to the map.
entry
- the entry to updatenewValue
- the new value to storeprotected void reuseEntry(AbstractHashedMap.HashEntry entry, int hashIndex, int hashCode, java.lang.Object key, java.lang.Object value)
This implementation sets all the data fields on the entry. Subclasses could populate additional entry fields.
entry
- the entry to update, not nullhashIndex
- the index in the data arrayhashCode
- the hash code of the key to addkey
- the key to addvalue
- the value to addprotected void addMapping(int hashIndex, int hashCode, java.lang.Object key, java.lang.Object value)
This implementation calls createEntry()
, addEntry()
and checkCapacity()
.
It also handles changes to modCount
and size
.
Subclasses could override to fully control adds to the map.
hashIndex
- the index into the data array to store athashCode
- the hash code of the key to addkey
- the key to addvalue
- the value to addprotected AbstractHashedMap.HashEntry createEntry(AbstractHashedMap.HashEntry next, int hashCode, java.lang.Object key, java.lang.Object value)
This implementation creates a new HashEntry instance. Subclasses can override this to return a different storage class, or implement caching.
next
- the next entry in sequencehashCode
- the hash code to usekey
- the key to storevalue
- the value to store
protected void addEntry(AbstractHashedMap.HashEntry entry, int hashIndex)
This implementation adds the entry to the data storage table. Subclasses could override to handle changes to the map.
entry
- the entry to addhashIndex
- the index into the data array to store atprotected void removeMapping(AbstractHashedMap.HashEntry entry, int hashIndex, AbstractHashedMap.HashEntry previous)
This implementation calls removeEntry()
and destroyEntry()
.
It also handles changes to modCount
and size
.
Subclasses could override to fully control removals from the map.
entry
- the entry to removehashIndex
- the index into the data structureprevious
- the previous entry in the chainprotected void removeEntry(AbstractHashedMap.HashEntry entry, int hashIndex, AbstractHashedMap.HashEntry previous)
This implementation removes the entry from the data storage table. The size is not updated. Subclasses could override to handle changes to the map.
entry
- the entry to removehashIndex
- the index into the data structureprevious
- the previous entry in the chainprotected void destroyEntry(AbstractHashedMap.HashEntry entry)
This implementation prepares the HashEntry for garbage collection. Subclasses can override this to implement caching (override clear as well).
entry
- the entry to destroyprotected void checkCapacity()
This implementation uses the threshold to check if the map needs enlarging
protected void ensureCapacity(int newCapacity)
newCapacity
- the new capacity of the array (a power of two, less or equal to max)protected int calculateNewCapacity(int proposedCapacity)
proposedCapacity
- the proposed capacity
protected int calculateThreshold(int newCapacity, float factor)
newCapacity
- the new capacityfactor
- the load factor
protected AbstractHashedMap.HashEntry entryNext(AbstractHashedMap.HashEntry entry)
next
field from a HashEntry
.
Used in subclasses that have no visibility of the field.
entry
- the entry to query, must not be null
next
field of the entry
java.lang.NullPointerException
- if the entry is nullprotected int entryHashCode(AbstractHashedMap.HashEntry entry)
hashCode
field from a HashEntry
.
Used in subclasses that have no visibility of the field.
entry
- the entry to query, must not be null
hashCode
field of the entry
java.lang.NullPointerException
- if the entry is nullprotected java.lang.Object entryKey(AbstractHashedMap.HashEntry entry)
key
field from a HashEntry
.
Used in subclasses that have no visibility of the field.
entry
- the entry to query, must not be null
key
field of the entry
java.lang.NullPointerException
- if the entry is nullprotected java.lang.Object entryValue(AbstractHashedMap.HashEntry entry)
value
field from a HashEntry
.
Used in subclasses that have no visibility of the field.
entry
- the entry to query, must not be null
value
field of the entry
java.lang.NullPointerException
- if the entry is nullpublic MapIterator mapIterator()
A MapIterator returns the keys in the map. It also provides convenient methods to get the key and value, and set the value. It avoids the need to create an entrySet/keySet/values object. It also avoids creating the Map.Entry object.
mapIterator
in interface IterableMap
public java.util.Set entrySet()
mapIterator()
.
entrySet
in interface java.util.Map
entrySet
in class java.util.AbstractMap
protected java.util.Iterator createEntrySetIterator()
public java.util.Set keySet()
mapIterator()
.
keySet
in interface java.util.Map
keySet
in class java.util.AbstractMap
protected java.util.Iterator createKeySetIterator()
public java.util.Collection values()
mapIterator()
.
values
in interface java.util.Map
values
in class java.util.AbstractMap
protected java.util.Iterator createValuesIterator()
protected void doWriteObject(java.io.ObjectOutputStream out) throws java.io.IOException
put()
is used.
Serialization is not one of the JDK's nicest topics. Normal serialization will
initialise the superclass before the subclass. Sometimes however, this isn't
what you want, as in this case the put()
method on read can be
affected by subclass state.
The solution adopted here is to serialize the state data of this class in
this protected method. This method must be called by the
writeObject()
of the first serializable subclass.
Subclasses may override if they have a specific field that must be present on read before this implementation will work. Generally, the read determines what must be serialized here, if anything.
out
- the output stream
java.io.IOException
protected void doReadObject(java.io.ObjectInputStream in) throws java.io.IOException, java.lang.ClassNotFoundException
put()
is used.
Serialization is not one of the JDK's nicest topics. Normal serialization will
initialise the superclass before the subclass. Sometimes however, this isn't
what you want, as in this case the put()
method on read can be
affected by subclass state.
The solution adopted here is to deserialize the state data of this class in
this protected method. This method must be called by the
readObject()
of the first serializable subclass.
Subclasses may override if the subclass has a specific field that must be present
before put()
or calculateThreshold()
will work correctly.
in
- the input stream
java.io.IOException
java.lang.ClassNotFoundException
protected java.lang.Object clone()
To implement clone()
, a subclass must implement the
Cloneable
interface and make this method public.
clone
in class java.util.AbstractMap
public boolean equals(java.lang.Object obj)
equals
in interface java.util.Map
equals
in class java.util.AbstractMap
obj
- the object to compare to
public int hashCode()
hashCode
in interface java.util.Map
hashCode
in class java.util.AbstractMap
public java.lang.String toString()
toString
in class java.util.AbstractMap
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |


| Constellation Action | Keyboard Shortcut | User Action | Menu Icon |
|---|---|---|---|
| Open Analytic View | Ctrl + Shift + Z | Views -> Analytic View |
|
The Analytic View is a tool for computing analytics across a graph in a user-friendly manner. This is done by posing complex algorithms as simple questions you might ask of the graph. These algorithms range in functionality from scoring based on the structure of a graph, to clustering and partitioning the graph, and even analysing content stored on a graph.
There are a couple of ways you can define a question you want to answer for your graph. The first option is to choose a pre-defined question from the "Questions" list. The "Analytics" list will be populated with the analytics specified by that question. The alternative option is to define your own custom question by selecting a category under the "Categories" list, and then selecting any number of analytics found the "Analytics" list.
For each of the analytics selected, parameters can be viewed in the pane at the bottom of the Analytic View. For a pre-defined question these parameter values are pre-defined and can't be edited but are configurable if constructing a custom-made question. You can also view help pages for selected analytics here by clicking on the "Documentation" tab.
Once you have finished configuring your question, you can run it by pressing the button.
Once a question has finished running, the results are compiled into a table which is displayed at the top of the view. You can also visualise these results on the graph with options to add colour, size, and show/hide filters.


Diverse range of projects to educate, entertain & motivate action.
At NewView.Media, we take pride as video producers that facilitate growth for entrepreneurial causes across a range of industries, want to see our portfolio?
- All
- Crowdfunding
- Events
- Marketing
- Real Estate
- Creative Content


Store
Basket
Address
Order
Payment
Confirmation
Your basket is currently empty
« Continue shopping
Next step »


Money Play. How should Red play 22?
pips Red=115 White=147
(CorrectAnswer= 0/0, ErrorScore= 0)
Red wants to dismantle his outside points but also wants to force White off his ace-point.
With this roll he can do either by playing 10/8, 10/4 or 10/8(2), 3/1(2)*.
The latter does both things but leaves an ungainly position while the former leaves an excellent structure.
It should perhaps come as no surprise that the two moves are tied in equity terms. Anything else is at least an error.
With this roll he can do either by playing 10/8, 10/4 or 10/8(2), 3/1(2)*.
The latter does both things but leaves an ungainly position while the former leaves an excellent structure.
It should perhaps come as no surprise that the two moves are tied in equity terms. Anything else is at least an error.
1. Cubeful 2-ply 10/4 10/8 Eq.: +0.812 0.721 0.097 0.002 - 0.279 0.039 0.000 2. Cubeful 2-ply 8/4 3/1*(2) Eq.: +0.803 (-0.009) 0.717 0.104 0.001 - 0.283 0.042 0.000 3. Cubeful 2-ply 10/8(2) 3/1*(2) Eq.: +0.800 (-0.012) 0.718 0.104 0.001 - 0.282 0.044 0.000 4. Cubeful 2-ply 10/6 3/1*(2) Eq.: +0.768 (-0.044) 0.698 0.121 0.002 - 0.302 0.054 0.001 5. Cubeful 2-ply 10/6(2) Eq.: +0.756 (-0.056) 0.709 0.104 0.002 - 0.291 0.047 0.000


RESUME
Name
Address
E-mail
Phone no.
Website
LinkedIn ID
DOB
Carrier Objective :
Education Qualification
Course
Board Name
Exam Name
Passing Year
Percantage
10 th
12 th
B.Tech
Extra Skill :
Personal Details
male
female
Father's Name
Mother's Name
Religion
Nationality
Declaration
Upload Document :
Place :
date :


Billlive
Toggle navigation
Home
Charts
Sign Up
Please enter an Email Address
Password must be atleast 8 characters.
{{errorMessage}}
Sign Up
Sign In


Chapter 1
This chapter simulates conversation that may occur when you decide you want to live on your own
Start the Game
OR
Choose a Different Chapter


Pay to another account using account number
Recharge any mobile sim, DTH servics
Pay Electricity Bill, Gas Bill and many more


I have done a wide range of hallucinogenic substances including LSD so when the idea of eating 'measly mushrooms' came about there was no doubt in my mind that it would be nothing, and I would probally only halluciante mildly if at all. I swallowed up the chocolate mushrooms I was given in a bad mood, because I had wanted to do a 'real drug' that night, possibly ecstacy but was unable to obtain such a drug. This bad mood I believe was my downfall.
After a good 30 minutes nothing was happened and I was frustrated. 'This sucks' I complained.  What ever I thought my night would be spent here, sober.
I sat there repeating the same thing in my head, over and over AND OVER again.  It began to repeat so violently it began to scare me. I could not make it stop. I closed my eyes, and screamed for it to stop in my head. Then like a hurricane the closed eye visuals hit me. Extreme ones at that. I was in a maze, a dark gothic looking maze and I could not get out. I then opened my eyes screaming stop. This was only the beginning of my worst expirience on any substance.
The hallucinations then began to unfold. They were nothing like the beautiful ones I had gotten on all the other hallucinogens I had done. They were all horrible, dark, scary, evil. My friends weren't even recognizable they were strangers to me. The room morphed into what looked like some sort of haunted place and the one plant in the room seemed to have grown into a huge creepy vine covering everything. Then I saw someone, rather something. Though everyone insists they were not real, they were real to me.
'Do you want to die?', the strange creature asked me. 'No', I screamed, 'I don't wanna die, leave me alone', I said warm tears rushing down my cheeks. 'Make this stop', 'I don't want to die'. 'Someone help me'. For the rest of the night I sat in a corner crying my eyes out screaming these phrases. No matter how hard my friends tried to comfort me I would not stop. They were not my friends to me, they were trying to kill me. Everyone, everything was. Warn out from all the screaming/crying I passed out in my corner, scared and alone.
My heart actually stopped beating claims one of my friends and they were thinking of taking me to the emergency room, but it only lasted for a few seconds so they decided to check first if I was breathing, I was. Now the only thing any of my friends were afraid of was the possible brain damage, which also didn't occur. Thank God. I was in a sort of comatose for an extended period of time, but thankfully I woke up in a normal state with full memory of my horrible night.
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.


University of Wisconsin - Madison
College of Engineering - Computer Engineering
Great GPA
Additional major with CS


Interface ITile
Interface for all tiles.
Inherited Members
Namespace: Fibula.Map.Contracts.Abstractions
Assembly: Fibula.Map.Contracts.dll
Syntax
public interface ITile : IThingContainer, ILocatable
Properties
| Improve this Doc View SourceBlocksLay
Gets a value indicating whether items in this tile block laying.
Declaration
bool BlocksLay { get; }
Property Value
| Type | Description |
|---|---|
| System.Boolean |
BlocksPass
Gets a value indicating whether items in this tile block passing.
Declaration
bool BlocksPass { get; }
Property Value
| Type | Description |
|---|---|
| System.Boolean |
BlocksThrow
Gets a value indicating whether items in this tile block throwing.
Declaration
bool BlocksThrow { get; }
Property Value
| Type | Description |
|---|---|
| System.Boolean |
Creatures
Gets the tile's creatures.
Declaration
IEnumerable<ICreature> Creatures { get; }
Property Value
| Type | Description |
|---|---|
| System.Collections.Generic.IEnumerable<ICreature> |
Flags
Gets the flags from this tile.
Declaration
byte Flags { get; }
Property Value
| Type | Description |
|---|---|
| System.Byte |
Ground
Gets the single ground item that a tile may have.
Declaration
IItem Ground { get; }
Property Value
| Type | Description |
|---|---|
| IItem |
LastModified
Gets the last date and time that this tile was modified.
Declaration
DateTimeOffset LastModified { get; }
Property Value
| Type | Description |
|---|---|
| System.DateTimeOffset |
LiquidPool
Gets the single liquid pool item that a tile may have.
Declaration
IItem LiquidPool { get; }
Property Value
| Type | Description |
|---|---|
| IItem |
TopCreature
Gets the creature that is on top based on the tile's stack order.
Declaration
ICreature TopCreature { get; }
Property Value
| Type | Description |
|---|---|
| ICreature |
TopItem
Gets the item that is on top based on the tile's stack order.
Declaration
IItem TopItem { get; }
Property Value
| Type | Description |
|---|---|
| IItem |
TopThing
Gets the thing that is on top based on the tile's stack order.
Declaration
IThing TopThing { get; }
Property Value
| Type | Description |
|---|---|
| IThing |
Methods
| Improve this Doc View SourceFindItemWithTypeId(UInt16)
Attempts to find an item in the tile with the given type.
Declaration
IItem FindItemWithTypeId(ushort typeId)
Parameters
| Type | Name | Description |
|---|---|---|
| System.UInt16 | typeId | The type to look for. |
Returns
| Type | Description |
|---|---|
| IItem | The item with such id, null otherwise. |
GetItemsToDescribeByPriority(Int32)
Attempts to get the tile's items to describe prioritized and ordered by their stack order.
Declaration
(IEnumerable<IItem> fixedItems, IEnumerable<IItem> normalItems) GetItemsToDescribeByPriority(int maxItemsToGet = 9)
Parameters
| Type | Name | Description |
|---|---|---|
| System.Int32 | maxItemsToGet | The maximum number of items to include in the result. |
Returns
| Type | Description |
|---|---|
| System.ValueTuple<System.Collections.Generic.IEnumerable<IItem>, System.Collections.Generic.IEnumerable<IItem>> | The items in the tile, split by those which are fixed and those considered normal. |
GetStackOrderOfThing(IThing)
Attempts to get the position in the stack for the given IThing.
Declaration
byte GetStackOrderOfThing(IThing thing)
Parameters
| Type | Name | Description |
|---|---|---|
| IThing | thing | The thing to find. |
Returns
| Type | Description |
|---|---|
| System.Byte | The position in the stack for the IThing, or System.Byte.MaxValue if its not found. |
IsPathBlocking(Byte)
Determines if this tile is considered to be blocking the path.
Declaration
bool IsPathBlocking(byte avoidTypes = 14)
Parameters
| Type | Name | Description |
|---|---|---|
| System.Byte | avoidTypes | The damage types to avoid when checking for path blocking. By default, all types are considered path blocking. |
Returns
| Type | Description |
|---|---|
| System.Boolean | True if the tile is considered path blocking, false otherwise. |
SetFlag(TileFlag)
Sets a flag on this tile.
Declaration
void SetFlag(TileFlag flag)
Parameters
| Type | Name | Description |
|---|---|---|
| TileFlag | flag | The flag to set. |


Numerical Systems
Andrew Oppenlander
Overview
- History of Numerical Systems
- Numbers with physical objects
- Numbers with a number line
History of Numerical Systems
Early Counting Systems
- Counting with fingers and tally makes
-
Egyptians - 3000 BCE
-
Roman Numerals
- Adaption of the Egyptian system
- I = 1
- X = 10
- XXIII = 23
Modern Counting Systems
- Used by Babylonians around 1750 BCE
- Base 60 system
- No concept of zero
Decimal Systems
- Egyptians used hyroglyph for "beautiful", nfr
- Concept of zero as a number used by Indians around 300 BCE
- Zero was refered to as sunya or "empty"/"void"
- Arabic version was brought to Europe and quickly replaced Roman Numerals
Negative Numbers
- Used in China and India from around 200 BCE
- Weren't accepted in Europe until 17th Century
Numbers as Physical Objects
1 - 3 = 0 ?
Can't have less than none physical objects
Numbers as on a Number Line
1 - 3 = 2 ?
To give the number context, we write it as -2.
Conclusion
- History of Number Systems
- Numbers with physical objects
- Numbers with a number line
Numbers haven't always existed as we know them.
Stay curious.


% include ./partials/head.html %>
List of supermarkets ordered by distance
Name
Distance
<% for(var i=0; i < supermarkets.length; i++) { %>
<%= supermarkets[i].name %>
<%= supermarkets[i].distance %> km
<% } %>
<% include ./partials/footer.html %>


Regional trends of Wildfires.
This page shows the regional trends of wild fires.
You can click on the graphs to filter by State.
Or, you can use the filters on the right hand side of the charts.
Goal: Understand Regional trends of Wildfires.
- Which top 5 States have the most Debris Burning wildfires?
- Which State has the largest Wildfires? What are the Causes of those Wildfires
- What are the main Causes of Wildfires in Hawaii and Puerto Rico?
Insights and Actions
- We see that California, Georgia, Texas, North Carolina and Florida have the most number of wildfires. You can see this by sorting the bar chart on the y-axis. It is surprising that we mostly associate wildfires with California but there are a lot of wildfires in places like Georgia, North Carolina and Florida.
- Lightning is the leading Cause in the North and South West regions of US whereas Debris burning is prominent in the Mid-West and Eastern regions of US.


In addition to creating and inserting content, the ability to alter the current content of a page is a key scenario in Web development. jQuery has functions tailored to specific situations where content needs to be altered:
wrap()
: wrap the matched elements with the specified contentwrapAll()
: wrap content around the matched elements as a groupunWrap()
: remove the parents from the matched elementsempty()
: remove all the child elements from the matched elementsremove()
: removes elements from the page, including any embedded data and event handlersdetach()
: removes elements from the page, but maintains embedded data and event handlersreplaceAll()
: replaces the matched elements with the specified contentreplaceWith()
: replaces matched elements with content or the results of a callback function
This is paragraph 1
This is paragraph 2
This is paragraph 3
This is paragraph 4
This is paragraph 5


An R package implementing a large scale k-nearest neighbor (KNN) classifier using the Lucene search engine.
covariates <- data.frame(rowIds = c(1,1,1,2,2,3),
covariateIds = c(10,11,12,10,11,12),
covariateValues = c(1,1,1,1,1,1))
outcomes <- data.frame(rowIds = c(1,2,3),
y = c(1,0,0))
dataForPrediction <- Andromeda::andromeda(covariates = covariates,
outcomes = outcomes)
indexFolder <- "s:/temp/lucene"
buildKnn(outcomes = dataForPrediction$outcomes,
covariates = dataForPrediction$covariates,
indexFolder = indexFolder)
prediction <- predictKnn(outcomes = dataForPrediction$outcomes,
covariates = dataForPrediction$covariates,
indexFolder = indexFolder,
k = 10,
weighted = TRUE)
BigKnn is an R package using the Java based Lucene search engine. The data for the KNN is stored in a folder on the local file system.
Running the package requires R with the package rJava installed. Also requires Java 1.8 or higher.
See the instructions here for configuring your R environment, including Java.
Use the following commands in R to install the BigKnn package:
install.packages("remotes")
remotes::install_github("ohdsi/BigKnn")
Documentation can be found on the package website.
PDF versions of the documentation are also available: * Package manual: BigKnn manual
Read here how you can contribute to this package.


Trump's presence at Madrid climate change talks would be a 'surprise': Spain's energy minister
MADRID (Reuters) - Spain’s acting energy minister said on Friday it would be a “surprise” if Donald Trump attended the upcoming United Nations’ COP25 climate change summit in Madrid.
The U.S. president’s participation had not been expected when the summit was scheduled to be held in Chile, Teresa Ribera added during the weekly press conference after the government’s cabinet meeting.
The summit, which is aimed at fleshing out details of the implementation of the landmark Paris Agreement climate pact, was recently moved to Madrid following Chile’s withdrawal as host amid raging street protests in the South American nation.


1. The
sustainability principle must be written into our constitution and translated
into juridical practice.
2. A new economic law of gravity
must be introduced
3. Cleaner technologies must be
advanced
4. A sustainable working life must
be prioritised
5. Better living conditions must
be ensured for plant- and wildlife
6. The public sector must take the
lead both as a green consumer and a green enterprise
7. Local communities must be strengthened
8. Room must be made for public
participation in and discourse on sustainable development
9. Denmark must lead the way in
efforts towards global solidarity
10. An integrated set of sustainability
indicators must be developed