public static final class R.id
extends java.lang.Object
| Constructor and Description |
|---|
R.id() |
public static final int action_help
public static final int action_logout
public static final int action_settings
public static final int action_sortDate
public static final int action_sortLatestGreatest
public static final int action_sortPicture
public static final int action_sortProximity
public static final int action_sortProximityTo
public static final int action_sortScore
public static final int ageTextView
public static final int authorAndAgeLayout
public static final int authorTextView
public static final int btnCancelLocation
public static final int btnSubmitLocation
public static final int button1
public static final int buttonsAndImage
public static final int cellActiveArea
public static final int commentTextField
public static final int commentTextView
public static final int commentsListView
public static final int currentLocationButton
public static final int detailsRow
public static final int distanceButton
public static final int distancePictureButtons
public static final int downVoteButton
public static final int editButton
public static final int editTextLatitude
public static final int editTextLongitude
public static final int favoriteButton
public static final int headerLayout
public static final int helpText
public static final int imageThumbnail
public static final int imageView
public static final int imageView1
public static final int imageViewComments
public static final int imageViewPicture
public static final int listStatusBox
public static final int listStatusIcon
public static final int listStatusText
public static final int locationmapview
public static final int mainListBox
public static final int mapview
public static final int mutateButtons
public static final int pager
public static final int pager_title_strip
public static final int pictureButton
public static final int postCell
public static final int postListView
public static final int post_header_layout
public static final int readLaterButton
public static final int refreshButton
public static final int rightSummaryRow
public static final int saveOrAddButton
public static final int scorePostTextView
public static final int signInButton
public static final int summaryRow
public static final int textViewAge
public static final int textViewAuthor
public static final int textViewComments
public static final int textViewLatitude
public static final int textViewLocation
public static final int textViewLongitude
public static final int textViewScore
public static final int textViewTitle
public static final int titleTextField
public static final int titleTextView
public static final int tvPreviousLocation
public static final int upVoteButton
public static final int userNameEditText


Group matches take place over 24 days - each group will be played
over 3 days:
3 queues, each team 1 duel per day.
One queue from a given group every two days
The queues of the second group will be played between the
queues of one group - which gives 2 groups played in 6 days
3 sets:
set:
4vs4 BO1
At the beginning of the set, the teams give the order in
which they will play.
One double-sided ban per team, which applies throughout the set.
In the event of a tie (2:2) in the first set, the teams
enliven one player and play for the decisive point using
BO5 1vs1. There is one double-sided ban per team in extra time.
set
3vs3 Koth BO1 with double-sided bans for 1 card. These
bans apply to all matches from this set.
set (in the event of a tie from previous sets)
1vs1 BO5 after 1 double-sided ban.
After each set, there will be a 3-minute break to specify the
order of players in the next set.
Win is 1 point and lose is 0 points.
The order of the places in the table with the same number of
points will be determined on the basis of the difference between
wins and losses. If this does not specify the places in the group,
the decision to enter will be made by a direct meeting in group
that took place between the teams.
After the group stage, it is possible to replace 3 players from the
roster 10 players who will play until the end of the league.
The first 2 teams from each group get to the 2nd knockout phase!
Knockout phase for 16 teams.
One duel per day (15 days + 16th day - fight for third place)
Cup matches will be played in 3 sets:
set
Teams release two players who work best together before
starting the set.
2vs2 BO3 with 1 double-sided bans per team.
set
Koth 3vs3 BO3.
A double-sided ban for each team.
set in case of a tie
3vs3 BO3 double-sided bans of 1 card
After each set, there will be a 3-minute break to specify the
order of players in the next set.


Answer all questions in a plain text file
named questions9.txt
.
At the top of your plain text file, include your name, student ID, and lab section.
Failure to do so will result in a 0.
This lab is an exercise in public key cryptography.
Recall that public-key cryptography using the RSA (Rivest, Shamir, Adelman)
scheme requires the use of public keys e and N and a private
(secret) key d.
Your group members should all visit the
RSA Worksheet
and follow these steps to get an understanding of the RSA process.
The first step is to choose two prime numbers, p and q.
These are not your encryption and decryption codes, but are used to help
find suitable codes.
Experiment with numbers, until you find two 4-digit numbers that are both prime.
(We choose numbers in this range so that we need not worry about overflow.)
In the answer box below, record your choices for p and q.
The value of N is calculated. Record N here. N is part of your public key. How was N calculated?
The value of r is also calculated.
(Note that r is the same value that we identified as φ(n)
in the lecture notes.)
This value is needed to find a suitable value for K, which is congruent
to 1 mod r
(that is, K mod r = 1
).
A list of candidate values is shown in the box.
Choose one that is not excessively large, and try it for the value of K.
The value of K may not be a prime number,
because there is a need to factor K.
Continue trying values of K until a suitable value is chosen.
What value of K did you finally settle on?
The value of K has been factored for you into two integers, e and d. The values of e and N together comprise your public encryption key. You are free to share these with anyone without compromising security. However, you need to keep d (your private decryption key) secret!!! What are your values of e and d?
Test e and d for consistency. If they are consistent, you are ready to encrypt a message. Type a plaintext message in the appropriate box, then click the Encode/Decode button. The box below shows the original code translated to ASCII (and perhaps grouped together - the resulting values cannot exceed N.) Verify that a few of the codes in the numeric text do correspond to letters in the plaintext, and show them in the answer box below.
The next box shows the encrypted code. Then the process of decrypting the encrypted code (to check for correctness) begins. Verify that the boxes below this box contain information that matches the info in the first two boxes. Indicate whether the decryption was successful. (If not, it may be that the info was entered incorrectly, or N is too large..) If the decryption is unsuccessful, repeat the process, perhaps with different choices of e and d.
 The authors do not need to know your decryption key in order to encrypt the message, but you need to know it in order to decrypt the message. The value of the decryption key is d=587. To decrypt the message, you do not need to go through the whole process of choosing N, e, and d as in the worksheet - these need only be chosen once. An Encryption/Decryption Worksheet has been provided for your convenience in encrypting and decrypting messages with known keys. Use this to decrypt the message, and record the decrypted message.
In the next few questions, each member of your group is to create their own
public and private key, and exchange encrypted messages.
(You will select your key from a fairly limited range of numbers,
so that with some effort, you may be able to guess each others' private keys.)
Choose values N, e, and d by using the first worksheet,
beginning with choices of p and q chosen from the range 19..59 .
Record the selected values below.
Do not divulge your private key, but share your public key
(and modulus N) with each of your group members.
Each member of your group will now create an encrypted message for another member of your group, encrypted using that member's public key and modulus. (The values of N and e should be shown, along with the message.) Each member should have one message created for them. Decrypt the message generated for you and put the result as an answer.
For the last question we want to think about breaking the decryption. If both p and q must be prime numbers in the range 19-59, how many possible key sets are there? How long does it take to get N, e, and d values from a set of p and q values? Could you successfully decrypt a message this way? How long did this take to try all key pairs? How long would this take for 100 possible primes? 1000? 10n? How does th problem become more advanced as the possible values increase?
Create a file on tux that contains a message to send to someone in your lab. Use the program shasum to get a hash of the file. Put the hexadecimal string for the hash in your answer file.
Use your private key (d and n) to encrypt the hash string. Use the recipient's public key (e and n) to encrypt the contents of the message as in Question 9. Decrypt the message sent to you and put its contents as your answer to this question.
Decrypt the signature and put the decrypted signature as your answer to this question.
Create a file on tux with the message you decrypted and use shasum to verify the validity of the signature. Did it check correctly? What problems did you have getting it to verify, if any?
You've been using tux quite a bit for this class. You'll also use tux for many other classes in the future. Hopefully by now you've memorized your password. If not, then this is the question for you. In the Week 9 folder on BBLearn, you'll find a PDF named "Crypto Lab Supplement". In that you will find instructions to set up SSH keys on Tux. Follow this guide. I couldn't think of a question to ask in relation to this, so say something geniunely nice about the class or the TAs or the professor here.
Submit on BBLearn
questions9.txt : A plain text file with your answers to the questions


Send up to 20 XRP!
1
Open this page on your desktop & login
www.xrptipbot.com/app
2
Get the app & scan the activation QR
Version: 1.0
3
Send and receive tips in real life! 🎉
1
Get the app & scan the activation QR
Version: 1.0
2
Scan this QR code
Logged in at xrptipbot as:
@thisistriss
To change user or logout go to the xrptipbot website.
3
Send and receive tips in real life! 🎉
❤ Want to test it and support a charity?
StJude
Show
raisingmalawi
Show
bigbuckor
Show
thisistriss
Show


|
libARStream
1.0
|
Error codes for ARSTREAM_xxx calls. More...
Go to the source code of this file.
Enumerations | |
| enum | eARSTREAM_ERROR { ARSTREAM_OK = 0, ARSTREAM_ERROR_BAD_PARAMETERS, ARSTREAM_ERROR_ALLOC, ARSTREAM_ERROR_FRAME_TOO_LARGE, ARSTREAM_ERROR_BUSY, ARSTREAM_ERROR_QUEUE_FULL } |
| Error codes for ARSTREAM_xxx calls. More... | |
Functions | |
| char * | ARSTREAM_Error_ToString (eARSTREAM_ERROR error) |
| Gets the error string associated with an eARSTREAM_ERROR. More... | |
Error codes for ARSTREAM_xxx calls.
| enum eARSTREAM_ERROR |
Error codes for ARSTREAM_xxx calls.
| char* ARSTREAM_Error_ToString | ( | eARSTREAM_ERROR | error | ) |
Gets the error string associated with an eARSTREAM_ERROR.
| error | The error to describe |


I'm Eddie, a software engineer living in Portland, Oregon. Thanks for visiting my site!
Drop me a line with the contact information above
See more about me with the link to the left
Friend my not-so-social social media accounts below


{% if customcode and customcode.compiled %} {% endif %}
{{ customcode.error }}
NOTE - Run Sample.py will open a new page; that's intended. The Run PyStone (50000 loops) example will take some time to complete without immediate feedback.
Batavia, and the larger BeeWare project, is open source and welcomes contributions!


Home
About
Demos
Websites
Datasets
Integrate
Contact
Sign in
Account
Sign out
Sign in
Sign up
Email:
Password:
Show Password
Sign In
Username:
Email:
Password:
Show Password
Sign Up


detail/ct_gcd_lcm.hpp provides two compile-time algorithms: greatest common divisor and least common multiple.
namespace details { namespace pool { template <unsigned A, unsigned B> struct ct_gcd { static const unsigned value = ...; }; template <unsigned A, unsigned B> struct ct_lcm { static const unsigned value = ...; }; } // namespace pool } // namespace details
| Symbol | Meaning |
|---|---|
| A, B | compile-time unsigned integer constants[5.19/1] |
| Expression | Result Type | Value | Precondition |
|---|---|---|---|
| ct_gcd<A, B>::value | compile-time unsigned integer constant | The greatest common divisor of A and B | A != 0 && B != 0 |
| ct_lcm<A, B>::value | compile-time unsigned integer constant | The least common multiple of A and B | A != 0 && B != 0 |
Since these are compile-time algorithms, violation of the preconditions will result in a compile-time error.
5.19/1: Expressions: Constant Expressions: ". . . An integral constant expression can involve only literals (2.13), enumerators, const variables or static data members of integral or enumeration types initialized with constant expressions (8.5), non-type template parameters of integral or enumeration types, and sizeof expressions. Floating literals (2.13.3) can appear only if they are cast to integral or enumeration types. Only type conversions to integral or enumeration types can be used. In particular, except in sizeof expressions, functions, class objects, pointers, or references shall not be used, and assignment, increment, decrement, function-call, or comma operators shall not be used."
This header may be replaced by a Boost compile-time algorithms library.
Revised 05 December, 2006
Copyright © 2000, 2001 Stephen Cleary (scleary AT jerviswebb DOT com)
Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)


Security stepped up in Hong Kong after night of clashes
Police have increased security around Hong Kong and its university campuses as they braced for more violence after sharp clashes overnight with anti-government protesters.
Many subway and rail stations were closed after the protesters blocked commutes and vandalised trains overnight into Wednesday.
Police and protesters battled on multiple fronts overnight at the Chinese University of Hong Kong, with petrol bombs and fires lighting up the night time scene.
A police official warned protesters were carrying out “insane acts” and Hong Kong was on the brink of a total breakdown after more than five months of protests.
“Our society has been pushed to the brink of a total breakdown,” Senior Police Superintendent Kong Wing-heung said late on Tuesday.
He said Hong Kong’s mass transit system and subway, known as MRT, was under stress from acts of violence and vandalism.

Groups of riot police were deployed around central Hong Kong and its outlying territories to try and contain new violence, even as students at the Chinese University — located in the outskirts of the sprawling metropolis — prepared for new clashes with police.
Many were armed with petrol bombs while some carried bows and arrows.
The university’s student union president, Jacky So, appealed for an injunction with the High Court to ban police from entering the campus without a warrant or the school’s approval.
Police had entered the campus and fired tear gas and used a water cannon late on Tuesday.
The injunction would also block police from using crowd control weapons, such as tear gas and rubber bullets at the university, and a decision is expected late on Wednesday.
The city’s religious leaders have appealed for an end to the violence and called on both police and protesters to show restraint.
“At this very critical point, the people of Hong Kong must unite and say no to violence,” said a statement issued by the leaders of Hong Kong’s six major religious groups.
Recent weeks have been marked by escalating vandalism of shops linked to mainland China and train stations, and assaults by both protesters and pro-Beijing supporters.
On Monday, a police officer drew his gun during a struggle with protesters, shooting one in the abdomen.
In another neighbourhood, a 57-year-old man who was defending China was set on fire after an apparent argument.
Both remained in a critical condition in hospital on Wednesday.
Police have arrested more than 3,500 people since the movement began in June.
The protests began over a proposed law that would have allowed criminal suspects to be extradited to mainland China, where they could face opaque and politically sensitive trials.
Activists saw the bill as another sign of an erosion in Hong Kong’s autonomy and civic freedoms, which China promised would be maintained for 50 years under a “one nation, two systems” principle when the former British colony returned to Chinese control in 1997.


--- layout: post title: Two Videos Worth Watching date: '2013-04-09 13:49:13 -0700' mt_id: 1513 blog_id: 1 post_id: 1513 basename: two_videos_worth_watching categories: - humor - high-geekery - explorations ---
Reading through this Hacker News thread, I came across dozens of great talks to check out in the future. So far I've watched two and I think they're worth sharing:
If there are any awesome talks you'd like to share, I'm very interested and my email address is over in the right side bar.


Log in
/
Sign up
Home
Explore
Connect us on
Gramventures © 2016 All Rights Reserved
Log in
/
Sign up
Explore
Title
Details
@nemo
47
By
: Nemo Clownfish
Category
: Sea, Wild
Uploaded
: June 2, 2016
Keywords
:
dress
,
girl
,
relaxation
,
beauty
body
,
face
,
lippe
,
1
2
3
4
5
6
7
8


Jonas Blue
-
I Wanna Dance
[by:Trap_Girl] 作曲 : Jonas Blue 作词 : Jonas Blue I wanna dance with my mind, I think about you all the time I wanna danc...  What up with acting so coy? I’m reading you like a book I can te... -
Come Through
[by:Trap_Girl] Oh I don’t need ya, I don’t need ya, I don’t need ya Tell myself that when I know it isn’t true When you ... -
Supernova
[by:Trap_Girl] Cold eyes, blank stare Faces on a bus, but I just don’t care True lies buzzing in my ear Spending all my ...  -
Mama
Where should we run to? We got the world in our hands and we're ready to play They say we're wasted But how can we waste... -
By Your Side
[by:hondoes] 作曲 : Guy James Robin/Grace Barker/Jason Pebworth/Jonathan Shave/George Astasio 作词 : Guy James Robin/Grace... -
What I Like About You
[by:Trap_Girl] All my life I've been a good girl Tryna do what's right, never told no lies Then you came around and sudd... -
Polaroid
[by:Trap_Girl] Let me tell you how it happened I wasn't looking for someone that night No, I was never a believer But yo... -
Rise
[by:弋许] We're gonna ri-ri-ri-ri-rise 'til we fall They say we got no no no no future at all They wanna ke-ke-keep us out... -
Perfect Strangers
[by:鱼见] You were looking at me like you wanted to stay When I saw you yesterday I'm not wasting your time, I'm not playi... -
Ritual
[by:hondoes] 作曲 : Tijs Verwest/Guy Robin/Fraser T. Smith/Grace Barker/Wayne Hector/Michael Stonebank 作词 : Tijs Verwest... -
I Don't Care (Jonas Blue Remix)
作曲 : Fred Gibson/Ed Sheeran/Justin Bieber/Jason Boyd/Max Martin/Shellback I'm at a party I don't wanna be at And I don'... -
Fast Car
[by:RED_VV] [ti:Fast Car (Radio Edit)] [ar:Jonas Blue/Dakota] [al:Fast Car (Radio Edit)] [by:九九Lrc歌词网～www.99Lrc.net] Da... -
I See Love (From Hotel Transylvania 3)
[by:Trap_Girl] This is such a perfect place I'm glad I found this with you Our love reflected in your face Only Heaven c... -
Heartline
[by:墨尔本bounce] Mmm, yeah No, no, yeah Been lookin' for you in all the wrong places But I don't go there no more Ev... -
Still Falling For You (Jonas Blue Remix)
[by:小陀螺Tony] 作曲 : Ellie Goulding/Ilya/Rickard Goransson/Shellback/Tove Lo 作词 : Ellie Goulding/Ilya/Rickard Goransson/S... -
Keeping Your Head Up (Jonas Blue Remix) [Radio Edit]
[ti:Keeping Your Head Up (Jonas Blue Remix) [Radio Edit] [ar:Birdy Jonas Blue 407000637] [al:] [by:九九Lrc歌词网～www.99Lrc.ne... -
Don't Call It Love
[by:immaculatewhore] Love, yeah, yeah, yeah Is it the passion? Is it the pleasure? Give me a reason You wanna hurt us T... -
Wherever You Go
[by:Trap_Girl] I wasn't ready No, I wasn’t ready for this But I found a home When I laid my head down My radio is your c... -
We Could Go Back
[by:Trap_Girl] Should have could have would have but it's too late Shouldn't catch feelings on a first date 0 to 100 no ... -
In Your Arms Tonight
[by:immaculatewhore] I just died in your arms tonight It must've been somethin' you said I just died in your arms tonigh... -
Stay (Jonas Blue Remix)
[by:后庭派对] [ti:] [ar:] [al:] [by:九九Lrc歌词网～www.99Lrc.net] 作曲 : Anton Zaslavski/Linus Wiklund/Sarah Aarons/Anders Frøen/Jo... -
Drink To You
[by:Trap_Girl] Mmm, mmm Remember when you said that all good things end? I never thought that I’d believe you But now he... -
Strangers (Jonas Blue Remix)
[by:Aicko] 作曲 : Sigrid Solbakk Raabe/Martin Sjølie 作词 : Sigrid Solbakk Raabe/Martin Sjølie Just like in the movies It ... -
Places
[by:immaculatewhore] I come back to the places where we found us We're somewhere in the place between love and lust And... -
Wild Love (Jonas Blue Remix)
[by:Trap_Girl] 作曲 : James Bay/Jon Green 作词 : James Bay/Jon Green Don't know what to say to you now Standing right in f... -
Wild
[by:Trap_Girl] Have you ever been with somebody that makes you feel wild? You couldn't beat this at all if you tried In ... -
Younger
[by:本尼托先生] Oooh, oooh Ooh Someday, we'll be a million miles away Waking up on Monday morning Wishing it was Saturda... -
Hearts Ain't Gonna Lie (High Contrast Remix)
[by:Duyet520] 作曲 : Arlissa Ruppert/Sinai Tedros/James Tadgell/Jon Clare/Guy Robin 作词 : Arlissa Ruppert/Sinai Tedros/Ja... -
Back & Forth
[by:Trap_Girl] 作曲 : Marc Kinchen/Guy Robin/Rebecca Claire Hill/Mike Kintish 作词 : Marc Kinchen/Guy Robin/Rebecca Claire... -
Roll With Me
[by:Trap_Girl] I don't see no competition You didn't win the lottery So you better ask permission If you wanna roll with... -
Alien
[by:Trap_Girl] Mmmm, no, hmm This feeling's so alien Need to know if you're just a friend Are you a secret or more than ... -
Desperate
[by:Trap_Girl] If there’s a body that I haven’t loved yet It’s yours, it’s yours (Mmm) If there’s a presence that I have... -
Fast Car (Radio Edit)
作曲 : Tracy Chapman 作词 : Tracy Chapman You've got a fast car I want a ticket to anywhere Maybe we can make a deal Maybe...


General Learning tools
General
Medium
Module 1: Review of Blockchain Technology
Consensus Mechanisms
Mining in Ethereum
Public and Private Blockchains
Module 2: Blockchain Primitives
Cryptographic Hash Functions
Merkle Trees
Blockchain Structure
Smart Contracts
Nodes
Blockchain Forks
Module 3: Ethereum Structure
Accounts
Transactions
Gas and Fees
Ethereum Structure
Module 4: Traditional and Decentralized Application Development
Traditional and Decentralized App Development
Development Environment Setup Options
Key Developer Tools
Module 5: Development Frameworks and Environment
Development Workflow: Ganache CLI
Install Truffle
Initializing Truffle
Module 6: Solidity Fundamentals
Data Types and Variables
Functions
Storage and Memory
Contract Structure
Reading Smart Contracts
Smart Contract ABI
Events and Logs
Factory Contracts
Module 7: Writing Smart Contracts
Introductory Smart Contracts
Inter-Contract Execution
Inheritance
Libraries and the Ethereum Package Manager
Smart Contract System Design
Debugging Truffle Tests
Module 8: Ethereum and the End User
Introduction to Web 3.0
Building Truffle for the Web
Integrating with React
Generating Ethereum Accounts in Javascript
Module 9: Smart Contract Pitfalls, Testing and Debugging
Writing Tests
Smart Contract Best Practices
Exploits and Dangers
Optimizing Gas
Safety Checklist
Security Analysis Tools
Module 10: Ethereum Advanced Topics
Design Patterns
Upgradable Contracts
Oracles
uPort
The Ethereum Name Service
IPFS
Formal Verification
Module 11: Further
LLL
Vyper
Ethereum Improvement Proposals


This Bible contradiction is from the Skeptic's Annotated Bible.
Verses
Yes.
Mark 16:20 View context
And they went forth, and preached every where, the Lord working with [them], and confirming the word with signs following. Amen.
John 3:2 View context
The same came to Jesus by night, and said unto him, Rabbi, we know that thou art a teacher come from God: for no man can do these miracles that thou doest, except God be with him.
John 20:30 View context
And many other signs truly did Jesus in the presence of his disciples, which are not written in this book:
Acts 2:22 View context
Ye men of Israel, hear these words; Jesus of Nazareth, a man approved of God among you by miracles and wonders and signs, which God did by him in the midst of you, as ye yourselves also know:
No.
Matthew 12:39 View context
But he answered and said unto them, An evil and adulterous generation seeketh after a sign; and there shall no sign be given to it, but the sign of the prophet Jonas:
Matthew 16:4 View context
A wicked and adulterous generation seeketh after a sign; and there shall no sign be given unto it, but the sign of the prophet Jonas. And he left them, and departed.
Mark 8:12 View context
And he sighed deeply in his spirit, and saith, Why doth this generation seek after a sign? verily I say unto you, There shall no sign be given unto this generation.
Luke 11:29 View context
And when the people were gathered thick together, he began to say, This is an evil generation: they seek a sign; and there shall no sign be given it, but the sign of Jonas the prophet.


Google Chrome
Google Chrome is a free, open-source web browser developed by Google, released in 2008.
Google Chrome is a free, open-source web browser developed by Google, released in 2008.
Internet Explorer is a free web browser from Microsoft, released in 1995.
Firefox is a free, open-source web browser from Mozilla, released in 2004.
Note:
The main tag is not supported in Internet Explorer 11 and earlier versions.


If you love Telegram but don't want to leave Discord then you'll be pleased to find we've built a bridge in this channel. If you'd like to join the group in the Telegram app you can find it here: https://t.me/KomodoPlatform_Official.
Between 25-Dec-19 12:00 AM and 26-Dec-19 12:00 AM
GatewayBOT25-Dec-19 02:28 AM
[telegram] <RealBitcoinBenny> Merry Christmas to everyone who supports and has supported Komodo. I hope you all have a wonderful Christmas break and remain safe over this period. Lets get ready for a big 2020.
GatewayBOT25-Dec-19 02:48 AM
[telegram] <Regnar> Merry Christmas to you as well Ben (re @RealBitcoinBenny: Merry Christmas to everyone who supports and has supported Komodo. I hope you all have a wonderful Christmas break and remain safe over this period. Lets get ready for a big 2020.)
GatewayBOT25-Dec-19 04:32 AM
[telegram] <PTYX11> Merry Christmas!
freakbros25-Dec-19 04:52 AM
Merry Christmas to all
GatewayBOT25-Dec-19 06:59 AM
[telegram] <Kriptodan Batan Adam> why volume is very low :(
[telegram] <Acura360> Because Christmas
[telegram] <Kriptodan Batan Adam> (re @Acura360: Because Christmas)
#Verus #Desktop- Первое в мире приложение поддерживающее независимый, квантовый и удобный для пользователя протокол Verus ID, а также полнофункциональные коше...
GatewayBOT25-Dec-19 09:39 AM
[telegram] <Buralux> Merry Christmas for all admins and community
$KMD looks ready for a good 30%+ run if we get a bounce here. Broke out of accumulation range a few weeks ago; this is a good spot for a retest entry. R/S flip w/ MACD bull cross on daily.
MR KOMODO, This is what i see:
* Price on good support!
* We need to break the upper trendline of the bearish channel
* Exaggerated divergence
* Almost 0 volume.
* MACD moving averages struglling
* You can draw an support line on the MACD momving averages
Well, come on MR...


Current server state: {{serverState}}
The server is placed into paused mode for shutting down or for administrative functions. Generally, if you wait a moment, the server should start up again.


?I
The
New
York
copyright
reserved
botanical
Garden
JARDIN
BOTANICO,
UNIVERSIDAD
DE
PUERTO
RICO
Flora
de
.
.
St.
.Croix,
.V.I........
34757
Bouteloua
americana
(L.f.)
Scribn
et.
A.H.Liogier,
1983
NE*
BOTANICAL
s^ARDe^ix
NEW
YORK
BOTANICAL
GARDEN
Weed,
on
roadside,
Annaly
road
01530016
Col.
Alain
H.
Liogier
01530016
Legend -
Level of confidence that token is an accurately-transcribed word
extremely low
very low
low
undetermined
medium
high
very high


[gecode-users] update Args automatically?
S L
shawnleem at outlook.com
Sun Jul 21 09:06:11 CEST 2013
Hi All,
For the example scripts provided in the Gecode package, there are usages of like IntArgs, IntVarArgs etc, take the domino problem as an example. I am wondering the clone of a space will also clone this "Args" automatically? Since I see that they are not updated in the space copy method as variable arrays declared in the private section of a script space. Thanks!
regards,Shawn
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.gecode.org/pipermail/users/attachments/20130721/ea81da3f/attachment.html>
More information about the users
mailing list


DPP Goes After Man Caught on CCTV Assaulting Supermarket Cashier [VIDEO]
by Emmanuel GithukuDirector of Public Prosecutions on Saturday, November 23, ordered the arrest of Ibrahim Taraiya a supervisor at Eastmatt Supermarket in Kajiado.
Taraiya was captured by CCTV cameras assaulting a female cashier on November 19, 2019.
The DPP stated that upon his arrest, Taraiya would be arraigned at Kajiado Court on Monday.
This came barely a day after the supervisor was indicted over the assault, with the organisation stating that it did not condone his behaviour.
The video was posted online by Kajiado ODM politician Lydia Ngaira on Friday, on November 22 but had been recorded on Tuesday, November 19.
She claimed that he was taking out his anger on the female colleague because he had been fired.
The clip showed that after a few blows, the victim tried holding the assailant's hand, a move that seemed to have enraged him even more.
The cashier tried hiding below her work station but the attacker dragged her from under the desk by her collar.
Another male colleague tried to intervene and hold back the aggressor who seemed extremely enraged, as he tried to manoeuvre out of the man's arms.
The politician who shared the video called for the arrest of the assailant, claiming that nothing warranted how the woman was treated.
Below is the video of the assault:


Before Change
else: // soft-labels
losses = F.kl_div(logits, targets, reduction="none")
losses = losses.float().sum(-1).type_as(losses)
nll_loss = mean_ds(losses)
if label_smoothing > 0:
loss = nll_loss * (1 - label_smoothing) - mean_ds(logits) * label_smoothing
After Change
else:
logits = F.log_softmax(outputs, dim=-1)
if targets.dim() == 1:
losses = F.nll_loss(logits, targets.to(logits.device), reduction="none")
else: // soft-labels
losses = F.kl_div(logits, targets.to(logits.device), reduction="none")


Main Paragraph
Your browser does not support HTML5 audio.
Paragraph 1
Paragraph 2
Paragraph 3
Paragraph 4
Video is not supported by this browser.


ABOUT EASY LIFE
ALBUMS
VIDEO
CONTACT
sign up our official site! you can receive news updates for Easy Life.


Write Chinese Tang Poems automatically.
| Version: | 0.1.0 |
| Depends: | R (≥ 3.0) |
| Imports: | jiebaR |
| Published: | 2018-07-18 |
| Author: | Yanni Li, Yongyuan Liang |
| Maintainer: | Yongyuan Liang <charlotte9762 at hotmail.com> |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| NeedsCompilation: | no |
| CRAN checks: | TangPoemR results |
| Reference manual: | TangPoemR.pdf |
| Package source: | TangPoemR_0.1.0.tar.gz |
| Windows binaries: | r-devel: TangPoemR_0.1.0.zip, r-release: TangPoemR_0.1.0.zip, r-oldrel: TangPoemR_0.1.0.zip |
| OS X binaries: | r-release: TangPoemR_0.1.0.tgz, r-oldrel: TangPoemR_0.1.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=TangPoemR to link to this page.


intrace: an input trace to be searched for a region of stable std windowSize: search sliding window size This function searches for the most stable part of the trace to represent as the baseline standard deviation Copyright 2016 The Miller Lab, UC Berkeley Author: Kaveh Karbasi
0001 function localSTD = getLocalSTD(intrace , windowSize) 0002 % intrace: an input trace to be searched for a region of stable std 0003 % windowSize: search sliding window size 0004 % This function searches for the most stable part of the trace to represent 0005 % as the baseline standard deviation 0006 % Copyright 2016 The Miller Lab, UC Berkeley 0007 % Author: Kaveh Karbasi 0008 traceLength = numel(intrace); 0009 localSTD = realmax; 0010 0011 for ii = 1 : traceLength-windowSize 0012 baseIdx = ii : ii + windowSize; 0013 0014 curr_std = nanstd( intrace( baseIdx ) ); 0015 if curr_std < localSTD 0016 localSTD = curr_std; 0017 end 0018 0019 end 0020 0021 0022 0023


The Business
Instructions
The instructions are simple. Use WASD or the arrow keys on your keyboard to move around. Using this, collect the money that's appearing from thin air to generate profit.
However, don't drop money, as you will lose the profit it could've given you. And if you lose too much profit, you lose the game. It's simple.
To keep a check over this, the game has two score counters. The one on the left counts your highest balance of the game, the one on your right counts your current balance.
That may seem complicated, and so the game has a bar under your player. All you have to remember is that while there's no red on it, you're okay.
Now go ahead, have fun! And remember, the more money falls, the harder it gets.
0
0
Game Over
Score: 0
HighScore: 0


Donec id etiam porta sem.
Donec id elit.
Donec id e porta sem.
Donec id elit nta sem.
Donec id elit ta sem.
Copyright © 2015 Like Gift, Ltd. ALL Rights Reserved. No part of this website may be copied, duplicated and/or re-distribcted in anyway.By using this website. you agree with our Terms of Use.


WITNESS LIST Agriculture & Livestock Committee February 20, 2003-8:00A Texas A&M Systems Ag Program On: Hiler, Edward (Texas A&M University Systems Agriculture Programs) Texas Ag Experiment Station On: Scifres, Charles (Texas Agricultural Experiment Station) Texas Board of Vet Medical Examiner On: Allen, Ron (Texas State Board of Veterinary Medical Examiners) Texas Cooperative Extension On: Fehlis, Chester (Texas Cooperative Extension) Texas Forest Service On: Hull, James (Texas Forest Service) Texas Vet Medical Diagnostic Lab On: Gayle, Lelve (Texas Veterinary Medical Diagnostic Laboratory) Texas Wildlife Damage Management On: Nunley, Gary (Texas Wildlife Damage Management Service)


class Sass::Plugin::StalenessChecker
The class handles `.sss` file staleness checks via their mtime timestamps.
To speed things up two level of caches are employed:
-
A class-level dependency cache which stores @import paths for each file. This is a long-lived cache that is reused by every StalenessChecker instance.
-
Three short-lived instance-level caches, one for file mtimes, one for whether a file is stale during this particular run. and one for the parse tree for a file. These are only used by a single StalenessChecker instance.
Usage:
-
For a one-off staleness check of a single `.sss` file, the class-level {stylesheet_needs_update?} method should be used.
-
For a series of staleness checks (e.g. checking all files for staleness) a StalenessChecker instance should be created, and the instance-level {#stylesheet_needs_update?} method should be used. the caches should make the whole process significantly faster. WARNING: It is important not to retain the instance for too long, as its instance-level caches are never explicitly expired.
Attributes
TODO: attach this to a compiler instance. @private
Public Class Methods
Creates a new StalenessChecker for checking the staleness of several stylesheets at once.
@param options [{Symbol => Object}]
See {file:SASS_REFERENCE.md#sass_options the Sass options documentation}.
# File lib/sass/plugin/staleness_checker.rb, line 43 def initialize(options) # URIs that are being actively checked for staleness. Protects against # import loops. @actively_checking = Set.new # Entries in the following instance-level caches are never explicitly expired. # Instead they are supposed to automatically go out of scope when a series of staleness # checks (this instance of StalenessChecker was created for) is finished. @mtimes, @dependencies_stale, @parse_trees = {}, {}, {} @options = Sass::Engine.normalize_options(options) end
Returns whether a Sass or SCSS stylesheet has been modified since a given time.
The distinction between this method and the instance-level {#stylesheet_modified_since?} is that the instance method preserves mtime and stale-dependency caches, so it’s better to use when checking multiple stylesheets at once.
@param template_file [String] The location of the Sass or SCSS template. @param mtime [Fixnum] The modification time to check against. @param importer [Sass::Importers::Base] The importer used to locate the stylesheet.
Defaults to the filesystem importer.
@return [Boolean] Whether the stylesheet has been modified.
# File lib/sass/plugin/staleness_checker.rb, line 110 def self.stylesheet_modified_since?(template_file, mtime, importer = nil) new(Plugin.engine_options).stylesheet_modified_since?(template_file, mtime, importer) end
Returns whether or not a given CSS file is out of date and needs to be regenerated.
The distinction between this method and the instance-level {#stylesheet_needs_update?} is that the instance method preserves mtime and stale-dependency caches, so it’s better to use when checking multiple stylesheets at once.
@param css_file [String] The location of the CSS file to check. @param template_file [String] The location of the Sass or SCSS template
that is compiled to `css_file`.
@return [Boolean] Whether the stylesheet needs to be updated.
# File lib/sass/plugin/staleness_checker.rb, line 95 def self.stylesheet_needs_update?(css_file, template_file, importer = nil) new(Plugin.engine_options).stylesheet_needs_update?(css_file, template_file, importer) end
Public Instance Methods
Returns whether a Sass or SCSS stylesheet has been modified since a given time.
@param template_file [String] The location of the Sass or SCSS template. @param mtime [Fixnum] The modification time to check against. @param importer [Sass::Importers::Base] The importer used to locate the stylesheet.
Defaults to the filesystem importer.
@return [Boolean] Whether the stylesheet has been modified.
# File lib/sass/plugin/staleness_checker.rb, line 79 def stylesheet_modified_since?(template_file, mtime, importer = nil) importer ||= @options[:filesystem_importer].new(".") dependency_updated?(mtime).call(template_file, importer) end
Returns whether or not a given CSS file is out of date and needs to be regenerated.
@param css_file [String] The location of the CSS file to check. @param template_file [String] The location of the Sass or SCSS template
that is compiled to `css_file`.
@return [Boolean] Whether the stylesheet needs to be updated.
# File lib/sass/plugin/staleness_checker.rb, line 62 def stylesheet_needs_update?(css_file, template_file, importer = nil) template_file = File.expand_path(template_file) begin css_mtime = File.mtime(css_file) rescue Errno::ENOENT return true end stylesheet_modified_since?(template_file, css_mtime, importer) end
Private Instance Methods
# File lib/sass/plugin/staleness_checker.rb, line 173 def compute_dependencies(uri, importer) tree(uri, importer).grep(Tree::ImportNode) do |n| next if n.css_import? file = n.imported_file key = [file.options[:filename], file.options[:importer]] @parse_trees[key] = file.to_tree key end.compact end
# File lib/sass/plugin/staleness_checker.rb, line 144 def dependencies(uri, importer) stored_mtime, dependencies = with_dependency_cache {|cache| Sass::Util.destructure(cache[[uri, importer]])} if !stored_mtime || stored_mtime < mtime(uri, importer) dependencies = compute_dependencies(uri, importer) with_dependency_cache do |cache| cache[[uri, importer]] = [mtime(uri, importer), dependencies] end end dependencies end
# File lib/sass/plugin/staleness_checker.rb, line 116 def dependencies_stale?(uri, importer, css_mtime) timestamps = @dependencies_stale[[uri, importer]] ||= {} timestamps.each_pair do |checked_css_mtime, is_stale| if checked_css_mtime <= css_mtime && !is_stale return false elsif checked_css_mtime > css_mtime && is_stale return true end end timestamps[css_mtime] = dependencies(uri, importer).any?(&dependency_updated?(css_mtime)) rescue Sass::SyntaxError # If there's an error finding dependencies, default to recompiling. true end
# File lib/sass/plugin/staleness_checker.rb, line 158 def dependency_updated?(css_mtime) proc do |uri, importer| next true if @actively_checking.include?(uri) begin @actively_checking << uri sass_mtime = mtime(uri, importer) !sass_mtime || sass_mtime > css_mtime || dependencies_stale?(uri, importer, css_mtime) ensure @actively_checking.delete uri end end end
# File lib/sass/plugin/staleness_checker.rb, line 131 def mtime(uri, importer) @mtimes[[uri, importer]] ||= begin mtime = importer.mtime(uri, @options) if mtime.nil? with_dependency_cache {|cache| cache.delete([uri, importer])} nil else mtime end end end
# File lib/sass/plugin/staleness_checker.rb, line 183 def tree(uri, importer) @parse_trees[[uri, importer]] ||= importer.find(uri, @options).to_tree end
Get access to the global dependency cache in a threadsafe manner. Inside the block, no other thread can access the dependency cache.
@yieldparam cache [Hash] The hash that is the global dependency cache @return The value returned by the block to which this method yields
# File lib/sass/plugin/staleness_checker.rb, line 192 def with_dependency_cache StalenessChecker.dependency_cache_mutex.synchronize do yield StalenessChecker.dependencies_cache end end


This stage helps you to organize the order that your participant will perform the tasks, ie. You will design task blocks. Some tasks require more than just a simple order of events. Use this stage to design how you want the tasks to be presented, so that potentially confounding issues such as order (learning) effects, and performance fatigue can be reduced.
Experiment Title:
Author:
In my experiment, I want to hypothesize that for to do "{{group.name;}} ", the solution(s) "{{group.name;}} " is better than "{{group.name;}} ". To test this hypothesis, I will vary the "{{group.name;}} " and measure "{{group.name;}} ".
_Independent variables_
_Dependent variables_
DV: {{group.name}} Description: {{group.description;}}| Independent Variable | Between- or Within- subject | Strategy | Test Condition |
|---|---|---|---|
Now you’ve completed the order of presentation of tasks. The next step is to review the timing of the experiment as a whole.


|
|
"use strict";
module.exports = {
"0:2": {
desc: "Get Version",
did: 0x00,
cid: 0x02,
event: "version",
fields: [
{
name: "recv",
type: "number",
from: 0,
to: 1
},
{
name: "mdl",
type: "number",
from: 1,
to: 2
},
{
name: "hw",
type: "number",
from: 2,
to: 3
},
{
name: "msaVer",
type: "number",
from: 3,
to: 4
},
{
name: "msaRev",
type: "number",
from: 4,
to: 5
},
{
name: "bl",
type: "number",
format: "hex",
from: 5,
to: 6
},
{
name: "bas",
type: "number",
format: "hex",
from: 6,
to: 7
},
{
name: "macro",
type: "number",
format: "hex",
from: 7,
to: 8
},
{
name: "apiMaj",
type: "number",
from: 8,
to: 9
},
{
name: "apiMin",
type: "number",
from: 9,
to: 10
},
]
},
"0:11": {
desc: "Get Bluetooth Info",
did: 0x00,
cid: 0x11,
event: "bluetoothInfo",
fields: [
{
name: "name",
type: "string",
format: "ascii",
from: 0,
to: 16
},
{
name: "btAddress",
type: "string",
format: "ascii",
from: 16,
to: 28
},
{
name: "separator",
type: "number",
from: 28,
to: 29
},
{
name: "colors",
type: "number",
format: "hex",
from: 29,
to: 32
}
]
},
"0:13": {
desc: "Get Auto-reconnect Info",
did: 0x00,
cid: 0x13,
event: "autoReconnectInfo",
fields: [
{
name: "flag",
type: "number",
from: 0,
to: 1
},
{
name: "time",
type: "number",
from: 1,
to: 2
}
]
},
"0:20": {
desc: "Get Power State Info",
did: 0x00,
cid: 0x20,
event: "powerStateInfo",
fields: [
{
name: "recVer",
type: "number",
from: 0,
to: 1
},
{
name: "batteryState",
type: "predefined",
from: 1,
to: 2,
values: {
0x01: "Battery Charging",
0x02: "Battery OK",
0x03: "Battery Low",
0x04: "Battery Critical"
}
},
{
name: "batteryVoltage",
type: "number",
from: 2,
to: 4
},
{
name: "chargeCount",
type: "number",
from: 4,
to: 6
},
{
name: "secondsSinceCharge",
type: "number",
from: 6,
to: 8
}
]
},
"0:23": {
desc: "Get Voltage Trip Points",
did: 0x00,
cid: 0x23,
event: "voltageTripPoints",
fields: [
{
name: "vLow",
type: "number",
from: 0,
to: 2
},
{
name: "vCrit",
type: "number",
from: 2,
to: 4
}
]
},
"0:41": {
desc: "Level 2 Diagnostics",
did: 0x00,
cid: 0x41,
event: "level2Diagnostics",
fields: [
{
name: "recVer",
type: "number",
from: 0,
to: 2
},
{
name: "rxGood",
type: "number",
from: 3,
to: 7
},
{
name: "rxBadDID",
type: "number",
from: 7,
to: 11
},
{
name: "rxBadDlen",
type: "number",
from: 11,
to: 15
},
{
name: "rxBadCID",
type: "number",
from: 15,
to: 19
},
{
name: "rxBadCheck",
type: "number",
from: 19,
to: 23
},
{
name: "rxBufferOvr",
type: "number",
from: 23,
to: 27
},
{
name: "txMsg",
type: "number",
from: 27,
to: 31
},
{
name: "txBufferOvr",
type: "number",
from: 31,
to: 35
},
{
name: "lastBootReason",
type: "number",
from: 35,
to: 36
},
{
name: "bootCounters",
type: "number",
format: "hex",
from: 36,
to: 68
},
{
name: "chargeCount",
type: "number",
from: 70,
to: 72
},
{
name: "secondsSinceCharge",
type: "number",
from: 72,
to: 74
},
{
name: "secondsOn",
type: "number",
from: 74,
to: 78
},
{
name: "distanceRolled",
type: "number",
from: 78,
to: 82
},
{
name: "sensorFailures",
type: "number",
from: 82,
to: 84
},
{
name: "gyroAdjustCount",
type: "number",
from: 84,
to: 88
}
]
},
"0:51": {
desc: "Poll Packet Times",
did: 0x00,
cid: 0x51,
event: "packetTimes",
fields: [
{
name: "t1",
type: "number",
from: 0,
to: 4
},
{
name: "t2",
type: "number",
from: 4,
to: 8
},
{
name: "t3",
type: "number",
from: 8,
to: 12
}
]
},
"2:7": {
desc: "Get Chassis Id",
did: 0x02,
cid: 0x07,
event: "chassisId",
fields: [
{
name: "chassisId",
type: "number",
}
]
},
"2:15": {
desc: "Read Locator",
did: 0x02,
cid: 0x15,
event: "readLocator",
fields: [
{
name: "xpos",
type: "number",
from: 0,
to: 2
},
{
name: "ypos",
type: "number",
from: 2,
to: 4
},
{
name: "xvel",
type: "number",
from: 4,
to: 6
},
{
name: "yvel",
type: "number",
from: 6,
to: 8
},
{
name: "sog",
type: "number",
from: 8,
to: 10
}
]
},
"2:22": {
desc: "Get RGB LED",
did: 0x02,
cid: 0x22,
event: "rgbLedColor",
fields: [
{
name: "color",
type: "number",
format: "hex",
from: 0,
to: 3
},
{
name: "red",
type: "number",
from: 0,
to: 1
},
{
name: "green",
type: "number",
from: 1,
to: 2
},
{
name: "blue",
type: "number",
from: 2,
to: 3
}
]
},
"2:36": {
desc: "Get Permanent Option Flags",
did: 0x02,
cid: 0x36,
event: "permanentOptionFlags",
fields: [
{
name: "sleepOnCharger",
type: "predefined",
mask: 0x01,
values: {
0x00: false,
0x01: true
}
},
{
name: "vectorDrive",
type: "predefined",
mask: 0x02,
values: {
0x00: false,
0x02: true
}
},
{
name: "selfLevelOnCharger",
type: "predefined",
mask: 0x04,
values: {
0x00: false,
0x04: true
}
},
{
name: "tailLedAlwaysOn",
type: "predefined",
mask: 0x08,
values: {
0x00: false,
0x08: true
}
},
{
name: "motionTimeouts",
type: "predefined",
mask: 0x10,
values: {
0x00: false,
0x10: true
}
},
{
name: "retailDemoOn",
type: "predefined",
mask: 0x20,
values: {
0x00: false,
0x20: true
}
},
{
name: "awakeSensitivityLight",
type: "predefined",
mask: 0x40,
values: {
0x00: false,
0x40: true
}
},
{
name: "awakeSensitivityHeavy",
type: "predefined",
mask: 0x80,
values: {
0x00: false,
0x80: true
}
},
{
name: "gyroMaxAsyncMsg",
type: "predefined",
mask: 0x100,
values: {
0x00: false,
0x100: true
}
}
]
},
"2:38": {
desc: "Get Temporal Option Flags",
did: 0x02,
cid: 0x38,
event: "temporalOptionFlags",
fields: [
{
name: "stopOnDisconnect",
type: "predefined",
mask: 0x01,
values: {
0x00: false,
0x01: true
}
}
]
},
"2:44": {
desc: "Get Device Mode",
did: 0x02,
cid: 0x44,
event: "deviceMode",
fields: [
{
name: "mode",
type: "predefined",
values: {
0x00: "Normal",
0x01: "User Hack"
}
}
]
},
"2:48": {
desc: "Refill Bank",
did: 0x02,
cid: 0x48,
event: "refillBank",
fields: [
{
name: "coresRemaining",
type: "number"
}
]
},
"2:49": {
desc: "Buy Consumable",
did: 0x02,
cid: 0x49,
event: "buyConsumable",
fields: [
{
name: "qtyRemaining",
type: "number",
from: 0,
to: 1
}, { name: "coresRemaining",
type: "number",
from: 1,
to: 5
}
]
},
"2:4A": {
desc: "Use Consumable",
did: 0x02,
cid: 0x4A,
event: "buyConsumable",
fields: [
{
name: "id",
type: "number",
from: 0,
to: 1
},
{
name: "qtyRemaining",
type: "number",
from: 1,
to: 2
}
]
},
"2:4B": {
desc: "Grant Cores",
did: 0x02,
cid: 0x4B,
event: "grantCores",
fields: [
{
name: "coresRemaining",
type: "number",
}
]
},
"2:4C": {
desc: "Add XP",
did: 0x02,
cid: 0x4C,
event: "addXp",
fields: [
{
name: "toNextLevel",
type: "number",
}
]
},
"2:4D": {
desc: "Level up Attr",
did: 0x02,
cid: 0x4D,
event: "levelUpAttr",
fields: [
{
name: "attrId",
type: "number",
from: 0,
to: 1
},
{
name: "attrLevel",
type: "number",
from: 1,
to: 2
},
{
name: "attrPtsRemaining",
type: "number",
from: 2,
to: 4
}
]
},
"2:4E": {
desc: "GET PWD SEED",
did: 0x02,
cid: 0x4E,
event: "passwordSeed",
fields: [
{
name: "seed",
type: "number"
}
]
},
"2:55": {
desc: "Abort Macro",
did: 0x02,
cid: 0x55,
event: "abortMacro",
fields: [
{
name: "id",
type: "number",
from: 0,
to: 1
},
{
name: "cmdNum",
type: "number",
from: 1,
to: 3
}
]
},
"2:56": {
desc: "Get Macro Status",
did: 0x02,
cid: 0x55,
event: "macroStatus",
fields: [
{
name: "idCode",
type: "number",
from: 0,
to: 1
},
{
name: "cmdNum",
type: "number",
from: 1,
to: 3
}
]
}
};
|


I hope that you won’t object if I occasionally use contractions and the less formal “you” instead of “one” in my posts presented here. That makes writing it easier for me and ensures a less formal atmosphere.
I attempt to post articles here as carefully as possible, but I cannot guarantee absolute freedom from errors in general at this time. Please bear with me. If you would like to help me please contact me
The information contained in this website is for general information purposes only. I try to keep the information up to date and correct, I make no representations or warranties of any kind, express or implied, about the completeness, accuracy, reliability, suitability or availability with respect to the website or the information, products, services, or related graphics contained on the website for any purpose.
Any reliance you place on such information is therefore strictly at your own risk.


RequestError
public typealias RequestError = KituraContracts.RequestError
Extension of the RequestError from KituraContracts
-
Error when the Database has not been set
Declaration
Swift
public static let ormDatabaseNotInitialized = RequestError(rawValue: 700, reason: "Database not Initialized")
-
Error when the createTable call fails
Declaration
Swift
public static let ormTableCreationError = RequestError(rawValue: 701)
-
Error when the TypeDecoder failed to extract the types from the model
Declaration
Swift
public static let ormCodableDecodingError = RequestError(rawValue: 702)
-
Error when the DatabaseDecoder could not construct a Model
Declaration
Swift
public static let ormDatabaseDecodingError = RequestError(rawValue: 703)
-
Error when the DatabaseEncoder could not decode a Model
Declaration
Swift
public static let ormDatabaseEncodingError = RequestError(rawValue: 704)
-
Error when the Query fails to be executed
Declaration
Swift
public static let ormQueryError = RequestError(rawValue: 706)
-
Error when the values retrieved from the database are nil
Declaration
Swift
public static let ormNotFound = RequestError(rawValue: 707)
-
Error when the table defined does not contain a specific column
Declaration
Swift
public static let ormInvalidTableDefinition = RequestError(rawValue: 708)
-
Error when the Identifier could not be constructed
Declaration
Swift
public static let ormIdentifierError = RequestError(rawValue: 709)
-
Error when an internal error occurs
Declaration
Swift
public static let ormInternalError = RequestError(rawValue: 710)
-
Error when retrieving a connection from the database fails
Declaration
Swift
public static let ormConnectionFailed = RequestError(rawValue: 711, reason: "Failed to retrieve a connection from the database")


SheetJS JS-XLSX In-Browser Export Demo
Example Code /* Generate Workbook */ var wb = XLSX.utils.book_new(); var ws = XLSX.utils.aoa_to_sheet([["a","b"],[1,2,3]]); XLSX.utils.book_append_sheet(wb, ws, "SheetJS"); /* Trigger Download with `writeFile` */ XLSX.writeFile(wb, "SheetJS.xlsb", {compression:true}); Download Generation Methods: - IE6-9 require ActiveX and Windows Script support. The IE_SaveFile function from the included shim uses VBScript. - IE10-11 use msSaveBlob API. - When supported, `saveAs` will be used. - When available, modern browsers use `URL.createObjectURL`. Multiple Download Caveat Some browsers warn or block attempts to download multiple files. Chrome content settings support whitelisting domains for automatic multiple downloads.


There are {{allSegments?.length}} segments on the Ice age trail
{{trailSegments?.length}} of the segments are trails and {{roadSegments?.length}} of the segments are roads
You have {{trailSegments?.length - trailsCompleted}} trails to complete and {{roadSegments?.length - (roadsCompleted || 0) }} roads to complete.
You have completed {{gds.whoAmI.TrailsCompleted?.length || 0}} Trails and {{gds.whoAmI.RoadsCompleted?.length || 0}}
roads


A tool for measuring the efficiency of an algorithm or problem is:
A profiler works on a program, not an algorithm.
The system clock works on a program, not an algorithm.
Empirical analysis works on a program, not an algorithm.
Algorithm analysis estimates the cost of an algorithm or problem.


task_imports_controller.rb
Hipposoft 2008
Import task definition data from external sources.
30-Mar-2008 (ADH): Created.
Take the file data from the 'new' view form and 'create' an “import session”; that is, parse the file and generate an intermediate representation of the tasks therein. Render an 'edit' view where the user can 'edit' the “import session”, by changing titles etc. of the task list obtained from the file.
# File app/controllers/task_imports_controller.rb, line 28 def create # Set up a new TaskImport session object and read the XML file details xmlfile = params[ :import ][ :xmlfile ] || '' @import = TaskImport.new @import.project_id = @current_user.control_panel.project_id if ( xmlfile == '' ) # Empty string = nothing chosen, else a file object flash[ :error ] = "Please choose a file before using the 'Analyse' button." else # The user selected a file to upload, so process it begin # We assume XML files always begin with "<" in the first byte and # if that's missing then it's GZip compressed. That's true in the # limited case of project files. xmlfile = xmlfile.tempfile byte = xmlfile.getc() xmlfile.rewind() xmlfile = Zlib::GzipReader.new( xmlfile ) if ( byte != '<'[ 0 ] ) xmldoc = REXML::Document.new( xmlfile.read() ) task_data = TaskImport.get_tasks_from_xml( xmldoc ) tasks = task_data[ :tasks ] parent_uids = task_data[ :parent_uids ] parent_titles = task_data[ :parent_titles ] if ( tasks.blank? ) flash[ :error ] = 'No usable tasks were found in that file' else @import.tasks = tasks @import.parent_uids = parent_uids @import.parent_titles = parent_titles @import.collapse = @import.max_level @import.generate_filtered_task_list() flash[ :notice ] = 'Tasks read successfully. Please choose items to import.' render( { :action => :edit } ) flash.delete( :notice ) and return # If not deleted, flash message persists for one fetch too many end rescue => error # REXML errors can be huge, including a full backtrace. It can cause # session cookie overflow and we don't want the user to see it. Cut # the message off at the first newline. lines = error.message.split("\n") flash[ :error ] = "Failed to read file: #{ lines[ 0 ] }" flash.delete( :notice ) # In case it got set above, but the render call then failed end end render( { :action => :new } ) flash.delete( :error ) # If not deleted, flash message persists for one fetch too many end
Once the user has updated anything they need to update in the import session 'edit'-like view (see also 'create' above), process the form submission and import any real Tasks into the database if so requested or re-process the input file if necessary.
# File app/controllers/task_imports_controller.rb, line 101 def update @import = TaskImport.new( params[ :import ] ) # Should this list now be collapsed, or should it be imported? unless ( params[ :do_collapse ].nil? ) @import.generate_filtered_task_list() render( { :action => :edit } ) and return end # Import tasks from the filtered list submitted with the form, which holds # a combination of user-editable and hidden preset values. to_import = @import.filtered_tasks.reject { | task | task.import != '1' } if ( to_import.empty? ) flash[ :error ] = 'No tasks were selected for import. Please select at least one task and try again.' else # Right, good to go! Do the import. begin Task.transaction do # Create a new project in passing? if params.has_key?( :do_import_new_task ) project = Project.new project.title = @import.new_project_title project.customer_id = @import.new_project_customer_id project.description = "Created for XML bulk task import on #{ Time.now }" begin project.save! rescue => inner_error raise "Cannot create project: #{ inner_error }" end else project = Project.find( @import.project_id ) end to_import.each do | source_task | Task.new do | destination_task | destination_task.title = source_task.title destination_task.code = source_task.code destination_task.duration = source_task.duration destination_task.billable = source_task.billable destination_task.project = project end.save! end flash[ :notice ] = "#{ to_import.length } #{ to_import.length == 1 ? 'task' : 'tasks' } imported successfully." redirect_to( tasks_path() ) and return end rescue => error flash[ :error ] = "Unable to import tasks: #{ error }" end end render( { :action => :edit } ) flash.delete( :error ) end


Reid Duke
Commonly referred to as "The gentleman of the Magic world", Reid Duke started playing in 1995, at age five,
with his brother Ian Duke, who is now a member of the Magic: The Gathering R&D team at Wizards of the
Coast. For a time, he was primarily a Magic: The Gathering Online player, but made the transition to in-person
competitive play. He qualified for Pro Tour Amsterdam 2010 via rating, and won a Magic Online Championship
Series (MOCS) event to qualify for the 2010 Magic Online World Championship, where he finished 5th, as well
as the 2010 Magic: The Gathering World Championships in Chiba, Japan. Although his finishes in his first Pro
Tours were unspectacular, he has not missed a Pro Tour since Amsterdam 2010.
Duke first experienced success at paper Magic in 2011, when he reached the top eight of two Grand Prix events:
Grand Prix Providence, where he finished fourth, and Grand Prix Montreal, where he finished fifth. He also won
another MOCS event to requalify him for the Magic Online Championship, this year held in San Francisco
concurrently with the 2011 World Championships. Duke ended up winning the event, defeating Florian Pils in the
final. This qualified him for the inaugural Players Championship event (later renamed the Magic World
Championship). At Pro Tour Dark Ascension in Honolulu, Duke finished in the money at a Pro Tour for the first
time, placing 38th.[ From here, he would go on to finish in the money in eight consecutive Pro Tours. He
also won his first Grand Prix when he defeated Todd Anderson in the final of Grand Prix Nashville. He has
since 2012 been a part of the team now known as 'The Pantheon', alongside players such as Jon Finkel, Kai Budde
and Gabriel Nassif.
The 2012 Magic Players Championship did not go well for Duke; he finished the event with a 2–10 record, taking
last place. Following this failure, Duke made it his mission to redeem himself by qualifying for next
year's event and putting up a better performance, even going so far as to write down the mistakes he made in
the tournament. Thanks to three Grand Prix top eight finishes, in Charleston, San Antonio and Quebec City,
as well as stellar performance on the Pro Tour, he succeeded in requalifying for the World Championship when he
finished 9th at Pro Tour Dragon's Maze in San Diego. He finished the 2012–13 season on 52 Pro Points, which
was also sufficient for Platinum membership in the Pro Players Club.
Duke started the 2013–14 season well, winning his second Grand Prix, at GP Miami. Duke went on to dominate
the Swiss rounds of the 2013 World Championship, finishing in first place before the knockout rounds. Duke
faced Josh Utter-Leyton in the semifinals, defeating him 3–2. He was considered a substantial favorite against
his final opponent, Shahar Shenhar, and did indeed take a 2–0 lead in the best-of-five match, but Shenhar came
all the way back to beat Duke 3–2 in an upset. Duke thus took second place in the event. He put up three
more Grand Prix top eight finishes during the season, in Detroit, Barcelona and Philadelphia, before finally
posting a top eight performance at a Pro Tour. At Pro Tour Journey into Nyx in Atlanta, Duke finished fifth,
losing in the quarterfinals to Yuuki Ichikawa. At this point, he was in position to win the 2013–14 Player
of the Year title, but ultimately this was won by Jérémy Dezani. He was also overtaken by teammate Owen
Turtenwald for captainship of the United States national team at the 2014 World Magic Cup when the latter made
the top eight of the final event of the season, Pro Tour Magic 2015.
The 2014–15 season started really well for Duke, with him and his teammates Owen Turtenwald and William Jensen
winning the very first Grand Prix of the season, Grand Prix Portland. At the 2014 World Championships,
however, Duke posted a modest 14th-place finish, and his Pro Tour results throughout the season were average.
He managed to reach two Grand Prix top eights, in Singapore and Montreal, towards the end of the season to
retain Platinum status, but he did not qualify for the 2015 World Championships. In February 2015, Duke almost
won a MOCS event for the third time, but lost in the final.


Prerequisites
how to start advanced .net debugging
Rohith Rajan @debuggingio
debugging.io
Install
Debugging Tools for Windows
Install
Debug Diagnostic Tool v2 Update 2
Configure BuggyBits Application in IIS
Install windows debugging tools
Install Debugdiag 2 Update 2
Debug Diagnostic Tool v2 Update 2
Configure BuggyBits Application in IIS
Download demo website
BuggyBits
Configure Website in IIS


Login in
Login up
Data monitoring...
stevekeol
Please upgrade your browser to use DataShow!
ygc-ygc
Please upgrade your browser to use DataShow!
skypupil
Please upgrade your browser to use DataShow!
...
Please upgrade your browser to use DataShow!


How it works
Data
The client-side downloads data from czech-covid-db github. This repository is updated by czech-covid-db-multiparser , which checks the wikipedia article Pandemie COVID-19 v Česku and official website of the Ministry of Health every minute to see if the numbers are changed. If it detects some information is changed, it stores it as a record in a .csv table, which it then sends to github.
Official dataset
Since 7.4. we use only the official data for czechia. The wikipedia dataset on czech-covid-db is still updated.
Edit 22.3.: We now support the world-wide dataset from Johns Hopkins University.
Growth factor
Our growth factor differs from the commonly used R0 factor . While the the R0 factor used by epidemiologists indicates how many people does an infected person inficate in the infection period, the growth factor we use indicates how many people does an infected person infect in one day.
f(x) = Number of confirmed cases in day "x"
t = The number of day we want to calculate the growth factor for
T = Infection period (phase, when an infected person infects other people and he still isn't quarantined)
Between days
D = Infection period (days)
If t-T+(0,1,2,3,...) is smaller than 0, then f(t-T+(0,1,2,3,...)) is replaced by 0.
From wholes
Growth factor from wholes doesn't exclude people, who aren't arleady quarantined and isn't suitable for prediction.
Prediction
The default prediction parameters are based on our own current estimates (we do that only for czech republic prediction). We are not epidemiologists, so I recommend trying to set your own parameters. Then you can save the configuration and bet with your friend who will hit the result better.
The prediction calculation doesn't start in today, but in day 0.
Prediction with continuos growth factor according to growth factor chart
The growth factor for each calculation is updated to the value from the growth factor graph. The configuration of the growth factor graph is also reflected in the forecast.
Settings
- Value after end of growth factor data - option to set what values will be feeded into the function after using the last value from the growth factor chart
- Limit data - allows you to specify the last date when values from the growth factor chart should be used. To select this date, simply click a point in the growth factor chart or data chart.
If you would like the prediction graph curve to accurately mimic the existing data curve, you must
- set the "Between Days" function with a one-day interval value in the growth factor chart settings
- Turn off the option "limit data" in prediction settings
Functions, mathematically
Function parameters
Mr = Number of people a person encounters in a day
Mg = Population size
pi = The chance of getting infected after an encounter with an infected person
f(x) = Number of confirmed cases in day "x"
T = Infection period (phase, when an infected person infects other people and he still isn't quarantined)
Henry's first epidemic function (Logistic)
It is essentially a recurrent relation of an exponential sequence that does not grow to infinity, but only to a certain maximum, thereby slowing its growth towards the end again by eliminating the possibility of infecting people who are already or have been previously infected. At the same time, it expects that infected people are contagious only for a certain period of time. It does not take mortality into account, the possibility of re-infection after recovering and the biggest problem of this function is that it does not exclude the possibility of multiple infections of the same person in one day.
Henry's second epidemic function (Probabilistic)
Due to many problems of the first function, which are difficult to tune, a slightly different approach is chosen in this case. The function calculates the likelihood of a person becoming infected on a given day, which then increases with the average number of people that he meets per day. This probability is then multiplied by the number of healthy people and the result is how many people were infected that day.
Probability of getting infected
This is used to calculate the chance you got infected today.
To our surprise, both functions eventually return almost the same results.
Development timeline
- 12.3. 2020 - Started developing the wikipedia parser
- 14.3. 2020 - Started developing the frontend, first chart
- 15.3. 2020 - Henry got an idea how to predict, in the evening we have the first prediction chart render.
- 17.3. 2020 - Growth factor chart
- 18.3. 2020 - Finding out that the growth factor function does not people who are already in quarantine into account, development of a new growth factor function
- 19.3. 2020 - Henry's second function (Probabilistic)
- 20.3. 2020 - New parameters in prediction settings, cosmetic details
- 21.3. 2020 - Release, sending friends and relatives
- 22.3. 2020 - World-wide data fron the JHO CSSE dataset
- 30.3. 2020 - Started developing the MZCR parser
- 01.4. 2020 - New parser is completed, czech-covid-db has many new usable data
- 07.4. 2020 - Big update: site is using the official data, new imports, age groups and testing block for czech covid db, option to switch regions
- future - New comparision page (For data and growth factor - comparision of czech regions with czech covid db or countries with CSSE dataset)
- futute - Growth factor prediction??
License
Načítaní license...


This tests that http URLs with plugins cannot access file URLs via the plugin. (Tests the NPN_GetURL API)


|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
| Interface Summary | |
|---|---|
| AnnotationHolder | Any Descriptor object which can be annotated with a description implements this interface. |
| InstanceBuilder | Interface for an object that can construct the core implementation for a service. |
| Class Summary | |
|---|---|
| AbstractParser | Abstract super-class for parsers based around the SAX event model. |
| AbstractServiceDescriptor | Base class for ServicePointDescriptor and
ImplementationDescriptor . |
| AbstractServiceInvocationDescriptor | Base class for descriptors that represent invocating a service with parameters. |
| AttributeMappingDescriptor | Descriptor for the <map> element, nested within a <conversion> module descriptor element. |
| BaseAnnotationHolder | Base class for classes which implement AnnotationHolder . |
| ConfigurationPointDescriptor | Descriptor for the <configuration-point> element, which defines a configuration extension point. |
| ContributionDescriptor | Descriptor for <contribution> element. |
| ConversionDescriptor | Descriptor for the <conversion> module descriptor element. |
| CreateInstanceDescriptor | Descriptor for the <create-instance< element, used to create a core service implementation from a class name. |
| DependencyDescriptor | Descriptor for <dependency> element. |
| DescriptorParser | Used to parse HiveMind module deployment descriptors. |
| ElementParseInfo | Used by DescriptorParser to
track which attributes are expected for an element, and which are required. |
| ImplementationDescriptor | Descriptor for <implementation> elements. |
| InterceptorDescriptor | Descriptor for the <interceptor> element. |
| InvokeFactoryDescriptor | Descriptor for the <invoke-factory> element. |
| ModuleDescriptor | Representation of a HiveMind module descriptor, as parsed by
DescriptorParser . |
| SchemaAssignmentDescriptor | Descriptor for <schema-assignment> element. |
| ServicePointDescriptor | Defines a service extension point. |
| SubModuleDescriptor | Descriptor for <sub-module> element. |
| XmlResourceProcessor | The XmlResourceProcessor processes XML resources using the
DescriptorParser which is used as a SAX ContentHandler. |
Classes used to parse HiveMind module deployment descriptors, and descriptor objects that represent the parsed information.
|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |


Financial Consumer Agency of Canada
www.fcac-acfc.gc.ca
Home > Proactive Disclosure > Contracts
Overview Reports Quarter Contract


NetCDF Streaming Format (Experimental)
Overview
NetCDF Streaming Format (ncstream) is a write-optimized encoding of CDM datasets. Ncstream consists of a series of header and data messages, in any order.
Writes are always appended. Later messages override earlier ones whenever they overlap or conflict. To add or modify structural metadata, simply append a new
header message. Each data message identifies the variable and the section (rectangular subset) of data it contains. A variable's data thus consists of the
collection of data messages for it, if any.
Design Goals
- Experiment with our own on-the-wire protocol to rapidly explore new ideas for remote data access.
- Experiment with ways to optimize subset extraction of large datasets, especially for the case when the subset is specified in coordinate space rather than
index space.
- Must be easy to read ncstream and write netCDF-3 or netCDF-4 files.
- The information content / data model of ncstream is identical to CDM. So ncstream is an alternate encoding of CDM datasets.
Possible uses
- Study OPeNDAP implementation. The java implementation of ncstream should be (close to) maximal I/O efficient. By comparing the same requests on the same
server to OPeNDAP, we should be able to tell how much speedup a rewrite of the OPeNDAP software will yield.
- Augment/explore OPeNDAP. Where the DAP protocol is deficient, ncstream is a way for us to explore possible solutions.
- Augment/explore WCS. We are setting up experimental data services on thredds.ucar.edu that allow coordinate subsetting on Feature datasets. We can use
ncstream
to get these services working, offering much the same functionality as WCS. Implementing WCS services are then much easier to develop. Experience using
ncstream can potentially be fed into WCS standards. This work has already been going on under the name of "NetCDF Subset Service", and ncstream
will be offered as one of the output types.
- Explore asynchronous data services. Both OPeNDAP and WCS want asynchronous data services, for the case when requested data cannot be immediately returned,
for example because of extensive computation or because the data resides in a tape silo. We can explore possible solutions by having our own remote access
protocol.
- Explore alternate file format for CDM datasets. Certain applications may need some of the extended features of CDM / Netcdf-4, without needing all of the
complexity of the HDF5 format. Ncstream may comprise a "sweet spot" of functionality for some use cases.
- Parallel I/O. Append-only file writing may be useful in some high performance applications, with a second pass (external to the generating program) that
efficiently converts to netCDF-3 or netCDF-4 files. During that conversion, a smart program could decide on chunking parameters, data-dependent compression
choices, and other read optimizations.
Implementation
Messages are encoded using Google's Protobuf library.
"Protocol buffers are a flexible, efficient, automated mechanism for serializing structured data – think XML, but smaller, faster, and simpler. You
define how you want your data to be structured once, then you can use special generated source code to easily write and read your structured data to and
from a variety of data streams and using a variety of languages. You can even update your data structure without breaking deployed programs that are
compiled against the "old" format."
The main advantage of protobuf over XML is performance, since both message size and parsing speed is improved. A very important feature of protobuf is the
ability to evolve the message structure in a way that doesn't break previous code.
We don't use protobuf messages for the data, since protobuf messages are built in memory, and we need to be able to stream (write data directly from its
source onto the output stream, eg socket). The multidimensional data is written to the stream in row-major order, with reader-makes-right byte ordering. A
data message identifying the variable and the section that the data represents is part of every data message.
Variable length datatypes like String and Opaque use the vdataMessage for data transfer. First the number of objects is written, then each object, preceded
by its length in bytes as a vlen. Strings are encoded as UTF-8 bytes. Opaque is just a bag of bytes.
Ncstream implements the full CDM data model.
See also:
This document is maintained by Unidata. Send comments to THREDDS support. Last updated: April 2015


click on ticketMachine.jsp to open ticket machine application
click on gate.jsp to open client ticket Gate application
click on clientstationList.jsp to open client List of ticket machine application
click on changeConfig.jsp to change client ticket machine configuration


YAML in automations and scripts
I see many people struggle with the formatting for automations (and scripts) because the official docs are structured in a manner that assumes you’re going to read them in order. So, I thought I’d pull together a little primer. If you’re a YAML purist you probably want to look away now, I’m aiming to make this accessible not 100% technically correct.
YAML (very) basics
YAML largely consists of two things, dictionaries and lists. Dictionaries are the really important piece here, because they hold everything (ultimately). For example:
homeassistant:
Yup, that’s a dictionary. In this case it’s empty, but it’s a dictionary. Dictionaries can hold other dictionaries, or lists. What’s a list? Here’s a list example from the documentation:
whitelist_external_dirs:
- /usr/var/dumping-ground
- /tmp
That’s a list, with two entries (values). Each entry is marked by the hyphen (-
).
You can also separate list items with commas, like this, but I find that it’s often less readable:
whitelist_external_dirs: [ /usr/var/dumping-ground, /tmp ]
The question that always comes up is when you use a dictionary and when you use a list. The unfortunate answer is that you have to check the documentation. Even more unfortunately, a single entry list doesn’t need that - so you’ll sometimes see a list written like:
whitelist_external_dirs:
/usr/var/dumping-ground
That is perfectly valid, but you can see why it causes confusion.
Here’s a little more from that page:
homeassistant:
latitude: 32.87336
longitude: 117.22743
whitelist_external_dirs:
- /usr/var/dumping-ground
- /tmp
That’s a dictionary (homeassistant
) holding:
- Two dictionaries (
latitude
andlongitude
) - One list (
whitelist_external_dirs
)
These are the basic building blocks. If you want more on the subject see this blog post.
Spaces
With YAML, spaces (indenting) are critical. You need to keep your indenting consistent (the advice is generally to use two spaces per level. Oh, and don’t use tabs, unless your editor converts them to spaces. Tabs cause Home Assistant to spit out errors too. Here’s an example with broken indenting that I’ve seen people try to use:
automation:
- alias: "My test automation"
id: "unique_value_42"
initial_state: "on"
trigger:
- platform: state
entity_id:
- switch.furnace
- switch.extractor
Here is how it should look:
automation:
- alias: "My test automation"
id: "unique_value_42"
initial_state: "on"
trigger:
- platform: state
entity_id:
- switch.furnace
- switch.extractor
Running a configuration check will warn you when the YAML is invalid, and it’s something you should do any time you write any YAML.
Quoting
You don’t have to quote things in YAML, but for strings (text) you should or the result may be unexpected. What do I mean? Well "On"
is a string, but On
is a boolean value. These things to humans look the same, but to the computer they’re different. Similarly if you have a number, like 42
, that’s a number, but if you put it in quotes, like "42"
, then that’s a string.
When you need to use multiple quotes on a line, then you need to use different ones for the outer quotes than the inner quotes, like:
automation:
- alias: "Tom's alarm is ringing"
This becomes particularly important if you’re using templates.
Case sensitivity
You also need to keep in mind that computers don’t treat capital letters the same as lower case letters. The string "home"
is different to the computer from "Home"
, so you need to be sure which it is you’re looking for.
States
The state you see in Home Assistant’s user interface may not be the actual state. You need to look at the entity in Developer Tools and then States to see the actual state of the entity. For example, a door/window sensor will show as Open or Closed in the user interface, but is actually 'on'
and 'off'
.
Automation Structure
An automation has four parts
- Information about the automation
- Trigger
- Condition (optional)
- Action
About the automation
There are up to three things you’ll have here.
- The first is the alias, the human readable name. This will typically be used to form the entity_id of the automation.
- Optionally there’s an id. This is used by the automation editor and if present is used to form the entity_id (instead of the alias).
- Finally there’s an optional initial_state. This is used to force the automation to be enabled or disabled at startup.
automation:
- alias: "My test automation"
id: "unique_value_42"
initial_state: "on"
The automation is a list entry, in the automation dictionary.
Trigger
This is the bit that kicks it all off, your list of triggers. When any trigger statement becomes true then the processing begins. You have to have at least one trigger, and you can have as many as you need. It’s worth taking the time now to read the triggers page, and see what’s possible (and what causes a trigger to become true). Here’s a simple one:
trigger:
- platform: state
entity_id: device_tracker.tinkerer
to: 'home'
I’ve used the list indicator here, even though I only have one trigger.  This will trigger when device_tracker.tinkerer
becomes 'home'
. Here is a more complex one:
trigger:
- platform: state
entity_id: device_tracker.tinkerer
to: 'home'
- platform: state
entity_id: device_tracker.better_half
to: 'home'
Two triggers - here the automation will start processing if either device_tracker.tinkerer
or device_tracker.better_half
become 'home'
. Since both are looking for the same target state, I could have written the more compact version:
trigger:
- platform: state
entity_id:
- device_tracker.tinkerer
- device_tracker.better_half
to: 'home'
I prefer this, partly because it’s more compact, but also because it’s much easier to read.
Conditions
Conditions are optional - you don’t need any if your automation doesn’t call for one.
All the conditions in the list have to be currently true for the automation to run. There are many available conditions, including some that allow you to say that this or that must be true. Conditions are particularly useful when you have multiple triggers, and want them all to be true for the automation to run. With conditions however you have to list each separately, you can’t combine them like we did for triggers:
condition:
- condition: state
entity_id: device_tracker.tinkerer
state: 'home'
- condition: state
entity_id: device_tracker.better_half
state: 'home'
Here we require that both device trackers are currently in the state 'home'
. If the automation is triggered by me arriving home, while the wife is still away, then one condition will be false, and the automation won’t run.
Actions
This is where things happen. Actions are basically scripts - a list of actions to take in sequence. That means you can call services (do things), check conditions, pause for a fixed time (delay
) or until a template becomes true (wait_template
), or send events. You have at least one, and potentially many actions. If any step fails (or returns false) then the automation stops at that point. This is handy for condition checks, and not so handy at other times.
With a service call you can generally give one, or many, entities, for example:
action:
- service: switch.turn_on
entity_id:
- switch.furnace
- switch.extractor
- condition: state
entity_id: sun.sun
state: 'below_horizon'
- service: light.turn_on
data:
entity_id: light.basement, light.stairwell
Here I’ve shown the two different ways of listing multiple entities - I prefer the first method. You’ll see that one of these has a data block, and one doesn’t. Generally speaking, you need a data block where you’re providing more than just an entity_id
, but it’s best to simply follow what’s in the documentation.
This particular action block will turn on two switches, and then only if the state of sun.sun
is 'below_horizon'
will it turn on the two lights.


This post originally appeared on GIS Collective.
Last week, the code repository heroes over at GitHub made an awesome announcement: Any .geojson files living in GitHub repos will now be rendered on a Leaflet-driven, OSM tile-backed map right inside of GitHub, with tooltips showing the data properties to boot! This is a truly exciting moment for all geonerds who code, developers who use geodata, and everyone in between.
“Hey, wait a minute,” you may be saying. “What is GitHub again? And GeoJSON… I think I’ve heard of that, but what is it for?” Do not fret! We at GISC know that the field is moving quickly, and we are happy to provide guidance and direction for your geospatial journey.
Git and GitHub
Before learning about GitHub, we first have to understand git. Git is a tool that allows multiple people to work on the same files at the same time without overwriting each other’s changes. This general concept is called version control, and git is a version control system. There are several other version control systems out there, but git is popular because it does its job more efficiently than many (if not all) of the others.
In order for multiple people to work on a project, the data has to live in a place where multiple people can access it, right? GitHub is that place: the site houses thousands and thousands of projects, in individual workspaces called repositories, or repos, that multiple people can access, copy, edit, and update using the tools available via git. These repositories also have a tracking element; when someone makes a change to a project, or a commit, information is stored about the user, the time, the exact changes that were made (all the way down to the individual line inside the file!), and a unique ID that allows the project owner to restore back to that particular moment. It’s pretty effing cool.
Because git is so great, and GitHub is so popular, people have been using it for all kinds of projects, coding and otherwise. I have seen professors put lectures and lecture notes on GitHub, several of my friends use it as a place to work on resumes and terminal projects… you can basically use it for anything. Shoot, even the code for my website lives on GitHub. So it follows that with the advent of mapping and geospatial analysis on the web, there is a lot of geodata housed on GitHub.
GeoJSON
One of the more common formats used for geospatial data in web mapping applications is called GeoJSON. GeoJSON was born out of a format called JSON, which stands for JavaScript Object Notation. JSON is like a table turned on its side; each row gets its own section, and inside of that section is a series of properties and values unique to that row. For example, a table of Presidents of the United States might look something like this:
In JSON, the table might look like this:
“presidents” : { “name” : “Barack Obama”, “hometown” : “Honolulu, HI”, “number” : “44”, “year elected” : “2008”, “terms served” : “2”, “child1” : { “name” : “Malia”, “born” : “1998” }, “child2” : { “name” : “Sasha”, “born” : “2001” } }, { “name” : “George W. Bush”, “hometown” : “New Haven, CT”, “number” : “43”, “year elected” : “2000”, “terms served” : “2”, “child1” : { “name” : “Jenna”, “born” : “1981” }, “child2” : { “name” : “Barbara”, “born” : “1981” } }
GeoJSON takes this format and adds geometry, allowing mapping engines and libraries to parse the data and place these objects in space using coordinates, as well as properties, which can be thought of like the fields and values in an attribute table. GeoJSON allows for points, lines, polygons, and a few other data types, but it’s all formatted in much the same way as the JSON example, above.
Many if not all of the open source mapping libraries for JavaScript (Leaflet and MapBox most notably) support GeoJSON and allow GeoJSON layers to be added to their maps. QGIS, the open source desktop mapping application, also allows the user to view and export data in the GeoJSON format. This has made it extremely popular as a geodata format, which is why it shows up frequently on GitHub.
In Summary
So now that we know what GitHub is used for and how GeoJSON works, we can clearly see why GitHub’s announcement last week was such a big deal: If you click on any .geojson file in a repo on github.com, the data will be rendered and displayed on a map. No more scrolling through text and trying to figure out where [45.528402,-122.65762] might be, because all of the data is displayed spatially for easy perusal!
With limited time and limited space, I can only say so much, so this wasn’t a thorough walkthrough of git, GitHub, or GeoJSON. I didn’t even touch Leaflet or OpenStreetMap — posts going into all of these things in depth will be on the blog in the coming weeks. For now, head on over to GitHub, find some GeoJSON files, check out the sweet maps, and maybe try making your own repo! And please stay tuned for more updates — by the end of the summer, you’re going to be using git like a pro!


Credit Bank
Your Credit Bank : {{credit_bank}}
Remaining
none function
50% Complete (danger)
{% for member in groups %}
{{member.student_id_group}}
{% endfor %}
Submit


Javascript Quiz
Start Quiz
Rules of this quiz
1. You will get
60
seconds to complete quiz.
2. If you answer incorrectly,
10
seconds will be subtracted.
3. When the questions are answered or the clock hits 0, the game is over.
4. Have fun!
Exit Quiz
Continue


Use the Reports menu to choose and generate a variety of reports. The following reports are available from the Reports menu.
- Template Review - lists templates and their details. Filter and group in many ways.
- Template Validation - select the implementation guide you want to validate. Select to show Warnings, Errors, or All. Shows the status of any templates containing warnings or errors.
- Organization - lists all users in an organization, along with their permissions and contact info.
View a Report
- From the Reports menu, choose the report you want to view. A report page appears, with a page summary and navigation at top. A filter box appears at the top of each column.
- Enter filters in the top row of the report to limit the data that appears in the report as described in Report Filters, below.
- Print the report as needed.
Report Filters
You can filter by the contents of a column to limit the data that appears in the report.
- String filter - Enter text in one or more columns.
- Dropdown filter - Choose a filter from the drop-down menu at the top of a column to view only entries with that value.


A simple slider example
Monet's jardinthe water garden
formed by a tributary to the Epte, the pond with the water lilies, wisterias and azaleas.
rad-ish, n. Etym: [F. /ra-dish/, L. radic-, radix root]
Defn:a small, round vegetable that is red or white, and has a sharp spicy taste; also: the plant that produces this vegetable
Croc*o-dile, n. Etym: [F. / 'kräkə, dīl /, L. crocodilus, Gr. krokodilos] [Written also cocodrille, cokadrill] 1. (Zoöl.)


Picking your next race or event will keep you on track.
Setting a goal is a powerful thing. It can help to solidify your commitment to running and energize your training routine. Here are some upcoming local races to keep you motivated. Don't forget to add this new 'race goal' to your running log.
Saturday, June 5, 2010: Wissiahickon Trail 10K, 5K Classic, Chestnut Hill, PA
Saturday, June 6, 2010: Scott Coffee Moorestown Rotary 8K Run, Moorestown, NJ
Saturday, June 26th, 2010: Skippack Lions 5K & 1 Mile Fun Run,Skippack, PA
Sunday, July 11, 2010: Philadelphia Women's Triathlon, Philadelphia, PA
Saturday, July 24 and Sunday, July 25, 2010: New Jersey State Triathlon, Mercer County Park, NJ
Sunday, September 19, 2010: ING Philly Distance Run Half Marathon, Philadelphia, PA
2010 date to be determined: DQ Triathlon at Marlton Lakes, Marlton, NJ
2010 date to be determined: Miles for Smiles 5K Charity Run, Fort Washington, PA
2010 date to be determined: Run with the Dolphins 5K, Broomall, PA


the NYC Taxi Hub app is built to illustrate the power of
Elasticsearch's
GEOLOCATION capabilities; as well as how it could integrate with 3rd party
MAP libraries such as
Google Map .
One important point to note is that the dataset is based on the
NYC taxi
information; hence if you are providing a GeoPoint outside NYC, you won't
be able to see any search result return.
PS. The view technology stack chosen for the app is
Vue.js.
Vue is chosen by its simplicity and capabilities (would say Vue has the
merits of
Ng4 -
client side application architecture and
react.js -
component awared development).
In this course, we would focus on how to integrate
Elasticsearch's queries and aggregations with the
view stack technology (could be any framework rather than Vue.js), hence
the techniques or approaches of the view side would be skipped. But do feel
free to look into the client side code on how the components are created
.
this component's main goal is to let you key in a valid
GeoPoint
to set the
center marker on the Map. Another way to set
the GeoPoint (the latitude and longitude pair) is by entering a place name;
this place name is used to retrieve the corresponding GeoPoint by the
Google Maps Geocoding API.
PS. there are cases that the place name given might not be recognizable OR
it could be recognized as another place instead.
PS. since this course is based on how to integrate Elasticsearch Geo
capabilities with the View stack technology; details on how to invoke
Google Maps API are skipped; but do feel free to read the code on how to
drive Google Maps to work.
by providing the
distance in either
miles OR
km; we could get back all the taxi(s) within the
given distance originating from the center marker indicated by the
"Set my Location" component.
We are using the
geo-distance query to get back the results:
GET nyc_taxi_hub_2016_11/_search
{
"size": 1000,
"query": {
"bool": {
"filter": [
{
"geo_distance": {
"distance": "2miles",
"pickup_location.location": {
"lon": -73.96535510000001,
"lat": 40.7828647
}
}
}
]
}
}
}
Now we get back the 1st 1000 documents (taxis) based on the GeoPoint of
the provided center marker. The field we use to calculate the distance is
based on
pickup_location.location which is a
geo_point data-type.
Cool! In this section, we have covered and run through
Geo-distance Query.
By now, you have an idea how Geo-distance works! In real world use cases,
shared-economy transportation apps use similar geolocation technologies to
locate vehicles (automobiles, taxis or vans) for services. Basically, the
vehicles would update their geo-location data through GPS; take an example, if
you are trying to call a vehicle (could be a taxi) at NYC Times Square, the
app would use Times Square's latitude and longitude pair as the origin and
starts to find the available vehicles within a certain distance (e.g. 2 miles).
Theoretically, the vehicles should be sorted or scored base on how near
they are from the origin point.
There are also many applications that make use of Geolocations technology;
dating apps and chat apps also have geo-distance features like
"find a person nearby". Typically if your business or app could collect
geolocation information, there might be a chance to add new services / features
based on geo-distance(s).