--- title: Getting Started With Foundation CSS ---
First, after you unzip the package, move the folder to your desired location and open it in a text editor. If you don't have one already, we use Sublime Text here at ZURB because it's very customizable, powerful, and simply rocks.
The ```index.html``` is your homepage. It has been linked up with foundation.css, normalize, and all the necessary JavaScript files for you. Just add your code between the ```
``` tags.Next, you should create a new stylesheet and link it in the header of your HTML file, like so:
{{#markdown}} ``` ``` {{/markdown}}Note: At ZURB, we call our custom stylesheets ```app.css```. This is important for updating purposes: if you are going to add custom stylings to Foundation components, the code should be copied into your ```app.css``` file and edited there.
The default CSS for Foundation is kept here. You can find the component and and its settings there. You will use this file as you are developing because it's easier to read.
A minified, much smaller CSS file you can use if you don't need or want to pick apart the actual underlying Foundation CSS.
We've included a copy of Normalize here to give you the option to remove quirks in browsers so that all webpages render elements consistently. We recommend you use this because some Foundation styles are dependant on it.
If you are using any Foundation JavaScript components, this needs to be loaded on the page. We recommend at the end before your closing ```
``` tags like so: {{#markdown}} ```html {{> examples_css_javascript_include}} ``` {{/markdown}}This is a directory that contains each plugin as a single JavaScript file, so you can check out the source code. And if you'd like, include certain ones but not others, or do your own minifying.
This folder contains a few external JS files that Foundation makes use of including: Modernizr, another open-source tool from Paul Irish and Nicolas Gallagher, as well as jQuery 2.
This is an example index file which contains some sample markup (the grid, buttons, etc) as well as the basic structure of a responsive Foundation page. Feel free to change or destroy this file as you see fit, just bear in mind that some of the document ```
``` is required for the page to work including the CSS/JS that is linked up at the end of the document.Located in the site root just next to the robots.txt file. You don't have to use if you don't want. You can mention the developer, the designer, the copywriter, the webmaster, the SEO, SEM or SMO. Name as many people who helped make the site, or not.
Website owners use the robots.txt file to give instructions about their site to web-crawling robots (also known as Web Wanderers, Crawlers, or Spiders). This is called The Robots Exclusion Protocol. Adding this page allows you to block web robots from indexing parts of your site. You can read more about it here.
In order to update your Foundation CSS when we release a new version, we recommend keeping your ```foundation.css``` file clean of any changes. Any components that you want to add your own stylings to should be copied to your ```app.css``` file where you can make changes there.
Note: be sure to link the ```app.css``` stylesheet into the ```
``` of your file.


Home
About Me
My Work
Note Taker
A web-powered note-taking app.
Deployed Version:
here
Github Repository:
here


HOME
RECENT
UPCOMING
ABOUT
CONTACT
FUTURAMA
HOME
RECENT
UPCOMING
ABOUT
CONTACT
T.M.
Half Researcher, Half Developer.


|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object com.ebay.erl.mobius.core.builder.AbstractDatasetBuilder<ACUTAL_BUILDER_IMPL>
ACUTAL_BUILDER_IMPL
- the implementation of a AbstractDatasetBuilder
.public abstract class AbstractDatasetBuilder<ACUTAL_BUILDER_IMPL>
The base class of all Dataset
builders which builds
instance of different Dataset
.
This product is licensed under the Apache License, Version 2.0, available at http://www.apache.org/licenses/LICENSE-2.0. This product contains portions derived from Apache hadoop which is licensed under the Apache License, Version 2.0, available at http://hadoop.apache.org. © 2007 – 2012 eBay Inc., Evan Chiu, Woody Zhou, Neel Sundaresan
| Field Summary | |
|---|---|
protected java.util.List<ComputedColumns> |
computedColumns
The ComputedColumns for this dataset. |
protected java.lang.String |
datasetName
name of this dataset. |
protected MobiusJob |
mobiusJob
An instance of MobiusJob which contains
the analysis flow. |
| Constructor Summary | |
|---|---|
protected |
AbstractDatasetBuilder(MobiusJob aJob,
java.lang.String datasetName)
Constructor for creating a dataset builder. |
| Method Summary | |
|---|---|
ACUTAL_BUILDER_IMPL |
addComuptedColumn(ComputedColumns aComputedColumn)
Add a ComputedColumns to this dataset. |
protected ACUTAL_BUILDER_IMPL |
addInputPath(boolean validatePathExistance,
org.apache.hadoop.fs.Path... paths)
Add the paths to the underline dataset. |
ACUTAL_BUILDER_IMPL |
addInputPath(org.apache.hadoop.fs.Path... paths)
Specify the input path(s) of a Dataset . |
Dataset |
build()
Finishing the Dataset building process. |
Dataset |
buildFromPreviousJob(org.apache.hadoop.mapred.JobConf prevJob,
java.lang.Class<? extends org.apache.hadoop.mapred.FileOutputFormat> prevJobOutputFormat,
java.lang.String[] schema)
To be called by Mobius engine, for building a dataset from a previous mobius job, user should not use this method. |
protected boolean |
checkTouchFile(org.apache.hadoop.fs.FileSystem fs,
org.apache.hadoop.fs.Path aPath)
Check if there is a touch file exist within the given aFolder . |
ACUTAL_BUILDER_IMPL |
constraint(TupleCriterion criteria)
Put filter on the records of this Dataset , only
raw within the Dataset that meet the criteria
can be outputed. |
protected Dataset |
getDataset()
Get the dataset , if it's null,
then newDataset(String) will be called
and assign dataset to the return object. |
protected abstract Dataset |
newDataset(java.lang.String datasetName)
Create a new Dataset , the returned Dataset
has no state at all (no paths, constraints...etc.) |
ACUTAL_BUILDER_IMPL |
setSchema(java.lang.String... schema)
Specify the schema of this Dataset |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Field Detail |
|---|
protected MobiusJob mobiusJob
MobiusJob
which contains
the analysis flow.
protected java.lang.String datasetName
protected java.util.List<ComputedColumns> computedColumns
ComputedColumns
for this dataset.
| Constructor Detail |
|---|
protected AbstractDatasetBuilder(MobiusJob aJob, java.lang.String datasetName)
| Method Detail |
|---|
protected Dataset getDataset()
dataset
, if it's null,
then newDataset(String)
will be called
and assign dataset
to the return object.
protected abstract Dataset newDataset(java.lang.String datasetName)
Dataset
, the returned Dataset
has no state at all (no paths, constraints...etc.)
public Dataset buildFromPreviousJob(org.apache.hadoop.mapred.JobConf prevJob, java.lang.Class<? extends org.apache.hadoop.mapred.FileOutputFormat> prevJobOutputFormat, java.lang.String[] schema) throws java.io.IOException
java.io.IOException
public ACUTAL_BUILDER_IMPL setSchema(java.lang.String... schema)
Dataset
public ACUTAL_BUILDER_IMPL addComuptedColumn(ComputedColumns aComputedColumn)
ComputedColumns
to this dataset.
ComputedColumns
public Dataset build() throws java.lang.IllegalStateException
Dataset
building process.
Invoke this method to get an reference to a Dataset
so it can be used in MobiusJob.innerJoin(Dataset...)
,
MobiusJob.list(Dataset, com.ebay.erl.mobius.core.model.Column...)
...etc.
Dataset
java.lang.IllegalStateException
- when the user doesn't specify all the required
parameters (no input path, for example) during the building process.public ACUTAL_BUILDER_IMPL addInputPath(org.apache.hadoop.fs.Path... paths) throws java.io.IOException
Dataset
.
paths
- one or more path that contain the dataset of
java.io.IOException
protected boolean checkTouchFile(org.apache.hadoop.fs.FileSystem fs, org.apache.hadoop.fs.Path aPath)
aFolder
.
This method is invoked when user use addInputPath(Path...)
, and
return true by default, i.e., do not check touch file. Touch file is
used in to indicate the files for a dataset are all ready, if the
deployed Hadoop system will generate touch file for a Hadoop output folder,
user should override this method to enable the touch file checking.
fs
- aFolder
-
protected ACUTAL_BUILDER_IMPL addInputPath(boolean validatePathExistance, org.apache.hadoop.fs.Path... paths) throws java.io.IOException
paths
to the underline dataset. A boolean
flag validatePathExistance
to specify if Mobius
needs to verify the specified paths
exist or not.
If validatePathExistance
is true, and one of the
paths
doesn't exist, IOException
will
be thrown.
If a path exists and it's a folder, checkTouchFile(FileSystem, Path)
will be called to see if a touch file exists under that folder or not.
The default implementation of checkTouchFile
always return
true, which means the dataset builder doesn't check touch file by default.
If this is a need to check touch file, the subclass should override that
function, and when the funciton return false, IOException
will be thrown here for that specific path.
java.io.IOException
public ACUTAL_BUILDER_IMPL constraint(TupleCriterion criteria)
Dataset
, only
raw within the Dataset
that meet the criteria
can be outputed.
criteria
-
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |


--- layout: "post" title: My Github account is neither a CV nor a portfolio permalink: /about/github.html ---
For a long time I didn't have a link to my github profile. I did this because this site gets visited by recruiters, and I would prefer not to have them use the quality of my hacky little side projects as a reflection of my talent as an engineer.
It's kind of unfortunate that our community has gotten to a place where I'm hesitant to work on something new because of how it might affect my ability to get a job; removing links to my github account helped alleviate that a little.
At some point I will probably have to compile a portfolio and put it on this webpage. Until then, I don't have a portfolio and I do not consider github.com/davidbstein
to be an accurate or appropriate substitute.


The moment one customer pays you a lot more than any other customer, you’re no longer a product but a consulting company working for the big payers. You’ll do what they say.
Self-sufficient.
We would never allow a customer to pay more than top-tier price. If you’re a bit company with special demands, we don’t want your money.
We wanted to build a self-service software company. Not need an army of key account managers keeping the whales happy.
Strength of numbers. Not large numbers of dollars. But large numbers of customers. Diverse customer base.


Coding Guidelines for Integral Constant Expressions
Integral Constant Expressions are used in many places in C++; as array bounds, as bit-field lengths, as enumerator initialisers, and as arguments to non-type template parameters. However many compilers have problems handling integral constant expressions; as a result of this, programming using non-type template parameters in particular can be fraught with difficulty, often leading to the incorrect assumption that non-type template parameters are unsupported by a particular compiler. This short article is designed to provide a set of guidelines and workarounds that, if followed, will allow integral constant expressions to be used in a manner portable to all the compilers currently supported by boost. Although this article is mainly targeted at boost library authors, it may also be useful for users who want to understand why boost code is written in a particular way, or who want to write portable code themselves.
What is an Integral Constant Expression?
Integral constant expressions are described in section 5.19 of the standard, and are sometimes referred to as "compile time constants". An integral constant expression can be one of the following:
- A literal integral value, for example
0u
or3L
. - An enumerator value.
- Global integral constants, for example:
const int my_INTEGRAL_CONSTANT = 3;
- Static member constants, for example:
struct myclass { static const int value = 0; };
- Member enumerator values, for example:
struct myclass { enum{ value = 0 }; };
- Non-type template parameters of integral or enumerator type.
- The result of a
sizeof
expression, for example:sizeof(foo(a, b, c))
- The result of a
static_cast
, where the target type is an integral or enumerator type, and the argument is either another integral constant expression, or a floating-point literal. - The result of applying a binary operator to two integral
constant expressions:
INTEGRAL_CONSTANT1 op INTEGRAL_CONSTANT2
provided that the operator is not an assignment operator, or comma operator. - The result of applying a unary operator to an integral
constant expression:
op INTEGRAL_CONSTANT1
provided that the operator is not the increment or decrement operator.
Coding Guidelines
The following guidelines are declared in no particular order (in other words you need to obey all of them - sorry!), and may also be incomplete, more guidelines may be added as compilers change and/or more problems are encountered.
When declaring constants that are class members always use
the macro BOOST_STATIC_CONSTANT.
template <class T> struct myclass { BOOST_STATIC_CONSTANT(int, value = sizeof(T)); };
Rationale: not all compilers support inline initialisation of member constants, others treat member enumerators in strange ways (they're not always treated as integral constant expressions). The BOOST_STATIC_CONSTANT macro uses the most appropriate method for the compiler in question.
Don't declare integral constant expressions whose type is wider than int.
Rationale: while in theory all integral types are usable in
integral constant expressions, in practice many compilers limit
integral constant expressions to types no wider than
int
.
Don't use logical operators in integral constant expressions; use template meta-programming instead.
The header <boost/type_traits/ice.hpp>
contains a number of workaround templates, that fulfil the role
of logical operators, for example instead of:
INTEGRAL_CONSTANT1 || INTEGRAL_CONSTANT2
Use:
::boost::type_traits::ice_or<INTEGRAL_CONSTANT1,INTEGRAL_CONSTANT2>::value
Rationale: A number of compilers (particularly the Borland and Microsoft compilers), tend to not to recognise integral constant expressions involving logical operators as genuine integral constant expressions. The problem generally only shows up when the integral constant expression is nested deep inside template code, and is hard to reproduce and diagnose.
Don't use any operators in an integral constant expression used as a non-type template parameter
Rather than:
typedef myclass<INTEGRAL_CONSTANT1 == INTEGRAL_CONSTANT2> mytypedef;
Use:
typedef myclass< some_symbol> mytypedef;
Where some_symbol
is the symbolic name of a an
integral constant expression whose value is
(INTEGRAL_CONSTANT1 == INTEGRAL_CONSTANT2).
Rationale: the older EDG based compilers (some of which are used in the most recent version of that platform's compiler), don't recognise expressions containing operators as non-type template parameters, even though such expressions can be used as integral constant expressions elsewhere.
Always use a fully qualified name to refer to an integral constant expression.
For example:
typedef
myclass< ::boost::is_integral<some_type>::value> mytypedef;
Rationale: at least one compiler (Borland's), doesn't
recognise the name of a constant as an integral constant
expression unless the name is fully qualified (which is to say
it starts with ::
).
Always leave a space after a '<
' and before
'::
'
For example:
typedef myclass< ::boost::is_integral<some_type>::value> mytypedef; ^ ensure there is space here!
Rationale: <:
is a legal digraph in it's own
right, so <::
is interpreted as the same as
[:
.
Don't use local names as integral constant expressions
Example:
template <class T> struct foobar { BOOST_STATIC_CONSTANT(int, temp = computed_value); typedef myclass<temp> mytypedef; // error };
Rationale: At least one compiler (Borland's) doesn't accept this.
Although it is possible to fix this by using:
template <class T> struct foobar { BOOST_STATIC_CONSTANT(int, temp = computed_value); typedef foobar self_type; typedef myclass<(self_type::temp)> mytypedef; // OK };
This breaks at least one other compiler (VC6), it is better to move the integral constant expression computation out into a separate traits class:
template <class T> struct foobar_helper { BOOST_STATIC_CONSTANT(int, value = computed_value); }; template <class T> struct foobar { typedef myclass< ::foobar_helper<T>::value> mytypedef; // OK };
Don't use dependent default parameters for non-type template parameters.
For example:
template <class T, int I = ::boost::is_integral<T>::value> // Error can't deduce value of I in some cases. struct foobar;
Rationale: this kind of usage fails for Borland C++. Note that this is only an issue where the default value is dependent upon a previous template parameter, for example the following is fine:
template <class T, int I = 3> // OK, default value is not dependent struct foobar;
Unresolved Issues
The following issues are either unresolved or have fixes that are compiler specific, and/or break one or more of the coding guidelines.
Be careful of numeric_limits
There are three issues here:
- The header <limits> may be absent - it is recommended that you never include <limits> directly but use <boost/pending/limits.hpp> instead. This header includes the "real" <limits> header if it is available, otherwise it supplies it's own std::numeric_limits definition. Boost also defines the macro BOOST_NO_LIMITS if <limits> is absent.
- The implementation of std::numeric_limits may be defined in such a way that its static-const members may not be usable as integral constant expressions. This contradicts the standard but seems to be a bug that affects at least two standard library vendors; boost defines BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS in <boost/config.hpp> when this is the case.
- There is a strange bug in VC6, where the members of std::numeric_limits can be "prematurely evaluated" in template code, for example:
template <class T> struct limits_test { BOOST_STATIC_ASSERT(::std::numeric_limits<T>::is_specialized); };
This code fails to compile with VC6 even though no instances
of the template are ever created; for some bizarre reason
::std::numeric_limits<T>::is_specialized
always evaluates to false, irrespective of what the template
parameter T is. The problem seems to be confined to expressions
which depend on std::numeric_limts: for example if you replace
::std::numeric_limits<T>::is_specialized
with ::boost::is_arithmetic<T>::value
, then
everything is fine. The following workaround also works but
conflicts with the coding guidelines:
template <class T> struct limits_test { BOOST_STATIC_CONSTANT(bool, check = ::std::numeric_limits<T>::is_specialized); BOOST_STATIC_ASSERT(check); };
So it is probably best to resort to something like this:
template <class T> struct limits_test { #ifdef BOOST_MSVC BOOST_STATIC_CONSTANT(bool, check = ::std::numeric_limits<T>::is_specialized); BOOST_STATIC_ASSERT(check); #else BOOST_STATIC_ASSERT(::std::numeric_limits<T>::is_specialized); #endif };
Be careful how you use the sizeof operator
As far as I can tell, all compilers treat sizeof expressions correctly when the argument is the name of a type (or a template-id), however problems can occur if:
- The argument is the name of a member-variable, or a local variable (code may not compile with VC6).
- The argument is an expression which involves the creation of a temporary (code will not compile with Borland C++).
- The argument is an expression involving an overloaded function call (code compiles but the result is a garbage value with Metroworks C++).
Don't use boost::is_convertible unless you have to
Since is_convertible is implemented in terms of the sizeof operator, it consistently gives the wrong value when used with the Metroworks compiler, and may not compile with the Borland's compiler (depending upon the template arguments used).


My name is Fayas. I am a 16 years old boy and I was born on 30th December in 2005. I am a 10th standard finished student. I'm living in Palakkad, Kerala, India. I know Malayalam, Tamil, and English languages. I am an Opensource Developer.
You can send messages via email or you can contact me via my accounts and please follow / subscribe / join my accounts.
I created more public projects like APIs, Python Packages, Opensource Repositories etc. You can checkout my projects here.
Your donation needed for me. Please donate any amount via my donation links.
Puliyaparambu Higher Secondary School - Finished 10th standard ( High School )


How much do games cost on Google Stadia?
by Adam SpeightGoogle Stadia is out tomorrow and we know pretty much all there is to know about the new streaming platform. One thing that is yet to be fully revealed is the price of Google Stadia games – but here’s what we know so far.
Google has not revealed pricing for games just yet – so we’ll have to wait for the launch of Stadia tomorrow. However, some choice comments from Stadia boss Phil Harrison do give some indication of what we can expect.
Related: Google Stadia Review
How much do games cost on Google Stadia?
Back in June, Harrison told Eurogamer: “I don’t know why it would be cheaper,” when speaking about Stadia game pricing in relation to Xbox One and PlayStation 4. This is the clearest bit of information we have thus far on Google Stadia games pricing.
“The value you get from the game on Stadia means you can play it on any screen in your life – TV, PC, laptop, tablet, phone … I think that is going to be valuable to players.” He continued, “In theory, the Stadia version of a game is going to be at the highest-possible quality of innovation and sophistication on the game engine side.”
While Harrison questioned why the games would be any cheaper, he stated that this isn’t something Google is in sole control of.
“The publisher or the developer is in as much control of the prices as we are, so it’s a bit difficult for me to say what the prices will be right now … But, we’re obviously going to be very aware of prevailing prices in the marketplace.”
Related: Xbox 2 vs Google Stadia
Based on Harrison’s comments, we are expecting the pricing to fall in line with pricing on other digital stores. However, nothing has been confirmed and there’s everything possibility the prices could be higher or lower come launch.
Unlike other sites, we thoroughly review everything we recommend, using industry standard tests to evaluate products. We’ll always tell you what we find. We may get a commission if you buy via our price links. Tell us what you think – email the Editor


Map Debugger
{{> googleMap name="dataMap" options=dataMapOptions}}
The map markers are from http://www.benjaminkeen.com/google-maps-coloured-markers/.
Locations without entrances assigned
{{#each locNoEntrance}}
- {{name}}
{{/each}}
Locations without nearby locations
{{#each locNoNearby}}
- {{name}}
{{/each}}
Stats
- # points: {{numPoints}}
- # entrances: {{numEntrances}} ({{numIEntrances}} internal)
- # crossings: {{numCrossings}} ({{numICrossings}} internal)
- # locations: {{numLocs}}
- # paths: {{numPaths}}


Protean uses two ports - an admin port and an API port. The API port is used for simulating your RESTful services.
The admin port is used to manage your service definitions. You can override the default API and admin ports with
java -jar protean.jar -Dadmin.port=4001 -Dsim.port=4000
or use environment variables ADMIN_PORT and SIM_PORT.
This will launch the app with the admin port set to 4001 and the API port set to 4000.
Protean works with the concepts of services and resources. Services are your RESTful API's, comprised of one or more RESTful resources. We configure one or more services in a Protean codex. A codex is written in a JSON like format called EDN (Extensible Data Notation) which uses a .edn extension.
Protean has a defaut sample service codex out of the box. Any codex in the same directory as the runnable jar will be loaded on app startup. Alternatively you can add new services to Protean with
curl -v -X PUT http://locahost:3001/services --data-binary<EMAIL_ADDRESS>or protean-cli add-services -f /path/to/service.edn
List all services:
curl -v http://localhost:3001/services or protean-cli services
Show a service configuration:
curl -v http://localhost:3001/services/sample or protean-cli service -n sample
List curl commands for service resources:
curl -v http://localhost:3001/services/sample/usage or protean-cli service-usage
See the API documentation, or explore the CLI or documentation for other commands.
Protean can generate shiny API documentation for your services. To do this it uses Silk.
Below is the command for generating documentation for the out of the box service/codex:
protean visit -f sample-codex.edn -b '{"locs":["sample"], "commands":["doc"],"directory":"/path/to/site/protean-sample-docs/data/api"}'
Here we do several things:
sample
service (all endpoints) in the locs (locations) directivedoc
commanddata/api
)
silk spin
can now be run in the root of your silk site to construct the apidocs site.
Protean can automatically generate integration tests for simulations or real API's. It is possible to specify the surface are of the API to range over for testing and the rigour to apply in the test process. The order in which to test the endpoints is figured out.
protean visit -f ~/sample-codex.edn -b '{"locs":["sample"], "commands":["test"], "config":{"test-level":1}}'
sample
in the locs directivetest
commandtest-level
1 which is the least rigorousprotean visit -f ~/sample-codex.edn -b '{"host": "some-host", "port": 11080, "locs":["sample"], "commands":["test"], "config":{"test-level":1}}'
See test codex for a sample of a codex which could enable this kind of auto integration test generation.
protean visit -f ~/sample-codex.edn -b '{"host": "some-host", "port": 11080, "locs":["sample header xml"], "commands":["test"], "config":{"test-level":1}}'
protean visit -f ~/some-service.edn -b '{"host": "some-host", "port": 11080, "locs":["svc1", "svc2"], "commands":["test"], "config":{"test-level":1}}'
The simplest possible example of a codex is listed below:
{:simple {:paths {"path/data" {:get {}}}}}
This creates a single resource which can be accessed with curl -v http://localhost:3000/simple/path/data
. This will return a 200 response
with no body. Protean makes use where appropriate of sensible defaults for HTTP/REST. Here as we do not specify a request method a GET is inferred, and as we do not specify a response status code we assume the default for a GET - 200.
It is possible to define more complex simulated API's. Below is the out of the box sample service API. This demonstrates a range of simulation features such as error codes, probability of error and slow response times.
{ :sample { :paths { "simple" { :get { :doc "A get on sample/simple - doc is optional" } } "multimethod" { :get { :doc "A get on sample/multimethod" } :put { :doc "A put on sample/multimethod" } } "test/*" { :get { :doc "Get with path parameter wildcard and configurable error and probability" :rsp { :body {"t1key" "t1val"} :errors {:status [504] :probability 50} } } } "xml" { :get { :doc "Get with XML content type/response" :rsp { :headers {"Content-Type" "text/xml"} :body [:parent [:child {:type "xml"}]] } } } "test" { :get { :doc "Get with mandatory request headers/query str params" :req { :headers {"X-Auth" "XYZ"} :query-params {:required {"blurb" "flibble"}} } :rsp {:body {"t2key" "t2val"}} } :post { :doc "Post with mandatory request url encoded form" :req {:form-params {"k1" "v1"}} :rsp {:headers {"Location" "7"}} } :put { :doc "Put with mandatory body payload - defaults to JSON, demonstrates overriding response status code" :req {:body {"k1" "v1" "k2" "v2"}} :rsp {:status 200} } :delete {:doc "Delete sample"} } "slow" { :get { :doc "Get with slow response (secs) - useful for testing timeouts" :rsp {:time 2} } } } :errors {:status [500 503] :probability 25} } }
With a little more metadata added it is possible for Protean to automatically generate integration tests for either a simluation, or the real API behind it. We may need to know how to dig a specific item out of a composite datastructure in the result. For this we use the :body-res directive. Below is a sample of a codex from the Protean Beers sample API project.
{ :beers { :paths { "token" { :get { :doc "Get an auth token" :rsp { :body-res "access_token" :body {"access_token" "mytoken" "token_type" "bearer"} } } } ... "starches/pick" { :get { :doc "Get a starch source suitable for a specific drink type" :req { :headers {"Authorization" "psv+Bearer token"} :query-params {:required {"drink" "psv+drink"}} } :rsp { :headers {"Content-Type" "text/plain"} :body "/starches/malted-grain" } } } ... "flavourings/pick" { :get { :doc "Get a flavouring suitable for a specific drink type" :req { :headers {"Authorization" "psv+Bearer token"} :query-params {:required {"drink" "psv+drink"}} } :rsp { :headers {"Content-Type" "text/plain"} :body "/flavourings/golding-hops" } } } "brew" { :post { :doc "Brew a drink given a bag of ingredients" :req { :headers {"Authorization" "psv+Bearer token" "Content-Type" "application/json"} :body { "starch" "/starches/psv+" "yeast" "/yeasts/psv+" "flavouring" "/flavourings/psv+" } } :rsp {:body "/drinks/ale"} } } } } }


ACT III
SCENE 2. Another part of the island.
Enter CALIBAN, STEPHANO, and TRINCULOSTEPHANO
Tell not me; when the butt is out, we will drinkTRINCULO
water; not a drop before: therefore bear up, and
board 'em. Servant-monster, drink to me.
Servant-monster! the folly of this island! TheySTEPHANO
say there's but five upon this isle: we are three
of them; if th' other two be brained like us, the
state totters.
Drink, servant-monster, when I bid thee: thy eyesTRINCULO
are almost set in thy head.
STEPHANO
Where should they be set else? he were a brave
monster indeed, if they were set in his tail.
TRINCULO
My man-monster hath drown'd his tongue in sack:
for my part, the sea cannot drown me; I swam, ere I
could recover the shore, five and thirty leagues off
and on. By this light, thou shalt be my lieutenant,
monster, or my standard.
STEPHANO
Your lieutenant, if you list; he's no standard.
TRINCULO
We'll not run, Monsieur Monster.

CALIBAN
Moon-calf, speak once in thy life, if thou beest a
good moon-calf.
TRINCULO
How does thy honour? Let me lick thy shoe.
I'll not serve him; he's not valiant.
CALIBAN
Thou liest, most ignorant monster: I am in case to
justle a constable.  Wilt thou tell a monstrous lie,
being but half a fish and half a monster?
TRINCULO
Lo, how he mocks me! wilt thou let him, my lord?
CALIBAN
'Lord' quoth he!
STEPHANO
Lo, lo, again! bite him to death, I prithee.
CALIBAN
Trinculo, keep a good tongue in your head: if you
prove a mutineer,--the next tree! The poor monster's
my subject and he shall not suffer indignity.
STEPHANO
I thank my noble lord. Wilt thou be pleased to
hearken once again to the suit I made to thee?
CALIBAN
Marry, will I kneel and repeat it; I will stand,
and so shall Trinculo.
Enter ARIEL, invisible
ARIEL
As I told thee before, I am subject to a tyrant, a
sorcerer, that by his cunning hath cheated me of the island.
CALIBAN
Thou liest.
 I do not lie.
TRINCULO
Trinculo, if you trouble him any more in's tale, by
this hand, I will supplant some of your teeth.
STEPHANO
Why, I said nothing.
CALIBAN
Mum, then, and no more. Proceed.
STEPHANO
I say, by sorcery he got this isle;
From me he got it. if thy greatness will
Revenge it on him,--for I know thou darest,
But this thing dare not,--
CALIBAN
That's most certain.
STEPHANO
Thou shalt be lord of it and I'll serve thee.
CALIBAN
How now shall this be compassed?
Canst thou bring me to the party?
ARIEL
Yea, yea, my lord: I'll yield him thee asleep,
Where thou mayst knock a nail into his bead.
CALIBAN
Thou liest; thou canst not.
STEPHANO
What a pied ninny's this! Thou scurvy patch!
I do beseech thy greatness, give him blows
And take his bottle from him: when that's gone
He shall drink nought but brine; for I'll not show him
Where the quick freshes are.
TRINCULO
Trinculo, run into no further danger:
interrupt the monster one word further, and,
by this hand, I'll turn my mercy out o' doors
and make a stock-fish of thee.
STEPHANO
Why, what did I? I did nothing.
ARIEL
Didst thou not say he lied?
STEPHANO
Thou liest.
TRINCULO
Do I so? take thou that.
Beats TRINCULO
As you like this, give me the lie another time.
CALIBAN
I did not give the lie. Out o' your
wits and bearing too? A pox o' your bottle!
this can sack and drinking do. A murrain on
your monster, and the devil take your fingers!
STEPHANO
Ha, ha, ha!
CALIBAN
Now, forward with your tale.
STEPHANO
Beat him enough: after a little time
I'll beat him too.
CALIBAN
Stand farther. Come, proceed.
STEPHANO
Why, as I told thee, 'tis a custom with him,
I' th' afternoon to sleep: there thou mayst brain him,
Having first seized his books, or with a log
Batter his skull, or paunch him with a stake,
Or cut his wezand with thy knife. Remember
First to possess his books; for without them
He's but a sot, as I am, nor hath not
One spirit to command: they all do hate him
As rootedly as I. Burn but his books.
He has brave utensils,--for so he calls them--
Which when he has a house, he'll deck withal
And that most deeply to consider is
The beauty of his daughter; he himself
Calls her a nonpareil: I never saw a woman,
But only Sycorax my dam and she;
But she as far surpasseth Sycorax
As great'st does least.
CALIBAN
Is it so brave a lass?
STEPHANO
Ay, lord; she will become thy bed, I warrant.
And bring thee forth brave brood.
 Dost thou
like the plot, Trinculo?
STEPHANO
Excellent.
CALIBAN
Give me thy hand: I am sorry I beat thee; but,
while thou livest, keep a good tongue in thy head.
STEPHANO
Within this half hour will he be asleep:
Wilt thou destroy him then?
ARIEL
Ay, on mine honour.
CALIBAN
This will I tell my master.

CALIBAN
At thy request, monster, I will do reason, any
reason. Come on, Trinculo, let us sing.
Sings
Flout 'em and scout 'em
And scout 'em and flout 'em
Thought is free.
STEPHANO
That's not the tune.
Ariel plays the tune on a tabour and pipe
TRINCULO
What is this same?
STEPHANO
This is the tune of our catch, played by the picture
of Nobody.
TRINCULO
If thou beest a man, show thyself in thy likeness:
if thou beest a devil, take't as thou list.
STEPHANO
O, forgive me my sins!
CALIBAN
He that dies pays all debts: I defy thee. Mercy upon us!
STEPHANO
Art thou afeard?
CALIBAN
No, monster, not I.
STEPHANO
Be not afeard; the isle is full of noises,
Sounds and sweet airs, that give delight and hurt not.
Sometimes a thousand twangling instruments
Will hum about mine ears, and sometime voices
That, if I then had waked after long sleep,
Will make me sleep again: and then, in dreaming,
The clouds methought would open and show riches
Ready to drop upon me that, when I waked,
I cried to dream again.
CALIBAN
This will prove a brave kingdom to me, where I shall
have my music for nothing.
STEPHANO
When Prospero is destroyed.
TRINCULO
That shall be by and by: I remember the story.
STEPHANO
The sound is going away; let's follow it, and
after do our work.
TRINCULO
Lead, monster; we'll follow. I would I could see
this tabourer; he lays it on.
Wilt come? I'll follow, Stephano.
Exeunt


We are team if creative diverse, driven, innovative individuals working in various locations from the world.
PRODUCT OWNER
DEVELOPER
TECH LEAD
UX DESIGNER
ART DIRECTOR


Estimators¶
wintermute.estimators.atari_net module¶
Neural Network architecture for Atari games.
-
class
wintermute.estimators.atari_net.
AtariNet
(input_ch, hist_len, out_size, hidden_size=256, shared_bias=False)[source]¶ Bases:
torch.nn.modules.module.Module
Estimator used for ATARI games.
-
property
feature_extractor
¶
-
forward
(x)[source]¶ Defines the computation performed at every call.
Should be overridden by all subclasses.
Note
Although the recipe for forward pass needs to be defined within this function, one should call the
Module
instance afterwards instead of this since the former takes care of running the registered hooks while the latter silently ignores them.
-
property
head
¶
-
property
-
class
wintermute.estimators.atari_net.
BootstrappedAtariNet
(proto, boot_no=10, full=False)[source]¶ Bases:
torch.nn.modules.module.Module
-
forward
(x, mid=None)[source]¶ In training mode, when mid is provided, do an inference step through the ensemble component indicated by mid. Otherwise it returns the mean of the predictions of the ensemble.
- Args:
x (torch.tensor): input of the model mid (int): id of the component in the ensemble to train on x.
- Returns:
torch.tensor: the mean of the ensemble predictions.
-
wintermute.estimators.catch_net module¶
Neural Network architecture for low-dimensional games.
-
class
wintermute.estimators.catch_net.
CatchNet
(input_channels, hist_len, out_size, hidden_size=32)[source]¶ Bases:
torch.nn.modules.module.Module
-
forward
(x)[source]¶ Defines the computation performed at every call.
Should be overridden by all subclasses.
Note
Although the recipe for forward pass needs to be defined within this function, one should call the
Module
instance afterwards instead of this since the former takes care of running the registered hooks while the latter silently ignores them.
-


Survery Form
This survery form is very cool. Fill it.
Full Name
Email Address
Age
Gender
Male
Female
Languages
English
Arabic
Hausa
Choose your Qualification(s)
National Diploma
Higher National Diploma
Bachelors Degree
Qualifications
User comments:
Submit
send


Each and every day, I wake and walk with the sun behind me.
It starts low, climbing over hillsides, rising slowly.
It finds its temporary place amid the sky
and begins to color the Meseta.Front and center a shadow grows.
It looks at me with indifference – a mirror of my darker side.
Fear, insecurity, doubt,
The manifestation of my demons.Each and every day, I wake and walk to confront these demons.
If I fight and struggle, I hurt and suffer.
If I push them away, I push myself away.
I cannot hide, I cannot run,
I can only bear witness.Salvation lies within absence.
Dare I do it, dare I eclipse the sun?
No. To turn from the sun is to turn from the truth.
I would be swallowed whole.My shadow is here,
my shadow is me.
As long as I walk the Way,
it will keep me company.I must not be afraid
I must not close my eyes
I must continue on
Moving toward that rising dawn.Each and every day, I wake and walk towards Santiago.
The closer I get, the lighter I feel.
The sun hangs low, peering over hillsides, descending slowly.
Color fades from the Meseta, and my shadow is behind me.Westward lies Santiago. I look.
The sun has set, the dark has settled.
A fire is growing deep inside.
It lights the valley and shows me the Way.
I wake and walk toward the Light,
Closer and closer to Santiago.


Captain Mathias:
The Stakato Nest, where the Cannibalistic Stakato Chief lives, is a very dangerous place. Please be careful.


Iyan with egunsi soup- $40
this is the lord's doing and is marvelors in our sight, I love to eat good eba and iyan. Anike is a detailed-conscious individual, with strong analytical mind, excellent organization and management skills. Anike has ability to work effectively as an individual and as a team with excellent communication, leadership and interpersonal skills. Flexible and quick learner who can adapt and execute in any fast-pace environment. An experienced Human Resource Personnel, Customer Service Specialist with industry-leading technical skill in HR Management, Business Management, Customer Relationship Management and Business Marketing.


One moment please while we load our app
0% Complete
Password Recovery
Email:
Recover Password
Merchant Login
login
API Domain:
Keep me logged in
AdminUI Release #:
??
Recover Password
Advanced Login
Simple Login
Create An Account
Create Account
First Name:
Last Name:
Email:
Company/DBA:
company name will be your username. 10 char limit
Domain:
Phone:
» back to login
Create Account
About
|
Tasks
|
Exit
Logged in as:
on
▲
Setup
Sites & Apps
Product
Orders
CRM
Marketplaces
Reports
KPI
Utilities
Support
Messages
Close Message Panel
Clear All
Debugificator
Pages
showNewTemplateEditor
adminConfigDetail -> tuning
Launchpad
App Chooser
Trainer
showAchievementList (in setup)
Test
elastic-search
throw success message
adminSyndicationList
adminConfigDetail


PREPAID VENDING
POSTPAID VENDING
METER GROUPS
PREPAID HISTORY
POSTPAID HISTORY
FLOAT HISTORY
A convinient way for you to purchase pre-paid tokens or settle post paid bills in bulk.


Shop Name
Location
if map not showed, please see the source code and replace 'your_api_key_here' with yours api key
Submit


Compuer Components
Id
Name
Ammount
Functions
1
Laptop
1,500.99
EDIT
DELETE
2
Motherboards
37.70
EDIT
DELETE
3
Monitors
174.99
EDIT
DELETE
4
Mouse
13.99
EDIT
DELETE
5
Keyboard
14.50
EDIT
DELETE


JavaScript is disabled on your browser.
Package
Class
Tree
Deprecated
Index
Help
Prev
Next
Frames
No Frames
All Classes
A
C
D
E
G
I
K
M
P
R
S
T
V
W
A
add(Mzd)
- Method in class m4rjni.
Mzd
Computes [this] = [this] + [B].
add(Mzd, Mzd)
- Static method in class m4rjni.
Mzd
Same thing as above, but static method
C
concat(Mzd, Mzd)
- Static method in class m4rjni.
Mzd
Concatenate B to A and write the result to C.
copyRow(Mzd, int, Mzd, int)
- Static method in class m4rjni.
Mzd
copy row j from A to row i from B.
copyRows(Mzd, int, Mzd, int, int)
- Static method in class m4rjni.
Mzd
copy numRows rows of A, starting at row j, to B, starting at row i There is no corresponding function in m4ri, so this is implemented in terms of single row copies in the c wrapper
D
destroy()
- Method in class m4rjni.
Mzd
Deallocate the matrix.
E
echelonize(boolean)
- Method in class m4rjni.
Mzd
Row-reduce a matrix
equals(Mzd)
- Method in class m4rjni.
Mzd
Tests if B==this as matrices
G
getNcols()
- Method in class m4rjni.
Mzd
Get the number of columns in this object.
getNrows()
- Method in class m4rjni.
Mzd
Get the number of rows in this object.
I
identityMatrix(int)
- Static method in class m4rjni.
Mzd
Return the dim*dim identity matrix
info(boolean)
- Method in class m4rjni.
Mzd
Print out compact info about the matrix.
isZero()
- Method in class m4rjni.
Mzd
isZero()
K
kernelLeft(int)
- Method in class m4rjni.
Mzd
Solve X for A X = 0.
M
m4rjni
- package m4rjni
main(String[])
- Static method in class m4rjni.
Mzd
main() method.
multiply(Mzd, Mzd)
- Static method in class m4rjni.
Mzd
Naive cubic matrix multiplication.
multiplyLeft(Mzd)
- Method in class m4rjni.
Mzd
Naive cubic matrix multiplication on the left.
multiplyRight(Mzd)
- Method in class m4rjni.
Mzd
Naive cubic matrix multiplication on the right.
Mzd
- Class in
m4rjni
Mzd(int, int)
- Constructor for class m4rjni.
Mzd
Constructor Returns an m*n matrix of zeros.
Mzd(Mzd)
- Constructor for class m4rjni.
Mzd
Copy constructor
Mzd(int[][])
- Constructor for class m4rjni.
Mzd
handy constructor to initialize a matrix from an array of integers.
P
print()
- Method in class m4rjni.
Mzd
Print out the matrix.
R
randomize()
- Method in class m4rjni.
Mzd
Fill matrix M with uniformly distributed bits.
readBit(int, int)
- Method in class m4rjni.
Mzd
Read a specified bit from the matrix
rowAdd(int, int)
- Method in class m4rjni.
Mzd
Add the rows sourcerow and destrow and stores the total in the row destrow.
rowClearOffset(int, int)
- Method in class m4rjni.
Mzd
Clear the given row, but only begins at the column coloffset.
S
solveLeft(Mzd, Mzd, int, boolean)
- Static method in class m4rjni.
Mzd
Solves A X = B with A and B matrices.
srandom(int)
- Static method in class m4rjni.
Mzd
Call srandom for m4ri.
stack(Mzd, Mzd)
- Static method in class m4rjni.
Mzd
Stack A on top of B and write the result to C.
standardBasis(int)
- Static method in class m4rjni.
Mzd
Return an array of dim vectors from the standard basis
submatrix(Mzd, int, int, int, int)
- Method in class m4rjni.
Mzd
Copy a submatrix.
T
transpose()
- Method in class m4rjni.
Mzd
Transpose the matrix.
transpose(Mzd)
- Static method in class m4rjni.
Mzd
Transpose a matrix.
V
vsIntersect(Mzd, Mzd)
- Static method in class m4rjni.
Mzd
Return a matrix whose rows span the intersection of the rowspaces of U and W.
W
writeBit(int, int, int)
- Method in class m4rjni.
Mzd
Write a specified bit in the matrix
A
C
D
E
G
I
K
M
P
R
S
T
V
W
Package
Class
Tree
Deprecated
Index
Help
Prev
Next
Frames
No Frames
All Classes


Former eurosceptic Labour MP Kate Hoey says she'll vote for the DUP
BREXIT-supporting, former Labour MP Kate Hoey has said she plans to vote for the DUP in next month's election.
The former Vauxhall MP, who was born in Mallusk, Co Antrim, has declined to say in which constituency she will cast her vote.
However, The Irish News understands that Ms Hoey owns a holiday home in the North Antrim constituency and if registered would likely vote for friend and eurosceptic ally Ian Paisley.
The Northern Ireland-born MP, who announced she was standing down as Labour’s candidate for Vauxhall in London earlier this year, told radio station LBC that she would be casting her vote in the north.
"I’m actually going to be voting in Northern Ireland and unfortunately the Labour Party is so anti-democratic in Northern Ireland that they allow people to join but they don’t put up candidates," she said.
"So I’ll be voting for a pro-union candidate in Northern Ireland."
When asked whether that meant she would be voting for the DUP, she said: “It will be DUP, yes where I’m likely to be voting.”
She added: "I’m pro-union. I would not dream of voting for Sinn Féin, I wouldn’t dream of voting for the SDLP and the Alliance Party is in hock with both."
When contacted yesterday by The Irish News, Ms Hoey declined to disclose where she would be voting.
"I will be voting for a genuine pro-union candidate obviously if I choose to vote in Northern Ireland," she said.


#imports
from __future__ import absolute_import
from __future__ import division
from __future__ import print_function
from builtins import object
import MDAnalysis as mda
import numpy as np
from mpl_toolkits.mplot3d import axes3d
import pybilt.plot_generation.plot_generation_functions as pgf
import matplotlib.pyplot as plt
import sys
from six.moves import range
[docs]class LipidVec(object):
""" A lipid vector object.
This object stores the coordinates corresponding to a vector representation
of a lipid (e.g. the PN vector); the object uses the wrapped coordinates.
This object also stores information about the type of lipid as well as the
total mass of the lipid.
"""
def __init__(self):
"""LipidVec initialization
Attributes:
resname (str): The lipid resname.
start (np.array): The length three vector holding the wrapped xyz
coordinates of the vector starting point.
end (np.array): The length three vector holding the wrapped xyz
coordinates of the vector end point.
vector (np.array): The length three vector (i.e end-start).
mass (float): The total mass of the atoms used to define LipidVec.
leaflet (str): The leaflet that the lipid is in can be stored here.
resid (int): The integer resid of the lipid.
"""
# lipid type/resname or other name
self.resname="UNK"
# wrapped coordinates
self.start=np.zeros(3)
self.end=np.zeros(3)
self.vector = np.zeros(3)
self.start_mass=1.0
self.end_mass = 1.0
self.mass = 1.0
self.leaflet = "UNK"
self.resid = 0
return
# The name of this function could be changed to be more desriptive, e.g.
# extract_com_mda_residue
# a Vector frame object
[docs]class VectorFrame(object):
""" A molecular dynamics style Frame object for LipidVec objects.
Atrributes:
lipidvec (list of obj:LipidVec): A list of the LipidVec objects assigned to the COMFrame.
box (np.array): A 3 element vector containing the (rectangular) xyz box edge lengths.
time (float): The simulation time that this Frame represents.
number (int): The frame number of this Frame.
mdnumber (int): The corresponding frame number in the original MD trajectory
"""
# does not check that nlipids is an int
def __init__(self, mda_frame, mda_bilayer_selection, ref_atoms):
""" Frame initialization.
Args:
mda_frame (MDAnalysis.Timestep): The MDAnalysis frame for the coordinates to use in computing the
lipid centers of mass.
mda_bilayer_selection (MDAnalysis.AtomSelection): The MDAnalsysis atom selection object for the
containing the atoms in the bilayer.
unwrap_coords (numpy.Array): A numpy array containing the the unwrapped coordinates of the bilayer selection
atoms.
"""
# list to store the nlipids LipidVec objects
self.lipidvec = []
self.ref_atoms = ref_atoms
# box dimensions -- assumes the box originates a 0,0,0
# It might be worth adding functionality to specifiy the box origin (or center)
# This also assumes a rectangular box
self.box = mda_frame.dimensions[0:3]
# simulation time
self.time = mda_frame.time
# frame number in the MD trajectory
self.mdnumber = mda_frame.frame
self.number = self.mdnumber
nlipids = len(mda_bilayer_selection.residues)
# initialize all the LipidVec objects
for dummy_i in range(nlipids):
self.lipidvec.append(LipidVec())
#atom indices in mda selection/frame
index = mda_bilayer_selection.indices
# loop over the residues (lipids) and get the centers of mass
## do the wrapped coordinates
r=0
for res in mda_bilayer_selection.residues:
#print(res," ",res.center_of_mass())
self.lipidvec[r].extract(res, ref_atoms)
#self.lipidvec[r].mass = res.total_mass()
r+=1
return
def __repr__(self):
return 'VecFrame for frame %s with %s lipids' % (self.number, len(self.lipidvec))
[docs] def set_box(self, box_lengths):
""" Set the rectangular xyz box edge lengths.
Args:
box_lengths (numpy.array): A 1d, 3 element numpy.array containing the x,y,z box sizes (or edge lengths)
"""
self.box = box_lengths
return
[docs] def set_time(self, time):
""" Set the simulation time.
Args:
time (float): The simulation time to assign to this Frame.
"""
self.time = time
return
def __len__(self):
""" Returns the number of LipidVec objects assigned to this Frame
Returns:
int: Number of LipidVec objects currently assigned to this Frame
"""
return len(self.lipidvec)
[docs] def vectors(self):
coords = []
for item in self.lipidvec:
coords.append(item.vector)
return np.array(coords)
[docs] def masses(self):
output = []
for lipid in self.lipidvec:
output.append(lipid.mass)
return np.array(output)
[docs] def resids(self):
output = []
for lipid in self.lipidvec:
output.append(lipid.resid)
return np.array(output)
[docs] def resnames(self):
output = []
for lipid in self.lipidvec:
output.append(lipid.resname)
return output
[docs] def leaflets(self):
output = []
for lipid in self.lipidvec:
output.append(lipid.leaflet)
return output
[docs] def unique_resnames(self):
output = []
for lipid in self.lipidvec:
if lipid.resname not in output:
output.append(lipid.resname)
return output
# def write_xyz(self, xyz_name, wrapped=True):
# # Open up the file to write to
# xyz_out = open(xyz_name, "w")
#
# comment = "COMFrame "+str(self.number)+" MD Frame "+str(self.mdnumber)
# xyz_out.write(str(len(self.lipidvec)))
# xyz_out.write("\n")
# xyz_out.write(comment)
# xyz_out.write("\n")
#
#
# i=0
# for dummy_lip in self.lipidvec:
# #get the coordinates
# x = self.lipidvec[i].com[0]
# y = self.lipidvec[i].com[1]
# z = self.lipidvec[i].com_unwrap[2]
# if not wrapped:
# x = self.lipidvec[i].com_unwrap[0]
# y = self.lipidvec[i].com_unwrap[1]
# #z = self.lipidvec[i].com_unwrap[2]
#
# #get the lipid resname
# oname = self.lipidvec[i].type
#
# #write to file
# line = str(oname)+" "+str(x)+" "+str(y)+" "+str(z)
# xyz_out.write(line)
# xyz_out.write("\n")
# i+=1
#
# xyz_out.close()
# return
[docs] def to_quiver(self):
pass


the action to be handled
Instance Method
handle(action:from:afterReducer:)
Handles the incoming actions and may or not start async tasks, check the latest state at any point or dispatch additional actions. This is also a good place for analytics, tracking, logging and telemetry. You can schedule tasks to run after the reducer changed the global state if you want, and/or execute things before the reducer. This function is only called by the store after the
receiveContext(getState:output:)
was called, so if you saved the received context from there you can safely use it here to get the state or dispatch new actions. Setting the afterReducer
in/out parameter is optional, if you don’t set it, it defaults to .doNothing()
.
Declaration
func handle(action: Self.InputActionType, from dispatcher: ActionSource, afterReducer: inout AfterReducer)
Parameters
action
-
dispatcher
-
information about the action source, representing the entity that created and dispatched the action
afterReducer
-
it can be set to perform any operation after the reducer has changed the global state. If the function ends before you set this in/out parameter,
afterReducer
will default to.doNothing()
.


This section discusses possible issues with the heavyweight/lightweight (HW/LW) mixing feature. In particular, it addresses the following issues:
Validate the component hierarchy:
Changing any layout-related properties of a component, such as its size, location, or font, invalidates the component as well as its ancestors. In order for the HW/LW Mixing feature to function correctly, the component hierarchy must be validated after making such changes. By default, invalidation stops on the top-most container of the hierarchy (for example, a Frame
object). Therefore, to restore the validity of the hierarchy, the application should call the Frame.validate()
method. For example:
component.setFont(myFont); frame.validate();
where frame
refers to a frame which contains component
. Note: Swing applications and the Swing library often use the following pattern:
component.setFont(myFont); component.revalidate();
The revalidate()
call is not sufficient because it validates the hierarchy starting from the nearest validate root of the component only, thus leaving the upper containers invalid. In that case, the HW/LW feature may not calculate correct shapes for HW components, and visual artifacts may be seen on the screen.
To verify the validity of the whole component hierarchy a user can use the key combination Control+Shift+F1 as described in Debug Tips for AWT. A component marked 'invalid' may indicate a missing validate()
call somewhere.
Validate roots:
The concept of validate roots mentioned in Validate the component hierarchy has been introduced in Swing in order to speed up the process of validating component hierarchies because it may take a significant amount of time. While such optimization leaves upper parts of hierarchies invalid, this did not bring any issues because the layout of components inside a validate root does not affect the layout of outside component hierarchy (that is, the siblings of the validate root). However, when HW and LW components are mixed together in a hierarchy, this statement is no longer true. That is why the feature requires the whole component hierarchy to be valid.
Calling frame.validate()
may be inefficient as well, and as such AWT supports an alternative, optimized way of handling invalidation/validation of component hierarchies. This feature is enabled with a system property:
-Djava.awt.smartInvalidate=true
Once this property is specified, the invalidate()
method will stop invalidation of the hierarchy when it reaches the nearest validate root of a component on which the invalidate()
method has been invoked. Afterwards, to restore the validity of the component hierarchy, the application should simply call:
component.revalidate();
Note: In this case, calling frame.validate()
would be effectively a no-op (a statement that does nothing) because frame
is still valid. Since some applications rely on calling validate()
directly on a component upper than the validate root of the hierarchy (for example, a frame), this new optimized behavior may cause incompatibility issues, and hence it is available only when specifying the system property.
If an application experiences any difficulties running in this new optimized mode, a user can use the key combination Control+Shift+F1 as described in Debug Tips for AWT to investigate what parts of the component hierarchy are left invalid, and thus possibly cause the problems.
Swing painting optimization:
By default, the Swing library assumes that there are no HW components in the component hierarchy, and therefore uses optimized drawing techniques to boost performance of the Swing GUI. If a component hierarchy contains HW components, the optimizations must be turned off. This is relevant for Swing JScrollPanes
in the first place. You can change the scrolling mode by using the JViewPort.setScrollMode(int)
method.
Non-opaque LW components:
Non-opaque LW components are not supported by the HW/LW mixing feature implementation by default. In order to enable mixing non-rectangular LW components with HW components, the application must use the com.sun.awt.AWTUtilities.setComponentMixingCutoutShape()
non-public API.
Note: The non-rectangular LW components should still paint themselves using either opaque (alpha = 1.0) or transparent (alpha = 0.0) colors. Using translucent colors (with 0.0 < alpha < 1.0) is not supported.
Disable the default HW/LW mix feature:
In the past, some developers have implemented their own support for cases when HW and LW components must be mixed together. The built-in implementation of the feature available since JDK 6 and JDK 7 may cause problems with custom workarounds. In order to disable the built-in feature the application must be started with the following system property:
-Dsun.awt.disableMixing=true


fluidautomata.js
Code for this project is freely available at:
github.com/CreativeCodingLab/FluidAutomataJS.
Details of the system are described in this paper:
A. G. Forbes, T. Hollerer, and G. Legrady. Generative fluid profiles for interactive media arts projects. Proc. ACM/Eurographics International Symposium on Computational Aesthetics in Graphics, Visualization, and Imaging (CAe), pages 37-43, 2013.
Angus Forbes
creativecoding.evl.uic.edu


Capsicum spp.
Although not some sort of hot foods obsessive, I tend to eat chiles almost daily these days. Their health benefits are remarkable, and certain examples (such as fresh, not dried, cayennes) can be delicious, with a complex combination of heat, sweetness, and lingering effects. Some time back, I would occasionally meet someone at a Thai restaurant and at one point remarked that I felt as if I'd just smoked a joint after eating a dish that I added Thai chiles to (probably used that delicious garlic/chile sauce, too). She laughed and told me it was just my imagination, so I slightly doubted it and thought it was something else, but I enjoyed the lingering euphoria, which was like cannabis, indeed, and lasted 2 hours or longer. This happened on more than one occasion.
One time we were at the same place and a young woman sitting behind us told her friend the same thing, so I knew it wasn't just my hopeful imagination. So I bought a container of the dried chiles, tried them at home, and was happy that they worked very nicely. A heaping teaspoon or so of the dried pods (or crushed pods, in some cases) was all that was needed. I also had the impression that including sweet foods, sugar of some sort, heightened the experience. Mental euphoria, physical sedation with a floating alertness, very nice. Even better when Thai iced coffee was included. Even with all the chiles I've grown and eaten, I've only had a similar experience one other time, with habaneros, which are really difficult to eat, NOT tasty (and not as certain for this effect), and the Thais are more effective and tasty and lingering, anyway. I look for the short pods (maybe 1.5' long), dark brick-red, often flattened when dried, with a squared-off lower end.
The only thing I know that will ease the heat in the mouth is milk products. Using the whole pod or its dried remnants is best. I avoid pods which are discolored and dark, brown and crumbly, or otherwise obviously decaying and old. Caveat emptor!
[Reported Dose: up to one-half oz. (dried), sometimes less]
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


EPICSv4 Overview and Architectures
EPICS V4 Overview and Architectures, Editors' Draft, 22-Jan-2013
- Editors:
- James Rowland, Diamond
Abstract
EPICS V4 is a software platform for high performance control
systems and data services. This document summarises the components of EPICS V4, and
outlines some software architectures that may be employed using it. It includes
such things as interoperation with EPICS V3, services for aggregating the data of
many Input Output Controllers, connection to online data sources such as databases,
and facilities for building Service Oriented Architectures.
Table of Contents
Introduction
EPICSv4 extends the scope of EPICSv3 with structured data types and
request/response messaging patterns.
EPICSv3 systems consist of I/O controllers (IOCs) connected to
temperatures, magnet currents, beam positions, and other scalars and vectors
of timestamped primitive types. Above this layer are objects such as response
matrices, machine lattice descriptions and backup and restore groups that are
not easily modelled in the limited range of data types available in EPICSv3.
Facilities use tools such as Matlab and SDDS to model high level concepts.
Similarly many high-level services are request/response, returning the result
of some processing or retrieval in response to a query. Tools such as Corba
or Web Services fill this role, as EPICSv3 only has 'put with callback', a
response that indicates that processing has completed but carries no
payload.
EPICSv4 supports Java, C++ and Python clients and servers on Windows,
Linux and OSX. vxWorks portability is being tested.
The Getting Started page describes the build system.
Overview of EPICSv4
Type System and Serialization (pvData)
pvData is a run-time type system with serialization and introspection. A
similar product is Google Protocol
Buffers (PB), an important difference is that pvData always has the full
type information (including field names) present when messages are encoded or
decoded, while PB depends on precompiled stubs on each side.
pvData C++ Reference Documentation
pvData Java Reference Documentation
Network Procotol (pvAccess)
See also pvAccess Protocol
Specification (Technical Document)
pvAccess C++ Reference Documentation
pvAccess Java Reference Documentation
The EPICSv4 network protocol is pvAccess. pvAccess is a
TCP protocol, a connection to a named endpoint is a Channel.
Channel endpoints have unique names within a facility, and the default name
resolution method is UDP broadcast prior to connection. Channels are typed
with the type determined by the server.
pvAccess supports the following messaging patterns:
- Introspection
- GetField (client asks for the type of a channel endpoint)
- Request/Response
- Put
- Get
- PutGet (atomic)
- Process
- Remote Procedure Call (like PutGet but request type is determined
by the client)
- Publish/Subscribe
I/O Controller (pvIOC)
The IOC combines pvData structures with processing behaviour to form
records. A domain-specific configuration language allows
these records to be connected in a dataflow style to form a
database, allowing customization of behaviour without
systems programming.
pvAccess C++ Reference Documentation
pvAccess Java Reference Documentation
Normative Types
To allow generic clients and prevent the unbounded spread of
application-specific types, the EPICSv4 Working Group specifies a set of
(about 10) Normative
Types (Document) for common use cases. Examples are timestamped control data,
relational database tables and multi-dimensional images. Generic tools will
operate on Normative Types and it is expected that facilities will use
Normative Types for the majority of applications.
Standard Components and Nominal Architectures
This section demonstrates the use of EPICSv4 with components that are found
in many facilities. It is typical for each facility, and often each service
within a facility, to use their own network protocol and data model.
Hello World
The most basic architecture is single client, single server, using RPC.
The RPC server does not contain an EPICSv4 database, the developer implements
the processing in C++, Java or Python code.
The helloWorld
example is located in the exampleJava project, currently it is not possible to write an RPC server in Java without the IOC database but this will be added.
Process Control / SCADA
EPICSv4 supports all EPICSv3 messaging patterns including publish/subscribe
via Monitors.
EPICSv3 Integration (pvaSrv)
Currently EPICSv4 focusses on high-level applications. It is expected that
facilities will continue to use EPICSv3 IOCs for I/O until drivers are
available for EPICSv4 IOCs. pvaSrv is a pvAccess server that runs on an
EPICSv3 IOC, allowing EPICSv4 clients to communicate with EPICSv3 process
variables.
The pvaSrv example is bundled with pvaSrv.
Startup Script for pvaSrv Example
pvaSrv Example Makefile
The last working version of the pvaSrv example is on the default branch of pvaSrv.
It compiles against the 2.0-BETA releases of pvDataCPP, pvAccessCPP, and pvIOCCPP.
These are the combination of changesets you need:
git clone -b 2.0-BETA https://github.com/epics-base/pvIOCCPP.git
git clone -b 2.0-BETA https://github.com/epics-base/pvDataCPP.git
git clone -b 2.0-BETA https://github.com/epics-base/pvAccessCPP.git
The pvaSrv
documentation explains the 3 simple steps needed to install the pvAccess server in your V3 IOC.
Client Stream Query (pvManager)
pvManager is a client utility
library for EPICSv3 and EPICSv4 that performs rate reduction and averaging on
data streams. This abstration layer makes writing robuts clients easier,
especially GUIs.
Operator Interfaces (OPI)
The proposed client tool for OPI is Control System Studio (CSS) BOY.
The BOY widgets will be updated to use pvManager as their data source.
A limited functionality proof of concept using the org.csstudio.data API directly to make a CSS EPICSv4 connector is here.
Service Aggregation (Gather)
Many facilites need to concatenate and summarize information from many
sensors into a single location, for example the electron beam position in a
synchrotron is presented to the user as a vector but is read from many
devices throughout the facility (see Diamond BPM Concentrator). The Gather
service is a standard implementation of this pattern.
The Gather service combines values from multiple sources into a single
point. The Gather service can also support EPICSv3 Channel Access. This is so
that Gather can be used without upgrading existing EPICSv3 servers with
v3Channel. Gather can be used as a software component or a service.
Gather used as a software component: Gather used as a service component (details omitted):
Gather Implementation
Gather is ready for testing. The server is implemented in Java.
The client is implemented in Java, C++, and Python.
It is expected that the way gather currently presents data to the client will change
but until it has been used by real applications it is not clear what to do.
The current sources are avaliable via the following mercurial repositories:
- Java
- github.com/epics-base/pvServiceJava
- git web
- C++ and Python
- github.com/epics-base/pvServiceJava
- git web
The latest documentation is:
- Java
- gather Java
- C++
- gather C++
- Python
- gather Python
The MASR service contains its own gather implementation, see the code here
that will soon be merged with the other gather libraries.
Model Service
The Model Service returns information from the machine model, such as the
linear optics matrices of a particle accelerator. It may return
pre-calculated values or connect to a simulation code.
Relational Database Service
Most facilites need to retrieve information from relational database
tables. The RDB Service provides a database-independent way to perform canned
queries over EPICSv4. The mapping from a query name to an SQL query string
can be stored in the Directory Service (discussed later) or in the RDB
itself.
rdbService is
located in the exampleJava project.
Name Resolution Server
EPICSv3 includes a little-used name server that can respond to UDP name
requests with the target IP address and TCP port of the server, replacing the
UDP broadcast name resolution. It would be possible to have a Name Resolution
Server of this type in EPICSv4.
Machine Physics and Scripting
Matlab Middlelayer is an interactive scripting environment used for machine
commissioning. The EPICSv4 Java client connects Matlab to high-level services
and process data. The Normative Types provide data in a form suitable for
manipulation without further processing, such as timestamps in Matlab date
format, and tables as structures of arrays.
Save and Restore
Process data setpoints must be saved to permanent storage and restored to
reset the facility to a known working state. MASAR is the EPICSv4 Save and
Restore tool. It combines RPC, Service Aggregation (Gather), and RDB access.
An RPC client initiates the save or restore request, the MASAR server Gathers
the process variables and stores them in the RDB.
MASR Project Reposotory
Time-Series Database
EPICS archivers are a familiy of time-series databases. The EPICS Channel
Archiver (RTree) is a chunked array store with an RTree index and a C++ API,
libStorage. The EPICSv4 archive service provides a pvAccess RPC interface to
these files, supporting range queries with on-the-fly decimation including
statistics (mean/min/max) into a table structure. This replaces the XMLRPC
interface distributed with the EPICS Channel Archiver.
ChannelArchiverService Project Repository (decimation is not supported yet)
Data Acquisition
X-Ray detectors produce image frames annotated with experimental metadata. 10
Gigabit Ethernet is increasingly used to transport these images from the
acquisition machine to a storage server. Protocols for this include network
or distributed file systems such as NFS or Lustre, or custom TCP protocols.
Each custom TCP protocol must deal with connection handing, error handing and
serialization. Data is stored in HDF5 files. pvAcces provides an efficient
TCP transport for structured image types in conjunction with areaDetector.
Contact Ulrich Pedersen at Diamond for more information about acqusition to HDF5 over 10gbE
Service Oriented Architectures (SOA) and Directory
Services
EPICSv4 services are self-describing through introspection of channel
endpoints. EPICSv4 services are also discoverable via broadcast name
resolution of globally unique channel endpoint names. Further discoverability
can be provided by the Directory Service. The EPICSv4 directory service is ChannelFinder.
ChannelFinder returns lists of Channel names and properties associated
with a particular key. This can be used to answer queries such as "return a
list of channels endpoint names that are connected to this magnet". Other
high-level services such as Save and Restore may depend on the information in
the Directory Service. The Directory Service may store information in a
relational database, but the interface exposes the associations between items
in a typical facility in a standard way.
ChannelFinder is a REST web service, and was designed to be used in
EPICSv3 and EPICSv4 installations. The REST interface provides additional
authentication functionality, but a pvAccess interface to ChannelFinder is
under development to facilitate integration with EPICSv4.
The ability to populate the Directory Service from an IRMIS database is also
under development but using IRMIS is not mandated.


Delicious, handcrafted beverages and great-tasting food. The secret to making life better.
Welcome To EatWell
Introduction
Enjoy an elaborate dining experience at our Durbar Dining Hall, designed for a delicious feast with the friends and family.
The restaurant specializes in North Indian and Continental cuisines, choose your preferred delicacies from the widespread of lip-smacking items and have a gala time.
I must explain to you how all this mistaken idea of denouncing pleasure and praising pain was born and I will give you a complete account of the system, and expound the actual teachings of the great explorer of the truth, the master-builder of human happiness.
Riya Mehra - Jaipur
No one rejects, dislikes, or avoids pleasure itself, because it is pleasure, but because those who do not know how to pursue pleasure rationally encounter consequences that are extremely painful.
Akshat Kumar - Gurgaon
On the other hand, we denounce with righteous indignation and dislike men who are so beguiled and demoralized by the charms of pleasure of the moment, so blinded by desire, that they cannot foresee the pain and trouble that are bound to ensue.
Amy James - Karnataka
Our Chefs
Our chefs that is making everything possible
Reach Us At
103/55 City Tower, Central Park Lane, C-Scheme, Jaipur, Rajasthan
Give Us Your Feedback
Please take a moment to tell us what you think about our website and our products, mail us at eatwell@gmail.com


nmcli networking- Enable or disable networking and all interfaces managed by NetworkManager:
nmcli networking on|off- Show the last known connectivity state:
nmcli networking connectivity- Show the current connectivity state:
nmcli networking connectivity check


Check out this wikipedia page about dogs!
Here are some of our favorite dogs (unable to rank. All dogs are pure.).
Here are some of our most important humans (ranked).
Here are some of our favorite foods (not ranked).
Thanks for reading about our favorite dogs, people, and food.
Click here to check out some of my favorite places!


Day 5: First-Name Basis
Read God’s Word
18 This is how the birth of Jesus Christ came about: His mother Mary was pledged to be married to Joseph, but before they came together, she was found to be with child through the Holy Spirit. 19 Because Joseph her husband was a righteous man and did not want to expose her to public disgrace, he had in mind to divorce her quietly.
20 But after he had considered this, an angel of the Lord appeared to him in a dream and said, “Joseph son of David, do not be afraid to take Mary home as your wife, because what is conceived in her is from the Holy Spirit. 21 She will give birth to a son, and you are to give him the name Jesus, because he will save his people from their sins.”
22 All this took place to fulfill what the Lord had said through the prophet: 23 “The virgin will be with child and will give birth to a son, and they will call him Immanuel”—which means, “God with us.”
24 When Joseph woke up, he did what the angel of the Lord had commanded him and took Mary home as his wife. 25 But he had no union with her until she gave birth to a son. And he gave him the name Jesus.
Matthew 1:18-25
Reflect and Respond
Names are at the center of the sacred ceremonies we hold as Christians. Baptisms, weddings, funerals—all of them are a mix of the sacred and the intimate. Because they’re so personal in nature, at the heart of each of them is a person’s first name.
“What name is given this child?” “Do you . . . take . . . to be your lawfully wedded husband?” “We are gathered today to remember and give thanks for the life of...”
When I preside over one of these sacred ceremonies, I always make sure I have the first name(s) written in big and bold letters across the top of my notes. Every pastor knows there would be nothing worse than saying the wrong name at a wedding. If you do, the confusion in the eyes of the bride and groom is instant. The glares from the mothers would quickly follow. Even worse would be to say the wrong name at a funeral. You really don’t want to make a mistake at the most personal of moments when someone’s name is involved.


Hash Function
|
|
|
|
| Categories: containers, functors |
Component type: concept |
Description
A Hash Function is a Unary Function that is used by
Hashed Associative Containers: it maps its argument to a
result of type size_t. A Hash Function must be deterministic
and stateless. That is, the return value must depend only
on the argument, and equal arguments must yield equal results.
The performance of a Hashed Associative Container depends
crucially on its hash function. It is important for a Hash Function
to minimize collisions, where a collision is defined as two different
arguments that hash to the same value. It is also important that the
distribution of hash values be uniform; that is, the probability that
a Hash Function returns any particular value of type size_t should
be roughly the same as the probability that it returns any other
value. [1]
Refinement of
Unary Function
Associated types
|
Result type
|
The type returned when the Hash Function is called. The result
type must be size_t.
|
Notation
Definitions
Valid expressions
None, except for those described in the Unary Function
requirements.
Expression semantics
Complexity guarantees
Invariants
|
Deterministic function
|
The return value depends only on the argument, as opposed to
the past history of the Hash Function object. The return value
is always the same whenever the argument is the same.
|
Models
Notes
[1]
Note that both of these requirements make sense only in the
context of some specific distribution of input values. To take a
simple example, suppose that the values being hashed are the six
strings "aardvark", "trombone", "history", "diamond", "forthright",
and "solitude". In this case, one reasonable (and efficient) hash
function would simply be the first character of each string. On the
other hand, suppose that the values being hashed are "aaa0001",
"aaa0010", "aaa0011", "aaa0100", "aaa0101", and "aaa0110". In that
case, a different hash function would be more appropriate. This is
why Hashed Associative Containers are parameterized by the hash
function: no one hash function is best for all applications.
See also
Hashed Associative Container, hash
Copyright © 1996 Silicon Graphics, Inc.
|


--- title: Day Camp keywords: off-site camp, day camp description: Bring a taste of summer camp to your church or location with the help of our trained summer staff. name: Day Camp --- {% block MainText %}
We bring camp to you!
Congregational Based Day Camps |
Day Camp is a unique partnership between Mt. Cross and your church or school. Our summer staff come to your congregation for a week of faith-based fun, which includes group games, arts & crafts, worship, community building activities and Bible Encounters based on our summer theme. For children who have completed Kindergarten through 6th grade, Day Camp is a great way to provide summer programming for the kids at your church while reaching out to your community.
Senior Day Camps
Camp isn't just for kids! Senior Day Camp is an exciting, growing program that brings camp to senior citizens, allowing for relationships to develop between our young adult staff and their mature "campers".
(See the Resources page for details.)
Registration for new Day Camp congregations or schools will open on October 31, 2013.
For more information, contact Mariel Spengler, Director of Day Camp Ministries, at<PHONE_NUMBER> or<EMAIL_ADDRESS>Click here for Day Camp Resources
For planning resources and promotional materials, click here.
To view a list of congregations registered for Day Camp, click here.
{%endblock%}


--- title: LLNL Software Catalog layout: portal --- {% raw %}
LLNL's RADIUSS project—Rapid Application Development via an Institutional Universal Software Stack—
aims to broaden usage across LLNL and the open source community of a set of libraries and tools
used for HPC scientific application development. Read more about our Policies & Guidelines.


Because of the changing world, the seventh OMNeT++ Community Summit will be held virtually from Monday to Tuesday, October 05-06, 2020.
OMNeT++ is a public-source, component-based, modular and open-architecture simulation environment with strong GUI support and an embeddable simulation kernel. It is designed to simulate discrete event systems, with the simulation of communication networks as one of its primary application areas.
In continuation of the history of the International Workshop on OMNeT++ and four very successful editions of its reincarnation, the OMNeT++ Community Summit, we continue to hold a yearly open meeting for all OMNeT++ community members with less costs and more interaction possibilities. The Community Summit provides a forum for tutorials, discussion sessions and presentations on recent developments and novel ideas in the area of simulation and modeling, with a focus on the OMNeT++ simulation environment.
The first six Summits in Hamburg, Zurich, Brno, Bremen, Pisa and Hamburg were huge successes with lively discussions, keynotes, tutorials, panels, presentations, and demonstrations of ongoing and finalized research covering many aspects of OMNeT++-related research.
The OMNeT++ Summit intends to be a lively event with a lot of discussions. A wide range of presentations and interactive sessions regarding specific topics will be held. There will be enough time to discuss about the different parts of OMNeT++ and related simulation and modeling questions. The event will be fully virtual. All times are Central European Summer Time (GMT+2).
05. October 2020 |
All sessions will take place in virtual meetings. Access code will be sent to registered participants. | |
| 11:00 - 11:10 | Welcome and organisation | |
| 11:10 - 11:45 | Levente Mészáros (slides) INET infrastructure for Time Sensitive Networking simulation With the advancements of in-vehicle communication systems and the ongoing automation of traditional manufacturing and industrial operations, Time-Sensitive Networking (TSN) became an essential target for network simulation. TSN is a set of standards, developed by the IEEE 802.1 working group, that define mechanisms for the time-sensitive transmission of data over deterministic Ethernet networks. The current version of INET lacks important infrastructure components for TSN simulations: clock models, time synchronization protocols, a versatile queueing model for transmission selection, the general support for aborting transmissions, and an API for intra-node packet streaming. The presentation covers the latest developments regarding these topics. |
|
| 11:45 - 12:00 | Online coffee break and open discussion | |
| 12:00 - 12:20 | Presentation 1: Mehmet Cakir (slides) Simulation-Based Evaluation of a Delay-Based Forwarding Concept Clemm and Eckert propose Latency-Based Forwarding (LBF) as a novel approach to provide support for high-precision latency objectives. It prioritizes traffic with introducing packet metadata which carries latency objectives, and the metadata allows different actions to be taken at network nodes. A proof of concept simulation model has been developed using the Big Packet Protocol (BPP). In contrast to IntServ, LBF supports prioritizing specific packets, with the purpose of providing fairness among different applications. We have run OMNeT++ simulations and compared our simulation results to the emulation results, with the goal of validating the results of Clemm and Eckert. |
|
| 12:20 - 12:40 | Presentation 2: Attila Török (slides) Proposed research topic: Using neural networks and machine learning for deriving error models for WiFi and other wireless networks In wireless network simulations, an error model describes how the signal to noise ratio (SNR) affects the amount of errors at the receiver. Given that SNR is a multi-dimensional function over time and frequency, and given the diversity of coding and modulation schemes used in wireless networks, writing a good and efficient error model is a very difficult problem. Existing error models are often closed formulas derived from empirical observations, and in addition to being very limited in scope, they sometimes fall down even within their supposed limitations. In contrast, we propose using neural networks and deep learning techniques to produce an error model that, in addition to being universally applicable, can produce reasonable answers even for cases that it was not explicitly trained for. We propose this as a research topic for those potentially interested in pursuing it. It is very promising as a research topic, practically feasible, and very useful at the same time. We have already spent some time trying out the idea and proven (at least to ourselves) that it is feasible and the approach outlined here can be made to work, but we don't have the resources (mostly, time) to elaborate it in-house. If you are a researcher (e.g. PhD student) looking for an exciting and rewarding topic to work on, we'd love to hear from you. We recommend this research topic primarily to those who are already knowledgeable in the field of neural networks and machine learning, and are not afraid of applying this knowledge to something new. |
|
| 12:40 - 13:40 | Lunch break | |
| 13:40 - 14:00 | Presentation 3: Pierre Larrenie, Iyad Lahsen-Cherif, Olivier Venard, Jean-François Bercher and Catherine Lamy-Bergot Implementation of MANET routing protocols with OMNeT++ : A DSR-Flow showcase In unstructured and mobile networks such as MANETs, routing may become a real challenge due to frequent topology changes. Routing protocols are classified in 3 categories: proactive, reactive and hybrid. Proactive protocols send periodic messages to discover its neighborhood and construct the topology, whereas reactive ones ask for new routes only on demand. Finally, hybrid protocols combine both proactive and reactive features. Our aim is to conduct a comparison study of various routing protocols: AODV, OLSR, DSR under UAV-like mobility model regarding their performances mainly in terms of end-to- end delay, network load, and Packet Delivery Ratio (PDR). This requires the implementation of the DSR-flow extension in OMNeT++. In this work, we provide guidelines to OMNeT++ users to implement a routing protocol with INET/INETMANET projects. We describe how we managed to implement a simple version of the well-known routing protocol DSR and its flow extension. Our contribution is threefold. First, we defined and extended data-structures and classes of INET/INETMANET to get a classic version of the DSR protocol. Then, we implemented the flow extension by using the classic DSR implementation and finally, we used specific UDP applications to provide stream traffic generation in order to compare features and performance of both protocols. We are particularly interested by the end-to-end management feature that could guarantee a certain QoS level for a dedicated service. Hence, we focused on core concepts of the DSR- Flow extension (i.e flow labelling) and did not implemented yet rare options such as "default flow" feature and "Destination and Flow ID" option which do not enter our domain of interest. We plan to open-source our implementation in the future. |
|
| 14:00 - 14:20 | Joint discussion - generic topics | |
| 14:20 - 15:00 | Deep discussion of presentations (open-ended) Presentation 1 in room A, Presentation 2 in room B, Presentation 3 in room C |
06. October 2020 |
All sessions will take place in virtual meetings. Access code will be sent to registered participants. | |
| 11:00 - 11:20 | Presentation 4: András Varga (slides, video) Proposed research topic: Zero configuration automatic parallel simulation OMNeT++ already supports parallel simulation. However, the network must be partitioned manually, and the partitions run concurrently in separate processes communicating over MPI. Here we propose a parallel simulation approach relies on multi-threaded execution instead of communicating processes, and therefore, by eliminating MPI overhead, it can make much better use of shared-memory multiprocessors which are e.g. commonly available on everyone's desk as multi-core CPU laptop/desktop computers. Moreover, it requires no prior knowledge or manual configuration about the simulation model. This makes it potentially both significantly more efficient (higher speedup), and also more accessible and convenient to use than the existing solution. We propose this as a research topic for those potentially interested in pursuing it. It is very promising as a research topic, practically feasible, and very useful at the same time. We have already spent some time trying out the idea and proven (at least to ourselves) that it is feasible and the approach outlined here can be made to work, but we don't have the resources (mostly, time) to elaborate it in-house. If you are a researcher (e.g. PhD student) looking for an exciting and rewarding topic to work on, we'd love to hear from you. |
|
| 11:20 - 11:40 | Presentation 5: Ujjval Rathod (slides, video) Timing Analysis of SpaceWire using OMNeT++ based Simulator The SpaceWire is a standard for communication for on-board spacecraft. SpaceWire is nominated by ESA and planned to be the only communication standard for spacecrafts in the future. It is already in use by several missions which are currently in operation. The SpaceWire protocol is not a deterministic protocol. It supports arbitrarily large sizes of messages with possibility of different datarates. It has wormhole routing in routers which may block critical messages for large amounts of time. It also has very low buffer memory and no virtual channel support. These conditions makes SpaceWire’s timings very uncertain. Embedded system developers need a realistic bound on the end-to-end delay for messages sent over the SpaceWire to design software with more predictable timing properties. Worst-case analysis of the end-to-end delay reports very pessimistic bounds, which are not applicable for many applications. A good simulator can provide less pessimistic bounds. It can provide accurate modeling of the network and its timing behavior. First, we will show the implementation of SpaceWire’s routing strategies in OMNeT++. Then an implementation of wormhole routing will be presented. Based on routing strategies, end-to-end delay for messages considering different network scenarios will be analyzed. The blocking of packets in the router will also be demonstrated. Future work may focus on network emulation and test and validation process. |
|
| 11:40 - 12:00 | Presentation 6: Nicholas J. Omumbo (slides, video) Computational Evaluation of the Effects of Openflow and Ospf Routing on Quality of Service Metrics in a Large Simulated Mobile Core Internet Protocol Network Using OMNeT++ Mobile Internet Protocol (IP) phone networks are arguably one of the most important innovations of modern times. More access systems are increasingly being defined using IP and as a result one of the challenging tasks that mobile IP phone service companies have to deal with is an upsurge of user equipment (UE) which in turn places excessive demand on the routing infrastructure and degrades quality of service (QoS) values at the mobile core network. Studies show that majority of mobile IP phone subscriber companies struggle to meet acceptable QoS values due to their insistence on using classical routing methods. Classical routing is not easily scalable and often lacks central source of information. There is an attempt to explore emerging Software Defined Network (SDN) technologies to enhance scalability and promote centralized controller approach. OpenFlow routing is an instance of SDN that has been found to improve routing in wired and small wireless networks. The aim of this study was to evaluate the computational effects that OpenFlow and OSPF would have on routing in a large mobile core IP network. Specifically, the study evaluated the effects of the use of OpenFlow and OSPF routing on jitter, packet delivery ratio (PDR), throughput and end to end delay. This research adopted exploratory research design where OMNeT++ network emulator was used in addition to SimuLTE add on to model two mobile IP networks; OSPF routed and OpenFlow. Applications that present high demand for processing and routing used; interactive gaming, VoIP, audio streaming and Internet Protocol Television (IPTV) were used for the purposes of testing routing efficiency. Scenario manager was used to simulate network failure and renewed convergence was observed. The setup test environment consisted of 1000 UEs, 80 OSPF routers, 80 OpenFlow switches. The study used already existing tools in OMNeT++ namely scenario manager, UEs, OSPF and OpenFlow routers to build test environment. OpenFlow was observed to manage better the QoS metrics in large mobile core network compared to OSPF routing. Notably jitter was improved by 10 milliseconds when OpenFlow routing was used in comparison to OSPF. This improvement was consistent across the network with addition of more end user equipment (UE). In instances where OSPF improved routing speeds the value is less significant with standard deviation of 24 mbs. This study provides insight on how OpenFlow can improve routing efficiency in large mobile core IP network compared to classical routing approach. This study further recommends testing of OpenFlow in production networks. |
|
| 12:00 - 12:20 | Joint discussion - generic topics | |
| 12:20 - 13:00 | Deep discussion of presentations (open-ended) Presentation 4 in room A, Presentation 5 in room B, Presentation 6 in room C |
|
| 13:00 - 14:00 | Lunch break | |
| 14:00 - 14:20 | Presentation 7: Jan Zavřel, Vladimír Veselý (slides, video) Enhanced Interior Gateway Routing Protocol Enhanced Interior Gateway Routing Protocol was published as RFC with the blessing of Cisco a few years ago. EIGRP is just like Babel hybrid routing protocol that leverages the best features of both distance-vector and link-state routing protocols. Properties like adjacency detection, multi-address family support, and the famous DUAL algorithm make EIGRP enterprise solution (that offers “loop-free routing” even during network reconvergence). We have successfully implemented EIGRP supporting IPv4 and IPv6 for ANSA; and now is the excellent time to incorporate EIGRP directly into INET. |
|
| 14:20 - 14:40 | Presentation 8: Konrad Fuger (slides, video) Evaluation of Avionic Routing Protocols using a Multiscale Simulation in OMNeT++ One focus at the Institute of Communication Networks at the Hamburg University of Technology is routing for avionic applications. Here, especially the case of aircraft crossing the North Atlantic Corridor (NAC) between Europe and North America is an interesting scenario as it is the busiest airspace of the world without any ground infrastructure. Obtaining performance indicators for routing protocols on this scenario from simulations creates a challenging task: On the one hand, mobility has a strong effect on the routing performance as it defines the topology of the network. On the other hand, realistic link and PHY layer implementations are necessary to obtain meaningful end-2-end delays. While mobility over the NAC is a slow moving process, requiring the simulation to cover five to six hours of mobility with topology changes on the scale of minutes, a realistic lower layer implementation will create events every few milliseconds. A simulation covering both the mobility as well as the lower layer communication protocols at the same time is computationally infeasible. Therefore the concept of Multiscale Simulations emerge: The core idea is to split the simulation effort into two, where a fast running "Macro Scale" simulation evaluates the mobility with simplified lower layers and creates snapshots of the simulation to be investigated in more detail. Those snapshots are then picked up by a "Micro Scale" simulation which starts a simulation of the created snapshot with a full lower layer implementation. |
|
| 14:40 - 15:00 | Presentation 9: Yevhenii Shudrenko (slides, video) Routing Protocol for Low-Power and Lossy Networks (RPL) in INET Framework We will shortly introduce the RPL protocol and the RFC 6550 features implemented in our simulation model. We will provide and overview of our implementation structure and present example scenarios and showcases. In the future, we intend to integrate our work with the 6TiSCH stack. |
|
| 15:00 - 15:40 | Deep discussion of presentations Presentation 7 in room A, Presentation 8 in room B, Presentation 9 in room C |
|
| 15:40 - 16:00 | Wrap up and farewell |
In case you want to contact the organizers, feel free to write an e-mail to: info [at] omnetpp [dot] org.


--- layout: archive title: Zulip Chat Archive permalink: /stream/113488-general/topic/Logipedia.html ---
http://logipedia.inria.fr the encyclopedia of all formally derived math, hopefully
@Andrew Ashworth Thanks. Are you involved in this project?
(Typo on the about page: "These proofs, originally developed in Matita , has been expressed in a", s/has/have/
)
And actually more typos in that bit of text.
Why can't the Lean version be displayed in unicode?
http://logipedia.inria.fr/theorems/theorems.php?md=nat&id=le_ind&kind=axiom
That looks like a very rudimentary pretty printer for Lean
I'm also not sure what the point of all the whitespace is. Surely for a "rosetta stone", you want to be able to see everything at once if at all possible.
{% endraw %}Last updated: Apr 24 2020 at 19:02 UTC


--- title: "Modules" ---
You use this resource by running R code! This may sound intimidating if you’ve never used R before, so we’ve made a video that walks through what you need to do.
Get started by going to R Studio Cloud - https://rstudio.cloud - and creating an account. When you’ve signed up, start a new project, and copy-paste the code below to install packages. (If you already have R and R Studio working on your local computer then you don’t have to use R Studio Cloud, you can install the packages on your local machine instead.)
install.packages('tidyverse')
install.packages('remotes')
install.packages('opendatatoronto')
remotes::install_github("rstudio-education/gradethis")
Then you can install the DoSStoolkit
:
remotes::install_github("RohanAlexander/DoSStoolkit")
You’ll use the function run_tutorial
to run each module. At the moment we have nine modules. So you can pick one to start with.