Project: GO CUBA
Director: NOMO Films
DP: NOMO Films
Music by Kristijan Funaric
We danced and partied at the infamous Las Parradillas fiesta on Christmas eve, I caught a type of poison ivy from brushing the venemous Guao plant (while trying to get some footage), and we got lost wandering through the old Havana streets meeting fantastic people along the way. If you get the chance to visit Cuba then GO! What a place... After hearing news of the changing relationship between the Cubans and Americans we decided to grab a flight and travel over the xmas break for a couple of weeks. This is the resulting video...


© Copyright 2000-2008 by The University of Washington. Written by Joseph Felsenstein. Permission is granted to copy this document provided that no fee is charged for it and that this copyright notice is not removed.
This program computes distances between trees. Two distances are computed, the Branch Score Distance of Kuhner and Felsenstein (1994), and the more widely known Symmetric Difference of Robinson and Foulds (1981). The Branch Score Distance uses branch lengths, and can only be calculated when the trees have lengths on all branches. The Symmetric Difference does not use branch length information, only the tree topologies. It must also be borne in mind that neither distance has any immediate statistical interpretation -- we cannot say whether a larger distance is significantly larger than a smaller one.
These distances are computed by considering all possible branches that could exist on the the two trees. Each branch divides the set of species into two groups -- the ones connected to one end of the branch and the ones connected to the other. This makes a partition of the full set of species. The following tree (in Newick notation)
((A,C),(D,(B,E)))has two internal branches. One induces the partition {A, C | B, D, E} and the other induces the partition {A, C, D | B, E}. A different tree with the same set of species,
(((A,D),C),(B,E))has internal branches that correspond to the two partitions {A, C, D | B, E} and {A, D | B, C, E}. Note that the other branches, all of which are external branches, induce partitions that separate one species from all the others. Thus there are 5 partitions like this: {C | A, B, D, E} on each of these trees. These are always present on all trees, provided that each tree has each species at the end of its own branch.
In the case of the Branch Score distance, each partition that does exist on a tree also has a branch length associated with it. Thus if the tree is
(((A:0.1,D:0.25):0.05,C:0.01):0.2,(B:0.3,E:0.8):0.2)the list of partitions and their branch lengths is:
| {A | B, C, D, E} | 0.1 |
| {D | A, B, C, E} | 0.25 |
| {A, D | B, C, E} | 0.05 |
| {C | A, B, D, E} | 0.01 |
| {A, D, C | B, E} | 0.4 |
| {B | A, C, D, E} | 0.3 |
| {E | A, B, C, D} | 0.8 |
Note that the tree is being treated as unrooted here, so that the branch lengths on either side of the rootmost node are summed up to get a branch length of 0.4.
The Branch Score Distance imagines us as having made a list of all possible partitions, the ones shown above and also all 7 other possible partitions, which correspond to branches that are not found in this tree. These are assigned branch lengths of 0. For two trees, we imagine constructing these lists, and then summing the squared differences between the branch lengths. Thus if both trees have branches {A, D | B, C, E}, the sum contains the square of the difference between the branch lengths. If one tree has the branch and the other doesn't, it contains the square of the difference between the branch length and zero (in other words, the square of that branch length). If both trees do not have a particular branch, nothing is added to the sum because the difference is then between 0 and 0.
The Branch Score Distance takes this sum of squared differences and computes its square root. Note that it has some desirable properties. When small branches differ in tree topology, it is not very big. When branches are both present but differ in length, it is affected.
The Symmetric Difference is simply a count of how many partitions there are, among the two trees, that are on one tree and not on the other. In the example above there are two partitions, {A, C | B, D, E} and {A, D | B, C, E}, each of which is present on only one of the two trees. The Symmetric Difference between the two trees is therefore 2. When the two trees are fully resolved bifurcating trees, their symmetric distance must be an even number; it can range from 0 to twice the number of internal branches, so that for n species it can be as large as 2n-6 (for 3 species or more).
Note the relationship between the two distances. If all branches in the two trees have length 1.0, the Branch Score Distance is the square root of the Symmetric Difference, as each branch that is present in one but not in the other results in 1.0 being added to the sum of squared differences.
We have assumed that nothing is lost if the trees are treated as unrooted trees. It is easy to define a counterpart to the Branch Score Distance and one to the Symmetric Difference for these rooted trees. Each branch then defines a set of species, namely the clade defined by that branch. Thus if the first of the two trees above were considered as a rooted tree it would define the three clades {A, C}, {B, D, E}, and {B, E}. The Branch Score Distance is computed from the branch lengths for all possible sets of species, with 0 put for each set that does not occur on that tree. The table above will be nearly the same, but with two entries instead of one for the sets on either side of the root, {A C D} and {B E}. The Symmetric Difference between two rooted trees is simply the count of the number of clades that are defined by one but not by the other. For the second tree the clades would be {A, D}, {B, C, E}, and {B, E}. The Symmetric Difference between these two rooted trees would then be 4.
Although the examples we have discussed have involved fully bifurcating trees, the input trees can have multifurcations. This does not cause any complication for the Branch Score Distance. For the Symmetric Difference, it can lead to distances that are odd numbers.
However, note one strong restriction. The trees should all have the same list of species. If you use one set of species in the first two trees, and another in the second two, and choose distances for adjacent pairs, the distances will be incorrect and will depend on the order of these pairs in the input tree file, in odd ways.
The program reads one or two input tree files. If there is one input tree file, its default name is intree. If there are two their default names are intree and intree2. The tree files may either have the number of trees on their first line, or not. If the number of trees is given, it is actually ignored and all trees in the tree file are considered, even if there are more trees than indicated by the number. There is no maximum number of trees that can be processed but, if you feed in too many, there may be an error message about running out of memory. The problem is particularly acute if you choose the option to examine all possible pairs of trees in an input tree file, or all possible pairs of trees one from each of two input tree files. Thus if there are 1,000 trees in the input tree file, keep in mind that all possible pairs means 1,000,000 pairs to be examined!
Earlier versions of this program had an option to change the value of the variable maxgrp to overcome a hard-wired limit on the number of species the program can handle. This feature has been removed as it is no longer necessary.
The options are selected from a menu, which looks like this:
Tree distance program, version 3.69 Settings for this run: D Distance Type: Branch Score Distance O Outgroup root: No, use as outgroup species 1 R Trees to be treated as Rooted: No T Terminal type (IBM PC, ANSI, none): ANSI 1 Print indications of progress of run: Yes 2 Tree distance submenu: Distance between adjacent pairs Are these settings correct? (type Y or the letter for one to change) |
The D option chooses which distance measure to use. The Branch Score Distance is the default. If it is in force, and any of the trees which are read in have even one branch that fails to have a length, the program will terminate with an error. If the Symmetric Difference option is chosen, no check of branch lengths is made.
The O option allows you to root the trees using an outgroup. It is specified by giving its number, where the species are numbered in the order they appear in the first tree. Outgroup-rooting all the trees does not affect the distances if the trees are treated as unrooted, and if it is done and trees are treated as rooted, the distances turn out to be the same as the unrooted ones. Thus it is unlikely that you will find this option of interest.
The R option controls whether the Symmetric Distance that is computed is to treat the trees as unrooted or rooted. Unrooted is the default.
The terminal type (0) and progress (1) options do not need description here.
Option 2 controls how many tree files are read in, which trees are to be compared, and how the output is to be presented. It causes another menu to appear:
Tree Pairing Submenu: A Distances between adjacent pairs in tree file. P Distances between all possible pairs in tree file. C Distances between corresponding pairs in one tree file and another. L Distances between all pairs in one tree file and another. Choose one: (A,P,C,L) |
Option A computes the distances between successive pairs of trees in the tree input file -- between trees 1 and 2, trees 3 and 4, trees 5 and 6, and so on. If there are an odd number of trees in the input tree file the last tree will be ignored and a warning message printed to remind the user that nothing was done with it.
Option P computes distances between all pairs of trees in the input tree file. Thus with 10 trees 10 x 10 = 100 distances will be computed, including distances between each tree and itself.
Option C takes input from two tree files and computes distances between corresponding members of the two tree files. Thus distances will be computed between tree 1 of the first tree file and tree 1 of the second one, between tree 2 of the first file and tree 2 of the second one, and so on. If the number of trees in the two files differs, the extra trees in the file that has more of them are ignored and a warning is printed out.
Option L computes distances between all pairs of trees, where one tree is taken from one tree file and the other from the other tree file. Thus if the first tree file has 7 trees and the second has 5 trees, 7 x 5 = 35 different distances will be computed.
If option 2 is not selected, the program defaults to looking at one tree file and computing distances of adjacent pairs (so that option A is the default).
The results of the analysis are written onto an output file whose default file name is outfile.
If any of the four types of analysis are selected, the program asks the user how they want the results presented. Here is that menu for options P or L:
Distances output options: F Full matrix. V One pair per line, verbose. S One pair per line, sparse. Choose one: (F,V,S) |
The Full matrix (choice F) is a table showing all distances. It is written onto the output file. The table is presented as groups of 10 columns. Here is the Full matrix for the 12 trees in the input tree file which is given as an example at the end of this page.
Tree distance program, version 3.69 Symmetric differences between all pairs of trees in tree file: 1 2 3 4 5 6 7 8 9 10 \------------------------------------------------------------ 1 | 0 4 2 10 10 10 10 10 10 10 2 | 4 0 2 10 8 10 8 10 8 10 3 | 2 2 0 10 10 10 10 10 10 10 4 | 10 10 10 0 2 2 4 2 4 0 5 | 10 8 10 2 0 4 2 4 2 2 6 | 10 10 10 2 4 0 2 2 4 2 7 | 10 8 10 4 2 2 0 4 2 4 8 | 10 10 10 2 4 2 4 0 2 2 9 | 10 8 10 4 2 4 2 2 0 4 10 | 10 10 10 0 2 2 4 2 4 0 11 | 2 2 0 10 10 10 10 10 10 10 12 | 10 10 10 2 4 2 4 0 2 2 11 12 \------------ 1 | 2 10 2 | 2 10 3 | 0 10 4 | 10 2 5 | 10 4 6 | 10 2 7 | 10 4 8 | 10 0 9 | 10 2 10 | 10 2 11 | 0 10 12 | 10 0 |
The Full matrix is only available for analyses P and L (not for A or C).
Option V (Verbose) writes one distance per line. The Verbose output is the default. Here it is for the example data set given below:
Tree distance program, version 3.69 Symmetric differences between adjacent pairs of trees: Trees 1 and 2: 4 Trees 3 and 4: 10 Trees 5 and 6: 4 Trees 7 and 8: 4 Trees 9 and 10: 4 Trees 11 and 12: 10 |
Option S (Sparse or terse) is similar except that all that is given on each line are the numbers of the two trees and the distance, separated by blanks. This may be a convenient format if you want to write a program to read these numbers in, and you want to spare yourself the effort of having the program wade through the words on each line in the Verbose output. The first four lines of the Sparse output are titles that your program would want to skip past. Here is the Sparse output for the example trees.
1 2 4 3 4 10 5 6 4 7 8 4 9 10 4 11 12 10 |
Treedist was originally written by Dan Fineman, with fixes by Doug Buxton. We also hope in the future to compute a distance based on quartets shared and not shared by trees (implicit in the work of Estabrook, McMorris, and Meacham, 1985). We will also implement the tree distance of Robinson and Foulds (1979), which is like the Branch Score Distance but uses absolute values of differences between branch lengths rather than sums of squares of differences.
(A,(B,(H,(D,(J,(((G,E),(F,I)),C)))))); (A,(B,(D,((J,H),(((G,E),(F,I)),C))))); (A,(B,(D,(H,(J,(((G,E),(F,I)),C)))))); (A,(B,(E,(G,((F,I),((J,(H,D)),C)))))); (A,(B,(E,(G,((F,I),(((J,H),D),C)))))); (A,(B,(E,((F,I),(G,((J,(H,D)),C)))))); (A,(B,(E,((F,I),(G,(((J,H),D),C)))))); (A,(B,(E,((G,(F,I)),((J,(H,D)),C))))); (A,(B,(E,((G,(F,I)),(((J,H),D),C))))); (A,(B,(E,(G,((F,I),((J,(H,D)),C)))))); (A,(B,(D,(H,(J,(((G,E),(F,I)),C)))))); (A,(B,(E,((G,(F,I)),((J,(H,D)),C))))); |
The output from the setting in the D menu choice of the Symmetric Difference for this test set is given above (it is the Verbose output example).
This data set is the first part of the previous one, but with branch lengths on the trees, to serve as an example for the Branch Score distance.
(A:0.1,(B:0.1,(H:0.1,(D:0.1,(J:0.1,(((G:0.1,E:0.1):0.1,(F:0.1,I:0.1):0.1):0.1, C:0.1):0.1):0.1):0.1):0.1):0.1); (A:0.1,(B:0.1,(D:0.1,((J:0.1,H:0.1):0.1,(((G:0.1,E:0.1):0.1, (F:0.1,I:0.1):0.1):0.1,C:0.1):0.1):0.1):0.1):0.1); (A:0.1,(B:0.1,(D:0.1,(H:0.1,(J:0.1,(((G:0.1,E:0.1):0.1,(F:0.1,I:0.1):0.1):0.1, C:0.1):0.1):0.1):0.1):0.1):0.1); (A:0.1,(B:0.1,(E:0.1,(G:0.1,((F:0.1,I:0.1):0.1,((J:0.1,(H:0.1,D:0.1):0.1):0.1, C:0.1):0.1):0.1):0.1):0.1):0.1); (A:0.1,(B:0.1,(E:0.1,(G:0.1,((F:0.1,I:0.1):0.1,(((J:0.1,H:0.1):0.1,D:0.1):0.1, C:0.1):0.1):0.1):0.1):0.1):0.1); (A:0.1,(B:0.1,(E:0.1,((F:0.1,I:0.1):0.1,(G:0.1,((J:0.1,(H:0.1,D:0.1):0.1):0.1, C:0.1):0.1):0.1):0.1):0.1):0.1); (A:0.1,(B:0.1,(E:0.1,((F:0.1,I:0.1):0.1,(G:0.1,(((J:0.1,H:0.1):0.1,D:0.1):0.1, C:0.1):0.1):0.1):0.1):0.1):0.1); (A:0.1,(B:0.1,(E:0.1,((G:0.1,(F:0.1,I:0.1):0.1):0.1,((J:0.1,(H:0.1, D:0.1):0.1):0.1,C:0.1):0.1):0.1):0.1):0.1); (A:0.1,(B:0.1,(E:0.1,((G:0.1,(F:0.1,I:0.1):0.1):0.1,(((J:0.1,H:0.1):0.1, D:0.1):0.1,C:0.1):0.1):0.1):0.1):0.1); (A:0.1,(B:0.1,(E:0.1,(G:0.1,((F:0.1,I:0.1):0.1,((J:0.1,(H:0.1,D:0.1):0.1):0.1, C:0.1):0.1):0.1):0.1):0.1):0.1); (A:0.1,(B:0.1,(D:0.1,(H:0.1,(J:0.1,(((G:0.1,E:0.1):0.1,(F:0.1,I:0.1):0.1):0.1, C:0.1):0.1):0.1):0.1):0.1):0.1); (A:0.1,(B:0.1,(E:0.1,((G:0.1,(F:0.1,I:0.1):0.1):0.1,((J:0.1,(H:0.1, D:0.1):0.1):0.1,C:0.1):0.1):0.1):0.1):0.1); |
This was run using the default Branch Score distance, and asking in option 2 for the P (all pairs in file) setting and the F (Full matrix output) setting.
Tree distance program, version 3.69 Branch score distances between all pairs of trees in tree file: 1 2 3 4 5 6 7 \------------------------------------------------------------------------------------ 1 | 0 0.2 0.141421 0.316228 0.316228 0.316228 0.316228 2 | 0.2 0 0.141421 0.316228 0.282843 0.316228 0.282843 3 | 0.141421 0.141421 0 0.316228 0.316228 0.316228 0.316228 4 | 0.316228 0.316228 0.316228 0 0.141421 0.141421 0.2 5 | 0.316228 0.282843 0.316228 0.141421 0 0.2 0.141421 6 | 0.316228 0.316228 0.316228 0.141421 0.2 0 0.141421 7 | 0.316228 0.282843 0.316228 0.2 0.141421 0.141421 0 8 | 0.316228 0.316228 0.316228 0.141421 0.2 0.141421 0.2 9 | 0.316228 0.282843 0.316228 0.2 0.141421 0.2 0.141421 10 | 0.316228 0.316228 0.316228 0 0.141421 0.141421 0.2 11 | 0.141421 0.141421 0 0.316228 0.316228 0.316228 0.316228 12 | 0.316228 0.316228 0.316228 0.141421 0.2 0.141421 0.2 8 9 10 11 12 \------------------------------------------------------------ 1 | 0.316228 0.316228 0.316228 0.141421 0.316228 2 | 0.316228 0.282843 0.316228 0.141421 0.316228 3 | 0.316228 0.316228 0.316228 0 0.316228 4 | 0.141421 0.2 0 0.316228 0.141421 5 | 0.2 0.141421 0.141421 0.316228 0.2 6 | 0.141421 0.2 0.141421 0.316228 0.141421 7 | 0.2 0.141421 0.2 0.316228 0.2 8 | 0 0.141421 0.141421 0.316228 0 9 | 0.141421 0 0.2 0.316228 0.141421 10 | 0.141421 0.2 0 0.316228 0.141421 11 | 0.316228 0.316228 0.316228 0 0.316228 12 | 0 0.141421 0.141421 0.316228 0 |


gdal2tiles.py
Generates directory with TMS tiles, KMLs and simple web viewers.
Synopsis
gdal2tiles.py [-p profile] [-r resampling] [-s srs] [-z zoom]
[-e] [-a nodata] [-v] [-q] [-h] [-k] [-n] [-u url]
[-w webviewer] [-t title] [-c copyright]
[--processes=NB_PROCESSES] [--mpi] [--xyz]
[--tilesize=PIXELS] [--tmscompatible]
[-g googlekey] [-b bingkey] input_file [output_dir] [COMMON_OPTIONS]
Description
This utility generates a directory with small tiles and metadata, following the OSGeo Tile Map Service Specification. Simple web pages with viewers based on Google Maps, OpenLayers and Leaflet are generated as well - so anybody can comfortably explore your maps on-line and you do not need to install or configure any special software (like MapServer) and the map displays very fast in the web browser. You only need to upload the generated directory onto a web server.
GDAL2Tiles also creates the necessary metadata for Google Earth (KML SuperOverlay), in case the supplied map uses EPSG:4326 projection.
World files and embedded georeferencing is used during tile generation, but you can publish a picture without proper georeferencing too.
Note
Inputs with non-Byte data type (i.e. Int16
, UInt16
,...) will be clamped to
the Byte
data type, causing wrong results. To avoid this it is necessary to
rescale input to the Byte
data type using gdal_translate utility.
Note
Config options of the input drivers may have an effect on the output of gdal2tiles. An example driver config option is GDAL_PDF_DPI, which can be found at Configuration options
- -p <PROFILE>, --profile=<PROFILE>
Tile cutting profile (mercator, geodetic, raster) - default 'mercator' (Google Maps compatible).
Starting with GDAL 3.2, additional profiles are available from tms_XXXX.json files placed in GDAL data directory (provided all zoom levels use same origin, tile dimensions, and resolution between consecutive zoom levels vary by a factor of two).
- -r <RESAMPLING>, --resampling=<RESAMPLING>
Resampling method (average, near, bilinear, cubic, cubicspline, lanczos, antialias, mode, max, min, med, q1, q3) - default 'average'.
- -s <SRS>, --s_srs=<SRS>
The spatial reference system used for the source input data.
- --xyz
Generate XYZ tiles (OSM Slippy Map standard) instead of TMS. In the default mode (TMS), tiles at y=0 are the southern-most tiles, whereas in XYZ mode (used by OGC WMTS too), tiles at y=0 are the northern-most tiles.
New in version 3.1.
- -d, --tmscompatible
When using the geodetic profile, specifies the base resolution as 0.703125 or 2 tiles at zoom level 0.
- -z <ZOOM>, --zoom=<ZOOM>
Zoom levels to render (format:'2-5', '10-' or '10').
- -e, --resume
Resume mode. Generate only missing files.
- -a <NODATA>, --srcnodata=<NODATA>
Value in the input dataset considered as transparent. If the input dataset had already an associate nodata value, it is overridden by the specified value.
- -v, --verbose
Generate verbose output of tile generation.
Starting with GDAL 3.7, that verbose output is emitted through the
logging.getLogger("gdal2tiles")
object.
- -x, --exclude
Exclude transparent tiles from result tileset.
- -q, --quiet
Disable messages and status to stdout
New in version 2.1.
- --processes=<NB_PROCESSES>
Number of parallel processes to use for tiling, to speed-up the computation.
New in version 2.3.
- --mpi
Assume launched by mpiexec, enable MPI parallelism and ignore --processes. Requires working MPI environment and the MPI for Python (mpi4py) package. User should set GDAL_CACHEMAX to an appropriate cache size per process based on memory per node and the number of processes launched per node.
New in version 3.5.
- --tilesize=<PIXELS>
Width and height in pixel of a tile. Default is 256.
New in version 3.1.
- --tiledriver=<DRIVER>
Which output driver to use for the tiles, determines the file format of the tiles. Currently PNG and WEBP are supported. Default is PNG. Additional configuration for the WEBP driver are documented below.
New in version 3.6.
- -h, --help
Show help message and exit.
- --version
Show program's version number and exit.
KML (Google Earth) options
Options for generated Google Earth SuperOverlay metadata
- -k, --force-kml
Generate KML for Google Earth - default for 'geodetic' profile and 'raster' in EPSG:4326. For a dataset with different projection use with caution!
- -n, --no-kml
Avoid automatic generation of KML files for EPSG:4326.
- -u <URL>, --url=<URL>
URL address where the generated tiles are going to be published.
Web viewer options
Options for generated HTML viewers a la Google Maps
- -w <WEBVIEWER>, --webviewer=<WEBVIEWER>
Web viewer to generate (all, google, openlayers, leaflet, mapml, none) - default 'all'.
- -t <TITLE>, --title=<TITLE>
Title of the map.
- -c <COPYRIGHT>, --copyright=<COPYRIGHT>
Copyright for the map.
- -g <GOOGLEKEY>, --googlekey=<GOOGLEKEY>
Google Maps API key from http://code.google.com/apis/maps/signup.html.
- -b <BINGKEY>, --bingkey=<BINGKEY>
Bing Maps API key from https://www.bingmapsportal.com/
Note
gdal2tiles.py is a Python script that needs to be run against Python GDAL binding.
MapML options
MapML support is new to GDAL 3.2. When --webviewer=mapml is specified, --xyz is implied, as well as --tmscompatible if --profile=geodetic.
The following profiles are supported:
mercator: mapped to OSMTILE MapML tiling scheme
geodetic: mapped to WGS84 MapML tiling scheme
APSTILE: from the tms_MapML_APSTILE.json data file
The generated MapML file in the output directory is mapml.mapl
Available options are:
- --mapml-template=<filename>
Filename of a template mapml file where variables will be substituted. If not specified, the generic template_tiles.mapml file from GDAL data resources will be used
The --url option is also used to substitute ${URL}
in the template MapML file.
WEBP options
WEBP tiledriver support is new to GDAL 3.6. It is enabled by using --tiledriver=WEBP.
The following configuration options are available to further customize the webp output:
- --webp-quality=<QUALITY>
QUALITY is a integer between 1-100. Default is 75.
- --webp-lossless
Use WEBP lossless compression, default is lossy
Note
GDAL WEBP driver documentation can be consulted
Examples
Basic example:
gdal2tiles.py --zoom=2-5 input.tif output_folder
MapML generation:
gdal2tiles.py --zoom=16-18 -w mapml -p APSTILE --url "https://example.com" input.tif output_folder
MPI example:
mpiexec -n $NB_PROCESSES gdal2tiles.py --mpi --config GDAL_CACHEMAX 500 --zoom=2-5 input.tif output_folder


At your service – the changing face of the economy
by Statistics New Zealand21 November 2019
In the 1970s, agriculture made the largest single contribution to New Zealand’s economy, but other industries, especially services, have become more dominant in recent years, Stats NZ said today.
A new online tool shows the changing structure of the economy and contributions to gross domestic product (GDP) from 1972, when the time series started, to 2018.
“Using the visual tool, you can see which industries contributed most to the production measure of GDP in a given year. Agriculture remains a large part of the economy, especially when commodity prices are high, but is no longer top of the list as it was in 1972,” national accounts senior manager Gary Dunnet said.
Access the tool Which industries contributed to New Zealand’s GDP?
Agriculture is part of the primary sector, which includes farming, forestry, fishing, and mining. Together, these made up 12 percent of the economy in 1972, compared with 7 percent in 2018, as other sectors have grown more rapidly.
However, the primary sector does not include further processing of farm products, such as raw milk or livestock, which fall under food and beverage manufacturing (good producing), nor moving goods to market (part of distribution services).
Service industries now represent about two-thirds (65 percent) of the economy, compared with about half (52 percent) in the 1970s. Services range from rental, hiring, and real estate services, to health care, transport, and professional and scientific services.
The new tool lets you choose a year and the bar graph displays the top 10 industries that contributed most to GDP for that year (figures 1 and 2 show 1972 and 2018 as examples). A doughnut chart at the side shows the relative shares of broad industry groups and taxes for that same period.
Figure 1
Text alternative for figure 1, top 10 industries in 1972 and share of the economy in 1972.
“Taxes on production contributed 1 percent to GDP in 1972. This has increased in contribution over time, now sitting at around 9 percent. This rise was mainly due to the introduction of the goods and services tax (GST) in 1986 at 10 percent, and later increases in the rate to 15 percent,” Mr Dunnet said.
Figure 2
Text alternative for figure 2, top 10 industries in 2018 and share of the economy in 2018.
To see other years, view the tool Which industries contributed to New Zealand’s GDP?
Data used for this tool is in current prices, so is not adjusted for inflation over time. Data is sourced from the National accounts (industry production and investment): Year ended March 2018.
Text alternative for figure 1, top 10 industries in 1972 and share of the economy in 1972
The horizontal bar graph shows the top 10 industries that contributed most to the production measure of GDP in 1972 in descending order. The x-axis gives contribution to value added in million dollars. The y-axis lists top 10 industries in descending order: Agriculture – 660; Retail trade – 512; Food, beverage and tobacco product manufacturing – 491; Construction – 452; Wholesale trade – 385; Transport, postal and warehousing – 380; Petroleum chemical and rubber manufacturing – 341; Owner-occupied property organisation – 289; Education and training – 269; Information media and telecommunications – 241; Rental hiring and real estate services – 241.
Beside the bar graph a doughnut chart shows the share of each broad industry group to the total production economy of New Zealand in 1972: Service industries 52%; Goods producing 35%; Primary 12%; Taxes 1%.
Text alternative for figure 2, top 10 industries in 2018 and share of the economy in 2018
The horizontal bar graph shows the top 10 industries that contributed most to the production measure of GDP in 2018. The x-axis gives contribution to value added in million dollars. The y-axis lists top 10 industries in descending order: Professional scientific and technical services – 23,152; Rental hiring and real estate services – 21,171; Construction – 18,540; Owner-occupied property organisation – 18,321; Financial and insurance services – 16,973; Health care and social assistance – 16,843; Wholesale trade – 14,202; Transport, postal and warehousing – 13,012; Retail trade – 12,998; Agriculture – 12,431.
Beside the bar graph a doughnut chart shows the share of each broad industry group to the total production economy of New Zealand in 2018: Service industries 65%; Goods producing 19%; Taxes 9%; Primary 7%.
Ends


Here's where administrators can create cards for events. These can be shared with single users or in decks


Around the World in 80 Days
by Jules Verne
Chapter 26: In Which Phileas Fogg and Party Travel by the Pacific Railroad
Additional Information
- Year Published: 1873
- Language: English
- Country of Origin: France
- Source: Verne, J. (1873) Around the World in 80 Days Paris, France: Routledge
-
Readability:
- Flesch–Kincaid Level: 8.0
- Word Count: 1,651
- Genre: Adventure
- Keywords: 19th century literature, adventure, french literature
- ✎ Cite This
Downloads
"From ocean to ocean"—so say the Americans; and these four words compose the general designation of the "great trunk line" which crosses the entire width of the United States. The Pacific Railroad is, however, really divided into two distinct lines: the Central Pacific, between San Francisco and Ogden, and the Union Pacific, between Ogden and Omaha. Five main lines connect Omaha with New York.
New York and San Francisco are thus united by an uninterrupted metal ribbon, which measures no less than three thousand seven hundred and eighty–six miles. Between Omaha and the Pacific the railway crosses a territory which is still infested by Indians and wild beasts, and a large tract which the Mormons, after they were driven from Illinois in 1845, began to colonise.
The journey from New York to San Francisco consumed, formerly, under the most favourable conditions, at least six months. It is now accomplished in seven days.
It was in 1862 that, in spite of the Southern Members of Congress, who wished a more southerly route, it was decided to lay the road between the forty–first and forty–second parallels. President Lincoln himself fixed the end of the line at Omaha, in Nebraska. The work was at once commenced, and pursued with true American energy; nor did the rapidity with which it went on injuriously affect its good execution. The road grew, on the prairies, a mile and a half a day. A locomotive, running on the rails laid down the evening before, brought the rails to be laid on the morrow, and advanced upon them as fast as they were put in position.
The Pacific Railroad is joined by several branches in Iowa, Kansas, Colorado, and Oregon. On leaving Omaha, it passes along the left bank of the Platte River as far as the junction of its northern branch, follows its southern branch, crosses the Laramie territory and the Wahsatch Mountains, turns the Great Salt Lake, and reaches Salt Lake City, the Mormon capital, plunges into the Tuilla Valley, across the American Desert, Cedar and Humboldt Mountains, the Sierra Nevada, and descends, via Sacramento, to the Pacific—its grade, even on the Rocky Mountains, never exceeding one hundred and twelve feet to the mile.
Such was the road to be traversed in seven days, which would enable Phileas Fogg—at least, so he hoped—to take the Atlantic steamer at New York on the 11th for Liverpool.
The car which he occupied was a sort of long omnibus on eight wheels, and with no compartments in the interior. It was supplied with two rows of seats, perpendicular to the direction of the train on either side of an aisle which conducted to the front and rear platforms. These platforms were found throughout the train, and the passengers were able to pass from one end of the train to the other. It was supplied with saloon cars, balcony cars, restaurants, and smoking–cars; theatre cars alone were wanting, and they will have these some day.
Book and news dealers, sellers of edibles, drinkables, and cigars, who seemed to have plenty of customers, were continually circulating in the aisles.
The train left Oakland station at six o'clock. It was already night, cold and cheerless, the heavens being overcast with clouds which seemed to threaten snow. The train did not proceed rapidly; counting the stoppages, it did not run more than twenty miles an hour, which was a sufficient speed, however, to enable it to reach Omaha within its designated time.
There was but little conversation in the car, and soon many of the passengers were overcome with sleep. Passepartout found himself beside the detective; but he did not talk to him. After recent events, their relations with each other had grown somewhat cold; there could no longer be mutual sympathy or intimacy between them. Fix's manner had not changed; but Passepartout was very reserved, and ready to strangle his former friend on the slightest provocation.
Snow began to fall an hour after they started, a fine snow, however, which happily could not obstruct the train; nothing could be seen from the windows but a vast, white sheet, against which the smoke of the locomotive had a greyish aspect.
At eight o'clock a steward entered the car and announced that the time for going to bed had arrived; and in a few minutes the car was transformed into a dormitory. The backs of the seats were thrown back, bedsteads carefully packed were rolled out by an ingenious system, berths were suddenly improvised, and each traveller had soon at his disposition a comfortable bed, protected from curious eyes by thick curtains. The sheets were clean and the pillows soft. It only remained to go to bed and sleep which everybody did—while the train sped on across the State of California.
The country between San Francisco and Sacramento is not very hilly. The Central Pacific, taking Sacramento for its starting–point, extends eastward to meet the road from Omaha. The line from San Francisco to Sacramento runs in a north–easterly direction, along the American River, which empties into San Pablo Bay. The one hundred and twenty miles between these cities were accomplished in six hours, and towards midnight, while fast asleep, the travellers passed through Sacramento; so that they saw nothing of that important place, the seat of the State government, with its fine quays, its broad streets, its noble hotels, squares, and churches.
The train, on leaving Sacramento, and passing the junction, Roclin, Auburn, and Colfax, entered the range of the Sierra Nevada. 'Cisco was reached at seven in the morning; and an hour later the dormitory was transformed into an ordinary car, and the travellers could observe the picturesque beauties of the mountain region through which they were steaming. The railway track wound in and out among the passes, now approaching the mountain–sides, now suspended over precipices, avoiding abrupt angles by bold curves, plunging into narrow defiles, which seemed to have no outlet. The locomotive, its great funnel emitting a weird light, with its sharp bell, and its cow–catcher extended like a spur, mingled its shrieks and bellowings with the noise of torrents and cascades, and twined its smoke among the branches of the gigantic pines.
There were few or no bridges or tunnels on the route. The railway turned around the sides of the mountains, and did not attempt to violate nature by taking the shortest cut from one point to another.
The train entered the State of Nevada through the Carson Valley about nine o'clock, going always northeasterly; and at midday reached Reno, where there was a delay of twenty minutes for breakfast.
From this point the road, running along Humboldt River, passed northward for several miles by its banks; then it turned eastward, and kept by the river until it reached the Humboldt Range, nearly at the extreme eastern limit of Nevada.
Having breakfasted, Mr. Fogg and his companions resumed their places in the car, and observed the varied landscape which unfolded itself as they passed along the vast prairies, the mountains lining the horizon, and the creeks, with their frothy, foaming streams. Sometimes a great herd of buffaloes, massing together in the distance, seemed like a moveable dam. These innumerable multitudes of ruminating beasts often form an insurmountable obstacle to the passage of the trains; thousands of them have been seen passing over the track for hours together, in compact ranks. The locomotive is then forced to stop and wait till the road is once more clear.
This happened, indeed, to the train in which Mr. Fogg was travelling. About twelve o'clock a troop of ten or twelve thousand head of buffalo encumbered the track. The locomotive, slackening its speed, tried to clear the way with its cow–catcher; but the mass of animals was too great. The buffaloes marched along with a tranquil gait, uttering now and then deafening bellowings. There was no use of interrupting them, for, having taken a particular direction, nothing can moderate and change their course; it is a torrent of living flesh which no dam could contain.
The travellers gazed on this curious spectacle from the platforms; but Phileas Fogg, who had the most reason of all to be in a hurry, remained in his seat, and waited philosophically until it should please the buffaloes to get out of the way.
Passepartout was furious at the delay they occasioned, and longed to discharge his arsenal of revolvers upon them.
"What a country!" cried he. "Mere cattle stop the trains, and go by in a procession, just as if they were not impeding travel! Parbleu! I should like to know if Mr. Fogg foresaw this mishap in his programme! And here's an engineer who doesn't dare to run the locomotive into this herd of beasts!"
The engineer did not try to overcome the obstacle, and he was wise. He would have crushed the first buffaloes, no doubt, with the cow–catcher; but the locomotive, however powerful, would soon have been checked, the train would inevitably have been thrown off the track, and would then have been helpless.
The best course was to wait patiently, and regain the lost time by greater speed when the obstacle was removed. The procession of buffaloes lasted three full hours, and it was night before the track was clear. The last ranks of the herd were now passing over the rails, while the first had already disappeared below the southern horizon.
It was eight o'clock when the train passed through the defiles of the Humboldt Range, and half–past nine when it penetrated Utah, the region of the Great Salt Lake, the singular colony of the Mormons.


about 2 hours
Trees are the type of data structure that will allow you to store and process objects and tasks dealing with numbers, strings and everything in between. The motivation here is to understand that a tree is a type of data structure that represents data in a top down arrangement, similar to a hierarchy.
https://google.com uses a type of tree called a ‘trie’ to auto-complete what you are typing into the search bar. By seeing the first few letters you’ve typed, it can check it’s record tree of possible letters that can come after. So if you type “how do I”, their record tree for “how do I” has child nodes each contain a possible following set of characters, like “learn to draw” or “tie a tie” or “build a shelf”. The same can be said for auto-complete in many texting apps.
When records are kept in order in a binary search tree (or BST), everything on one side of any branch is a lower value, and everything on the other side is a higher value, so finding something again is extremely efficient.
Companies that care about spacial positioning are likely to use something called quadtrees or octrees which are the 2d & 3d parallels of a BST (so you may see this used for optimizing physics simulations e.g. in game engines like Unity and Unreal.)
Agari used Radix tries to optimize their IP address search engine - their efficiency went from 0(n) (searching an array) to O(log n).
Participants will be able to: identify, implement and differentiate: trees, binary tree traversal, binary heaps, & tries.
Work through the materials provided in ‘materials’. This should take 30-50 minutes.
Trees associate every object to a node in a tree, and the number of children stemming from that node are referred to as its degree. There are several types of trees, including Binary Search Trees (BST) and with Binary Search Trees you can perform insertions, deletions, and retrievals.
Trees are a common interview question. They can be used when you want to store data that takes the shape of a hierarchy. Unlike arrays, and linked lists, trees are a non-linear data structure. Organizing keys in the form of a tree allows us to search for a given key quicker than a linked list, but slower than searching through an array.
Self-balancing search trees and Red-Black trees produce an upper bound of O(Log n)for search. Trees also provide a faster key insertion and deletion time than arrays, but slightly slower than unordered linked lists.
The common uses of trees include manipulating hierarchical data, making information easy to search (tree traversal), manipulating sorted lists of data, compositing digital images for visual effects, and router algorithms.
Cracking the Coding Interview 6th Ed., Ch.4 | Trees & Graphs pages 100 - 107
Ask a mentor, volunteer, or apprentice for a code review of your Tree implementation.
Create a cheat sheet about the types of trees, binary tree traversal, binary heaps, tries, graphs, and graph search.


class AssetLocationComponent : Component, Poolable
(source)
Class that describes an asset to be loaded into memory client side
| <init> |
AssetLocationComponent(descriptor: AssetDescriptor<*>) AssetLocationComponent()
Class that describes an asset to be loaded into memory client side |
| descriptor |
var descriptor: AssetDescriptor<*>? |
| fulfilled |
var fulfilled: Boolean |
| reset |
fun reset(): Unit |


First, lets start with 'What is a loop?' Computer programming languages, such as ruby, often need to execute the same block of code multiple times. Instead of repeating yourself over and over again, you can use a loop. Now lets learn about some of those loop statements!
A while loop will continue to complete the code while the condition remains true. When the condition becomes false, the loop will stop.
A until loop will continue to complete the code until the condition is met (true). After the condition is met, the loop will stop.
A times loop will run the code however many times is input by the user.
The each loop will take a list of variables and run the code for each of them. Once all of the variables have been run through the code, the loop will stop.
The for loop, otherwise known as the for/in loop, will complete the code for all variables in the stated collection. When there are no more specified variables, the loop will stop.


Direct-coupling based contact prediction methods (DCA) enable de-novo
structure prediction of proteins with an unprecedented accuracy.
However, these methods require thousands of protein sequences to
achieve high accuracy, limiting their usability. Here, we introduce
PconsC3, a method to accurately predict contacts for families an
order of magnitude smaller than feasible with DCA, thus increasing
accurate contact predictions from 12% to 54% of all protein domain
families with unknown structure. Input features comprise contact
predictions by plmDCA, GaussDCA as well as PhyCMAP, secondary
structure prediction by PSIPRED 3.0, and solvent accessibility
prediction by NetSurfP 1.1. In PconsC3 PhyCMAP can be replaced by
another contact predictor and we have successfully used CMapPro with
similar accuracy. Additionally, CD-HIT is run to generate statistics
about the alignment (i.e. alignment depth at different sequence
similarity cut-offs). The initial layer of PconsC3 takes these
features as input and uses a random forest to predict a score for
each possible contact. On contrary to previous work, PconsC3 applies
pattern recognition already in the first layer. This results in an
intermediate contact map. Every following layer uses all the initial
features plus the output from the previous layer, given as a window
of 11 by 11 residues around the current contact.
{% include "pred/egi_acknowledgement.html" %}
2. Usage
Input to the server is one or several (upto five) amino acid sequence(s) in FASTA format. The user can either paste
sequences in the text-area provided, or, alternatively,
upload a file containing your sequences.
Example input:
>1qj8A
ATSTVTGGYAQSDAQGQMNKMGGFNLKYRYEEDNSPLGVIGSFTYTEKSRTASSGDYNKN
QYYGITAGPAYRINDWASIYGVVGVGYGKFQTTEYPTYKNDTSDYGFSYGAGLQFNPMEN
VALDFSYEQSRIRSVDVGTWIAGVGYRF
3. Output
The server outputs the contact predictions using PconsC3
method in plain text format. The predicted contacts are also
displayed graphically. Additionally, a zipped folder including the
input sequence, predicted contacts (plain text and graphical
representation) and multiple sequence alignments is also downloadable.
4. References
Skwark MJ, Michel M, Hurtado DM, Ekeberg M, Elofsson A. "Accurate contact predictions for thousands of protein families using PconsC3."
Skwark MJ, Raimondi D, Michel M, Elofsson A (2014) "Improved Contact Predictions Using the Recognition of Protein Like Contact Patterns." PLoS Computational Biology 10(11).


Instajoe
Please enter a valid email.
Password must be at least 5 characters long.
{{$ctrl.errorMessage}}
Not a member? Signup here


Preparation time
less than 30 mins
Cooking time
30 mins to 1 hour
Serves
Serves 4
As any crisp lover will assure you, salt and potatoes are a great combination - and baked spuds are no exception. Glynn does his in a salt crust for extra crisp skins and fluffy flesh.
Preheat the oven to 180C/350F/Gas 4.
For the salt baked potatoes, mix the salt, paprika and egg whites together. Cover the bottom of an ovenproof dish with the mixture and place the potatoes in the dish. Completely cover with the remaining salt mixture and bake for 40 minutes.
For the chorizo mayonnaise, gently fry the chorizo over a low heat in a deep pan (don’t colour too much). Add the oil and cook slowly for 5-10 minutes.
Leave to cool for 10 minutes, then pass through a fine sieve to separate the meat and oil, retain both.
Whisk together the egg yolks and white wine vinegar. Slowly add the reserved oil in a thin stream, whisking all the time, until the mixture has emulsified and resembles mayonnaise. Set aside.
For the escabeche of vegetables, thinly slice all the vegetables on a mandolin and place in a large bowl of ice-cold water.
Mix the Chardonnay vinegar and oil to make vinaigrette. Add the thyme and garlic. Drain the vegetables and add to the vinaigrette.
To serve, spoon out the mayonnaise and swirl into a circle in the centre of each plate. Dress the plate with the vegetables and garnish with watercress. Sprinkle with the reserved chorizo and season with black pepper.
Turn out the salt baked potatoes and smash the salt to release the potatoes. Serve alongside the mayonnaise and vegetables.


To see a demonstration of a simple javascript client for keyword searches, click here.
Demonstration javascript client for interacting with the Open Context API. Feel free to fork from GitHub.


This page allows you to assign a user id to a Financial Institutions CardValet settings. It will only appear when the Security User selects the Web Services - Card Control RWS application.
Click the following links for more information:
| First Name | First name of the user whose record is being created. |
| Last Name | Last name of the user whose record is being created. |
| Institution ID | Identifier assigned by Card Services for the selected institution. |
| Assigned FI Token | Drop down list of available FI Tokens from Ondot Database. |
| AppToken Display Name | Drop down list of available AppToken which were mapped on the Manage Institution page and assigned to the Digital Certificate ID. | Create WalletApp User |
When checked, credentials for a new WalletApp User can be entered.
When not checked, a new user will not be created. Field will not appear in Manage User page. |
User ID |
Identifier assigned by Card Services for the selected user displays when the Add WalletApp User checkbox is checked. Format should be LOGO_WA.
Field is read-only. |
Password |
Enter the desired password for the new AppToken.
Note: Password cannot be less than 8 characters. Field cannot be edited from this screen after UserID and password have been added. Password must be changed from the Manage User page. |
Re-Enter Password | Re-enter the desired password. |
| Primary Client ID column | Displays the primary client ID. This section is used when a Financial Institution has more than one logo and allows a card search across those multiple logos. |
| Search Client ID(s) column |
Displays the client ID associated with the primary client ID.
Multiple Client IDs are separated by a comma. |
| Edit |
Select to modify the Search Client ID associated with the Primary Client ID.
When selected, a dialog box displays showing all available Client IDs. From here you can move any desired Client IDs to the Search Client IDs column. Select Apply to save changes, or Cancel to close the dialog box. |
| Back | Identifier assigned by Card Services for the selected institution. |
| Continue | Temporarily stores the data entered on this page for the new user's security record and takes you to the next page. |
| Cancel |
Discontinues the add CardValet process and returns you to the Manage Institution page.
If selected, a confirmation message will display. Select OK to cancel. |


Hi All,
The emonTx v3 looks like the product for me, but just thought I would ask a bit of advice as this is a new project for me and I need to get everything I need when I am in the UK later this month. Sorry if this is a bit long winded and rambling I am getting my thoughts together on this :-)
I live overseas and our power supply is poor, we currently get shore power(110 Volt) for an average of 8 hours per day, we also have a 1200AH battery bank, 24 volts to an inverter/charger.
We normally get power at night and this will charge the battery bank, but many days we need to start the generator to either run heavy loads or top up the battery bank to ensure we get through the evening(you can't rely on shore power everyday)
The national electrical supplier is somewhat crap at getting the bill right and I often feel they just makes them up and the kw/h price is above that of the UK
I would like to monitor energy usage while on shore power and generator so I can argue with them, they do seem to know they 'cheat' but you need to prove it and they have just placed all meters on a pole 5 meters above ground :-)
The inverter/charger has max charge of 70 amps @ 24 Volts in bulk charge mode and I am working on some software to monitor it, it has a rs485 interface and I have the protocol, also it is pseudo sine wave therefore it is probably better to use it's built in reporting for this, but I want to feed it into the same logging software, I would like to know how big an effort that would be ?
The generator and shore power have a change over switch which seems to be the ideal place to install the current monitors, anyone see problems with that?
The generator belongs to the landlord and seems a bit under voltage I had to set the inverter to kick in at 80 volts as when on generator, it would constantly flick between charge and invert, in addition the shore power is not best regulated either, will that cause issues?
I already have a few RPi, Arduino and a new SRF Shield for Arduino by Ciseco with a RPi link for it waiting in the UK I bought as a Kickstarter project a little while back, will I be able to use this link?
How much memory is spare in the emon Tx 3 Arduino, I would like to use two power relays that switch on the water lift pump and the swimming pool filters when generator or shore power is available, the lift pump will be fitted with a float switch so that the Arduino can switch of this pump when the header tank is full. The pool filter pump needs to be switched on for a given amount of time per day, will I be able to fit the code for this into the emon or am I better off using a separate Arduino?
Any advice or observations would be greatly appreciated, I am proficient in coding, electronics and electrical distribution
EDIT:- Just reading more and I think the system I want may be better achieved with 2 x Version 2, this would allow me to use 2 x 9 volt transformers one from the generator & one from the inverter, with power supplied to the units via the inverter. The house power outlets alternate between inverter, shore and generator. I also have a spare PLC that can work the pumps using a single output from each board, which would make that part easier.
Re: Investigating before buying
I think all that is do-able, but I'm not entirely clear what you want to measure and control. As I understand it:
Your mains incomer is 110 V, 50 or is it 60 Hz, single phase?
You have a generator.
You have a changeover switch to select mains or generator as your main source of supply.
You want to separately monitor mains and generator to check your consumption hence the charges.
You would like to monitor battery inverter output.
I think my first observation is to agree that all your monitoring and recording must be battery powered, so that it will ride through any switching or brown-outs, especially if you are using it for clock functions. There's no in-built real-time clock, so you would need some means of synchronising if you want things to happen at set times.
Monitoring the supply voltage will be essential; given that, the sketches can calculate real power accurately over any reasonable voltage range. But if all the infeeds (mains, generator and inverter) end up on the same busbar, I don't see a need for separate voltage monitors. Or can you run 'split' with generator feeding some loads independently of the other supply?
The sketches can handle any (reasonable) wave shape (they should be good to about the 20th harmonic!), therefore real power from your inverter is not likely to be grossly inaccurate, and it might be easier to simply treat that as another infeed.
Regarding the choice of V2 or V3, they both have the same basic circuit and processor. The V2 has 3 current inputs, the V3 has 4, but the V2 has many more easily accessible I/O pins. On balance, I think I'd go for the V2 in your application. I don't think you will need two emonTx's, it would be possible to convert a spare analogue I/O pin to a second voltage input if you wanted, with an add-on (strip-)board. You can use a serial link between a RPi and emonTx. I don't know that you can have two emonTx's on the same link, or that you can use i2c and serial to the Pi at the same time.
Re: Investigating before buying
Thank you for the quick response, I have done a quick diagram of the layout and in red is where I think you are saying to attach the CT's and AC/AC adaptor
CT1 & CT2 will monitor the Generator and Shore Power while CT3 will show me house general usage, pump usage will be CT1 + CT2 - CT3
Is that correct?
I will order a second V2 monitor as we may put in solar and friends may want one once they see it working, also I will not be back to the UK for at least 6 months.
If what I have drawn is correct would you please advise so I can place my order.
Best regards
Ian
Re: Investigating before buying
No, there's a problem there - with that arrangement you need to measure the voltage at two places, because the incoming voltage as seen by Consumer Unit 1 is not going to be the same as that seen by Consumer Unit 2.
Whether you need 1 or 2 emonTx V2's might depend on how and where your solar infeed is. I'm guessing CU 2. If you're not happy with replicating the voltage input circuitry on stripboard and feeding into a spare analogue input (and extending emonLib or the interrupt loop if you use the 'continuous' sketches, to use it) then you might need a second emonTx. Otherwise, you can probably get away with one.
Here's my take:
A single emonTx:
Current inputs: Shore, Generator, Inverter out; Voltage input: CU 1 voltage; AI4 with external circuit: CU2 voltage.
For the solar infeed, you would need to use AI5 and equip it with the fourth current input on the stripboard.
Two emonTx's:
No.1: Current inputs: Shore, Generator; Voltage input: CU 1 voltage.
No.2: Current input: Inverter out; Voltage input: CU2 voltage.
Both now have a spare current input for the solar infeed.
Pump usage is definitely not what you say - you've forgotten the battery charger input - that's not the same as the output (inverter and battery efficiency, energy storage in the battery? ! ! !). If you want that separately, you will need two emonTx's.
One further thought that might complicate matters: Are you going to want to use a solar energy diverter to charge the battery bank only when there is surplus solar energy (i.e using one of these). If so, now is the time to think about it! If you did do that, EmonTx 2 could handle that and the measurement. I'm fairly certain a single emonTx would struggle under the load.
But one big caveat, which needs to be answered by someone who is familiar with the I2C and serial comms: I don't know that it's possible for two emonTx's to talk to eachother and to a RPi serially.
Re: Investigating before buying
Robert,
Thank you very much for your time, the information is invaluable.
Extending the EmonTx2 should not be a problem and the setup you give covers everything that I need at the moment, sticking with just one unit for now makes sense.
You are right, I totally forgot the inverter inefficiencies, brain dead today!
Any excess solar energy would be dumped to the water heater, I will get the bits for that when back in the UK and have a think how I want to handle the monitoring, monitoring of the Generator & Shore power is the priority.
Re: Investigating before buying
If you are going to have an energy diverter eventually, you need to use one of the "continuous" sketches in the monitor. I know it's possible to change later, but it's best to start off right. You should find all the data you need for extending the V2 on the Wiki.
Re: Investigating before buying
Thanks Robert,
I can't seem to see my other post that thanked you for your great critique of the drawing, Strange, anyway it said thank you in brief and I am going with the V2 option with the extra strip board. I will look at the wiki and get to grips with it all.
Re: Investigating before buying
It was stuck in the moderation queue. You couldn't see it but I could, and there isn't a flag on the post to distinguish it, so I didn't realise it was stuck there until I checked the queue this morning!


Ocala events
-
va geo-thermal heating real estate
Essentialism, Power, and the Representation of Social Categories: A ...
This paper synthesizes two perspectives on essentialism: cognitive and social. . Further, this paper discusses the relevance of the folk sociology perspective to the study of children's . Beyond silence: A Dalit life history in South India. . In J. Kagan & S. Lamb (Eds.), The emergence of morality in young children (pp. 183).
http://www.karger.com/Article/Fulltext/109832The Silence of the Lambs - Analysis - Dramatica
The following analysis reveals a comprehensive look at the Storyform for The Silence of the Lambs. Unlike most of the analysis found herewhich simply lists .
http://dramatica.com/analysis/the-silence-of-the-lambs
dog litter boxes firehydrant Upcoming events in Ocala
fifa 08 in canada Hottest Tickets
-
Apr 11quality of a good leader
Amway Center -
Apr 28sale of manufactured home forms free
Amway Center -
Jun 25the world of tsai chin 1962
Bob Carr Performing Arts Center -
Mar 30pataskala to magic mountain
Amway Center -
Aug 27auburn tigers navy youth bar tshirt
Amway Center -
Jun 21realty one la vegas nv
Amway Center -
Sep 13body moving foward knees lock
Francis Field -
Mar 17yucatan rat like animal
St Augustine Amphitheatre -
Oct 8uk fire service doctrine
Amway Center -
May 4fortuny glass chandelier lighting
Bob Carr Performing Arts Center
Ocala's best venues
-
Noirish Inversions: Investigation and Victimization in The Silence
In contrast to this erotic fantasy of male victimization, The Silence of the Lambs detects hostility through a more sociological (and realistic) perspective, a female .
http://www.americanpopularculture.com/journal/articles/fall_2009/cragin.htm -
APA | Visual Sociology
Sociological Perspectives on Visual Culture. RSS Feed · Home · Blog · About . Horror Film Analysis Silence of the Lambs (Demme 1991). by Rachael under .
http://www.visualsoc.net/archives/tag/apa -
A SOCIOLOGICAL SOCIAL PSYCHOLOGY: SOCIAL FACTORS ...
In the movie The Silence of Lambs a novice FBI investigator employs the . But the lesson is relatively new historically, such as the lesson of perspective in .
http://www.trinity.edu/mkearl/socpsy-5.html2 pressure method moisture
98 people's favorite
-
Recovery From Schizophrenia: With Views of Psychiatrists ...
These perspectives are explored with emphasis on how they have helped drive federal . Her book, Welcome Silence: My Triumph over Schizophrenia,19 details her . E.L.K., PhD (sociology), the current second author, indicates that he was first diagnosed with schizophrenia in 1969. . In: Frese FJ, Lamb HR, editors.
http://schizophreniabulletin.oxfordjournals.org/content/35/2/370.full -
Silence Of The Lambs Essay
An essay or paper on Silence Of The Lambs. What is Forensic Anthropology? From within the specialized area of osteology--the study of bonescomes the .
http://www.exampleessays.com/viewpaper/95483.html


Home
Books
Register
Contact us
About us
Login
The Different Genres of Books
Romance
Thriller
Science Fiction
Horror
Action and Adventure
Fantasy
Drama
Biographies


[gecode-users] MSVC project files? [WAS: Debian packages for Gecode]
Christian Schulte
schulte at imit.kth.se
Thu Jan 19 13:06:52 CET 2006
Please read the docs about how to build Gecode.
We currently don't have MSVC project files (we would like to generate
some... we intend to have them at some point in tim) but you can build with
MSVC when you also have Cygwin installed (actually, I use MSVC for
development myself). As said, check the docs.
Christian
--
Christian Schulte, http://www.imit.kth.se/~schulte/
-----Original Message-----
From: users-bounces at gecode.org [mailto:users-bounces at gecode.org] On Behalf
Of Filip Konvicka
Sent: Thursday, January 19, 2006 12:09 PM
To: users at gecode.org
Subject: [gecode-users] MSVC project files? [WAS: Debian packages for
Gecode]
> One thing that I would be extremely interested in is whether the test
> suite
> actually passes on the more exotic platforms, like alpha, arm, ia64,
sparc,
> etc. It would be really cool if you could add a make test and executing
> test/test to the build process. This will slow down the build a lot, but I
> think it might be a good idea anyway.
>
Have you tried compiling/running gecode on Windows under MSVC? I did not
notice any MSVC project files or makefiles when I looked on the sources,
although there seem to be some _MSC_VER macros used...
Thanks,
Filip
_______________________________________________
Gecode users mailing list
users at gecode.org https://www.gecode.org/mailman/listinfo/gecode-users
More information about the gecode-users
mailing list


Uses of Class
com.opengamma.strata.collect.Decimal
-
Packages that use Decimal Package Description com.opengamma.strata.basics.currency Representations of currency and money.com.opengamma.strata.basics.value Basic financial tools for working with values.com.opengamma.strata.collect Root package for common data structures used by Strata.com.opengamma.strata.loader Tools for loading data from files. -
-
Uses of Decimal in com.opengamma.strata.basics.currency
Methods in com.opengamma.strata.basics.currency that return Decimal Modifier and Type Method Description default Decimal
FxRateProvider. convert(Decimal amount, Currency fromCurrency, Currency toCurrency)
Converts an amount in a currency to an amount in a different currency using this rate.Decimal
BigMoney. getValue()
Gets the numeric amount of the money.Decimal
Currency. roundMinorUnits(Decimal amount)
Rounds the specified amount according to the minor units.Methods in com.opengamma.strata.basics.currency with parameters of type Decimal Modifier and Type Method Description default Decimal
FxRateProvider. convert(Decimal amount, Currency fromCurrency, Currency toCurrency)
Converts an amount in a currency to an amount in a different currency using this rate.BigMoney
BigMoney. convertedTo(Currency resultCurrency, Decimal fxRate)
Converts this amount to an equivalent amount the specified currency.Money
Money. convertedTo(Currency resultCurrency, Decimal fxRate)
Converts this amount to an equivalent amount the specified currency.static BigMoney
BigMoney. of(Currency currency, Decimal amount)
Obtains an instance ofBigMoney
for the specified currency and amount.static Money
Money. of(Currency currency, Decimal amount)
Obtains an instance ofMoney
for the specified currency and amount.Decimal
Currency. roundMinorUnits(Decimal amount)
Rounds the specified amount according to the minor units.Method parameters in com.opengamma.strata.basics.currency with type arguments of type Decimal Modifier and Type Method Description BigMoney
BigMoney. map(UnaryOperator<Decimal> mapper)
Applies an operation to the amount.Money
Money. map(UnaryOperator<Decimal> mapper)
Applies an operation to the amount. -
Uses of Decimal in com.opengamma.strata.basics.value
Methods in com.opengamma.strata.basics.value that return Decimal Modifier and Type Method Description default Decimal
Rounding. round(Decimal value)
Rounds the specified value according to the rules of the convention.Methods in com.opengamma.strata.basics.value with parameters of type Decimal Modifier and Type Method Description default Decimal
Rounding. round(Decimal value)
Rounds the specified value according to the rules of the convention. -
Uses of Decimal in com.opengamma.strata.collect
Fields in com.opengamma.strata.collect declared as Decimal Modifier and Type Field Description static Decimal
Decimal. MAX_VALUE
A decimal value representing the largest supported value.static Decimal
Decimal. MIN_VALUE
A decimal value representing the smallest supported value.static Decimal
Decimal. ZERO
A decimal value representing zero.Methods in com.opengamma.strata.collect that return Decimal Modifier and Type Method Description Decimal
Decimal. abs()
Returns a decimal value that is positive.Decimal
FixedScaleDecimal. decimal()
Gets the underlying decimal.Decimal
Decimal. dividedBy(double other)
Returns a decimal value that is equal to this value divided by the specified value.Decimal
Decimal. dividedBy(long other)
Returns a decimal value that is equal to this value divided by the specified value.Decimal
Decimal. dividedBy(Decimal other)
Returns a decimal value that is equal to this value divided by the specified value.Decimal
Decimal. dividedBy(Decimal other, RoundingMode roundingMode)
Returns a decimal value that is equal to this value divided by the specified value, with a rounding mode.Decimal
Decimal. mapAsBigDecimal(UnaryOperator<BigDecimal> fn)
Maps this decimal value using the maths operations ofBigDecimal
.Decimal
Decimal. mapAsDouble(DoubleUnaryOperator fn)
Maps this decimal value using the maths operations ofdouble
.Decimal
Decimal. minus(double other)
Returns a decimal value that is equal to this value minus the specified value.Decimal
Decimal. minus(long other)
Returns a decimal value that is equal to this value minus the specified value.Decimal
Decimal. minus(Decimal other)
Returns a decimal value that is equal to this value minus the specified value.Decimal
Decimal. movePoint(int movement)
Returns a decimal value with the decimal point moved.Decimal
Decimal. multipliedBy(double other)
Returns a decimal value that is equal to this value multiplied by the specified value.Decimal
Decimal. multipliedBy(long other)
Returns a decimal value that is equal to this value multiplied by the specified value.Decimal
Decimal. multipliedBy(Decimal other)
Returns a decimal value that is equal to this value multiplied by the specified value.Decimal
Decimal. negated()
Returns a decimal value that is negated.static Decimal
Decimal. of(double value)
Obtains an instance from adouble
.static Decimal
Decimal. of(long value)
Obtains an instance from along
.static Decimal
Decimal. of(String str)
Obtains an instance from aString
.static Decimal
Decimal. of(BigDecimal value)
Obtains an instance from aBigDecimal
.static Decimal
Decimal. ofScaled(long unscaled, int scale)
Obtains an instance from an unscaled value and a scale.static Decimal
Decimal. parse(String str)
Parses an instance from aString
.Decimal
Decimal. plus(double other)
Returns a decimal value that is equal to this value plus the specified value.Decimal
Decimal. plus(long other)
Returns a decimal value that is equal to this value plus the specified value.Decimal
Decimal. plus(Decimal other)
Returns a decimal value that is equal to this value plus the specified value.Decimal
Decimal. roundToPrecision(int precision, RoundingMode roundingMode)
Returns a decimal value rounded to the specified precision.Decimal
Decimal. roundToScale(int desiredScale, RoundingMode roundingMode)
Returns a decimal value rounded to the specified scale.Decimal
BasisPoints. toDecimalForm()
Converts this basis points to mathematical decimal form.Decimal
Percentage. toDecimalForm()
Converts this percentage to mathematical decimal form.Decimal
BasisPoints. valueBasisPoints()
Gets the value in basis points form as aDecimal
.Decimal
Percentage. valuePercent()
Gets the value in percentage form as aDecimal
.Methods in com.opengamma.strata.collect with parameters of type Decimal Modifier and Type Method Description int
Decimal. compareTo(Decimal other)
Decimal
Decimal. dividedBy(Decimal other)
Returns a decimal value that is equal to this value divided by the specified value.Decimal
Decimal. dividedBy(Decimal other, RoundingMode roundingMode)
Returns a decimal value that is equal to this value divided by the specified value, with a rounding mode.static BasisPoints
BasisPoints. fromDecimalForm(Decimal decimal)
Obtains an instance from mathematical decimal form, where 0.007 will create an instance representing 70bps.static Percentage
Percentage. fromDecimalForm(Decimal decimal)
Obtains an instance from mathematical decimal form, where 0.007 will create an instance representing 0.7%.Decimal
Decimal. minus(Decimal other)
Returns a decimal value that is equal to this value minus the specified value.Decimal
Decimal. multipliedBy(Decimal other)
Returns a decimal value that is equal to this value multiplied by the specified value.static BasisPoints
BasisPoints. of(Decimal basisPoints)
Obtains an instance from a basis points value.static FixedScaleDecimal
FixedScaleDecimal. of(Decimal decimal, int fixedScale)
Obtains an instance from a decimal and scale.static Percentage
Percentage. of(Decimal percentage)
Obtains an instance from a percentage value.Decimal
Decimal. plus(Decimal other)
Returns a decimal value that is equal to this value plus the specified value.Method parameters in com.opengamma.strata.collect with type arguments of type Decimal Modifier and Type Method Description BasisPoints
BasisPoints. map(UnaryOperator<Decimal> mapper)
Applies an operation to the value.FixedScaleDecimal
FixedScaleDecimal. map(UnaryOperator<Decimal> fn)
Maps this value using the maths operations ofDecimal
.Percentage
Percentage. map(UnaryOperator<Decimal> mapper)
Applies an operation to the value. -
Uses of Decimal in com.opengamma.strata.loader
Methods in com.opengamma.strata.loader that return Decimal Modifier and Type Method Description static Decimal
LoaderUtils. parseDecimal(String str)
Parses a decimal from the input string.static Decimal
LoaderUtils. parseDecimalBasisPoint(String str)
Parses a decimal from the input string, converting it from a basis points to decimal form.static Decimal
LoaderUtils. parseDecimalPercent(String str)
Parses a decimal from the input string, converting it from a percentage to decimal form.
-


FIFA Game
Teams
Matches
Groups
Search
History
Welcome to the FIFA World Cup 2018
Statistics Manager
Search by:
Location
Team
Match Date
Search
HISTORY RECORDS
#
Event
Timestamp
#
Event
Timestamp
Modal title
×
Location, Country
17°C, Partly Clody
Home Team
Starting players:
Away Team
Starting players:


{% load static %} {% block content %}
Want something custom made? we would love to do that! Just contact us or send us a tweet @curioeffect. We're here for because of you


Supporting Multiple Platforms in a Single Codebase
Objective
In this section, you will explore the ways you can support both Android and iOS within a single Titanium project. Through a combination of platform specific feature abstraction and usage of conditional code branching, Titanium provides you with a powerful mechanism for creating cross platform, native mobile apps with a maximum amount of code reuse.
Contents
Titanium is not a write once, run anywhere framework. It's more aptly referred to as a "write once, adapt everywhere" framework. Your business logic, networking, database, and event handling logic will be close to 100% cross-platform compatible. The user interfaces on iOS and Android differ so significantly that in most cases you'll have to do at least a little platform specific coding. That said, it's not uncommon for cross platform apps to reuse 80, 90, or even 100% of their UI code as well.
Embrace the platform
Best of breed, native apps take full advantage of the platforms on which they run. By this, we mean apps that:
-
Use hardware-specific features, such as the Android menu button
-
Use OS-specific controls, such as the Cocoa UI controls on iOS
-
Participate in the platform ecosystem (i.e., using platform-appropriate notification mechanisms)
Your Titanium apps should do more than just run on iOS and Android. When running on an iOS device, your app should feel like an iOS app. Your Android app should feel like an Android app.
The best approach when creating cross platform apps is to develop and test for both iOS and Android right from the start. Designing and developing your app with multiple platforms in mind right away will be significantly more efficient than developing for one, then porting to the next. Another approach that helps significantly is to use a modular design with either the CommonJS require() or self-calling function pattern as described in the Coding Patterns chapter.
Branching
Titanium provides some platform-identification properties in the Ti.Platform namespace that you can use for conditional branching within your code. These are:
|
Property |
Description |
Sample values |
|
Ti.Platform.name |
Returns the name of the platform returned by the device |
iPhone OS for iPhone or iPod, android for Android |
|
Ti.Platform.osname |
Returns an abbreviated identifier of the platform |
iphone for iPhone or iPod, ipad for iPad, and android for Android |
|
Ti.Platform.model |
Returns device model identifier |
iPhone 3GS or iPod Touch 2G or Droid |
If using any of these more than a few times in your code, it's best practice to query the value once, then store it in a globally accessible variable. Each time you request one of those properties, Titanium has to query the operating system for the value. This "trip across the bridge" takes a few cycles and if used too frequently could possibly slow your program. Something like the following would be more efficient:
var isAndroid = (Ti.Platform.osname=='android) ? true : false;
if(isAndroid) {
// do Android specific stuff
} else {
// do iOS stuff
}
Platform-specific APIs
Many of the Titanium APIs are separated according to the platform on which they are supported. For example, the Ti.UI.iPhone namespace includes user interface components that are supported on only on the iOS operating system. The same is true of the Ti.UI.iOS, Ti.UI.iPad, and Ti.UI.Android namespaces. You can wrap calls to such APIs in branching code to call on platform-specific functionality.
As you explore the API docs, you will find many platform-specific properties and values. For example, the Ti.UI.Window object has an Android-specific property called softInputMode. That property's value must be one of the constants in the Ti.UI.Android namespace.
On iOS, exists for the sake of parity, but it doesn't do anything. Setting it to something like null is benign as it is ineffective. On iOS, the Ti.UI.Android namespace exists, but contains no members. The following illustrates a way you could provide Android-specific functionality without causing errors on iOS:
var isAndroid = (Ti.Platform.osname=='android) ? true : false;
var win = Ti.UI.createWindow({
softInputMode: (isAndroid) ?  These include:
-
Platform, resolution, and density specific images
-
Platform-specific JSS
-
Platform-specific JS files
Platform-specific images
Titanium uses an "overrides" system to make it easy to use platform-specific images. Any image in the platform specific Resources directories (Resources/android or Resources/iphone) will override, or be used in place of, an image in the Resources directory. You don't have to use any special notation in your code to specify that these images should be used. This technique applies to all images you might use in your app, including the splash screen, app icon, images, and backgrounds.
var img = Ti.UI.createImageView({
image: 'logo.png'
/* Resources/android/logo.png or Resources/iphone/logo.png will be used
* automatically if they exist
*/
});
Resolution-specific images
The same is true for resolution-specific images. On the iPhone, you have two image resolutions to deal with: original and "retina." The retina display, featured on the iPhone 4 and presumably newer models, has twice the DPI of earlier displays. Following Apple's scheme, retina images are named to match their non-retina counterparts, with "@2x" appended to the name. In your code, though, you don't worry about that suffix.
var img = Ti.UI.createImageView({
image: 'logo.png'
/*<EMAIL_ADDRESS>will be used automatically if it exists on iPhone 4 & iPad devices */
});
Android has quite a few more resolutions and screen sizes to deal with. See the Android Overview chapter for more info on that. To support these screen variations, Titanium uses a set of directories as shown here:
You'd put your resolution-specific files in the appropriate directories. In code, you'd simply refer to the images via the base name, as shown above for iPhone. Titanium will take care of pulling in the correct image for the device in use. You only need to worry about these various resolutions if you want pixel perfect designs. You can also tell Android to simply scale your UI to the device's screen, which will scale your images as well, allowing your app to use the same images for all screen resolutions and densities.

Platform-specific JSS
JavaScript Style Sheets (JSS) are a means to describe the appearance of your app's components. It roughly follows the format and syntax of CSS. You supply an external stylesheet giving the file a name that matches the associated JS file. So, the stylesheet for the app.js file is named app.jss.
Titanium supports platform-specific JSS files as well. You can have app.android.jss and app.iphone.jss files and Titanium will make sure the correct one is applied when you build your app. This support lets you create platform-specific UIs for your app from a single code-base.
Platform-specific JS files
Titanium even lets you create and include platform-specific JavaScript files. You place these files in the platform directories: in other words, in the Resources/iphone and Resources/android directories. For example, let's say you needed to include platform-specific versions of a file named ui.js. You'd create two versions of the file: Resources/iphone/ui.js and Resources/android/ui.js. In your app.js, you'd simply enter Ti.include('ui.js') and at build time, the platform-appropriate version would be included.
The current version of the Titanium Mobile SDK (1.7.3 at the time of this writing) has an issue with this functionality on iPhone, though it works correctly on Android. See Jira ticket 5114 for more info.
Hands-on Practice
Goal
In this activity, you will use platform-specific JavaScript style sheets files with a simple test project.
Steps
-
Create a new mobile project named Platform Test. Replace all of the code in app.js with:\
var win = Ti.UI.createWindow({ id:'mainwin' }); var label = Ti.UI.createLabel({ id:'ptlabel' }); win.add(label); win.open();
-
Create two new files, one named app.iphone.js and the other named app.android.jss. In them, enter this code:\
app.iphone.jss#mainwin { background-color: 'blue'; } #ptlabel { color:'#fff'; top:10; width:'auto'; height:'auto'; text:'I am iPhone!' }
app.android.jss#mainwin { background-color: '#f00'; } #ptlabel { color:'#fff'; top:10; width:'auto'; height:'auto'; text:'I am Android!' }
-
Build the project for both the iPhone and Android simulator/emulator (if your development computer supports both). The labels and colors should be specific to the platforms as set in the stylesheets.
References and Further Reading
Summary
In this section, you learned how to support both Android and iOS within a single set of files. You learned programming strategies as well as the ways Titanium eases the process of working with platform-specific resources. In the final section of this chapter, we'll see how we can use Titanium's integrated internationalization capabilities to make out app's global accessible.


There are currently 775 million people on our planet who cannot read or write.
In 39 countries, fewer than 50% of the poorest children have completed primary school.
In 30 countries, less than 90 females for every 100 males have completed secondary school.
The Problem:
The discrepancies between available resources for educating children of various backgrounds are staggering. Children of marginalized groups continue to face notable barriers in their struggles to access, attend and complete basic education.
Our mission is to shed light upon education inequality around the world in order to inspire and enable others to take action. By collecting and providing information in a consumable format, we aim to utilize technology in order to draw attention to world-wide issues.


--- layout: post title: What I add to Firefox to make it better tags: - Open Source Software - Work Practices status: publish type: post published: true meta: {} --- One of the first things I install on any new machine is Firefox (Linux of course usually has it already). However after have done that there a couple of extentions I always add


--- layout: post title: Yarn Along date: 2011-06-22 12:39:50.000000000 -04:00 categories: - Yarn Along tags: - Easy knit - Knitted dress - Marvel dress pattern - Moda Vera - Ridinghood sweater pattern status: publish type: post published: true meta: aktt_notify_twitter: 'no' _edit_last: '1' dsq_thread_id: '1188590575' author: login: cint email<EMAIL_ADDRESS>display_name: Jacinta first_name: Jacinta last_name: '' ---
Joining in with Ginny at Small Things yarn along this week.
Hurrah! I have finished Scarlett's dress. I had hoped to capture some pictures of her wearing it, but Wednesday is our crazy day, so I am hoping to take some better photos of her wearing it tomorrow to her school's winter festival. It was a lovely knit and I am very happy with how it has turned out.
The colour is really off unfortunately, as I took the photo at 10.00pm tonight.
[caption id="attachment_977" align="aligncenter" width="600" caption="The colour is more like teal than bright blue"][/caption]
Now I am just deciding what to make for Jairah. I have some lovely vintage and retro patterns (they have been my reading material this week!) that I am finding hard to choose from, as there are so many gorgeous patterns. I have bought this pattern for Tenneille and I have also purchased a lovely red yarn to knit it in.
Can't wait to see what you have all been crafting this week. Jacinta x


--- layout: post title: ! 'Poll: Most loved book genre' tags: - Book Review - Decor - Poll status: publish type: post published: true meta: _edit_last: '2' _yoast_wpseo_linkdex: '0' ---
My new favorite corner of the house, where I keep my latest reads,
I love fiction, romance, cartoons and yup suspence... overall competely spicy :P
Lately I loved the shiva trilogy the most... and waiting for the third and last part...
Which book genre you love the most ?
[poll id="4"]
Please do leave a comment with your favorite books and authors, I need some suggestion :)


Katherine Marie Robinson
Democrat
Disabled since college, no significant work history.
3 years of Bachelors' degree study at University of Connecticut: Dual-major Geography and Journalism. Certificates and Training (Past and Present) -Wilderness First Responder -Contact Tracing for COVID-19 -Patient Advocacy Training in advance of Board-Certified Patient Advocate Exam
80634
Donated in amounts of $5-10: -ActBlue -Elizabeth Warren for President -Warren Democrats -Sara Gideon for Senate
2010-2020 "Amtgard". This is a Medieval Reenactment group, in which I focused on leadership, service (like logistics of weekend-long and national events), and community involvement. I also spent a large amount of time advocating for and teaching the medieval arts and sciences, and running competitions for same. Achieved "Knighthood", an in-game recognition and permanent office of leadership, service and teaching. 2019-2020 Humane Society of Weld County - I foster kittens mostly. I am known as a skilled foster for difficult medical cases and neonates as young as a day old. 2019: Gave medical advocacy speech at a "Cardboard Cory" event, allowing constituents to deliver speeches to a cardboard cutout of Senator Gardner. 2020: Volunteered with Colorado Common Cause, a nonpartisan group geared toward voter participation and safety. I volunteered with them to: -Monitor social media for misinformation (8 hours) -Be a nonpartisan "poll monitor", to observe and report any violations to proper authorities (14 hours) -Be a "Test Pilot" voter, volunteering to vote in person as if doing Secret Shopping.
I volunteer as a patient advocate for Ehlers-Danlos Syndrome, helping patients navigate the health, insurance, and disability systems in order to get rare-disease diagnoses and treatment that might otherwise take decades (like they did for me).
I believe that the commission needs to have diversity of gender, age, and disability, and read that applicants so far are overwhelmingly 65+ males.
I come from a basis of thinking about the people in the community that we have drawn-in together. Are we drawing a community that represents homogeneity, or one intended to be diverse? Each of those has consequences. I will approach consensus in a way that focuses on the community rather than individual ego, and encourage colleagues to do the same.
As a person who has been disabled for over 10 years, I make a pittance on Social Security. This means that to live any semblance of a normal life, I have to be able to creatively solve problems, often without resources. This has led me to a way of problem solving that I describe as "Don't imagine the tool you need, imagine the function you need. Then work backward to find a wider variety of tools that could fit the job. You might even find that you could use a different function/tool altogether in the process." As someone trained in journalism, I have also been trained to seek multiple angles. The old adage of three scholars, each feeling the legs, trunk, and flank of an elephant, is not the journalist's way. As annoying as it makes us, we are the ones who will feel around the whole elephant.
Intergender/Genderflux; AFAB


Travis Shelton
About
Portfolio
Contact
Portfolio
Recipe Search
RPG Game
Trivia Game
Giphy Search
Nite Owl
Connect with Me


Old stuff, just for reference
Moderator: Joe M.
-
- 1.10 bugs / stuff that needs changing
by Cagen » Tue Oct 14, 2008 6:29 pm
- 15 Replies
- 859 Views
- Last post by Karl G.
Sat Oct 18, 2008 5:37 pm
-
- The spell delays... ugh
by Draco » Sat Oct 18, 2008 9:58 am
- 1 Replies
- 247 Views
- Last post by Karl G.
Sat Oct 18, 2008 12:20 pm
-
- Poll on How Deleting Should Work
by Karl G. » Wed Oct 01, 2008 7:29 pm
- 3 Replies
- 269 Views
- Last post by Draco
Fri Oct 17, 2008 3:43 pm
-
- Melee System...again
by Karl G. » Wed Oct 15, 2008 6:44 am
- 6 Replies
- 402 Views
- Last post by Karl G.
Thu Oct 16, 2008 6:28 am
-
- d3dx9_39.dll missing?
by Exempt » Tue Oct 14, 2008 4:56 pm
- 4 Replies
- 625 Views
- Last post by Burnt Ferret
Wed Oct 15, 2008 10:47 pm
-
- My opinions thus far
by a_link_to_the_past » Wed Oct 15, 2008 7:44 pm
- 0 Replies
- 197 Views
- Last post by a_link_to_the_past
Wed Oct 15, 2008 7:44 pm
-
- IMPORTANT INFO ABOUT 1.11 UPDATE
by Karl G. » Sun Sep 21, 2008 2:15 pm
- 15 Replies
- 638 Views
- Last post by Karl G.
Wed Oct 15, 2008 1:33 pm
-
- Implementing a Dynamic time system.
by Draco » Tue Oct 14, 2008 7:47 pm
- 2 Replies
- 305 Views
- Last post by Draco
Tue Oct 14, 2008 8:35 pm
-
- [OLD] How to fix "d3dx9_38.dll not found" error
by Karl G. » Tue Aug 26, 2008 7:18 pm
- 6 Replies
- 630 Views
- Last post by ascent
Tue Oct 14, 2008 5:17 pm
-
- Odd monster glitch.
by Draco » Tue Oct 14, 2008 4:19 pm
- 1 Replies
- 238 Views
- Last post by Karl G.
Tue Oct 14, 2008 4:26 pm
-
- new items
by deathstalker » Sun Oct 12, 2008 11:44 am
- 3 Replies
- 321 Views
- Last post by Draco
Tue Oct 14, 2008 3:18 pm
-
- Texture Help!
by Burnt Ferret » Fri Oct 03, 2008 10:21 am
- 5 Replies
- 285 Views
- Last post by Draco
Tue Oct 14, 2008 12:40 pm
-
- Since you've been waiting a while for an update...
by Karl G. » Tue Oct 14, 2008 12:15 pm
- 1 Replies
- 212 Views
- Last post by Draco
Tue Oct 14, 2008 12:27 pm
-
- Graphical Inventory idea
by Draco » Mon Oct 13, 2008 1:05 pm
- 2 Replies
- 296 Views
- Last post by Draco
Tue Oct 14, 2008 12:19 pm
-
- new idea
by deathstalker » Fri Oct 03, 2008 6:03 am
- 5 Replies
- 387 Views
- Last post by deathstalker
Mon Oct 13, 2008 7:14 pm
-
- Back in action!
by Karl G. » Fri Oct 10, 2008 8:52 am
- 14 Replies
- 471 Views
- Last post by Sankt Pauli
Mon Oct 13, 2008 10:08 am
-
- new weapon skin
by deathstalker » Sun Oct 12, 2008 12:00 pm
- 0 Replies
- 204 Views
- Last post by deathstalker
Sun Oct 12, 2008 12:00 pm
-
- new item skin
by deathstalker » Sun Oct 12, 2008 11:49 am
- 0 Replies
- 181 Views
- Last post by deathstalker
Sun Oct 12, 2008 11:49 am
-
- pop up menu and life bar
by prehistoric » Mon Oct 06, 2008 3:26 pm
- 3 Replies
- 407 Views
- Last post by Draco
Sat Oct 11, 2008 6:04 pm
-
- Party System Idea
by Karl G. » Fri Oct 10, 2008 8:58 am
- 3 Replies
- 328 Views
- Last post by Vapore
Fri Oct 10, 2008 5:48 pm
-
- This Spawn Is Nuts....
by BLC87 » Sun Sep 07, 2008 10:48 pm
- 2 Replies
- 513 Views
- Last post by prehistoric
Thu Oct 09, 2008 9:52 am
-
- [Screenshot] New character login screen for 1.10
by Karl G. » Wed Oct 01, 2008 9:05 am
- 11 Replies
- 395 Views
- Last post by deathstalker
Thu Oct 09, 2008 7:00 am
-
- If you are an alpha tester, please respond.
by Karl G. » Sat Sep 27, 2008 6:26 pm
- 38 Replies
- 1119 Views
- Last post by iprogz
Wed Oct 08, 2008 6:07 pm
-
- Damage
by prehistoric » Tue Oct 07, 2008 10:36 am
- 2 Replies
- 266 Views
- Last post by prehistoric
Wed Oct 08, 2008 12:00 pm
-
- 1.10 will probably have to be pushed back :/
by Karl G. » Sat Oct 04, 2008 2:27 pm
- 6 Replies
- 440 Views
- Last post by Burnt Ferret
Tue Oct 07, 2008 9:27 am
Return to Board index
Users browsing this forum: No registered users and 1 guest
Forum permissions
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum


I just want to tell you that you are so pro


|
KratosMultiphysics
KRATOS Multiphysics (Kratos) is a framework for building parallel, multi-disciplinary simulation software, aiming at modularity, extensibility, and high performance. Kratos is written in C++, and counts with an extensive Python interface.
|
Functions | |
| def | PrintSurfaceLevel (time, model_part, surfacelevelfilename) |
| setting the domain size for the problem to be solved More... | |
| def example_script.PrintSurfaceLevel | ( | time, | |
| model_part, | |||
| surfacelevelfilename | |||
| ) |
setting the domain size for the problem to be solved
| example_script.box_corner1 = Vector(3); |
| example_script.box_corner2 = Vector(3); |
| example_script.deformed_mesh_flag = WriteDeformedMeshFlag.WriteDeformed |
| int example_script.domain_size = 2 |
| float example_script.Dt = 0.005 |
| float example_script.dynamic_tau = 0.0 |
| float example_script.final_time = 1.0 |
| example_script.fluid_solver = runge_kutta_frac_step_solver.RungeKuttaFracStepSolver(Qcomp_model_part,domain_size, box_corner1, box_corner2) |
| example_script.gid_io = GidIO(input_file_name,gid_mode,multifile,deformed_mesh_flag, write_conditions) |
| example_script.gid_mode = GiDPostMode.GiD_PostBinary |
| example_script.input_file_name = fluid_ulf_var.problem_name |
| float example_script.mesh_name = 0.0 |
| example_script.model_part_io_origin = ModelPartIO(input_file_name) |
| example_script.multifile = MultiFileFlag.MultipleFiles |
| float example_script.next_output_time = output_step |
| int example_script.out = 0 |
TIME.
| example_script.out_file = outputfile1 |
| float example_script.output_step = 0.000001 |
| example_script.outputfile1 = open(outstring1, 'w') |
| string example_script.outstring1 = "sensor_height.txt" |
| example_script.pILUPrecond = ILU0Preconditioner() |
| example_script.pressure_linear_solver |
| example_script.Qcomp_model_part = ModelPart("pFluidPart"); |
| example_script.ReformDofAtEachIteration |
| example_script.res_name3 = str("free_surface_flow") |
| int example_script.step = 0 |
| int example_script.time = 0 |
| example_script.ulf_time_step_dec_process = UlfTimeStepDecProcess(Qcomp_model_part); |
| example_script.write_conditions = WriteConditionsFlag.WriteConditions |


Angular Key Value Editor
Demos/Hacking/Manual Tests
Single editor, no data
Single editor, simple data and setup
Many editors, different data
Many editors, shared data
Readonly keys
Many editors, validation 3 ways
Tab past & focus re/accessibilty
Icons
Value alt
Optional add row link
Headings
Placeholders
Empty Keys (allow/disallow)


@* * Copyright 2021 HM Revenue & Customs * * 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. *@ @import helper._ @import uk.gov.hmrc.cbcrfrontend.config.FrontendAppConfig @import uk.gov.hmrc.cbcrfrontend.views.html._ @this(mainTemplate: main_template) @()(implicit request: Request[_], messages: Messages, config: FrontendAppConfig) @mainTemplate(title = Messages("")) {


This Adds an Employee to the employees Table
SSN of the New Employee: Their First Name: Their Last Name: Their Shift #:
This Adds a Manager to both the employees and managers Tables
Please input SSN of the New Manager: Their First Name: Their Last Name: Their Shift #:


magneticalc.BiotSavart_JIT.BiotSavart_JIT
class documentationmagneticalc.BiotSavart_JIT
(View In Hierarchy)
Implements the Biot-Savart law for calculating the magnetic flux density (B-field) and vector potential (A-field).
| Method | __init__ | Initializes the class attributes. |
| Instance Variable | total_limited | Undocumented |
| Static Method | worker | Applies the Biot-Savart law for calculating the magnetic flux density (B-field) or vector potential (A-field) for a single sampling volume point. |
| Method | get_result | Calculates the field at every point of the sampling volume. |
| Instance Variable | _type | Undocumented |
| Instance Variable | _distance_limit | Undocumented |
| Instance Variable | _length_scale | Undocumented |
| Instance Variable | _dc | Undocumented |
| Instance Variable | _current_elements | Undocumented |
| Instance Variable | _sampling_volume_points | Undocumented |
| Instance Variable | _sampling_volume_permeabilities | Undocumented |
| Instance Variable | _progress_callback | Undocumented |
Initializes the class attributes.
| Parameters | _type | Field type (0: A-field; 1: B-field) |
| distance_limit | Distance limit (mitigating divisions by zero) | |
| length_scale | Length scale (m) | |
| dc | Wire current (A) | |
| current_elements | Ordered list of current elements (pairs: [element center, element direction]) | |
| sampling_volume_points | Ordered list of sampling volume points | |
| sampling_volume_permeabilities | Ordered list of sampling volume's relative permeabilities µ_r | |
| progress_callback | Progress callback |
Applies the Biot-Savart law for calculating the magnetic flux density (B-field) or vector potential (A-field) for a single sampling volume point.
| Parameters | _type | Field type (0: A-field; 1: B-field) |
| distance_limit | Distance limit (mitigating divisions by zero) | |
| length_scale | Length scale (m) | |
| current_elements | Ordered list of current elements (pairs: [element center, element direction]) | |
| sampling_volume_point | Sampling volume point | |
| Returns | (Total number of limited points, vector) |


{% extends "global/Page.html" %} {% load otree %} {% block title %} Part 2 {% endblock %} {% block content %}
{% formfield player.t3_stage2_dv1 label="In the following field, please list all of the creative, unusual uses for a BRICK you can think of:" %} {% next_button %} {{ form.errors }} {% endblock %}