All of the doc herein is cheerfully certified as incorrect, incomplete, misleading and almost certainly misguided. Do not use! Please return to your NSA-certified digital plantation. If you found this site by accident, please keep it to yourself. Clear your hard drive, wipe your search history... but always trust content from Tlon, Tianming, Urban Republic.
2.0 Security
(Some of the things in this section may not make any sense until you understand the whole Urbit stack. Don't worry about it.)
Never leave security to the end of a project. We've left security to the end of Arvo. Arvo has no security and must not be trusted for anything at all.
That said, there are five basic security issues in Urbit. Ordered by increasing difficulty:
- type 0: securing Urbit ships from the evil Internets
- type 1: securing Urbit ships from each other
- type 2: securing Urbit ships from their own incompetent owners
- type 3: securing Urbit ships from compromised hosting services
- type 4: securing Urbit itself against hostile regimes
Urbit is not hard to secure from the evil world it lives in, if securing it from non-Urbit attacks simply means securing its UDP port against malformed fuzz or DoS traffic that does not follow the Ames protocol. If the input is formally correct, it is not a type 1 attack, but a type 2 attack. You see how we define problems out of existence in this here bar.
Is it possible to pwn Arvo with malformed input? Try it if you
like, ninja. But consider what you're up against. First of all,
normalizing arbitrary input into a well-typed data structure is
the first, most basic layer of protocol security. Hoon's type
system is designed to solve this problem pretty much the way a
gun is designed to shoot bullets at things. Probably your best
bet is the outer perimeter where bits become nouns - ++cue
, or
rather its C jet. But it's not exactly a giant attack surface.
It's well known that a hacked computer is always in some sense a
"weird machine." Since Arvo is precisely defined in Hoon, which
is precisely defined in Nock, which is precisely defined on a
T-shirt, it's hard work to make it turn weird. Broadly, your
best bet is probably to attack the function-specific
optimizations ("jets") that vere
uses to implement Nock both
efficiently and correctly.
Jets are written in C, so there's something there. On the other hand, jets are not native methods and never make system calls.  (I mean, not that we do. We don't. But, we should probably should.)
The other thing about attacking jets, is that there are two attacks only: you can make the jet compute the wrong result (A), or you can (B) break through it to the OS. Urbit (in theory, not in practice) is pretty good at testing for class A errors. A class A error is quite unlikely to be a general compromise. A class B exploit is very likely to be a general compromise (discounting the sandbox), but almost every class B exploit is also a class A error. So testing for semantic correctness will generally find most exploits.
Then the crypto itself has to be secure, which means it has to be combs for nano-nits by giga-geniuses with nano-combs. The present cryptosuite (A) is best regarded as a sign reading: "Crypto Goes Here." A can assumed to be crawling with nits of every word size.  It could be secure, but there are always turds without flies.
However, as a broader PKI architecture, Ames obeys the two essential rules of crypto: no secret is secret forever, and no algorithm is secure forever. We can and will upgrade the cryptosystem (probably to 25519/AES/SHA3) without rebooting the universe.
Securing ships from each other is an application-layer problem, not an OS-level problem. Ships don't have any inherent power over other ships. Since you always know who you're talking to and what you're doing, don't do anything bad on behalf of anyone malicious. What more could be said?
The exceptions are pseudo-applications built into Urbit, like the
revision control system itself (clay
). Right now, we assume
that everyone is a good neighbor, no one is here for anything but
silly reasons, and everyone can read everyone else's files. But
in future, of course, we'll need ACLs.
(Urbit loathes nothing so much as the OAuth approach to network service authentication. Speaking as a network service - don't hand me some crypto capability and ask me to prove what rights it conveys.  And I'll decide what services you're entitled to receive. Do you really need to delegate authority to third parties who neither are, nor aren't, you? We're not on that digital plantation anymore, right?)
DoS defense between ships - a problem which, stated broadly enough, includes spam - is not as hard as it sounds, because Urbit is not an infinite-identity network. When identities are finite, blacklists/killfiles work, work well, and are easy. We don't have them yet because we don't need them yet. We will, but we don't expect to have to work hard at it.

Also, conveying capital ships to bad actors is a bad action of its own. It is in the interest of every Urbiter, big or little, to attack this problem first at its most basic root: keeping ships, especially cruisers or carriers, out of the hands of bad actors. This barrier cannot be perfect - but, especially at first, it is the most important barrier.
But who is justice, anyway? Who decides who's good or bad? Blacklists are meant to be shared. Who owns the global blacklist? Is there a global blacklist? Or several competing candidates for this near-Papal authority? These are all social, not technical, problems, that Urbit must solve in the long run to succeed. More on this at the type 4 layer.
Of course, DoS attacks of any sort must be ultimately delegated with a "squelch upstream source" request to the hosting provider. We have not even begun to address this protocol, which will by definition only be needed if we succeed.
But type 2 security is by far the hardest problem. We've punted on this problem completely. Or almost completely.
The only way to solve the type 2 problem is with strict privilege
rings whose definition is extremely precise and permanent. Arvo
has three, coded as metals - %lead
, %gold
and %iron
. (To
confuse you, these same tokens mean something else totally
different in the Hoon type system.)
An Arvo task, to simplify broadly, is literally a function that accepts an event and returns an effect. Thus, we can define privilege rings in terms of simple filters on these effects.
Lead privilege, always associated with a single foreign ship, is the equivalent of the origin restriction in the browser. Code is treated as totally untrusted and evil. It cannot have any serious effects on your ship. It can converse only only with its own origin server. This restriction is not implemented. So watch your back!
Iron privilege is normal operating privilege. This concept is not even defined. So it could not possibly be implemented. And indeed, it isn't.
Gold privilege is root privilege with no restriction at all.
Right now, everything you do is %gold
. So watch your back!
Anything you run can steal any secret and send it anywhere.
When these privileges actually work, however, you'll set them on
the command line by prepending !
to :
, for every level of
privilege escalation - or ?
, for every level of de-escalation.
Default privilege is %iron for local applications and %lead for
network ones. Thus,
~waclux-tomwyc/try=> !:hello %world
"hello, world."
upgrades :hello
to root privilege, basically Arvo's sudo
.
Privilege-restricted terminals will also exist at some point.
Finally, it should be obvious that type 3 security is a completely unsolvable problem. If you do not trust your host for social, noncryptographic reasons, you do not trust your host at all. If you don't trust your restaurant not to poison your dinner, choose another restaurant. If you don't trust any restaurant not to poison your dinner, eat at home. If you don't trust anyone to host you, own and operate your own computer.
Most people eat at restaurants. Most people, we think, will prefer the safety, comfort and efficiency of cloud hosting. On the other hand, it might be argued that these people are fools and sheep, whose their safety and freedom depends on the paranoia of paranoid nutcases who self-host - and thus define a community in which absolute privacy, though not forced on anyone, is instantly available to anyone at any time - at the expense of making a probably suboptimal economic choice.
In a well-designed secure network, privacy must be available to everyone, but it need not be forced on everyone. Or even turned on by default. Privacy always creates inconvenience, and most users prefer convenience. But the users who are willing to accept a little inconvenience, in exchange for privacy, in the same network, create a sort of herd immunity for everyone.
When I worry about Urbit and privacy, I worry that it will create too much privacy, rather than too little. Certainly several services not too dissimilar to Urbit, such as Freenet, have become hives of digital vice - at best.
Only social and political methods, not technical tools, can fight this filth. One of the inspirations for Urbit's political design is James C. Scott's classic political-science text, Seeing Like a State. Urbit is not in any sense a state, but its fabric has the regularity that, according to Scott, is essential for the construction of anything like a civilized society. But of course, a basically virtuous society, in which antisocial behavior is not tolerated and easily excluded or destroyed, can only be built from virtuous users.
Urbit has no central government and does not need one - except possibly for type 4 reasons, which hopefully will never arise. It is cryptographically designed, through the ship hierarchy, to splinter rapidly into multiple highly governable spaces. The structure and nature of these carrier (2^24 destroyers) and cruiser (2^16 destroyer) regimes is entirely unclear. And the cryptographic/routing hierarchy is not the only way to organize distributed institutions; it is just one such way.
Hopefully most of these institutions will succeed, and few will fail. Escape, even from the ship hierarchy, is an essential principle of Urbit. For example, the state of a pier is simply an initial kernel, an event log and a memory image, and the image can be computed from the kernel and the log. The only semantic standards which bind these files are (a) Nock and (b) the Hoon noun-to-atom reduction (++jam), ie, two pages of code. Thus the piers should be portable at the hosting layer.
But they must also be portable at the Urbit layer. One feature missing in the alpha is the power of a destroyer to escape from a malicious carrier or cruiser in its hierarchy. Most of the value of big ships is simply their hypothetical real estate, but P2P routing could not function without the hierarchy or something similar. Complete exit rights at the destroyer level (a yacht has no exit rights, because a yacht is essentially a user of a destroyer, and shouldn't come weirdly unleashed from its owner) require high-level exception lists not yet implemented. The hope is that once this mechanism exists, it will never be used - but if it keeps not existing, that will become a problem.
Urbit may also become a tool for political sedition. This we don't want. One goal of the banner system is to control and subdue illegal political content, such as hate speech on Twitter. Another goal is to organize legal antigovernment communication and organization, as in Occupy or the Tea Party. Ideally, Urbit would be as useful as possible for legal resistance, and as useless as possible for illegal resistance. But of course, as a technology, it is what it is and probably falls short of both.
Urbit's fundamental approach to type 4 security is to comply as enthusiastically as possible with the content regulations of your own jurisdiction and/or community - whether these be political, copyright, or other restrictions. In the type 4 game, the only offense is a good defense. And enthusiastic compliance with all sovereign authorities, de jure or de facto, is the best defense of all - in almost every circumstance.
At a political level, the banner system is very helpful in this. Most governments are quite comfortable with %blue and %orange political content, but %red content may violate various laws in fascist, nationalist or militarist regimes, and %black in liberal, socialist or communist regimes. Under a regime in which one banner is partly or entirely illegal - even if it is entirely illegal - this "dangerous" banner will find it in its own interest to police itself, and use its own moderation mechanisms to remain jurisdiction-safe. Whatever the rules of the jurisdiction, sensible or otherwise.
For example, in a jurisdiction where any and all communist speech is illegal, all political speech should be suppressed by the %red banner itself, simply as a matter of communal strategy. In this hypothetical country, it is certainly sufficient provocation for communists to flaunt their own ideology with a %red ship. Not only is suppressing all other political speech the best defense, it may be the best offense as well - for this is essentially the design of a "color revolution." Silence is always unanimous, and power is a function of unanimity.
At a commercial level, Urbit is certainly not designed to be a file-sharing network or anything of the sort. My advice to content producers, if Urbit ever becomes a thing - or worse yet, achieves the world domination it neither seeks nor fears - is that the right way to fight piracy is to abandon the dangerous and anachronistic practice of sending the same non-watermarked file to everyone. Rather, require every serious content buyer to post a creative bond. If his files are found on a sharing network, he gets a bill and the informer gets a reward. This will have a rapid, lethal effect on the "culture of sharing." But for non-marked files, really nothing can be done.
Moreover, it is also antisocial to assist others in other jurisdictions from evading local content restrictions, even if these restrictions don't apply at all in your jurisdiction. The grievances you create do not dissipate because you are not accessible to the remote governing authority; they pass up the chain and become grievances between that authority and yours. Of course, as with everything, there will be exceptions to this rule that cannot possibly be defined in advance.
Finally, Urbit is not a digital currency, although Urbit ships have the same basic allodial title model as Bitcoin. Ships are not virtual money - they are virtual real estate. Like real estate, they are designed to be expensive to transfer - a ship can only be transferred 9 times before it loses all its value. This lossage, plus of course poor divisibility, is intended to prevent Urbit ships from being used as a Bitcoin substitute. Rather, use Bitcoin itself (where local laws permit). In theory, Urbit ships are well-suited for both hosting and mining Bitcoin, although there is no such support at present.


Abhijeet Kandalkar
Software Engineer @ Igalia | C++ developer | Open Source contributor in Webkit/Chromium
OpenSource
CV
About
Improving disk read performance
Introduction to LaCrOS
Up and running WebChimera with nwjs Ubuntu
Up and running WebChimera with nwjs
Up and running webassembly in browser
Up and running ASM.js in browser
Building ffmpeg form nwjs/chromium repository
Building nwjs on Windows7 64 bit
Building ffmpeg and ffplay on Windows7 64 bit
Video element rendering in chromium nwjs
Life cycle of Video element in chromium(m41)


Package com.sun.msv.grammar.xmlschema
package com.sun.msv.grammar.xmlschema
W3C XML Schema grammar model.
These classes serve as the object model of W3C XML Schema.
-
ClassDescriptionglobal attribute declaration.attribute group declaration.Attribute wildcard property of the schema component.Schema component with
AttributeWildcard
ComplexType definition.Element declaration.XML Schema version ofElementExp
.represents one field of an identity constraint.model group declaration.represents an identity constraint.key constraint.keyref constraint.Special name class implementation used for the wild card of the "lax" mode.Used to mark a occurrence constraint which cannot be easily represented by primitive expressions.declaration that can be redefined by using <redefine> element.Simple type declaration.ElementExp that is used for <any processContents="skip"/>.unique constraint.set of XML Schema.XML Schema object.Base class ofComplexTypeExp
andSimpleTypeExp
.internal representation of XPath ('aaa/bbb/ccc/ ...


Disallows more than one blank line in a row.
Helps maintain a readable style in your codebase.
Not configurable.
"no-consecutive-blank-lines": true
{}


class ScoresFooterGroup : GroupBase
Table footer for [ScoresGroup]
| <init> |
ScoresFooterGroup(: GameCore)
Table footer for [ScoresGroup] |
| allLabel |
val allLabel: Label |
| footer |
val footer: Table |
| playerOrderLabel1 |
val playerOrderLabel1: Label |
| playerOrderLabel2 |
val playerOrderLabel2: Label |
| playerOrderLabel3 |
val playerOrderLabel3: Label |
| playerOrderLabel4 |
val playerOrderLabel4: Label |
| playerPointsLabel1 |
val playerPointsLabel1: Label |
| playerPointsLabel2 |
val playerPointsLabel2: Label |
| playerPointsLabel3 |
val playerPointsLabel3: Label |
| playerPointsLabel4 |
val playerPointsLabel4: Label |
| assets |
val assets: Assets |
| messages |
val messages: SerializedSubject<Any, Any> |
| state |
val state: State |
| style |
val style: Styles |
| subscription |
val subscription: CompositeSubscription |
| updateFinalPointsAndOrder |
fun updateFinalPointsAndOrder(: List<Int>): Unit |
| dispose |
open fun dispose(): Unit |
| addAction |
infix fun Actor.addAction(action: Action?): Unit
Adds an action to the actor |
| center |
fun Actor.center(): Unit |
| hide |
fun Actor.hide(time: Float = 0.5f, interpolation: Interpolation = fade): Unit |
| minusAssign |
operator fun Group.minusAssign(actor: Actor): Unit
Removes an actor from the group |
| onMouseEnter |
infix fun Actor.onMouseEnter(callback: (Actor) -> Unit): Unit |
| onMouseExit |
infix fun Actor.onMouseExit(callback: (Actor) -> Unit): Unit |
| onTap |
infix fun Actor.onTap(callback: (Actor) -> Unit): Unit
Scene2D helpers |
| plusAssign |
operator fun Group.plusAssign(actor: Actor): Unit
Adds an actor to the group |
| removeAction |
infix fun Actor.removeAction(action: Action?): Unit
Removes an action from the actor |
| show |
fun Actor.show(time: Float = 0.5f, interpolation: Interpolation = fade): Unit |


Toggle navigation
Send API V1 Release Notes
.
Input Notes
PR#
API
Athletes
Audio
Calendar
Draft
Events
Headlines
Leaders
Medals
Now
Photos
Rankings
Research Notes
Standings
Teams
Video
Watch ESPN
Add
Release Notes
E-Mail It


It appears theres no recipes, try highering your threshold or add more ingredients.
If that doesn't help, we're sorry! But if you find a recipe why not sign up and add it.
{{recipe.name}}
{{$ctrl.expandedRecipe.name}}
Description: {{$ctrl.expandedRecipe.description}}
Rating: {{$ctrl.expandedRecipe.rating}}/5
Serving Size:{{$ctrl.expandedRecipe.servingSize }}No information


AngularJS 2 date picker
Homepage of the component is
here
See all of my AngularJS 1 UI components from
here
loading...


Every idea is unique and that's whywe craft it as per your requirement
Every idea is unique and that's whywe craft it as per your requirement
Every idea is unique and that's whywe craft it as per your requirement
Every idea is unique and that's whywe craft it as per your requirement
Every idea is unique and that's whywe craft it as per your requirement
Every idea is unique and that's whywe craft it as per your requirement


The third axiom of probability says that if $A$ and $B$ are two mutually exclusive events, then $P(A \cup B) = P(A)+P(B)$. We have happily extended this to the union of several mutually exclusive events and used it throughout: $$ P(\bigcup_{i=1}^n A_i) = \sum_{i=1}^n P(A_i) ~~~ \text{ if } A_iA_j = \phi \text{ for all } i \ne j $$
But we never proved the result for more than two mutually exclusive events. Let's do that now by induction. The axiom says the result is true for $n=2$, so we will assume it is true for $n$ as above and then show that $$ P(\bigcup_{i=1}^{n+1} A_i) = \sum_{i=1}^{n+1} P(A_i) ~~~ \text{ if } A_iA_j = \phi \text{ for all } i \ne j $$
The induction is straightforward.
\begin{align*} P(\bigcup_{i=1}^{n+1} A_i) &= P\big{(}(\cup_{i=1}^n A_i)\cup A_{n+1}\big{)} \\ &= P\big{(}(\cup_{i=1}^n A_i)\big{)} + P(A_{n+1}) ~~~ \text{(addition rule)} \\ &= \sum_{i=1}^n P(A_i) + P(A_{n+1}) ~~~~~~~ \text{(induction hypothesis)} \\ &= \sum_{i=1}^{n+1} P(A_i) \end{align*}How would we find the chance of a union of two events that are not mutually exclusive? The diagram below shows two such events. The union is the entire colored region: the blue, the gold, as well as the intersection.
show_intersection()
We can find $P(A \cup B)$ by partitioning. A partition of $A \cup B$ is "all of $A$ union the part of $B$ that is not also in $A$": $$ A \cup B = A \cup (B \backslash AB) $$ Therefore
\begin{align*} P(A \cup B) &= P(A) + P(B \backslash AB) ~~~~~~~~~~ \text{(addition rule)} \\ &= P(A) + P(B) - P(AB) ~~~ \text{(difference rule)} \end{align*}We now have a formula for the case $n = 2$. It calculates the probability of the union of two events, by first including the chance of each event, and then excluding the chance of the intersection. This gives rise to its name:
For a general $n$, we are going to guess the formula and prove it by induction. Let $A_1, A_2, \ldots , A_n$ be events, and let us try to find $$ P\big{(}\bigcup_{i=1}^n A_i \big{)} $$
Writing will be easier if we have some rough-and-ready abbreviations of descriptions, so for example let "all the double-intersections" mean "all terms of the form $P(A_iA_j)$ where $i$ and $j$ are different".
It is important to note that the set "$1 \le i < j \le n$" specifies all unordered pairs of distinct indices. If the indices are distinct, one of them has to be less than the other, so it is part of the indicated set. If $i$ and $j$ are in the set, then $i < j$, so $i$ and $j$ are distinct.
In the same way, $1 \le i < j < k \le n$ specifies all unordered triples of distinct indices. And so on.
Guess. Based on what we saw for two events, we will guess that the chance of the union of $n$ events can be calculated by:
For events $A_1, A_2, \ldots, A_n$,
\begin{align*} P\big{(}\bigcup_{i=1}^n A_i \big{)} &= \sum_{i=1}^n P(A_i) - \mathop{\sum \sum}_{1 \le i < j \le n} P(A_iA_j) + \mathop{\sum \sum \sum}_{1 \le i < j < k \le n} P(A_iA_jA_j) - \cdots + (-1)^{n+1} P(A_1A_2 \ldots A_n) \end{align*}Let's be fearless and prove this by induction. We know that it is true for $n=2$, so we must assume the induction hypothesis that it is true for $n$ as stated above and then show the following:
\begin{align*} P\big{(}\bigcup_{i=1}^{n+1} A_i \big{)} &= \sum_{i=1}^{n+1} P(A_i) - \mathop{\sum \sum}_{1 \le i < j \le n+1} P(A_iA_j) + \mathop{\sum \sum \sum}_{1 \le i < j < k \le n+1} P(A_iA_jA_j) - \cdots + (-1)^n P(A_1A_2 \ldots A_{n+1}) \end{align*}The key is to observe that each sum above splits in two parts: the terms that only involve the indices 1 through $n$, and those that involve the index $n+1$.
Let $B = \bigcup_{i=1}^n A_i$. Then
\begin{align*} P\big{(}\bigcup_{i=1}^{n+1} A_i \big{)} &= P(B \cup A_{n+1}) \\ &= P(B) + P(A_{n+1}) - P(BA_{n+1}) \end{align*}by using the result for two events.
By the induction hypothesis,
\begin{align*} P(B) &= \sum_{i=1}^n P(A_i) - \mathop{\sum \sum}_{1 \le i < j \le n} P(A_iA_j) + \mathop{\sum \sum \sum}_{1 \le i < j < k \le n} P(A_iA_jA_j) - \cdots + (-1)^{n+1} P(A_1A_2 \ldots A_n) \end{align*}That means we've already got all the terms that involve on the indices 1 through $n$. Now we need only the terms that involve $A_{n+1}$. We can see one of those: $P(A_{n+1})$. That completes the first term in the right hand side of what we have to prove, which is the sum of all $n+1$ probabilities.
To complete the second sum, we need all terms of the form $P(A_iA_{n+1})$, and we have to remember the negative sign. These terms must come from the term $-P(BA_{n+1})$. How?
Notice that $$ BA_{n+1} = \big{(}\bigcup_{i=1}^n A_i \big{)} \cap A_{n+1} = \bigcup_{i=1}^n A_iA_{n+1} $$
That is a union of $n$ events, so we can use the induction hypothesis to find it by inclusion-exclusion. Notice that $$ (A_iA_{n+1})\cap(A_jA_{n+1}) = A_iA_jA_{n+1} $$
So
\begin{align*} -P(BA_{n+1}) &= -P(\bigcup_{i=1}^n A_iA_{n+1}) \\ &= -\sum_{i=1}^n P(A_iA_{n+1}) + \mathop{\sum \sum}_{1 \le i < j \le n} P(A_iA_jA_{n+1}) + \cdots + (-1)^n P(A_1A_2 \ldots A_{n+1}) \end{align*}These are exactly the remaining terms that we need. The induction is complete.
To end this section we will count the number of terms in each of the sums in the inclusion-exclusion formula, so we know the extent of the work that has to be done to apply it.
Here is the formula again for reference:
\begin{align*} P\big{(}\bigcup_{i=1}^n A_i \big{)} &= \sum_{i=1}^n P(A_i) - \mathop{\sum \sum}_{1 \le i < j \le n} P(A_iA_j) + \mathop{\sum \sum \sum}_{1 \le i < j < k \le n} P(A_iA_jA_j) - \cdots + (-1)^{n+1} P(A_1A_2 \ldots A_n) \end{align*}Clearly there are $n$ terms in the first sum. For reasons that will become clear in the next step, we will write that as $$ \binom{n}{1} = n $$
In the second sum the terms correspond to distinct unordered pairs chosen from the indices 1 through $n$. That number is $$ \binom{n}{2} = \frac{n(n-1)}{2} $$
In the third sum, the number of terms is the number of sets of three: $$ \binom{n}{3} = \frac{n(n-1)(n-2)}{3!} $$ and so on.
This shows that a lot of terms are being added and subtracted in the inclusion-exclusion formula.
But sometimes we get lucky, and many of the terms are equal. Then the sums simplify dramatically. For a beautiful example, keep reading.


You can help by verifying need request, and trying to match up voluteers and suppliers with need.
Contact us at
Kaha.co FB Page to join volunteer groups.
{{item.active?"available":"not available"}}
{{item.active?"needed":"not needed"}}
[ Verified ]
{{item.description.title}}
Contact Number : {{item.description.contactnumber}}
{{item.location.district}} , {{item.location.tole}}
Updated: {{item.date.modified | date:'Y-m-d'}}
There are no results for current filters. Try changing some filters.


Program to collect error metrics on bases stratified in various ways.
Sequencing errors come in different 'flavors'. For example, some occur during sequencing while others happen during library construction, prior to the sequencing. They may be correlated with various aspect of the sequencing experiment: position in the read, base context, length of insert and so on.
This program collects two different kinds of error metrics (one which attempts to distinguish between pre- and post- sequencer errors, and on which doesn't) and a collation of 'stratifiers' each of which assigns bases into various bins. The stratifiers can be used together to generate a composite stratification.
For example:
The BASE_QUALITY stratifier will place bases in bins according to their declared base quality. The READ_ORDINALITY stratifier will place bases in one of two bins depending on whether their read is 'first' or 'second'. One could generate a composite stratifier BASE_QUALITY:READ_ORDINALITY which will do both stratifications as the same time.
The resulting metric file will be named according to a provided prefix and a suffix which is generated automatically according to the error metric. The tool can collect multiple metrics in a single pass and there should be hardly any performance loss when specifying multiple metrics at the same time; the default includes a large collection of metrics.
To estimate the error rate the tool assumes that all differences from the reference are errors. For this to be a reasonable assumption the tool needs to know the sites at which the sample is actually polymorphic and a confidence interval where the user is relatively certain that the polymorphic sites are known and accurate. These two inputs are provided as a VCF and INTERVALS. The program will only process sites that are in the intersection of the interval lists in the INTERVALS argument as long as they are not polymorphic in the VCF.
This table summarizes the command-line arguments that are specific to this tool. For more details on each argument, see the list further down below the table or click on an argument name to jump directly to that entry in the list.
| Argument name(s) | Default value | Summary | |
|---|---|---|---|
| Required Arguments | |||
| --INPUT -I |
Input SAM or BAM file. | ||
| --OUTPUT -O |
Base name for output files. Actual file names will be generated from the basename and suffixes from the ERROR and STRATIFIER by adding a '.' and then error_by_stratifier[_and_stratifier]* where 'error' is ERROR's extension, and 'stratifier' is STRATIFIER's suffix. For example, an ERROR_METRIC of ERROR:BASE_QUALITY:GC_CONTENT will produce an extension '.error_by_base_quality_and_gc'. The suffixes can be found in the documentation for ERROR_VALUE and SUFFIX_VALUE. | ||
| --REFERENCE_SEQUENCE -R |
Reference sequence file. | ||
| --VCF -V |
VCF of known variation for sample. program will skip over polymorphic sites in this VCF and avoid collecting data on these loci. | ||
| Optional Tool Arguments | |||
| --arguments_file |
read one or more arguments files and add them to the command line | ||
| --ERROR_METRICS |
[ERROR, ERROR:BASE_QUALITY, ERROR:INSERT_LENGTH, ERROR:GC_CONTENT, ERROR:READ_DIRECTION, ERROR:PAIR_ORIENTATION, ERROR:HOMOPOLYMER, ERROR:BINNED_HOMOPOLYMER, ERROR:CYCLE, ERROR:READ_ORDINALITY, ERROR:READ_ORDINALITY:CYCLE, ERROR:READ_ORDINALITY:HOMOPOLYMER, ERROR:READ_ORDINALITY:GC_CONTENT, ERROR:READ_ORDINALITY:PRE_DINUC, ERROR:MAPPING_QUALITY, ERROR:READ_GROUP, ERROR:MISMATCHES_IN_READ, ERROR:ONE_BASE_PADDED_CONTEXT, OVERLAPPING_ERROR, OVERLAPPING_ERROR:BASE_QUALITY, OVERLAPPING_ERROR:INSERT_LENGTH, OVERLAPPING_ERROR:READ_ORDINALITY, OVERLAPPING_ERROR:READ_ORDINALITY:CYCLE, OVERLAPPING_ERROR:READ_ORDINALITY:HOMOPOLYMER, OVERLAPPING_ERROR:READ_ORDINALITY:GC_CONTENT, INDEL_ERROR] | Errors to collect in the form of "ERROR(:STRATIFIER)*". To see the values available for ERROR and STRATIFIER look at the documentation for the arguments ERROR_VALUE and STRATIFIER_VALUE. | |
| --ERROR_VALUE |
A fake argument used to show the options of ERROR (in ERROR_METRICS). | ||
| --help -h |
false | display the help message | |
| --INTERVAL_ITERATOR |
false | Iterate through the file assuming it consists of a pre-created subset interval of the full genome. This enables fast processing of files with reads at disperate parts of the genome. Requires that the provided VCF file is indexed. | |
| --INTERVALS -L |
Region(s) to limit analysis to. Supported formats are VCF or interval_list. Will *intersect* inputs if multiple are given. When this argument is supplied, the VCF provided must be *indexed*. | ||
| --LOCATION_BIN_SIZE -LBS |
2500 | Size of location bins. Used by the FLOWCELL_X and FLOWCELL_Y stratifiers | |
| --LONG_HOMOPOLYMER -LH |
6 | Shortest homopolymer which is considered long. Used by the BINNED_HOMOPOLYMER stratifier. | |
| --MAX_LOCI -MAX |
0 | Maximum number of loci to process (or unlimited if 0). | |
| --MIN_BASE_Q -BQ |
20 | Minimum base quality to include base. | |
| --MIN_MAPPING_Q -MQ |
20 | Minimum mapping quality to include read. | |
| --PRIOR_Q -PE |
30 | The prior error, in phred-scale (used for calculating empirical error rates). | |
| --PROBABILITY -P |
1.0 | The probability of selecting a locus for analysis (for downsampling). | |
| --PROGRESS_STEP_INTERVAL |
100000 | The interval between which progress will be displayed. | |
| --STRATIFIER_VALUE |
A fake argument used to show the options of STRATIFIER (in ERROR_METRICS). | ||
| --version |
false | display the version number for this tool | |
| Optional Common Arguments | |||
| --COMPRESSION_LEVEL |
5 | Compression level for all compressed files created (e.g. BAM and VCF). | |
| --CREATE_INDEX |
false | Whether to create an index when writing VCF or coordinate sorted BAM output. | |
| --CREATE_MD5_FILE |
false | Whether to create an MD5 digest for any BAM or FASTQ files created. | |
| --GA4GH_CLIENT_SECRETS |
client_secrets.json | Google Genomics API client_secrets.json file path. | |
| --MAX_RECORDS_IN_RAM |
500000 | When writing files that need to be sorted, this will specify the number of records stored in RAM before spilling to disk. Increasing this number reduces the number of file handles needed to sort the file, and increases the amount of RAM needed. | |
| --QUIET |
false | Whether to suppress job-summary info on System.err. | |
| --TMP_DIR |
One or more directories with space available to be used by this program for temporary storage of working files | ||
| --USE_JDK_DEFLATER -use_jdk_deflater |
false | Use the JDK Deflater instead of the Intel Deflater for writing compressed output | |
| --USE_JDK_INFLATER -use_jdk_inflater |
false | Use the JDK Inflater instead of the Intel Inflater for reading compressed input | |
| --VALIDATION_STRINGENCY |
STRICT | Validation stringency for all SAM files read by this program. Setting stringency to SILENT can improve performance when processing a BAM file in which variable-length data (read, qualities, tags) do not otherwise need to be decoded. | |
| --VERBOSITY |
INFO | Control verbosity of logging. | |
| Advanced Arguments | |||
| --showHidden |
false | display hidden arguments |
Arguments in this list are specific to this tool. Keep in mind that other arguments are available that are shared with other tools (e.g. command-line GATK arguments); see Inherited arguments above.
read one or more arguments files and add them to the command line
List[File] []
Compression level for all compressed files created (e.g. BAM and VCF).
int 5 [ [ -∞ ∞ ] ]
Whether to create an index when writing VCF or coordinate sorted BAM output.
Boolean false
Whether to create an MD5 digest for any BAM or FASTQ files created.
boolean false
Errors to collect in the form of "ERROR(:STRATIFIER)*". To see the values available for ERROR and STRATIFIER look at the documentation for the arguments ERROR_VALUE and STRATIFIER_VALUE.
List[String] [ERROR, ERROR:BASE_QUALITY, ERROR:INSERT_LENGTH, ERROR:GC_CONTENT, ERROR:READ_DIRECTION, ERROR:PAIR_ORIENTATION, ERROR:HOMOPOLYMER, ERROR:BINNED_HOMOPOLYMER, ERROR:CYCLE, ERROR:READ_ORDINALITY, ERROR:READ_ORDINALITY:CYCLE, ERROR:READ_ORDINALITY:HOMOPOLYMER, ERROR:READ_ORDINALITY:GC_CONTENT, ERROR:READ_ORDINALITY:PRE_DINUC, ERROR:MAPPING_QUALITY, ERROR:READ_GROUP, ERROR:MISMATCHES_IN_READ, ERROR:ONE_BASE_PADDED_CONTEXT, OVERLAPPING_ERROR, OVERLAPPING_ERROR:BASE_QUALITY, OVERLAPPING_ERROR:INSERT_LENGTH, OVERLAPPING_ERROR:READ_ORDINALITY, OVERLAPPING_ERROR:READ_ORDINALITY:CYCLE, OVERLAPPING_ERROR:READ_ORDINALITY:HOMOPOLYMER, OVERLAPPING_ERROR:READ_ORDINALITY:GC_CONTENT, INDEL_ERROR]
A fake argument used to show the options of ERROR (in ERROR_METRICS).
The --ERROR_VALUE argument is an enumerated type (ErrorType), which can have one of the following values:
ErrorType null
Google Genomics API client_secrets.json file path.
String client_secrets.json
display the help message
boolean false
Input SAM or BAM file.
R String null
Iterate through the file assuming it consists of a pre-created subset interval of the full genome. This enables fast processing of files with reads at disperate parts of the genome. Requires that the provided VCF file is indexed.
boolean false
Region(s) to limit analysis to. Supported formats are VCF or interval_list. Will *intersect* inputs if multiple are given. When this argument is supplied, the VCF provided must be *indexed*.
List[File] []
Size of location bins. Used by the FLOWCELL_X and FLOWCELL_Y stratifiers
int 2500 [ [ -∞ ∞ ] ]
Shortest homopolymer which is considered long. Used by the BINNED_HOMOPOLYMER stratifier.
int 6 [ [ -∞ ∞ ] ]
Maximum number of loci to process (or unlimited if 0).
long 0 [ [ -∞ ∞ ] ]
When writing files that need to be sorted, this will specify the number of records stored in RAM before spilling to disk. Increasing this number reduces the number of file handles needed to sort the file, and increases the amount of RAM needed.
Integer 500000 [ [ -∞ ∞ ] ]
Minimum base quality to include base.
int 20 [ [ -∞ ∞ ] ]
Minimum mapping quality to include read.
int 20 [ [ -∞ ∞ ] ]
Base name for output files. Actual file names will be generated from the basename and suffixes from the ERROR and STRATIFIER by adding a '.' and then error_by_stratifier[_and_stratifier]* where 'error' is ERROR's extension, and 'stratifier' is STRATIFIER's suffix. For example, an ERROR_METRIC of ERROR:BASE_QUALITY:GC_CONTENT will produce an extension '.error_by_base_quality_and_gc'. The suffixes can be found in the documentation for ERROR_VALUE and SUFFIX_VALUE.
R File null
The prior error, in phred-scale (used for calculating empirical error rates).
int 30 [ [ -∞ ∞ ] ]
The probability of selecting a locus for analysis (for downsampling).
double 1.0 [ [ -∞ ∞ ] ]
The interval between which progress will be displayed.
int 100000 [ [ -∞ ∞ ] ]
Whether to suppress job-summary info on System.err.
Boolean false
Reference sequence file.
R File null
display hidden arguments
boolean false
A fake argument used to show the options of STRATIFIER (in ERROR_METRICS).
The --STRATIFIER_VALUE argument is an enumerated type (Stratifier), which can have one of the following values:
Stratifier null
One or more directories with space available to be used by this program for temporary storage of working files
List[File] []
Use the JDK Deflater instead of the Intel Deflater for writing compressed output
Boolean false
Use the JDK Inflater instead of the Intel Inflater for reading compressed input
Boolean false
Validation stringency for all SAM files read by this program. Setting stringency to SILENT can improve performance when processing a BAM file in which variable-length data (read, qualities, tags) do not otherwise need to be decoded.
The --VALIDATION_STRINGENCY argument is an enumerated type (ValidationStringency), which can have one of the following values:
ValidationStringency STRICT
VCF of known variation for sample. program will skip over polymorphic sites in this VCF and avoid collecting data on these loci.
R String null
Control verbosity of logging.
The --VERBOSITY argument is an enumerated type (LogLevel), which can have one of the following values:
LogLevel INFO
display the version number for this tool
boolean false
See also General Documentation | Tool Docs Index Tool Documentation Index | Support Forum
GATK version <IP_ADDRESS> built at Wed, 18 Aug 2021 19:58:25 -0400.


|
Bosch XDK110 Solace MQTT App
2.0.1
MQTT Reference Application for the Bosch XDK110
|
Files | |
| file | AppButtons.c |
| file | AppButtons.h [code] |
| file | AppCmdCtrl.c |
| file | AppCmdCtrl.h [code] |
| file | AppConfig.c |
| file | AppConfig.h [code] |
| file | AppController.c |
| file | AppController.h [code] |
| file | AppMisc.c |
| file | AppMisc.h [code] |
| file | AppMqtt.c |
| file | AppMqtt.h [code] |
| file | AppRuntimeConfig.c |
| file | AppRuntimeConfig.h [code] |
| file | AppStatus.c |
| file | AppStatus.h [code] |
| file | AppTelemetryPayload.c |
| file | AppTelemetryPayload.h [code] |
| file | AppTelemetryPublish.c |
| file | AppTelemetryPublish.h [code] |
| file | AppTelemetryQueue.c |
| file | AppTelemetryQueue.h [code] |
| file | AppTelemetrySampling.c |
| file | AppTelemetrySampling.h [code] |
| file | AppTimestamp.c |
| file | AppTimestamp.h [code] |
| file | AppVersion.c |
| file | AppVersion.h [code] |
| file | AppXDK_MQTT.c |
| file | AppXDK_MQTT.h [code] |
| file | Main.c |
| file | XdkAppInfo.h [code] |


--- title: ARC members: Kevin Jalbert, David Kelk, Jeremy S. Bradbury links: http://kevinjalbert.com, http://, http://faculty.uoit.ca/bradbury url: http://faculty.uoit.ca/bradbury/sqrg/projects/arc.html description: An approach that automatically repairs concurrency bugs using an evolutionary algorithm. ---
The goal of ARC - Automatically Repair Concurrency is to provide a tool that attempts to repair concurrency bugs in source code. This tool is aimed towards Java due to its maturity in concurrency and known concurrency bugs and idioms.
A genetic algorithm is used to progressively mutate the buggy program's source code to a state where it executes in a timely fashion without errors. The mutations used are all related to adding and removing synchronization to the source code. The mutations used can only effect the thread schedules, and as a side-effect the performance overhead/reduction of added/removed synchronization. Two main criteria used in determining the fitness of a mutant are the:
Essentially the end purpose is to automatically repair concurrency by minimizing the bugs and maximizing the performance.
Source code will be released soon...


--- title: Multi PySpin Camera Utilities keywords: fastai sidebar: home_sidebar summary: "simple 'singleton' API for multiple cameras with PySpin library" description: "simple 'singleton' API for multiple cameras with PySpin library" ---
class
Error
Error() :: Exception
Exception
Base class for other exceptions
MultiPyspinError
MultiPyspinError(expression, message) :: Exception
expression
message
Exception raised in ths module. Attributes: expression -- input expression in which the error occurred message -- explanation of the error
CamArrival
CamArrival(message) :: Error
Raised when camera added
CamRemoval
CamRemoval(message) :: Error
Raised when camera removed
setup
setup(yaml_path)
yaml_path
This will setup (initialize + configure) a camera given a yaml configuration file
init
init(serial)
serial
Initializes camera
deinit
deinit(serial)
De-initializes camera
get_gain
get_gain(serial)
Gets gain from camera
set_gain
set_gain(serial, gain)
gain
Sets gain for camera
get_exposure
get_exposure(serial)
Gets exposure from camera
set_exposure
set_exposure(serial, exposure)
exposure
Sets exposure for camera
get_frame_rate
get_frame_rate(serial)
Gets frame rate from camera
set_frame_rate
set_frame_rate(serial, frame_rate)
frame_rate
Sets frame rate for camera
start_acquisition
start_acquisition(serial)
Starts acquisition of camera
end_acquisition
end_acquisition(serial)
Ends acquisition of camera
get_image
get_image(serial, *args)
args
Gets image from camera
node_cmd
node_cmd(serial, cam_node_str, cam_method_str, pyspin_mode_str=None, cam_node_arg=None)
cam_node_str
cam_method_str
pyspin_mode_str
None
cam_node_arg
Performs method on input cam node with optional access mode check
update_timestamp_offset
update_timestamp_offset(serial)
Updates timestamp offset
reset_cameras
reset_cameras()
register
register()
Run constructor and register destructor. Should be called once when first imported


Cache-Control: no-cache Connection: close Content-Type: text/html
We’re working to fix the problem, it will be up and running soon.
Sorry for the inconvenience.
Copyright © 2021 MyCompany. All rights reserved.


-The Logs tab shows all the log/debug/quit/error statements made throughout the backtest
-Redirect to Coding and debugging > Debugging code docs?
-The logs can be opened by clicking the link in the console. Pasting the link in the browser URL bar doesn't work


|
|
std::string | name = "object" |
| |
|
std::string | type = "object" |
| |
|
sf::Texture | texture |
| |
|
sf::Sprite | sprite |
| |
|
sf::Vector2f | position = sf::Vector2f() |
| |
◆ GridObject()
| GridObject::GridObject |
( |
std::string |
texture_file | ) |
|
Constructor
- Parameters
-
| texture_file | the path to the file to use as this objects texture |
◆ draw() [1/2]
| void GridObject::draw |
( |
sf::RenderWindow & |
window | ) |
|
Draw this objects texture to the window
- Parameters
-
| window | pointer to the window to draw to |
◆ draw() [2/2]
| void GridObject::draw |
( |
sf::RenderTexture & |
texture | ) |
|
Draw this objects texture to the rendertexture
- Parameters
-
| texture | pointer to the texture to draw to |
◆ getName()
| std::string GridObject::getName |
( |
| ) |
|
- Returns
- the name of this gridobject
◆ getPosition()
| sf::Vector2f GridObject::getPosition |
( |
| ) |
|
- Returns
- the position of this object
◆ getType()
| std::string GridObject::getType |
( |
| ) |
|
- Returns
- the type of this gridobject
◆ setPosition()
| void GridObject::setPosition |
( |
sf::Vector2f |
position | ) |
|
Set the position of this object
- Parameters
-
| position | the position to set this object to |
The documentation for this class was generated from the following files:
- /home/user/ITCS3112-MapGenerator/include/GridObject.h
- /home/user/ITCS3112-MapGenerator/src/GridObject.cpp


Back
Contact
Photos
Home
a collection of photographs
×
flowers outside the notre dame
Place de la Concord
sunset on the seine
doggo spotted in Bergen, Norway
old stavanger
MY MOTHER
Along the vidden trail in Bergen, Norway
sunset high above paris
old stavanger
Luxembourg Gardens in Paris
z o e
NYC skyline
bryggen, bergen
Eiffel Tower
preikestolen, norway
ponchos at zhangjiajie
gates at the palace of versailles
Sacré-Cœur, paris
sunset at long branch, nj
near the sacre coeur
a rainy evening in bergen, norway
norway landscape as seen through a train window
near tianmen, china
my hedgehog, pip
quickchek balloon festival
dumbo, manhattan
orchid gardens at duke farms
Mt. Floyen funicular
views from a car ferry
gardens of versailles
cruise stop near flam
view out of the louvre clock
overlooking bergen, norway


Millie Bobby Brown Opens Up About Bullying During the UN's Summit For World Children's Day
Millie Bobby Brown takes the podium for her speech during the UN Summit To Demand Rights For Every Child On World Children’s Day on Wednesday (November 20) in New York City.
The 15-year-old actress gave a speech about her experience of being bullied during the annual event.
The summit coincides with 30th anniversary of the adoption of the Convention on the Rights of the Child, the most widely ratified human rights treaty in history.
“I’m proud to add my voice to all those around the world who are asking for solutions to today’s problems such as bullying, access to education, mental health awareness, suicide prevention and climate change,” Millie shared. “In world capitals, in buildings like this, adults talk about children’s rights. But today, young people don’t want to be talked about. They want to do the talking. In the words of one young person: “Be an active voice. Don’t let things go unnoticed.”
She continued, “So today, I want to talk about an issue that is very personal to me. Something that so often goes unnoticed – but causes real suffering. Bullying. Like David [Beckham], I’ve been very lucky in my life. I take nothing for granted. But I also know what it feels like to be vulnerable. At school, I was bullied by a group of students. I remember feeling helpless. School used to be a safe place. Now I was scared to go.”
“I was lucky. With the help of my friends, family and people around me, I was able to overcome these negative feelings and take my power back. But millions of children aren’t so lucky. They’re still struggling in the darkness. Wrestling with fear. With insecurity. Bullying and online threats are never harmless. Never just words. It puts children’s mental health at risk. It causes stress. And in the most extreme cases, and in areas around the world where conflict and violence are daily threats, it can lead to self-harm. Sickness. And even suicide.”
Millie adds, “In my role as Goodwill Ambassador, I will continue talking about this issue wherever I go. Every one of you here today can be the loudspeaker that turns our voices into real change. Into policies, programmes, laws and investments that keep children safe. That makes our world a better, healthier, stronger place for all.”


--- layout: post title: Episode 037 | Mads Kristensen - Just Ship link: http://traffic.libsyn.com/developeronfire/DeveloperOnFire-37-MadsKristensen.mp3 length: 52428800 speaker: Dave Rael duration: '55:29' subtitle: 'Developer On Fire: Mads Kristensen' guest_name: Mads Kristensen image: /assets/images/MadsKristensen.jpg guest_blog: http://madskristensen.net/ guest_twitter: mkristensen disqus_url: http://developeronfire.com/Podcast/Episodes/mads-kristensen-just-ship episode_number: 37 book_recommendations: - { url: "http://www.amazon.com/dp/0974514047/?tag=devonfir-20", title: "Ship it! A Practical Guide to Successful Software Projects", author: "Jared Richardson and William A. Gwaltney"} tags: - { url: "http://www.amazon.com/dp/0974514047/?tag=devonfir-20", title: "Ship it! A Practical Guide to Successful Software Projects", author: "Jared Richardson and William A. Gwaltney"} redirect_from: - "/37/" - "/037/" - "/0037/" - "/mads-kristensen-just-ship/" - "/Mads-Kristensen/" - "/MadsKristensen/" - "/Podcast/Episodes/37/" - "/Podcast/Episodes/037/" - "/Podcast/Episodes/0037/" - "/Podcast/Episodes/mads-kristensen-just-ship/" - "/Podcast/Episodes/Mads-Kristensen/" - "/Podcast/Episodes/MadsKristensen/" guid: http://developeronfire.com:80/Podcast/Episodes/mads-kristensen-just-ship ---
Mads Kristensen is a Sr. Program Manager on the Web Platforms & Tools team at Microsoft working on the web developer experiences of Visual Studio. He has over a decade of experience in developing web applications on the Microsoft platform which got him the honor of becoming both an ASP.NET MVP and ASPInsider. Mads is also the creator of BlogEngine.NET, MiniBlog, Web Developer Checklist and Web Essentials.
1. Hammock Driven Development - take a walk
2. Be your own customer
3. Do open source (and polish the documentation as soon as possible)


Im sure you've heard, multiple times, in recent months about the concept of Net Neutrality. I wanted to use this blog post to give a brief overview of what Net Neutrality is, what it entails, and why I am supportive of it.
This concept essentially says that the Internet should be "open", meaning that internet providers should not choose the content and web-sites that you are allowed to visit, or that are available to you.
In my opinion, the Internet should be a space where its users can promote innovation, creativity, and lawfully visit any site they want. Internet providers have become very competitive in the last decade leading to very focused and specific goals by each company. This allows for the unequal treatment of internet traffic by these providers based on the content which they deem to be most useful or valuable. An example of this may be cable companies slowing down users' access to Netflix as to promote their television services. Net neutrality lowers the barriers to entry for online entrepreneurs, and promotes the creation of new online services and entitites.
Personally, having grown up in the generation which has been so profoundly centered around technology, it is unnerving for me that companies may have a stranglehold on the Internet, and I hope that more legislation is passed to protect this thing that has become so ingrained in our every day lives.
Thanks for reading,
Vineet Rastogi


Warren 4 is an independent consultancy dedicated to helping companies and individuals get true value out of information management technology.
Finding and implementing an engineering document management system or CDE (Common Data Environmen...
Engineering Information Management is a specialist area of document and information management re...
From initial gathering of requirements to the specification of the solution, test strategies,oper...


I am doing my PhD in Computer Vision and Machine Learning at the University of Florida. My research deals with developing 3D imaging and object detection for High Density, High Occlusion Printed Circuit boards.
Develop CV Algorithms.
Develop 3D Photogrammetry using a robotic arm. Design and build system to perform object detection in high density, high occlusion scenario.
Built autonomous vehicles and algorithms for intelligent detection and Navigation.
Worked with grading, developing lectures and curicullum for courses in Signals and Systems, Digital Signal Processing and Image Processing.
Worked and trained on Java, and SQL. Worked in the Banking and Finance Vertical of Cognizant
GPA: 3.78
GPA: 3.78
GPA: 8.25
Apart from Research and development. I enjoy cooking and would call myself a very good cook. I have recently found a liking for travel, hikes and little adventures.
When free, I love to watch sci-fi and fantasy movies and TV shows. I also enjoy reading books and love the touch and feel of books, compared to the more 'modern' devices. I also like to play video games, especially open ended, procedurally generated ones like Minecraft, Terraria etc. Especially enjoy FromSoft games such as DarkSouls.


{% include head.html %}
I like to build things. I am a self-taught developer and Computer Science student at the University of Pittsburgh. I taught myself HTML, CSS, some JavaScript, but I also know a little Python, Java, and Ruby. I am currently enrolled at Free Code Camp and Treehouse focusing on full-stack web development.
Community College work-study
Assembled a panel of editors to review submissions to the Wildwood Journal. Reviewed submissions sent in by students and oversaw editors selections for the journal. Made final decision on acceptance of piece into the journal while also making the budget for cover, layout, and distribution. Submitted budget to Student Government for approval. Unpaid position
Assisted the librarians with assigning library cards, taking fees, and shelving books. Put out materials for upcoming events and catalogued books.
WiCS (Women in Computer Science member)
Transfer Student
Transfer Student
Very simple tribute page built for Free Code Camp's Beginning front-end projects. Uses HTML, Bootstrap, and jQuery.
Built a Random Quote Generator with Bootstrap, HTML, CSS, jQuery and using a random quote API from Random Quotes on Design. I built this for Free Code Camp's Intermediate front-end projects.
Front-end and backend JavaScript. Learning Node, React, Angular, and vanilla JavaScript. Implementing ES6 in my projects slowly.
The main Object-Oriented Programming language of colleges across the country. Learning to use Java on the backend of enterprise sites.
While I ask for help any time I need it, I am also self-motivated.
Intermediate understanding of Git version control system. Familiar with GitHub and Git, mostly.
Was a finalist for the Community College of Allegheny County's Ambassador program. Only a select number of students are asked to join after being interviewed. I was invited to join but since I was transferring the next semester, I was unable to participate as I needed to give them a full year of my time. Must have a 3.0 GPA or higher to join.
Made the Dean's List at Harrisburg Area Community College for two years in a row, posting a 4.0 GPA for three semesters straight.
We were broken up into teams/neighborhoods serving underprivileged families in the Pittsburgh area. We do anything from getting people signed up for the Pittsburgh Comic-Con to handing out books at bus stops in the Hill District, a poverty-stricken, crime ridden area. It was a five-hour a month commitment. I was part of the East LOCAL Team.
Joined just recently to grow my professional network and get involved with local events.
Was asked to join to get better acquainted with the college and the people in the College of General Studies. Have joined and will be starting this fall.
References available upon request.


AgillaA Mobile Agent Middleware for Wireless Sensor Networks Download | Documentation | Examples | Publications | Related Work |
Agilla is a middleware for wireless sensor networks (WSNs) that provides a mobile-agent style of programming. Agilla applications consist of mobile agents that can proactively migrate their code and state across the network. Mobile agents offer more flexibility by allowing applications to control the way they spread. They can position themselves in the optimal locations for performing application-specific tasks. They can save energy by bringing computation to the data rather than requiring that the data be sent over unreliable wireless links to the location containing the computation. They can increase the utility of a WSN by constraining themselves to the specific locales that are relevant to their application's requirements (in contrast to spreading throughout an entire network), and sharing the resources of a single node, i.e., multiple mobile agents can reside on each WSN node. Other systems like Deluge and Maté allow in-network reprogramming. Agilla, however, allows programs to control where they go and to maintain both their code and state across migrations.
Since new agents can be injected into a pre-existing network, the network can be re-tasked. Since each agent executes autonomously and multiple agents can simultaneously run on a node, multiple applications can co-exist. Since mobile agents can move and clone, they can quickly morph an application's installation base to handle unexpected changes in an environment. There are many other inherent advantages of using mobile agents, especially in a wireless sensor network.
However, there are also many challenges, the foremost being the lack of resources and an unreliable network. Agilla is the first mobile agent middleware for WSNs that is implemented entirely in TinyOS. It has been tested on Mica2, MicaZ, and Tmote Sky motes. It hides complexities associated with developing WSN applications, and provides mechanisms that overcome the challenges associated with limited resources and unreliable network communication. It demonstrates the feasibility of using mobile agents within WSNs and, furthermore, takes the first steps towards identifying a minimal set of primitives that should be provided for facilitating highly flexible WSN applications.
There are many applications of mobile agents in WSNs. Three include intruder detection, wildfire tracking, and cargo tracking. In intruder detection, detection agents are deployed around the perimeter of a WSN. When an intruder breaches a perimeter, the agents near the breach follow the intruder and clone themselves to form a perimeter around the intruder. Note that only the nodes next to the intruder are involved with tracking process. All other nodes are free to service other applications. In wildfire tracking, as shown in Figure 1, mobile agents swarm around a fire forming a perimeter, and dynamically adjusts it based on the movements of the fire. The algorithm for adjusting the perimeter is distributed, ensuring scalability. In cargo tracking, a multi-hop WSN is deployed on cargo containers. Each container has a mote that contains an electronic manifest. These motes differ from RFID tags in that they can perform computation, such as monitoring sensors for intrusions or contract violations. When a ship docks, agents are deployed onto the ship's WSN. These agents scour the cargo containers identifying those that contain specific items or require inspection. Mobile agents are necessary in this case since the port authorities do not trust the code of foreign origin. In addition, changing security levels and policies require a flexible software infrastructure that mobile agents provide.
| Figure 1: Wild fire tracking.  The clone transforms itself into a fire tracking agent that repeatedly clones itself until a perimeter has been formed. Once formed, the agents continuously adjust the perimeter by migrating and cloning themselves. (2) A notification is sent to a fire fighter notifying him of the fire's location. (3) The fire fighter injects a guidance agent into the network that leads the fire fighter along a safe route to the fire. |
Most WSNs are inflexible application-specific systems; they are closed-systems that provide a limited set of services for a specific pre-determined set of users. As WSNs mature and motes become more sophisticated, large-scale WSNs consisting of thousands of nodes that span vast geographic areas will be deployed for longer periods of time. The large scale of these networks will inevitably lead to them being shared by multiple users, possibly simultaneously. These users are transient; they may come and go, sporadically using the network whenever and wherever they need to. The long deployment intervals ensure that the application requirements will change mid-deployment. The existing software infrastructure for WSNs does not provide the flexibility necessary for supporting these large-scale WSNs.
Presently, most WSNs are programmed prior to deployment and, once deployed, can only be tweaked through a static set of pre-defined parameters, severely limiting the WSNs flexibility. The network is limited to run a single application, which, as WSNs are deployed for longer intervals, becomes increasingly unacceptable. Also, the application itself may not be able to adapt to unpredictable changes in user requirements; it's simply not possible for software developers to foresee all possible uses of a WSN prior deployment. This is especially so as WSNs become larger, more sophisticated, deployed for longer periods of time, and over larger areas.
TinyOS includes Deluge, a system that enables in-network reprogramming. Deluge allows a user to install a new ROM image on a node wirelessly. It allows targeted deployment in which a new image is installed on a specific node in a WSN, or flooding, which which every node in the WSN is re-programmed with the new image. Since the entire program image is transferred, reprogramming a network is a slow and energy-consuming process. It cannot be done frequently due to lack of power and wireless bandwidth. Also, since the images are flooded, the network can only run one application at a time. One benefit of using Deluge, however, is that it reprograms a network using native code. This means the new application can be optimized for the specific platform and, thus, run more efficiently.
Another approach to increasing WSN flexibility is through a virtual machine that facilitates the distribution of interpreted code. One example of such a system for TinyOS-based networks is Maté. Maté programs are implemented as a set of capsules of various types. Each type of capsule performs a specific function, e.g., run-once, run-periodically, send-message, receive message, or function calls. The virtual machine supports a static set of capsules, which limits the number of capsules of a particular type that a developer can use. The capsule contains a sequence of instructions and a version number. Whenever a new capsule is injected, Maté epidemically spreads it throughout the WSN. Like Deluge, Maté only supports one application at a time. It does not allow fine-grain control over where new capsules are propagated, nor does it allow the capsules to carry state, e.g., a stack or program counter, as it is spread throughout a network.
The Agilla middleware architecture is shown in Figure 2. Agilla runs on top of TinyOS and allows multiple agents to execute on each node. The number of agents is variable and is determined primarily by the amount of memory available. Each agent is autonomous, but shares middleware resources with other agents in the system. Agilla provides two fundamental resources on each node: a neighbor list and a tuple space. The neighbor list contains the addresses of neighboring nodes. This is necessary for agents to decide where they want to move or clone to next. The tuple space provides an elegant decoupled-style of communication between agents. It is a shared memory architecture that is addressed by field-matching rather than memory addresses. A tuple is a sequence of typed data objects that is inserted into the tuple space. The tuple is remains in the tuple space even if the agent that inserted it dies or moves away. Later, another agent may retrieve the tuple by issuing a query for a tuple with the same sequence of fields. Note that tuple spaces decouples the sending agent from the receiving agent: they do not have to be co-located, or even aware of each other's existence, for them to communicate.
| Figure 2: The Agilla Middleware Architecture |
There are several challenges with developing Agilla. First, sensor network nodes have limited computational resources. For example, the MICA2 motes we use have a mere 128KB of instruction and 4KB of data memory. They also have a relatively slow 8MHz Atmel 128 microprocessor. Second, the wireless connectivity between motes is highly unreliable and provides very little bandwidth (38.4 Kbaud). Mobile agents are particularly susceptible to message loss because it interferes with the agent's ability to migrate and clone. Third, the Agilla primitives must be carefully tailored to address and/or take advantage of the salient properties of sensor network applications. For example, one property of sensor networks is that they place a greater emphasis on spatial properties. This is because taking sensor measurements without knowing from where the measurements are comming from is meaningless. In designing Agilla, we must recognize these properties and tailor Agilla's primitives accordingly.
| Figure 3: The Agilla agent architecture |
Agilla provides a stack-based architecture for each agent, as shown in in Figure 3. This reduces overhead by allowing most instructions to be one byte. To allow inter-agent communication, Agilla maintains a tuple space on each node that is shared by all agents residing on the node, and is accessible remotely. By interacting through a tuple space, each agent remains autonomous, decoupled both spatially and temporally. To minimize the impact of message loss, agents are divided into tiny packets (< 41 bytes), are migrated a single hop at a time, and utilize timeouts and retransmits. Since this hop-by-hop process introduces a significant amount of store-and-forward delay, it is only used while migrating or cloning agents, not for remote tuple space operations. Remote tuple space operations are non-blocking, preventing an agent from deadlocking due to message loss. In recognition of the importance of spatial data within sensor networks, Agilla addresses nodes by their location. All remote operations take a location as a parameter. For example, instead of cloning to a node with id=1, an agent would clone to a node at location (1,1). By tailoring Agilla's primitives to sensor networks, Agilla provides a foundation for rapidly developing applications for WSNs with unprecedented levels of flexibility.
| Figure 4: Location-Based addressing allows agents to intelligently navigate the sensor network. |
This work is primarily being conducted by Chien-Liang Fok a doctoral student in the Department of Computer Science at Washington University in St. Louis. His advisors are Gruia-Catalin Roman and Chenyang Lu.
The term "Agilla" is a play on words. Agilla's implementation is based on Bombilla, the TinyOS implementation of Maté. Agilla is, thus, a combination of the terms "Agile" and "Bombilla."
This page was last updated on April 7, 2008 5:14 PM by Chien-Liang Fok.


Community
Free
Maximize your Ionic Development Process
- The #1 Open Source app Framework
- Unlimited Public Apps
- Share your app with a small group of testers
- Live update to a single environment
Gets Started
Get Started
Professional
$1999/dev /yr
Supercharge your team's workflow
- All Community Features plus
- Rapid prototyping with Creator Pro
- Unlimited testing accounts with Ionic View
- Unlimited Private Apps
- Development, Staging, and Productions live deploy channels
- Unlimited custom deploy channels for A/B testing
- Unlimited Cloud Builds
- Custom Cordova Plugin support for Cloud Builds
I'm interested
I'm interested


Parklands mark first stage in Bentley 360 project
by Staff WriterTHE first stage of one of WA’s biggest urban infill developments project has been completed and will be open to the public tomorrow.
Northern Parklands in Bentley will officially be opened from 1pm with workshops, performances, activities and food trucks.
The 12-hectare parklands, a temporary mix of recreational areas for the community, is part of the Bentley 360 development project being constructed at the demolished Brownlie Towers site.
About 32.5 million kilograms of steel, concrete, brick, subgrade and soil, which represented 98 per cent of the debris resulting from the towers’ demolition, was recycled and repurposed.
Some of the materials were used by contractors Landscape Elements to deliver the Northern Parklands.
Victoria Park MLA Ben Wyatt said the parklands were designed in close consultation with local schoolchildren.
“The landscaping plans were developed with the help of students and teachers from Bentley Primary School and Santa Clara Primary School to ensure the community’s wishes were reflected in the design,” he said.
This included innovative upcycling of hard items for shade structures, seating and basketball hoops, through to the milling of ill-health trees into benches and the re-use of footpath slabs and other heavy infrastructure for kerbing, footpaths and bike track.
The recreation area, designed to maximise opportunities for people with disability, also includes nature-based play equipment, a running track, public art, community amenities, an outdoor classroom and specialised lighting.
The facilities will remain in place while the broader Bentley 360 development is delivered over the coming 10 to 15 years.
Housing Minister Peter Tinley said the Northern Parklands marked the second milestone for the Bentley 360 project, following the demolition of Brownlie Towers in June.
“The Bentley 360 project will deliver at least 1,500 new homes over a 15 to 20-year time frame,” he said.
“It is expected to create and support more than 2,200 jobs across the course of development and inject an estimated $1.08 billion into WA’s economy.”
The main entrance to the parklands for tomorrow’s event is via Taree Street, just off Walpole Street.
More news


Welcomer
Add Bot
Server List
Top Guilds
Leaderboards
Docs
Support Server
Dashboard is WIP
It doesn't just welcome!
Welcomer doesn't just welcome, it also does many other things bringing convienience to your server!
Invite Welcomer


This is the Readme doc for Ministers Under the Influence¶ ↑
It describes the system dependencies and how to set up the project
Dependencies¶ ↑
-
Ruby version at least 2.2.2, it was developed in Ruby 2.3.1
-
Postgresql
Setup¶ ↑
Ideally you should have RVM (Ruby Version Manager) set up, this will recognise two files in the root directory
-
.ruby-version
-
.ruby-gemset
and prompt you to build the correct version of Ruby. It'll go and get the files it needs and install everything for you. To get RVM onto your system go to (rvm.io/rvm/install) and follow the instructions
If you're using system Ruby, in say a Vagrant box then you'll have to get the right version and install it yourself.
Once you've done that cd into the rails root directory. If you're using RVM cd-ing into the directory will create an RVM configuration.
Then run these commands
gem install bundler
That installs a utility to bundle the gems (Ruby shared libraries) together for the project
bundle
That calls the utility, which reads a file of dependencies, Gemfile, and goes to get the gems from rubygems.org and Github
Once that's done you're nearly ready to create the database and set up the data structure.
-
You need to let Rails know what username and password to use to connect to your Postgresl database. Assuming you've set up a user with permission to create databases. Go to {Rails Root}/config, copy database.yml.example to database.yml and edit as required.
-
Also within the /config directly copy secrets.yml.example to secrets.yml and add your own secrets. You can get new secrets by typing
rake secret
on the command line
Once you've got database.yml and secrets.yml in place and configured then run
rails db:create:all
This will create the databases for each Rails environment, development, test, staging and producion. As you'll be using development and test these are the only ones you need to be concerned with.
Then run
rails db:migrate
This will set up the tables in the development database
Then run
rake
This will copy the data structure into the test database and run the tests. This runs the Rspec specs, you'll see a few pending tests, ignore those. Then it runs Cucumber smoke test to see that the basic web site it working. Running the Cucumber smoke test might fail if
-
You're running inside Vagrant
-
You don't have Firefox configured on your system
If Rspec specs pass then ignore the Cucumber failures and run
rails db:seed
This will seed the development database with data extracted from some of the ministerial meetings csv files.
And finally type
rails s
This will start up Rails on port 3000 so go to localhost:3000, or {ip-address of the vagrant box}:3000


THE EMPEROR AND THE ASSASSIN (JING KE CI QIN WANG)
Reviewed by Harvey Karten Sony Pictures Classics Director: Chen Kaige Writer: Chen Kaige, Piegong Wang Cast: Gong Li, Zhang Fengyi, Li Xuejian, Zhiwen Wang, Kaige Chen, Xiaohe Lu, Haifeng Ding, Benshan Zhao, Changjiang Pan, Xun Zhou
There is no one so insufferable as a reformed smoker or a rehabilitated alcoholic. He becomes an immovable force, a man consumed with a lust for changing the bad habits of others. The assassin in Chen Kaige's sumptuous feast of a movie, Jing Ke (Zhang Fengyi), is a hit man who has killed many people for money. Now, customarily in areas of China during the Third Century B.C., an assassin would be hired to wipe out an entire family. When in the process of doing just this, something happens that causes Jing to think about a career change. He becomes appalled with the idea of taking human lives and consequently furious at those who do so, whether they be contract killers or heads of government who lead their people to war.
This theme is just one of the elements of the complex, multi-plotted drama, "The Emperor and the Assassin," which is said to be the most expensive film ever produced in Asia. Its cost of $15 million might be considered chump change in Hollywood, but given the hundreds of disciplined extras involved in the lively and gory battle scenes, the money raised from sources like Taiwan, Japan, and a consortium in Europe was well spent. Considering the lavish banquet for the eyes, does the movie--by the director of the erotic and exquisite "Farewell, My Concubine"--pass muster as drama? Alas, only partly. For while director Chen Kaige appears influenced by Shakespearean histories and in particular by Akira Kurusawa's epic film "Ran," the romance between his leading lady and the titled assassin and between the woman and the emperor seem more influenced by Plato than by Eros. What's more, the staging is so diffuse that we often lose sight of the central focus, which should be on the characters in the ancient romantic triangle while we try to follow the Machiavellian machinations of some very ambitious people.
Based on actual historical documents from the Third Century B.C., at a time that Hannibal was preparing for war against far-away Rome, "The Emperor and the Assassin" pits two dogmatic forces against each other. The Emperor of Qin, Ying Zheng (Li Xuejian), has been mandated by his ancestors and by heaven (he thinks) to unite the seven kingdoms of China under his rule. China was divided into seven dominant kingdoms: Qin, Han, Qu, Wei, Zhao, Qi, and Yan, with Ying concentrating his attention on Han, Zhao and Yan. To drum up a pretext for invading Yan, he has his lover, Lady Zhao (the great Gong Li), travel to Yan to hire an assassin, who would journey to Qin. When the plot to eliminate the emperor is uncovered, the emperor would be free to invade Yan, gaining the untroubled backing of his own people and of some of the kingdoms to the south. But the killer had become sickened when a pretty, blind teen commits suicide just after a wipe-out of her family, and becomes devoted to destroying people who remain like the former Jing.  The plot is complicated by an attempted coup at the hands of the previously smiling Marquis Changxin (Wang Zhiwen), who serves the emperor graciously and subserviently.
The 161-minute movie is divided into two parts so diverse that you could cut the story with a sword. The more involving segment is a series of beautifully staged battles involving hundreds of warriors on both sides. They attack with shields in mechanical discipline like the soldiers of modern computerized video games and, in fact, could have been refugees from movies like "Robocop" and the latest of the Jean-Claude Van Damme series. Defenders atop their castles ply their attackers with stones while the assaulters, in one pulse-racing incident, roll what resembles a huge bowling ball into the castle door, breaking it down like a SWAT team from the LAPD. Some of these segments are so boldly filmed that if Kurusawa were alive today, he'd be influenced mightily. Chen Kaige uses state-of-the-art technology in filming his campaigns but for some puzzling reason did not shoot the work with wide-screen lensing.
When the time comes to make love and not war, you'd think that this movie and the 1993 "Farewell, My Concubine" were directed by two different people. "Concubine," which also featured the wonderful and gorgeous Gong Li, was also about a Chinese warlord period, but there the focus is squarely on the pugnacious 52-year relationship of two male childhood apprentices in the Peking Opera. By contrast, when Chen focuses here on his three principals, we long to return quickly to battle. You'd never know that Lady Zhao and Jing had fallen deeply in love, though the way Chinese showed their emotions before the first millennium might explain this in part. Nor are we convinced when the emperor begs his great love not to leave him, recalling their childhood days when, both hungry and cold, they romped happily in the haystacks. If the dialogue seems pedestrian (even though the performers often speak their lines with effectively stentorian and highly stylized timbre) live with the translator. Still, since the long movie never really drags despite its flaws, "The Emperor and the Assassin," makes for a solid spectacle that would cater to an audience that might find the also lavish "Anna and the King" too dated and too tame.
Not Rated. Running Time: 161 minutes. (C) 1999 Harvey Karten<EMAIL_ADDRESS>The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Bodhidharma performed the great service of spreading the form of meditation he practiced to China, which, over time, has spread across the world. This form of meditation, now generally associated with Zen Buddhism, focuses on realizing that all of the phenomena in existence came into being due to the activity of the mind, and that the way to achieve “Noble Wisdom” is by transcending the mind.
When Bodhidharma named Hui Ke his successor, he gave him his copy of the Lankavatāra Sutra and told him that everything he needed to know was in that text. One message that appears repeatedly in the Lankavatāra is this same point that true spiritual attainment is achieved by transcending the mind.
Mahāmati, I do not teach anything approaching the discrimination of the philosophers. For what reason? Because there are no external objects, there is nothing to get attached to; when one abides in Mind-only, beyond which there is no external world, dualism ceases; as there is no realm of form based on discrimination, one comes to recognize that there is nothing but what is seen of the Mind itself; and for these reasons the discrimination of what is seen of the Mind itself does not take place. Owing to the cessation of discrimination, one enters into the triple emancipation where is the state of no-form, emptiness, and effortlessness. Hence it is called deliverance.- Lankāvatāra Sutra
The true meaning of Zen is what lies at the heart of every spiritual tradition: the discovery of what we really are. Investigating our own existence by investigating the mind is, in the opinion of the author, not only the most fascinating subject in the world, but also the most rewarding, for it leads to liberation from suffering and that which everyone seeks: permanent happiness. Suffering arises from the mind, so freedom from the mind and its habit energies naturally leads to freedom from suffering. No fancy rituals or special trinkets are needed for this investigation; all that is required is to carry out the practice.
While Bodhidharma is credited with sparking the spread of this Mind-only approach in East Asia, he was not the first to teach it. Indeed, Bodhidharma was simply spreading the teachings of the Buddha, whose teachings on the mind are well documented in Buddhist sutras. Even before the lifetime of Shakyamuni Buddha, deep investigation of the mind was practiced. There are particularly strong parallels between Bodhidharma’s Mind-only approach and the Advaita Vedanta tradition. Consider these quotes from the Ribhu Gita, one part of the Shiva Rahasya Purana:
The total discarding of the mind is alone victory, achievement, bliss, yoga, wisdom and liberation. The sacrifice of the mind is, in fact, the totality of all sacred sacrifices.- Ch.15, v.7
All worlds and creatures are only thought forms. They are nothing but the mind, which is a bundle of thoughts, which again are nothing more than ripples in the still ocean of Awareness-Self, and certainly nothing apart from that Self. Therefore, one should abide in the firm conviction that all objects are only I Am Self-Brahman.- Ch.22, v.24
In more recent times, the great Sage Ramana Maharshi (1879 - 1950) expounded the virtues of investigating the mind:
Your business is to know the nature of the mind. Then you will know that there is no mind.
The ultimate truth is so simple, it is nothing more than being in one's natural original state (aware of your awareness). It is a great wonder that to teach such a simple truth, a number of religions should be necessary, and so many disputes should go on between them as to which is the God-ordained teaching. What a pity! Just be the Self (conscious of your consciousness), that is all.
Investigate the nature of the mind (thoughts) and it will disappear. Because of the emergence of thought, you surmise that it has an origin and call that the mind. When you inquire to see what it is, you find there is really no such thing as mind. When the mind has thus vanished, you realize eternal Peace (awareness of awareness).
There are no doubt examples to be found in many other sources, but these are sources that the author is more familiar with and are sufficient to get the point across.
It should be noted that, while Bodhidharma is known for the Mind-only approach in meditation, this does not mean he promoted a dry, secular approach to cultivation. Indeed, various spiritual traditions assert that the practice of investigating the mind is the quickest way to return to the Divine, not simply a means of strengthening one’s personal mind. Bodhidharma himself was most certainly a living bodhisattva - a being that has reached enlightenment but postpones final, complete enlightenment in order to stay in the phenomenal realm helping others. Reaching such a heightened state of existence is not achieved merely by strengthening the mind, but by transcending the mind.
So the method of Bodhidharma is to see things as they truly are; to investigate the mind and discover that it is ultimately empty. When the mind is made still and quiet, our true self, our Buddha nature, can shine.


Luton v Leeds Live Streaming – How to watch from Kenilworth Road this afternoon
by Lewis JonesSaturday afternoon football is back as Leeds take on Luton, plus Preston face Derby & West Brom take on Sheff Wed – here’s how you can watch the games from 15:00 today.
How Can I Watch Luton v Leeds Live Streaming
What Channel is the Leeds Match on?
- The match can be watched with Bet365 online. The action kicks off at 15:00 at Kenilworth Road.
Where is the Luton v Leeds Utd Game being played?
- The match is being played at Kenilworth Road, Luton, England
Is Luton v Leeds on Sky?
The match is not shown live in the UK on Sky.
Leeds United will be looking to extend their unbeaten league run to six games when they travel to Luton on Saturday.
Bielsa’s side won back to back home games before the international break to keep them within touching distance of top spot, but the same problems remain.
They dominated from start to finish against Blackburn, but failed to put the game to bed wasting a number of golden chances. And it’s their inability to kill teams off that could come back to bite them once again.
Luton are struggling.
They’ve lost four games on the bounce and sit just one point above the drop zone.
Going forward they’ve looked good, in fact they’ve scored more goals than Saturday’s opponents Leeds, but it’s at the other end of the pitch were they look really poor.
Only QPR and rock bottom Barnsley have a worse defensive record than the Hatters.
Leeds have conceded just nine goals so far this season and they’re 17/10 to win to nil.
Patrick Bamford ended his goal scoring drought by bagging the opener against Blackburn and he’s 7/2 to open the scoring.
Luton’s biggest threat will be James Collins who has five goals to his name so far this season and he’s 16/5 to add to his tally on Saturday.
Leeds have won three of their last four meetings with the Hatters by a 1-0 scoreline and it’s 15/2 for the same outcome this weekend.
Desperate for a win Luton are as big as 11/2 in places, the draw is 7/2 and Leeds are 1/2 to bag all three points and keep up the pressure on the teams above them.
Live Stream Terms & Conditions
- To use the Live Streaming service you will need to be logged in and have a funded account or to have placed a bet in the last 24 hours.
- Any fixture/event on our website which has the Play or Video icon next to it is scheduled to be shown via Live Streaming.
- Watch and bet geo restrictions apply – funded account required & bet must have placed a bet in the last 24 hours to qualify to access streams. 18+ Begambleaware


February 2 THE PRESENTATION OF THE LORD
The
feast was first observed in the Eastern Church as “The Encounter”. In the sixth
century, it began to be observed in the West: in
ENTRANCE ANTIPHON
Your merciful love, O God, we ponder in the midst of your temple. Your praise, O God, like your name, reaches the ends of the earth; your right hand is filled with saving justice.
The GLORIA is said.  Who lives and reigns for ever and ever.
Preface of the Presentation of the Lord
COMMUNION ANTIPHON
My eyes have seen your salvation, which you prepared in the sight of all the peoples.
PRAYER AFTER COMMUNION
By these holy
gifts which we have received, O Lord, bring your grace to perfection within us,
and, as you fulfilled Simeon’s expectation that he would not see death until he
had been privileged to welcome the Christ, so may we, going forth to meet the
Lord, obtain the gift of eternal life. Through Christ our Lord.


WITNESS LIST Corrections Committee May 20, 2003-8:30A SB 1093 For: Blazey, Dayna (Self) Underwood, Olen (Self) On: Taylor, Allison (Council on Sex Offender Treatment) Registering, but not testifying: On: DeBottis, Gina (Special Prosecution Unit Chief Prosecutor) SB 1678 On: Garrett, Gerald (TX Board of Pardons & Paroles) Place, Allen (Texas Criminal Defense Laywers Assn.) Registering, but not testifying: For: Jobiln, Elizabeth (Texas Inmate Families Association) SB 1834 For: Underwood, Olen (Self) Registering, but not testifying: On: DeBottis, Gina (Special Prosecution Unit Chief Prosecutor)


The climatological fields from the PlioMIP pre-industrial experiments are used to predict a modern AIS, which can be compared with the Bedmap2 reconstruction 39. We use forcing fields from each of the seven PlioMIP climate models to run simulations with three ISMs, producing an ensemble of 21 control simulations. Whilst there is some consistency across the ISMs in the prediction of the grounded extent of the modern ice-sheet, especially over the EAIS (Fig. 2), there are considerable differences in the predictions of the extent of the WAIS and also the ice-shelves.
Simulated modern ice-sheets. Predicted modern ice-sheet surface height (m) and ice-shelf thickness (m) when using the climatological forcing fields from the PlioMIP climate models. Initial modern (Bedmap2) ice-sheet is shown in the top left for ref. 39. Note that ice-shelves are only simulated by the ANICE and SICOPOLIS ISMs
A visual comparison of the simulated modern ice-sheets highlights some GCM–ISM combinations that result in a poor reconstruction of the present day ice-sheet. The final simulated modern AIS grounded ice volume varies considerably between the models (23.64 × 10 6–37.36 × 10 6 km 3), and is generally larger than the Bedmap2 reconstruction (26.54 × 10 6 km 3; volume difference between Bedmap2 and ISM predictions equates to a difference in sea level of between +6.3 m s.e. and −25.3 m s.e. (metres of sea level equivalent); ref. 39; Fig. 3). In order that we only consider GCM–ISM combinations that provide a reasonable representation of the modern AIS in our Pliocene analysis, we developed performance criteria to assess predictions of the modern AIS, whilst also comparing our results to the Bedmap2 AIS reconstruction (see Methods and Supplementary Note 1). This leads to the removal of MRI-CGCM2.3 and MIROC4m from the Pliocene analysis. Whilst it is beyond the scope of the current study to fully investigate the potential reasons for a volumetrically divergent prediction of the present-day AIS, we examine the likely climate forcings driving this (see Supplementary Note 2).
Summary of ice-sheet predictions. a, e, i Ice-sheet presence prediction for each of the climate scenarios (as a percentage of the total ensemble members). Also shown is the middle ( b, f, j), smallest ( c, g, k) and largest ( d, h, l) ice-sheet configuration (surface height (m) and ice-shelf thickness (m)). Middle is the 5th ranking ice volume from the list of 10 SIA-SSA model results. Results from the control simulations of MIROC4m and MRI-CGCM2.3 are not included in this figure to allow better comparison between the presented scenarios
It should be noted that the control simulations presented here were not tuned to give an optimal representation of the AIS using the different climate forcing fields and each ISM used only one set-up for each experiment (see Methods). This was done in order to allow for the assessment of model dependency of the results (without having to take into consideration the impact of potentially different ISM parameter value choices). We have shown that five out of the seven GCMs lead to a reasonable representation of present-day Antarctica. This gives us confidence when using the same model set-up to assess the climate model dependency of mid-Pliocene Antarctic simulations. For clarity, we have excluded two of the GCM–ISM combinations from our Pliocene analysis, however, the results from these GCM–ISMs are shown in Supplementary Figs. 11 to 13.


--- layout: default ---
Simple and modern design for publishing blog posts, documentation and many more things about your project. You can now clone and start to create a website for your project like this one.
Jekyll is a simple, blog-aware, static site generator. It takes a template directory containing raw text files in various formats, runs it through a converter (like Markdown) and our Liquid renderer, and spits out a complete, ready-to-publish static website suitable for serving with your favorite web server. Jekyll also happens to be the engine behind GitHub Pages, which means you can use Jekyll to host your project’s page, blog, or website from GitHub’s servers for free.
Get started by cloning source into GitHub account of your project. Thanks to GitHub Pages,
it will be automatically compiled and published under your account's (or organisation's) subdomain under github.io
.
This template uses bootstrap-sass along with Bootwatch themes. You can change the theme or write your custom one by overwriting bootstrap sass variables for a different color set, font options, etc.
Leverage from Git version control system by maintaining your documentation along with the source code; publish the page when you merge to the master branch.


| 2018 ~ now | Master's degree, Computer Science and Information Engineering, National Taiwan University, Taipei |
| 2015 ~ 2018 | Bachelor's degree, Computer Science and Information Engineering, National Cheng Kung University, Tainan |
| 2014 ~ 2015 | Engineering Science, National Cheng Kung University, Tainan |
| 2012 ~ 2014 | Senior high school, National Feng Hsin Senior High School, Kaohsiung |
| 2016 ~ 2017 | Outstanding Student For the Academic Achievement, National Cheng Kung University, Tainan |
| 2014 ~ 2015 | Outstanding Student For the Academic Achievement, National Cheng Kung University, Tainan |
| 2015 | 傑出獎 in English Proficiency Test (大一英文會考), National Cheng Kung University, Tainan |
| 2014 ~ 2015 | 甲等獎(Top 10%) in Academic Calculus Exam (全校微積分競試), National Cheng Kung University, Tainan |
| 2014 | 傑出獎 in English Proficiency Test (大一英文會考), National Cheng Kung University, Tainan |
| 2017 |
軟體創作達人暑期成長營 入圍決賽 (12/30隊) (與台南市政府資訊中心合作參賽) 台灣設計展 App- 以台南市政府 Beacon 應用為例 |
| 2016 | Class, Microprocessor Principles and Applications (微算機原理與應用課程) 期末系館布置專題「聽雨」 |
| 2015 | Lecturer(授課講師) in school winter camp, Scratch創意遊戲設計營, Shengli Elementary School, Tainan |