--- layout: post title: Cascalog 1.8.1 Released ---
Nathan Marz and I are releasing Cascalog 1.8.1 today! We've added a few interesting features, and I thought I'd provide a bit more detail here for anyone interested.
cascalog.api
now includes support for cross-joins; just add (cross-join)
to your query as its own predicate.
Think of a cross-join as a "tuple comprehension", or cartesian product, with similar results to clojure.core/for
; it's not very efficient, as it forces all tuples through a single reducer (and causes a massive blowup in the number of tuples!). Here's an example:
(let [a-src [[1] [2]] b-src [[3] [4]]] (?<- (stdout) [?a ?b] (a-src ?a) (b-src ?b) (cross-join)))
This results in the following on stdout
:
RESULTS ----------------------- 1 3 1 4 2 3 2 4 -----------------------
If you're interested, here's the implementation:
(def cross-join (<- [:>] (identity 1 :> _)))
This is the only predicate macro I know of that can get away with no input OR output vars.
When running a cascalog query on a cluster, usual practice is to include (:gen-class)
in the namespace form, and write a -main
method that gets AOT-compiled and called by Hadoop.
Each defmain
will compile to a class with the supplied name, prefixed by the namespace. (myproject.jobs.FirstQuery
and myproject.jobs.SecondQuery
, in this example.)
(As always, make sure to add the :aot [myproject.jobs]
, kv-pair to project.clj
, including each namespace containing a defmain
or (:gen-class)
in the vector. If you want to call some defmain
function directly, (defmain Query ...)
can be called from the REPL with (Query-main ...)
.) I recommend keeping your defmain
functions skinny, and testing the components it calls.
 This one JobConf entry, "io.serializations", has caused me much pain. We've added with-serializations
, which makes the supplied Hadoop serializations available to all queries enclosed within the form. These forms nest, and play well with the existing with-job-conf
. For example:
;; You can specify serializations in string form... (with-serializations ["org.apache.hadoop.io.serializer.JavaSerialization"] (<- [?a] ...)) ;; ... or directly, with the class. (import 'org.apache.hadoop.io.serializer.JavaSerialization) (with-serializations [JavaSerialization] (<- [?a] ...)) ;; Serializations nest and unique against each other! (with-job-conf {"io.serializations" "my.ns.SomeSerialization"} (with-serializations [JavaSerialization OtherSerialization] (with-serializations ["my.ns.SomeSerialization" ThirdSerialization] (<- [?a] ...))))
first-n
can now handle straight-up vectors, lists, and cascading taps, in addition to queries.
Say we've previously run a wordcount job that output [?word ?count]
2-tuples to a sequencefile, and we want to pull the top 100 words by count. Here's how we do that with first-n:
(use 'cascalog.api) (require '[cascalog.ops :as c]) (defn wordcount-tap [path] (-> (hfs-seqfile path) (name-vars ["?word" "?count"]))) (defn top-100 [file-path] (c/first-n (wordcount-tap path) 100 :sort ["?count"] :reverse true)) (defmain Top100 [tuple-path results-path] (?- (hfs-textline results-path) (top-100 tuple-path)))
first-n
with vectors and lists is mostly interesting for testing purposes.
Just a few bugfixes to note:
(:trap (some-tap ...))
option predicates.


Gremlin comes with a collection of predefined steps. Gremlin steps map to a particular Pipe
in Pipes. A Pipe<S,E>
extends Iterator<E>
and Iterable<E>
. It takes an object of type S
and emits and object of type E
. Chaining pipes together creates a Pipeline
. In essence, Gremlin is a DSL for constructing Pipeline
objects. Finally, be sure to look at User Defined Steps to learn how to define your own custom steps.
Even link in a pipeline is called a step. Steps can be categorized as either being transform-, filter-, sideEffect-, or branch- based.
| step |
description |
pipe |
|---|
transform{closure} |
emit the result of the closure |
TransformFunctionPipe(closure) |
_ |
emit the incoming object unchanged |
IdentityPipe() |
V |
the vertex iterator of the graph (with key indices, V(key,value) possible) |
VerticesPipe() |
E |
the edge iterator of the graph (with key indices, E(key,value) possible) |
EdgesPipe() |
id |
the identifier of the element |
IdPipe() |
label |
the label of the edge |
LabelPipe() |
out(labels...?) |
out adjacent vertices to the vertex |
VerticesVerticesPipe(out,labels...?) |
outE(labels...?) |
the outgoing edges of the vertex |
VerticesEdgesPipe(out,labels...?) |
in(labels...?) |
in adjacent vertices to the vertex |
VerticesVerticesPipe(in,labels...?) |
inE(labels...?) |
the incoming edges of the vertex |
VerticesEdgesPipe(in,labels...?) |
both(labels...?) |
both adjacent vertices of the vertex |
VerticesVerticesPipe(both,labels...?) |
bothE(labels...?) |
both incoming and outgoing edges of the vertex |
VerticesEdgesPipe(both,labels...?) |
outV |
the outgoing tail vertex of the edge |
EdgesVerticesPipe(out) |
inV |
the incoming head vertex of the edge |
EdgesVerticesPipe(in) |
bothV |
both incoming and outgoing vertices of the edge |
EdgesVerticesPipe(both) |
['key'] |
get the property value of an element |
PropertyPipe('key') |
key |
get the property value of an element |
PropertyPipe(key) |
map(strings..?) |
get the property map of an element (for provided keys?) |
PropertyMapPipe(strings..?) |
memoize(string, map?) |
memoize a named section with optional map being a cache |
MemoizePipe() |
memoize(integer, map?) |
memoize n -steps ago with optional map being a cache |
MemoizePipe() |
gather{closure?} |
collect all objects up to that step and process with provided closure |
GatherPipe() or GatherFunctionPipe(closure) |
scatter |
unroll all objects in the iterable at that step |
ScatterPipe() |
path(closures..?) |
the path through the pipeline up to this point, where closures are post-processing for each object in the path |
PathPipe() or PathFunctionPipe(closures...?) |
cap |
emits the side effect of the pipe prior |
SideEffectCapPipe(pipe) |
select(list?,closures..?) |
select the named steps to emit after select with post-processing closures |
SelectPipe(list?, closures..?) |
shuffle |
collect all objects up to that step and randomize their order |
ShufflePipe() |
order(closure?) |
order the items in the stream according to the closure if provided |
OrderPipe(closure?) |
order(T) |
order the items in the stream according to T where T is T.decr or T.incr |
OrderPipe(T) |
orderMap(closure) |
for every incoming map, sort and emit keys |
OrderMapPipe(closure) |
orderMap(T) |
for every incoming map, sort by T and emit keys where T is T.decr or T.incr |
OrderMapPipe(T) |
linkOut(string,vertex) |
for every incoming vertex, create an outgoing label -edge to provided vertex |
LinkPipe(string,vertex) |
linkIn(string,vertex) |
for every incoming vertex, create an incoming label -edge to provided vertex |
LinkPipe(string,vertex) |
linkBoth(string,vertex) |
for every incoming vertex, create an incoming and outgoing label -edge to provided vertex |
LinkPipe(string,vertex) |
linkOut(string,string) |
for every incoming vertex, create an outgoing label -edge to provided vertex |
LinkPipe(string,AsPipe) |
linkIn(string,string) |
for every incoming vertex, create an incoming label -edge to provided vertex |
LinkPipe(string,AsPipe) |
linkBoth(string,string) |
for every incoming vertex, create an incoming and outgoing label -edge to provided vertex |
LinkPipe(string,AsPipe) |
| step |
description |
pipe |
|---|
filter{closure} |
return true to allow the object to pass |
FilterFunctionPipe(closure) |
[i] |
emit the particular indexed object |
RangeFilterPipe(i,i) |
[i..j] |
emit the objects indexed by the range |
RangeFilterPipe(i,j) |
has('key',value) |
allow element if has property |
PropertyFilterPipe('key',value,Filter.EQUALS) |
has('key',T,value) |
allow element if property is T related to value, where T is T.eq , T.neq , T.lt , T.lte , T.gt , or T.gte |
PropertyFilterPipe('key',value,T) |
hasNot('key',value) |
filter element if has property |
PropertyFilterPipe('key',value,Filter.NOT_EQUALS) |
hasNot('key',T,value) |
filter element if property is not T related to value |
PropertyFilterPipe('key',value,!T) |
back(integer) |
go back to the results from n-steps ago |
BackFilterPipe(Pipe) |
back(string) |
go back to the results as the named step |
BackFilterPipe(Pipe) |
and(pipes...) |
emit the incoming object if all pipes emit results |
AndFilterPipe(pipes...) |
or(pipes...) |
emit the incoming object if any pipe emit results |
OrFilterPipe(pipes...) |
random(double) |
emit the incoming object if biased coin toss is heads |
RandomFilterPipe(double) |
dedup(closure?) |
emit only incoming objects that have not been seen before with optional closure being object to check on |
DuplicateFilterPipe(closure?) |
simplePath |
emit the object only if the current path has no repeated elements |
CyclicPathFilterPipe() |
except(collection) |
allow everything to pass except what is in collection |
ExceptFilterPipe(collection) |
except(string...) |
allow everything to pass except what is at named steps |
ExceptFilterPipe(asmap, string...) |
retain(collection) |
allow everything to pass except what is not in collection |
RetainFilterPipe(collection) |
retain(string...) |
allow everything to pass except what is not at named steps |
RetainFilterPipe(asmap, string...) |
interval(key,start,end) |
allow elements to pass that have their property in provided start/end interval |
IntervalFilterPipe(key,start,end) |
| step |
description |
pipe |
|---|
sideEffect{closure} |
emits input, but calls a side effect closure on each input |
SideEffectFunctionPipe(closure) |
groupBy(map?){closure}{closure} |
emits input, but groups input after processing it by provided key-closure and value-closure |
GroupByPipe(map?, closure, closure) |
groupCount(map?){closure?}{closure?} |
emits input, but updates a map for each input, where closures provides generic map update |
GroupCountFunctionPipe(map?,closure?,closure?) |
aggregate(collection?,closure?) |
emits input, but adds input in collection, where provided closure processes input prior to insertion (greedy) |
AggregatePipe(collection?,closure?) |
table(table?,strings..?,closures..?) |
emits input, but stores row of as values (constrained by column names if provided) |
TablePipe(table?,strings..?,closures..?) |
tree(map?, closures..?) |
emit input, but stores the tree formed by the traversal as a map |
TreePipe(map?, closures..?) |
as(string) |
emits input, but names the previous step |
AsPipe(string, Pipe) |
optional(integer) |
go back to the results from n-steps ago |
OptionalPipe(Pipe) |
optional(string) |
go back to the results as the named step |
OptionalPipe(Pipe) |
store(collection?,closure?) |
emits input, but adds input to collection, where provided closure processes input prior to insertion (lazy) |
StorePipe(collection?, closure?) |
| step |
description |
pipe |
|---|
loop(integer){whileClosure}{emitClosure?} |
if whileClosure true for emitted object, put object back at start (emit object mid-loop if emitClosure is true) |
LoopPipe(Pipe,whileC,emitC?) |
loop(string){whileClosure}{emitClosure?} |
if whileClosure true for emitted object, put object back at start (emit object mid-loop if emitClosure is true) |
LoopPipe(Pipe,whileC,emitC?) |
ifThenElse{ifClosure}{thenClosure}{elseClosure} |
if/then/else branch |
IfThenElsePipe(ifC,thenC,elseC) |
copySplit(pipes...) |
copies incoming object to internal pipes |
CopySplitPipe(pipes...) |
fairMerge |
round-robin merges internal pipe objects |
FairMergePipe() |
exhaustMerge |
exhaustively merges internal pipe objects |
ExhaustMergePipe() |


 But it all struck me as interesting, so I reproduce it here. I'm only really still at the stage of discovering how these strange things called "stories" actually work, so I crave the indulgence of the more cogent critic.
Chapters
If you haven't read the story itself yet, you might want to do so.  It starts here.
Explanation
After the minor failure of my six-part story to really carry as far as the end, I decided to write a new story. Or rather, it decided to write itself: the first two chapters were written largely independently, and then it was clear that a bigger story could be told using them and other short stories. I think this story is a lot stronger, as no one chapter is written as filler in order to carry the others. Thus they can be read as individual short stories, or as a five-part work.
Some judicious editing and re-editing allowed this to be taken even further. Not only are the five stories largely capable of being taken out of context, but they can be put together in several different contexts. I'm no Scott McCloud (thankfully) but I thought this was interesting enough for a bit of discussion. To do so, we'll need one or two diagrams. Because I've always been a fan of the style of the London Underground map's design, I've shamelessly and ineptly copied it. I don't know how much I've unintentionally intentionally forced it, but there is also a neat correspondence in the style, which I'll point out later.
Interpretation 1: cut and paste
The most basic reading of the story is in a straight, "publishing-chronological" order: in the order of how anyone might have read them as they went up on the site. Because of the "shape" this seemed to map out in my head, I've called this the Central Line:
This order is simple and easy to follow, but the overall story doesn't make sense in this context. Most people are used to chapters arriving out of "story-chronological" order in a book, though, and would therefore try and rearrange them in their head so that they made sense.
Interpretation 2: two separate stories
So: a first step in making sense of the chronology might be to split the story into its two clearly-defined parts. Of course, pretty much anyone who has ever read a novel (outside of some drivel by Kathy Lette or John Irving) will be able to follow the fairly basic concept of "chapters not necessarily arriving in the order they happened." But I'd like to think that the looseness with which I wrote the story means that, when splitting the story up in order to start reconstructing it with a sensible time frame, one is actually able to come up with a valid interpretation of the story, as two separate stories, that may or may not (modulo authorial intent, which is anybody's guess, even mine) have been the way I meant things to be interpreted. In other words: if you can't be clever, then at least don't rule out the possibility that you are.
Anyone who has ever tried to get to Mornington Crescent will know that the bifurcation of the Northern Line makes it confusing to navigate and comprehend. So this interpretation is named after that line:
Again, the independence of the five stories easily permits this combination to be actually interpreted as two separate stories. Lovely, if a bit strained by one branch only having two stories.
Interpretation 3: before or after
Comparing what Oliviero Paio says with what Jon's boss tells him, it is possible for the London branch of the story to either precede or succeed the other branch. If the London branch occurs first, then Jon could be sent to spy on Mr Barnaby; if the Spanish branch is first, then Paio has asked Dr Harris to send Jon on the basis of Barnaby's delivery.
Furthermore, there are a few hints from the characters at a repetition of the plot they are embroiled in over and over again (albeit with different couriers/spies, of course). I've decided, mostly because of this potentially infinite tit-for-tat spying that could be going on, but also because it encapsulates the two interpretations in the preceding paragraph, to lump all of these together as the Circle Line:
Thus we have a courier who arrives with information in Spain, and on this information someone is sent from London to follow another courier to Spain, who in turn outwits his tail and arrives with information....
Interpretation 4: the same person
The final interpretation I want to bring out is the following and isn't obvious: the entire story is based around a single person, a courier called Jonathan Barnaby. This courier is sent by his boss in London to Spain with important information, and on the way believes he is being followed. He strikes out on foot to shake off his pursuer, and eventually meets with Oliviero Paio to deliver the information. Let's call this the District Line:
I'd have preferred the second interpretation above to be called the District Line, because of its division of the story into two separate locations. In the end, though, the Northern Line most suited the structure of that interpretation, if not its content. And the same is true here: why? because, as on the London Underground itself, the District Line is a kind of "special case" of the Circle Line, that does not connect up to form a circle, but terminates instead.
Results
I have no idea where this is leading, or how much it could be expanded. If this faintly whimsical game were to be played in an entire novel, then one might have a masterwork, or alternatively a confusing mess; or worse, something reminiscent of a choose-your-own-adventure book. Let us all pause for a moment, to shudder. I also have no real feeling for whether this vagueness permits the reader to stretch their own powers, as a reader; if instead it just makes them feel rather neglected, starved of a stricter structure.
What I have learned from this, though, is that I can write better stories if I can try and get individual chapters to speak for themselves rather than acting as fillers for others. No doubt a future experiment will teach me that, in some circumstances, the precise opposite is true. At that point I will have to start all over again with trying to figure out how to write anything longer than around 800 words.


1 write to Closure
System.Management.Automation (1)
engine\interpreter\InterpretedFrame.cs (1)
64
Closure
= closure;
4 references to Closure
System.Management.Automation (4)
engine\interpreter\ControlFlowInstructions.cs (1)
795
return _compiledLoop(frame.Data, frame.
Closure
, frame);
engine\interpreter\LocalAccess.cs (3)
103
var box = frame.
Closure
[_index];
120
var box = frame.
Closure
[_index];
226
var box = frame.
Closure
[_index];


| Worker Name | Worker Surname | Compensation Amount | Compensation Date | Daily Working Time | Hour Salary | Start Time | HR Name | HR Surname | |
|---|---|---|---|---|---|---|---|---|---|
| {{ compensation.workerName }} | {{ compensation.workerSurname }} | {{ compensation.compensationAmount }} | {{ compensation.compensationDate}} | {{ compensation.dailyWorkingTime }} | {{ compensation.hourSalary | currency }} | {{ compensation.startDate }} | {{ compensation.name }} | {{ compensation.surname}} |


@main("Credits") {
JS Phaser:
Copyright © 2017 Richard Davey, Photon Storm Ltd.
JS Slick UI:
Copyright Phaser-plugin by ikkewa under MIT license, fork of bower.json [at]flaxis/slick-ui
Font Minecraftia:
created by Andrew Tyler www.AndrewTyler.net and font[at]andrewtyler.net, hosted at http://www.dafont.com/minecraftia.font
Font PARPG:
Hosted at http://opengameart.org/content/old-typewriter-font by User Q_x http://opengameart.org/users/qx
Sounds:
Some of the sounds in this project were created by David McKee (ViRiX) soundcloud.com/virix
www.kenney.nl
Sounds keypresses:
Copyright 2012 eklee http://freesound.org/people/eklee/ |
Copyright 2012 qubodup http://freesound.org/people/qubodup/ extraction of single sounds |
License: CC Attribution 3.0 http://creativecommons.org/licenses/by/3.0/
Music:
"A Journey Awaits" by Pierre Bondoerffer ([at]pbondoer)
Background:
http://de.freepik.com/fotos-kostenlos/buroarbeit_925201.htm - Freepik - created by whatwolf
Collection Kenney's UI:
http://kenney.nl/assets/ui-pack


AWS::DMS::Certificate
The AWS::DMS::Certificate
resource creates an SSL certificate that encrypts connections between AWS DMS endpoints
and the replication instance.
Topics
Syntax
To declare this entity in your AWS CloudFormation template, use the following syntax:
JSON
{ "Type": "AWS::DMS::Certificate", "Properties": { "CertificateIdentifier":
String
, "CertificatePem":String
, "CertificateWallet":String
} }
YAML
Type: AWS::DMS::Certificate Properties: CertificateIdentifier:
String
CertificatePem:String
CertificateWallet:String
Properties
CertificateIdentifier
-
The customer-assigned name of the certificate. Valid characters are
A-z
and0-9
.Required: No
Type: String
Update requires: Replacement
CertificatePem
-
The contents of the .pem X.509 certificate file for the certificate.
Required: No
Type: String
Update requires: Replacement
CertificateWallet
-
The location of the imported Oracle Wallet certificate for use with SSL.
Required: No
Type: Base64-encoded binary data object
Update requires: Replacement
Return Value
Ref
When you pass the certificate of an AWS::DMS::Certificate
resource to
the intrinsic Ref
function, the function returns the Amazon Resource Name (ARN) of the
certificate.
For more information about using the Ref
function, see Ref.
Example
JSON
{ "AWSTemplateFormatVersion": "2010-09-09", "Description": "Certificate test", "Resources": { "BasicCertificate": { "Type": "AWS::DMS::Certificate", "Properties": { "CertificatePem": "-----BEGIN CERTIFICATE-----\n MIID/DCCAuSgAwIBAgIBUDANBgkqhkiG9w0BAQsFADCBijELMAkGA1UEBhMCVVMx...mqfEEuC7uUoPofXdBp2ObQ==\n -----END CERTIFICATE-----\n" } } } }
YAML
AWSTemplateFormatVersion: 2010-09-09 Description: Certificate test Resources: BasicCertificate: Type: AWS::DMS::Certificate Properties: CertificatePem: | -----BEGIN CERTIFICATE----- MIID/DCCAuSgAwIBAgABCDEFgkqhkiG9w0BAQsFADCBijEXAMPLE1UEBhMCVVMx...mqfEEuC7uUoPofXdBp2ObQ== -----END CERTIFICATE-----
See Also
-
ImportCertificate in the AWS Database Migration Service API Reference.


Here is a list of my best friends
My Favorite Foods
Some of my favorite things include blowing trees and cutting waters


Version: %VERSION%
Client ID: %CLIENT_ID%
General settings:
WIFI Data:
MQTT Data
this_topic/state
this_topic/SleepTime
this_topic/Mode
Firmware upload


|
MLIB
|
Classes | |
| class | mlib::parse_context |
| parsing context for NMEA-0183 parser More... | |
Functions | |
| bool | mlib::nmea_checksum (const char *buf) |
| Compute the checksum of a NMEA sentence. More... | |
| int | mlib::dbs (const char *buf, double *depth) |
| NMEA-0183 DBS sentence. More... | |
| int | mlib::dbt (const char *buf, double *depth) |
| NMEA-0183 DBT sentence. More... | |
| int | mlib::dpt (const char *buf, double *depth, double *offset, double *range) |
| NMEA-0183 DPT sentence.  More... | |
| int | mlib::gll (const char *buf, double *lat, double *lon, double *time, int *mode) |
| NMEA-0183 GLL sentence. More... | |
| int | mlib::gns (const char *buf, double *time, double *lat, double *lon, int *mode, int *sat, double *dop, double *height, double *age, int *station) |
| int | mlib::gsa (const char *buf, int *hmode, int *fmode, int *sv, double *pdop, double *hdop, double *vdop) |
| NMEA-0183 GSA sentence.  More... | |
| int | mlib::gsv (const char *buf, int *tmsg, int *msg, int *count, int *sv, int *az, int *elev, int *snr) |
| NMEA-0183 GSV sentence - Satellites in View. More... | |
| int | mlib::gxp (const char *buf, double *lat, double *lon, double *time, int *wp) |
| NMEA-0183 GXP sentence. More... | |
| int | mlib::hdg (const char *buf, double *head, double *dev, double *var) |
| NMEA-0183 HDG sentence. More... | |
| int | mlib::hdm (const char *buf, double *head) |
| NMEA-0183 HDM sentence.  More... | |
| int | mlib::psathpr (const char *buf, double *time, double *head, double *pitch, double *roll, char *type) |
| NMEA-0183 Hemisphere GNSS proprietary sentence. More... | |
| int | mlib::ptnlggk (const char *buf, double *lat, double *lon, double *time, double *height, double *dop, int *sat, int *mode) |
| NMEA-0183 Trimble proprietary PTNLGGK sentence. More... | |
| int | mlib::ptnlqa (const char *buf, double *sigman, double *sigmae, double *smaj, double *smin, double *orient) |
| NMEA-0183 Trimble proprietary PTNL,QA sentence. More... | |
| int | mlib::rmc (const char *buf, double *lat, double *lon, double *time, double *speed, double *head, int *date, int *mode) |
| NMEA-0183 RMC sentence. More... | |
| int | mlib::ttm (const char *buf, double *utc, int *num, char *name, double *dist, double *brg, int *relbrg, double *speed, double *cog, int *relcog, double *cpa, double *tcpa, int *stat) |
| NMEA-0183 TTM sentence (Tracked Target message). More... | |
| int | mlib::vtg (const char *buf, double *speed, double *head) |
| NMEA-0183 VTG sentence. More... | |
| int | mlib::zda (const char *buf, double *time, unsigned short *day, unsigned short *month, unsigned short *year) |
| NMEA-0183 ZDA sentence. More... | |
| mlib::parse_context::parse_context (const char *buf) | |
| Constructor for a parsing context. | |
| char * | mlib::parse_context::token () |
| Return next token of a NMEA sentence. More... | |
| int mlib::dbs | ( | const char * | buf, |
| double * | depth | ||
| ) |
$ttDBS,depf,f,depm,M,depF,F
Returned value is always in meters.
| int mlib::dbt | ( | const char * | buf, |
| double * | depth | ||
| ) |
$ttDBT,depf,f,depm,M,depF,F
Returned value is always in meters.
This sentence is obsolete.
| int mlib::dpt | ( | const char * | buf, |
| double * | depth, | ||
| double * | offset, | ||
| double * | range | ||
| ) |
$ttDPT,dep,offset,range
| int mlib::gga | ( | const char * | buf, |
| double * | lat, | ||
| double * | lon, | ||
| double * | time, | ||
| double * | height, | ||
| double * | undul, | ||
| double * | dop, | ||
| int * | sat, | ||
| int * | mode, | ||
| double * | age, | ||
| int * | station | ||
| ) |
NMEA-0183 GGA sentence.
$ttGGA,hhmmss,xxxx.xx,N,xxxxx.xx,W,q,s,dop,msl,M,und,M[,age,station]
| int mlib::ggk | ( | const char * | buf, |
| double * | lat, | ||
| double * | lon, | ||
| double * | time, | ||
| double * | height, | ||
| double * | dop, | ||
| int * | sat, | ||
| int * | mode | ||
| ) |
$ttGGK,hhmmss,mmddyy,xxxx.xx,N,xxxxx.xx,W,q,s,dop,geo,M
| int mlib::gll | ( | const char * | buf, |
| double * | lat, | ||
| double * | lon, | ||
| double * | time, | ||
| int * | mode | ||
| ) |
$ttGLL,lat,N,lon,W[,time,valid,[mode]]
| int mlib::gns | ( | const char * | buf, |
| double * | time, | ||
| double * | lat, | ||
| double * | lon, | ||
| int * | mode, | ||
| int * | sat, | ||
| double * | dop, | ||
| double * | height, | ||
| double * | age, | ||
| int * | station | ||
| ) |
NMEA-0183 GNS sentence.
$–GNS,hhmmss.ss,llll.lll,a,yyyyy.yyy,a,c–c,xx,x.x,x.x,x.x,x.x,x.x*hh
| int mlib::gsa | ( | const char * | buf, |
| int * | hmode, | ||
| int * | fmode, | ||
| int * | sv, | ||
| double * | pdop, | ||
| double * | hdop, | ||
| double * | vdop | ||
| ) |
GNSS DOP and Active Satellites
GNSS receiver operating mode, satellites used in the navigation solution reported by the GGA or GNS sentence, and DOP values.
$--GSA,a,x,xx,xx,xx,xx,xx,xx,xx,xx,xx,xx,xx,xx,x.x,x.x,x.x<CR><LF> | | | | | | | | | | | | | +-- VDOP | | | | | +------ HDOP | | | | +---------- PDOP | | |_________________________________| | | | | | +--- ID numbers of satellites used in solution | +---------------- Mode: 1 = Fix not available, 2 = 2D, 3 = 3D +------------------ Mode: M = Manual, forced to operate in 2D or 3D mode A = Automatic, allowed to automatically switch 2D/3D
| int mlib::gst | ( | const char * | buf, |
| double * | time, | ||
| double * | rms, | ||
| double * | smaj, | ||
| double * | smin, | ||
| double * | orient, | ||
| double * | stdlat, | ||
| double * | stdlon, | ||
| double * | stdh | ||
| ) |
$ttGST,time,rms,semimaj,semimin,orient,stdlat,stdlon,stdh
| int mlib::gsv | ( | const char * | buf, |
| int * | tmsg, | ||
| int * | msg, | ||
| int * | count, | ||
| int * | sv, | ||
| int * | az, | ||
| int * | elev, | ||
| int * | snr | ||
| ) |
$xxGSV,t,n,c,id,el,az,sn,id,az,el,sn,id,az,el,sn,id,az,el,sn*hh | | | | | | | | || ||__________+- satellite 4 | | | | | | | | ||__________+------------- satellite 3 | | | | | | | |__________+------------------------- satellite 2 | | | | | | +------- SNR satellite 1 (0-99) | | | | | +---------- Azimuth satellite 1 (0-359) | | | | +------------- Elevation satellite 1 (0-90) | | | +---------------- SV number satellite 1 | | +------------------ Total number of satellites in view | +-------------------- Message number +---------------------- Total number of messages
| int mlib::gxp | ( | const char * | buf, |
| double * | lat, | ||
| double * | lon, | ||
| double * | time, | ||
| int * | wp | ||
| ) |
$ttGXP,time,lat,N,lon,a,wp
| int mlib::hdg | ( | const char * | buf, |
| double * | head, | ||
| double * | dev, | ||
| double * | var | ||
| ) |
$ttHDG,hdg,dev,E/W,var,E/W
magnetic = hdg + dev true = magnetic + var
| int mlib::hdm | ( | const char * | buf, |
| double * | head | ||
| ) |
$ttHDM,xxx.x,M
| int mlib::hdt | ( | const char * | buf, |
| double * | head | ||
| ) |
| int mlib::llq | ( | const char * | buf, |
| double * | time, | ||
| double * | x, | ||
| double * | y, | ||
| int * | mode, | ||
| int * | sat, | ||
| double * | dop, | ||
| double * | height | ||
| ) |
Leica LLQ sentence.
$GPLLQ,hhmmss.ss,mmddyy,eeeeee.eee,M,nnnnnn.nnn,M,g,ss,q.q,z.z,M*hh
| bool mlib::nmea_checksum | ( | const char * | buf | ) |
| int mlib::pashr | ( | const char * | buf, |
| double * | time, | ||
| double * | hdg, | ||
| double * | pitch, | ||
| double * | roll, | ||
| double * | heave, | ||
| double * | roll_std, | ||
| double * | pitch_std, | ||
| double * | hdg_std, | ||
| int * | flag_h, | ||
| int * | flag_i | ||
| ) |
$PASHR,UTC-Time,HeadingTRUE,T,ROLL,PITCH,HEAVE(m),accuracyRoll, accuracyPitch,accuracyHeading
Newer Ashtech proprietary sentence for attitude sensors. Also used by Applanix POS M/V systems.
$PASHR,145719.272,252.41,T,1.22,0.48,0.01,0.090,0.090,0.116,2,1*11 $PASHR,141424.923,45.36,T,-0.57,-0.63,0.02,0.086,0.086,0.025,1,1*28
$PASHR,hhmmss.ss,HHH.HH,T,RRR.RR,PPP.PP,heave,rr.rrr,pp.ppp,hh.hhh,QF*CC<CR><LF> where: hhmmss.ss UTC time HHH.HH Heading value in decimal degrees T True heading (T displayed if heading is relative to true north) RRR.RR Roll in decimal degrees (- sign will be displayed when applicable) PPP.PP Pitch in decimal degrees (- sign will be displayed when applicable) heave Heave, in meters rr.rrr Roll standard deviation in decimal degrees pp.ppp Pitch standard deviation in decimal degrees hh.hhh Heading standard deviation in decimal degrees QF Quality Flag 0 = No position 1 = All non-RTK fixed integer positions 2 = RTK fixed integer position
| int mlib::psathpr | ( | const char * | buf, |
| double * | time, | ||
| double * | head, | ||
| double * | pitch, | ||
| double * | roll, | ||
| char * | type | ||
| ) |
$PSAT,HPR,time,heading,pitch,roll,type
type:
| int mlib::ptnlggk | ( | const char * | buf, |
| double * | lat, | ||
| double * | lon, | ||
| double * | time, | ||
| double * | height, | ||
| double * | dop, | ||
| int * | sat, | ||
| int * | mode | ||
| ) |
$PTNL,GGK,hhmmss.ss,mmddyy,llll.ll,a,yyyyy.yy,a,xx,xx,x.x,EHTxx.x,M*hh - hhmmss.ss = UTC of Position Fix - mmddyy = UTC date - llll.ll = Latitude - a = Hemisphere (N/S) - yyyyy.yy = Longitude - a = E/W - xx = GPS Quality Indicator - 0: Fix not available or invalid - 1: Autonomous GPS fix - 2: RTK float solution - 3: RTK fix solution - 4: Differential, code phase only solution (DGPS) - 5: SBAS solution (WAAS/EGNOS/MSAS) - 6: RTK float or RTK location 3D Network solution - 7: RTK fixed 3D Network solution - 8: RTK float or RTK location 2D in a Network solution - 9: RTK fixed 2D Network solution - 10: OmniSTAR HP/XP solution - 11: OmniSTAR VBS solution - 12: Location RTK solution - 13: Beacon DGPS - xx = Number of Satellites in use - x.x = PDOP - xx.x = Ellipsoidal height. = Altitude above/below mean sea level for position of marker. Note, if no orthometric height is available the local ell. height will be exported. - M = Units of altitude meters (fixed text "M") - hh = Checksum $PTNL,GGK,172814.00,071296,3723.46587704,N,12202.26957864,W,3,06,1.7,EHT-6.777,M*48
| int mlib::ptnlqa | ( | const char * | buf, |
| double * | sigman, | ||
| double * | sigmae, | ||
| double * | smaj, | ||
| double * | smin, | ||
| double * | orient | ||
| ) |
| int mlib::rmc | ( | const char * | buf, |
| double * | lat, | ||
| double * | lon, | ||
| double * | time, | ||
| double * | speed, | ||
| double * | head, | ||
| int * | date, | ||
| int * | mode | ||
| ) |
$ttRMC,time,stat,lat,N/S,lon,E/W,speed,head,date,magvar,E/W,mode
| char * mlib::parse_context::token | ( | ) |
Tokens are delimited by ',', <CR>, '*' or end of string. We cannot use strtok directly because we want to leave the string unchanged and we don't want to skip over consecutive empty fields.
| int mlib::ttm | ( | const char * | buf, |
| double * | utc, | ||
| int * | num, | ||
| char * | name, | ||
| double * | dist, | ||
| double * | brg, | ||
| int * | relbrg, | ||
| double * | speed, | ||
| double * | cog, | ||
| int * | relcog, | ||
| double * | cpa, | ||
| double * | tcpa, | ||
| int * | stat | ||
| ) |
$xxTTM,num,dist,brg,relbrg,speed,course,relcog,cpa,tcpa,units,name,status,ref,hhmmss.ss,acq*hh
| int mlib::vtg | ( | const char * | buf, |
| double * | speed, | ||
| double * | head | ||
| ) |
$ttVTG,true,T,mag,M,knots,N,kph,K,mode
True heading takes precedence over magnetic heading. Speed value in knots takes precedence over value in km/h.
| int mlib::zda | ( | const char * | buf, |
| double * | time, | ||
| unsigned short * | day, | ||
| unsigned short * | month, | ||
| unsigned short * | year | ||
| ) |
$ttZDA,time,day,month,year,loch,locm
UTC = local +loch + locm/60


During High School, after completing the ECDL course and after passing all the exams, I achieved the European Computer Driving License. It is a worldwide-recognized computer literacy certification program that according to the definition given to the main website, it provides students with the IT skills and abilities needed to build on existing knowledge, motivate further learning, and improve their employability in a wide range of fields and industries.
The modules I took are:
My Skills Card is available HERE


CoNLL-U Format in UD v2
Some of the changes adopted in v2 require modifications to the CoNLL-U format. Whenever possible, we have tried to do this in the least disruptive fashion possible, keeping backward compatibility as far as we can. In particular, we have decided against changing the number of fields and/or their meaning for fear of breaking people’s tools. We make the following changes for v2:
- Allow spaces in the
FORM
andLEMMA
fields (see word segmentation) - Let the
DEPS
field contain the entire enhanced dependency graph (not only additional relations on top of the basic trees) (see enhanced dependencies) - Allow empty nodes with an indexing scheme distinct from both tokens and words and with relations in the
DEPS
field (see ellipsis) - Standardize sentence-level metadata
- Restrict the use of the
MISC
field for ease of processing
Enhanced representation in the DEPS field
The deps
field holds the enhanced representation. Unlike previously thought, it seems a better idea for the DEPS
field to hold the entire enhanced parsed graph, not only a smaller set of relations on top of the base layer in HEAD+DEPREL
. The primary reason is that minimally the ellipsis relations and in future undoubtedly many others are not a part of the enhanced graph but are rather replaced by some relations in it. See enhanced dependencies.
Empty nodes in the enhanced representation
A mechanism is needed for empty nodes in the enhanced representation (the base representation will always be empty-node-free). These will be on their separate lines indexed as 2.1
which means “the first empty node after the syntactic word indexed 2”. This line would be placed right after the word 2. Naturally, these empty nodes can be
referred to only from the DEPS
field.
 No particular requirements are put on these fields other than “no trailing whitespace”. Several recognized key = value pairs should be standardized:
- sent_id = global_sentence_id
- text = sentence text
sent_id
is compulsory and as per #321 it should not contain the /
(slash) character.
MISC field
The only global requirement on the MISC
field is that it can be split on the |
(bar) character without any complex processing of escaping. The requirement of MISC
containing zero whitespace characters is dropped. Of course no TAB characters are allowed and no trailing whitespace is allowed. It is likely that spacesBefore
and spacesAfter
will be standardized as a part of the MISC
field.


Last updated: 2019-06-04
Checks: 7 0
Knit directory: daarem/analysis/
This reproducible R Markdown analysis was created with workflowr (version <IP_ADDRESS>00). The Checks tab describes the reproducibility checks that were applied when the results were created. The Past versions tab lists the development history.
Great! Since the R Markdown file has been committed to the Git repository, you know the exact version of the code that produced these results.
Great job! The global environment was empty. Objects defined in the global environment can affect the analysis in your R Markdown file in unknown ways. For reproduciblity it’s best to always run the code in an empty environment.
The command set.seed(1)
was run prior to running the code in the R Markdown file. Setting a seed ensures that any results that rely on randomness, e.g. subsampling or permutations, are reproducible.
Great job! Recording the operating system, R version, and package versions is critical for reproducibility.
Nice! There were no cached chunks for this analysis, so you can be confident that you successfully produced the results during this run.
Great job! Using relative paths to the files within your workflowr project makes it easier to run your code on other machines.
Great! You are using Git for version control. Tracking code development and connecting the code version to the results is critical for reproducibility. The version displayed above was the version of the Git repository at the time these results were generated.
Note that you need to be careful to ensure that all relevant files for the analysis have been committed to Git prior to generating the results (you can use wflow_publish
or wflow_git_commit
). workflowr only checks the R Markdown file, but you know if there are other scripts or data files that it depends on. Below is the status of the Git repository when the results were generated:
Untracked files:
Untracked: analysis/mixem.R
Untracked: analysis/temp.R
Untracked: analysis/temp.R~
Note that any generated files, e.g. HTML, png, CSS, etc., are not included in this status report because it is ok for generated content to have uncommitted changes.
These are the previous versions of the R Markdown and HTML files. If you’ve configured a remote Git repository (see ?wflow_git_remote
), click on the hyperlinks in the table below to view them.
| File | Version | Author | Date | Message |
|---|---|---|---|---|
| Rmd | 3d5bcee | Peter Carbonetto | 2019-06-04 | wflow_publish(“mixem.Rmd”) |
| html | 615197f | Peter Carbonetto | 2019-06-04 | A few more small improvements to the “mixem” analysis. |
| Rmd | a79dd49 | Peter Carbonetto | 2019-06-04 | wflow_publish(“mixem.Rmd”) |
| html | 52e323d | Peter Carbonetto | 2019-06-04 | Made some revisions to the mixem analysis. |
| Rmd | 4743aea | Peter Carbonetto | 2019-06-04 | wflow_publish(“mixem.Rmd”) |
| html | 936cdbb | Peter Carbonetto | 2019-06-04 | Built initial draft of “mixem” analysis. |
| Rmd | 7048a42 | Peter Carbonetto | 2019-06-04 | wflow_publish(“mixem.Rmd”) |
| Rmd | 1636e77 | Peter Carbonetto | 2019-06-04 | wflow_publish(“index.Rmd”) |
Here we illustrate the use of DAAREM to accelerate a very simple EM algorithm—the E and M steps are implemented in three lines of R code—for computing maximum-likelihood estimates of mixture proportions in a mixture model.
Load some packages and function definitions used in the example below.
library(ggplot2)
library(cowplot)
library(daarem)
source("../code/misc.R")
source("../code/mixem.R")
Load the 100,000 x 100 conditional likelihood matrix computed from a simulated data set.
load("../data/mixdata.RData")
n <- nrow(L)
m <- ncol(L)
cat(sprintf("Loaded %d x %d data matrix.\n",n,m))
# Loaded 100000 x 10 data matrix.
Set the initial estimate of the mixture proportions.
x0 <- rep(1/m,m)
Compute maximum-likelihood estimates of the mixture proportions by running 200 iterations of the standard EM updates. Note that the E and M steps are very simple, and easy to implement in R; in particular, in function mixem.update
, the E step is implemented in 2 lines of R code, and the M step requires only one more line of code.
out <- system.time(fit1 <- mixem(L,x0,numiter = 200))
f1 <- mixobjective(L,fit1$x)
cat(sprintf("Computation took %0.2f seconds.\n",out["elapsed"]))
cat(sprintf("Log-likelihood at EM estimate is %0.12f.\n",f1))
# Computation took 9.38 seconds.
# Log-likelihood at EM estimate is -59912.068371303445.
Re-run the EM updates, this time using DAAREM to accelerate convergence toward the solution.
out <- system.time(fit2 <- mixdaarem(L,x0,numiter = 200))
f2 <- mixobjective(L,fit2$x)
cat(sprintf("Computation took %0.2f seconds.\n",out["elapsed"]))
cat(sprintf("Objective value at DAAREM estimate is %0.12f.\n",f2))
# Computation took 7.03 seconds.
# Objective value at DAAREM estimate is -59895.960056733769.
Observe that the this second estimate has a much higher likelihood.
This plot shows the improvement in the solution over time for the two co-ordinate ascent algorithms: the vertical axis (“distance to best solution”) shows the difference between the largest log-likelihood obtained, and the log-likelihood at the “gold-standard” solution. The gold-standard solution was computed using mixsqp.
f <- mixobjective(L,x)
pdat <-
rbind(data.frame(iter = 1:200,dist = f - fit1$value,method = "EM"),
data.frame(iter = 1:200,dist = f - fit2$value,method = "DAAREM"))
p <- ggplot(pdat,aes(x = iter,y = dist,col = method)) +
geom_line(size = 1) +
scale_y_continuous(trans = "log10",breaks = 10^seq(-4,4)) +
scale_color_manual(values = c("darkorange","dodgerblue")) +
labs(x = "iteration",y = "distance from solution")
print(p)
From this plot, we see that the accelerated EM method gets much closer to the solution, although it seems to “plateau” after about 100 iterations. Nonetheless, it is much improved over the basic EM algorithm.
sessionInfo()
# R version 3.4.3 (2017-11-30)
# Platform: x86_64-apple-darwin15.6.0 (64-bit)
# Running under: macOS High Sierra 10.13.6
#
# Matrix products: default
# BLAS: /Library/Frameworks/R.framework/Versions/3.4/Resources/lib/libRblas.0.dylib
# LAPACK: /Library/Frameworks/R.framework/Versions/3.4/Resources/lib/libRlapack.dylib
#
# locale:
# [1] en_US.UTF-8/en_US.UTF-8/en_US.UTF-8/C/en_US.UTF-8/en_US.UTF-8
#
# attached base packages:
# [1] stats graphics grDevices utils datasets methods base
#
# other attached packages:
# [1] daarem_0.3 cowplot_0.9.4 ggplot2_3.1.0
#
# loaded via a namespace (and not attached):
# [1] Rcpp_1.0.1 knitr_1.20 whisker_0.3-2
# [4] magrittr_1.5 workflowr_<IP_ADDRESS>00 tidyselect_0.2.5
# [7] munsell_0.4.3 colorspace_1.4-0 R6_2.2.2
# [10] rlang_0.3.1 dplyr_<IP_ADDRESS> stringr_1.3.1
# [13] plyr_1.8.4 tools_3.4.3 grid_3.4.3
# [16] gtable_0.2.0 withr_2.1.2 git2r_<IP_ADDRESS>08
# [19] htmltools_0.3.6 assertthat_0.2.0 yaml_2.2.0
# [22] lazyeval_0.2.1 rprojroot_1.3-2 digest_0.6.17
# [25] tibble_2.1.1 crayon_1.3.4 purrr_0.2.5
# [28] fs_1.2.6 glue_1.3.0 evaluate_0.11
# [31] rmarkdown_1.10 labeling_0.3 stringi_1.2.4
# [34] pillar_1.3.1 compiler_3.4.3 scales_0.5.0
# [37] backports_1.1.2 pkgconfig_2.0.2


Porfolio
Gallary
Contact
HAVE A QUESTION?
JUST WANT TO SAY HI?
Phone
(226)503-9404
Email
<EMAIL_ADDRESS>First Name
Last Name
Gender
Male
Female
Email
Your Message
Submit


--- layout: post date: 2010-09-23 time: "09:00:00" authors: ["Greg Wilson"] title: Software Carpentry at UCSF tags: ["University of California - San Francisco"] ---
Via a comment from Scooter Morris: the University of California San Francisco is offering a "short course" variant of Software Carpentry under the course codes BMI-280/BMI-219. Their slides are online in S5 format, and include lots of useful stuff that aren't in the stock version. If you know of other offerings, please send pointers!


{{ define "main" }}
Education: B. Tech. 3rd Year - Computer Science and Engineering
University: PES University
Interests: Mathematics, Programming
Programming Languages: Python, C, Java, Javascript
Frontend Frameworks: Bootstrap, Material CSS, Vue JS
Web Development Frameworks: Django, Flask, Springboot
ML and NLP Frameworks: Numpy, NLTK, Tensorflow, TensorflowJS
Operating System: Linux (Ubuntu)
Miscellaneous: Git, Docker
Google Summer of Code 2019 with Wikimedia Foundation


Online Verification Report of Student Record
Chinese(GB)
English
Name
LYU YIPING
Sex
Male
ID No.
370829199008020382
Ethnic Background
*
Date of Birth
November 09,1964
Higher Education Institution
Peking University
Education Level
non-degree
Major
Computer Information
Forms of Learning
evening university
Start Date
September 01,1999
Length of Program
* Year
Type of Education
Regular Higher Education
Graduation Date
*
Online Verification Code:
9319 9778 9038
Date of Report
Oct. 29, 2013
Date of Expiry
Jun. 15, 2019
The above mentioned information is verified authentic.
Certificate
Certificate
pc


Magister Talia:
Serve Gran Kain and through him we will end this reign of oppression and usher in a new and glorious age.
Brothers and sisters! When that day comes, those who betrayed us will face judgment from which they cannot hide, and our sorrow will be changed to everlasting joy!
Learn skills.
Ask about Skill Transfer.
Ask about Skill Enchanting.
Quest


Who am I?
Aliquam ut ex ut augue consectetur interdum. Donec hendrerit imperdiet. Mauris eleifend fringilla
nullam aenean mi ligula...
I am an avid coder and reader. I love to paint, and I also love to find ways
in which the world can be benefited. I also love to write blogs.
Aliquam ut ex ut augue consectetur interdum. Donec hendrerit imperdiet. Mauris eleifend fringilla
nullam aenean mi ligula...
Aliquam ut ex ut augue consectetur interdum. Donec hendrerit imperdiet. Mauris eleifend fringilla
nullam aenean mi ligula...
Aliquam ut ex ut augue consectetur interdum. Donec hendrerit imperdiet. Mauris eleifend fringilla
nullam aenean mi ligula...
Here are special accounts of my hobbies.
(This web page is currently under development so expect to find placeholder text.)
Some things I like to make are paper airplanes, origami, and paintings.
I have instaled Linux on my old Laptop, and am currently developing an app for Linux Desktop Using Electron.
Coding is one thing I am good at, and also one that I aspire to learn completely (this page has been coded only in HTML, CSS, and JavaScript.)
I like listening to Classical Music, such as that by Bach and Beethoven.
Psst, easy method to do the same: Use Ecosia, the Search Engine that plants trees. Here's a
link:
Ecosia
Augue consectetur sed interdum imperdiet et ipsum. Mauris lorem tincidunt nullam amet leo Aenean ligula consequat consequat.


{% comment %}
This page is included by the master.html page. It specifies the stylesheets in use.
This file is modified during the deploy cycle to instead include minified verisons of the stylesheets.
{% endcomment %}
{% load static %}
{% load iportalen_tags %}
{% is_debug as in_debug %}
{% if in_debug %}
{% else %}
{% endif %}


Preparation time
less than 30 mins
Cooking time
1 to 2 hours
Serves
Serves 8-12
Dietary
Apple crumble and cheesecake are combined to make the ultimate dessert.
Preheat the oven to 180C/350F/Gas 4.
For the crumble topping, tip the flour, sugar and cinnamon into a bowl. Rub in the butter with your fingertips until the mixture resembles breadcrumbs. Stir in the milk and set aside.
For the biscuit base, mix the melted butter and crushed biscuits together in a bowl, then press the mixture into the base of 23cm/9in springform tin. Leave to chill in the fridge for 30 minutes.
For the filling, cook the apple slices in a pan of boiling water for 1-2 minutes, or until just tender but still holding their shape. Drain and cool.
Beat the mascarpone and cream cheese in a large bowl until smooth. Beat in the sugar, vanilla seeds and soured cream and beat until smooth. Beat in the eggs, one at a time, until well combined.
Spoon half of the filling onto the chilled biscuit base. Top with the apple slices and sultanas (if using) and sprinkle over the spices, then spoon over the remaining mixture.
Bake for 30 minutes, then open the oven door, pull the cheesecake out a little bit and sprinkle the crumble topping over the top. Shut the door and bake for a further 40-45 minutes, or until the cheesecake is mostly set with a slight wobble in the middle.
Turn off the oven and leave the cheesecake in the oven for two hours, then remove from the oven and set aside to cool completely.


lol i practid a lot.
so here it goes:
Buy awesome stuff at:
WELCOME TO THE INTERNET!!!!
WELCOME to My hoempage!!!!
THIS IS MY HOMEPAGE!!! ITS THE BEST PAGE!!!!
THIS IS THE BEST WEBSITE IN THE UNIVERSE!!!!
THANSK 4 STOPPING BYE TO VISIT!!!!
!!!!THX THX THX THX THX THX!!!!
!!!!THX THX THX THX THX THX!!!!
!!!!THX THX THX THX THX THX!!!!
THIS IS ALSO MY HOMEPAGE!!!!
!!!!WELCOME TO MY I MADE FOR ISYS 202 PROJECT!!!!(hope you like)
I LIKE GUNZ DO YOU?!? FILL OUT MY GUN FORM!:
(ps. im still learning how to do forms)
profile:
this is me (jk its not but i dont wanna put a real pix on the web)
my name is chris ;)
I found this questionair instead of writting a boring profile LOL!
1. What is your favorite food?
2. What was your happiest moment when you were a child?
3. Where is the place that you want to go the most?
4. When is your birthday?
5.
6. What are you afraid to lose the most?
7. If you win $1 million, what would you do?
8.
9. Which actor/actress would you like to play you in a movie?
10. How do you cope with boredom?
11. Till now, what is the moment that you regret the most?
12. What type of person do you hate the most?
13. What is your ambition?
14. If you had one wish, what would you wish for?
15. How did you celebrate New Year?
16. What has been the craziest thing you’ve ever done in your whole life?
17. Do you still remember your first love?
18. What do you look forward for this year(2004)?
19. What is your inspiration in life?
20. My Q : What do you love MOST about being special?
/font>
this section fulfills requirement 4a, its the part where i put what im interested in k!
THIS CAR DRIVES... .. NOT!!
BEEP BOP BEEOP BOP BOP BEEP BEOP BOP BOP BOOOP!!!!
WATCH MY CAT CARL AND HIS FRIEND GARY DANCE!!!!
JK!! JK!! LOL!! LOLZ!!
this is just for funny
HERE I PUT (at least 3 of) MY FAVORITE MOVIES AND TV SHOWS! [requirement 4b]
HAHAHA I LOVE ALF LOL LOL!
no but seriously he was funny! LOLZ!
IM A BIG FULL HOUSE FAN. FOR SURE THURSDAY NIGHTS WITH MY CAT CARL WE WATCH AT LEAST 1 EPISODE. ITS GREAT!!!
WHEN I WAS YOUNGER (NOT!) I USED TO WATCH THIS SHOW./
 MY SKILLz AT PROGRAMMING CODE!?!! [requiremnt 6a]
now for the NEXT PART!
FINALLY THE END!!!
THis is the part where i talk about my favorite person. It's all about my hero and someone who i admire. this is the last requirement for our website project
NOW IM AN OFFICAL WEBSTIE DESIGNER!!!
MY HERO IS:
KTHNX BYE!!!
[roy and conrad]
CLICK THE FLOATING MAIL BOX TO EMAIL A SPECIAL MESSAGE TO A FRIEND!!! ITS FUN!!!
PS PS PS PS PS PS PS PS PS (e.g. means post script, just like i want to say more haha l.o.l.!!!
TO MY FRIEND...YOU MAY KNOW HIM....TOM CRUISE!!!!
ANYWAY!!. He IS A WIZZARD!!! CAN YOU BELIEVE THAT?!?.! i didnt, but then i did when he said it, i thought, well its TC! and TC is never wrong. ever!.
SO i was like. hey TC!
and he was like:
and i was all, i made a website for my isys project and i got lots and lots of people to look at it and they think i am a good designer now.
IM GONNA MAKE BIG BUCKS!!!!!!
AND THEN TC WAS LIKE .. "PEOPLE TO SUPPPORT YOU TO MAKE BIG BUCKS AS A BIG INTERNET-WEB MAN!!
 NOW WE CAN CHAT!
<EMAIL_ADDRESS>p.s. tom cruise isnt actually a wizzard. but dont tell him, he likes it that way. ;(


CloudStack NYC
Networking Overview
Current as of Apache CloudStack 4.4/Citrix CloudPlatform 4.5
Introductions
Thanks to BWG Strategy and ShapeBlue
CloudStack Zone Types
- Basic
- Advanced
- Security Groups
- Isolated
- VPC
Basic
- Flat Network
- Single VLAN
- Consecutive IP blocks
- Security and Isolation handled by Security Groups
- Security Groups supported on:
- KVM
- XenServer
- LXC
- Bare Metal
- Compare to AWS Classic
Basic Zone
Advanced
Security Groups
- Only supported on KVM
- Like Basic but allows VLAN Isolation between Guest, Management, and Storage Traffic
Advanced
Isolated
- VLAN isolation between Networks and Domains
- Requires Advanced Networking
- Hypervisor Support:
- KVM
- XenServer
- VMware vSphere
- LXC
- Hyper-V
- Bare metal
- Requires 802.1Q capable hardware (switch/router/firewall)
Advanced
Isolated
- A single VM can live in one or more network(s)
- Each Isolated Network is a VLAN (even within a Domain)
- Cross-Network traffic can be routed via a VM in both networks or VPN.
Advanced
VPC
- VLAN isolation between VPCs and Domains
- Requires Advanced Networking
- Hypervisor Support:
- KVM
- XenServer
- VMware vSphere
- LXC
- Hyper-V
- Requires 802.1Q capable hardware (switch/router/firewall)
Advanced
VPC
- Domain VPC defines a SuperNet and Networks are created as Subnets of this SuperNet.
- A single VM can live in only one tier (Subnet)
- (But it can live in a VPC tier and an isolated network)
Network Service Offerings
- Means of defining what Network Services you want to offer to your Domains
- Defaults provide most services for a given Network Type
- New offerings can be created to tie into other Network Devices:
- Netscaler
- Nicera NVP
- Brocade
- BigSwitch VNS
- F5
- OpenDaylight (Experimental)
- Cisco VNMC
- Midonet
- Nuage VSP
- Juniper SRX
- Palo Alto
- ...and so many more...
Advanced Zone
Virtual Router
- One per-CIDR block for Basic and Advanced with Security Groups
- One per-network for Advanced Isolated
- One per-VPC for Advanced VPC
- Provides:
- Routing
- Firewalling
- NAT
- Load Balancing
- VPN
- Road-Warrior for Advanced Isolated
- Site-to-Site for Advanced VPC
- DHCP
- DNS
- PXE (for BareMetal)
Networking Concerns
- IP Addresses/VLANs
- Must hold at least 3 IP addresses for System VMs (more for Advanced)
- Public Space
- IP addresses for "Public" IPs
- "Public" IPs are held by Router VMs on their "outside" interface
- Guest Space
- VLAN range used by Guest Networks in an Advanced Isolated/VPC Zone
- Default CIDR block can be set in Zone creation
- ...but Default CIDR block can be overridden
- Management Space
- VLAN/IP space used to manage Hypervisors
- Also used for "link-local" (System VM) management on VMware
- Storage Space
- Used for communication from Hypervisor to Primary and Secondary Storage
Wrap-Up
Network Diagram Icons (c) Node-Nine
(ciscomentor.com)
Thank you BWG Strategy and ShapeBlue


ARIA Switches
What do you want to be when you grow up?
- Standard IMG tag as a toggle:
- INPUT with type="image" as a toggle:
- DIV tag with a background image as a toggle:
-
A Goat!
The ARIA Switch controls are keyboard accessible:
- Press the Tab key to navigate between the ARIA Switches.
- Press the Spacebar to toggle the state of the selected Switch.
- Mouse users can click a Switch to toggle the state as usual.


Connects a ToolTip to a target Maintains that connection even if the target moves
More...
Connects a ToolTip to a target Maintains that connection even if the target moves
◆ GetDirectionFromPivotDirection()
| static Vector3 Microsoft.MixedReality.Toolkit.UI.ToolTipConnector.GetDirectionFromPivotDirection |
( |
ConnectorPivotDirection |
pivotDirection, |
|
|
Vector3 |
manualPivotDirection, |
|
|
Transform |
relativeTo |
|
) |
| |
|
static |
Computes the director of the connector
- Parameters
-
| pivotDirection | enum describing director of connector pivot |
| manualPivotDirection | is the pivot set manually |
| relativeTo | Transform that describes the frame of reference of the pivot |
- Returns
- a vector describing the pivot direction in world space
◆ ConnectorFollowingType
The follow style of the tooltip connector
◆ ManualPivotDirection
| Vector3 Microsoft.MixedReality.Toolkit.UI.ToolTipConnector.ManualPivotDirection |
|
getset |
The direction of the manual pivot.
◆ ManualPivotLocalPosition
| Vector3 Microsoft.MixedReality.Toolkit.UI.ToolTipConnector.ManualPivotLocalPosition |
|
getset |
getter/setter for local pivot position
◆ PivotDirection
The direction of the connector
◆ PivotDirectionOrient
Orientation style for connector
◆ PivotDistance
| float Microsoft.MixedReality.Toolkit.UI.ToolTipConnector.PivotDistance |
|
getset |
Set Distance from object that Tooltip pivots around.
◆ PivotMode
Is the connector pivot set manually or automatically?
◆ Target
| GameObject Microsoft.MixedReality.Toolkit.UI.ToolTipConnector.Target |
|
getset |
The GameObject to which the tooltip is connected
The documentation for this class was generated from the following file:
- C:/Users/Thomas Peters/UnityProjects/MoveToCode/Assets/MRTK/SDK/Features/UX/Scripts/Tooltips/ToolTipConnector.cs


org.apache.qpid.proton.amqp.messaging
Interfaces
LifetimePolicy
Outcome
Section
Classes
Accepted
AmqpSequence
AmqpValue
ApplicationProperties
Data
DeleteOnClose
DeleteOnNoLinks
DeleteOnNoLinksOrMessages
DeleteOnNoMessages
DeliveryAnnotations
Footer
Header
MessageAnnotations
Modified
Properties
Received
Rejected
Released
Source
Target
Terminus
Enums
Section.SectionType
TerminusDurability
TerminusExpiryPolicy


Welcome {{ this.userService.loggedInUser.firstName }} {{ this.userService.loggedInUser.lastName }}!
Create/import and sell tires.
View stock and sell tires.
View recycled tires and recycle new ones.
Manage your account information.


{% load humanize %} {% load trend %}
{{ confirmed_trend | floatformat:"0" }}% Since last week
{{ recovered_trend | floatformat:"0" }}% Since last week
{{ deaths_trend | floatformat:"0" }}% Since last week
{{ death_rate_trend }} Since last week


---
layout: slides
title: "How to remember, how to forget, part II"
category: hidden
type: course
semester: Fall 2018
college: Wellesley College
permalink: /cognition/memory-part-2/
---
# How to remember, and how to forget, part II.
???
---
class: center, middle, statement, dark
< recap >
---
class: center, middle, statement, dark
The mind faces many maddeningly hard engineering problems, and we have an arsenal of mental faculties for solving each of them approximately.
---
class: center, middle, statement, dark
We have representations of space, quantity, value, the future, and the past.
---
class: center, middle, statement, dark
We can also represent time.
---
class: center, middle, statement, dark
Perception is bounded temporally, with events that are too quick or too slow. We create technologies to perceive temporal scales beyond these bounds (e.g., Muybridge's photos of a galloping horse).
---
class: center, middle, statement, dark
We represent the past, the present, and the future.
---
class: center, middle, statement, dark
The present moment is a physical reality, but the present as an extended interval is a psychological construction (the "specious present").
---
class: center, middle, statement, dark
"Living systems contain self-sustaining biochemical and biophysical oscillations,
whose periods range from fractions of a second to a year and perhaps
more" — Gallistel
---
class: center, middle, statement, dark
We have a circadian rhythm (e.g., that guy in a cave).
---
class: center, middle, statement, dark
We have neural oscillations at a range of frequencies.
---
class: center, middle, statement, dark
And disorders, such as Parkinson's, seem to affect the timescale of experience and action.
---
class: center, middle, statement, dark
We can also represent cause and effect.
---
class: center, middle, statement, dark
Causation does not equal correlation, but even so, from correlations we can infer causality.
---
class: center, middle, statement, dark
Michotte's studies of launching events were some of the early experiments on the perception of causality. Manipulating the timing and other factors affect perception of causality.
---
class: center, middle, statement, dark
From Heider & Simmel's movies of correlated movements of shape, we infer a whole world of causal factors, such as chasing and hiding.
---
class: center, middle, statement, dark
Causal graphical models (Bayes nets) are a useful tool for representing the causal structure of probabilistic events. They are made up of nodes that represent events or properties, directed edges that represent causation, and (conditional) probability tables that attach to nodes.
---
class: center, middle, statement, dark
One can draw a casual model that reflects our best understanding of causality, or instead one that reflects a person's incorrect theory about how a particular causal system works.
---
class: center, middle, statement, dark
Occam's razor is the idea that simpler explanations are better explanations. But what is "simpler"? Fewer root causes? Fewer nodes in the casual graphical model? It's up for debate.
---
class: center, middle, statement, dark
Networks aren't useful only for representing causality through Bayes nets.
---
class: center, middle, statement, dark
We can use networks to represent the structure of our knowledge.
---
class: center, middle, statement, dark
We can use networks to describe social ties.
---
class: center, middle, statement, dark
We can use networks to learn.
---
class: center, middle, statement, dark
Networks are made up of {nodes, vertices, entities} and {edges, links}, and can be directed or undirected, weighted or unweighted.
---
class: center, middle, statement, dark
We can also represent other people, their thoughts, their thoughts about our thoughts, &c.
---
class: center, middle, statement, dark
Theory of mind is the spark of social cognition, as seen in the Sally-Anne task.
---
class: center, middle, statement, dark
There is a debate as to whether theory of mind is best thought of as an intuitive theory ("Theory theory") or rather is the result of simulating what others would think using your own mind ("Simulation theory").
---
class: center, middle, statement, dark
Many social scenarios benefit from social reasoning and their essences are captured in economic games.
---
class: center, middle, statement, dark
Consider Keynesian beauty contests.
---
class: center, middle, statement, dark
Schelling coordination games and focal points ("Schelling points").
---
class: center, middle, statement, dark
And the El Farol Problem / minority game.
---
class: center, middle, statement, dark
But social reasoning has its limits — it is bounded.
---
class: center, middle, statement, dark
One such limit is a recursion limit, how many nested layers of thinking about think we can do.
---
class: center, middle, statement, dark
Vision is a process of inference. (Computational level.)
---
class: center, middle, statement, dark
e.g., modal and amodal completion.
---
class: center, middle, statement, dark
e.g., bistable and multistable images.
---
class: center, middle, statement, dark
What makes an object an object? Spelke says: cohesion, boundedness, rigidity, and no action at a distance. (Representational level.)
---
class: center, middle, statement, dark
Each of these principles is revealed through habituation experiments with infants.
---
class: center, middle, statement, dark
Two major organizing principles of the visual system are retinotopy (think of gunshot wounds producing dark spots) and hierarchy (think of multiple subsytems arranged in a network). (Implementation level.)
---
class: center, middle, statement, dark
recap >
---
# Administrivia
- Attendance sheet
- Questions about the exam, index cards
---
# Memory, part II.
- Bartlett's transmission chains
- The DRM paradigm
- The misinformation effect
---
# Transmission chains
???
War of the Ghosts
One night two young men from Egulac went down to the river to hunt seals and while they were there it became foggy and calm. Then they heard war-cries, and they thought: "Maybe this is a war-party". They escaped to the shore, and hid behind a log. Now canoes came up, and they heard the noise of paddles, and saw one canoe coming up to them. There were five men in the canoe, and they said:
"What do you think? We wish to take you along. We are going up the river to make war on the people."
One of the young men said,"I have no arrows."
"Arrows are in the canoe," they said.
"I will not go along. I might be killed. My relatives do not know where I have gone. But you," he said, turning to the other, "may go with them."
So one of the young men went, but the other returned home.
And the warriors went on up the river to a town on the other side of Kalama. The people came down to the water and they began to fight, and many were killed. But presently the young man heard one of the warriors say, "Quick, let us go home: that Indian has been hit." Now he thought: "Oh, they are ghosts." He did not feel sick, but they said he had been shot.
So the canoes went back to Egulac and the young man went ashore to his house and made a fire. And he told everybody and said: "Behold I accompanied the ghosts, and we went to fight. Many of our fellows were killed, and many of those who attacked us were killed. They said I was hit, and I did not feel sick."
 When the sun rose he fell down.  His face became contorted. The people jumped up and cried.
He was dead.
---
# The misinformation effect
---
# DRM paradigm
"Deese-Roediger-McDermott"
- Free recall
- Random vs. semantically related
- Intrusions, false memories
- Assignment 8.
---
class: center, middle
# Fin.


Dr. Michael Jackson
Michael Joseph Jackson (August 29, 1958 – June 25, 2009) was an American singer, songwriter, and dancer. Dubbed the "King of Pop", he is regarded as one of the most significant cultural figures of the 20th century. Over a four-decade career, his contributions to music, dance and fashion, along with his publicized personal life, made him a global figure in popular culture. Jackson influenced artists across a variety of musical styles, and through visual presentation. He popularized complicated dance moves such as the moonwalk, to which he gave the name, and the robot. Jackson is the most awarded music artist in history.
Here's a time line of Dr. Borlaug's life:
- - Jackson is one of the best-selling music artists of all time, with estimated sales of over 400 million records worldwideBorn in Cresco, Iowa
- 1933 - The eighth child of the Jackson family, Jackson made his professional debut in 1964 with his elder brothers Jackie, Tito, Jermaine, and Marlon as a member of the Jackson 5. Jackson began his solo career in 1971 while at Motown Records, and became a solo star with his 1979 album Off the Wall. His music videos, including those for "Beat It", "Billie Jean", and "Thriller" from his 1982 album Thriller, are credited with breaking racial barriers and transforming the medium into an artform and promotional tool. He helped propel the success of MTV and continued to innovate with videos on the albums Bad (1987), Dangerous (1991), and HIStory: Past, Present and Future, Book I (1995). Thriller became the best-selling album of all time, while Bad was the first album to produce five US Billboard Hot 100 number-one singles with "I Just Can't Stop Loving You", "Bad", "The Way You Make Me Feel", "Man in the Mirror", and "Dirty Diana
- 1935 -From the late 1980s, Jackson became a figure of controversy and speculation due to his changing appearance, relationships, behavior and lifestyle. In 1993, he was accused of sexually abusing the child of a family friend. The lawsuit was settled out of civil court, and Jackson was not indicted due to lack of evidence.  In 2009, while preparing for a series of comeback concerts, This Is It, Jackson died from an overdose of propofol administered by his personal physician, Conrad Murray, who was subsequently convicted of involuntary manslaughter.
- 1937 He had 13 Billboard Hot 100 number-one singles, more than any other male artist in the Hot 100 era, and was the first artist to have a top-ten single in the Billboard Hot 100 in five different decades.
- 1938 - Marries wife of 69 years Margret Gibson. Gets laid off due to budget cuts. Inspired by Elvin Charles Stakman, he returns to school study under Stakman, who teaches him about breeding pest-resistent plants.
- 1941 - Tries to enroll in the military after the Pearl Harbor attack, but is rejected. Instead, the military asked his lab to work on waterproof glue, DDT to control malaria, disinfectants, and other applied science.
- 1942 - Receives a Ph.D. in Genetics and Plant Pathology
- 1944 - Rejects a 100% salary increase from Dupont, leaves behind his pregnant wife, and flies to Mexico to head a new plant pathology program. Over the next 16 years, his team breeds 6,000 different strains of disease resistent wheat - including different varieties for each major climate on Earth.
- 1945 - Discovers a way to grown wheat twice each season, doubling wheat yields
- 1953 - crosses a short, sturdy dwarf breed of wheat with a high-yeidling American breed, creating a strain that responds well to fertilizer. It goes on to provide 95% of Mexico's wheat.
- 1962 - Visits Delhi and brings his high-yielding strains of wheat to the Indian subcontinent in time to help mitigate mass starvation due to a rapidly expanding population
- 1970 - receives the Nobel Peace Prize
- 1983 - helps seven African countries dramatically increase their maize and sorghum yields
- 1984 - becomes a distinguished professor at Texas A&M University
- 2005 - states "we will have to double the world food supply by 2050." Argues that genetically modified crops are the only way we can meet the demand, as we run out of arable land. Says that GM crops are not inherently dangerous because "we've been genetically modifying plants and animals for a long time. Long before we called it science, people were selecting the best breeds."
- 2009 - dies at the age of 95.
"Borlaug's life and achievement are testimony to the far-reaching contribution that one man's towering intellect, persistence and scientific vision can make to human peace and progress."
-- Indian Prime Minister Manmohan Singh


This package provides an easy to use access to the ODS (Online Dienst für Studierende) platform used by the FH Dortmund.
Be awere that this package is an html parser for the provided page, all data is given by the webpage and there is no liability for their accuracy in any way.
Since this is a parser, there might be breaking changes which could completely break the data provided by this package. Please file an GitHub issue if you encounter any problems or wrong data.
This package will cache the polled html page. getMetaInformation
, getGradesSummary
and getGrades
use this cache to parse the provided data. The cache has a client side timeout (default 100 minutes). You can clear this cache with clearCache()
or you could use the useCache
parameter in any of the three get methodes to ignore the cache timeout and request a new version of the html page, this will result in the same behavior as if you would call clearCache
and then the methode. You can set the cacheTimeout
attribute to change the cache timeout (number in milliseconds).
Please see ODSConnection for a detailed API documentation.
const { ODSConnection } = require('ods-api');
(async () => {
const conn = await ODSConnection.login('username', 'password');
if (conn == null)
throw new Error('either username and / or password was wrong or the the ods service was not reachable');
const metaInformation = await conn.getMetaInformation();
const gradesSummy = await conn.getGradesSummary();
const grades = await conn.getGrades();
require('fs').writeFileSync(metaInformation.matriculationNumber + '.json', JSON.stringify({ metaInformation, gradesSummy, grades }, undefined, 4));
})()
.catch(console.error);
const { ODSConnection } = require('ods-api');
ODSConnection.login('username', 'password')
.then(conn => {
if (conn == null)
throw new Error('either username and / or password was wrong or the the ods service was not reachable');
else
return Promise.all([
conn.getMetaInformation(),
conn.getGradesSummary(),
conn.getGrades()
]);
})
.then(([metaInformation, gradesSummy, grades]) => {
require('fs').writeFileSync(metaInformation.matriculationNumber + '.json', JSON.stringify({ metaInformation, gradesSummy, grades }, undefined, 4))
})
.catch(console.error);
Generated using TypeDoc


By The Hand Club For Kids™
(formerly known as Kids' Club)Since its beginning in 2001 with 16 children, By The Hand has witnessed tremendous transformation within the lives of our kids—and as an organization. This year we will serve 895 kids and, we hope, 5,000 by the year 2020. As we continue to grow, we’re reaching out to more children in different neighborhoods and introducing ourselves to new supporters across the country.
Our name, By The Hand captures the essence of what distinguishes our after-school program from others. We literally and figuratively take kids by the hand and walk alongside them from the time they enroll in our program until they’re walking independently as well-adjusted, responsible adults. We tutor them to academic excellence. We mentor them to reach their full potential. And we care for them as our own.
Taking kids by the hand
By The Hand is an after-school program with an emphasis on academics and a commitment to nurturing the whole child—mind, body and soul. Founded in Cabrini-Green and located strategically throughout some of Chicago's most impoverished inner-city communities, where overcrowded and underfunded schools abound, By The Hand is filling a special need—and with great success. Kids are saying no to drugs, gang violence and teenage pregnancy. They are rejecting illiteracy and poverty as a way of life. Instead, they are developing into honor roll students and changing the trajectory of their lives. When you partner with By The Hand, you are helping kids realize their full potential. In doing so, you are making a difference for generations to come.
By The Hand Club For Kids™
(formerly known as Kids' Club)Since its beginning in 2001 with 16 children, By The Hand has witnessed tremendous transformation within the lives of our kids—and as an organization. This year we will serve 895 kids and, we hope, 5,000 by the year 2020. As we continue to grow, we’re reaching out to more children in different neighborhoods and introducing ourselves to new supporters across the country.
Our name, By The Hand captures the essence of what distinguishes our after-school program from others. We literally and figuratively take kids by the hand and walk alongside them from the time they enroll in our program until they’re walking independently as well-adjusted, responsible adults. We tutor them to academic excellence. We mentor them to reach their full potential. And we care for them as our own.
Taking kids by the hand
By The Hand is an after-school program with an emphasis on academics and a commitment to nurturing the whole child—mind, body and soul. Founded in Cabrini-Green and located strategically throughout some of Chicago's most impoverished inner-city communities, where overcrowded and underfunded schools abound, By The Hand is filling a special need—and with great success. Kids are saying no to drugs, gang violence and teenage pregnancy. They are rejecting illiteracy and poverty as a way of life. Instead, they are developing into honor roll students and changing the trajectory of their lives. When you partner with By The Hand, you are helping kids realize their full potential. In doing so, you are making a difference for generations to come.


dataSet = vtk.vtkPolyData() for cell in CellIterator(dataSet):
# Do something with the cell
| dataSet: | non-composite vtk dataset, e.g. vtkPolyData or vtkUnstructuredGrid |
|---|
Advance the iterator and return the current cell
polyLine = vtk.vtkPolyLine() for pi in PolyLineIterator(pl):
point = polyLine.GetPoint(pi)
| cell: | Polyline object to iterate over |
|---|
Advance the iterator and return the current point index
Create a vtk cylinder Keyword arguments:
origin (tuple/list/np-array): Origin of the cylinder axis (tuple/list/np-array): Cylinder axis radius (float): Cylinder radius
Cut a surface with a plane, and return an ordered list of points around the circumference of the resulting curve. The cut must result in a closed loop, and if the cut produces multiple sub-curves the closest one is returned.
| dataSet: | (vtkPolyData): surface dataset |
|---|---|
| point: | origin of the cutplane |
| normal: | normal of the cutplane |
| np.array: | List of positions around the cicumference of the cut |
|---|
Render a vtk dataset
| dataSet: | vtkUnstructuredGrid or vtkPolyData |
|---|
| colorBy (str): | constant or scalar |
|---|---|
| color (tuple): | rgb value (if colorBy == constant) |


I am a software developer with with a passion for learning, a strong curiosity to use technology to solve problems, and a desire to collaborate
When not developing, I spend time with my wife and two boys, write and perform music, read books and listen to podcasts, and learn new technologies
More About DanielI specialize in front-to-back, full stack programming in the JavaScript programming language. As a full stack developer, I am able to write, test, and debug programming code for multiple JavaScript frameworks such as React, AngularJS, and jQuery. I use Node and Express for middleware and SQL and MongoDB for the backend. I am involved in various aspects of product development, with a particular interest in customer relations. I have created several applications which utilize the latest technology to solve problems. Prior to delving into software engineering, I was a college Admissions Counselor and Veterans Benefits Coordinator. My inclination for solving problems, along with my military experience and background in higher education, has helped me develop my prowess for anticipating and interpreting what clients need. I graduated from Tennessee Technological University with a B.S. in Secondary Education, completed 12 hours of graduate-level work, and have graduated from Prime Digital Academy with a Full Stack Software Engineering Certificate
Where You Can Find My WorkI look forward to the chance to work with you
Find my contact information below


Google Cloud Datastore key conversion
This old page does not faithfully reflect the string encoding of Cloud Datastore keys by client libraries anymore.
The string encoding should not be used to share keys between different client libraries.
{{/* Probably mostly outdated as of 2019-01
*/}}
{{end}}


A game for two teams, usually of six players, in which a large ball is hit by hand over a high net, the aim being to score points by making the ball reach the ground on the opponent's side of the court.
One foundation of learning starts with the ability to listen well. We lead by example, teaching children to imitate actions and sounds. Slowly, we progress to the concept of following instructions.
Basic sports movements and skills introduced in a developmental age appropriate way. For soccer we teach them how to use their feet instead of their hands, For basketball and volleyball we focus on how to toss and bounce the ball.
Our programs uses fun and engaging practices that are age appropriate and that help children build a long lasting appreciation for playing sports over time.
Basic roles and functions of the proper gameplay, concepts of defending and attacking are introduced through mini games. This allows the child to progressively ease in to team play scenarios.
Competition through Team games of 2v2 and 3v3 are introduced, highlighting the values of sportsmanship and teamwork to go with a higher level of physical ability.


Event test
Test zone
drag me
Events
scroll
wheel
click
dblclick
touchstart
touchmove
touchend
touchcancel
dragstart
drag
dragenter
dragover
dragleave
dragend
drop
pointerdown
pointermove
pointerup
keydown
keypress
keyup
mousedown
mouseup
focus
blur
focusin
focusout
change
Triggered


You can create an indicator object that is not bound to any automatic update and choose which data it should use. In this indicator usage, you create indicator with its constructor where only the indicator characteristics (e.g., period(s), moving average type) is defined. If you want to hook up this indicator with a data subscription for automatic updates, you can do it in two ways:
$[RegisterIndicator(), M:QuantConnect.Algorithm.QCAlgorithm.RegisterIndicator] method registers the data for the specified resolution to receive automatic updates as well as configures the indicator to receive updates from the consolidator.
# request the daily equity data self.AddEquity("SPY", Resolution.Daily) # define a 10-period RSI indicator with indicator constructor self.rsi = RelativeStrengthIndex(10, MovingAverageType.Simple) # register the daily data of "SPY" to automatically update the indicator self.RegisterIndicator("SPY", self.rsi, Resolution.Daily) # initialize the indicator with the previous ten daily bars self.SetWarmUp(10)
// request the daily equity data AddEquity("SPY", Resolution.Daily); // define a 10-period RSI indicator with indicator constructor _rsi = new RelativeStrengthIndex(10, MovingAverageType.Simple); // register the daily data of "SPY" to automatically update the indicator RegisterIndicator("SPY", _rsi, Resolution.Daily); // initialize the indicator with the previous ten daily bars SetWarmUp(10);
Other than the available resolutions, you can also update the indicator with the consolidator. For details about data consolidator, please see Consolidating Data.
# request the equity data in minute resolution self.AddEquity("SPY", Resolution.Minute) # define a 10-period RSI indicator with indicator constructor self.rsi = RelativeStrengthIndex(10, MovingAverageType.Simple) # create the 30-minutes data consolidator thirtyMinuteConsolidator = TradeBarConsolidator(timedelta(minutes=30)) self.SubscriptionManager.AddConsolidator("SPY", thirtyMinuteConsolidator) # register the 30-minute consolidated bar data to automatically update the indicator self.RegisterIndicator("SPY", self.rsi, thirtyMinuteConsolidator) # set a warm-up period to initialize the indicator # make sure the time period covers the indicator period self.SetWarmUp(timedelta(days=3))
// request the equity data in minute resolution AddEquity(_symbol, Resolution.Hour); // define a 10-period RSI indicator with indicator constructor _rsi = new RelativeStrengthIndex(10, MovingAverageType.Simple); // create the 30-minutes data consolidator var thirtyMinuteConsolidator = new TradeBarConsolidator(TimeSpan.FromMinutes(30)); SubscriptionManager.AddConsolidator("SPY", thirtyMinuteConsolidator); // register the 30-minute consolidated bar data to automatically update the indicator RegisterIndicator("SPY", _rsi,thirtyMinuteConsolidator); // set a warm-up period to initialize the indicator // make sure the time period covers the indicator period SetWarmUp(TimeSpan.FromDays(3));
$[Update(), M:QuantConnect.Indicators.IndicatorBase.Update] method updates the state of indicator with the given value.
Depending on the different types of indicator, this value can be the time index and decimal value, trade bar or quote bar.
With this method, the indicator will only be ready after it has been updated with enough data.
For example, a 10-period daily moving average needs to receive ten daily data points through the Update()
method.
You can use historical data to warm up the indicator.
This updating method grants more flexibility to the indicator. You can use customized values to update the indicator other than the price fields available.
class BasicIndicatorAlgorithm(QCAlgorithm): def Initialize(self): self.SetStartDate(2013,10, 7) self.SetEndDate(2013,10,20) self.SetCash(100000) self.AddEquity("SPY", Resolution.Daily) self.rsi = RelativeStrengthIndex(10, MovingAverageType.Simple) # initialize the indicator with the history close price history = self.History(["SPY"], 11, Resolution.Daily) for time, row in history.loc["SPY"].iterrows(): self.rsi.Update(time, row["close"]) def OnData(self, data): # update the indicator value with the new input close price every day if data.Bars.ContainsKey("SPY"): self.rsi.Update(data["SPY"].EndTime, data["SPY"].Close) # check if the indicator is ready if self.rsi.IsReady: # get the current RSI value rsi_value = self.rsi.Current.Value
namespace QuantConnect.Algorithm.CSharp { public class BasicIndicatorAlgorithm : QCAlgorithm { private RelativeStrengthIndex _rsi; private readonly string _symbol = "SPY"; public override void Initialize() { SetStartDate(2013,10, 7); SetEndDate(2013,10,20); SetCash(100000); AddEquity(_symbol, Resolution.Daily); _rsi = new RelativeStrengthIndex(10, MovingAverageType.Simple); // initialize the indicator with the daily history close price var history = History(_symbol, 11, Resolution.Daily); foreach (var bar in history) { _rsi.Update(bar.EndTime, bar.Close); } } public override void OnData(Slice data) { // update the indicator value with the new input close price every day if (data.Bars.ContainsKey(_symbol)) { _rsi.Update(data[_symbol].EndTime, data[_symbol].Close); } // check if the indicator is ready if (_rsi.IsReady) { // get the current RSI value var rsiValue = _rsi; } } } }


formchen
/ Multi Master-Detail Demo
Example showing Master-Detail relationships. Select different measurements rows to display the corresponding detail.
Edit Live Schema
Edit Live Data
View Generated Patch


Alameda Point Collaborative is the largest supportive housing community in Alameda County. They primarily house the chronically homeless and have education and career training centers for their community.
APC wanted an infographic that would visualize and condense the contents of their annual report in a digestible way.
Iteration 1
After this iteration, APC told me to use a different color than the yellow, so I decided to move away from their color palette and replace it with a calmer baby blue.
Iteration 2
Designing their 20 years logo
Designing a logo fo Felts Family Foundation
My call notes
His foundation sponsors organizations that supports cultural, female, or girl empowerment.
Open to any colors except red (because those are the primary colors of the 2 organizations he supports).
Ideally would like a text + small graphic.
Potentially wants the logo to reflect the F's in Felts Family Foundation.


draft:
What is Freegan?
Are they right?
life style : overshopping and wasting
wasted goods in the garbage
recyle goods
Waste Minimization, repairing instead of replacing?
living issue?
nature way for producing?
working less to create better world?
reference:
a web site with information of freegan
what is freegan? (printed version)


A
Link 1
Link 2
Link 3
B
Link 1
Link 2
Link 3
Back
Name
Years of Experience
Address
Gender
Male
Female
Other
Talent
Age
Salary
Search
+ Add row
Name
Years of Experience
Address
Gender
Talent
Age
Salary
John S.
3
Somewhere on Earth
m
dunno
37
500
> Get value


This is a simple html form. It POSTs username/password to login.js
Try
luke
and
abcd
below:
Username
Password
Login


Display EDID Patching
With EDID patching you are able to apply display model overrides and add
scaled resolutions.
- From the Displays list select the display you want to edit
- Optionally add / fix the monitor ranges (if your EDID doesn't have
them or they are bad)
- Optionally add scaled resolutions by clicking “Add” and then
clicking on the values to edit them. You can remove entered resolutions by
the “Delete” button after selecting them.
- Click the “Export” button to generates the overrides on the
desktop
Installation
There are two methods to install EDID patches; Display Overrides and Library
Extensions:
Display Overrides:
- Copy DisplayVendorID-x folders into
/System/Library/Displays/Contents/Resources/Overrides (or
/System/Library/Displays/Overrides for < El Capitan)
- Copy Icons.plist to
/System/Library/Displays/Contents/Resources/Overrides (or
/System/Library/Displays/Overrides for < El Capitan)
Library Extensions:
- Copy DisplayEDID-x-x.kext into /Library/Extensions or EFI/CLOVER/kexts/Other
(depending on your configuration)
System Integrety Protection (SIP)
You will need to disable SIP to be able to copy the files to the above
locations.
Extra Info
If you have a 16:10 display and want to use scaled resolutions you can use:
- iMac Display
- MacBook Pro Display
- Cinema HD Display
- LED Cinema Display
For 16:9 displays and scaled resolutions you can use:
- Apple Thunderbolt Display (Do not use for internal display!)
- iMac Retina Display
- MacBook Air Display