XLOAD(1) XLOAD(1) NAME xload - system load average display for X SYNOPSIS xload [-toolkitoption ...] [-scale integer] [-update seconds] [-hl color] [-highlight color] [-remote host] [-jumpscroll pixels] [-label string] [-nolabel] [-lights] DESCRIPTION The xload program displays a periodically updating histogram of the sys‐ tem load average. OPTIONS Xload accepts all of the standard X Toolkit command line options (see X(7)). The order of the options is unimportant. xload also accepts the following additional options: -hl color or -highlight color This option specifies the color of the scale lines. -jumpscroll number of pixels The number of pixels to shift the graph to the left when the graph reaches the right edge of the window. The default value is 1/2 the width of the current window. Smooth scrolling can be achieved by setting it to 1. -label string The string to put into the label above the load average. -nolabel If this command line option is specified then no label will be displayed above the load graph. -lights When specified, this option causes xload to display the current load average by using the keyboard leds; for a load average of n, xload lights the first n keyboard leds. This option turns off the usual screen display. -scale integer This option specifies the minimum number of tick marks in the histogram, where one division represents one load average point. If the load goes above this number, xload will create more divi‐ sions, but it will never use fewer than this number. The default is 1. -update seconds This option specifies the interval in seconds at which xload updates its display. The minimum amount of time allowed between updates is 1 second. The default is 10. -remote host This option tells xload to display the load of host instead of localhost. Xload gets the information from the rwhod database and consequently requires rwhod to be executing both on localhost and host. RESOURCES In addition to the resources available to each of the widgets used by xload there is one resource defined by the application itself. showLabel (class Boolean) If False then no label will be displayed. WIDGETS In order to specify resources, it is useful to know the hierarchy of the widgets which compose xload. In the notation below, indentation indi‐ cates hierarchical structure. The widget class name is given first, fol‐ lowed by the widget instance name. XLoad xload Paned paned Label label StripChart load ENVIRONMENT DISPLAY to get the default host and display number. XENVIRONMENT to get the name of a resource file that overrides the global resources stored in the RESOURCE_MANAGER property. FILES /etc/X11/app-defaults/XLoad specifies required resources SEE ALSO X(7), xrdb(1), mem(4), Athena StripChart Widget. BUGS On older platforms, this program may require the ability to open and read the special system file /dev/kmem. Sites that do not allow general access to this file may need to make xload belong to the same group as /dev/kmem and turn on the set group id permission flag.  Therefore, the rou‐ tine used to read it (get_load.c) must be ported to each new operating system. COPYRIGHT Copyright © X Consortium See X(7) for a full statement of rights and permissions. AUTHORS K. Shane Hartman (MIT-LCS) and Stuart A. Malone (MIT-LCS); with features added by Jim Gettys (MIT-Athena), Bob Scheifler (MIT-LCS), Tony Della Fera (MIT-Athena), and Chris Peterson (MIT-LCS). X Version 11 xload 1.1.1 XLOAD(1)


REPORTS
Sign up and check your kidney's Health
LEARNING
Our System is continuously learning
RESEARCH
We are working hard to connect to doctors to give best services.
DASHBOARD
Manage all your Medical health reports in one place.
{% load staticfiles %}
{% load staticfiles %} {% if logged == 0%} {%endif%} {% if exist == 1%} {%elif exist == 0%} {%endif%} {% if notlogged == 1%} {%endif%}


Chapter 2 Counting Aligned Reads in Genomic Regions
2.1 About this chapter
- Questions
- How do I calculate counts of reads at genes from my alignments?
- Objectives
- Understand the basis for the gene region and read counting technique
- Understand what the count matrix represents
- Use the
make_counts()
function to make a count matrix
- Keypoints
- Gene regions are designated by coordinates in GFF files
- A count matrix is a table-like object of reads that are found in a given genomic region
- The count matrix is the main object in a DESeq analysis
In this chapter we’ll look at the fundamentals of read counting from a BAM file of aligned reads.
2.2 Counting the number of reads that have aligned to gene regions
The basis of quantitative RNAseq is working out how many of our sequence reads have aligned to each gene. In broad terms this is done by taking the genomic coordinates of all the aligned reads (the start and end positions of the read’s alignment on the reference genome) and cross-referencing them with the positions of the genes from a gene file. The resulting table is called a count matrix. See the figure below for a representation.
It is our aim in this section to create a count matrix from BAM files.
2.2.1 atacR
atacR
was initially designed to help with the analysis of ATAC-Cap-seq data, a quite differen sort of data to RNAseq, but as with many bioinformatics pipelines, the first steps are quite common so we can make use of the neat way atacR
handles the count matrix creation in the helpful function make_counts()
2.3 Preparing the input
We needs three things to work: the BAM files, a GFF file and a file of sample information.
2.3.1 The GFF file
GFF files are one way among many of describing the positions of genes on a genome. Here’s a quick look at one.
chr123 . gene 1300 1500 . + . ID=gene1
chr123 . gene 1050 1500 . + . ID=gene2
As you can see, it’s a simple file with a gene represented on each line, by its chromosome (chr123
), its start and end and its strand. The best thing about GFF files is that usually we can just download them from the relevant genome website. They tend to be freely available.
2.3.2 The Sample Information file
This file is a really simple file that references the BAM file of the alignment with the sample and replicate information. It has three columns: sample_name
, bam_file_path
and treatment
.
Here is an example.
## Parsed with column specification:
## cols(
## treatment = col_character(),
## sample_name = col_character(),
## bam_file_path = col_character()
## )
| treatment | sample_name | bam_file_path |
|---|---|---|
| control | control_rep1 | sample_data/control1/alignedSorted.bam |
| control | control_rep2 | sample_data/control2/alignedSorted.bam |
| control | control_rep3 | sample_data/control3/alignedSorted.bam |
| treatment | treatment_rep1 | sample_data/treatment1/alignedSorted.bam |
| treatment | treatment_rep2 | sample_data/treatment2/alignedSorted.bam |
| treatment | treatment_rep3 | sample_data/treatment3/alignedSorted.bam |
The sample_name
column describes the treatment and replicate performed, the bam_file_path
describes the place in which the BAM file for that sample is saved and treatment
is the general name for the treatment that was used; this column is usually not unique when you have replicates.
2.3.3 The BAM files
The BAM files all come from a previously done alignment. The sample information file describes the place where they are kept and the sample they represent.
2.3.4 Sample files for this chapter
All the files are provided for you in the sample data you downloaded as 50_genes.gff
and sample_information.csv
and in the folders containing BAM files. Feel free to examine them and look at how they relate to each other.
Once we have these files prepared, we can go on to use the atacR
package to make the count matrix.
2.4 Running make_counts()
First we must load in atacR
. Type the following into the R console.
Now we can do the counting with make_counts()
. Here’s how to do it. Remember to properly describe the path to the files. The paths given here are correct if the files are in a folder called sample_data
in the current working directory.
count_information <- make_counts("sample_data/50_genes.gff",
"sample_data/sample_information.csv",
is_rnaseq = TRUE
)
The function should run and give no output. Note that it is important to set is_rnaseq
to TRUE
to tell the function to count appropriately. The results are saved in the count_information
object.
2.5 Summaries and Diagnostic plots
With the counts computed we can do some diagnosis on the quality of the experiment.
We can see summary information with the summary()
function
## ATAC-seq experiment of 2 treatments in 6 samples
## Treatments: control,treatment
## Samples: control_rep1,control_rep2,control_rep3,treatment_rep1,treatment_rep2,treatment_rep3
## Bait regions used: 50
## Total Windows: 99
##
## On/Off target read counts:
## sample off_target on_target percent_on_target
## 1 control_rep1 0 57733 100
## 2 control_rep2 0 66155 100
## 3 control_rep3 0 66122 100
## 4 treatment_rep1 0 100547 100
## 5 treatment_rep2 0 120325 100
## 6 treatment_rep3 0 107611 100
## Quantiles:
## $bait_windows
## control_rep1 control_rep2 control_rep3 treatment_rep1 treatment_rep2
## 1% 149.48 294.60 241.12 228.70 102.98
## 5% 386.35 437.75 340.50 328.30 193.90
## 95% 2335.20 2438.20 2927.10 4445.90 6940.20
## 99% 3054.18 2752.19 3291.34 5234.33 9423.95
## treatment_rep3
## 1% 116.50
## 5% 324.00
## 95% 4438.75
## 99% 6948.15
##
## $non_bait_windows
## control_rep1 control_rep2 control_rep3 treatment_rep1 treatment_rep2
## 1% 0 0 0 0 0
## 5% 0 0 0 0 0
## 95% 0 0 0 0 0
## 99% 0 0 0 0 0
## treatment_rep3
## 1% 0
## 5% 0
## 95% 0
## 99% 0
##
## Read depths:
## sample off_target on_target
## 1 control_rep1 0 1154.66
## 2 control_rep2 0 1323.10
## 3 control_rep3 0 1322.44
## 4 treatment_rep1 0 2010.94
## 5 treatment_rep2 0 2406.50
## 6 treatment_rep3 0 2152.22
It is long, but actually quite helpful. The first thing to note is that the words relate to ATAC-Cap-Seq, but in our context ‘bait regions’ just mean gene regions and non-bait just means intergenic regions. The ‘on_targets’ are read hits to genes, the ‘off_targets’ are read hits to intergenic regions.
We can see that all the reads have hit in gene regions; that the read depth distribution of genes from the quantiles section give depths in the 1000 - 2000 range. This sort of summary is helpful when you’re trying to work out whether the RNAseq is useful, lots of reads ‘off target’ is bad, as is low depth.
2.5.1 Gene Count Plots
We can see the distribution of depths over genes as a plot using the plot_counts()
function
## Picking joint bandwidth of 488
We can see that the mean count per gene (windows in atacR
) is about 1000. The distributions in the treatment are bit more skewed than the controls.
2.5.2 Comparing Samples with PCA
It is common to examine the similarity of the samples to each other before moving on with analysis, ideally the similar samples will cluster together.
With atacR
it is easy to perform a quick PCA analysis.
Here we can see that the control samples all cluster together, but the treatment samples are a bit more variable. We might want to normalise these counts later as a consequence.
2.6 Extracting and saving the count matrix
We now want to extract out the actual counts hiding inside the count_information
object, we can do this with the assay()
extractor function from the Summarized Experiment
package.
## control_rep1 control_rep2 control_rep3
## Chr1:245989-249141 670 784 548
## Chr2:2195797-2200134 1104 1266 976
## Chr3:2454387-2458244 703 922 198
## Chr4:6650421-6657260 1865 1654 3207
## Chr5:11798344-11805414 1482 1266 1646
## Chr1:12893748-12901885 1186 1416 1458
## treatment_rep1 treatment_rep2 treatment_rep3
## Chr1:245989-249141 1784 2558 368
## Chr2:2195797-2200134 358 1186 4436
## Chr3:2454387-2458244 1373 1167 1726
## Chr4:6650421-6657260 3533 703 2427
## Chr5:11798344-11805414 1258 1690 1864
## Chr1:12893748-12901885<PHONE_NUMBER>
We can see the counts for each gene in each sample. Because atacR
works on windows, the gene coordinates are given. We can replace the coordinates with gene names if we wish as follows
## Parsed with column specification:
## cols(
## X1 = col_character()
## )
## control_rep1 control_rep2 control_rep3 treatment_rep1
## AT1G01680 670<PHONE_NUMBER>
## AT1G07160 1104 1266 976 358
## AT1G07920 703<PHONE_NUMBER>
## AT1G19250 1865 1654 3207 3533
## AT1G32640 1482 1266 1646 1258
## AT1G35210 1186 1416 1458 834
## treatment_rep2 treatment_rep3
## AT1G01680 2558 368
## AT1G07160 1186 4436
## AT1G07920 1167 1726
## AT1G19250 703 2427
## AT1G32640 1690 1864
## AT1G35210 594 2684
In this code chunk we load in the gene names from a file gene_names.txt
using the readr
package. Then we use the rownames()
function to set the row names of raw_counts
. This is a little cumbersome.  If you ever get stuck feel free to come and chat to us in the bioinformatics team.
Now we can save the matrix to a file for re-use and importing into other programs. We’ll do it in two ways 1) to a native R binary file that we can load straight in, 2) to a CSV file we can examine in programs including Excel.
2.6.1 Saving to an R RDS file
To save as a native R object, use saveRDS()
, passing the filename you wish to save to.
To save as a csv file use write.table()
, again passing the filename you wish to save to.
Now we can move on to using DESeq
.


To create a bot, you'll need to get the certificate chain and the certificate private key, in PEM format, for your bot user. See your System Administrator to request this data.


Glip
{% if taken %} Here you are! Be careful, these datas has already been destroyed. {% else %} This URL is empty! Paste your datas in the textarea and save your unique URL. {% endif %}
Glip
{% if taken %} Here you are! Be careful, these datas has already been destroyed. {% else %} This URL is empty! Paste your datas in the textarea and save your unique URL. {% endif %}


FISHER
MAN
🎣
Home🏡
(current)
Logout 👮♂
Welcome
👨💻
Social Links 🔗
🐱💻
Social Icon
Social Name
Link
1
Instagram
Copy
2
Facebook
Copy
Password Database 😎
🐱💻
Social
Username
Password
Loading...


| HYTOOL Function Reference |
Hantush and Jacob (1955) solution
s = htj_dim( p, t) p(1) = a p(2) = t0 p(3) = r/B t = time
Confined aquifer with leakage
s=htj_dim(p,t);
htj_dmo, htj_rpt, htj_gss Published output in the Help browser showdemo htj_dim
| Hytool |
© 1998-2017 Philppe Renard and Co. Terms of Use Acknowledgments


Drafty Slony-I SitePlease note that this site is presently under heavy construction . It will soon be able to be actively used for Slony-I CVS, downloads, and mailing lists; it's not quite ready yet, so for now, you likely still want to look to the gBorg Slony-I project for the time being. There will be announcements on the gBorg-based mailing lists indicating the migration when all is ready... Slony-ISlony-I is a "master to multiple slaves" replication system with cascading and failover. The big picture for the development of Slony-I is a master-slave system that includes all features and capabilities needed to replicate large databases to a reasonably limited number of slave systems. Slony-I is a system for data centers and backup sites, where the normal mode of operation is that all nodes are available. A fairly extensive "admin guide" comprising material in the CVS tree may be found here There is also a local copy here The original design document is available here. Slony-I 1.2.6At long last, here is version 1.2.6. It has many enhancements as listed in the Release Notes . This has been run thru the Release Checklist There are two tarballs available here Slony-I and PostgreSQL 8.1There is a known incompatibility of versions earlier than 1.1.5 with version 8.1; you can expect to see the following error message when compiling: slony1_funcs.c:1081: error: too many arguments to function `Async_Unlisten' A patch for both version 1.1 "STABLE" and CVS HEAD has been committed to CVS; look at both CVS HEAD as well as REL_1_1_STABLE. It is in the 1.1.5 release candidate described above. Upgrading Slony-IBeginning with version 1.0.5 the slon replication engine refuses to work against any database that does not have the stored procedures for the same version loaded or where the shared object containing the C language support functions and the log trigger does not match the version number. This means that the Slony installation on all nodes in a cluster must be upgraded at once. The proper upgrade procedure is this:
Christopher Browne Last modified: Thu Jan 25 12:01:53 EST 2007 |


Open to current NYU Abu Dhabi Students only
Each photo must include a short caption
Each photo must also be at least 10 Megabytes in size, therefore it must be taken on a digital camera
Submission will be judged anonymously by a panel of NYUAD Visual Arts faculty, local professional photographers, NYUAD Student Life stakeholders, and View Board members.
Launch: Nov 14 -- Submission Form Opens & Website Live
Deadline: Dec 15 -- Submissions Form & Website Close
Winners Announced: Jan 10 -- Will be contacted by Email
First Place : 500 AED
Second Place : 300 AED
Third Place : 100 AED
Honorable Mention : 50 AED
Winners photos will be used around campus by Student Life and View
You may submit up to 5 photos. By submitting your photos, you are giving Student Life and View full creative and printing license
SubmitFeel free to reach out to us about anything: competition, collaboration, questions, etc.


Add New Game
Delete Game Name: {{gameName}} Game URL: {{gameUrl}}
Delete isAdmin? {{#if useradmincheck}}Yes{{else}}No{{/if}} Toggle Admin User Name: {{username}} User Email: {{emails.[0].address}}


POL60700: Democratic Innovations in the Digital Age
Seminar 5
München/Zoom, 11. May 2021
Nikolai Gad
Practical
Overview of course:
- Introduction to democratic innovations.
- Introduction
- What are democratic innovations?
- Democratic theory
- Different types of democratic innovations.
- Mini-publics
- Participatory Budgetting
- Referendums and citizen's initiatives
- Digital technologies and democratic innovaitons.
- Digital possibilities and democratic innovations
- Digital challenges and democratic innovations
- Implementing democratic innovations
- Implications of democratic innovations.
- Impact of democratic innovations
- Critiques and arguments against democratic innovations
- Presentations of paper topics.
Participatory Budgeting
What distinguishes PB from mini-publics?
|
Participatory Budgeting |
Mini-publics |
| Characteristics: |
|
|
| Underpinning democratic theory: |
|
|
Group work
Quesiton for discussion:
- Do you think it is a good idea to let citizens decide on public budgets?
- What do you think should characterise "good" Participatory Budgeting?
Main take-aways from this week


Write any name, formula or identifier in the URL separated by "/" Example: jmol.html#ch3cl/dichloromethane/chcl3
Other tools by the same author you may want to check:


Changelog¶
0.1.0 (2021-01-21)¶
Update OpenDSS version to: OpenDSS Version <IP_ADDRESS>; License Status: Open
0.0.9 (2021-01-21)¶
text method returns string values (Jouni request)
OpenDSS exe 64bits included
0.0.8 (2020-12-10)¶
Allowing run multiple instances of DDLL without problems with memory - Gustavo asked it
Allowing run multiple OpenDSS’ DLLs
Update OpenDSS version to: OpenDSS Version <IP_ADDRESS> (64-bit build); License Status: Open
0.0.7 (2020-10-22)¶
PVsystems updated.
Update OpenDSS version to: OpenDSS Version <IP_ADDRESS> (64-bit build); License Status: Open.
Allowing to write values into Variant methods.
0.0.4 (2020-08-17)¶
DSSDLL class can receive OpenDSS folder in order to use the user own OpenDSS.
0.0.1 (2020-06-12)¶
Integrating CI.
0.0.0 (2020-06-12)¶
First release on PyPI.


Have a question?
Call +120 558 7885
All Categories
Shirts
Coats & Jackets
Underwear
Sunglasses
Socks
Belts
Bresses
T-shirts
Skirts
Jeans
Pullover
Kids
Fashion
Shoes
Bags
Pants
Swimwear
Bicycles
Bags
Shoes
HoseHolds
TV
Camera
Speakers
Mobile
PC
32
2
Toggle navigation
Home
Shop
Products Grid View
Products
Sidebar Left
Products Left
Products List View
Sidebar Left
Products Left
Products Sidebar
Checkout
Step 1
Step 2
Step 3
Sumit Kumar
Page
About Us
Register
Register or Login
Login
Password Recovery
Privacy Policy
Terms & Conditions
404 Not Found
Short Code
Coming Soon
Blog
My List


Here you can find friends or talk o strangers.
The Doge Social Network does not take any responsibility for the information found


--- layout: index-layout subject: The TV you deserve is finally here --- {{> header}} {{> hero}} {{> main}} {{> footer}}


Welcome to the North Birmingham Trollslayers. A gaming club based in Birmingham.
We love playing Stratergy and Fantasy games in cluding Warhammer, Kings of War and Flames of War.
We have a diverse group ranging from 16 to 60, all meeting weekly to game, paint, chat and have fun.
The club ruling council are all senior members and have between them nearly 175 years of gaming experience....To be honest most of those are down to Specs!!!!!!!


"Utilities"
CocoaPad has some handy little features that can capitalize your text, or convert your document to RTF format (see All about file formats). Here's a rundown of these miscellaneous tools:
These are all found in the Format menu.
If these sound an awful lot like "Tools" in other programs, then you're right. Utilities are really Tools, except we like to call them "Utilities". |
All utilties can be undone, unless specified otherwise. |


Welfare and Charitable Trust is a charitable, social and educational institution that, in the direct supervision of scholars, is making all possible efforts to reach the disadvantaged and marginalised sections, know their circumstances, assist them according to their circumstances, generate and highlight self-esteem and self-reliance in them and kindle the flame of uniformity, love and affection in the masses. Year of Establishment : 2019 Officials: President : General Secretary : Secretary : Treasurer : Vice President : Need for Establishment and Objectives (1) The teachings of Islam that are related to humanity, love, sacrifice and service regardless of religion and the cherished teachings that the Blessed Prophet (SAW) gave to the entire humanity through his deeds and through the Madani Society created based on these attributes and the efforts of Companions and great scholars of every period to practically implement these teachings- execute these in the context of the present circumstances under the supervision of scholars, so that the progress and welfare of humanity could be ascertained and these services could develop into a practical response to those who deliberately or out of ignorance, are constantly engaged in associating Islam and Islamic teachings with terrorism or its encouragement. (2) A growing disconnect between the rich and the poor has been observed in this era of rapid development; the well-off people, instead of reaching the actual deserving people are trying to evaluate the level of poverty of the community through a few fraudsters (most of whom are not deserving) who approach them, whose circumstances are dissimilar to actual and ground realities, due to which most of the deserving people, due to their poverty or due to non-availability of the means to reach the well-off, are found to be drifting towards despair and frustration for the education of their children and economic support and treatment and care of their dependents and at times, due to lack of adequate resources, lose their lives. Hence, it is the objective of Safa Baitul Maal to assess in depth the slums and deserving people and instead of waiting for the deserving to approach, reach them in person and know their problems and with assistance from well-off people, strive to provide various resources to solve their issues so that the marginalised sections move forward on the track of development.


CrimPapers
Articles published on 1 September 2020
On 1 September 2020, 6 new articles were published in 6 journals.
How Is Criminal Justice Related to the Rest of Justice? by Jonathan Jacobs
Disordered Eating Attitudes and Behaviors in Maltreated Children and Adolescents Receiving Forensic Assessment in A Child Advocacy Center by Timothy D. Brewerton, M. Elizabeth Ralston, Michelle Dean, Sarah Hand, Lisa Hand
Understanding Offending Across the Life-Course: Current Theories and Conceptions
Explaining the Predictive Relationship Between Early Life Trauma and Comorbid Psychiatric Symptoms Among Convicts in Pakistan
Familial Pains of Imprisonment: the Experience of Parents and Siblings of Incarcerated Men by Moran Benisty, Moshe Bensimon, Natti Ronel
Moving Toward A New Model of Sexual Consent: the Development of the Process-Based Consent Scale by Alyssa M. Glace, Judith G. Zatkin, Keith L. Kaufman


--- head_title: My Page Title article_title: Big Title of the Article article_subtitle: Subtitle rendered as an article summary layout: default page_root_url: . ---


Methods
deleteTopology(topologyId)
Delete topology specified by topologyId
Parameters:
| Name | Type | Description |
|---|---|---|
topologyId |
String |
Throws:
-
If topology doesn't exist
- Type
- Error
getDevicesWithNode(topologyId, netlistNodeId) → {Array.<Object>}
Get devices of the topology specified by topologyId that are connected to given netlist node
Parameters:
| Name | Type | Description |
|---|---|---|
topologyId |
String | |
netlistNodeId |
String |
Throws:
-
If topology doesn't exist
- Type
- Error
Returns:
Array of objects representing required devices in the topology
- Type
- Array.<Object>
queryDevices(topologyId) → {Array.<Object>}
Get devices of the topology specified by topologyId
Parameters:
| Name | Type | Description |
|---|---|---|
topologyId |
String |
Throws:
-
If topology doesn't exist
- Type
- Error
Returns:
Array of objects representing devices in the topology
- Type
- Array.<Object>
queryTopologies() → {Array.<Topology>}
Get topologies are currently in memory
Returns:
Array of topologies that are currently in memory
- Type
- Array.<Topology>
readJSON(fileName)
Read a topology from given json file
Parameters:
| Name | Type | Description |
|---|---|---|
fileName |
String |
Throws:
-
If encountered problems while reading the file
- Type
- Error
writeJSON(topologyId)
Write topology specified by topologyId to json file
Parameters:
| Name | Type | Description |
|---|---|---|
topologyId |
String |
Throws:
-
If topology doesn't exist or encountered probelms while writing the file
- Type
- Error


Activating this page will connect to the public my binder service at
https://mybinder.org
, launch a server and connect to a `python3` kernel.
import numpy as np import matplotlib.pyplot as plt %matplotlib inline fig, ax = plt.subplots() ax.scatter(*np.random.randn(2, 100), c=np.random.randn(100)) ax.set(title="Wow, a pyhton plot on my webpage!")


ESP32forth-{{STABLE_VERSION}}.zip
- Single .ino file ready for installation
Version: {{STABLE_VERSION}}
ESP32forth-{{VERSION}}.zip
- Single .ino file ready for installation
Version: {{VERSION}}
Release Archive - Prior Releases
http://github.com/flagxor/eforth - Complete Unprocessed Source Code (under ueforth/)
NOTE: Although Esp32forth is licensed under Apache 2.0,
please be aware that binaries built with the Arduino IDE (such as ESP32forth) include
components and libraries under
other additional licenses.
The ESP32 plugin for Arduino is also under a
different license.
Additionally, the ESP32 toolchain used by Arduino, contains further components under
other licenses.
Be sure to consult a lawyer before using for comercial purposes.
Copyright 2021 Bradley D. Nelson Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.
Download the Arduino IDE for your platform.
Go to File > Preferences.
Under Additional Board Manager URLs enter: https://dl.espressif.com/dl/package_esp32_index.json
Choose these options under Tools.
Initially ESP32forth can be interacted with over a serial port (over USB).
You can do this from the Arduino IDE's Serial Monitor option.
Be sure to config the serial port to: baud rate = 115200, data bits = 8, stop bits = 1, and parity = N
.
On boot, ESP32forth configures PIN 2 (typically an LED) to be an output and brings it HIGH (lighting the LED after boot).
Because Arduino builds a statically linked image for flashing into ESP32 devices, all C function bindings need to be explicitly added. This is the current collection. Typically to reduce confusion, function names have be preserved even through verbose. In popular cases a shorted higher level name is provided.
See template.ino.
internals
vocabulary.
MALLOC ( n -- a | 0 ) System malloc SYSFREE ( a -- ) System free REALLOC ( a n -- a | 0 ) System realloc
Serial
vocabulary.
Serial.begin ( baud -- ) Start serial port Serial.end ( -- ) End serial port Serial.available ( -- f ) Is serial data available Serial.readBytes ( a n -- n ) Read serial bytes, return number gotten Serial.write ( a n -- n ) Write serial bytes Serial.flush ( -- ) Flush serial buffer
bluetooth
vocabulary.
SerialBT.new ( -- bt ) Allocate new BT object SerialBT.delete ( bt -- ) Free BT object SerialBT.begin ( localname ismaster bt -- f ) SerialBT.end ( bt -- ) SerialBT.available ( bt -- f ) SerialBT.readBytes ( a n bt -- n ) SerialBT.write ( a n bt -- n ) SerialBT.flush ( bt -- ) SerialBT.hasClient ( bt -- f ) SerialBT.enableSSP ( bt -- ) SerialBT.setPin ( z bt -- f ) SerialBT.unpairDevice ( addr bt -- f ) SerialBT.connect ( remotename bt -- f ) SerialBT.connectAddr ( addr bt -- f ) SerialBT.disconnect ( bt -- f ) SerialBT.connected ( timeout bt -- f ) SerialBT.isReady ( checkMaster timeout -- f ) Default checkMaster=false, timeout=0
bluetooth
vocabulary.
esp_bt_dev_get_address ( -- a ) addr of 6 byte mac address
pinMode ( pin mode -- ) Set GPIO pin mode digitalWrite ( pin value -- ) Set GPIO pin state analogRead ( pin -- n ) Analog read from 0-4095 pulseIn ( pin value usec -- usec/0 ) Wait for a pulse dacWrite ( pin 0-255 -- ) Write to DAC (pin 25, 26)
ledc
vocabulary.
ledcSetup ( channel freq resolution -- freq ) ledcAttachPin ( pin channel -- ) ledcDetachPin ( pin -- ) ledcRead ( channel -- n ) ledcReadFreq ( channel -- freq ) Get frequency (x 1,000,000) ledcWrite ( channel duty -- ) ledcWriteTone ( channel freq ) Write tone frequency (x 1000) ledcWriteNote ( channel note octave -- freq )
pin ( value pin# -- ) Set GPIO pin value adc ( pin# -- n ) Analog read pin, result 0-1023
MS ( n -- ) Pause for some number of milliseconds. MS-TICKS ( -- n ) Time since start in milliseconds. TERMINATE ( n -- ) Call system exit.
R/O ( -- mode ) R/W ( -- mode ) W/O ( -- mode ) BIN ( mode -- mode ) CLOSE-FILE ( fh -- ior ) OPEN-FILE ( a n mode -- fh ior ) CREATE-FILE ( a n mode -- fh ior ) DELETE-FILE ( a n -- ior ) WRITE-FILE ( a n fh -- ior ) READ-FILE ( a n fh -- n ior ) FILE-POSITION ( fh -- n ior ) REPOSITION-FILE ( n fh -- ior ) FILE-SIZE ( fh -- n ior )
WiFi
vocabulary.
WiFi.config ( ip dns gateway subnet -- ) Packaged a.b.c.d little-endian Wifi.begin ( ssid-z password-z -- ) Wifi.disconnect ( -- ) WiFi.status ( -- n ) WiFi.macAddress ( a -- ) WiFi.localIP ( -- ip ) WiFi.mode ( mode -- ) WIFI_MODE_NULL WIFI_MODE_STA WIFI_MODE_AP WIFI_MODE_APSTA WiFi.setTxPower ( powerx4 -- ) Set power x4 WiFi.getTxPower ( -- powerx4 ) Get power x4
MDNS.begin ( name-z -- ) Start multicast dns
SPIFFS
vocabulary.
SPIFFS.begin ( format-on-fail path-z max-files -- f ) SPIFFS.end ( -- ) SPIFFS.format ( -- f ) SPIFFS.totalBytes ( -- n ) SPIFFS.usedBytes ( -- n )
WebServer
vocabulary.
WebServer.new ( port -- ws ) Allocate new webserver object WebServer.delete ( ws -- ) Delete webserver object WebServer.begin ( port ws -- ) WebServer.stop ( ws -- ) WebServer.on ( path-z xt ws -- ) Set up a web path handle callback WebServer.handleClient ( ws -- ) Handle one client request WebServer.hasArg ( z ws -- f ) By name WebServer.arg ( z ws -- z ) By name WebServer.argi ( n ws -- z ) By index WebServer.argName ( n ws -- z) By index WebServer.args ( ws -- n ) Number of args WebServer.setContentLength ( n ws -- ) WebServer.sendHeader ( name-z value-z fist ws -- ) WebServer.send ( code mimetype data ws -- ) WebServer.sendContent ( z ws -- ) WebServer.method ( ws -- n ) GET / POST etc.
Wire
vocabulary.
Wire.begin ( -- f ) Wire.setPins ( sda scl -- f ) Wire.setClock ( frequency -- ) Wire.getClock ( -- frequency ) Wire.setTimeout ( ms -- ) Default is 50ms Wire.getTimeout ( -- ms ) Wire.lastError ( -- n ) Wire.getErrorText ( n -- z ) Wire.beginTransmission ( n -- ) Wire.endTransmission ( sendstop -- f ) Default is true Wire.requestFrom ( address quantity sendstop -- n ) Wire.writeTransmission ( addr a n sendstop -- err ) Wire.readTransmission ( addr a n sendstop acount -- err ) Wire.write ( a n -- n ) Wire.available ( -- f ) Wire.read ( -- ch ) Wire.peek ( -- ch ) Wire.busy ( -- f ) Wire.flush ( -- )
camera
vocabulary.
esp_camera_init ( config -- f ) esp_camera_deinit ( -- f ) esp_camera_fb_get ( -- fb ) esp_camera_fb_return ( fb -- ) esp_camera_sensor_get ( -- sensor )
Requires v7.0.6+
WIP Prototype - Not yet stablecamera-server
vocabulary.
server ( port -- ) Start an image server at port, e.g. http://IP/image will produce an image
SD_MMC
vocabulary.
SD_MMC.begin ( mount mode1bit ) default mode1bit=false SD_MMC.end ( -- ) SD_MMC.cardType ( -- n ) SD_MMC.totalBytes ( -- n ) SD_MMC.usedBytes ( -- n )
INTERRUPTS
vocabulary.
High Level words:
pinchange ( xt pin -- ) Call xt when pin changes.
Example:
17 input pinMode : test ." pinvalue: " 17 digitalRead . cr ; ' test 17 pinchange
Low Level words:
ESP_INTR_FLAG_DEFAULT -- Default handler allows per pin routing Various triggers: #GPIO_INTR_DISABLE #GPIO_INTR_POSEDGE #GPIO_INTR_NEGEDGE #GPIO_INTR_ANYEDGE #GPIO_INTR_LOW_LEVEL #GPIO_INTR_HIGH_LEVEL gpio_config ( gpio_config_t* -- 0/err ) gpio_reset_pin ( pin -- 0/err ) gpio_set_intr_type ( pin type -- 0/err ) gpio_intr_enable ( pin -- 0/err ) gpio_intr_disable ( pin -- 0/err ) gpio_set_level ( pin level -- 0/err ) gpio_get_level ( pin -- level ) gpio_set_direction ( pin mode -- 0/err ) gpio_set_pull_mode ( pin mode -- 0/err ) gpio_wakeup_enable ( pin type -- 0/err ) gpio_wakeup_disable ( pin -- 0/err ) gpio_pullup_en ( pin -- 0/err ) gpio_pullup_dis ( pin -- 0/err ) gpio_pulldown_en ( pin -- 0/err ) gpio_pulldown_dis ( pin -- 0/err ) gpio_hold_en ( pin -- 0/err ) gpio_hold_dis ( pin -- 0/err ) gpio_deep_sleep_hold_en ( -- ) gpio_deep_sleep_hold_dis ( -- ) gpio_install_isr_service ( a -- ) Typically ESP_INTR_FLAG_DEFAULT gpio_uninstall_isr_service gpio_isr_handler_add ( pin xt arg -- 0/err ) gpio_isr_handler_remove ( pin -- 0/err ) gpio_set_drive_capability ( pin cap -- 0/err ) gpio_get_drive_capability ( pin cap* -- 0/err ) esp_intr_alloc ( source flags xt args handle* -- 0/err ) esp_intr_free ( handle -- 0/err ) timer_isr_register ( group timer xt arg ret -- 0/err )
TASKS
vocabulary.
PAUSE ( -- ) Yield to other tasks. MS ( n -- ) Pause for some number of milliseconds (yields to other tasks). TASK ( xt dsz rsz "name" -- ) Create a new task with dsz size data stack and rsz size return stack running xt. START-TASK ( task -- ) Activate a task. .TASKS ( -- ) List running tasks. Example: tasks : hi begin ." Time is: " ms-ticks . cr 1000 ms again ; ' hi 100 100 task my-counter my-counter start-task
TIMERS
vocabulary.
High Level words:
( timer t = 0-3 ) interval ( xt usec t -- ) Setup timer t to call xt each after usec rerun ( t -- ) Rerun timer t triggering Example: timers : hi ." hi" cr 0 rerun ; ' hi 1000000 0 interval ( run hi every second )
Medium Level words:
timer@ ( t -- lo hi ) timer! ( lo hi t -- ) alarm ( t -- a ) enable! ( f t -- ) Timer enable/disable increase! ( f t -- ) Timer increasing/decreasing divider! ( n t -- ) Timer divider 2 - 65535 edgeint! ( f t -- ) Edge trigger levelint! ( f t -- ) Level trigger alarm-enable! ( f t -- ) Alarm enable alarm-enable@ ( t -- f ) Alarm enabled? onalarm ( xt t -- ) Set callback
Low Level words:
( group n = 0/1, timer x = 0/1, watchdog m = 0-5 ) TIMGn_TxCONFIG_REG ( n x -- a ) TIMGn_TxLOHI_REG ( n x -- a ) TIMGn_TxUPDATE_REG ( n x -- a ) TIMGn_TxALARMLOHI_REG ( n x -- a ) TIMGn_TxLOADLOHI_REG ( n x -- a ) TIMGn_TxLOAD_REG ( n x -- a ) TIMGn_Tx_WDTCONFIGm_REG ( n m -- a ) TIMGn_Tx_WDTFEED_REG ( n -- a ) TIMGn_Tx_WDTWPROTECT_REG ( n -- a ) TIMGn_RTCCALICFG_REG ( n -- a ) TIMGn_RTCCALICFG1_REG ( n -- a ) TIMGn_Tx_INT_ENA_REG ( n -- a ) TIMGn_Tx_INT_RAW_REG ( n -- a ) TIMGn_Tx_INT_ST_REG ( n -- a ) TIMGn_Tx_INT_CLR_REG ( n -- a )
RTOS
vocabulary.
xPortGetCoreID ( -- n ) xTaskCreatePinnedToCore ( fn name stack-depth params priority taskout coreid -- ) vTaskDelete ( task ) -- )
A terminal over the web can be activated. Contact at port printed or via mDNS http://forth/.
webui ( network-z password-z -- ) login and start webui login ( network-z password-z -- ) login to wifi only
Usage:
z" NETWORK-NAME" z" PASSWORD" webui
See web_interface.fs.
NOTE: This section describes one mechanism for running code at startup. See this for an alternate option.
The system will automatically attempt to mount SPIFFS filesystem at /spiffs
.
It will then at start attempt to load /spiffs/autoexec.fs
One way this feature can be used to configure the Web UI to start by default. When doing this, be sure to test your Web UI settings work well first.
r| z" NETWORK-NAME" z" PASSWORD" webui | s" /spiffs/autoexec.fs" dump-file
To remove a previously configured autoexec.fs
you will need
to be able to reboot in a mode with Forth. One way to do this is to search
for the line in the .ino file that refers to autoexec.fs
and replace it with a different name. Then run the following:
s" /spiffs/autoexec.fs" delete-file
See autoboot.fs.
Words can be added based on C functions by placing a file named userwords.h
alongside the .ino file for ESP32forth.
(Requires v<IP_ADDRESS>+)
Before v<IP_ADDRESS>, user words required editing the .ino file.
Because of the use of X-Macros words can be
added in as little as one line. Locate the macro called PLATFORM_OPCODE_LIST
and add your words there.
NOTE: Be careful to end each line with a \ so the macros will chain correctly.
To add a word containing only letters, numbers, and underscore you can use Y
.
---- userwords.h ---- #define USER_WORDS \ Y(MY_WORD123, c_function_to_call()) \
If your word name contains other characters, instead use X
.
You will need to make up an alternate name for the middle parameter.
It must contain only letters, numbers, and underscore.
The name is not used anywhere else, but must be unique.
---- userwords.h ---- #define USER_WORDS \ X("myword!", MY_WORD_BANG, c_function_to_call()) \
Values from the data stack can be accessed via
the variables tos
(Top of Stack) and
sp
(Pointer to the rest of the stack).
The stack has the data type cell_t
.
You can push a value of any type to the stack with the macro PUSH
:
---- userwords.h ---- #define USER_WORDS \ Y(MY_WORD, PUSH calculate_magic_value()) \
To simplify calling C functions, you can also refer to elements on the stack with the types positional names:
n10 n9 n8 n7 n6 n5 n4 n3 n2 n1 n0 - Access stack as cell_t integer values c4 c3 c2 c1 c0 - Access stack as char* values b4 b3 b2 b1 b0 - Access stack as uint8_t* byte values a6 a5 a4 a3 a2 a1 a0 - Access stack as void* values Examples: ---- userwords.h ---- void send_message(const char *message, int code); ... #define USER_WORDS \ X("send-message", SEND_MESSAGE, send_message(c1, n0)) \
You can always replace the top item on the stack with SET
:
---- userwords.h ---- #define USER_WORDS \ Y(DECODE, SET decode_func(n0)) \
You can drop elements from the stack with DROP
or DROPn(number)
.
You can nip elements from below top of the stack with NIP
or NIPn(number)
.
Be aware that like PUSH
this will cause stack indices to change.
---- userwords.h ---- int my_cool_function(char *foo, int bar, uint8_t *baz); ... #define USER_WORDS \ Y(MY_FUNC, n0 = my_cool_function(c2, n1, b0); NIPn(2)) \
Multiple C statements can be included in the code area of a word, but care must be taken to generally avoid {}s. If you find you need nesting, a separate function is recommended.
New variables can be declared in each word and are scoped to that word.
---- userwords.h ---- #define USER_WORDS \ Y(MY_WORD, cell_t foo = n0; DROP; char *x = c0; DROP; \ PUSH my_func(foo, x)) \


Welcome to the Bristol South Skyline Walk
Start your journey of discovery
Select one of our walks below
☰
Skyline
×
Get my location


Welcome to Pyvolve’s documentation!¶
Pyvolve is a python library for simulating sequences along a phylogeny using continuous-time Markov models. Pyvolve is hosted on github: https://github.com/sjspielman/pyvolve. Pyvolve implements a variety of standard modeling frameworks:
- Nucleotide models (GTR and all nested variants)
- Empirical amino acid models (JTT, WAG, LG, AB, mtMAM, mtREV24, and DAYHOFF)
- Codon (dN/dS) models (GY94-style and MG94-style)
- The ECM empirical codon model
- Mutation-selection models (Halpern and Bruno, 1998), implemented for both nucleotides and codons
In particular, the Pyvolve framework allows you to heavily customize your model, both in terms of stationary frequency parameters and rate matrix elements. Further, you can specify your own rate matrix (and indeed the states to evolve) rather than relying on built-in models. A detailed user-manual for Pyvolve is available here.
Download and Installation¶
Pyvolve is freely available under a FreeBSD license. The easiest way to install Pyvolve is using pip or easy_install:
sudo pip install pyvolve
#or
sudo easy_install install pyvolve
Alternatively, the most recent release of Pyvolve is available for download from https://github.com/sjspielman/pyvolve/releases. Once Pyvolve has been downloaded, navigate to the directory in the terminal. To install for all users, enter this command:
sudo python setup.py install
Alternatively, to install locally for a specific user (or if you do not have root privileges), enter this command:
python setup.py install --user
Optional tests may be run with the command (which may or may not require sudo
, depending on your install choice),
python setup.py test
Dependencies¶
Pyvolve has several dependencies which must be installed:
Note that installing Pyvolve with pip and/or easy_install will give you these dependencies if they are missing.
Issues and Questions¶
Please file all bugs, issues, feature requests, and/or questions in the Issues section of Pyvolve’s github repository: https://github.com/sjspielman/pyvolve/issues. Note that you will need a github account to file.
Citation¶
If you use Pyvolve, please cite it as:
Spielman, SJ and Wilke, CO. 2015. Pyvolve: A flexible Python module for simulating sequences along phylogenies. PLOS ONE. 10(9): e0139047.


| order.group.mod | A modified version of order.group of agricolae package |
| PBIB.test.mod | A modified version of Analysis of the Partially Balanced Incomplete Block Design |
| pty | Pepa tells you |
| pty.aovmet | Pepa tells you about a MET with a RCBD |
| pty.elston | Pepa tells you about the Elston index |
| pty.pesekbaker | Pepa tells you about the Pesek-Baker index |
| pvsf1 | Voting for selection criteria |
| pvsf2 | Voting for best clones at flowering |
| pvsf3 | Voting for best clones at harvest |
| pvsf6 | Organoleptic scores at mother trial |
| pvsf7 | Organoleptic scores at baby trials |
| pvsf9 | Voting for best clones at post-harvest |
| pvssg | PVS summary global |
| repo.a01d | Automatic report for an alpha (0,1) design |
| repo.abd | Automatic report for an augmented block design (ABD) |
| repo.crd | Automatic report for a Completely Randomized Design (CRD) |
| repo.f | Automatic report for a factorial experiment |
| repo.lxt | Automatic report for a Line x Tester genetic design. |
| repo.met | Automatic report for a MET with a RCBD |
| repo.met.agro | Automatic report for a MET with a RCBD |
| repo.nc | Automatic report for a North Carolina genetic design. |
| repo.pvs | Report for PVS |
| repo.pvssg | Report for PVS - Global summary |
| repo.rcbd | Automatic report for a Randomized Complete Block Design (RCBD) |
| repo.spld | Automatic report for a split plot design |
| repo.strd | Automatic report for a strip plot design |
| repo.trend | Report for repeated measures data |
| trend.data | Repeated measures data |


@(pagename: String, user: models.users.User)(content: Html)
On the 15th of April 2019, we will be celebrating our first birthday and we would like to celebrate it with you guys! We will be located in Stephens Green Shopping Centre from 1pm - 5pm. See you all there.


This is the documentation for the ValDSL library.
Getting started.
Read the README »
Detailed documentation of all functions.
Read the docs »
Test coverage report..
Read the report »


Highlight: Mallory Braun
These mini sketckbooks are completely handmade with reused materials, making them each utterly unique and also sustainable.
Braun creates these handsewn booklets using leftover junk mail envelopes, wrapping paper, shopping bag tissue paper, threads, ribbons, and more. Her collaging technique puts leftover papers to great use, while giving someone a one of a kind little gem.
Contact
Etsy: MalloryBraun Sustainable Notebooks & Sketchbooks: Handmade, Upcycled
Instagram: @mallorybraun


Andrew R Smith
Andrew R Smith
About Me
Github
This is the personal website of Andrew R Smith, see links to my "About Me" and "Github" links above.


{% extends 'accounts/base.html' %}
{% load i18n staticfiles %}
{% block style %}{{ block.super }}
{% endblock %}
{% block title %}
{% trans 'Mail Address Ownership Accepted' %}
{% endblock %}
{% block main %}
A request to verify email address ownership is accepted,
and an email has been sent to the requested address.
Please click the URL in the email and verify your ownership.
{% endblock %}


--- layout: archive title: Zulip Chat Archive permalink: /stream/113488-general/topic/docstrings.20for.20lean.html ---
It's not completed yet, but I am incrementally adding documentation to undocumented parts of the lean source code. Would there be any interest in PRing this into the Lean 3 source eventually? Obviously someone would have to go over my changes and make sure that the comments are not wrong/ misleading etc. https://github.com/EdAyers/lean/tree/docstrings
I guess nobody is going to be accepting any PRs to Lean source code any time soon, and perhaps any time ever.
Yeah I don't want to spend a lot of time on it in case they release Lean 4.
I've been wondering whether the mathlib community should manage its own continuation of Lean 3.x in the meantime, because it seems like there are a number of low-impact improvements that would be worthwhile, and waiting for Lean 4 is a big unknown both in terms of schedule and how difficult porting will be, so otherwise mathlib's Lean could be stagnant for quite a while
The disadvantage with such a "fork" is that it would bring all sorts of social implications and management issues with it. Your aren't just forking code, you will also need to make a whole bunch of users aware of the fact that latest mathlib won't compile on their vanilla Lean 3.4.1, and so you need to think about whether you want to include pointers all over the place that there is now Lean'
or something.
I'm not in a position to see through all the ramifications and weigh the pros and cons.
I was initially pro-fork, and I think that since development has effectively stopped permanently on 3.x I think the problems associated with forking are greatly lessened. It will be a big change regardless when lean 4 comes around - Leo is essentially working on his own fork already
Well, I guess it doesn't hurt to list the pros and cons.
The first big pro would be liberating the core library.
I know that @Keeley Hoek and @Edward Ayers have their private forks. These probably contain some useful patches.
Another pro would be that we can proactively work on caching. Although this is of course very non-trivial.
I think elan could be a big help with dealing with a new version pretty transparently, even if it has to be downloaded from a different location than the official releases
One reason that I am so pro-actively trying to get mathematicians involved is that there is so so much more mathematics that can be done with Lean 3. I know some people are excitedly waiting for Lean 4 for CS reasons but I am quite happy with Lean 3.4.1.
@Kevin Buzzard Right. But would you be happier with Lean-prime 3.4.1?
One problem with forking is that we don't know whether any of the bug fixes or whatever will have appropriate analogues in Lean 4
If we were to make a fork, I think it shouldn't accept anything that will take substantial effort to reimplement in Lean 4. (That would be inviting people to waste their time.)
But fixing leanpkg
, adding docstrings to expr
and elsewhere, both sounds like great reasons.
If you're using elan
, it's completely trivial to specify that you want to use a forked version of lean
. (e.g. Keeley and I do this all the time)
I've just merged the two recent PRs to leanprover/lean and will release 3.4.2 when there are no more outstanding changes. If someone wants to implement tracking branches in leanpkg, I'll review and merge that, too.
Hi, @Keeley Hoek, have you already done this in your fork? (Allowing leanpkg
to track a specified branch of a repo.) I know we talked about this at some point, but can't remember if it's something you've already done.
@Scott Morrison, unfortunately for the life of me I've never really figured out what the problem with the branch tracking was. As far as I have been able to tell on my own computer, replacing a revision SHA1 with a branch name instead works, and leanpkg upgrade
fetches a new copy of that branch properly (instead of reverting back to the SHA1 at the top of master
, or lean-3.4.1
, or whatever).
I guess this is a bit crude though---was the problem that we wanted to be able to type specific SHA1s and have leanpkg upgrade
walk up that commit to the top of a branch or something? I think the obvious problem there is that the same commit can be a part of multiple branches. We could have some rev = "branch:SHA1"
syntax for that too keep track, though. I have not implemented this last thing (at some point I went away to do the first thing, but then realised it seemed like it already worked).
I am sitting on a small patch which drops the leanpkg
requirement for coreutils
, though. Makes it work on windows without git bash (I suppose you still need git
in your path).
@Keeley Hoek Putting anything but a commit hash in rev
is a no-go and should ideally not even be accepted by leanpkg. You lose all reproducibility with that. Instead there should be a new key branch
that is used for leanpkg upgrade
.
If someone wants to implement tracking branches in leanpkg, I'll review and merge that, too.
No takers? Anything else that should be part of 3.4.2?
I can't do it this week. :(
Would you do it next week? I guess Sebastian could wait one more week.
I can promise to do it over the weekend
@Sebastian Ullrich Maybe this is unrealistic, but I would hope it isn't too hard. It would be very helpful if Lean could expose the current namespace and active variables
and include
s. Whether this is exposed via a message/trace/set_option/#print I wouldn't really care. As long as we can get hold of that information. Is this possible?
@Sebastian Ullrich filed at https://github.com/leanprover/lean/pull/1981
Please let me know if you'd like anything changed---I'll be speedy!
@Johan Commelin, based on my previous experimentation it is possible to write a command in vanilla Lean which gets the current namespace, and I think I know a way to do that with include
s as well (i.e. this is implementable as a #whereami
command or something). The same tricks won't work for variables
I don't think.
Actually, I can think of a super hacky way to do it with variables as well, if they have ever been used already in the current namespace
/section
.
I'd need an afternoon to remember how to use the code I wrote which does this
@Keeley Hoek That sounds good and would be very helpful!
Sure, but I'm going to have to do it early next week unless I'm lucky I think
{% endraw %}Last updated: Apr 24 2020 at 19:02 UTC


--- author: display_name: Rick Kelson email<EMAIL_ADDRESS>tags: - boundaries - zip codes date: 2011-09-08 14:56:18 -0600 title: Zip Codes categories: [] ZipCodeBoundaries: hub: name: Utah ZIP Code Areas item_id: 4f9d1d1301864f8cabef08cbae7b2d3c updates: - April, 2022 - Improved boundaries in Davis county - November, 2019 - Added 84765 polygon for Motoqua in Washington County - January, 2019 - Added 84059 zip code in Utah County - February, 2016 - Updated 84321, 84235, 85326, 84332, 84339 - July, 2015 - Split the 84095 (South Jordan) zip code along the Bangerter Hwy to create the new zip code 84009 (South Jordan) - January, 2015 - Improvements were made to 84773 (Teasdale) and 84775 (Torrey) - January, 2015 - Adjusted the 84747 (Loa) and 84716 (Boulder) zip code boundaries to follow the address grid quadrant boundaries --- {% include abstract.html name="Zip Codes" stewards="UGRC" abstract="This dataset contains the estimated geographic extents for all five digit zip codes in Utah that are not P.O. box only." %}
Zip Codes Boundaries represent an ongoing effort to approximate the geographic extents of five digit zip codes. The dataset was produced using a combination of methods and is based on several sets of source data. Editing methods include:
In addition, UGRC has used the locations of mailing addresses known to be valid to fine tune this dataset. The native spatial reference for this dataset is UTM Zone 12N, NAD83 (0.01 meter coordinate precision). There are no constraints or warranties with regard to the use of this dataset. Users are encouraged to attribute content to: State of Utah, SGID.
{% include contact.html subject=page.title contact=site.data.contacts.zip_codes %}


Last week, I came (again) to the realization that my online portfolio was null, zero, void 0, nada, so I decided to challenge myself and commit one little project each day during 7 days using a versatile, widely used and easy to learn library that I’ve never explored before starting FreeCodeCamp. That library is, of course, jQuery.
Getting Ideas
For project ideas, I already had some ideas in mind, but I wanted to go a little off-the track from the major typical examples like a slider or a modal window. I also wanted them to be made “from scratch”, so no “make your own xxx with jQuery” YouTube or blog tutorials. The setup was simple. 1st: open CodePen 2nd: start to code.
Strenghtening the basics
In parallel, I’ve also been reading a lot, going through every article, video, book and link on this Gist by Eric Elliot. It really gives you a good path for learning JavaScript properly. I’m still missing many books and links reommended there, but I can recommend them 100%.
Furthermore, this week I learned about Reactive Functional Programming, which is a totally new paradigm from my classic C background, and from mostly all the JS I’ve learned up until now. It got me super excited and made me want to refactor everything using it, so one of the projects I made uses BaconJS as a proof of concept, and it also plays very nice with jQuery. Totally mindblown.
Just do it!
So I went on and made 7 pens this week. No frills, no struggle, that’s it. Just dedicated 1 hour or 2 each day and went on with my self-imposed challenge. Wrapping it up, I learned many new things about jQuery and the DOM (like requestAnimationFrame), I had lots of fun doing the projects, and beefed up my frontend portfolio for good measure. I hope you like the projects/pens, and if you are starting from 0 like me, gives you some motivation to start your own challenge.
Of course, here’s The Link to my Codepen. Enjoy!
UPDATE:
I’ve read about this girl who made 180 websites in 180 days. Quite a feat! and even some sites are very simple, she had the constance to never stop doing it. Here’s the site


TIFFGT
Section: User Commands (1)
Updated: October 15, 1995
Index
Return to Main Contents
NAME
tiffgt - display an image stored in a
TIFF
file (Silicon Graphics version)
SYNOPSIS
tiffgt
[
options
]
input.tif ...
DESCRIPTION
tiffgt
displays one or more images stored using the
Tag Image File Format, Revision 6.0.
Each image is placed in a fixed size window that the
user must position on the display (unless configured
otherwise through X defaults).
If the display has fewer than 24 bitplanes, or if the
image does not warrant full color, then
RGB
color values are mapped to the closest values that exist in
the colormap (this is done using the
rgbi
routine found in the graphics utility library
-lgutil.)
tiffgt
correctly handles files with any of the following characteristics:
BitsPerSample 1, 2, 4, 8, 16
SamplesPerPixel 1, 3, 4 (the 4th sample is ignored)
PhotometricInterpretation 0 (min-is-white), 1 (min-is-black), 2 (RGB), 3 (palette), 6 (YCbCr)
PlanarConfiguration 1 (contiguous), 2 (separate)
Orientation 1 (top-left), 4 (bottom-left)
Data may be organized as strips or tiles and may be
compressed with any of the compression algorithms supported
by the
libtiff(3)
library.
For palette images (PhotomatricInterpretation=3),
tiffgt
inspects the colormap values and assumes either 16-bit
or 8-bit values according to the maximum value.
That is, if no colormap entry greater than 255 is found,
tiffgt
assumes the colormap has only 8-bit values; otherwise
it assumes 16-bit values.
This inspection is done to handle old images written by
previous (incorrect) versions of
libtiff.
tiffgt
can be used to display multiple images one-at-a-time.
The left mouse button switches the display to the first image in the
next
file in the list of files specified on the command line.
The right mouse button switches to the first image in the
previous
file in the list.
The middle mouse button causes the first image in the first file
specified on the command line to be displayed.
In addition the following keyboard commands are recognized:
- b
-
Use a
PhotometricIntepretation
of MinIsBlack in displaying the current image.
- l
-
Use a
FillOrder
of lsb-to-msb in decoding the current image.
- m
-
Use a
FillOrder
of msb-tolmsb in decoding the current image.
- c
-
Use a colormap visual to display the current image.
- r
-
Use a true color (24-bit RGB) visual to display the current image.
- w
-
Use a
PhotometricIntepretation
of MinIsWhite in displaying the current image.
- W
-
Toggle (enable/disable) display of warning messages from the
TIFF
library when decoding images.
- E
-
Toggle (enable/disable) display of error messages from the
TIFF
library when decoding images.
- z
-
Reset all parameters to their default settings (FillOrder,
PhotometricInterpretation,
handling of warnings and errors).
- PageUp
-
Display the previous image in the current file or the last
image in the previous file.
- PageDown
-
Display the next image in the current file or the first image
in the next file.
- Home
-
Display the first image in the current file.
- End
-
Display the last image in the current file (unimplemented).
OPTIONS
- -c
-
Force image display in a colormap window.
- -d
-
Specify an image to display by directory number.
By default the first image in the file is displayed.
Directories are numbered starting at zero.
- -e
-
Enable reporting of error messages from the
TIFF
library.
By default
tiffgt
silently ignores images that cannot be read.
- -f
-
Force
tiffgt
to run as a foreground process.
By default
tiffgt
will place itself in the background once it has opened the
requested image file.
- -l
-
Force the presumed bit ordering to be
LSB
to
MSB.
- -m
-
Force the presumed bit ordering to be
MSB
to
LSB.
- -o
-
Specify an image to display by directory offset.
By default the first image in the file is displayed.
Directories offsets may be specified using C-style syntax;
i.e. a leading ``0x'' for hexadecimal and a leading ``0'' for octal.
- -p
-
Override the value of the
PhotometricInterpretation
tag; the parameter may be one of:
miniswhite,
minisblack,
rgb,
palette,
mask,
separated,
ycbcr,
and
cielab.
- -r
-
Force image display in a full color window.
- -s
-
Stop on the first read error.
By default all errors in the input data are ignored and
tiffgt
does it's best to display as much of an image as possible.
- -w
-
Enable reporting of warning messages from the
TIFF
library.
By default
tiffgt
ignores warning messages generated when reading an image.
- -v
-
Place information in the title bar describing
what type of window (full color or colormap) is being
used, the name of the input file, and the directory
index of the image (if non-zero).
By default, the window type is not shown in the title bar.
BUGS
Images wider and taller than the display are silently truncated to avoid
crashing old versions of the window manager.
SEE ALSO
tiffdump(1),
tiffinfo(1),
tiffcp(1),
libtiff(3)
Index
- NAME
-
- SYNOPSIS
-
- DESCRIPTION
-
- OPTIONS
-
- BUGS
-
- SEE ALSO
-
This document was created by
man2html,
using the manual pages.
Time: 01:31:48 GMT, November 23, 1999


Chennai Trekking Club's Chennai Triathlon July 12, 2014
Supported only in Chrome and Mozilla Firefox browsers
Download Certificate


{% extends 'base.html' %} {% load crispy_forms_tags %} {% load static %} {% block content %}
Your username and password didn't match. Please try again.
Please login to access your account.
Forgotten password? Change Password.
Don't have an account? Register.


We monetize content!
- harness customized web services
- harness user-centric systems
- innovate magnetic e-markets
- leverage innovative methodologies
- expedite distributed experiences
- whiteboard real-time niches
- maximize B2B relationships
- target global vortals
- expedite strategic ROI
- drive visionary convergence
- seize user-centric initiatives
- deliver 24/365 communities
- target wireless communities
- optimize turn-key niches


BBLog 4.1.0 out now - Better Battlelog Forums #117038
Sitemap
19. February 2014 08:00
Topicstarter
BrainFooLong
Administrator
A new release that introduce the well known weapon list filters by category from BF3, in BF4. Also it contains some minor fixes.


influenza virus respiratory avian human IAVs pandemic []. swine transmission viruses MERS-CoV α-, tract IAV receptor animal humans infection upper mice models East specificity Virol./JVI.- syndrome Middle coronavirus lower potential viral Infect host model cells replication transmissibility {border-style ferrets pathogenicity However, IAVs, novel px;} #ffffff;} [], pigs shown pathogenic [–]. acid case humans. infected pandemics pdm type adaptation experiments mouse subtypes Animal cases express hDPP replicate seasonal using A(HN) DPP genetic ingredients mutations reassortant tract, transmissible Dis./eid. MERS-CoVs Sci Zika determinants distribution dromedary ferret human-type similar strains Acad Natl acquisition binding clinical dengue human-to-human humans, isolates reported viruses. A./pnas. Virol./JVI...-. airborne bat camels considered contact efficient guinea like low origin protein px; swine, swine-origin tracts vaccine virulence {font-family Guinea IAVs. Pathoge./journal.ppat. Respi Syrian cell emerging expression ferrets, font-size growth hemagglutinin isolate mutation past pigs, polymerase receptors reservoir sialic study (Fig. (HN) ;():./v. Fig. SAs Therefore, United Vero Viruses. Viruses./j.-...x adapted al.The appears bind caused circulating double; infect infecting infections level limited major mice, molecular new rabbits reassortants results signs species studies susceptibility transmit use used virus. virusesJ ;():./JVI.-. Avian Commons Creative IAV, IBVs Korea MERS-CoVs. NHPs New Rev Virol. [–], adaptive amino antigenic appear bold border-color border-width certain conceptual different disease diverse dose expressing high highly hosts important inherent isolated known natural need pig poorly potential. readily reassortment related role small solid; suggest susceptible symptoms terms virus, {font-style {font-weight (MERS-CoV) .de Engl HN, Hence, Human J./-X-- Liu MDCK NHPs. Onee./journal.pone. Pathogenicity References South Viral [–] acquired acute al.Replication animals antigenically antiviral appeared associated asymptomatic attachment based better changes characteristics closely courier; critical data demonstrated designate determine did discussed diseases distinct efficacy em; emergence evaluation generated generation global human, human-like identified implications importance including indicate infectious initial kidney lack lacking likely lung mild models. mutant non-human nonhuman overflow pandemics. pathogenesis pathogenicity, pathology peptidase persistent presence proteins provide pt;} range recipe relatively replicating reports residue result rhesus severe single spread viruses, zoonotic


?msm
6
7
8
9
10
T
H
v
The
New
York
copyright
reserved
botanical
Garden
NO-
S-uj.
DET.
BY
MILDRED
E.
MATHIAS
Nosr"
╚╚tttCH
n
PLANTS
OF
CUBA
SOUTHERN
BARACOA
REGION
NEW
YORK
BOTANICAL
GARDEN
50
04
1└UJL--
'W.Oddt-........-JxAA
_
______
_________________Ćú:.......lŁ˘xučzxdt-.y.'iA╦ň......
July
17ĐAugust
4-1924
Collect.
:
FRE.
Leon
01501041
Legend -
Level of confidence that token is an accurately-transcribed word
extremely low
very low
low
undetermined
medium
high
very high


Round Robin Schedule Generator
Teams
Enter each player or team name on separate lines here
Rounds
(optional)
Enter the number of rounds -- defaults to the number of players or teams
Name
(optional)
Enter a name for the schedule if desired
Description
(optional)
Enter a description for the schedule if desired
Shuffle
Shuffle Seed
(optional)
Enter the same number for predictable shuffles
Create New Schedule


I am RUDRANSH.I am 3 years old ,i study in Lkg .MY school name is Bachpan play school.I like dancing,playing outside,study,watching cartoons etc.
To know my favourite


Google Earth Enterprise Documentation Home | Get started
Build and install GEE 5.x
Currently, Google Earth Enterprise must be built from source before it can be installed. Refer to the EarthEnterprise Wiki for instructions. Once you have built Google Earth Enterprise you can proceed to the install instructions.
The GEE Server software package contains:
- GEE Server software
- GEE documentation
The Fusion software package contains:
- Fusion software
- Fusion tutorial files
- GEE documentation
- Example data files
- Configuration files


--- layout: page title: About ---
Hi, my name is Junpeng Qiu. I'm currently a Ph.D. student of Computer Science.
echo 'rkqdinbjmzhnbjm.dpn' | tr 'b-z' 'a-x@' # sh
or
%w(716a7063686d61696c40676d61696c2e636f6d).pack %q(H*) # Ruby


Smart Grid, Smart City Visualizer
The customer IDs listed in the drop-down are households in Australia that participated in the Home Area Network
(HAN) program.
Clicking
Select Customer will query the energy data for that household.
consumption data.


{% load i18n %}
{% blocktrans %}Thanks for your support! We're in beta, so your feedback and patience would be incredibly helpful.{% endblocktrans %}


---
sort_order: 45
tei_id: rdx_b5j2m.p.idm38624
annotation_count: 0
images:
small-thumbnail: http://readux.library.emory.edu/books/emory:b5j2m/pages/emory:p74v1/mini-thumbnail/
json: http://readux.library.emory.edu/books/emory:b5j2m/pages/emory:p74v1/info/
full: http://readux.library.emory.edu/books/emory:b5j2m/pages/emory:p74v1/fs/
page: http://readux.library.emory.edu/books/emory:b5j2m/pages/emory:p74v1/single-page/
thumbnail: http://readux.library.emory.edu/books/emory:b5j2m/pages/emory:p74v1/thumbnail/
title: Page 45
number: 45
---
{% raw %}CHAPTER TI.{% endraw %}
{% raw %}A EESPOXSIBLE JOTTEXEY.{% endraw %}
{% raw %}MY MARRIAGE.—MARRIAGE OF MY MASTER.—HI.- RUIN.—COMES TO{% endraw %}
{% raw %}ME FOR AID.—A G2LEAT ENTERPRISE UNDERTAKEN.—LONG AND{% endraw %}
{% raw %}SUCCE.—FUL JOURNEY.—INCH'ENTS BY THE WAY.—STRUGGLE{% endraw %}
{% raw %}BETWEEN INCLINATION AND DUTY.—DUTY TRIUMPHANT.{% endraw %}
{% raw %}hen I was about twenty-two years of age, I{% endraw %}
{% raw %}married a very efficient, and, for a slave, a{% endraw %}
{% raw %}very well-taught girl, belonging to a neighbouring{% endraw %}
{% raw %}family reputed to be pious and kind. I first met her{% endraw %}
{% raw %}at the religious meetings which I attended. She has{% endraw %}
{% raw %}borne me twelve children, seven of whom still survive{% endraw %}
{% raw %}and promise to be the comfort of my decliriing{% endraw %}
{% raw %}years.{% endraw %}
{% raw %}For a considerable period, my occupations were to{% endraw %}
{% raw %}superintend the farming operations, and to sell the{% endraw %}
{% raw %}produce in the neighbouring markets of Washington{% endraw %}
{% raw %}and Georgetown. Many respectable people, yet{% endraw %}
{% raw %}livino there, may possibly have some recollection of{% endraw %}
{% raw %}" Siah," or " Sie," (as they used to call me,) as their{% endraw %}
{% raw %}market-man; but if they have forgotten me, I re¬{% endraw %}
{% raw %}member them with an honest satisfaction.{% endraw %}
{% raw %}At length my master, at the age of forty-five,{% endraw %}
{% raw %}married a young woman of eighteen, who had some{% endraw %}
{% raw %}little property, and more thrift. Her economy was{% endraw %}
{% raw %}remarkable, and she added no comfort to the estab-{% endraw %}
{% raw %}w{% endraw %}


Work Days
Input Date:
Calculate
Format must be mm/dd/yyyy ex: 05/23/2024
Width:
Guage:
RPM:
PPh
Order total:
Pounds Ran:
Remaining Pounds:
pph:
Calculate
Width:
Guage:
Density:
G/m


EZO™ pH Circuit - Calibration
The EZO™ pH Circuit is currently not calibrated!
Continuous reading
The most important part of calibration is watching the readings during the calibration process.
The first calibration point must be the Mid point (pH 7.00)


--- layout: page title: More Than Men Comic permalink: /comic/morethanmen/ description: What if only the rich had super powers? ---
Ten years ago, the US government found a way to manufacture super powers but the high cost of production meant that only the rich could afford the procedure.
Once loved and respected, superheroes now struggle to stay relevant in a world that has reduced their abilities, to the mundane.
Today, only a single superhero team still exists in all of America, and even their days seem numbered.
But as tensions begin to rise between the powered and non-powered communities, our heroes will once again see themselves thrust into the spotlight, just not in the way they expect...


|
144. Meeting Time Limit: 0.1 sec, Memory Limit: 1 MB Two of the three members of the winning team of one of
the ACM regional contests are going to meet in order to train for the
upcoming World Finals. They decided that they will meet sometime between
X o'clock and Y o'clock. Because they never get anywhere on
time (they were late even on the day of the regional contest), they did
not set an exact time when they will meet. However, they decided that the
one who gets first at the meeting point will not wait more than Z
minutes for the other one (they calculated that, if the other one will not
come within Z minutes from the arrival of the first of them, then
it is very probable that he will not show up at all). Input The input will contain 2 integer numbers X and Y (0<=X<Y<=24) and one real number Z ( 0 < Z <= 60*(Y-X) ). Output You should output the required probability with 7 decimal digits (rounded according to the 8th decimal digit). Sample Input 11 12 20.0 Sample Output 0.5555556 | ||||||
|


This is the home page
here is a quote
Here is emph and bold.
Here is some inline math $\alpha = \frac{\beta}{\gamma}$ and, of-course, E rules:


current_prolog_flag/2
current_prolog_flag/2 retrieve value(s) of prolog flag(s)
set_prolog_flag/2 set value of a Prolog flag
FORMS
current_prolog_flag(Flag,Value)
set_prolog_flag(Flag,Value)
DESCRIPTION
current_prolog_flag/2 is re-executable. It unifies Flag and Value with the current instantiations of the flag/value pairs supported by ALS Prolog. If Flag and Value are appropriately instantiated,
set_prolog_flag(Flag,Value)
changes the present value associated with Flag to become Value.
The flags supported by ALS-Prolog are:
ISO Standard Flags (ISO Standard references are given in parentheses):
bounded (<IP_ADDRESS>)
Values: true, false
Default = true
Changeable: no
max_integer (<IP_ADDRESS>)
Default = Value
Changeable: no
min_integer (<IP_ADDRESS>)
Default = Value
Changeable: no
integer_rounding_function (<IP_ADDRESS>)
Values: down toward_zero
Default = toward_zero
Changeable: no
char_conversion (<IP_ADDRESS>)
Values: on off
Default = off
Changeable: yes
debug (<IP_ADDRESS>)
Values: off on
Default =off
Changeable: yes
max_arity (<IP_ADDRESS>)
Default = Value (= max_integer)
Changeable: no
unknown (<IP_ADDRESS>)
Values: error fail warning break
Default = error
Changeable: yes
Describes the course of action to take when an undefined predicate is called.
The associated value (action) may be one of the following:
error - force an existence error when an undefined predicate is called.
fail - fail when an undefined predicate is called.
warning - warn the user when an undefined predicate is called.
break - enter the break handler when an undefined predicate is called.
double_quotes (<IP_ADDRESS>)
Values: chars codes atom
Default = codes
Changeable: yes
ALS Extension Flags:
undefined_predicate synonymous with: unknown
windows_system
Values: nowins tcltk
Default = Value
Changeable: no
Takes value "nowins" if no windowing system extension is present; otherwise is
the identifier of the windowing extension (at present, only tcltk).
anonymous_solutions ( reporting )
Values: true false
Default = false
Changeable: yes
syntax_errors ( behavior on syntax errors )
Values: fail error quiet dec10
Default = error
Changeable: yes
obp_location (location of generated obp files )
Values: gic gis giac gias
Default = gias
Changeable: yes
freeze (whether freeze is available)
Values: true false
Default = Value
Changeable: no
constraints (whether constraints are available)
Values: true false
Default = Value
Changeable: no
iters_max_exceeded (only when constraints = true)
Values: succeed fail warning exception
Default = succeed
Changeable: yes
For CLP(BNR), the iters_max_exceeded flag controls the behavior when then maximum number of constraint narrowing
iterations is exceeded, as follows:
-- succeed (leaves network in place)
-- fail (quiet; backtracking resets net)
-- warning (fails & issues warning; backtracking resets net)
-- exception (backtracking resets net)
Settings for prolog flags can be placed in the startup file (alspro.pro or .alspro).
ERRORS
Flag is a variable (set_prolog_flag only)
> instantiation_error.
Value is a variable (set_prolog_flag only)
> instantiation_error.
Flag is neither a variable nor an atom
> type_error(atom,Flag).
Value is inappropriate for Flag
> domain_error(flag_value, Flag + Value)
NOTES
EXAMPLES
?- current_prolog_flag(unknown, V).
V = error
?- set_prolog_flag(undefined_predicate,fail).


The Future of DiscoverEd by nathan on 2011-04-11 The DiscoverEd project was started in 2008 to explore how structured data could be applied to...
CC + GSoC: Integration is the Word by nathan on 2011-03-21 Creative Commons is once again participating in the Google Summer of Code, an opportunity for...
Supporting tools for decentralized metadata by nathan on 2011-03-16 Over the past couple years Creative Commons has built DiscoverEd, a prototype search and...
Follow your nose for translations by nathan on 2011-02-07 One of our goals is to continue to make the licenses more useful as self-describing resources....
Merging old and new CC REL schemas by nathan on 2011-02-04 When the RDF schema that would become CC REL was first developed, it was published at...
Three Layers of a CC License by nathan on 2011-01-10 Included in last week's redesign is an updated Licenses page, describing the CC licenses and...
License identifier on the Deeds by nathan on 2011-01-07 Yesterday we launched a refresh of the site design for creativecommons.org. Included in the...
License Discovery in Feeds by nathan on 2011-01-04 Right before the winter break I came across Scott Wilson's blog post on a CETIS blog about...
Google News and Source Citation by nathan on 2010-12-10 Last month the Google News team announced two new meta tags publishers can use to mark up their...
Type Of: Educational (an idea) by nathan on 2010-12-03 I spent most of yesterday in a meeting discussing ways to make search better for open...
Well Covered by nathan on 2010-10-05 When we rolled out Hudson for CC code last month, I already knew that I wanted to have test...
Find and Reuse Images: Painless Attribution by nathan on 2010-10-04 Finding CC licensed images and using them properly is something many people seem to struggle...
October 2010 Tech Update by nathan on 2010-10-01 Inspired by the Wikimedia Foundation, I wanted to give a brief update on the past month's...
Upcoming changes to CC Network by nathan on 2010-09-24 In about a week (Monday, October 4, 2010) we'll be rolling out an update to CC Network. This...
Curation and Structured Data for educational resources by nathan on 2010-09-02 I spent most of last week in Alexandria, Virginia, talking about DiscoverEd (and hearing others...
«Semantic Copyright» and CC REL by nathan on 2010-09-02 On Monday Safe Creative announced a new project, Semantic Copyright. The project includes an...
Named Graph support lands in DiscoverEd by nathan on 2010-09-01 Earlier this week we updated the master branch on the DiscoverEd project. While this "release"...
Draft metadata for Public Domain Mark by nathan on 2010-08-19 As announced on the CC blog earlier this month, we're working on a new tool to complement CC0,...
Welcome Hudson to Creative Commons by nathan on 2010-08-12 We've been working over the past year on improving our tooling and processes for the CC website...
Thoughts on Installing SMW "Applications" by nathan on 2010-02-02 I've posted a follow up to my previous notes on Semantic MediaWiki as an application platform....
Search and Discovery for OER by nathan on 2010-01-14 Last summer the Open Society Institute generously provided funding for CC to host a meeting...
MediaWiki, the application platform by nathan on 2010-01-08 As noted on the CC weblog and elsewhere, AcaWiki launched back in October. I'm much later noting...
Caching deeds for peak performance by nathan on 2010-01-06 As Chris mentioned, he's been working on improving the license chooser, among other things...
CC @ Mozilla Service Week by nathan on 2009-09-09 Next week is Mozilla Service Week and Creative Commons is participating by hosting a week long...
git-svn with svn:externals by nathan on 2009-07-21 We've been slowly but surely moving projects from Subversion to git, but there are still large...
License Engine path changes by nathan on 2009-07-21 We just pushed out a resolution to Issue 381, updating the path to the license engine. The...
Updates to CC Network OpenID Provider by nathan on 2009-04-13 We received a couple bug reports over the weekend about the CC Network OpenID provider. Users...
Enumeration descriptions in CC Web Services by nathan on 2009-04-02 We had a request come in from a developer using the CC web services for better contextual...
CC Technology Summit 3: Turin, Italy by nathan on 2009-03-29 As you may have see on the blog or one of the mailing lists, we've announced the third CC...
CC Technology Summit Video by nathan on 2009-01-16 In December we held our second CC Technology Summit at MIT in Cambridge, MA. I think the day...
CC Network Feature Update by nathan on 2008-10-21 We just pushed a new feature set to CC Network; most of these are OpenID related, and I'll try...
Introducing Commoner by nathan on 2008-10-21 Last week we launched the Creative Commons Network as part of our annual campaign. The Network...
Schema Migration with Django by nathan on 2008-10-21 Django is an amazing web framework; we built a lot of features in a very short period of time...
Issue Tracking at code.creativecommons.org by nathan on 2008-09-05 Continuing the trend started when we moved our source repository, today we're rolling out issue...
Juggling Metadata at CC by nathan on 2008-07-03 It's the day before a long weekend and inspiration hits — RDFa and ccREL are exactly like juggling!
Stand-up Meeting 2004-04-01 by nathan on 2008-04-03 The Tech Team at Creative Commons has recently replaced our weekly one-on-ones (myself with each...
Version Control Changes by nathan on 2008-04-01 I alluded to it in my last post and wanted to provide some more details and context on the...
Destination: Sanity by nathan on 2008-03-27 Last week Kinkade asked me for a brief overview of how the license engine, web services and...
Enhanced Metadata Graduates from Labs by nathan on 2007-06-21 Early this morning we launched some functionality on the main "license...
CC: The Clear Choice for BotNets Everywhere by nathan on 2007-05-17 I was working this morning and noticed that "#cc":http://wiki.creativecommons.org/IRC, our IRC...
VMware Workstation 6 released by nathan on 2007-05-10 I've been a fan of "VMware":http://vmware.com for years. Both at my previous job and this one,...
StuffIt 10 Considered Harmful by nathan on 2007-05-01 Mac OS X users of "ccPublisher":http://wiki.creativecommons.org/CcPublisher have long been...
Berlios.de back online by nathan on 2007-04-23 After the downtime we "reported":/archives/old-tech-blog/entries/cc-tools-berlios-unavailable/...
CC Tools @ Berlios Unavailable by nathan on 2007-04-23 Back in November, 2005, SourceForge wasn't looking so hot: no Subversion support, despite...
wiki.creativecommons.org skin available by nathan on 2007-04-23 The skin for Creative Commons' "wiki":http://wiki.creativecommons.org is now available from...
Summer of Code Projects by nathan on 2007-04-12 We're very happy to have five students working on Creative Commons and Science Commons projects...
WordPress MU v. Lyceum by nathan on 2007-04-12 We're preparing to launch "hosted blogging":http://wiki.creativecommons.org/CCi_Blogs service...
The CC Tech Blog by nathan on 2007-04-11 Welcome to the Creative Commons Tech Blog. The CC Tech Blog is a new blog from Creative Commons,...
wpLicense 0.7.6 by nathan on 2007-04-11 Today I released wpLicense 0.7.6 ( download see update below). It's a minor bug fix, but one...


This Game of Life simulation is running entirely on your graphics card. The simulation state swaps back and forth between two texture buffers in the GPU's memory.


At the time of my first Datura Stramonium usage I was 16 years old. I heard many stories about Datura from my friends and was eager to check out Datura myself. An experienced friend of mine got me approximately 150 very potent seeds (they were black and dark brown) but I didn't want to use them yet.
I wanted to learn more about Datura, so I checked online. I've read a lot about Datura and I didn't want to eat those seeds like many people did; without a sitter and proper setting, so I waited for a chance to consume those seeds properly.
I guess it would be important to note that I suffer from manic-depressive psychosis for years. For those who are not familiar with manic-depressive psychosis, let me just put it like this: for a month I feel great; like I can achieve anything I try and I also get involved in many different activities. But then, suddenly, I start to feel really messed up. I become extremely sad and depressive. That's when the depressive psychosis is starting to hit me. When I was about 12 years old I used to cut myself with a blade when the depressive psychosis started to happen (after the manic ones), because it was just too painful state of mind. Few times I was very close to committing a suicide.
At the time of acquiring Datura seeds I was in manic state of mind.
Soon after acquiring Datura seeds, my manic state of mind became depressive. This was the most terrible depression ever and it was triggered by heavy emotions of pain and loneliness.
That caused me to think and act irrational, so this one Friday night I prepared my room for my first Datura trip. I removed all sharp objects from my room and got a lot of free space in it (I guessed I would want to walk around while tripping on Datura). Also, I got myself cold water.

T+0:05
I ate all of those seeds on an empty stomach. They were bitter (as expected), but not too bad. I chewed them easily and used water to help me swallow. I laid on my bed to relax.
T+0:20
I felt sharp pain in my eyes. I assumed that my pupils were dilating so I went to the bathroom and looked at my reflection in the mirror. My pupils were extremely dilated. For an unknown reason, this was pretty entertaining for me. I got back to my room and locked the door. I hid the key, just in case of a heavy delirium.
T+1:10
I felt somewhat bored and tired so I tried to sleep. I was surprised to find out that trying to sleep made me feel uncomfortable and I became very thirsty. I was aware that the Datura trip was starting to happen. I drank some water and laid back to bed.
T+1:15
I was looking at the wall, hoping to see changes. Soon, I noticed that shadow on the wall was starting to move slowly; it was pouring down the wall like honey. That made me feel very pleased because I knew that it was not real (although it seemed quite real) and that it was just my brain playing it's own little games with my perception. Also, I saw a lot of little white flying worms which made me laugh and feel happy.
XX:XX (Soon after that pouring shadow I lost track of the time)
Suddenly I felt a need to urinate. I found the hidden key (it took me some time to find it) and went to the bathroom. My movement was very slow; it seemed like gravity is twice stronger than before. I tried to urinate but I could barely stand.  I was still aware that this is just an effect caused by Datura and my brain, although it was not easy to keep that in my mind all of the time. I still couldn't urinate and it caused me pain. I only got few drops of urine out, but it wasn't nearly enough. I gave up trying, washed my hands and returned to my room.
In the center of my room there was a belt. I picked it up and carried it out of my room (to the hallway). In the hallway, there was another belt. I remembered that that belt was in my room and that I carried it to the hallway (it was my younger brother's belt). I looked at the belt in my hand and then I checked that belt on the floor. It was the same belt but it didn't seem to be a problem for me. I just left the other belt near the one that was already there and returned to my room.
I've spotted another belt in the center of my room. Not a big deal, I just carried it to the hallway and left it along the other two belts and returned to my room.
Again, there was a belt in the center of my room. I repeated the process about twenty times in a row. It didn't seem strange to me that the center of my room was a spawning place for my younger brother's belt. Not a bit strange.
  I looked at the pile of belts and it was gone ! There was just one belt which I carried out of my room while cleaning it and that was very funny for me. I was glad that Datura was messing me up and that I was making a fool out of myself.
I felt stomach-ache and remembered that I really have to urinate. I went to the toilet but I still couldn't do it. It made me feel rather unhappy (not sad, just unhappy) and unsatisfied. It was like when after sex I feel need to urinate, but I just can't do it. I washed my hands and returned to my room.
I laid on the bed and tried to sleep, but I couldn't; I felt Datura.  I got off the bed and took that bottle of water which I left near the wall. I started to drink the water, but the taste was bitter and disgusting. Then a sudden thought ran through my head: 'Dude, you didn't leave that damn bottle of water near the wall, you've left it near your bed !'
I felt a sudden dread confusion when I realised that there is no bottle in my hands at all. It lasted only for a moment, but it was quite scary. I fought off that sensation and drank some of the real water. That victory over such horrible and shocking sensation made me feel strong and very proud. I felt like a brave warrior who has just defeated an evil quasi-god.
I've spent the rest of the night going to the bathroom, rolling over my bed and walking around my room.
I woke up at about 10:00 in the morning.
At first I felt a bit fuzzy and puzzled but I soon remembered what has just happened and gathered as much as I could about the last night. I felt great, sober and relaxed - there was not even a smallest sign of depression. I felt my next manic phase starting and that was extremely nice cognition.
My pupils were still dilated and I couldn't read a thing for the whole day, but I didn't worry about it (I knew that this was just a Datura side-effect).
After this fantastic experience I've tried Datura few times again and those trips were fine, but they can't compare to my first one.
BTW, I've never again had strong depressive psychosis like I had before eating Datura seeds and I've also stopped hurting myself. I still wonder if there is a link between Datura exp. and my weaker depressive psychosis.
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.


Form complete
Follow the next steps to complete your application
What you need to do next
For us to progress this application, send us original or certified copies of your:
- birth certificate
- marriage certificate (if applicable)
- HMRC Lifetime Allowance protection certificate (if applicable)
For us to match up this application with the documents you send us, print this page or write down and include:
- our Application Type code - AW8P
- your National Insurance number - [NINO]
Include the return address we can post all of your documents to. Otherwise we will use the address we have saved for you, which is:
The address you need to send everything to:
What we'll do next
We'll send your documents back through the same delivery method we received them.
Your pension will be processed within either:
- 30 calendar days from the date you retired
- 30 days from the date NHS Pensions receives all the information needed to calculate and pay your pension
When we process your application, we’ll contact you if we need any further information from you and let you know if this will cause a further delay.


Welcome to GRU’s documentation!¶
What is GRU?¶
GRU is a host-centric inventory management system. It is used to visualize and provide context on individual servers and more importantly, on groups of servers.
It was designed in order to help operations teams, as well as developers to better understand their infrastructure and to provide a unified view of available compute resources.
This is what it looks like:
Motivation¶
Understanding which compute resources exist (and which business context they serve) can be tricky. In many cases, this information is scattered across several systems.
GRU is designed to give an accurate view of compute resources available to us. The main primitive in GRU is the Host. By providing different ways to slice and dice an inventory (or, collection of hosts) and allowing plugins to give external context regarding each host, we can better discover, understand and optimize our infrastructure.
Plugins, that are at the center of GRU, are used to integrate information and actions from external systems. These can include monitoring, CMDB, real time metrics, cost info, service checks and more. By uniting all these into one place we can easily reason about our resources and provide visibility to operations and software engineers.
Contents:


Workflow Outputs
The outputs collect the information from the earlier objects in your workflow. These can pop up a Notification Center message, show it in Large Type on your screen, copy the query to clipboard or run a script containing the result of your workflow.
Post Notification
Post Notification uses Notification Center to post a message relating to the workflow you've run. For example, it can show a message to say that your workflow's task has completed successfully.
Large Type
Large Type shows the result of your search in large characters in the middle of your screen. Handy to see a phone number from across the room.
Copy to Clipboard
Copy to Clipboard will copy the result of your workflow to the clipboard and, optionally, paste it to the front most app.
Write File
Use the Write File object to write the output of your workflow to a new file, creating a new file, appending to an existing one or overwriting an existing one.
Play Sound
Use the Play Sound object, to play system or custom sounds throughout your workflow. Useful for notifications, or just for fun!
Dispatch Key Combo
Use the Dispatch Key Combo object to dispatch a keystroke combination to macOS. This can be useful for automating software on your Mac.
Call External Trigger
Use the Call External Trigger object to call any workflow's External trigger object. The argument, workflow and session variables are passed through.
Find out more about Workflows
Discover workflows and learn how to create your own in the Workflows section.
To find out more about other workflow objects, take a look at each type:
- Triggers: Activate Alfred from a hotkey, another Alfred feature or an external source.
- Inputs: Keyword-based objects used to perform an action, on its own or followed by a query.
- Actions: The objects that do most of the work in your workflows; opening or revealing files and web searches, running scripts and performing commands.
- Utilities: Utilities give you control over how your objects are connected together and how the arguments output by the previous object is passed on to the next object.


import numpy as np
import nash
Player strategies¶
Definition of mixed strategies¶
A mixed strategy for a player with strategy set $S$ is denoted by $\sigma \in [0,1]_{\mathbb{R}}^{|S|}$ and corresponds to a probability distribution over the pure strategies of player $i$. So:
$$ \sum_{i=1}^{|S|}\sigma_i = 1 $$The expected score of a player can then be calculated as a measure over the probability distributions.
Calculating utilities¶
Considering a game $(A, B)\in\mathbb{{R^{m \times n}}^2}$, if $\sigma_r$ and $\sigma_c$ are the mixed strategies for the row/column player (respectively). The utility to the row player is:
$$ u_r(\sigma_r, \sigma_c) = \sum_{i=1}^m\sum_{j=1}^nA_{ij}{\sigma_r}_i{\sigma_c}_j $$and the utility to the column player is:
$$ u_c(\sigma_r, \sigma_c) = \sum_{i=1}^m\sum_{j=1}^nB_{ij}{\sigma_r}_i{\sigma_c}_j $$This comes from:
- The probability of being in a given cell of $A$ or $B$: ${\sigma_r}_i{\sigma_c}_j$
- The value of the particular cell: $A_{ij}$ or $B_{ij}$
As an example consider the matching pennies game:
$$ A = \begin{pmatrix} 1 & -1\\ -1 & 1 \end{pmatrix}\qquad B = \begin{pmatrix} -1 & 1\\ 1 & -1 \end{pmatrix} $$with the following mixed strategies:
$$ \sigma_r = (.2, .8) \qquad \sigma_c = (.6, .4) $$We have:
$$ u_r(\sigma_r, \sigma_c) = 0.2 \times 0.6 \times 1 + 0.2 \times 0.4 \times (-1) + 0.8 \times 0.6 \times (-1) + 0.8 \times 0.4 \times 1=-0.12 $$$$ u_c(\sigma_r, \sigma_c) = 0.2 \times 0.6 \times (-1) + 0.2 \times 0.4 \times 1 + 0.8 \times 0.6 \times 1 + 0.8 \times 0.4 \times (-1)=0.12 $$Linear algebraic calculation¶
Note that we can rearrange the expressions for the utilities:
$$ u_r(\sigma_r, \sigma_c) = \sum_{i=1}^m{\sigma_r}_i\sum_{j=1}^nA_{ij}{\sigma_c}_j $$$$ u_c(\sigma_r, \sigma_c) = \sum_{i=1}^m{\sigma_r}_i\sum_{j=1}^nB_{ij}{\sigma_c}_j $$in turn this corresponds to the matrix vector product:
$$ u_r(\sigma_r, \sigma_c) = {\sigma_r}A\sigma_c^T $$$$ u_c(\sigma_r, \sigma_c) = {\sigma_r}B\sigma_c^T $$We can use numpy to verify this calculation:
A = np.array([[1, -1], [-1, 1]])
B = np.array([[-1, 1], [1, -1]])
sigma_r = np.array([.2, .8])
sigma_c = np.array([.6, .4])
np.dot(sigma_r, np.dot(A, sigma_c)), np.dot(sigma_r, np.dot(B, sigma_c))
Finally we can also directly calculate this using a nashpy
game:
matching_pennies = nash.Game(A, B)
matching_pennies[sigma_r, sigma_c]


Mapped: The North East causes given a boost by National Lottery funding, from Roker Pier to Beamish
The equivalent of £170,000 per day has been invested into more than 24,000 good causes in the region over the past quarter of a century
by Katie DickinsonFrom the Angel of the North to Kielder Water, these are some of the projects given a boost by £1.5billion invested in the North East over 25 years by National Lottery players.
The equivalent of £170,000 per day has been invested into more than 24,000 good causes in the region over the past quarter of a century.
To celebrate its 25th birthday, The National Lottery has released a star-studded film inspired by Monty Python entitled ‘What has The National Lottery ever done for us?’.
Illustrator Ruby Taylor has also created a map highlighting some of the key projects and places in the region that have thrived thanks to National Lottery funding.
Some of the places showcased include The Angel of the North, which illusionist Julius Dein made disappear in a celebration stunt last month, and The Sage Gateshead, the site of a world record breaking cream tea, hosted by TV personality Scarlett Moffatt.
There’s also the stunning architecture of Durham Cathedral, which has received money for restoration and building works, the iconic Gateshead Millennium Bridge, part funded by the Millennium Commission, and the rugged landscape of the North Pennines.
Dawn Austwick, Chief Executive of The National Lottery Community Fund, said: “Twenty-five years ago, saw the advent of The National Lottery – today we’re celebrating what is now a national treasure.
"The money raised for good causes has helped millions of us follow our passions, find a voice and thrive. Whether through art, sport, community, heritage or film, our lives have been touched and changed - thanks to National Lottery players we are all winners.”
Ruby said: “I am thrilled to have been asked to design these maps for The National Lottery’s 25th Birthday. It’s easy to forget just how much of an impact that the money from National Lottery players has on our local communities. It was great fun drawing both well known buildings and hidden gems, and I hope that people recognise places that matter to them.”
The full list of projects in the North East map are:
Angel of the North
Sage Gateshead
Baltic Centre for Contemporary Arts
National Glass Centre
Beamish, the Living Museum of the North
Roker Pier
Kielder Water
Durham Cathedral
North Pennines
The Sill - National Landscape Discovery Centre
Great North Museum
Waygood
International Centre for Life
Gateshead Millennium Bridge
To find out more visit www.lotterygoodcauses.org.uk