The alias of PIXI.blendModes.ADD.
The alias of PIXI.blendModes.MULTIPLY.
The alias of PIXI.blendModes.NORMAL.
The alias of PIXI.blendModes.SCREEN.
The height of the window display area.
The width of the window display area.
The total frame count of the game screen.
The height of the game screen.
The zoom scale of the game screen.
The width of the game screen.
Calls pixi.js garbage collector
Checks whether the browser can play the specified video type.
The video type to test support for
True if the browser can play the specified video type
Checks whether the canvas blend mode 'difference' is supported.
True if the canvas blend mode 'difference' is supported
Checks whether the canvas blend mode 'saturation' is supported.
True if the canvas blend mode 'saturation' is supported
Erases the "Now Loading" image.
Checks whether the current browser supports WebGL.
True if the current browser supports WebGL.
Hides the FPSMeter element.
Initializes the graphics system.
The width of the game screen
The height of the game screen
The type of the renderer. 'canvas', 'webgl', or 'auto'.
Checks whether the font file is loaded.
The face name of the font
True if the font file is loaded
Checks whether the specified point is inside the game canvas area.
The x coordinate on the canvas area
The y coordinate on the canvas area
True if the specified point is inside the game canvas area
Checks whether the video is playing.
True if the video is playing
Checks whether the renderer type is WebGL.
True if the renderer type is WebGL
Loads a font file.
The face name of the font
The url of the font file
Converts an x coordinate on the page to the corresponding x coordinate on the canvas area.
The x coordinate on the page to be converted
The x coordinate on the canvas area
Converts a y coordinate on the page to the corresponding y coordinate on the canvas area.
The y coordinate on the page to be converted
The y coordinate on the canvas area
Starts playback of a video.
Displays the error text to the screen.
The name of the error
The message of the error
Renders the stage to the game screen.
The stage object to be rendered
Sets the source of the "Now Loading" image.
Shows the FPSMeter element.
Initializes the counter for displaying the "Now Loading" image.
Marks the end of each frame for FPSMeter.
Marks the beginning of each frame for FPSMeter.
Increments the loading counter and displays the "Now Loading" image if necessary.
Generated using TypeDoc
The static class that carries out graphics processing.


{% extends "../opensauceapp/base.html" %} {% block content %}
Your username and password didn't match. Please try again.
Your account doesn't have access to this page. To proceed, please login with an account that has access.
Please login to see this page.


[gecode-users] users Digest, Vol 124, Issue 6
Christian Schulte
cschulte at kth.se
Mon Feb 1 21:32:02 CET 2016
Hi Juan Carlos,
I think the “solution” suggested by me was a little bit too elegant, in fact it is buggy and that’s why you experience segfaults… Reminds of an Einstein quote: Everything should be made as simple as possible, but not simpler.
The problem is as follows: variables in Gecode belong to just one space and they are deleted when the space is deleted. However in the constrain() function a new propagator is created with both variables from the *this space as well as from the space for the so-far best solution b. Now what can happen is that b might already be deleted while *this is still alive: hence the access to variables which are already did and kaboom: segfault!
The problem is easy to fix, though: when the constrain() function is called you create new variables, one for each variable from b, but now in *this! The variables in b must be assigned, so creating new variables in *this must happen with the variables assigned to the value of the respective variable in b.
The code should look this, roughly:
IntVarArgs bo(*this, mycpSolver.objectives.size(), Int::Limits::min, Int::Limits::max);
for (int i=0; i< mycpSolver.objectives.size(), i++)
rel(*this, bo[i], IRT_EQ, mycpSolver.objectives[i].val());
rel(*this, objectives, IRT_LE, bo);
Sorry for not thinking about this in the first place. I’ll add a tip and a warning in MPG.
Cheers
Christian
--
Christian Schulte, <http://www.gecode.org/~schulte> www.gecode.org/~schulte
Professor of Computer Science, KTH, <mailto:cschulte at kth.se> cschulte at kth.se
Expert Researcher, SICS, <mailto:cschulte at sics.se> cschulte at sics.se
From: Juan Carlos Hernandez [mailto:jchernandez.madrid at gmail.com]
Sent: Monday, February 1, 2016 06:25 PM
To: Christian Schulte <cschulte at kth.se>
Cc: Alexander Schiendorfer <alexander.schiendorfer at informatik.uni-augsburg.de>; users at gecode.org
Subject: Re: [gecode-users] users Digest, Vol 124, Issue 6
Dear Alex and Christian,
thanks a lot! A very elegant solution - it works well, but I am now battling with two problems
1. I get a segmentation fault when I try to run it in parallel mode (say, using 8 threads). The error happens irregularly, but more often when I increase the thread count. Here is what my constrain function looks like for a maximization problem
virtual void constrain(const Space& _b){
const cpSolver& mycpSolver = static_cast<const cpSolver&>(_b);
rel(*this, objectives, IRT_GR, mycpSolver.objectives);
}
Since this does not really look like the other examples in the Gecode manual, I guess that it is not correct. But I was unable to come up with any other solution that rel would accept (that is, for which there is a matching version of rel).
2. Ideally, I would like to have more than two objectives and have the search to first try to maximize the first objective, then the second, etc. But I do not manage, not matter which variable selection rule I use. Typically, I get a little advancement in the first objective (say, it goes from 0 to 1, and perhaps to two), and then the search makes progress on the third or fourth objective in order.
Thanks,
JC
2016-01-29 12:15 GMT+01:00 Christian Schulte <cschulte at kth.se <mailto:cschulte at kth.se> >:
Alex is spot on here: but let me expand a little.
You might have used the cost() member function for B&B. However the cost()
member function is just implemented in terms of the constrain() member
function. So what I would do is the following:
- Have a integer variable array cost containing the two cost variables you
have in mind.
- implement a constrain(const Space& _b) member function: _b refers to the
so-far best solution. Cast this to your script type, say b. Then this just
posts
rel(*this, cost, IRT_LQ, b.cost);
This enforces that this->cost is lexicographically smaller then the so
far best cost b.cost.
That's it. More on the constrain() function you can find in Chapter 2 of
MPG.
Cheers
Christian
--
Christian Schulte, www.gecode.org/~schulte <http://www.gecode.org/~schulte>
Professor of Computer Science, KTH, cschulte at kth.se <mailto:cschulte at kth.se>
Expert Researcher, SICS, cschulte at sics.se <mailto:cschulte at sics.se>
-----Original Message-----
From: users-bounces at gecode.org <mailto:users-bounces at gecode.org> [mailto:users-bounces at gecode.org <mailto:users-bounces at gecode.org> ] On Behalf
Of Alexander Schiendorfer
Sent: Friday, January 29, 2016 12:06 PM
To: users at gecode.org <mailto:users at gecode.org>
Subject: Re: [gecode-users] users Digest, Vol 124, Issue 6
Hi Juan,
it seems to me that you're searching for lexicographic branch-and-bound.
There is a global constraint lex_lesseq that you might want to consider for
posting in the constrain method of a Space.
Cheers,
Alex
On 29.01.2016 12:00, users-request at gecode.org <mailto:users-request at gecode.org> wrote:
> Send users mailing list submissions to
> users at gecode.org <mailto:users at gecode.org>
>
> To subscribe or unsubscribe via the World Wide Web, visit
> http://www.gecode.org/cgi-bin/mailman/listinfo/users
> or, via email, send a message with subject or body 'help' to
> users-request at gecode.org <mailto:users-request at gecode.org>
>
> You can reach the person managing the list at
> users-owner at gecode.org <mailto:users-owner at gecode.org>
>
> When replying, please edit your Subject line so it is more specific
> than "Re: Contents of users digest..."
>
>
> Today's Topics:
>
> 1. Best way to implement multi-criterion optimization in Gecode?
> (Juan Carlos Hernandez)
>
>
> ----------------------------------------------------------------------
>
> Message: 1
> Date: Thu, 28 Jan 2016 12:30:54 +0100
> From: Juan Carlos Hernandez <jchernandez.madrid at gmail.com <mailto:jchernandez.madrid at gmail.com> >
> To: users at gecode.org <mailto:users at gecode.org>
> Subject: [gecode-users] Best way to implement multi-criterion
> optimization in Gecode?
> Message-ID:
> <CAFd=f3EAU+XPqJo02KPT9SWibPjxkifw-F2so-4mE+x4Kv7Q5A at mail.gmail.com <mailto:f3EAU%2BXPqJo02KPT9SWibPjxkifw-F2so-4mE%2Bx4Kv7Q5A at mail.gmail.com> >
> Content-Type: text/plain; charset="utf-8"
>
> Hi everyone,
>
>
> I am trying to use Gecode to solve a multi-criterion problem
>
>
> minimize (F1(x,z), F2(x,z) )
>
> subject to constraints on x,z
>
>
> The objectives are ordered in order of importance, so I would like to
> first solve the problem P1
>
>
> minimize F1(x,z)
>
> subject to original constraints on x,z
>
>
> and then consider the modified problem P2
>
>
> minimize F2(x,z)
>
> subject to original constraints on x,z
>
> F1(x,z) = F1opt
>
>
> where F1opt is the optimal value of P1.
>
>
> What is the most efficient way to implement this in Gecode?
>
>
>
> I am now doing two completely separate searches, in the sense that I
> create a new Space and run BAB on it for each of the problems. I am
> sure that this cannot be the most efficient way of dealing with the
> problem, but am unable to figure out how to do it "the right way".
> Essentially, when solving P2 I should be able to make use of the work done
while solving P1...
>
>
> Any feedback is very much appreciated!
>
>
> Thanks,
>
> JC
> -------------- next part -------------- An HTML attachment was
> scrubbed...
> URL:
> <http://www.gecode.org/pipermail/users/attachments/20160128/06e6ff75/a
> ttachment-0001.html>
>
> ------------------------------
>
> _______________________________________________
> Gecode users mailing list
> users at gecode.org <mailto:users at gecode.org>
> https://www.gecode.org/mailman/listinfo/gecode-users
>
>
> End of users Digest, Vol 124, Issue 6
> *************************************
--
Alexander Schiendorfer, M.Sc.
Institute for Software & Systems Engineering Raum 3043, Gebäude N
Universität Augsburg
Web:
http://www.informatik.uni-augsburg.de/lehrstuehle/swt/se/staff/aschiendorfer
/
Tel.: +49 (821) 598 - 2196 <tel:%2B49%20%28821%29%20598%20-%202196>
E-Mail: alexander.schiendorfer at informatik.uni-augsburg.de <mailto:alexander.schiendorfer at informatik.uni-augsburg.de>
_______________________________________________
Gecode users mailing list
users at gecode.org <mailto:users at gecode.org>
https://www.gecode.org/mailman/listinfo/gecode-users
_______________________________________________
Gecode users mailing list
users at gecode.org <mailto:users at gecode.org>
https://www.gecode.org/mailman/listinfo/gecode-users
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.gecode.org/pipermail/users/attachments/20160201/1f6492b6/attachment-0001.html>
More information about the users
mailing list


Deep Q-Network for the Snake Game
Description
This page loads a trained Deep Q-Network (DQN) and use it to play the snake game. The training is done in Node.js using tfjs-node. See train.js.
Algorithm
A DQN is trained to estimate the value of actions given the current game state. The DQN is a 2D convolutional network. See dqn.js. The epsilon-greedy algorithm is used to balance exploration and exploitation during training.


Custom Types¶
This section explains how to deal with a data type or a binary coding that bitstream does not support natively: how to define bitstream writer and reader functions and register them so that your custom types behave like native ones.
>>> import sys
>>> import bitstream
>>> from bitstream import BitStream
We use the example of representation of unsigned integers as binary numbers; out of the box, bitstream only supports unsigned integers of fixed size (refer to Built-in Types / Integers for details).
Definition¶
For every type of data that we want bitstream to support, we need to specify at least one writer function that encodes the data as a bitstream and one reader function that decodes data out of bitstreams.
The signature of writers is
def writer(stream, data)
where
-
stream
is aBitStream
instance, -
the type of
data
is writer-dependent.
A writer is totally free to specify what is a valid data
,
but it is sensible to accept:
-
instances of a reference data type (or some of these instances),
-
data that can be safely converted to the reference data type,
-
sequences (lists, arrays, etc.) of the reference type (or assimilated).
A writer should raise an exception (ValueError
or TypeError
)
when the data is invalid.
To write unsigned integers as binary numbers for example,
we can consider as valid anything any non-negative integer-like
data (defined as anything that the constructor int
accepts)
as well as lists of such data.
>>> def write_uint(stream, data):
... if isinstance(data, list):
... for integer in data:
... write_uint(stream, integer)
... else:
... integer = int(data)
... if integer < 0:
... error = "negative integers cannot be encoded"
... raise ValueError(error)
... bools = []
... while integer:
... bools.append(integer & 1)
... integer = integer >> 1
... bools.reverse()
... stream.write(bools, bool)
This writer behaves as expected:
>>> stream = BitStream()
>>> write_uint(stream, 42)
>>> stream
101010
>>> write_uint(stream, [1, 2, 3])
>>> stream
10101011011
>>> write_uint(stream, -1)
Traceback (most recent call last):
...
ValueError: negative integers cannot be encoded
>>> write_uint(stream, {}) # doctest: +ELLIPSIS
Traceback (most recent call last):
...
TypeError: int() argument must be ..., not 'dict'
The signature of readers is:
def reader(stream, n=None)
where
-
stream
is aBitStream
instance, -
n
is a non-negative integer (orNone
).
The call read(stream, n)
should read n
data items
out of stream
when n
is an integer.
However, bitstream does not require a specific type of container
(list, array, string, etc.), the choice is all yours;
for consistency however, you should pick a type of container
that your writer supports.
The semantics of call read(stream)
(when n=None
) is up to you;
for most of built-in types, it returns a single (unboxed) datum of
the stream but there are sometimes good reasons to decide otherwise
(see for example strings).
The support for this default case is not mandatory.
Actually, readers may support only a subset of the possible values of n
;
for example they may allow only n=1
and n=None
.
If a reader is called with an invalid value of n
,
a ValueError
or TypeError
exception should be raised.
If instead the read
fails because there is not enough
data in the stream or more generally if the binary data
cannot be decoded, a ReadError
(from bitstream
) should
be raised.
When we represent unsigned integers as binary numbers,
while we can write multiple integers in the same stream,
we cannot read unambiguously multiple integers from the
stream: the code is not self-delimiting.
For example 110
can be split as 1
then 10
and code for the integers 1
and 2
but also
as 11
and 0
which represent the integers 3
and 0
.
Thus, we design a reader that reads the whole stream as a single
integer: we support only the cases n=1
and for convenience the default n=None
with the same result.
A possible implementation of this reader is:
>>> def read_uint(stream, n=None):
... if n is not None and not n == 1:
... error = "unsupported argument n = {0!r}".format(n)
... raise ValueError(error)
... else:
... integer = 0
... for _ in range(len(stream)):
... integer = integer << 1
... if stream.read(bool):
... integer += 1
... return integer
It behaves as expected:
>>> stream = BitStream()
>>> write_uint(stream, 42)
>>> read_uint(stream)
42
>>> write_uint(stream, [1, 2, 3])
>>> read_uint(stream)
27
>>> len(stream)
0
>>> write_uint(stream, 42)
>>> read_uint(stream, 1)
42
>>> write_uint(stream, 42)
>>> read_uint(stream, 2)
Traceback (most recent call last):
...
ValueError: unsupported argument n = 2
Registration¶
To fully integrate unsigned integers into bitstream, you need to associate a unique type identifier to the reader and/or writer, This type identifier is usually a type; a user-defined type with an empty definition will do:
>>> class uint(object):
... pass
Once the type uint
has been associated to the unsigned integer writer
>>> bitstream.register(uint, writer=write_uint)
we can use the write
method of BitStream
to encode unsigned integers
>>> stream = BitStream()
>>> stream.write(42, uint)
>>> stream
101010
>>> stream = BitStream()
>>> stream.write([2, 2, 2], uint)
>>> stream
101010
and also the shorter former using the BitStream
constructor
>>> BitStream(42, uint)
101010
>>> BitStream([2, 2, 2], uint)
101010
Once the reader is registered
>>> bitstream.register(uint, reader=read_uint)
we can also use the read
method of BitStream
:
>>> BitStream(42, uint).read(uint)
42
Here, the uint
type was merely an identifier for our reader and writer,
but "real" types can be used too. If you write some data whose type is
the type identifier of a writer, you don't need to specify explicitly the
type identifier in writes.
For example, if we also associate our writer with Python integers:
>>> bitstream.register(int, writer=write_uint)
>>> if sys.version_info[0] == 2: # Python 2 has a 'long integer' type
... bitstream.register(long, writer=write_uint)
then every Python integer will be automatically encoded with
the write_uint
writer
>>> BitStream(42)
101010
>>> BitStream([2, 2, 2])
101010
Factories¶
The coding of arbitrary unsigned integers as binary numbers doesn't allow us to represent unambiguously multiple numbers in a stream. However, if there is a known bound on the integers we use, we can assign a sufficient numbers of bits to each integer, pad the binary numbers with enough zeros of the left to use the same number of bits and this code is self-delimiting.
However, to do that, we would have to define and register a new writer for every possible number of bits. Instead, we may register a single but configurable writer, defined by a writer factory.
Let's define a type identifier factory uint
whose instances
hold a number of bits:
>>> class uint(object):
... def __init__(self, num_bits):
... self.num_bits = num_bits
Then, we define a writer factory: given an instance of uint
,
it returns a stream writer:
>>> def write_uint_factory(instance):
... num_bits = instance.num_bits
... def write_uint(stream, data):
... if isinstance(data, list):
... for integer in data:
... write_uint(stream, integer)
... else:
... integer = int(data)
... if integer < 0:
... error = "negative integers cannot be encoded"
... raise ValueError(error)
... bools = []
... for _ in range(num_bits):
... bools.append(integer & 1)
... integer = integer >> 1
... bools.reverse()
... stream.write(bools, bool)
... return write_uint
Finally, we register this writer factory with bitstream
:
>>> bitstream.register(uint, writer=write_uint_factory)
To select a writer, we use the appropriate type identifier:
>>> BitStream(255, uint(8))
11111111
>>> BitStream(255, uint(16))
0000000011111111
>>> BitStream(42, uint(8))
00101010
>>> BitStream(0, uint(16))
0000000000000000
The definition of a reader factory is similar:
>>> def read_uint_factory(instance):
... num_bits = instance.num_bits
... def read_uint(stream, n=None):
... if n is None:
... integer = 0
... for _ in range(num_bits):
... integer = integer << 1
... if stream.read(bool):
... integer += 1
... return integer
... else:
... integers = [read_uint(stream) for _ in range(n)]
... return integers
... return read_uint
Once the reader factory is registered
>>> bitstream.register(uint, reader=read_uint_factory)
we can use the family of type identifiers in reads too:
>>> stream = BitStream([0, 1, 2, 3, 4], uint(8))
>>> stream.read(uint(8))
0
>>> stream.read(uint(8), 1)
[1]
>>> stream.read(uint(8), 3)
[2, 3, 4]


Library AtomSet
Require Import AdditionalTactics.
Require Import Atom.
Require Import FSetWeak.
Require Import FSetWeakDecide.
Require Import FSetWeakNotin.
Require Import ListFacts.
We use our implementation of atoms to obtain an implementation of
finite sets of atoms. We give the resulting type an intuitive
name, as well as import names of set operations for use within
this library.
Module Import AtomSetImpl := FSetWeakList.Make AtomImpl.
Definition atoms := AtomSetImpl.t.
From our implementation of finite sets of atoms, we can
instantiate the decision procedures for solving facts about such
finite sets.
Module AtomSetDecide := FSetWeakDecide.Decide AtomSetImpl.
Ltac atomsetdec := AtomSetDecide.fsetdec.
Module AtomSetNotin := FSetWeakNotin.Notin AtomSetImpl.
Ltac simpl_notin_hyps := AtomSetNotin.simpl_notin_hyps.
Ltac solve_atomset_notin := AtomSetNotin.solve_notin.
Given the
atomsetdec
tactic, we typically do not need to refer
to specific lemmas about finite sets. However, instantiating the
FSetWeakFacts.Facts
functor makes a number of setoid rewrites
available. These rewrites are crucial to developments since they
allow us to replace a set with an extensionally equal set (see the
Equal
relation on finite sets) in propositions about finite
sets.
Module AtomSetProperties := FSetWeakFacts.Facts AtomSetImpl.
We can generate an atom fresh for any given finite set of
atoms.
Lemma atom_fresh_for_set : forall L : atoms, { x : atom | ~ In x L }.
The auxiliary tactic
simplify_list_of_atom_sets
takes a list of
finite sets of atoms and unions everything together, returning the
resulting single finite set. It's rarely used by itself; see the
example below. The tactic does assume that L
, after
simplification using simpl
, is built using only nil
and
cons
. This is the case when used following the pattern
below.
Ltac simplify_list_of_atom_sets L :=
ltac_fold_and_simpl AtomSetImpl.union AtomSetImpl.empty L.
The tactic
(pick fresh Y for L)
takes a finite set of atoms L
and a fresh name Y
, and adds to the context an atom with name
Y
and a proof that (~ In Y L)
, i.e., that Y
is fresh for
L
. The tactic will fail if Y
is already declared in the
context.
Tactic Notation "pick" "fresh" ident(Y) "for" constr(L) :=
let Fr := fresh "Fr" in
(destruct (atom_fresh_for_set L) as [Y Fr]).
The
We first define a tactic that gathers the atoms in the current context and returns them as a finite set. We repeatedly invoke the tactic
example_pick_fresh
tactic below illustrates the general
pattern for collecting together atoms in a context and picking an
atom fresh for them.
We first define a tactic that gathers the atoms in the current context and returns them as a finite set. We repeatedly invoke the tactic
ltac_map
, using each time a unary function that
returns a finite set of atoms. The type of the function
determines the hypotheses that are processed. Each invocation
returns a list of finite sets of atoms. We append everything
together and use simplify_list_of_atom_sets
to obtain a single
finite set.
Ltac example_gather_atoms :=
let A := ltac_map (fun x : atoms => x) in
let B := ltac_map (fun x : atom => singleton x) in
simplify_list_of_atom_sets (A ++ B).
Given
example_gather_atoms
, we can implement a specialized
version of "pick fresh
".
Ltac example_pick_fresh Y :=
let L := example_gather_atoms in
pick fresh Y for L.
Finally, we gave a trivial example of using
example_pick_fresh
.
Lemma example_pick_fresh_use : forall (x y z : atom) (L1 L2 L3: atoms), True.
Proof.
intros x y z L1 L2 L3.
example_pick_fresh k.
At this point in the proof, we have a new atom
k
and a
hypothesis Fr : ~ In k (union L1 (union L2 (union L3 (union
(singleton x) (union (singleton y) (union (singleton z)
empty)))))
.
trivial.
Qed.
This page has been generated by coqdoc


If enabled this raid groups information will show up to other raid group members, so they don't have to add it themselves.
They must have added their character in the Characters list and have claimed it as their character.
They will NOT be able to edit this group, but they can see all of the information.
Let's you specify the exact players in your raid group.
Adding members will allow you to share this raid group with them if you choose to, and possibly allow other functionality in the future.


Create New Report
If you need to borrow money:
Add the borrowed value on the income field and call it: "LOAN"
Keep in mind that you have to return them back + interest.
Try to not borrow more then your negative cashflow value.
You should always borrow what you can easily pay from your current income!
If you need to cut expenses:
Just press the red minus button
Try to cut only what you don't really need (i.e. newspaper subscription)
Don't be too harsh on yourself
Cutting expenses is a more healthier way then borrowing money!
Month
Total Income: insert total income array
Total Expenses: insert total expenses array
Cash-flow: insert cash-flow here
Income Source:
Expenses Source:
Warning! You are spending more than you earn!
You have two options: You either cut some expenses or you have to borrow some money!
Remember: Borrowing money to finance your current expenses is not a smart thing to do. You could end up in borrowing other money to pay back the already borrowed money.
Borrow Money
A healthy way is to borrow what you can easily pay from your current income!Cut Expenses
A healthy way to cut expenses is to cut from the variable expenses!There is nothing here yet. You should add your income.
And your expenses.


I
LOVE to
RIDE BIKES
Why???
got 5 mins?
HEALTH:
cycling is good for your body
GREEN:
cycling is good for the environment
FUN:Riding a bike is
FUNRemember the joy of learning?
MONEY:
cycling is far cheaper than any other form of transportation
OUTSIDE:
cycling gets you outside and puts you in direct contact with the elements around you
GEOMETRY:
cycling is for everyone - bikes are sized for all shapes and sizes
SIMPLICITY:
cycling is simple
once you learn, you never forget
TRANSITION:
cycling allows for space and time to shift gears btwn work and home
WANNA TRY?
Bike to Work Week aims to motivate folks to try cycle commuting
You too can join the
SRD cycle team
Bike to Work Week
starts Monday and runs until June 5. This is the year's best shot at trying cycle commuting
There will be
awesome events throughout the week
All events will have prize giveaways of super great bike swag
Not into
Bike to Work ?
- remember -
there's so much
GREAT LOCAL riding in this
REGIONSnowden Forest trails
Beaver Lodge
trails
CCR incorporates long-term bicycle plans into their transportation planning
will Campbell River build a bike park?
there's a BUZZ about BIKE Culture in this community of recent
+ a new brew pub set to open mere steps from our office
REMEMBER:
cycling is best practised with safety in mind.
Do: Wear a helmet - always
Do: Follow the rules of the road
Do: Ensure you use a ROAD WORTHY bike
Do: Always, always err on the side of CAUTION
don't presume cars will give you wide berth or right of way
Do: Consider giving cycle commuting a try - you may find you LOVE IT
you may find it hugely beneficial to your health, mental state, overall being and it may hugely improve your professional productivity
meanwhile, in the
work context...
SRD-GIS has been doing stuff
Portal for ArcGISa local application for
GIS dev enabling internal app dev
Area D Water Infrastructure appshows water network and some fancy stuff
Graphing/Summarizing features
future usage for
asset management
Mobile data collection
tested/used for beach access assessments - Cortes, Quadra, Area D.
Test Results:
SUCCESSesp. useful in remote, rural areas with no cell/WiFi coverage
improved
efficiencies in the field with
mobile devices = more time for lunch in beautiful places
LiDAR
Area D
awesome
Our
topography data went from
this
:
to
this
:
GIS service provision
part of municipal service agreements
- Tahsis
- Sayward soon
StoryMapsa visual
presentation tool and an effective
communication piece
Department Brandinguniversal iconography across web platforms
SRD GIS gravatar
SRD GIS dreams + aspirations:
- Open Data initiatives
- sayonara iMap
- web map dev
- better cadastre
- Open Source GIS
- schedule for Orthophoto acquisition
- UAV: eye candy for tourism/SRD promo + GIS integration
FIN


As you may have heard, Sandra Silvern is being promoted to grade E. I will be taking over as manager of the personal information team.
I look forward to working with you. You have done excellent work lately. You caught us some really juicy subversives this time, and I'm sure your work in the future will be even more fantastic! I actually worked with Kinsinger in the past, you know. All that time I was working with a dangerous terrorist, without suspecting a thing!
I'm sorry you weren't mentioned in the press statement, but that's how these things go. The people on top always get the credit. Don't worry, we all recognize the immense value of your contribution. Without your analysis and recommendations, we might never have caught Mr. Kinsinger. Imagine how much a damage a person like that could have done if he hadn't been caught in time.
In recognition of your success, you will be promoted to grade B. I have given you access to the myCareer section of the website. When you have finished reading your mail, you can start planning your future career. I am sure you will do an amazing job!
Velika Dožić
Managing Consultant / Haka Manager


Are you sure you want to buy this pack ?
Country: {{currentPack.user.country}}
Network: {{currentPack.user.network}}
Amount: {{currentPack.pack.amount}}FCFA
By clicking on Pay you will have 5 hours to make the payment to the number indicated.
After this time, your account will be automatically suspended.


A lightweight HTML5 game engine.
$ npm install playable.js
<script>
IncludeSimply download and include with a script tag. playable
will be registered as a global variable.
<script src="https://cdn.jsdelivr.net/npm/playable.js/dist/playable.min.js"></script>
You can browse the source of the NPM package at cdn.jsdelivr.net/npm/playable.js.
let stage = new playable.Stage();
let text = new playable.Text('Hello playable.js');
stage.addChild(text);
Check out the documentation here.
Generated using TypeDoc


Mouse over elements to simulate user actions.
You should be able to see these coming through real time on the Kibana server.
Also, if you open the JavaScript console, you should see the logs going out.


Your Name
My name is Jackie Song.
I was graduated from USC last year and got my first job.
Email:
<EMAIL_ADDRESS>Github:
claire9501
Twitter:
coming soon
Books
Movies
Games
Pride and Prejudice
I am Dragon
Arena of Valor
My First HTML Bonus


{%extends "watch_course/layouts/base.html"%} {% block title %}{{course_title}} {% endblock %} {% block content %}
Unfortunately we couldn't track your progress as there is no playlist for {{course_title}} at our database so we recommmend you the following course
Start {{course_title}} {% else %}


Nearby users available to meet
Profile
Insert name here
Interests
Insert name here
Interests
Insert name here
Interests
Insert name here
Interests


--- title: Accessibility for Content layout: layout-sidenav category: writers --- {%- include accessibility-common.html -%}
Most accessibility principles can be implemented very easily and will not impact the overall "look and feel" of a web site.
For each web page, provide a short title that describes the page content and distinguishes it from other pages. The page title is often the same as the main heading of the page.
Put the unique and most relevant information first; for example, put the name of the page before the name of the organization. For pages that are part of a multi-step process, include the current step in the page title.
Use short headings to group related paragraphs and clearly describe the sections. Good headings provide an outline of the content.
Write link text so that it describes the content of the link target. Avoid using ambiguous link text, such as 'click here' or 'read more'. Indicate relevant information about the link target, such as document type and size, for example, 'Proposal Documents (RTF, 20MB)'.
For every image, write alternative text that provides the information or function of the image. For purely decorative images, there is no need to write alternative text.
For audio-only content, such a podcast, provide a transcript. For audio and visual content, such as training videos, also provide captions. Include in the transcripts and captions the spoken information and sounds that are important for understanding the content, for example, 'door creaks'. For video transcripts, also include a description of the important visual content, for example 'Athan leaves the room'.
Provide feedback for interactions, such as confirming form submission, alerting the user when something goes wrong, or notifying the user of changes on the page. Instructions should be easy to identify. Important feedback that requires user action should be presented in a prominent style.
Ensure that instructions, guidance, and error messages are clear, easy to understand, and avoid unnecessarily technical language. Describe input requirements, such as date formats. Instructions communicate what information the user should provide. Error indicates what the problem is and, possibly, how to fix it.
Use simple language and formatting, as appropriate for the context.


statsmodels.sandbox.tsa.fftarma.ArmaFft¶
-
class
statsmodels.sandbox.tsa.fftarma.
ArmaFft
(ar, ma, n)[source]¶ fft tools for arma processes
This class contains several methods that are providing the same or similar returns to try out and test different implementations.
Notes
TODO: check whether we don’t want to fix maxlags, and create new instance if maxlag changes. usage for different lengths of timeseries ? or fix frequency and length for fft
check default frequencies w, terminology norw n_or_w
some ffts are currently done without padding with zeros
returns for spectral density methods needs checking, is it always the power spectrum hw*hw.conj()
normalization of the power spectrum, spectral density: not checked yet, for example no variance of underlying process is used
Methods
acf2spdfreq
(acovf[, nfreq, w])not really a method fftar
([n])Fourier transform of AR polynomial, zero-padded at end to n fftarma
([n])Fourier transform of ARMA polynomial, zero-padded at end to n fftma
(n)Fourier transform of MA polynomial, zero-padded at end to n filter
(x)filter a timeseries with the ARMA filter filter2
(x[, pad])filter a time series using fftconvolve3 with ARMA filter invpowerspd
(n)autocovariance from spectral density pad
(maxlag)construct AR and MA polynomials that are zero-padded to a common length padarr
(arr, maxlag[, atend])pad 1d array with zeros at end to have length maxlag plot4
([fig, nobs, nacf, nfreq])spd
(npos)raw spectral density, returns Fourier transform spddirect
(n)power spectral density using padding to length n done by fft spdmapoly
(w[, twosided])ma only, need division for ar, use LagPolynomial spdpoly
(w[, nma])spectral density from MA polynomial representation for ARMA process spdroots
(w)spectral density for frequency using polynomial roots spdroots_
(arroots, maroots, w)spectral density for frequency using polynomial roots spdshift
(n)power spectral density using fftshift Attributes
arroots
Roots of autoregressive lag-polynomial isinvertible
Arma process is invertible if MA roots are outside unit circle isstationary
Arma process is stationary if AR roots are outside unit circle maroots
Roots of moving average lag-polynomial


{% extends "base.html" %} {% block title %}Low Scoring Shows | Show{% endblock %} {% block head %} {{ super ()}} {% endblock head %} {% block breadcrumb %}
{% endblock breadcrumb %} {% block synopsis %}List of shows in which the panel total score is less than 30. The list does not include the 20th Anniversary show that had a unique format for the Lightning Fill-in-the-Blank segment.
{% endblock synopsis %} {% block content %}| Total Score | Show Date | Location | Host | Scorekeeper | Panelists | Guest | |||
|---|---|---|---|---|---|---|---|---|---|
| {{ show.total_score }} | {{ show.date }} | {% if show.location.venue and show.location.city and show.location.city %}{{ show.location.venue }} ({{ show.location.city }}, {{ show.location.state }}) | {% elif show.location.venue and (not show.location.city or not show.location.state) %}{{ show.location.venue }} | {% elif show.location.city %}{{ show.location.city }} | {% else %}{% endif %} | {{ show.host }} | {{ show.scorekeeper }} |
|
{{ show.guest.name }}: {{ show.guest.score }} {% if show.guest.exception %} * {% endif %} |
| Total Score | Show Date | Location | Host | Scorekeeper | Panelists | Guest |


--- layout: post title: Goodbye Tim Pi Home Automation (Taking Home Automation To The Next Level) date: 2017-12-07 21:13:23.000000000 -05:00 type: post published: true status: publish categories: [] tags: [] author: Timothy Lock ---
If you have been following with my recent home automation adventures, you would realize that I essentially automated everything through relays connected to my Raspberry Pi using the CAT5 cables in the wall as wiring to control other parts of my home. Frankly, it was very hacky, messy, and hard to maintain. Any new feature I wanted required me to code something new into the codebase and automation became a matter of hard-coding. It was simply not sustainable and required too much maintenance.
Lucky for me, Black Friday came along and with those came the sales. As home automation becomes more mainstream, the prices go down. In fact, Google went crazy running promotions for their Google Home platform here in Toronto for the past few months (making Alexa's debut in Canada just wash out in the noise). I managed to pick myself up some nice things including a few TPLink Smart WiFi Plug minis, Wemo Smart Light Switches, a Google Home Mini, and a Google Chromecast. The reason I chose these specific smart devices was that I knew they connect to WiFi (without requiring a proprietary bridge) and that they have documented/undocumented APIs that you can use to locally control them. They also play nice with Google Home so if I was ever to get rid of my Pi Home Automation, they would still have a use (outside of their own apps).
So here we are... we have all these new devices that somehow needs to get integrated into the home assistant. Wouldn't it be cool of it could just detect these devices? How much coding would this take? Is it even worth it? Patience and food supplies were running low at this point. All hope was getting lost..... then came Home Assistant!
The platform worked really well, discovering all of my smart home devices as well as android webcams with little configuration required. To top it off, it still allowed me to use my GPIO pins (my DIY switches) as well as my door sensors. A little bonus is that it discovered my Chromecast and Google Home out of the box with the ability to see what is playing, send text for them to speak, and even control the media that is playing on it.
I'm very excited to work with this platform and to take it to its limit. Once I get used to the platform code, I hope to be able to contribute back to this project soon! Let's see how it goes.


Match Number:
Team Number:
Starting Position:
Auto Reach:
Auto Cross:
Auto Low-Goal:
Auto High-Goal:
Auto High-Goal Miss:
Tele Cross:
Tele Low-Goal:
Tele High-Goal:
Tele High-Goal Miss:
Primary Position:
Challenge:
Scale:
No Show:
Dead Robot:
Foul:
Tech Foul:
Yellow Card:
Red Card:


Sorry, the sharer is not available now! (error: XXX)
Please go back, and choose from other optional sharer(s).


I was struggling with this because I was configuring my http_proxy, https_proxy and ftp_proxy using export but when I was doing sudo apt-get udpate, nothing happened. Did some research on StackOverflow and found the solution. So I'm keeping the solution here for future reference. This problem happens because in some releases sudo is configured in such a way that all environment variables all cleared when running the command.
My proxy don't have authentication so I did:
export http_proxy="http://proxy.servername:port/"
export https_proxy="http://proxy.servername:port/"
export ftp_proxy="http://proxy.servername:port/"
After that I did:
visudo
There is a line that states:
Defaults env_reset
After that line just add:
Defaults env_keep = "http_proxy https_proxy ftp_proxy"
Voilá. Things will start working now.


|
|---|
| These things have I spoken unto you, that ye should not be offended.
|
|---|
| ᎾᏍᎩ ᎯᎠ ᏄᏍᏗ ᎢᏨᏃᎮᎮᎸ, ᏗᏦᏕᏍᏗᏱ ᏂᎨᏒᎾ.
|
|---|
Na-s-gi hi-a nu-s-di i-tsv-no-he-he-lv, di-tso-de-s-di-yi ni-ge-sv-na.
|
|---|
|
|---|
| They shall put you out of the synagogues: yea, the time cometh, that whosoever killeth you will think that he doeth God service.
|
|---|
| ᏗᎦᎳᏫᎢᏍᏗᏱ ᏓᏰᏥᏄᎪᏫᏏ; ᎥᎥ, ᏛᏍᏆᎸᎯ, ᎩᎶ ᎢᏥᎯᎮᏍᏗ, ᎤᏁᎳᏅᎯ ᏂᏥᏯᏛᏁᎭ, ᎡᎵᏍᎨᏍᏗ.
|
|---|
Di-ga-la-wi-i-s-di-yi da-ye-tsi-nu-go-wi-si; v-v, dv-s-qua-lv-hi, gi-lo i-tsi-hi-he-s-di, U-ne-la-nv-hi ni-tsi-ya-dv-ne-ha, e-li-s-ge-s-di.
|
|---|
|
|---|
| And these things will they do unto you, because they have not known the Father, nor me.
|
|---|
| ᎾᏍᎩ ᎯᎠ ᎾᎾᏛᏁᎮᏍᏗ ᏅᏗᎦᎵᏍᏙᏗᏍᎨᏍᏗ ᎾᏂᎦᏔᎲᎾ ᎨᏒ ᎠᎦᏴᎵᎨᎢ, ᎠᎴ ᎠᏴ ᏂᎬᎩᎦᏔᎲᎾ ᎨᏒᎢ.
|
|---|
Na-s-gi hi-a na-na-dv-ne-he-s-di nv-di-ga-li-s-do-di-s-ge-s-di na-ni-ga-ta-hv-na ge-sv A-ga-yv-li-ge-i, a-le a-yv ni-gv-gi-ga-ta-hv-na ge-sv-i.
|
|---|
|
|---|
| But these things have I told you, that when the time shall come, ye may remember that I told you of them. And these things I said not unto you at the beginning, because I was with you.
|
|---|
| ᎠᏎᏃ ᎾᏍᎩ ᎯᎠ ᏄᏍᏗ ᎢᏨᏃᎲᏏ, ᎠᏍᏆᎸᎲ ᎢᏣᏅᏓᏗᏍᏗᏱ ᎾᏍᎩ ᎢᏨᏃᏁᎸᎢ. ᎠᎴ ᎥᏝ ᎾᏍᎩ ᎢᎬᏱᏱᏉ ᏱᏨᏃᏁᎴᎢ, ᎢᏧᎳᎭ ᎢᏕᏙᎲ ᏅᏓᎦᎵᏍᏙᏗᏍᎬᎩ.
|
|---|
A-se-no na-s-gi hi-a nu-s-di i-tsv-no-hv-si, a-s-qua-lv-hv i-tsa-nv-da-di-s-di-yi na-s-gi i-tsv-no-ne-lv-i. A-le v-tla na-s-gi i-gv-yi-yi-quo yi-tsv-no-ne-le-i, i-tsu-la-ha i-de-do-hv nv-da-ga-li-s-do-di-s-gv-gi.
|
|---|
|
|---|
| But now I go my way to him that sent me; and none of you asketh me, Whither goest thou?
|
|---|
| ᎿᎭᏉᏃ ᏅᏛᎩᏅᏏᏛ ᏧᏬᎸ ᏫᏥᎦᏘ, ᎥᏝᏃ ᎩᎶ ᏂᎯ ᏂᏣᏛᏅ ᏳᏓᏑᏯ ᏯᏆᏛᏛᎲᏍᎦ, ᎯᎠ ᏱᏂᎦᏪ; ᎭᏢ ᏫᎦᏘ?
|
|---|
Hna-quo-no nv-dv-gi-nv-si-dv tsu-wo-lv wi-tsi-ga-ti, v-tla-no gi-lo ni-hi ni-tsa-dv-nv yu-da-su-ya ya-qua-dv-dv-hv-s-ga, hi-a yi-ni-ga-we; Ha-tlv wi-ga-ti?
|
|---|
|
|---|
| But because I have said these things unto you, sorrow hath filled your heart.
|
|---|
| ᎠᏎᏃ ᎾᏍᎩ ᏂᏨᏪᏎᎸ ᏅᏗᎦᎵᏍᏙᏗᎭ, ᎤᏲ ᎠᏓᏅᏓᏗᏍᏗ ᎨᏒ ᎤᎧᎵᎸ ᎢᏥᎾᏫ.
|
|---|
A-se-no na-s-gi ni-tsv-we-se-lv nv-di-ga-li-s-do-di-ha, u-yo a-da-nv-da-di-s-di ge-sv u-ka-li-lv i-tsi-na-wi.
|
|---|
|
|---|
| Nevertheless I tell you the truth; It is expedient for you that I go away: for if I go not away, the Comforter will not come unto you; but if I depart, I will send him unto you.
|
|---|
| ᎠᏎᏃ ᎤᏙᎯᏳᎯᏯ ᎢᏨᏃᏁᎭ; ᎣᏏᏳ ᎢᏣᎵᏍᏓᏁᏗ ᏨᏓᎨᏏ; ᎢᏳᏰᏃ ᎾᏇᏅᏒᎾ ᏱᎩ, ᎠᏓᏅᏬᎯᏍᏗᏍᎩ ᎥᏝ ᏴᎨᏥᎷᏥᏏ; ᏯᏇᏅᏍᎩᏂ ᏅᏓᏥᏅᏍᏗ ᎨᏎᏍᏗ ᎢᏥᎷᏤᏗᏱ.
|
|---|
A-se-no u-do-hi-yu-hi-ya i-tsv-no-ne-ha; o-si-yu i-tsa-li-s-da-ne-di tsv-da-ge-si; i-yu-ye-no na-que-nv-sv-na yi-gi, a-da-nv-wo-hi-s-di-s-gi v-tla yv-ge-tsi-lu-tsi-si; ya-que-nv-s-gi-ni nv-da-tsi-nv-s-di ge-se-s-di i-tsi-lu-tse-di-yi.
|
|---|
|
|---|
| And when he is come, he will reprove the world of sin, and of righteousness, and of judgment:
|
|---|
| ᎾᏍᎩᏃ ᎦᎷᏨᎭ ᎬᏂᎨᏒ ᏅᏓᎬᏁᎵ ᎡᎶᎯ ᎠᏍᎦᏂ ᎨᏒᎢ, ᎠᎴ ᏚᏳᎪᏛ ᎨᏒᎢ, ᎠᎴ ᏗᎫᎪᏙᏗ ᎨᏒᎢ.
|
|---|
Na-s-gi-no ga-lu-tsv-ha gv-ni-ge-sv nv-da-gv-ne-li e-lo-hi a-s-ga-ni ge-sv-i, a-le du-yu-go-dv ge-sv-i, a-le di-gu-go-do-di ge-sv-i.
|
|---|
|
|---|
| Of sin, because they believe not on me;
|
|---|
| ᎠᏍᎦᏂ ᎨᏒᎢ, ᏂᎬᏉᎯᏳᎲᏍᎬᎾ ᎨᏒ ᎢᏳᏍᏗ;
|
|---|
A-s-ga-ni ge-sv-i, ni-gv-quo-hi-yu-hv-s-gv-na ge-sv i-yu-s-di;
|
|---|
|
|---|
| Of righteousness, because I go to my Father, and ye see me no more;
|
|---|
| ᏚᏳᎪᏛ ᎨᏒᎢ, ᎡᏙᏙᏱ ᏫᏥᎦᏛᎢ, ᎠᎴ ᎿᎭᏉ ᏂᏍᎩᎪᏩᏘᏍᎬᎾ ᎨᏒ ᎢᏳᏍᏗ;
|
|---|
Du-yu-go-dv ge-sv-i, E-do-do-yi wi-tsi-ga-dv-i, a-le hna-quo ni-s-gi-go-wa-ti-s-gv-na ge-sv i-yu-s-di;
|
|---|
|
|---|
| Of judgment, because the prince of this world is judged.
|
|---|
| ᏗᎫᎪᏙᏗ ᎨᏒᎢ, ᎤᎬᏫᏳᎯ ᎯᎠ ᎡᎶᎯ ᎤᏤᎵᎦ ᏣᎫᎪᏓᏁᏗ ᎨᏒ ᎢᏳᏍᏗ.
|
|---|
Di-gu-go-do-di ge-sv-i, u-gv-wi-yu-hi hi-a e-lo-hi u-tse-li-ga tsa-gu-go-da-ne-di ge-sv i-yu-s-di.
|
|---|
|
|---|
| I have yet many things to say unto you, but ye cannot bear them now.
|
|---|
| ᎠᏏ ᎤᏣᏔ ᎠᎩᎷᎳ ᎪᎱᏍᏗ ᎢᏨᏃᏁᏗ, ᎠᏎᏃ ᎪᎯ ᎨᏒ ᎥᏝ ᏰᎵ ᎾᏍᎩ ᎨᏣᏛᎪᏗ ᏱᎩ;
|
|---|
A-si u-tsa-ta a-gi-lu-la go-hu-s-di i-tsv-no-ne-di, a-se-no go-hi ge-sv v-tla ye-li na-s-gi ge-tsa-dv-go-di yi-gi;
|
|---|
|
|---|
| Howbeit when he, the Spirit of truth, is come, he will guide you into all truth: for he shall not speak of himself; but whatsoever he shall hear, that shall he speak: and he will shew you things to come.
|
|---|
| ᎦᎷᏨᎭᏍᎩᏂ ᎾᏍᎩ Ꮎ ᎦᏰᎪᎩ ᏂᎨᏒᎾ ᎠᏓᏅᏙ, ᏂᎦᎥ ᎤᏙᎯᏳᎯ ᎨᏒ ᏙᏓᏣᏘᏂᏙᎵ, ᎥᏝᏰᏃ ᎤᏩᏒᏉ ᎤᏓᏅᏖᏛ ᏱᎧᏁᎨᏍᏗ, ᏂᎦᎥᏍᎩᏂ ᎠᏛᎩᏍᎨᏍᏗ ᎾᏍᎩ ᎧᏁᎨᏍᏗ; ᎠᎴ ᏓᏥᎾᏄᎪᏫᏎᎵ ᏧᏓᎴᏅᏛ ᎣᏂ ᎢᏳᎵᏍᏔᏂᏓᏍᏗ ᎨᏒᎢ.
|
|---|
Ga-lu-tsv-ha-s-gi-ni na-s-gi na ga-ye-go-gi ni-ge-sv-na A-da-nv-do, ni-ga-v u-do-hi-yu-hi ge-sv do-da-tsa-ti-ni-do-li, v-tla-ye-no u-wa-sv-quo u-da-nv-te-dv yi-ka-ne-ge-s-di, ni-ga-v-s-gi-ni a-dv-gi-s-ge-s-di na-s-gi ka-ne-ge-s-di; A-le da-tsi-na-nu-go-wi-se-li tsu-da-le-nv-dv o-ni i-yu-li-s-ta-ni-da-s-di ge-sv-i.
|
|---|
|
|---|
| He shall glorify me: for he shall receive of mine, and shall shew it unto you.
|
|---|
| ᎾᏍᎩ ᏛᎩᎸᏉᏔᏂ ᎠᏴ, ᎠᏆᏤᎵᏰᏃ ᎨᏒ ᏛᎩᏏ ᎠᎴ ᏓᏥᎾᏄᎪᏫᏎᎵ.
|
|---|
Na-s-gi dv-gi-lv-quo-ta-ni a-yv, a-qua-tse-li-ye-no ge-sv dv-gi-si a-le da-tsi-na-nu-go-wi-se-li.
|
|---|
|
|---|
| All things that the Father hath are mine: therefore said I, that he shall take of mine, and shall shew it unto you.
|
|---|
| ᏂᎦᎥ ᎠᎦᏴᎵᎨ ᎤᎲ ᎠᏆᏤᎵᎦ, ᎾᏍᎩ ᎢᏳᏍᏗ ᎯᎠ ᏥᏂᏥᏫ, ᎠᏆᏤᎵᎦ ᎨᏒ ᏛᎩᏏ ᎠᎴ ᏓᏥᎾᏄᎪᏫᏎᎵ.
|
|---|
Ni-ga-v A-ga-yv-li-ge u-hv a-qua-tse-li-ga, na-s-gi i-yu-s-di hi-a tsi-ni-tsi-wi, a-qua-tse-li-ga ge-sv dv-gi-si a-le da-tsi-na-nu-go-wi-se-li.
|
|---|
|
|---|
| A little while, and ye shall not see me: and again, a little while, and ye shall see me, because I go to the Father.
|
|---|
| ᏂᎪᎯᎸᎾᏉ ᎿᎭᏉ ᎥᏝ ᏱᏍᎩᎪᏩᏘᏍᎨᏍᏗ; ᎠᎴ ᎿᎭᏉ ᏔᎵᏁ ᏂᎪᎯᎸᎾᏉ ᎢᏍᎩᎪᏩᏘᏍᎨᏍᏗ; ᏅᏗᎦᎵᏍᏙᏗᎭ ᎠᎦᏴᎵᎨᏍᏛᏱ ᏫᏥᎦᏛᎢ.
|
|---|
Ni-go-hi-lv-na-quo hna-quo v-tla yi-s-gi-go-wa-ti-s-ge-s-di; a-le hna-quo ta-li-ne ni-go-hi-lv-na-quo i-s-gi-go-wa-ti-s-ge-s-di; nv-di-ga-li-s-do-di-ha A-ga-yv-li-ge-s-dv-yi wi-tsi-ga-dv-i.
|
|---|
|
|---|
| Then said some of his disciples among themselves, What is this that he saith unto us, A little while, and ye shall not see me: and again, a little while, and ye shall see me: and, Because I go to the Father?
|
|---|
| ᎿᎭᏉᏃ ᎢᎦᏛ ᎬᏩᏍᏓᏩᏗᏙᎯ ᎯᎠ ᏂᏚᎾᏓᏪᏎᎸᎩ; ᎦᏙ ᎦᏛᎦ ᎯᎠ ᏥᏂᎩᏪᏎᎭ; ᏂᎪᎯᎸᎾᏉ ᎿᎭᏉ ᎥᏝ ᏱᏍᎩᎪᏩᏘᏍᎨᏍᏗ, ᎠᎴ ᎿᎭᏉ ᏔᎵᏁ ᏂᎪᎯᎸᎾᏉ ᎢᏍᎩᎪᏩᏘᏍᎨᏍᏗ? ᎠᎴ ᏅᏗᎦᎵᏍᏙᏗᎭ ᎠᎦᏴᎵᎨᏍᏛᏱ ᏫᏥᎦᏛᎢ?
|
|---|
Hna-quo-no i-ga-dv gv-wa-s-da-wa-di-do-hi hi-a ni-du-na-da-we-se-lv-gi; Ga-do ga-dv-ga hi-a tsi-ni-gi-we-se-ha; Ni-go-hi-lv-na-quo hna-quo v-tla yi-s-gi-go-wa-ti-s-ge-s-di, a-le hna-quo ta-li-ne ni-go-hi-lv-na-quo i-s-gi-go-wa-ti-s-ge-s-di? a-le Nv-di-ga-li-s-do-di-ha A-ga-yv-li-ge-s-dv-yi wi-tsi-ga-dv-i?
|
|---|
|
|---|
| They said therefore, What is this that he saith, A little while? we cannot tell what he saith.
|
|---|
| ᎾᏍᎩ ᎢᏳᏍᏗ ᎯᎠ ᏄᏂᏪᏒᎩ, ᎦᏙ ᎦᏛᎦ ᏂᎪᎯᎸᎾᏉ ᏣᏗᎭ? ᎥᏝ ᏲᏦᎵᎦ ᏄᏍᏛ ᎦᏛᎬᎢ.
|
|---|
Na-s-gi i-yu-s-di hi-a nu-ni-we-sv-gi, Ga-do ga-dv-ga Ni-go-hi-lv-na-quo tsa-di-ha? V-tla yo-tso-li-ga nu-s-dv ga-dv-gv-i.
|
|---|
|
|---|
| Now Jesus knew that they were desirous to ask him, and said unto them, Do ye inquire among yourselves of that I said, A little while, and ye shall not see me: and again, a little while, and ye shall see me?
|
|---|
| ᏥᏌᏃ ᎠᎦᏔᎲᎩ ᎤᎾᏚᎵᏍᎬ ᎬᏩᏛᏛᏗᏱ, ᎯᎠᏃ ᏂᏚᏪᏎᎸᎩ; ᏥᎪᏕᏣᏓᏛᏛᎲᏍᎦ ᎦᏛᎬᎢ ᎯᎠ ᏥᎾᎩᏪᏒᎩ; ᏂᎪᎯᎸᎾᏉ ᎿᎭᏉ ᎥᏝ ᏱᏍᎩᎪᏩᏘᏍᎨᏍᏗ, ᎠᎴ ᎿᎭᏉ ᏔᎵᏁ ᏂᎪᎯᎸᎾᏉ ᎢᏍᎩᎪᏩᏘᏍᎨᏍᏗ?
|
|---|
Tsi-sa-no a-ga-ta-hv-gi u-na-du-li-s-gv gv-wa-dv-dv-di-yi, Hi-a-no ni-du-we-se-lv-gi; tsi-go-de-tsa-da-dv-dv-hv-s-ga ga-dv-gv-i hi-a tsi-na-gi-we-sv-gi; ni-go-hi-lv-na-quo hna-quo v-tla yi-s-gi-go-wa-ti-s-ge-s-di, a-le hna-quo ta-li-ne ni-go-hi-lv-na-quo i-s-gi-go-wa-ti-s-ge-s-di?
|
|---|
|
|---|
| Verily, verily, I say unto you, That ye shall weep and lament, but the world shall rejoice: and ye shall be sorrowful, but your sorrow shall be turned into joy.
|
|---|
| ᎤᏙᎯᏳᎯᏯ ᎤᏙᎯᏳᎯᏯ ᎯᎠ ᏂᏨᏪᏎᎭ; ᏂᎯ ᏕᏥᏴᎨᏍᏗ ᎠᎴ ᎢᏥᏍᎪᏂᎮᏍᏗ, ᎡᎶᎯᏍᎩᏂ ᎠᎵᎮᎵᎨᏍᏗ; ᏂᎯᏃ ᎤᏲ ᎢᏣᏓᏅᏖᏍᏗ, ᎠᏎᏃ ᎤᏲ ᎢᏣᏓᏅᏛ ᎤᎵᎮᎵᏍᏗ ᏮᏛᏓᏁᏟᏴᏍᏔᏂ.
|
|---|
U-do-hi-yu-hi-ya u-do-hi-yu-hi-ya hi-a ni-tsv-we-se-ha; ni-hi de-tsi-yv-ge-s-di a-le i-tsi-s-go-ni-he-s-di, e-lo-hi-s-gi-ni a-li-he-li-ge-s-di; ni-hi-no u-yo i-tsa-da-nv-te-s-di, a-se-no u-yo i-tsa-da-nv-dv u-li-he-li-s-di wv-dv-da-ne-tli-yv-s-ta-ni.
|
|---|
|
|---|
| A woman when she is in travail hath sorrow, because her hour is come: but as soon as she is delivered of the child, she remembereth no more the anguish, for joy that a man is born into the world.
|
|---|
| ᎠᎨᏴ ᎤᏲ ᎤᏓᏅᏙ ᏣᏕᎲᏍᎪ ᎠᏲᎵ, ᎤᏍᏆᎸᎡᎸ ᏅᏗᎦᎵᏍᏙᏗᏍᎪᎢ; ᎠᏎᏃ ᎿᎭᏉ ᎦᎾᏄᎪᏩ ᎠᏲᎵ, ᎥᏝ ᎿᎭᏉ ᏯᏅᏓᏗᏍᎪ ᎡᎯᏍᏗ ᎤᏓᏅᏓᏛᎢ, ᏅᏗᎦᎵᏍᏙᏗᏍᎪ ᎠᎵᎮᎵᎬ ᏴᏫ ᎤᎾᏄᎪᏫᏒ ᏒᎶᎯ.
|
|---|
A-ge-yv u-yo u-da-nv-do tsa-de-hv-s-go a-yo-li, u-s-qua-lv-e-lv nv-di-ga-li-s-do-di-s-go-i; a-se-no hna-quo ga-na-nu-go-wa a-yo-li, v-tla hna-quo ya-nv-da-di-s-go e-hi-s-di u-da-nv-da-dv-i, nv-di-ga-li-s-do-di-s-go a-li-he-li-gv yv-wi u-na-nu-go-wi-sv sv-lo-hi.
|
|---|
|
|---|
| And ye now therefore have sorrow: but I will see you again, and your heart shall rejoice, and your joy no man taketh from you.
|
|---|
| ᎾᏍᎩ ᎢᏳᏍᏗ ᏂᎯ ᎪᎯ ᎨᏒ ᎤᏲ ᎢᏣᏓᏅᏔ; ᎠᏎᏃ ᏔᎵᏁ ᏛᏨᎪᎢ, ᎠᎴ ᎢᏥᎾᏫ ᏛᎵᎮᎵᏥ, ᎢᏣᎵᎮᎵᎬᏃ ᎥᏝ ᎩᎶ ᏴᎨᏥᎩᏏ.
|
|---|
Na-s-gi i-yu-s-di ni-hi go-hi ge-sv u-yo i-tsa-da-nv-ta; a-se-no ta-li-ne dv-tsv-go-i, a-le i-tsi-na-wi dv-li-he-li-tsi, i-tsa-li-he-li-gv-no v-tla gi-lo yv-ge-tsi-gi-si.
|
|---|
|
|---|
| And in that day ye shall ask me nothing. Verily, verily, I say unto you, Whatsoever ye shall ask the Father in my name, he will give it you.
|
|---|
| ᎾᎯᏳᏃ ᎢᎦ ᎥᏝ ᎪᎱᏍᏗ ᏱᏍᎩᏯᏛᏛᎲᏍᎨᏍᏗ. ᎤᏙᎯᏳᎯᏯ ᎤᏙᎯᏳᎯᏯ ᎯᎠ ᏂᏨᏪᏎᎭ; ᏂᎦᎥ ᎪᎱᏍᏗ ᎠᎦᏴᎵᎨ ᎡᏥᏔᏲᏎᎮᏍᏗ, ᏓᏆᏙᎥ ᎢᏨᏗᏍᎨᏍᏗ, ᎠᏎ ᎡᏥᏁᏗ ᎨᏎᏍᏗ.
|
|---|
Na-hi-yu-no i-ga v-tla go-hu-s-di yi-s-gi-ya-dv-dv-hv-s-ge-s-di. U-do-hi-yu-hi-ya u-do-hi-yu-hi-ya hi-a ni-tsv-we-se-ha; Ni-ga-v go-hu-s-di A-ga-yv-li-ge e-tsi-ta-yo-se-he-s-di, da-qua-do-v i-tsv-di-s-ge-s-di, a-se e-tsi-ne-di ge-se-s-di.
|
|---|
|
|---|
| Hitherto have ye asked nothing in my name: ask, and ye shall receive, that your joy may be full.
|
|---|
| ᎪᎯ ᎢᏯᏍᏗ ᎥᏝ ᎪᎱᏍᏗ ᏱᏥᏔᏲᏍᏔᏃ ᎠᏴ ᏓᏉᏙᎥᎢ. ᎢᏥᏔᏲᎭ ᏓᏰᏥᏁᎵᏃ, ᎢᏣᎵᎮᎵᎬ ᎤᎧᎵᎢᏍᏗᏱ.
|
|---|
Go-hi i-ya-s-di v-tla go-hu-s-di yi-tsi-ta-yo-s-ta-no a-yv da-quo-do-v-i. I-tsi-ta-yo-ha da-ye-tsi-ne-li-no, i-tsa-li-he-li-gv u-ka-li-i-s-di-yi.
|
|---|
|
|---|
| These things have I spoken unto you in proverbs: but the time cometh, when I shall no more speak unto you in proverbs, but I shall shew you plainly of the Father.
|
|---|
| ᎾᏍᎩ ᎯᎠ ᏄᏍᏗ ᎢᏨᏃᎮᎮᎸ ᎤᏦᏍᏗ ᎪᎵᏍᏗᏱ ᎠᏋᏔᏅ; ᎠᏎᏃ ᏛᏍᏆᎸᎯ ᎿᎭᏉ ᎥᏝ ᏱᏨᏯᎵᏃᎮᏗᏍᎨᏍᏗ ᎤᏦᏍᏗ ᎪᎵᏍᏗᏱ ᎬᏗ, ᎬᏂᎨᏒᎢᏳᏍᎩᏂ ᏓᏨᎾᏄᎪᏫᏎᎵ ᎠᎦᏴᎵᎨᎢ.
|
|---|
Na-s-gi hi-a nu-s-di i-tsv-no-he-he-lv u-tso-s-di go-li-s-di-yi a-quv-ta-nv; a-se-no dv-s-qua-lv-hi hna-quo v-tla yi-tsv-ya-li-no-he-di-s-ge-s-di u-tso-s-di go-li-s-di-yi gv-di, gv-ni-ge-sv-i-yu-s-gi-ni da-tsv-na-nu-go-wi-se-li A-ga-yv-li-ge-i.
|
|---|
|
|---|
| At that day ye shall ask in my name: and I say not unto you, that I will pray the Father for you:
|
|---|
| ᎾᎯᏳ ᎢᎦ ᏓᏆᏙᎥ ᎢᏥᏔᏲᏍᏗᏍᎨᏍᏗ; ᎥᏝᏃ ᎠᎦᏴᎵᎨ ᏓᏥᏯᏓᏙᎵᏍᏓᏁᎵ ᏂᎯ ᎢᏥᏍᏕᎸᏗᏱ ᏱᏨᏲᏎᎭ;
|
|---|
Na-hi-yu i-ga da-qua-do-v i-tsi-ta-yo-s-di-s-ge-s-di; v-tla-no A-ga-yv-li-ge da-tsi-ya-da-do-li-s-da-ne-li ni-hi i-tsi-s-de-lv-di-yi yi-tsv-yo-se-ha;
|
|---|
|
|---|
| For the Father himself loveth you, because ye have loved me, and have believed that I came out from God.
|
|---|
| ᎠᎦᏴᎵᎨᏰᏃ ᎤᏩᏒ ᎢᏥᎨᏳᎭ, ᏅᏗᎦᎵᏍᏙᏗᎭ ᏍᎩᎨᏳᎢᏳ ᎨᏒᎢ, ᎠᎴ ᎢᏦᎯᏳᏅ ᎤᏁᎳᏅᎯᏱ ᏅᏛᏆᏓᎴᏅᎯ ᎨᏒᎢ.
|
|---|
A-ga-yv-li-ge-ye-no u-wa-sv i-tsi-ge-yu-ha, nv-di-ga-li-s-do-di-ha s-gi-ge-yu-i-yu ge-sv-i, a-le i-tso-hi-yu-nv U-ne-la-nv-hi-yi nv-dv-qua-da-le-nv-hi ge-sv-i.
|
|---|
|
|---|
| I came forth from the Father, and am come into the world: again, I leave the world, and go to the Father.
|
|---|
| ᎠᎦᏴᎵᎨᏍᏛᏱ ᏗᏆᏓᎴᏅ, ᎡᎶᎯ ᎠᎩᎷᏥᎸ; ᏔᎵᏁ ᎡᎶᎯ ᏛᎦᏓᏅᏏ, ᎠᎦᏴᎵᎨᏍᏛᏱ ᏮᏛᏥᎶᏏ.
|
|---|
A-ga-yv-li-ge-s-dv-yi di-qua-da-le-nv, e-lo-hi a-gi-lu-tsi-lv; ta-li-ne e-lo-hi dv-ga-da-nv-si, A-ga-yv-li-ge-s-dv-yi wv-dv-tsi-lo-si.
|
|---|
|
|---|
| His disciples said unto him, Lo, now speakest thou plainly, and speakest no proverb.
|
|---|
| ᎬᏩᏍᏓᏩᏗᏙᎯ ᎯᎠ ᏅᎬᏩᏪᏎᎸᎩ; ᎬᏂᏳᏉ ᎿᎭᏉ ᎬᏂᎨᏒᎢᏳ ᎯᏁᎦ, ᎥᏝᏃ ᎤᏦᏍᏗ ᎪᎵᏍᏗᏱ ᏱᏁᎦ.
|
|---|
Gv-wa-s-da-wa-di-do-hi hi-a nv-gv-wa-we-se-lv-gi; Gv-ni-yu-quo hna-quo gv-ni-ge-sv-i-yu hi-ne-ga, v-tla-no u-tso-s-di go-li-s-di-yi yi-ne-ga.
|
|---|
|
|---|
| Now are we sure that thou knowest all things, and needest not that any man should ask thee: by this we believe that thou camest forth from God.
|
|---|
| ᎿᎭᏉ ᎣᏥᎦᏔᎭ ᏂᎦᎥ ᎪᎱᏍᏗ ᎯᎦᏔᎯᏳ ᎨᏒᎢ, ᎠᎴ ᎠᏎᏉᏉ ᎨᏒ ᎩᎶ ᏱᏨᏛᏛᎲᏍᎦ. ᎾᏍᎩ ᎤᏗᎦᎵᏍᏙᏗᎭ ᎣᏦᎯᏳᎲᏍᎦ ᎤᏁᎳᏅᎯᏱ ᏅᏓᏣᏓᎴᏅᎯ ᎨᏒᎢ.
|
|---|
Hna-quo o-tsi-ga-ta-ha ni-ga-v go-hu-s-di hi-ga-ta-hi-yu ge-sv-i, a-le a-se-quo-quo ge-sv gi-lo yi-tsv-dv-dv-hv-s-ga. Na-s-gi u-di-ga-li-s-do-di-ha o-tso-hi-yu-hv-s-ga U-ne-la-nv-hi-yi nv-da-tsa-da-le-nv-hi ge-sv-i.
|
|---|
|
|---|
| Jesus answered them, Do ye now believe?
|
|---|
| ᏥᏌ ᎯᎠ ᏂᏚᏪᏎᎸᎩ; ᏥᎪ ᎿᎭᏉ ᎢᏦᎯᏳᎲᏍᎦ?
|
|---|
Tsi-sa hi-a ni-du-we-se-lv-gi; Tsi-go hna-quo i-tso-hi-yu-hv-s-ga?
|
|---|
|
|---|
| Behold, the hour cometh, yea, is now come, that ye shall be scattered, every man to his own, and shall leave me alone: and yet I am not alone, because the Father is with me.
|
|---|
| ᎬᏂᏳᏉ ᏛᏍᏆᎸᎯ, ᎥᎥ, ᎿᎭᏉᎤᏍᏆᎸᎲ, ᎢᏣᏗᎦᎴᏲᎢᏍᏗᏱ, ᏂᏥᎥ ᎢᏥᏏᏴᏫᎭ ᏙᏗᏤᏅᏒ ᎢᏗᏢ, ᎠᎴ ᏓᏍᎩᏴᏕᏥ ᎠᏋᏒᏉ ᎨᏎᏍᏗ; ᎥᏝᏍᎩᏂᏃᏅ ᎠᏋᎡ ᏱᎩ, ᎠᎦᏴᎵᎨᏰᏃ ᏔᎵ ᏅᏛᏗᏕᎦ.
|
|---|
Gv-ni-yu-quo dv-s-qua-lv-hi, v-v, hna-quo-u-s-qua-lv-hv, i-tsa-di-ga-le-yo-i-s-di-yi, ni-tsi-v i-tsi-si-yv-wi-ha do-di-tse-nv-sv i-di-tlv, a-le da-s-gi-yv-de-tsi a-quv-sv-quo ge-se-s-di; v-tla-s-gi-ni-no-nv a-quv-e yi-gi, A-ga-yv-li-ge-ye-no ta-li nv-dv-di-de-ga.
|
|---|
|
|---|
| These things I have spoken unto you, that in me ye might have peace. In the world ye shall have tribulation: but be of good cheer; I have overcome the world.
|
|---|
| ᎾᏍᎩ ᏄᏍᏗ ᎯᎠ ᎢᏨᏃᎮᎮᎸ ᎠᏴ ᏅᏩᏙᎯᏯᏛ ᎢᏨᏯᏓᏅᏓᏗᏍᏙᏗᏱ. ᎡᎶᎯ ᎤᏕᏯᏙᏗ ᏓᏥᏩᏛᎯ; ᎠᏎᏃ ᎤᎦᎵᏍᏗᏉ ᎢᏣᏓᏅᏖᏍᏗ; ᎠᏴ ᏥᏎᎪᎩᏒ ᎡᎶᎯ.
|
|---|
Na-s-gi nu-s-di hi-a i-tsv-no-he-he-lv a-yv nv-wa-do-hi-ya-dv i-tsv-ya-da-nv-da-di-s-do-di-yi. E-lo-hi u-de-ya-do-di da-tsi-wa-dv-hi; a-se-no u-ga-li-s-di-quo i-tsa-da-nv-te-s-di; a-yv tsi-se-go-gi-sv e-lo-hi.
|
|---|


Traditional 5x5 Lifting Program
This is the traditional 5x5 program created by Mark Rippetoe, its simple and powerful.  This is usally recommended to beginners.
Jonnie Candito's Linear Strength Program
Ideal for beginners but also for can be very useful for more experienced lifters as well. The lifting schedule is also flexible. Jonnie recommends this program to people brand new to lifting, so they can take time to learn the required form used in the 3 main lifts (Squat, Deadlift, Bench Press).
Ice Cream Fitness 5X5 (ICF 5X5)
Don't mind the name, this is yet another amazing program available to everyone. I personally have used this to go from a weak 135lb guy to around 160lb in under a year when I first started. This program is more bodybuilding targeted due to the higher volume (much more workouts). Although this program usually takes 1.5 - 2 hours to complete and is not recommended for people tight on time. If you have the time, this program is incredible.


rbenv
A tool to easily install Ruby versions and manage application environments.
More information: home page
- Install a Ruby version:
rbenv install version
- Display a list of the latest stable versions for each Ruby:
rbenv install --list
- Display a list of installed Ruby versions:
rbenv versions
- Use a specific Ruby version across the whole system:
rbenv global version
- Use a specific Ruby version for an application/project directory:
rbenv local version
- Display the currently selected Ruby version:
rbenv version
- Uninstall a Ruby version:
rbenv uninstall version
- Display all Ruby versions that contain the specified executable:
rbenv whence executable


This is a p element (will not be selected).
This is a p element.
This is another p element.
This is a p element inside a div element (will not be selected).


an amazing thing. Being asked to use it in conversation with Him as a way of having your prayers answered was unbelievable. And so many of us don’t—believe it, that is.
We know better than to believe that tacking the phrase “in Jesus’ name” on the end of our wish lists will make them come true. You can’t wish for a new car, revenge on your enemies, world peace, or whatever and think that adding Jesus’ name at the end will clinch the deal.
Praying in Jesus’ name is not a formula that guarantees us the answer we want. It’s a sign of intimacy, assuming that we know Him well enough to know what kind of prayer would honor His name. It’s another way of saying “Thy will be done on earth as it is in heaven,” since we’re asking for God’s will—the things that honor His name—to become visibly manifest in our world. It means that praying God’s name comes with the responsibility of learning enough about who God is that we can say those words at the end of a prayer with the confidence that we know what God wants. And our understanding of God’s ultimate will, His ultimate triumph over the powers of darkness, means that if we want what God wants, we will ultimately get what we want.
Read 1 John 5:13-15. How do these verses echo John 14:13-14?
What new information do we gain from the 1 John passage?
Praying in Jesus’ name is as much a message to us as it is to God—a message of what prayer is really about. We don’t pray to point God to our desires; we pray so that God will point us in the direction of His character, shaping us and our hearts even as we ask Him into the deepest places in our hearts.
When we pray in Jesus’ name, we should ask ourselves if the prayer reflects our sincere desire to have those things that reflect Jesus’ lordship, character, and love done on earth as in heaven. This is a good litmus test for our prayers. Let’s walk through it together.
Write a prayer below about your current situation, needs, and concerns. Close it with the words “in Jesus’ name.”


Calibrating...
Practice
19
Privacy & Terms
English
Chinese (Simplified)
Chinese (Hong Kong)
Chinese (Taiwan)
Korean
Japanese
Spanish
Portuguese (Brazil)
Thai (Thailand)
Malay (Malaysia)
Indonesian (Indonesia)


It's time to go now,
Haul away your anchor,
Haul away your anchor,
It's our sailing time.

It's our sailing time.

Waves are surging under,
Haul away down Channel,
Haul away down Channel,
On the evening tide.
When your sailing's over,
Haul away for Heaven,
Haul away for Heaven,
God be by your side.
It is time to go now,
Haul away your anchor,
Haul away your anchor,
It's our sailing time.


--- layout: archive title: Zulip Chat Archive permalink: /stream/113488-general/topic/lifting.20functions.html ---
If I have f : X -> Y
, an injection i : Z -> Y
and a proof that for all x : X
, f x \in range i
then as a mathematician I would say that I can lift f
to a function X -> Z
. Unfortunately lift
is used for something else in Lean. What is this operation called in Lean? And is it in Lean already? I guess it's noncomputable.
something using the word 'factor'?
{% endraw %}Last updated: Apr 24 2020 at 19:02 UTC


Welcome to the Lightweight Messaging app.
Talking To:
Type someone's username here, and then you can start talking to them!


Convenience functions for XPA commands¶
Note
The full list of XPA access points can be found at: http://ds9.si.edu/doc/ref/xpa.html
If there is no convenience function for an access point that you would like to use, you can still call it using the imexam hooks into the xpa GET and SET functions. They are aliased to your object (for example “window”) as window.window.xpa.get() or window.window.xpa.set()
- alignwcs (on=True):
- align loaded images by wcs,
- blink (blink=None,interval=None):
- blink frames
- clear_contour ():
- clear contours from the screen
- cmap (color=None,load=None,invert=False,save=False, filename=’colormap.ds9’):
set the color map of the current frame The available maps are “heat”,”grey”,”cool”,”aips0”,”a”,”b”,”bb”,”he”,”i8”
- color: string
- color must be set to one of the available DS9 color map names
- load: string, optional
- set to the filename which is a valid colormap lookup table valid contrast values are from 0 to 10, and valid bias values are from 0 to 1
- invert: bool, optional
- invert the colormap
- save: bool, optional
- save the current colormap as a file
- filename: string, optional
- the name of the file to save the colormap to
- colorbar (on=True):
- turn the colorbar at the bottom of the screen on and off
- contour (on=True, construct=True):
on: Set to true to turn on contours
- construct: optional
- Will open the contour dialog box which has more options
- contour_load (filename):
- load contours into the window from the specified filename
- crosshair (x=none,y=none,coordsys=”physical”,skyframe=”wcs”,skyformat=”fk5”,match=False,lock=False):
control the current position of the crosshair in the current frame, crosshair mode is turned on
- x: string or int
- The value of x is converted to a string for the call to XPA, use a value here appropriate for the skyformat you choose
- y: string or int
- The value of y is converted to a string for the call to XPA, use a value here appropriate for the skyformat you choose
- coordsys: string, optional
- The coordinate system your x and y are defined in
- skyframe: string, optional
- If skyframe has “wcs” in it then skyformat is also sent to the XPA
- skyformat: string, optional
- Used with skyframe, specifies the format of the coordinate which were given in x and y
- match: bool, optional
- If set to True, then the wcs is matched for the frames
- lock: bool, optional
- If set to True, then the frame is locked in wcs
- cursor (x=None,y=None):
- move the cursor in the current frame to the specified image pixel, it will also move selected regions
- disp_header ():
- display the current header using the ds9 header display window
- frame (n=None):
convenience function to switch frames or load a new frame (if that number does not already exist)
- n: int, string, optional
- The frame number to open or change to. If the number specified doesn’t exist, a new frame will be opened If nothing is specified, then the current frame number will be returned. The value of n is converted to a string before passing to the XPA
frame(1) sets the current frame to 1 frame(“last”) set the current frame to the last frame frame() returns the number of the current frame frame(“new”) opens a new frame frame(3) opens frame 3 if it doesn’t exist already, otherwise goes to frame 3
- get_header ():
- return the header of the current extension as a string, or None if there’s a problem
- grid (on=True, param=False):
- turn the grid on and off if param is True, then a diaglog is opened for the grid parameters
- hideme ():
- lower the ds9 window on your display
- load_fits (fname=None, extname=1, extver=’SCI’):
load a fits image to the current frame. You provide just the name, or either of the extname or extver, or you can specify the extension with the filename string. For example:
load_fits(‘something.fits’,extver=’SCI’) will load the SCI,1 extension
load_fits(‘something.fits[SCI,1]’) will load the SCI,1 extension
load_fits(‘something.fits’) will load the main data extension; the only data information in the case of simple fits, or the first extension in the case of a multiextension file
- load_region (filename):
- load the specified DS9 formatted region filename
- load_rgb (red, green, blue,scale=False, lockwcs=False):
load 3 images into an RGBimage frame, the parameters are:
red: string, The name of the fits file which will be loaded into the red channel green: string, The name of the fits file which will be loaded into the green channel blue: string, The name of the fits file which will be loaded into the blue channel scale: bool, If True, then each image will be scale with zscale() after loading lockwcs: bool, If True, then the image positions will be locked to each other using the WCS information in their headers
- load_mef_as_cube (filename=None):
- Load a Mult-Extension-Fits image into one frame as an image cube in the image viewer
- load_mef_as_multi (filename=None):
- Load a Mult-Extension-Fits image into multiple frames in the image viewer
- match (coordsys=”physical”,frame=False,crop=False,fslice=False,scale=False,bin=False,colorbar=False,smooth=False,crosshair=False):
match all other frames to the current frame using the specified option. You can only choose one of the options at a time, so set frame=False and something else in addition to your choice if you don’t want the default option.
- coordsys: string, optional
- The coordinate system to use
- frame: bool, optional
- Match all other frames to the current frame, using the set coordsys
- crop: bool, optional
- Set the current image display area, using the set coordsys
- fslice: bool, optional
- Match current slice in all frames
- scale: bool, optional
- Match to the current scale for all frames
- bin: bool, optional
- Match to the current binning for all frames
- colorbar: bool, optional
- Match to the current colorbar for all frames
- smooth: bool, optional
- Match to the current smoothing for all frames
- crosshair: bool, optional
- Match the crosshair in all frames, using the current coordsys
- nancolor (color=”red”):
- set the not-a-number color, default is red
- panto_image (x, y)
- convenience function to change to x,y images coordinates using ra,dec
- panto_wcs (x, y,system=’fk5’):
pan to the wcs coordinates in the image using the specified system
- x: string
- The x location to move to, specified using the given system
- y: string
- The y location to move to
- system: string
- The reference system that x and y were specified in, they should be understood by DS9
- rotate (value, to=False):
- value: float [degrees]
- Rotate the current frame {value} degrees If value is 0, then the current rotation is printed
- to: bool
- Rotate the current frame to the specified value instead
- save_header (filename=None):
- save the header of the current image to a file
- save_rgb (filename=None):
- save an rgbimage frame as an MEF fits file
- save_regions (filename=None):
Save the regions in the current window to a DS9 style regions file
- filename: string
The nameof th file to which the regions displayed in the current window are saved If no filename is provided then it will try and save the regions to the name of the file in the current display with _regions.txt appended
If a file of that name already exists on disk it will no attempt to overwrite it
- scale (scale=’zscale’):
Scale the image on display. The default zscale is the most widely used option:
Syntax scales available: [linear|log|pow|sqrt|squared|asinh|sinh|histequ] [log exp <value>] [datasec yes|no] [limits <minvalue> <maxvalue>] [mode minmax|<value>|zscale|zmax] [scope local|global] [match] [lock [yes|no]] [open|close]
- set_region (region_string):
- display a region using the specifications in region_string example: set_region(“physical; ruler 200 300 200 400”)
- showme ():
- raise the ds9 display window
- showpix ():
- display the pixel value table
- snapsave (filename,format=None,resolution=100):
create a snap shot of the current window and save in specified format. If no format is specified the filename extension is used
- filename: str, optioan
- filename of output image, the extension in the filename can also be used to specify the format If no filename is specified, then the filename will be constructed from the name of the currently displayed image with _snap.jpg appended.
- format: str, optional
- available formats are fits, eps, gif, tiff, jpeg, png If no format is specified the filename extension is used
- resolution: int, optional
- 1 to 100, for jpeg images
- zoom (par=”to fit”):
- par: string
- it can be a number (ranging 0.1 to 8), and successive calls continue zooming in the same direction it can be two numbers ‘4 2’, which specify zoom on different axis if can be to a specific value ‘to 8’ or ‘to fit’, “to fit” is the default it can be ‘open’ to open the dialog box it can be ‘close’ to close the dialog box (only valid if the box is already open)
- zoomtofit ():
- zoom to the best fit for the display window


+++ draft = false date = "2006-07-30T16:22:11-03:00" title = "Tutorial on integrating z3 tech into Plone" tags = ["zope3", "Plone"] created = "2006-07-30T16:20:39-03:00" modified = "2006-07-30T16:22:11-03:00" permaLink = "http://play.pixelblaster.ro/blog/archive/2006/07/30/tutorial-on-integrating-z3-tech-into-plone" author = "Tiberiu Ichim" aliases = [ "/blog/archive/2006/07/30/tutorial-on-integrating-z3-tech-into-plone" ] +++
There's a tutorial in the collective that shows a bit of how to use z3 tech inside Plone


Spring on Phobos
I’m continuing to learn live coding with SuperCollider and WebGL shaders, and I composed another audiovisual set, trying more complicated things that I wasn’t able to do for the first one. I performed this new piece at the concert venue La Vitrola on March 29th 2019, as part of the third edition of Signes vitaux, a series of concerts organised by Rodrigo Velasco (Yecto) and Toplap Montréal.
Unfortunately, my computer is not fast enough to render this piece to disk while I perform it, so for now I’m unable to share a completed version of this work.
Source code
You can find the code written for this set on GitHub.
Context
This blog post is part of my research project Towards an algorithmic cinema, started in April 2018. I invite you to read the first blog post of the project to learn more about it.


Legally Blonde Trivia
00:00
Start
What is the name of Elle Wood's dog?
Mitzy
Bruiser
Bitsy
Boots
What is the name of Elle Wood's college boyfriend?
William
Wallace
Skip
Warren
What is the name of Elle Wood's sorority?
Kappa Nu
Nu Delta
Delta Nu
Delta Mu
What Post Grad University does Elle attend?
U of Chicago Medical School
Harvard Medical School
U of Chicago Law School
Harvard Law School
Elle Woods stated "the rules of ______ are simple and finite.
Make up
Fashion
Hair Care
Shoe Collecting


Signing in will allow you to purchase this item.
This
Course Modules:
-
Estimated time:
Estimated total time to complete:
Review by
on
Related content
This
Estimated total time to complete:


R/Plots.R
plotExpectedType1Error.Rd
plotExpectedType1Error
creates a plot showing the expected type 1 error as a function of standard error.
plotExpectedType1Error( logRrNegatives, seLogRrNegatives, seLogRrPositives, alpha = 0.05, null = NULL, xLabel = "Relative risk", title, showCis = FALSE, showEffectSizes = FALSE, fileName = NULL )
| logRrNegatives | A numeric vector of effect estimates of the negative controls on the log scale. |
|---|---|
| seLogRrNegatives | The standard error of the log of the effect estimates of the negative controls. |
| seLogRrPositives | The standard error of the log of the effect estimates of the positive controls. |
| alpha | The alpha (nominal type 1 error) to be used. |
| null | An object representing the fitted null distribution as created by the
|
| xLabel | If showing effect sizes, what label should be used for the effect size axis? |
| title | Optional: the main title for the plot |
| showCis | Show 95 percent credible intervals for the expected type 1 error. |
| showEffectSizes | Show the expected effect sizes alongside the expected type 1 error? |
| fileName | Name of the file where the plot should be saved, for example 'plot.png'.
See the function |
A Ggplot object. Use the ggsave
function to save to file.
Creates a plot with the standard error on the x-axis and the expected type 1 error on the y-axis. The red line indicates the expected type 1 error given the estimated empirical null distribution if no calibration is performed. The dashed line indicated the nominal expected type 1 error rate, assuming the theoretical null distribution.
If standard errors are provided for non-negative estimates these will be plotted on the red line as yellow diamonds.
data(sccs) negatives <- sccs[sccs$groundTruth == 0, ] positive <- sccs[sccs$groundTruth == 1, ] plotExpectedType1Error(negatives$logRr, negatives$seLogRr, positive$seLogRr)


Be bold and ready to take on new challenges! Create Your first conference and make a difference!
Add New
Sign up
today and get your place for the most interesting conferences in the IT industry.
Join Now
Upcoming
Past
Edit Conference
Conference Topic
Date
Starting Time
Address
Description
Number of Seats
Ticket Price
(leave 0 for 'FREE' tickets)
Edit Conference
Edit Lectures
Scroll


Widget palette Dojo DataGrid tests (Legacy)
Introduction
With the addition of GridX support, Maqetta support for DataGrid has been deprecated. As part of the
deprecation, DataGrid has been hidden within the widget palette. However, existing files containing
DataGrid should continue to function, and DataGrid Smart Input should continue to behave as before. So, this
DataGrid test plan stays mostly the same except instead of dragging DataGrid from palette to canvas, DataGrid
will need to be added to HTML files via the source editor.
Creating File Containing Data Grid
Steps
- Choose New HTML File from the New menu
- Click "Split Vertically" or "Split Horizontally" in main toolbar to make source pane visible
- Copy and paste the source from dataGridLegacySample.html on top of the source in the source pane
- See DataGrid get rendered and close source pane (e.g., click "Display Design" in main toolbar).
Expected results
- The DataGrid should be rendered in the page editor with default data.
Comma separated data
Steps
- Continuing with HTML file created in last section.
- Double-click on the DataGrid to bring up SmartInput.
- SmartInput is displayed chose Comma separated data from the drop down list
- Change the data in the text area to:
- one, two, three
- data 1, data 2, data 3
- xxxx, yyy, zzz
- 111, 222, 3333
- Click in the canvas area of the window to cause a blur event that will close the window.
- The DataGrid should be updated with the data you entered.
- Save and close the file.
- Reopen the file
- Click on the preview icon in the toolbar, this should open a new browser window and the data grid should be displayed with the data entered
Expected results
- The DataGrid in page editor and preview should be displaying the data you just enter.
- You should see 3 columns with the headers one, two and three.
- You should see 3 rows of data, corresponding to the data you entered.
Smart Input
Steps
- Choose New HTML File from the New menu
- Add DataGrid to file using instructions in Creating File Containing Data Grid section above
- Double-click on the DataGrid to bring up SmartInput.
- SmartInput is displayed, mouse down and hold on the icon in the button right corner of the text area. Drag to re-size the the smart input.
- Click on the ? icon to display the help.
- Click on the ? icon to hide the help.
- Mouse down and hold in the area between the ? icon and the Ok and Cancel buttons. drag the smart input box around the canvas area.
Expected results
- The user should be able to re-size the smart input box, move the box around the canvas,
display and hide help. When the user moves the smart input box the pointer should disappear
from the top left of the smart input box..
HTML detection in comma separated data
Steps
- Choose New HTML File from the New menu
- Add DataGrid to file using instructions in Creating File Containing Data Grid section above
- Double-click on the DataGrid to bring up SmartInput.
- SmartInput is displayed chose Comma separated data from the drop down list
- Change the data in the text area to:
- one, two, three
- data 1, data 2, data 3
- xxxx, yyy, zzz
- 111, 222, 3333
- Two radio buttons should now be displayed Plan Text and HTML Markup, Chose the HTML Markup radio.
- Click the Cancel button.
- The DataGrid should be be displayed with the default data, not the data you entered.
- Save and close the file.
- Reopen the file
- Click on the preview icon in the toolbar, this should open a new browser window and the data grid should be displayed with the default data.
Expected results
- The DataGrid in page editor and preview should be displaying the default data.
Data file from workspace
Steps
- Choose New HTML File from the New menu
- Add DataGrid to file using instructions in Creating File Containing Data Grid section above
- Double-click on the DataGrid to bring up SmartInput.
- SmartInput is displayed chose Data file from workspace from the drop down list
- Click on the folder icon.
- The select a source dialog will be displayed, navigate to the sample_data folderand then select the htmlSample.json< file. Click the OK button
- The text area should now display the text sample_data/htmlSample.json.
Two radio button should also now be displayed under the text area labeled Plain text and HTML markup<
select the Plain text
- Click the ok button.
- The DataGrid should be updated with the data from the htmlSample file. Notice that the data is displayed as plan text, for example Fruits
- Save and close the file.
- Reopen the file
- Click on the preview icon in the toolbar, this should open a new browser window and the data grid should be displayed with the data from the file.
Expected results
- The DataGrid in page editor and preview should be displaying the data from the file.
Data from URL (JSONP)
Steps
- Continuing from the test case above, open the HTML File from the Data from workspace< test case.
- Double click on the DataGrid Widget in the design view to display the smart input.
- SmartInput is displayed chose Data from URL (JSONP) from the drop down list
- In the text area enter the url http://maqettaservice.appspot.com/sampleservice Two radio button should also now be displayed under the text area labeled
Plain text and HTML markup select the HTML markup
- Click the ok button.
- The DataGrid should be updated with the data from the service. Notice that the data is displayed as supports html mrkup , for example Fruits
- Save and close the file.
- Reopen the file
- Click on the preview icon in the toolbar, this should open a new browser window and the data grid should be displayed with the data from the service.
Expected results
- The DataGrid in page editor and preview should be displaying the data from the file.


Home
Trees
Indices
Help
Project Homepage
[
hide private
]
[
frames
] |
no frames
]
Identifier Index
[
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
_
]
A
add()
(in
WeakSet
)
all_level
(in
intera_interface.cfg.SawyerPositionJointTrajectoryActionServerConfig
)
all_level
(in
intera_interface.cfg.SawyerPositionFFJointTrajectoryActionServerConfig
)
all_level
(in
intera_interface.cfg.SawyerVelocityJointTrajectoryActionServerConfig
)
B
blocked()
(in
Head
)
button_string_lookup()
(in
Navigator
)
C
calibrate()
(in
Gripper
)
clear()
(in
WeakSet
)
connect()
(in
Signal
)
camera
(in
intera_interface
)
close()
(in
Gripper
)
copy()
(in
WeakSet
)
Cameras
(in
intera_interface.camera
)
compute_output()
(in
PID
)
cuff
(in
intera_interface
)
cfg
(in
intera_interface
)
config_description
(in
intera_interface.cfg.SawyerPositionFFJointTrajectoryActionServerConfig
)
Cuff
(in
intera_interface.cuff
)
CHECK_VERSION
(in
intera_interface
)
config_description
(in
intera_interface.cfg.SawyerPositionJointTrajectoryActionServerConfig
)
cuff_button()
(in
Cuff
)
CHECK_VERSION
(in
intera_interface.settings
)
config_description
(in
intera_interface.cfg.SawyerVelocityJointTrajectoryActionServerConfig
)
D
defaults
(in
intera_interface.cfg.SawyerPositionFFJointTrajectoryActionServerConfig
)
deregister_callback()
(in
IODeviceInterface
)
disable()
(in
RobotEnable
)
defaults
(in
intera_interface.cfg.SawyerPositionJointTrajectoryActionServerConfig
)
difference()
(in
WeakSet
)
discard()
(in
WeakSet
)
defaults
(in
intera_interface.cfg.SawyerVelocityJointTrajectoryActionServerConfig
)
difference_update()
(in
WeakSet
)
disconnect()
(in
Signal
)
deregister_callback()
(in
Cuff
)
digital_io
(in
intera_interface
)
display_image()
(in
HeadDisplay
)
deregister_callback()
(in
Navigator
)
DigitalIO
(in
intera_interface.digital_io
)
E
enable()
(in
RobotEnable
)
endpoint_pose()
(in
Limb
)
exit_control_mode()
(in
Limb
)
endpoint_effort()
(in
Limb
)
endpoint_velocity()
(in
Limb
)
G
get_button_state()
(in
Navigator
)
get_limb_names()
(in
RobotParams
)
get_signal_type()
(in
IODeviceInterface
)
get_camera_details()
(in
RobotParams
)
get_port_type()
(in
IODeviceInterface
)
get_signal_value()
(in
IODeviceInterface
)
get_camera_names()
(in
RobotParams
)
get_port_value()
(in
IODeviceInterface
)
get_wheel_state()
(in
Navigator
)
get_force()
(in
Gripper
)
get_position()
(in
Gripper
)
gripper
(in
intera_interface
)
get_joint_names()
(in
RobotParams
)
get_robot_assemblies()
(in
RobotParams
)
Gripper
(in
intera_interface.gripper
)
get_light_state()
(in
Lights
)
get_robot_name()
(in
RobotParams
)
H
handle_config()
(in
IOInterface
)
head
(in
intera_interface
)
HEAD_PAN_ANGLE_TOLERANCE
(in
intera_interface.settings
)
handle_state()
(in
IOInterface
)
Head
(in
intera_interface.head
)
HeadDisplay
(in
intera_interface.head_display
)
has_collided()
(in
Limb
)
head_display
(in
intera_interface
)
has_error()
(in
Gripper
)
HEAD_PAN_ANGLE_TOLERANCE
(in
intera_interface
)
I
inf
(in
intera_interface.cfg.SawyerPositionFFJointTrajectoryActionServerConfig
)
invalidate_config()
(in
IOInterface
)
is_gripping()
(in
Gripper
)
inf
(in
intera_interface.cfg.SawyerPositionJointTrajectoryActionServerConfig
)
invalidate_state()
(in
IOInterface
)
is_moving()
(in
Gripper
)
inf
(in
intera_interface.cfg.SawyerVelocityJointTrajectoryActionServerConfig
)
io_command
(in
intera_io
)
is_output
(in
DigitalIO
)
initialize()
(in
PID
)
io_interface
(in
intera_io
)
is_ready()
(in
Gripper
)
intera_control
IOCommand
(in
intera_io.io_command
)
is_state_valid()
(in
IOInterface
)
intera_dataflow
IODeviceInterface
(in
intera_io.io_interface
)
is_valid()
(in
IOInterface
)
intera_interface
IOInterface
(in
intera_io.io_interface
)
isdisjoint()
(in
WeakSet
)
intera_io
is_calibrated()
(in
Gripper
)
issubset()
(in
WeakSet
)
intersection()
(in
WeakSet
)
is_camera_streaming()
(in
Cameras
)
issuperset()
(in
WeakSet
)
intersection_update()
(in
WeakSet
)
is_config_valid()
(in
IOInterface
)
J
joint_angle()
(in
Limb
)
joint_angles()
(in
Limb
)
joint_names()
(in
Limb
)
JOINT_ANGLE_TOLERANCE
(in
intera_interface
)
joint_effort()
(in
Limb
)
joint_velocities()
(in
Limb
)
JOINT_ANGLE_TOLERANCE
(in
intera_interface.settings
)
joint_efforts()
(in
Limb
)
joint_velocity()
(in
Limb
)
L
level
(in
intera_interface.cfg.SawyerPositionFFJointTrajectoryActionServerConfig
)
limb
(in
intera_interface
)
list_port_names()
(in
IODeviceInterface
)
level
(in
intera_interface.cfg.SawyerPositionJointTrajectoryActionServerConfig
)
Limb
(in
intera_interface.limb
)
list_signal_names()
(in
IODeviceInterface
)
level
(in
intera_interface.cfg.SawyerVelocityJointTrajectoryActionServerConfig
)
list_all_items()
(in
Navigator
)
load_state()
(in
IOInterface
)
lights
(in
intera_interface
)
list_all_lights()
(in
Lights
)
log_message()
(in
RobotParams
)
Lights
(in
intera_interface.lights
)
list_cameras()
(in
Cameras
)
lower_button()
(in
Cuff
)
M
max
(in
intera_interface.cfg.SawyerPositionFFJointTrajectoryActionServerConfig
)
MAX_VELOCITY
(in
Gripper
)
MIN_POSITION
(in
Gripper
)
max
(in
intera_interface.cfg.SawyerPositionJointTrajectoryActionServerConfig
)
min
(in
intera_interface.cfg.SawyerPositionFFJointTrajectoryActionServerConfig
)
MIN_VELOCITY
(in
Gripper
)
max
(in
intera_interface.cfg.SawyerVelocityJointTrajectoryActionServerConfig
)
min
(in
intera_interface.cfg.SawyerPositionJointTrajectoryActionServerConfig
)
move_to_joint_positions()
(in
Limb
)
MAX_FORCE
(in
Gripper
)
min
(in
intera_interface.cfg.SawyerVelocityJointTrajectoryActionServerConfig
)
move_to_neutral()
(in
Limb
)
MAX_POSITION
(in
Gripper
)
MIN_FORCE
(in
Gripper
)
N
navigator
(in
intera_interface
)
Navigator
(in
intera_interface.navigator
)
O
open()
(in
Gripper
)
P
pan()
(in
Head
)
param
(in
intera_interface.cfg.SawyerPositionJointTrajectoryActionServerConfig
)
PID
(in
intera_control.pid
)
pan_mode()
(in
Head
)
param
(in
intera_interface.cfg.SawyerVelocityJointTrajectoryActionServerConfig
)
Point
(in
Limb
)
panning()
(in
Head
)
param_lock
(in
RobotEnable
)
pop()
(in
WeakSet
)
param
(in
intera_interface.cfg.SawyerPositionFFJointTrajectoryActionServerConfig
)
pid
(in
intera_control
)
publish_command()
(in
IOInterface
)
Q
Quaternion
(in
Limb
)
R
reboot()
(in
Gripper
)
remove()
(in
WeakSet
)
robot_params
(in
intera_interface
)
register_callback()
(in
Cuff
)
reset()
(in
RobotEnable
)
RobotEnable
(in
intera_interface.robot_enable
)
register_callback()
(in
Navigator
)
revalidate()
(in
IOInterface
)
RobotParams
(in
intera_interface.robot_params
)
register_callback()
(in
IODeviceInterface
)
robot_enable
(in
intera_interface
)
S
SawyerPositionFFJointTrajectoryActionServerConfig
(in
intera_interface.cfg
)
set_kd()
(in
PID
)
settings
(in
intera_interface
)
SawyerPositionJointTrajectoryActionServerConfig
(in
intera_interface.cfg
)
set_ki()
(in
PID
)
Signal
(in
intera_dataflow.signals
)
SawyerVelocityJointTrajectoryActionServerConfig
(in
intera_interface.cfg
)
set_kp()
(in
PID
)
signals
(in
intera_dataflow
)
SDK_VERSION
(in
intera_interface
)
set_light_state()
(in
Lights
)
start()
(in
Gripper
)
SDK_VERSION
(in
intera_interface.settings
)
set_object_weight()
(in
Gripper
)
start_streaming()
(in
Cameras
)
set_callback()
(in
Cameras
)
set_output()
(in
DigitalIO
)
state
(in
DigitalIO
)
set_command_timeout()
(in
Limb
)
set_pan()
(in
Head
)
state()
(in
RobotEnable
)
set_dead_zone()
(in
Gripper
)
set_port()
(in
SetCommand
)
stop()
(in
Gripper
)
set_holding_force()
(in
Gripper
)
set_port_value()
(in
IODeviceInterface
)
stop()
(in
RobotEnable
)
set_joint_position_speed()
(in
Limb
)
set_position()
(in
Gripper
)
stop_streaming()
(in
Cameras
)
set_joint_positions()
(in
Limb
)
set_signal()
(in
SetCommand
)
symmetric_difference()
(in
WeakSet
)
set_joint_torques()
(in
Limb
)
set_signal_value()
(in
IODeviceInterface
)
symmetric_difference_update()
(in
WeakSet
)
set_joint_trajectory()
(in
Limb
)
set_velocity()
(in
Gripper
)
set_joint_velocities()
(in
Limb
)
SetCommand
(in
intera_io.io_command
)
T
type
(in
intera_interface.cfg.SawyerPositionFFJointTrajectoryActionServerConfig
)
type
(in
intera_interface.cfg.SawyerPositionJointTrajectoryActionServerConfig
)
type
(in
intera_interface.cfg.SawyerVelocityJointTrajectoryActionServerConfig
)
U
union()
(in
WeakSet
)
update()
(in
WeakSet
)
upper_button()
(in
Cuff
)
V
verify_camera_exists()
(in
Cameras
)
VERSIONS_SDK2GRIPPER
(in
intera_interface
)
VERSIONS_SDK2ROBOT
(in
intera_interface
)
version_check()
(in
RobotEnable
)
VERSIONS_SDK2GRIPPER
(in
intera_interface.settings
)
VERSIONS_SDK2ROBOT
(in
intera_interface.settings
)
W
w
(in
Quaternion
)
wait_for()
(in
intera_dataflow.wait_for'
)
WeakSet
(in
intera_dataflow.weakrefset
)
wait_for'
(in
intera_dataflow
)
weakrefset
(in
intera_dataflow
)
X
x
(in
Point
)
x
(in
Quaternion
)
Y
y
(in
Point
)
y
(in
Quaternion
)
Z
z
(in
Point
)
z
(in
Quaternion
)
_
__call__()
(in
Signal
)
__isub__()
(in
WeakSet
)
__package__
(in
intera_io.io_interface
)
__contains__()
(in
WeakSet
)
__iter__()
(in
WeakSet
)
__reduce__()
(in
WeakSet
)
__enter__()
(in
_IterationGuard
)
__ixor__()
(in
WeakSet
)
__repr__()
(in
Point
)
__eq__()
(in
WeakSet
)
__le__()
(in
WeakSet
)
__repr__()
(in
Quaternion
)
__exit__()
(in
_IterationGuard
)
__len__()
(in
WeakSet
)
_apply()
(in
WeakSet
)
__ge__()
(in
WeakSet
)
__new__()
(in
Point
)
_asdict()
(in
Point
)
__getnewargs__()
(in
Point
)
__new__()
(in
Quaternion
)
_asdict()
(in
Quaternion
)
__getnewargs__()
(in
Quaternion
)
__package__
(in
intera_control
)
_camera_streaming_status()
(in
Cameras
)
__getstate__()
(in
Point
)
__package__
(in
intera_control.pid
)
_commit_removals()
(in
WeakSet
)
__getstate__()
(in
Quaternion
)
__package__
(in
intera_dataflow
)
_config_callback()
(in
Cuff
)
__hash__
(in
WeakSet
)
__package__
(in
intera_dataflow.signals
)
_config_callback()
(in
Gripper
)
__iand__()
(in
WeakSet
)
__package__
(in
intera_dataflow.wait_for'
)
_fields
(in
Point
)
__init__()
(in
PID
)
__package__
(in
intera_dataflow.weakrefset
)
_fields
(in
Quaternion
)
__init__()
(in
Signal
)
__package__
(in
intera_interface
)
_get_item_state()
(in
Navigator
)
__init__()
(in
WeakSet
)
__package__
(in
intera_interface.camera
)
_IterationGuard
(in
intera_dataflow.weakrefset
)
__init__()
(in
_IterationGuard
)
__package__
(in
intera_interface.cfg.SawyerPositionFFJointTrajectoryActionServerConfig
)
_log_networking_error()
(in
RobotParams
)
__init__()
(in
Cameras
)
__package__
(in
intera_interface.cfg.SawyerPositionJointTrajectoryActionServerConfig
)
_make()
(in
Point
)
__init__()
(in
Cuff
)
__package__
(in
intera_interface.cfg.SawyerVelocityJointTrajectoryActionServerConfig
)
_make()
(in
Quaternion
)
__init__()
(in
DigitalIO
)
__package__
(in
intera_interface.cfg
)
_on_collision_state()
(in
Limb
)
__init__()
(in
Gripper
)
__package__
(in
intera_interface.cuff
)
_on_endpoint_states()
(in
Limb
)
__init__()
(in
Head
)
__package__
(in
intera_interface.digital_io
)
_on_head_state()
(in
Head
)
__init__()
(in
HeadDisplay
)
__package__
(in
intera_interface.gripper
)
_on_io_state()
(in
DigitalIO
)
__init__()
(in
Lights
)
__package__
(in
intera_interface.head
)
_on_joint_states()
(in
Limb
)
__init__()
(in
Limb
)
__package__
(in
intera_interface.head_display
)
_replace()
(in
Point
)
__init__()
(in
Navigator
)
__package__
(in
intera_interface.lights
)
_replace()
(in
Quaternion
)
__init__()
(in
RobotEnable
)
__package__
(in
intera_interface.limb
)
_set()
(in
SetCommand
)
__init__()
(in
RobotParams
)
__package__
(in
intera_interface.navigator
)
_setup_image()
(in
HeadDisplay
)
__init__()
(in
IOCommand
)
__package__
(in
intera_interface.robot_enable
)
_state_callback()
(in
RobotEnable
)
__init__()
(in
SetCommand
)
__package__
(in
intera_interface.robot_params
)
_time_changed()
(in
intera_io.io_interface
)
__init__()
(in
IODeviceInterface
)
__package__
(in
intera_interface.settings
)
_toggle_enabled()
(in
RobotEnable
)
__init__()
(in
IOInterface
)
__package__
(in
intera_io
)
__ior__()
(in
WeakSet
)
__package__
(in
intera_io.io_command
)
Home
Trees
Indices
Help
Project Homepage
Generated by Epydoc 3.0.1 on Tue Dec 6 15:22:10 2016
http://epydoc.sourceforge.net


|
|
virtual bool | CheckResources () |
| |
|
bool | Dx11Support () |
| |
|
|
Material | CheckShaderAndCreateMaterial (Shader s, Material m2Create) |
| |
|
Material | CreateMaterial (Shader s, Material m2Create) |
| |
|
bool | CheckSupport () |
| |
|
void | Start () |
| |
|
bool | CheckSupport (bool needDepth) |
| |
|
bool | CheckSupport (bool needDepth, bool needHdr) |
| |
|
void | ReportAutoDisable () |
| |
|
void | NotSupported () |
| |
|
void | DrawBorder (RenderTexture dest, Material material) |
| |
|
|
bool | supportHDRTextures = true |
| |
|
bool | supportDX11 = false |
| |
|
bool | isSupported = true |
| |
The documentation for this class was generated from the following file:
- Assets/Shopify/Examples/PostEffects/PostEffectsBase.cs


New Customer?
Ordered Before?
Before we get started taking your order it looks like you haven't verified your email. Please go check your
inbox.
Serving your daily pizza cravings! Available through online order only.
Let's get Started. Are you picking this up or are we brining it to you?
Where are we delivering? Put in your Address:
Cart
Price: $
Pizza(s)
Side(s)
Order History: