Wikipedia Ex-Founder Seeks to Build Massive Decentralized Knowledge Database
Innovator embarks on “Encyclosphere,” an open-source encyclopedia network
by Adan SalazarAn ex-founder of the website Wikipedia is embarking on the creation of a global knowledge database he says will benefit humanity far more than the so-called “free encyclopedia.”
For years, Wikipedia – which fancies itself an online encyclopedia “that anyone can edit” – has acted as a gatekeeping tool and propaganda arm of the corporate establishment.
Its entries are served up to millions as knowledge databases for corporations like Google and Apple, yet contrary to their motto they are actually tightly controlled, and edits must be approved by moderators who often let corporate bias influence their decisions.
Now engineer Larry Sanger, whose work led to the creation of Wikipedia, says the platform’s grown far too compartmentalized for its own good, and is introducing a new tool to decentralize that control.
“Wikipedia is great, right? My name is Larry Sanger. I started it, and I don’t think so,” Sanger says in a new video introducing the “Encyclosphere.”
Sanger asserts Wikipedia has “become centralized and controlling, just like Facebook and Twitter.”
“They have all become openly hostile to views unapproved by the establishment,” Sanger says. “Let’s fix this.”
The Encyclosphere essentially builds off the Wikipedia model, but it seeks to be a global open-source effort everyone can help contribute to.
“There needs to be a decentralized encyclopedia network, a nonprofit knowledge commons, that supports multiple, competing articles on all topics,” Sanger envisioned in a tweet last month.
“We need a free giant global knowledge commons without any central control,” his video states.
According to Sanger, the Encyclosphere will be a massive repository of encyclopedias and knowledge which will be available to all.
“All the encyclopedias in the world will be in this system including small and new ones,” Sanger says.
Data could be presented to users through Encyclosphere reading apps and devices, which Sanger predicts will spur competition among developers.
The global network of knowledge will be rated by top experts, Sanger says, and could be custom-tailored to users with categories which sort indexes by nationality, religious, or political views.
All in all, the Encyclosphere looks to be a bigger, better, and more free version of Wikipedia.
“Ultimately there would be a massive knowledge competition to best express human knowledge on every topic and from every point of view,” Sanger described in a speech last month.
“No small group of elites deserves the power to declare what is known for all of us,” a quote from Sanger reads, at the url encyclosphere.org, which the site notes is “coming soon.”
While the database won’t adhere to traditional editorial standards, there will be a set of core principles contributors will have to adhere to, which include a dedication to free speech, decentralization and openness.
For now, Sanger is heading up the non-profit Knowledge Standards Foundation, after leaving his position as CIO of the website Everipedia, which aims to help the Encyclosphere get off the ground.
In the end, Sanger hopes to topple the monopoly on knowledge held by the Big Tech elite.
“By building the Encyclosphere,” he says, “we, all of us little people, can, in a decentralized and democratic system, do an end run around giants like Google and Wikipedia.”
Follow the author on Gab: https://gab.ai/adansalazar
On Twitter: Follow @AdanSalazarWins
On Facebook: https://www.facebook.com/adan.salazar.735
On Minds: https://www.minds.com/adan_infowars
By the way, overhaul your body’s cellular engine with our fan-favorite DNA Force Plus!


Liked this quote from Troy.  The gods envy us. They envy us because we're mortal. Because any moment might be our last. Everything's more beautiful because we're doomed. You will never be lovelier than you are now. We will never be here again.  The gods envy us. They envy us because we're mortal. Because any moment might be our last. Everything's more beautiful because we're doomed. You will never be lovelier than you are now. We will never be here again. "


Home Page
Excel Page
NUMBERS MANUPLATION
Please Enter Your Number Seprated By Spaces :
Auto Sum
Average
Max
Min
Submit
Result :


Replace me.
Item
Edit
New
Back
This is the second section.
This is a default panel in the second section.
This should be replaced.
Item
Edit
New
Back
Danger Panel
Replace me.
Item


Write Every Day Reminder Options
Your 750Words RSS URL:
Show Current Streak
Show Reminder Desktop Notification
Save


Writing
MediaWikiToLearn Hackathon, Amrita University Amritapuri Campus 2016
FOSS@Amrita conducted Mediawiki Hackathon at Amrita University, Amritapuri Campus on 1st and 2nd October, 2016. MediaWikiToLearn Hackathon was organised to bring more new students into the field of Open Source Contribution, thereby giving them a chance to interact with developers online. Provide an opportunity to learn the workflow of bug fixing and patch submission in MediaWiki.
I spoke about WikiToLearn to the professors and students of Amrita University, Amritapuri Campus!
WikiToLearn Editathon was concluded with a good number of edits and personalized books made by 25 professors on subjects varying from Biotechnology, Business, Physics, and Mathematics.
The Pywikibot Mediawiki hacking session led by Abdeali Kothari was a great success as students could grasp the fundamentals well and catch up with their tasks. Though it was a bit hard for participants to get started with their first bug fix. By the end of second day of MediaWiki Hackathon, we could get more than 5 patches uploaded to Gerrit.


CloudFront Distribution Logging
Logging
is a property of the DistributionConfig property
that enables Amazon CloudFront to deliver access logs for each distribution to an
Amazon Simple Storage Service (S3)
bucket.
Syntax
JSON
{ "Bucket" :
String
, "IncludeCookies" :Boolean
, "Prefix" :String
}
YAML
Bucket:
String
IncludeCookies:Boolean
Prefix:String
Properties
Note
For more information about the constraints and valid values of each property, see the LoggingConfig data type in the Amazon CloudFront API Reference.
Bucket
-
The Amazon S3 bucket address where access logs are stored, for example,
mybucket.s3.amazonaws.com
.Required: Yes
Type: String
IncludeCookies
-
Indicates whether CloudFront includes cookies in access logs.
Required: No
Type: Boolean
Prefix
-
A prefix for the access log file names for this distribution.
Required: No
Type: String


4.4. Writing More Sophisticated Recursive Functions¶
Some recursive functions have only one base case and one recursive call. But it is common for there to be more than one of either or both.
The following is the general structure for a recursive function.
if ( base case 1 ) {
// return some simple expression
}
else if ( base case 2 ) {
// return some simple expression
}
else if ( base case 3 ) {
// return some simple expression
}
else if ( recursive case 1 ) {
// some work before
// recursive call
// some work after
}
else if ( recursive case 2 ) {
// some work before
// recursive call
// some work after
}
else { // recursive case 3
// some work before
// recursive call
// some work after
}
if ( base case 1 )
// return some simple expression
else if ( base case 2 )
// return some simple expression
else if ( base case 3 )
// return some simple expression
else if ( recursive case 1 ) {
// some work before
// recursive call
// some work after
}
else if ( recursive case 2 ) {
// some work before
// recursive call
// some work after
}
else { // recursive case 3
// some work before
// recursive call
// some work after
}
Example 4.5.1
Consider a rather simple function to determine if an integer X
is
prime or not.
Y
is a helper variable that is used as the devisor.
When calling the function initially, Y = X - 1
boolean prime(int x, int y) {
if (y == 1) {
return true;
}
else if (x % y == 0) {
return false;
}
else{
return prime(x, y-1);
}
}
boolean prime(int x, int y) {
if (y == 1)
return true;
else if (x % y == 0)
return false;
else
return prime(x, y-1);
}
We see that Prime
has two base cases and one recursive call.
Example 4.5.2
Here is a function that has multiple recursive calls.
Given an int
array named set
, function
isSubsetSum
determines whether some of the values in
set
add up to sum
.
For example, given the number 3, 8, 1, 7, and -3, with sum = 4
,
the result is true
because the values 3 and 1 sum to 4.
If sum = 6
, then the result will be true
because the
\(8 + 1 + -3 = 6\).
On the other hand, if sum = 2
then the result is false
there is no combination of the five numbers that adds up to 2.
In this code, variable n
is the number of values that we look
at.
We don’t want to just use set.length
because the recursive
calls need to limit their work to part of the array.
boolean isSubsetSum(int set[], int n, int sum) {
if (sum == 0) {
return true;
}
if ((n == 0) && (sum != 0)) {
return false;
}
if (set[n - 1] > sum) {
return isSubsetSum(set, n - 1, sum);
}
return isSubsetSum(set, n - 1, sum) || isSubsetSum(set, n - 1, sum - set[n - 1]);
}
boolean isSubsetSum(int set[], int n, int sum) {
if (sum == 0)
return true;
if ((n == 0) && (sum != 0))
return false;
if (set[n - 1] > sum)
return isSubsetSum(set, n - 1, sum);
return isSubsetSum(set, n - 1, sum) || isSubsetSum(set, n - 1, sum - set[n - 1]);
}
This example has two base cases and two recursive calls.
Example 4.5.3
Here is a function that has multiple base cases and multiple
recursive calls.
Function paths
counts the number of different ways to reach a
given basketball score.
Recall that in Basketball, it is possible to get points in
increments of 1, 2, or 3.
So if n = 3
, then paths
will return 4, since there are four
different ways to accumulate 3 points: \(1+1+1, 1+2, 2+1,\) and 3.
int paths(int n) {
if (n == 1) {
return 1;
}
if (n == 2) {
return 2;
}
if (n == 3) {
return 4;
}
return paths(n - 1) + paths(n - 2) + paths(n - 3);
}
int paths(int n) {
if (n == 1)
return 1;
if (n == 2)
return 2;
if (n == 3)
return 4;
return paths(n - 1) + paths(n - 2) + paths(n - 3);
}
This function has three base cases and three recursive calls.


Docker Images
Note: There is an open issue to update this page for Gradle: BEAM-4117.
Docker images allow to create a reproducible environment to build and test Beam. You can use the docker images by using the provided Docker scripts.
In this directory you will find scripts to build and run docker images for different purposes:
-
file: Create a Docker container from a Beam source code .zip file in a given environment. It is useful to test a specific version of Beam, for example to validate a release vote.
-
git: Same as file but the Beam source code comes from the git repository, you can choose a given branch/tag/pull-request. Useful to test in a specific environment.
-
release: It builds an end-user distribution of the latest version of Beam and its dependencies. Useful for end-users who want to have a ready to use container with Beam (Python only for the moment).
File based image
If you want to build a container with a ready JDK 8 environment to test Beam:
cd file/openjdk8
docker build -t beam:openjdk8 .
When you run the image it downloads the specific version of Beam given the environment variables. By default it downloads the source code of the latest master. If you want to download the latest master and execute the tests:
docker run -it beam:openjdk8 mvn clean verify -Prelease
If you want to have an interactive session you can run a bash prompt:
docker run -it beam:openjdk8 /bin/bash
Inside the container you can test a specific module by running Maven. You
have to change MODULE_PATH for the given module path. For example to test
HBaseIO you should write its path sdks/java/io/hbase
in the place of
MODULE_PATH:
mvn --projects MODULE_PATH clean verify -Prelease
Configuring the runtime via the environment variables
You can run different versions of Beam by passing the specific environment variables:
URL
: The URL with the file containing the specific source code.
SRC_FILE
: The downloaded file name.
SRC_DIR
: The name of the directory inside of the zip file.
For example to run a Docker container with the exact code of the release 2.0.0:
docker run \
-e URL="https://www.apache.org/dyn/closer.cgi?filename=beam/2.0.0/apache-beam-2.0.0-source-release.zip&action=download" \
-e SRC_FILE="apache-beam-2.0.0-source-release.zip" \
-e SRC_DIR="apache-beam-2.0.0" \
-it beam:openjdk8 /bin/bash
If you want to run a container with a specific version e.g. 2.1.0-RC1:
docker run \
-e URL="https://github.com/apache/beam/archive/v2.1.0-RC1.zip" \
-e SRC_FILE="v2.1.0-RC1.zip" \
-e SRC_DIR="beam-2.1.0-RC1" \
-it beam:openjdk8 /bin/bash
Notice that SRC_FILE is different from SRC_DIR because github replaces the ‘v’ character in the internal name of the zip.
To run a container with the source code during a vote:
docker run \
-e URL="https://dist.apache.org/repos/dist/dev/beam/2.1.0/apache-beam-2.1.0-source-release.zip" \
-e SRC_FILE="apache-beam-2.1.0-source-release.zip" \
-e SRC_DIR="apache-beam-2.1.0" \
-it beam:openjdk8 /bin/bash
Testing in an specific environment with your own source
You can also overwrite the volume containing the source code of Beam from a directory in your host machine. This is useful to test your code with different versions of Java.
If you have the code in the ~/workspace/beam directory and you want to quickly test it with Beam you can do:
docker run -v ~/workspace/beam:/home/user/beam -it beam:openjdk8 /bin/bash
Performance improvements
The docker image does not contain the Java dependencies and this could make
the execution of the commands in the image take more time than expected. One way
to speed this up is by mounting a directory with the dependencies as a Docker
volume. The following command shows how to mount the host machine directory
for Maven dependencies ~/.m2
in the container:
docker run -v ~/.m2:/home/user/.m2 -it beam:openjdk8 /bin/bash
You can also use an empty directory instead of ~/.m2
if you want to create a
different environment from the local one to share it between runs.
Maven Improvements:
You can also speed the execution by adding environment variables to Maven, for example the MAVEN_OPTS environment variable may speed up compilation:
docker run \
-e MAVEN_OPTS='-client -XX:+TieredCompilation -XX:TieredStopAtLevel=1 -Xverify:none' \
-it beam:openjdk8 /bin/bash
Maven does not execute on multiple cores by default; to do this you have to enable the threading execution:
mvn --threads 1C ...
Git based image
It creates a docker container with a cloned version of the git repository, its branches and all the pull-requests. When it is run, it updates and checks out the specified branch/tag/pull-request.
You can choose the branch to execute via the environment variable:
BRANCH
: The name of the specific branch, tag or pr to check out.
By default it checks out master from the github repo, but if you want to check
a specific pull request ID
you can build the image like this (you must change
ID
for the number):
cd git/openjdk8
docker build -t beam:git .
docker run -e BRANCH=pr/ID -it beam:git /bin/bash
Release image
The release image is a container with the needed requirements to run Beam out of the box in a container, or to submit a pipeline to execute on Google Cloud Dataflow. To build it run:
cd release/python2
docker build -t beam:python2 .


Even when the bears rear their heads, our incredible contributors still shine. This week, we have a very full slate of staff picks, with selections from the Ideas, Anti-Abuse, Analysis, and Development categories. In fact, the contributions in these categories were so good, that Ideas, Analysis, and Development have two staff picks each! Check out all of the goodness below.
Staff Picks
Creating an Anti-Abuse Project for Your Community by @steemcleaners [anti-abuse]
This is a great contribution from @guiltyparties from the @steemcleaners crew. It teaches everyone, who is part of a community or curation group, how to create and organize a anitabuse project within the community. The post shows where to get help and how to get it done. This post is a must read for members of every community. If you want to start an antiabuse project in your community, it has the information you need to get started.
Total payout: 79.47 STU Number of votes: 327
Steem: Application usage - Where is the engagement being sourced from, and are any applications showing signs of growth? by @abh12345 [analysis]
@abh12345 is super talented when analyzing almost anything. He is detailed and most importantly, descriptive. Even a layperson could easily understand the graphs. The analysis contribution analyzes many things happening on the Steem blockchain, focusing on the usage of dApps and their engagement rate on the Steem blockchain. This contribution is unique, as it contains significant information about various dapps. Consider checking it out.
Total payout: 76.50 STU Number of votes: 470
Using a slider with the Utopian questionnaire by @amosbastian [ideas]
This contribution, made by @amosbastian, is a clear example of how to create a Suggestion contribution without following the template. It’s a well-formatted and well-written post. It’s clear and simple to understand. The way he shows the feature in action is everything.
Total payout: 28.40 STU Number of votes: 100
Steem Analytics - Distribution of Earnings by @miniature-tiger [analysis]
@miniature-tiger has been a consistent contributor to the analysis category. This contribution focuses on the earning distribution on the Steem blockchain. There are three important topics discussed in this contribution:
- Reward distribution of regular user for posting and commenting
- Discovering if rewards are distributed evenly
- Finding out how benefactor rewards impact the blockchain.
You don’t want to miss this information, so check the post out.
Total payout: 67.23 STU Number of votes: 1004
1Ramp Android Updates – Drafts, Repost, and Delegation Details by @the1ramp [development]
The 1Ramp team has been very busy over the past few months. Now that they’re back from SteemFest3, they have gone straight back to developing awesome new features for their Android application. This update is features that may be small, but are essential in getting the best out of Steem through an Android application. They are setting the base before rolling out an interesting micro-community building model, as @vikonomics discussed at SteemFest3.
Total payout: 50.63 STU Number of votes: 60
[Utopian Rocks Browser Extension] - Highlights & contributions when new tab is opened by @tobias-g [ideas]
@tobias-g has created another high quality post. This is a perfect example of how the template should be used. The overall presentation is really good and the mockups are great.
In addition, the suggested idea was useful and well received by the PO, as we can see in the comments and in the Issues tracker on GitHub.
Total payout: 28.64 STU Number of votes: 74
Open Sourcing of UA by @steem-ua [development]
UA has definitely had a big impact on the Steem community over the last few months. People have been very outspoken with their opinions about it, with one of the biggest complaints being that that it wasn’t open source. Well, I’m glad to say that’s no longer the case! @holger80 and @scipio have just open sourced the first set of components of UA (with more to come in the future), so if you are interested in how it truly works, you can now check out (part of) the code!
Total payout: 108.30 STU Number of votes: 245
Writing a simple Compiler on my own - Action Rules for Loop Statements and some Fixes [C][Flex][Bison] by @drifter1 [tutorials]
Another episode of the fantastic series involving the development of a simple C tutorial. As @drifter1 has taken us through different stages involved in building the linguistics and the parsing capabilities, we are presented in this episode with an implementation for the For Loop logic, and a great illustration of how to develop the compiler’s code to handle such cases, along with a detailed step by step compilation procedure and outcome! The tutorial also includes some adjustments to the precedence evaluation rules. If you’re a fan of C language, and/or compilers, make sure you visit this post and the series altogether.
Total payout: 16.94 STU Number of votes: 98
Utopian.io Post Statistics
The staff picked contributions are only a small (but exceptional) example of the mass of contributions reviewed and rewarded by Utopian.io.
- Overall, the last week saw a total of 163 posts, with 148 of them rewarded through an upvote by @utopian-io.
- In total, Utopian.io distributed an approximate of 4110.16 STU to contributors.
- The highest payout seen on any Utopian.io contribution this week was 164.241 STU, with a total of 1530 votes received from the community.
- The contribution that attracted the most engagement was Task Request: Add Core Features & ‘Communities’ To Ulogs.org (Plus 880 Steem Bounty) & Further Insight Into The ‘Grand Vision’ For Ulogs.org., with no less than 16 comments in its comment threads.
- The average vote given by Utopian.io was worth 26.86 STU.
Category Statistics
|Category|Reviewed|Rewardable|Rewarded|Total rewards|Top contributor| |:-|:-|:-|:-|-:|:-| |social|7|7|7|97.37 STU|@jingis07| |translations|52|52|52|1492.35 STU|@froq| |blog|17|16|16|311.76 STU|@curtwriter| |graphics|5|4|4|83.25 STU|@zularizal| |development|23|19|19|668.38 STU|@immanuel94| |ideas|6|5|5|88.16 STU|@tobias-g| |iamutopian|12|12|12|460.01<EMAIL_ADDRESS>|tutorials|14|12|12|149.73 STU|@drifter1| |anti-abuse|3|2|2|71.11 STU|@steemcleaners| |bug-hunting|4|4|4|41.49 STU|@tobias-g| |analysis|6|6|6|230.05 STU|@miniature-tiger|
First Time Contributing in Utopian.io?
Learn how to contribute on our website
This page is synchronized from the post: Top of Utopian.io: November 28 - December 5


A platform built for scaling your video strategy |
Integration with the largest CMS, LMS, and Analytic Systems |
Simple tools allow immediate productivity, yet extensible enough to meet your needs into the future |
In-depth video analytics and metrics to support your business value propositions |
Industry leaders are using HapYak, gaining valueable user analytics to increase sales and lower costs |


The base tree builder class. Provides paramaters for default, L, and colonization tree generation.
More...
|
|
abstract void | Build () |
| |
|
abstract void | Remove () |
| |
The base tree builder class. Provides paramaters for default, L, and colonization tree generation.
◆ TreeType
◆ CreateTree()
| Tree FractalTree.TreeBuilder.CreateTree |
( |
| ) |
|
|
protected |
Creates a tree based on treeType.
- Returns
- The tree.
◆ DoBuild< T >()
| List<T> FractalTree.TreeBuilder.DoBuild< T > |
( |
| ) |
|
|
protected |
Build this instance of the tree.
◆ branchPrefab
| GameObject FractalTree.TreeBuilder.branchPrefab |
The branch prefab. If tree to generate is moving then prefab should have MovingBranch script attached.
◆ buildOnStart
| bool FractalTree.TreeBuilder.buildOnStart = true |
If true, builds tree on start.
◆ colonizationInitialLength
| float FractalTree.TreeBuilder.colonizationInitialLength = 1f |
The initial length for a colonization tree trunk.
◆ colonizationLeafParent
| Transform FractalTree.TreeBuilder.colonizationLeafParent |
The parent of the game object that holds the colonization leaves.
◆ colonizationMaxDistance
| float FractalTree.TreeBuilder.colonizationMaxDistance = 10f |
The maximum distance between the branch and a colonization leaf for it to be registered.
◆ colonizationMinDistance
| float FractalTree.TreeBuilder.colonizationMinDistance = 1f |
The minimum distance between the branch and a colonization leaf for it to be registered.
◆ colonizationWidth
| float FractalTree.TreeBuilder.colonizationWidth = 0.04f |
The width of the colonization tree branches.
◆ defaultAngle
| float FractalTree.TreeBuilder.defaultAngle = 45f |
The angle for default tree branching.
◆ defaultBranchColour
| Color FractalTree.TreeBuilder.defaultBranchColour = Color.white |
The branch colour for the default tree.
◆ defaultGrowthCount
| int FractalTree.TreeBuilder.defaultGrowthCount = 8 |
The number of tree generations.
◆ defaultInitialLength
| float FractalTree.TreeBuilder.defaultInitialLength = 5f |
The default length of the initial branches for the default tree generation.
◆ defaultLengthReductionOnNewGeneration
| float FractalTree.TreeBuilder.defaultLengthReductionOnNewGeneration = 0.67f |
The length degradation for the default tree. Branches are reduced in size by this factor.
◆ defaultWidth
| float FractalTree.TreeBuilder.defaultWidth = 0.04f |
The width of the branches for the default tree generator.
◆ lTreeAngle
| float FractalTree.TreeBuilder.lTreeAngle = 25f |
The angles used to branch an L tree.
◆ lTreeAutoWidth
| bool FractalTree.TreeBuilder.lTreeAutoWidth = true |
When true, the width of the branches will be set automatically based on the colours.
◆ lTreeAxiom
| string FractalTree.TreeBuilder.lTreeAxiom = "FX" |
The l tree axiom. The initial seed used to generate a L tree.
◆ lTreeBranchLength
| float FractalTree.TreeBuilder.lTreeBranchLength = 0.17f |
The length of the l tree branch.
◆ lTreeColours
| Color [] FractalTree.TreeBuilder.lTreeColours |
◆ lTreeGrowthCount
| int FractalTree.TreeBuilder.lTreeGrowthCount = 5 |
The number of L tree generations.
◆ lTreeMassBasedOnWidth
| bool FractalTree.TreeBuilder.lTreeMassBasedOnWidth = true |
When true, the mass of the branches will be set automatically based on colours. Used only when generating a moving tree.
◆ lTreeRules
| LRule [] FractalTree.TreeBuilder.lTreeRules |
Initial value:= new LRule[] {
new LRule ('F', "C0FF-[C1-F+F]+[C2+F-F]"),
new LRule ('X', "C0FF+[C1+F]+[C3-F]")
}
The rules applied to the axoim.
◆ lTreeWidth
| float FractalTree.TreeBuilder.lTreeWidth = 0.03f |
The max branch width for L trees.
◆ treeType
| TreeType FractalTree.TreeBuilder.treeType = TreeType.Branching |
The tree type to generate.
The documentation for this class was generated from the following file:
- FT/Scripts/Tree Builders/TreeBuilder.cs


Meeting time change, SHA1 collisions, CloudBleed, and WireShark demo!
At todays meeting we discussed:
- Moving the meeting time ahead 30 minutes (3:30 - 4:30)
- Upcoming LAN Party
- CloudBleed
- SHA1’s first collision
- WireShark demo
Meeting Time Change
Since the beginning of this semester we have had a large increase in new members, which is awesome! However the room we used to meet in was over crowded so now we are having to locate a larger one. Moving the time up thirty minutes will allow us to book a larger room, if you have any concerns let us know. If this new time does not work for you fear not, for from now on all meeting notes will be posted here on the site. For now the time will still remain 3:00 to 4:00
Do not be afraid to come in late or leave early because of classes or prior engagements we’re just happy to have anyone show up!
Upcoming LAN Party
The weekend following spring break we are hoping to host a LAN party here at Discovery Park on the weekend along with IEE CS and the American Society of Mechanical Engineers clubs.
To make this event as open as possible to our members we are going to be using one of the computer labs here, so no one needs to haul their computer up. However this does leave us in the odd position of finding games that you can run without needing to install. If you happen to know of any good ones send us an email or send a private message to Jesse Culver or Zach Eisenhower in Slack!
CloudBleed
Between 2016-09-22 - 2017-02-18 passwords, private messages, API keys, and other sensitive data were leaked by Cloudflare to random requesters. Data was cached by search engines, and may have been collected by random adversaries over the past few months.
Requests to sites with the HTML rewrite features enabled triggered a pointer math bug. Once the bug was triggered the response would include data from ANY other Cloudflare proxy customer that happened to be in memory at the time. Meaning a request for a page with one of those features could include data from Uber or one of the many other customers that didn’t use those features. So the potential impact is every single one of the sites using Cloudflare’s proxy services (including HTTP & HTTPS proxy). Source
SHA1’s First Collision
Today, more than 20 years after of SHA-1 was first introduced, we are announcing the first practical technique for generating a collision. This represents the culmination of two years of research that sprung from a collaboration between the CWI Institute in Amsterdam and Google. We’ve summarized how we went about generating a collision below. As a proof of the attack, we are releasing two PDFs that have identical SHA-1 hashes but different content.
For the tech community, our findings emphasize the necessity of sunsetting SHA-1 usage. Google has advocated the deprecation of SHA-1 for many years, particularly when it comes to signing TLS certificates. As early as 2014, the Chrome team announced that they would gradually phase out using SHA-1. We hope our practical attack on SHA-1 will cement that the protocol should no longer be considered secure.
Source: Google’s Security Blog
Put another way: I doubt the sky is falling for git as a source control management tool. Do we want to migrate to another hash? Yes. Is it “game over” for SHA1 like people want to say? Probably not.
Lifetimes of Cryptographic hash functions
Wireshark Demo
Michael Hinderman put on a demo for how to use Wireshark and setup a virtual network in Virtualbox. You can find his presentation here
Jesse Culver


General discussion about Komodo. For useful links and more info click the pinned messages to the right.  A withdrawal fee of 0.02 KMD will be automatically deducted from the amount.Additionally, 10% of deducted withdrawal fee will be donated to the bot author to help continual development.
!kmdtip <@user> <amount> [private]
Tips the @ mentioned user with the desired amount, e.g.
!kmdtip @test123456#7890 1.00
!kmdtip rain <amount> [<@role>]
Rains the desired amount onto all online users (optionally, within specified role), e.g.
!kmdtip rain 10.00, !kmdtip rain 10.00 @Supporters
!kmdtip soak <amount> [<@role>]
Soaks the desired amount onto all online and idle users (optionally, within specified role), e.g.
!kmdtip soak 5.00, !kmdtip soak 5.00 @Supporters
!kmdtip thunder <amount> [<@role>]
Tips a random lucky online user with the amount (optionally, within specified role), e.g.
!kmdtip thunder 5.00, !kmdtip thunder 5.00 @Supporters
!kmdtip faucet
Gets an amount from the faucet (applicable every 4 hours)
akomismo15-Oct-18 10:27 AM
my request approve??
for new language
ComputerGenie 👴👴👴15-Oct-18 10:33 AM
Flugerinkenese?
groundhog15-Oct-18 11:17 AM
When chameleon wallet? :D
azaid15-Oct-18 11:57 AM
HI SIR .  PLease ping me on telegram if you are interested. here @blaker22
ComputerGenie 👴👴👴15-Oct-18 11:58 AM
HI MADAME.
Sorry noon questions here
Riddlez66615-Oct-18 12:39 PM
who can i talk to about dPOW?
jl777c15-Oct-18 12:40 PM
@siu - Chainmakers
Cryptoprenuer15-Oct-18 12:40 PM
whats best KMD fork to mine profitablity wise with CPU guys i7 8700k
jl777c15-Oct-18 12:42 PM
VRSC
cryptoprofit15-Oct-18 12:43 PM
yeah im mining vrsc on one rig looking for another
thanks for answer
balage15-Oct-18 12:47 PM
damn, didnt know komodo has a discord
my new favourite place hang out at
Cryptoon15-Oct-18 12:51 PM
2
siu - Chainmakers15-Oct-18 12:59 PM
@Riddlez666 hi! please DM for anything related to dPOW
@Jacobstoon @cryptorecorder @KomodoPlatform @Bitcoin @ethereum @VerusCoin No doubt, I love the fact that @VerusCoin coin’s revolutionary CPU mining algo will be implemented in $kmd soon. Mining with a CPU and getting better hashrate than a GFX card.
I dont think this is correct and that kmd stays equihash?
ComputerGenie 👴👴👴15-Oct-18 01:31 PM
Yeah, one of us is misinformed
and if it's me, I just bought a ton of doorstops(edited)
Cryptoon15-Oct-18 01:34 PM
jl777c15-Oct-18 01:34 PM
runtime forks will be able to select verushash
existing chains would need a hardfork to change algo and there is no plan to chain KMD from equihash
ComputerGenie 👴👴👴15-Oct-18 01:36 PM
That's what I thought
Cryptoon15-Oct-18 01:36 PM
Roger, will reply later if nobody else does it by then already
@DCAL_Gamevid4 @Jacobstoon @cryptorecorder @KomodoPlatform @Bitcoin @ethereum @VerusCoin Correct information @DCAL_Gamevid4
5
Cryptoon15-Oct-18 01:36 PM
SHossain making it happen
1
gameboy15-Oct-18 01:58 PM
!kmdtip
KMD TipBotBOT15-Oct-18 01:58 PM
TipBot Help
!kmdtip
Displays this message
!kmdtip balance
Displays your balance
!kmdtip deposit
Displays your deposit address
!kmdtip withdraw <address> <amount>
Withdraws the entered amount to a KMD address of your choice, e.g.
!kmdtip withdraw GLM3n7yMFmYkas2AgHKqE6EMJW5VsUXtQn 5.20Note: Minimal amount to withdraw: 0.1 KMD. A withdrawal fee of 0.02 KMD will be automatically deducted from the amount.Additionally, 10% of deducted withdrawal fee will be donated to the bot author to help continual development.
!kmdtip <@user> <amount> [private]
Tips the @ mentioned user with the desired amount, e.g.
!kmdtip @test123456#7890 1.00
!kmdtip rain <amount> [<@role>]
Rains the desired amount onto all online users (optionally, within specified role), e.g.
!kmdtip rain 10.00, !kmdtip rain 10.00 @Supporters
!kmdtip soak <amount> [<@role>]
Soaks the desired amount onto all online and idle users (optionally, within specified role), e.g.
!kmdtip soak 5.00, !kmdtip soak 5.00 @Supporters
!kmdtip thunder <amount> [<@role>]
Tips a random lucky online user with the amount (optionally, within specified role), e.g.
!kmdtip thunder 5.00, !kmdtip thunder 5.00 @Supporters
!kmdtip faucet
Gets an amount from the faucet (applicable every 4 hours)
cryptoprofit15-Oct-18 02:17 PM
!kmdtip balance
KMD TipBotBOT15-Oct-18 02:17 PM
TipBot
Please use #tip-bot to talk to TipBot.
CryptoHuff15-Oct-18 02:46 PM
Hey there! You may now advertise your project on a 970x90 ad-banner on my website.
jl777c15-Oct-18 02:47 PM
what is the ROI?
i doubt there is any measurable return from it, so you can stop posting about it every other day
NNoperator15-Oct-18 02:51 PM
first search engine hit on their site is an add to advertise on the site! I'm sure there is much interesting content there!
Has the 350 BTC buyer recently increased his price to .000175 ? They seem determined to obtain 2 million KMD at these low prices. Good luck!(edited)
technofloof15-Oct-18 03:00 PM
its raining men today?
ComputerGenie 👴👴👴15-Oct-18 03:03 PM
it's raining meh here, does that count?
tree frog15-Oct-18 03:45 PM
Helloo
2
javadth15-Oct-18 03:45 PM
ANYBODY here can help me about idax exchange ??
ComputerGenie 👴👴👴15-Oct-18 03:49 PM
never even heard of it
javadth15-Oct-18 04:11 PM
idax.mn
ComputerGenie 👴👴👴15-Oct-18 04:13 PM
@javadth No KMD or KMD-related coins, why would anyone here know how to help?
javadth15-Oct-18 04:19 PM
@ComputerGenie 👴👴👴 are you speaker of kmd community ?
or you sure anyone want to help me or not
Cryptoon15-Oct-18 04:20 PM
And thus @javadth openeth pandora's box
But what is the question?
As I don't think kmd is listed there
javadth15-Oct-18 04:21 PM
just wanted to know is this exchange legit or not
for any other coins
Cryptoon15-Oct-18 04:21 PM
As it sounds like an ERC20 exchange
ComputerGenie 👴👴👴15-Oct-18 04:24 PM
or you sure anyone want to help me or not@javadth I wasn't speaking of want, I was speaking as to it's not likely anyone can help(edited)
KomodoWorld15-Oct-18 04:51 PM
it's listed on coinmarketcap but I can't find reviews(edited)
c2k15-Oct-18 05:48 PM
FIDELITY LAUNCHES NEW COMPANY, FIDELITY DIGITAL ASSETS
Fidelity offering Bitcoin trading to hedge funds now!
10% spike in BTC occurred hours before the Fidelity announcement: so there was clear insider trading and/or exchanges that were front-running their clients. In any other market the SEC would investigate & folks would end up in jail. Not in this crypto cesspool of manipulat...
Likes
160
snowdamn15-Oct-18 06:37 PM
or maybe him making a fool out of himself at the Senate hearing was priced as bullish...
@Nouriel So now 10% moves in crypto are insider trading... Unless we go down, then mister @Nouriel is simply correct... Sure...
actionslacks15-Oct-18 07:46 PM
the SEC only goes after the big guy's competition
groundhog15-Oct-18 08:37 PM
thats just ppl cashing out tether from finex imo, nothing to see here
ComputerGenie 👴👴👴15-Oct-18 09:02 PM
Opinion time:
Is the Ryzen Threadripper 2990WX worth buying?
1
1
jspook1615-Oct-18 09:07 PM
How much is it
ComputerGenie 👴👴👴15-Oct-18 09:12 PM
LOL like 1700 USD
jspook1615-Oct-18 09:16 PM
Oh geez I just looked it up. 32 cores?
scubapanda15-Oct-18 09:17 PM
Perhaps if you use it 100%/247. Otherwise it's like buying a 4TB SSD and using 1TB for the first year while the waiting for the unused partition to gain value.
ComputerGenie 👴👴👴15-Oct-18 09:17 PM
Well, using it is easy; we have VRSC to help with that
1
More looking to know if it's worth moving from Intel to AMD because of it
If it helps I have used AMD for 5 years and only had to repair the card once...in one of old machines so for quality is good .
Kitchen Table15-Oct-18 10:20 PM
I still have a computer rocking a AMD Phenom II X4 965. Used it to mine VRSC. It found one block in a week.
ComputerGenie 👴👴👴15-Oct-18 10:21 PM
@Hermes I used AMD only for like a decade, but until recently AMD had a bad max RAM issue and that's why I went back to Intel to begin with, otherwise I'd have stayed with AMD
Kitchen Table15-Oct-18 10:21 PM
Which surprises me because it shouldn't have worked.
SHossain15-Oct-18 10:22 PM
my brand new liquid cooled ryzen 1950x machine hangs itself automatically within hour after mining Verus for few days.(edited)
now, just gathering dust
need to look deep into it and try to fix
Hermes15-Oct-18 10:23 PM
Yeah it's a tricky choice if you are seeing that type of issues with the Ram
didn't knew about it
SHossain15-Oct-18 10:23 PM
yes, i suspect RAM
probably mined few blocks of verus when block reward was 96
ComputerGenie 👴👴👴15-Oct-18 10:25 PM
The RAM "issue" I had was that Intel had a higher max than AMD
---
@SHossain Do you think the 32 core is worth getting (pretend price isn't an issue)?
SHossain15-Oct-18 10:26 PM
not really.
i'm happy with i7-8700k
also the limited edition i7-8086k is nice too.
i also use a 970 PRO M.2 1TB drive. everything is super fast.
ComputerGenie 👴👴👴15-Oct-18 10:27 PM
SHossain15-Oct-18 10:28 PM
and, the 32 core doesn't have any built-in GPU
ComputerGenie 👴👴👴15-Oct-18 10:28 PM
I have no problem with prices if there's an "advantage" to be had of x vs y
But I don't want to buy x if there is no "advantage" other than "new and shiny"


llvm-cov - emit coverage information
llvm-cov [-gcno=filename] [-gcda=filename] [dump]
The experimental llvm-cov tool reads in description file generated by compiler and coverage data file generated by instrumented program. This program assumes that the description and data file uses same format as gcov files.
This option selects input description file generated by compiler while instrumenting program.
This option selects coverage data file generated by instrumented compiler.
This options enables output dump that is suitable for a developer to help debug llvm-cov itself.
llvm-cov returns 1 if it cannot read input files. Otherwise, it exits with zero.
llvm-cov is maintained by the LLVM Team (http://llvm.org/).


APRIL 4
FIRST
A reading from the second letter of
Brethren: having the ministry by the mercy of God, we do not lose heart.
We have renounced disgraceful, underhanded ways; we refuse to practice cunning
or to tamper with God's word, but by the open statement of the truth we would
commend ourselves to every man's conscience in the sight of God. For what we
preach is not ourselves, but Jesus Christ as Lord, with ourselves as your
servants for Jesus' sake. For it is the God who said, "Let light shine out
of darkness," who has shone in our hearts to give the light of the
knowledge of the glory of God in the face of Christ. But we have this treasure
in earthen vessels, to show that the transcendent power belongs to God and not
to us.
The wor of the Lord.
RESPONSORIAL PSALM Ps 37
ALLELUIA John 15:5
R. Alleluia. I am the vine, you are the branches, says the Lord. He who abides in me, and I in him, bears much fruit. R. Alleluia.
GOSPEL
Luke 6: 43-45
At that time: Jesus said to his disciples, "For no good tree bears
bad fruit, nor again does a bad tree bear good fruit; for each tree is known by
its own fruit. For figs are not gathered from thorns, nor are grapes picked
from a bramble bush. The good man out of the good treasure of his heart
produces good, and the evil man out of his evil treasure produces evil; for out
of the abundance of the heart his mouth speaks.
The Gospel of the Lord.


Script PICO-TweenMachine
PICO-TweenMachine -
An additional small extension
library for PICO-Tween that
acts as a wrapper, powering
all tween related functionality
internally, rather than having
large chunks of tweening
cluttering the codebase.
Info:
- Copyright: Joeb Rogers 2018
- License: MIT
- Author: Joeb Rogers
-
tween_machine:update ()
-
Calls update() on all current
tween instances.
-
tween_machine:add_tween (instance)
-
Adds a created tween instance to
the table. The passed in object only
needs to define the fields it needs
to change, the rest will be defaulted
to the base tween object.
For example:
tween_machine:add_tween({
func = linear,
v_start = 10,
v_end = 5
})
Parameters:
- instance
The tween object to add
to the machine.
Returns:
Returns the tween object.
-
__tween:register_step_callback (func)
-
Registers the passed in function
as a step callback, to be called
in update() after a new value has
been set.
Parameters:
- func
The function to be
called every step.
-
__tween:register_finished_callback (func)
-
Registers the passed in function
as a finished callback, to be
called at the end of update()
after the tween has been marked
as finished.
Parameters:
- func
The function to be
called when finished.
-
__tween:init ()
-
Sets the tween's necessary
fields prior to being
ran.
Called automatically when
added to the wrapper object
or when restarted.
-
__tween:restart ()
-
Restarts the tween's
necessary fields in order to be
ran again.
-
__tween:update ()
-
Updates the tween object.
Gets the current value for the
tween from the set function and
will pass it through all the
registered step callbacks.
Will set the tween as finished
when the elapsed time passes
the duration and will pass
the tween object to all
registered finished callback
functions.
Returns:
Will return early if
the tween is finished or no
easing function has been set.
-
__tween:remove ()
-
Removes the tween from the
wrapper object.
-
tween_machine
-
The main wrapper object
of the library.
Stores all curent instances
of tween objects and drives
them.
Fields:
-
__tween
-
The base table for all tween
objects.
Fields:
- func
The easing function
to use for this tween.
- v_start
The starting value
for the tween.
- v_end
The end value of the
tween.
- value
The value between
v_start and v_end representing
the current tween progress.
- start_time
The time at which
the tween was started, set in init()
via the time() function.
- duration
The duration of time
the tween should last for.
- elapsed
The amount of time
elapsed since the tween was started.
- finished
A bool for whether
or not the tween has finished
running.
- step_callbacks
A table of
registered callback functions.
Called in update() after a new
value has been set.
Will call all registered functions
with value as the argument.
- finished_callbacks
A table
of registered callback functions.
Called at the end of update()
after the tween has been marked
as finished.
Will call all registered functions
with self as the argument.


Read punched card generated by kloth.net
Select yellow card
Select red card
Select green card
Sorry, this does not look like an image generated from kloth.net. The image must have a dimension of 588 x 264.
Developed by Extreme Coders | Source on Github!


--- layout: default --- My CV is here. Aside from the teaching stuff, most of this is work done in my spare time (most content is in spanish):


Run
Pause
Loop
Reset
Randomize
Import/Export
Build a Maze, then let a Genetic Algorithm solve it
Welcome! Setup the maze by clicking and then click "Run" or "Loop"


dgof: Discrete Goodness-of-Fit Tests
This package contains a proposed revision to the
stats::ks.test() function and the associated ks.test.Rd help
page. With one minor exception, it does not change the
existing behavior of ks.test(), and it adds features necessary
for doing one-sample tests with hypothesized discrete
distributions. The package also contains cvm.test(), for doing
one-sample Cramer-von Mises goodness-of-fit tests.
| Version: |
1.2 |
| Published: |
2013-10-25 |
| Author: |
Taylor B. Arnold, John W. Emerson, R Core Team and contributors
worldwide |
| Maintainer: |
Taylor B. Arnold <taylor.b.arnold at gmail.com> |
| License: |
GPL-2 | GPL-3 [expanded from: GPL (≥ 2.0)] |
| NeedsCompilation: |
yes |
| Citation: |
dgof citation info |
| Materials: |
README |
| CRAN checks: |
dgof results |
Downloads:
Reverse dependencies:
Linking:
Please use the canonical form
https://CRAN.R-project.org/package=dgof
to link to this page.


vmstats.py
Some of the metrics that we are intrested in are those in the output of ‘sar -B’ that reports paging statistics. Some of the metrics below are available only with post 2.5+ kernels. The following values are available:
- pgpgin/s
- Total number of kilobytes the system paged in from disk per second. Note: With old kernels (2.2.x) this value is a number of blocks per second (and not kilobytes).
- pgpgout/s
- Total number of kilobytes the system paged out to disk per second. Note: With old kernels (2.2.x) this value is a number of blocks per second (and not kilo- bytes).
- fault/s
- Number of page faults (major + minor) made by the system per second. This is not a count of page faults that generate I/O, because some page faults can be resolved without I/O.
- majflt/s
- Number of major faults the system has made per second, those which have required loading a memory page from disk.
- pgfree/s
- Number of pages placed on the free list by the system per second.
- pgscank/s
- Number of pages scanned by the kswapd daemon per second. Kernel theread kswapd provides asynchronous page reclamation and runs only when free pages in a zone runs low.
- pgscand/s
- Number of pages scanned directly per second. Direct reclaimation occurrs periodically.
- pgsteal/s
- Number of pages the system has reclaimed from cache (pagecache and swapcache) per second to satisfy its memory demands.
- %vmeff
- Calculated as pgsteal / pgscan, this is a metric of the efficiency of page reclaim. If it is near 100% then almost every page coming off the tail of the inactive list is being reaped. If it gets too low (e.g. less than 30%) then the virtual memory is having some difficulty. This field is displayed as zero if no pages have been scanned during the interval of time.
This plugin is based on /proc/vmstat output (varies from system to to system), which consists of following fields:
- nr_free_pages 7057051
- nr_inactive_anon 86
- nr_active_anon 12702
- nr_inactive_file 2210411
- nr_active_file 2323658
- nr_unevictable 8
- nr_mlock 8
- nr_anon_pages 12116
- nr_mapped 5168
- nr_file_pages 4534236
- nr_dirty 36
- nr_writeback 0
- nr_slab_reclaimable 359519
- nr_slab_unreclaimable 268554
- nr_page_table_pages 3700
- nr_kernel_stack 522
- nr_unstable 0
- nr_bounce 0
- nr_vmscan_write 0
- nr_writeback_temp 0
- nr_isolated_anon 0
- nr_isolated_file 0
- nr_shmem 168
- numa_hit<PHONE_NUMBER>
- numa_miss<PHONE_NUMBER>
- numa_foreign<PHONE_NUMBER>
- numa_interleave 38352
- numa_local<PHONE_NUMBER>
- numa_other<PHONE_NUMBER>
- nr_anon_transparent_hugepages 1
- pgpgin 203525573
- pgpgout 619347783
- pswpin 0
- pswpout 0
- pgalloc_dma 1
- pgalloc_dma32 716304477
- pgalloc_normal<PHONE_NUMBER>
- pgalloc_movable 0
- pgfree<PHONE_NUMBER>
- pgactivate 8496932
- pgdeactivate 0
- pgfault 418769943
- pgmajfault 2090
- pgrefill_dma 0
- pgrefill_dma32 0
- pgrefill_normal 0
- pgrefill_movable 0
- pgsteal_dma 0
- pgsteal_dma32 0
- pgsteal_normal 0
- pgsteal_movable 0
- pgscan_kswapd_dma 0
- pgscan_kswapd_dma32 0
- pgscan_kswapd_normal 0
- pgscan_kswapd_movable 0
- pgscan_direct_dma 0
- pgscan_direct_dma32 0
- pgscan_direct_normal 0
- pgscan_direct_movable 0
- zone_reclaim_failed 0
- pginodesteal 0
- slabs_scanned 0
- kswapd_steal 0
- kswapd_inodesteal 0
- kswapd_low_wmark_hit_quickly 0
- kswapd_high_wmark_hit_quickly 0
- kswapd_skip_congestion_wait 0
- pageoutrun 0
- allocstall 0
- pgrotated 0
- compact_blocks_moved 0
- compact_pages_moved 0
- compact_pagemigrate_failed 0
- compact_stall 0
- compact_fail 0
- compact_success 0
- htlb_buddy_alloc_success 0
- htlb_buddy_alloc_fail 0
- unevictable_pgs_culled 14239
- unevictable_pgs_scanned 0
- unevictable_pgs_rescued 60163177
- unevictable_pgs_mlocked 60164843
- unevictable_pgs_munlocked 60164803
- unevictable_pgs_cleared 32
- unevictable_pgs_stranded 0
- unevictable_pgs_mlockfreed 0


Hello!
My name is Yuriy.
Welcome to my page.
What this all about?
Well, let's say that this is my work notes, some examples, pieces of the working code, etc.
If you will find any of this stuff useful feel free to use it to your cause.
Cheers!


Three.js is a script that makes 3D in the browser.
The wikipedia page say this;
Three.js is a cross-browser JavaScript library and Application Programming Interface (API) used to create and display animated 3D computer graphics in a web browser. Three.js uses WebGL. The source code is hosted in a repository on GitHub.
It is one javascript file and runs on most phones, computers and TVs. Even if you don't know much (or any) javascript, once you know the rules you can start playing with it quite quickly.
I find that most of the basic things in games engines (controls, visuals, audio, interactivity) can be achieved in the browser. Where flash, unity and unreal engine use a stage, mouse clicks and textboxes, we do it with a code edit/save and a browser refresh.
There are options for a Graphic User Interface, like the official editor and a few engines that use three.js. You still must code to use three.js. Writing color:red is as easy as clicking around for it.
I used to use Flash around 20 years ago. Like photoshop, it was a good tool to make things. Then the format was forced out and we now have canvas to replace it. Like it or love it, it does the same sort of things by default in the browser, without the need of updating a plugin. To do the same things as we used to do in flash takes coding. That is a barrier, but it shouldn't be hard to cross. It is essentially lights, camera, action on a stage.
Sometimes we can face browser security and server functionality issues, so I run my three.js projects with XAMP server on mac OS. This makes my laptop behave like a web server.
 Inside each folder is an index.html file and the three.js file.
I like to keep all js/css in one file. Sometimes I start with the official three.js docs basic example.
I like to use open source assets and modify them. Opengameart.org is a good place for assets. Much respect to grafxkid for his amazing work that I love to use.
All the code is available in the source or on github.


{% extends "base_template.html" %} {% block title %}SED-ML | URNs for model languages, data description formats, and symbols{% endblock %} {% block content %}
The following languages have to our knowledge so far
been used with SED-ML. To specify the language of a model
in the Model class, please use the according URN given.
The general scheme for a language URN in SED-ML is urn:sedml:language:{ language
name and version }
.
| Language | URN | Specification |
|---|---|---|
| {{ entry.language }} | {{ entry.urn }} |
{% if entry.url %}{{ entry.url }}{% endif %} |
To specify the format of a resource please use the according URN given.
The general scheme for a format URN in SED-ML is urn:sedml:format:{ format name }
.
| Data Format | URN | More information |
|---|---|---|
| {{ entry.format }} | {{ entry.urn }} |
{% if entry.url %}{{ entry.url }}{% endif %} |
As described in the SED-ML specification some modeling
languages use predefined symbols or implicit variables. In order to
handle such variables the SED-ML introduced symbol URNs. The general scheme for a symbol
URN in SED-ML is urn:sedml:symbol:{ symbolName }
.
| Language | URN | Definition |
|---|---|---|
| {{ entry.language }} | {{ entry.urn }} |
{{ entry.definition }} |


Simple Interest Calculator
Amount(Rs)
Interest Rate
No. of Years
Click here to calculate interest
Compute Interest


{% extends "global/Page.html" %}
{% load otree static %}
{% block title %}
Negotiations are about to begin
{% endblock %}
{% block content %}
You and the other participants will now start bargaining.
To recap, bargaining has V phases:
Phase I: Making an offer: Everyone makes an offer indicating which coalition they want to form and indicating how they want to distribute the ${{ total_payoff }} million among the coalition members.
Phase II: Choosing offers: Everyone selects the coalition offer they want to execute.
Phase III: Seeing chosen offers: Everyone sees which offers are chosen. A tentative coalition is formed when two negotiators have selected the same offer.
Phase IV: Making an alternative offer: The negotiator not included in the tentative offer makes an alternative offer to one of the negotiators in the tentative coalition.
Phase V: Ratyfing the tentative coalition or accepting the alternative offer. Participants choose to ratify the tentative coalition or accept the alternative offer.


 By |han≠kass’o (L VIII.-8. 6687-6708). |na ka ti's mother tells him not to say the name of the son of the Wind until his father has made a hut for them. When the father is finished, |na ka ti calls the Wind's name and then runs to the hut. The Wind blows away the people's houses, except for the Wind's hut.  A strong shelter must be made before calling the Wind's name.
Comments
1) A page inserted between the front cover and frontispiece of Book VIII-8 features a number (III) and a list of dates in chronological order, with |han≠kass'o's movements (before coming to Mowbray) noted alongside, 2) p.6687opp: |han≠kass'o heard this from his mother (|xabbi-an), and a note on her parents and their names; about ||kuarri, 3) p.6687v: see The porcupine eats ||kuarri, 4) 6688v: see Locusts or ||kabba- |kha, 5) p.6694v: see The Wind, 6) p.6706v: a word for a dry stream-bed in |xam and Dutch, 7) See also The Wind and Notes to the story of The Wind, 8) This story is found in Book VIII-8
Contributors
|han≠kass'o (Klein Jantje) (VIII)
Date
15 April 1878 (started)
Categories
Keywords
Wind (the son of the Wind) , Wind (what people say about) , Wind (people cannot see in) , Wind (blows away people's houses and bushes) , Wind (is tied up in cloth) , Wind (his skin is called cloth) , Wind (became a bird) , Wind (the transformation of) , Wind (in Early Times) , Wind (the young Wind) , Wind (the different types of) , Wind (his relations) , Wind (the mother of) , Wind (his hut) , Wind (his actions) , Wind (the blowing of) , Wind (that blows strongly) , Wind (his 'knee') , Wind (his 'knee' makes a noise) , Wind (that is gentle) , Wind (that stands) , Wind (that lies down) , Wind (makes dust) , Wind (and hunting springbok) , Wind (rolls the ball of ||kuarra) , Wind (calling its name) , Wind (avoidance behaviour relating to) , Wind (and the actions of the people) , Wind (was formerly a man) , Wind (and |na ka ti who called its name) , Wind (what people must do when it blows) , Wind (the names of) , skin (the Wind's is cloth) , skin (the son of the Wind) , cloth (the Wind's skin is) , cloth (the son of the Wind) , transformation (the Wind became a bird) , transformation (the son of the Wind) , springbok (hunting and the wind) , springbok (and the son of the Wind) , hunting (springbok) , hunting (and the son of the Wind) , son of the Wind (was formerly silent) , son of the Wind (rolls a ball of ||kuarra) , son of the Wind (and |na ka ti who called his name) , son of the Wind (his mother) , son of the Wind (lies down) , son of the Wind (his actions) , son of the Wind (and the blowing of the Wind) , son of the Wind (blows strongly) , son of the Wind (blows dust) , son of the Wind (calling his name) , son of the Wind (was the Wind) , son of the Wind (lies kicking violently and making dust) , son of the Wind (his mother raises him up) , son of the Wind (why the Wind stops blowing) , hut (a strong shelter must be made before the Wind's name is called) , hut (and the son of the Wind) , name (calling that of the Wind) , name (avoiding calling the Wind's) , name (|na ka ti calls the Wind's) , name (and the son of the Wind) , name (the names of the Wind) , shelter (a strong one or hut must be made before the Wind's name is called) , shelter (and the son of the Wind) , dust (wind blows) , dust (and the son of the Wind) , bird (Wind became) , bird (the son of the Wind)
Story Pages
6687-6708


RESThub JS is an Open Source framework designed to allow you to build RIA HTML5 web applications following based on an entreprise grade ready jQuery based JS framework.
Enter search terms or a module, class or function name.


GERMINAL A film review by Steve Rhodes Copyright 1996 Steve Rhodes
RATING (0 TO ****): ***
GERMINAL (1993) is based on Emile Zola's tragic novel of the same name about the plight of the coal workers and especially of their families in 19th century France. It is an extremely moving tale that points to the ultimate hopelessness of the human condition.
The script by Claude Berri and Arlette Langmann and the direction by Claude Berri pull no punches. This is a movie that rarely considers the gray areas, but paints everything in sharp contrasts. Everything is either good or evil; there is no middle ground. Periodically, we glimpse the possibility of a few redeeming features in the rich, but generally they are portrayed as the devil incarnate. Although the number of contrasts the film metaphorically presents seem innumerable, the ones that struck me the most were: rich vs. poor, day vs. night, above ground vs. under ground, light vs. dark, opulence vs. frugality, green vs. brown, workers vs. bosses, and capitalism vs. unionism. If you watch for them, you can see many more, and this contrast provides an extremely effective and propagandistic albeit one sided reading of history.
As the film starts, Maheu (Gerard Depardieu whose best film is COLONEL CHABERT) gives a lantern to his new fellow worker Etienne Lantier (Renaud) and tells him, "Take good care of it. For a miner a lamp is his sun." From the beginning we find the ungrateful owners harassing the downtrodden workers. They yell at them for not fixing the timbering because that will mean the owners will have to pay something to their windows if they die. The workers in turn complain that they can not afford to take time to fix the timbering since they are paid by the amount of coal they bring up and they already have men, women, and children working in the mines so that their families will have enough food to ward off starvation.
The first part of this epic length film is devoted to how families live, e.g., everyone takes baths in front of everyone else in a tub in the living room, and how families just get enough food to keep from starving. The subtext in the first part is the growing threat of a strike. This movement is lead by Lantier, but there are others to his left who think a strike is not the best course. One, a communist I suppose, urges that the workers of the entire world must unite first in which case strikes will unnecessary since the bosses will be gone. The other, an anarchist I guess, says the only solution is to burn down all of the mines and factories and only out of this utter destruction will salvation arise.
Certainly, religion is not the answer as Lantier says, "Who needs God and Heaven? We can change this lousy world." He goes on to say later, the problem is that, "capitalist tyranny is destroying us." The owner of the Voreux coal mine questions the value in a strike, telling the workers, "A strike is a disaster for everyone. Within a week you'll all starve. Then what will you do?" The other mine owner Deneulin (Bernard Fresson) puts it, "Before you make a living I must make a living first. The smallest increase will bankrupt me." The film show the rich owners living extravagantly and thereby giving lie to their words.
The second part of the film deals with the chaos that ensues once a massive strike is underway. The vicious way the strikers deal with workers who attempt to choose to work remind me of the controversy today where workers in some industries are forced to join unions and then the unions confiscate part of their wages as mandatory dues which the union bosses funnel into political action committees which support the politics of the union bosses.
The film ends well, but it is both dramatic and frightening. The acting is brilliant all round. Depardieu, Renaud and Miou-Miou as Maheu's wife Maheude are the best. There are many scenes where their acting is right on the edge. Miou-Miou is best in her anger scenes where she excels. The supporting cast is also good, except for the bosses, but then again, they are made to seem so shallow that it would be hard for an actor to shine playing one of them.
 Watch how the camera and the light caress each of the poor people's faces. The sets by Thanh At Hoang and Christian Marti are evocative of great horror and misery. The most frightening scenes are those of the claustrophobic sets for the mines. The make-up by Joel Lavau and Nathalie Louichon provide just the right feel of the grit on a coal miner's face.
GERMINAL runs too long at 2:50, and I would have preferred editor Herve De Luze to have made the movie not such an epic length. The film is rated R for sex, nudity, and violence. Most of the film has little violence, but there are a few needlessly horrific scenes, including one of castration, that should have been edited out. Nevertheless, it is my judgment that the movie would be fine for most teenagers. I liked the movie, recommend it to you, and award it ***.
**** = One of the top few films of this or any year. A must see film. *** = Excellent show. Look for it. ** = Average movie. Kind of enjoyable. * = Poor show.  Totally unbearable.
REVIEW WRITTEN ON: March 31, 1996
Opinions expressed are mine and not meant to reflect my employer's.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Type Function Library gameNetwork.* Return value Revision Current Public Release (2013.2076) Keywords gameNetwork, show, leaderboards, achievements Sample code /CoronaSDK/SampleCode/GameNetwork/GameCenter See also gameNetwork.init()
gameNetwork.request()
Displays the requested game network information to the user.
gameNetwork.show( name [, data ] )
String. Supports the following strings:
Game Center:
"leaderboards"
"achievements"
"friendRequest"
"matches"
"createMatch"
All APIs for Game Center support a table as an optional second parameter. "listener"
is an optional key for all the APIs which you may assign a callback function. For "leaderboards"
, "leaderboard"
is an optional key in the table parameter which takes a table. The table has key/value pairs that mimic the GKLeaderboard (and GKLeaderboardViewController) objects. The key "timeScope"
may take one of the following strings: "Today"
; "Week"
; "AllTime"
.
For "friendRequest"
, optional keys in the table parameter are:
"message"
— takes a string which allows you to prepopulate the message field with your own custom text.
"playerIDs"
— takes an array of strings of Game Center player IDs to players you want to send a friend request to (which can be retrieved from the gameNetwork.request()
API).
"emailAddresses"
— takes an array of strings which are email addresses of players you want to send friend requests to.
Note: The total number of player IDs and email addresses must not exceed the Game Center maximum limit or the OS will throw an exception. gameNetwork.request( "loadFriendRequestMaxNumberOfRecipients" )
returns this number. As of this writing, the limit is 3.
For "matches"
, required keys in the table parameter are:
"minPlayers"
— takes a number which specifies the maximum number of players in a multiplayer game.
"maxPlayers"
— takes a number which specifies the minimum number of players in a multiplayer game.
For "createMatch"
, required keys in the talbe parameter are:
"playerIDs"
(required) is an array of strings with the ids of the people you want to invite to a match.For "createMatch"
, optional keys in the talbe parameter are:
"minPlayers"
(optional) is the minimum number of players that can be in a match
"maxPlayers"
(optional) is the maximum number of players that can be in a match
In iOS 6.0, 6.0.1 and 6.0.2 the invitaiton screen will always show a "waiting" status for invited players so it is recommended for those versions of iOS to use gameNetwork.request("createMatch") instead.
Table. Please see the Examples section below for the data table format required by Game Center.
Game Center:
local function onGameNetworkPopupDismissed( event )
-- The shown Game Center popup was closed.
end
-- Display the leaderboard.
gameNetwork.show( "leaderboards", { leaderboard = {timeScope="Week"}, listener=onGameNetworkPopupDismissed } )
-- Display the player's achievements.
gameNetwork.show( "achievements", { listener=onGameNetworkPopupDismissed } )
-- Display a "Send Friend Request" popup.
local parameters =
{
message = "Be my friend please",
playerIDs = { "G:194669300", "G:1435127232" },
emailAddresses = {<EMAIL_ADDRESS>},
listener = onGameNetworkPopupDismissed,
}
gameNetwork.show( "friendRequest", parameters )
-- Displays a "Games" popup which shows the current matches and allows the user to create matches as well.
local parameters =
{
maxPlayers = 3, -- This number be greater than or equal to minPlayers
minPlayers = 2, -- The minimum number of players is 2
playerGroup = 2, -- The game type that will be shown
listener = onGameNetworkPopupDismissed,
}
gameNetwork.show( "matches", parameters )
-- Displays a popup which lets the user invite other players to a game. Read gameNetwork.request("createMatch") for more information.
local parameters =
{
playerIDs = {"w4o98y3498hg349h", "wrighfq547hg543"},
minPlayers = 2,
maxPlayers = 3,
playerGroup = 1, -- The game type will be created, for example it can be quick game or long game. Only players whose requests share the same playerGroup value are automatched by Game Center.
playerAttributes = {1,4,6}, -- The bits to set for the player
inviteMessage = "Hi join me",
listener=requestCallback
}
gameNetwork.show( "createMatch", parameters)


The lecture today covers chapter 12 of the book Web Programming Step by Step, 2nd Edition. The book's lecture slides for this chapter are available here.
XMLHttpRequest
, a JavaScript objectXMLHttpRequest
objectXMLHttpRequest
requests data from a Web serverAccording to: Web Programming Step by Step
http://api.flickr.com/services/rest/?
Flickr's most interesting images:
<form method="get" action="query_flickr.php">
Date: <input type="text" name="iflickr_date"
placeholder="YYYY-MM-DD">

Num: <input type="text" name="iflickr-num"
pattern="[1-9]" placeholder="between 1 and 9">

<input type="submit" value="Get interesting images">
</form>
Lets take a look at query_flickr.php
.
Synchronous communication: A click on a link loads an entire web page. User waits for the loading to finish before continuing the interaction.
Image source: Web Programming Step by Step
Image source: Web Programming Step by Step
//IE6 and prior IE versions use Microsoft.XMLHTTP instead
var ajax = new XMLHttpRequest();
//retrieve data from URL (file) of interest
//false parameter: synchronous request
ajax.open('GET', 'example.txt', false);
ajax.send(null);
//response data in ajax.responseText
document.getElementById('ttExampleText').value = ajax.responseText;
Making the code more reusable with simple error checking: ajax2.html
send
to receive the file from the serverXMLHttpRequest
| property | description |
|---|---|
onreadystatechange | fires when status changes |
readyState | 0: not initialized 1: set up, not sent 2: sent 3: in progress 4: completed |
responseText | data that was fetched (string) |
responseXML | fetched XML as DOM Document object |
status | HTTP status code sent back by the Web server (e.g. 200, 403) |
statusText | description of status sent by the Web server |
XMLHttpRequest
| method | description |
|---|---|
abort() | stop a Web request in progress |
open(method, url, async) | GET or POST URL to fetch true (asynchronous) or false (synchronous) |
send(data) | called after open() ; for POST data is the string to send, for GET it is null |
Event onreadystatechange
is fired when the status of the request changes.
var ajax = new XMLHttpRequest();
//function to be called when the data has arrived
ajax.onreadystatechange = function() {
//the only state we care about
if(ajax.readyState==4) {
/*
* process received data
*/
}
}; //end of function
ajax.open("GET", "url", true); //true indicates asynchronous request
ajax.send(null);
XMLHttpRequest
object
function displayTimeAsync() {
var ajax = new XMLHttpRequest();
//function to be called when the
//data has arrived (to display it)
ajax.onreadystatechange = function() {
//we can access the ajax object
if(ajax.readyState==4) {
var p = document.createElement("p");
p.innerHTML = ajax.responseText;
document.getElementById("timeDiv").appendChild(p);
}
}; //end of function
//true indicates asynchronous request
ajax.open("GET", "time.php", true);
ajax.send(null);
}
function downloadTextAsync(url, my_function) {
var ajax = new XMLHttpRequest();
ajax.onreadystatechange = function() {
if(ajax.readyState==4 && ajax.status == 200) {
my_function(ajax);
}
else {
alert("Error: "+ajax.statusText);
}
}; //end of function
ajax.open("GET", "time.php", true);
ajax.send(null);
}
function displayTimeAsync2() {
downloadTextAsync("time.php",ajaxCompleted);
}
function ajaxCompleted(ajax) { /* do something */ }
window.onload = function () {
$("oneTimeButton").onclick = displayTimeAsync3;
}
function displayTimeAsync3() {
new Ajax.Request(
'time.php',
{
method:'get',
onSuccess:timeFetchCompleted,
//GET parameters are drawn from here
parameters: {p1: "param 1", p2: 100.0},
localParam: {myPara: 50.0}
}
);
}
function timeFetchCompleted(ajax) {
$('time_async3').innerHTML = ajax.responseText;
//parameters accessed through ajax.request.localParam['myPara']
}
Time to Update
Ajax.Request
event options| event | occurs when ... |
|---|---|
onSuccess | request was successful |
onFailure | request failed |
onComplete | request was completed (either way) |
onException | an exception ocurred |
on### | the request failed with an error code (e.g. on404 ) |
function displayTimeAsync3() {
//Prototype's wrapper: a nested object,
//makes an asynchronous request
new Ajax.Request(
"time.php",
{
method:"get",
onSuccess:ajaxCompleted,
onException:ajaxFailed, //two callbacks: unsuccessful request
onFailure:ajaxFailed
}
);
}
function ajaxFailed(ajax, exception) {
var msg = "Error: ";
if(exception) {
msg += "Exception: "+exception.message;
}
else {
msg += "Server status: "+ajax.statusText;
}
alert(msg); //or console.log(msg);
}
Ajax.Updater
Ajax.Updater
simplifies this process
window.onload = function () {
$("oneUpdateTimeButton").onclick = displayTimeAsync4;
}
function displayTimeAsync4() {
new Ajax.Updater(
//id of the element that gets assigned the data
"time_async4",
"time.php",
{
method:'get'
}
);
}
Time to Update
Ajax.PeriodicalUpdater
frequency
(repeat call after X seconds), and decay
(how to react if data does not change)
function displayTimeAsync5() {
new Ajax.PeriodicalUpdater(
//id of the element that gets assigned the data
"time_async5",
"time.php",
{
method:'get',
frequency:3,
decay:1
}
);
}
Time to Update
Test file: ajax_error.html
Matthew Gambardella, XML Developer's Guide, 44.95, 2000-10-01, genre: Computers
Kim Ralls, Midnight Rain, 5.95, 2000-12-16, genre: Fantasy
Gambardella, Matthew
XML Developer's Guide
Computer
44.95
2000-10-01
Ralls, Kim
Midnight Rain
Fantasy
5.95
2000-12-16
Example source
1.0
1
A
20 Jan 2014 02:39:51
2014-01-20 02:39:51 +0100
2014-01-20 01:39:51
False
Web service call
XML is a specification for creating markup to store hierarchical data.
xmllint
<-- XML prologue
<-- document tag (single outermost tag)
XMLHttpRequest
contains a responseXML
property (instead of a string, a DOM object is returned)
function my_func
{
//Prototype code
new Ajax.Request(
"url",
{
method: "get",
onSuccess: process_xml;
}
);
}
function process_xml(ajax) {
//work with ajax.responseXML;
}
1
A
20 Jan 2014 02:39:51
2014-01-20 02:39:51 +0100
2014-01-20 01:39:51
False
getAttribute
Computer
Fantasy
object.propertyName
or object["propertyName"]
var person = {
name : "Donald Duck",
age: 35,
friends: ["Goofy","Micky"],
getBeloved: function() { return this.name + " and Daisy"; }
};
//access via
person.age
person.friends[1]
person.getBeloved()
1
A
20 Jan 2014 02:39:51
2014-01-20 02:39:51 +0100
2014-01-20 01:39:51
False
{
"timezone": {
"offset": "1",
"suffix": "A",
"localtime": "20 Jan 2014 02:39:51",
"isotime": "2014-01-20 02:39:51 +0100",
"utctime": "2014-01-20 01:39:51",
"dst": "False"
}
}
ajax.responseXML
, XML DOM methods to traverse itajax.responseText
, JSON.parse
(global browser function) returns a JavaScript objectJSON.stringify


tmsu
Simple command-line tool for tagging files.
More information: home page
- Tag a specific file with multiple tags:
tmsu tag path/to/file.mp3 music big-jazz mp3
- Tag multiple files:
tmsu tag --tags "music mp3" *.mp3
- List tags of specified file(s):
tmsu tags *.mp3
- List files with specified tag(s):
tmsu files big-jazz music
- List files with tags matching boolean expression:
tmsu files "(year >= 1990 and year <= 2000) and grunge"
- Mount tmsu virtual filesystem to an existing directory:
tmsu mount path/to/directory


Modern Editor
This is an event-based rich text editor for the modern web. It has html5 compliance and some sparks of ES6 to make developing new features a joy.
Start editing me to try me...
// Some code var a = 'b';
- Blabla
- Blabla
This is an event-based rich text editor for the modern web. It has html5 compliance and some sparks of ES6 to make developing new features a joy.
Start editing me to try me...
// Some code var a = 'b';


Id: 8
Name: Adjudicator Rick
Status: Dead
Species: Human
Type:
Gender: Male
OriginName: unknown
OriginUrl:
LocationName: Citadel of Ricks
LocationUrl: https://rickandmortyapi.com/api/location/3
Image: https://rickandmortyapi.com/api/character/avatar/8.jpeg
Episode: ['https://rickandmortyapi.com/api/episode/28']
Url: https://rickandmortyapi.com/api/character/8
Created: 2017-11-04T20:03:34.737Z


On April 23rd, the Ku Klux Klan and white nationalists are holding a white power march on Stone Mountain.
This mobilisation against white supremacy coalesced around a shared set of principles, which we intend to embody in our organising and on April 23. We strongly recommend you read them before attending the demonstration.
Stone mountain is a deeply historical location in the South. Long before its adoption as a monument to the confederacy it was of ceremonial importance to the Creek Nation. Since the beginning of the twentieth century it has become a focal point for white supremacist activity.
april23organizingcommittee
@riseup.net
To receive text updates on the day add @AllOutATL on Celly
or text @AllOutATL to 23559
There will be a convergence space in Atlanta from April 20th - 23rd. We encourage everyone to spend time there in the days leading up to the Stone Mountain action. There will be space to camp and food will be provided.
We will be hosting workshops, discussions and events to prepare for the action. If you have a presentation, discussion, performance, or anything else you'd like to contribute to the convergence space, you're welcome to!
Apart from events, the space is open all day for people to make banners and protest art, make plans, and just hang out and meet people. Making connections and learning from each other will make us stronger at Stone Mountain, and also help build a movement that goes beyond April 23rd.
Volunteers are needed to help staff the space. If you're available to help, please get in touch.
No Man's Land
880 Woodrow St Sw
Atlanta, GA 30310
Contribute to the legal fund, to ensure that we can support anyone who may get arrested while standing against the Klan.
Donate Via Credit Card
Donate Via Bitcoin:
1A4z7gXTuv5nNhCHBDNWh1kPi4uENmoiK6
• Print and distribute these materials: Poster 1 | Poster 2 | Poster 3 | B/W Flyer | Color Flyer
• Email us to feature your organisation on this page.
The following groups endorse the All Out ATL mobilization:
Atlanta Antifascist Notes
Atlanta Industrial Workers of the World
Atlanta Ultras
Black Matters
Black Rose North Georgia
Bombs Away Collective (Athens)
Charlotte Showing Up for Racial Justice (NC)
Feminist Outlawz
Food Not Bombs Atlanta
High Roller Records (AL)
International Anti-Fascist Defence Fund
Kentucky Workers League
Morgantown Ultra Left Collective (WV)
Music Maker Relief Foundation
Panhandle Progressive Coalition (FL)
Rose City Antifa (OR)
Savannah Comrades
Street Groomers (Atlanta)
White Rose Society (National)
Please get in contact if your organization agrees with our principles and would like to be added as an endorser.


A-Plan
Log In
Sign Up
About Us
Course Catalogue
My Page
Preference
Please fill out the form below in order to make your ideal schedule.
Select Your Major
Computer Science
Business Technology Management
Computer Engineering
Biomolecular Science
Chemical&Biological Engineering
Civil Engineering
Culture, Arts, and Media
Electrical Engineering
Integrated Digital Media
Mathematics
Mechanical Engineering
Physics
Science and Technology
Society, Environment&Globalization
Urban Studies
Select Academic Term
Spring 2020
Summer 2020
Fall 2020
Submit


shakespeare-quote-about-life-new-truism-pinterest-william-shakespeare-inspirational-quotes-william-shakespeare-inspirational-quotes
Watch Seasonal Movie and downloead them to you phone or computer with a single click.
Collapse content.


MulensModel.caustics module¶
-
class
MulensModel.caustics.
Caustics
(q, s)¶ Bases:
object
Class for the caustic structure corresponding to a given (q, s), i.e. mass ratio and separation. Implemented for 2-body lenses only.
- Attributes :
- q: float
mass ratio between the 2 bodies; always <= 1
- s: float
separation between the 2 bodies (as a fraction of the Einstein ring)
-
plot
(n_points=5000, **kwargs)¶ Plots the caustics using
matplotlib.pyplot.scatter()
.- Parameters :
- n_points: int, optional
The number of points to calculate along the caustic. Defaults to 5000.
**kwargs
:keywords accepted by
matplotlib.pyplot.scatter()
Note that default scaling of axis may not be equal on both axis. To mitigate this, use:
plt.gca().set_aspect('equal')
orplt.axis('equal')
(the other possible options are'scaled'
or'square'
).
-
get_caustics
(n_points=5000)¶ Returns x and y vectors corresponding to the outlines of the caustics. Origin is center of mass and larger mass is on the left (for q < 1).
- Parameters:
- n_pointsint, optional
The number of points to calculate along the caustic.
- Returns:
- x, ylist
Two lists of length n_points giving the x, y coordinates of the caustic points.
-
property
critical_curve
¶ Critical curve stored as
CriticalCurve
object, read-only


Used to split Daikon trace files (.dtrace) into a separate declaration files and the remaining data files.
License: BSD3
Authors: Wishnu Prasetya. The development is part of the EU-funded FITTEST project.
Copyright (C) Utrecht University, 2010.
dtrsplit [file]+This split the given Daikon trace files (.dtrace) into a separate declaration files and the remaining data files. For each f.dtrace input file, its program points declration part is separated into a new file f.decls. The file f.dtrace itself will now contain only the log data of the original program points.


Dear Study Researchers,
{% if action == 'previewed' %} {{ study_name }} is available for preview. This study can be previewed here. {% elif action == 'deployed' %} Dependencies have been built for {{ study_name }}. When this study is approved and activated, participants will be able to access it here. {% endif %}


NIMS Experiments
Experiments
View Experiment access privileges by selecting an Experiment.
View User access privileges by selecting a User.
Assign access privileges by dragging Users to Experiments or vice versa.
${name}
Access Level
${name}
Access Level


Home
Price Product Update
Sales
Select report to generate
Total dollar sales by products
Sales quantities by product categories


SceneJS
- canvas texture - simulation
Using a DOM canvas as a texture allows you to
programatically control the contents of the texture.


Read paywalled research papers for free.
Click the green tab and skip the paywall.
It's fast, free, and legal, powered by
our database of millions of author-uploaded PDFs.
Add Unpaywall to Chrome
Add Unpaywall to Firefox
on the Firefox web store
Send myself a reminder