{% extends "layout-chs.html" %} {% block page_title %} Profit and loss account {% endblock %} {% block content %} {% include "includes/phase_banner_beta.html" %}<EMAIL_ADDRESS>Your details Your filings Companies you follow Sign out Back 2 Profit and loss account Complete all items that are included in your prepared accounts. 2017£ 2016£ Turnover Also called sales, revenue or income. The total amount this period from selling goods or services, excluding VAT. Turnover (2017) Turnover (2016) Cost of sales The costs directly involved in producing or delivering goods and services, for example, materials or shipping. Cost of sales (2017) Cost of sales (2016) Gross profit (or loss) Calculation: Turnover minus cost of sales. Gross profit (2017) Gross profit (2016) Distribution costs Costs like packaging, transporting or storing the goods or services sold. Distribution costs (2017) Distribution costs (2016) Administrative expenses The costs of managing and running the business, for example rent, utilities, print, stationary, legal and accounting fees. Administrative expenses (2017) Administrative expenses (2016) Other operating income Income from other trading activities, for example, subletting a property, or selling goods as a sideline to your main business. Other operating income (2017) Other operating income (2016) Operating profit (or loss) Calculation: Gross profit or (loss) minus distribution costs and administrative expenses, plus other operating income. Operating profit (or loss) (2017) Operating profit (or loss) (2016) Interest receivable and similar income Interest earned or owed to the company, for example bank interest or interest from loans. Interest receivable and similar income (2017) Interest receivable and similar income (2016) Interest payable and similar charges Interest paid by the company, for example on loans or overdrafts. Interest payable and similar charges (2017) Interest payable and similar charges (2016) Profit (or loss) before tax Calculation: Operating profit or (loss) plus interest receivable and similar income, minus interest payable and similar charges. Profit (or loss) before tax (2017) Profit (or loss) before tax (2016) Tax on profit Your taxable income is profit or (loss) before tax minus any reliefs due. Work out Corporation Tax due on taxable income using latest rates link opens in a new tab/window. Tax on profit (2017) Tax on profit (2016) Profit (or loss) for the financial year Calculation: Profit or (loss) before tax minus tax on profit. Profit (or loss) for the financial year (2017) Profit (or loss) for the financial year (2016) Next {% endblock %}
Complete all items that are included in your prepared accounts.
Also called sales, revenue or income. The total amount this period from selling goods or services, excluding VAT.
The costs directly involved in producing or delivering goods and services, for example, materials or shipping.
Calculation: Turnover minus cost of sales.
Costs like packaging, transporting or storing the goods or services sold.
The costs of managing and running the business, for example rent, utilities, print, stationary, legal and accounting fees.
Income from other trading activities, for example, subletting a property, or selling goods as a sideline to your main business.
Calculation: Gross profit or (loss) minus distribution costs and administrative expenses, plus other operating income.
Interest earned or owed to the company, for example bank interest or interest from loans.
Interest paid by the company, for example on loans or overdrafts.
Calculation: Operating profit or (loss) plus interest receivable and similar income, minus interest payable and similar charges.
Your taxable income is profit or (loss) before tax minus any reliefs due.
Work out Corporation Tax due on taxable income using latest rates link opens in a new tab/window.
Calculation: Profit or (loss) before tax minus tax on profit.


Salary Calculator
Add Employee
Submit
Employees
First Name
Last Name
ID
Title
Annual Salary
Total Monthly:


{% load static %}
Fake News Links is a free public API for collecting, tracking, and monitoring fake news articles. Our goal is to crowdsource a comprehensive, annotated dataset of URLs that contain primarily false information, but is presented as news. This dataset can then be used by anyone interested in making sure that the news they read is real.
Contribute a URL to Fake News Links. In doing so, you are helping to fight the spread of false information on the internet. You can also explore URLs that have been contributed so far.
Now, you don't need to sign up. When you contribute, the only information we collect, aside from the URL, is the date/time and the location from your browser (which you can opt out of). Including location like this allows combined analysis with other datasets.
Fake News Links has ??? URLs so far.
| URL | Added |
|---|
Visit https://fakenewslinks.com/api/ to browse the API.
No authentication is needed.
Made with Django and Django REST framework.
Web theme from the Grayscale Bootstrap 3 theme created by Start Bootstrap.
Stock photos by Gratisography.
Launched with Skyliner.


{{category.subtitle}}
This may take a few seconds depending on your network connection and browser performance. Copyright by shilch
Your browser is outdated. Update it to a newer version to ensure taht this builder works properly. Google Chrome is recommended.


This option specifies that if any conflicts occur, modified files will be uploaded to
form the "tip" (latest) version of the file. No merge will take place and there is the
potential for other conflicting changes to be "hidden".
This option will not work with streams and is ignored.


GOLDEN HOUR
18 May, 8pm
Celebrate Reel Festivals at The Golden Hour
Edinburgh’s premiere literary cabaret featuring new Arabic and English translations from these thrilling local and international writers:
William Letford
William Letford lives in Stirling, Scotland and works as a roofer. In 2008 he received a New Writer’s Award from the Scottish Book Trust, and an SQA Star Award. He has been published in various magazines and anthologies including Poetry Scotland and New Writing Scotland.
Emily Ballou
Emily Ballou is a Glasgow-based Australian-American poet, screenwriter and novelist. She is the author of the novels Father Lands and Aphelion (Picador), and the recent verse-portrait of Charles Darwin The Darwin Poems (UWA Publishing). She lives in Glasgow, Scotland.
Tom Pow
Tom Pow was the first Writer in Residence at the Edinburgh International Book Festival, 2001, 2002 and 2003. He was StAnza’s Poet in Residence in 2005. Dear Alice Narratives of Madness (Salt) won the poetry category in the Scottish Mortgage Investment Trust Book Awards in 2009. In the Becoming, New and Selected Poems (Polygon), was published in 2009.
Rasha Omran
Rasha Omran is a Syrian poet with a degree in Arabic literature from Damascus University. Since 1997 she has published four collections of poetry: Rajaa Lahu Shakal al-Haya; Ka’ana Manfay Jasady; Thilak al-Mumatad Fi Aqsa Hanini and Ma’atif Ahmar Faragh as well as compiling an anthology of Syrian Poetry. She is the director of the
annual Al-Sindiyana festival of culture in Syria.
Golan Haji
Golan Haji is a Syrian poet, with a postgraduate degree in pathology. He has published a number of books including Called in Darkness (2004) which won the ‘Al-Maghut’ prize in poetry; and Someone Sees You as a Monster (2008). His next collection My Cold Faraway Home will be published in Autumn 2011. He has also translated various works into Arabic including the Scottish classic - Stevenson’s Dr. Jekyll and Mr. Hyde. He lives in Damascus.
Mazen Maarouf
Mazen Maarouf is a Palestinian poet and journalist, living as a refugee in Beirut. He has published a number of books including Kaan Hoznona Khobz/It was our sadness as bread (2000) and Camera La Taltaket Al Aasafir/The camera does not frame birds (2004). His most recent collection of poetry is currently in press and he is also
translating the poems of William Blake into Arabic.
Yehia Jaber
Yehia Jaber is a Lebanese poet, playwright, communist, journalist and actor. Amongst other literary and political works, he has published six collections of poetry: A Pool of Serum (1988); The Rascals (1991); Take The Book By Force (1994); Like If I Was A Divorced Woman (2007); For Adults Only (2008); and Love In A Washing Machine (2010). In 2010 he performed his previous poetry collection as a theatrical work
entitled O Yahya Jaber, Take The Book By Force (Stand Up Poetry). He lives in Beirut.
All this plus short films and an eclectic range of music from Scotland and the the Levant including OkyDoky, Belvedere Mountain Express and Hiva Oa!


Diatonic triads built from the natural minor scale follow the same pattern as those found in the major scale. We can think of a natural minor scale in terms of Do Re Mi, but it would start on "La" and cycle through until it returned to "La".
| Scale Tone | 1 | 2 | 3 | 4 | 5 | 6 | 7 | (1 or 8) |
| Solfeg (Minor) | La | Ti | Do | Re | Mi | Fa | So | (La) |
| Triad | 135 | 246 | 357 | 461 | 572 | 613 | 724 | (135) |
| Triad (Solfeg) | LaDoRe | TiReFa | DoMiSo | ReFaLa | MiSoTi | FaLaDo | SoTiRe | (LaDoRe) |
| Triad Quality | Minor | Diminished | Major | Minor | Minor/Major | Major | Major | (Minor) |
| Symbol | i | ii° | III | iv | v/V | VI | VII | (i) |
Compared to the Natural Minor, the Harmonic Minor has a raised 7th degree (by one half-step)and the Melodic Minor has a raised 6th and 7th degree (also by one half-step each).


Stock Price Plotter web app built using Flask, WT-Forms, Bootstrap, Quandl, Bokeh and Pandas under Python 2.7.


Systemd Cheatsheet
written by Daniel Vogelbacher
Feedback: Github Issue Tracker
System state
- Power off the system
-
systemctl poweroff
- Reboot the system
-
systemctl reboot
- Suspend the system
-
systemctl suspend
- Hibernate the system
-
systemctl hibernate
- Hibernate and suspend the system
-
systemctl hybrid-sleep
- Action on power button
- Can be configured in /etc/systemd/logind.conf by HandlePowerKey.
- Action on LID switch
- Can be configured in /etc/systemd/logind.conf by HandleLidSwitch.
Daemon control
- Reload configuration after changes
-
systemctl [--user] reload-daemon
--user Reload only user configuration.
User management
- Automatic start-up of systemd user instances
-
loginctl enable-linger user-name
Manage services
- Start/stop service
-
systemctl start|stop <servicename>
- Restart service
-
systemctl restart <servicename>
- Restart if service is already running.
-
systemctl condrestart <servicename>
- Reload configuration files
-
systemctl reload <servicename>
- Start service at boot
-
systemctl enable <servicename>
- Prevent service start at boot
-
systemctl disable <servicename>
- Check if service is configured to autostart.
-
systemctl is-enabled <servicename>
Analyze and debug
- Show system status
-
systemctl status
- List running units
-
systemctl list-units
- List failed units.
-
systemctl --failed
- Find long running services
-
systemd-analyze blame
- Plot dependency graph as SVG
-
systemd-analyze plot > graph.svg
Modify services/units
You can override or extend an existing system unit, for example to add additional dependencies or change the executable arguments.
- Modify unit
-
systemctl edit sshd
Opens /etc/systemd/system/sshd.d/override.conf and reloads the unit when done editing.
- Replace unit
-
systemctl edit --full sshd
Opens /etc/systemd/system/sshd (copying installed version) and reloads the unit when done editing.
- Revert to vendor version
-
systemctl revert sshd
- Show effective unit
-
systemctl cat sshd
Show content of unit after apply all overrides.
- Find differences
-
systemd-diff
Show diff for modified unit files.
Runlevels
- Determine which target is used by default.
-
systemctl get-default
- Set the default target (runlevel).
-
systemctl set-default multi-user.target
- Switch to another runlevel (target).
-
systemctl isolate graphical.target
Timers
Timers are a replacement for cronjob.
- List timers
-
systemctl list-timers
- Create timer
- Create new unit: https://wiki.archlinux.org/index.php/Systemd/Timers
Logging (Basics)
- Show complete log
-
journalctl
-r Show log in reverse order.
-x Show explainations for log entries.
-e Force pager to show the last page.
- Show log for specific unit
-
journalctl -u postfix
- Write to log from shell
-
echo "Hello World" | systemd-cat -t my-tag -p info
logger is still possible with journald, but system-cat has more features.
- Start program and redirect stdout to log
-
systemd-cat /bin/ls
Logging (Advanced)
- Show log by unit pattern
-
journalctl -u postfix* -u dovecot*
- Watch for new log entries (follow)
-
journalctl -u nginx* -f
- Filter by priority
-
journalctl -u ntp -p emerg..warning
Log levels:
emerg 0 alert 1 crit 2 err 3 warning 4 notice 5 info 6 debug 7 - Show all critical logs
-
journalctl -p crit
- Filter by date
-
journalctl -u postfix -S "-5 minutes"
orjournalctl -u postfix -S "today"
- Show only kernel messages
-
journalctl -k
Logging (Coexistence)
- Systemd's journald replaces the old syslog daemons.
- Basically this is done by providing /dev/log which is connected to journald.
- The syslog() API writes to /dev/log and thus messages are forwared to journald.
- Persistent logs
-
Important: journald default configuration is to keep all log messages in memory (lost after a reboot).
Change /etc/systemd/journald.conf to make journal persistent.
- rsyslog
-
If rsyslog is installed, default behavior for systemd is to forward log messages to rsyslog which can filter and store messages in well known locations like /var/log/auth.log.
Configuation files
- System units
-
/usr/lib/systemd/system/ ⁘ Units provided by installed packages /etc/systemd/system/ ⁘ Units installed by the sysadmin - User units
-
/etc/systemd/user/ ⁘ System-wide user units installed by the sysadmin ~/.local/share/systemd/user/ ⁘ Units provided by user-installed packages ~/.config/systemd/user/ ⁘ Custom user units installed by users


◆ __init__()
| def pfem_2_process.PFEM2Process.__init__ |
( |
|
self, |
|
|
|
model, |
|
|
|
settings |
|
) |
| |
◆ compute_mass_correction_factor()
| def pfem_2_process.PFEM2Process.compute_mass_correction_factor |
( |
|
self | ) |
|
◆ ExecuteBeforeSolutionLoop()
| def pfem_2_process.PFEM2Process.ExecuteBeforeSolutionLoop |
( |
|
self | ) |
|
◆ ExecuteFinalizeSolutionStep()
| def pfem_2_process.PFEM2Process.ExecuteFinalizeSolutionStep |
( |
|
self | ) |
|
◆ ExecuteInitialize()
| def pfem_2_process.PFEM2Process.ExecuteInitialize |
( |
|
self | ) |
|
◆ ExecuteInitializeSolutionStep()
| def pfem_2_process.PFEM2Process.ExecuteInitializeSolutionStep |
( |
|
self | ) |
|
◆ discriminate_streamlines
| pfem_2_process.PFEM2Process.discriminate_streamlines |
◆ echo_level
| pfem_2_process.PFEM2Process.echo_level |
◆ filter_factor
| pfem_2_process.PFEM2Process.filter_factor |
◆ full_reset_boundary_conditions
| pfem_2_process.PFEM2Process.full_reset_boundary_conditions |
◆ initial_water_volume
| pfem_2_process.PFEM2Process.initial_water_volume |
◆ lagrangian_model_part
| pfem_2_process.PFEM2Process.lagrangian_model_part |
◆ model_part
| pfem_2_process.PFEM2Process.model_part |
◆ moveparticles
| pfem_2_process.PFEM2Process.moveparticles |
◆ print_particles
| pfem_2_process.PFEM2Process.print_particles |
◆ reset_boundary_conditions
| pfem_2_process.PFEM2Process.reset_boundary_conditions |
◆ use_mesh_velocity
| pfem_2_process.PFEM2Process.use_mesh_velocity |
The documentation for this class was generated from the following file:
- /home/runner/work/Documentation/Documentation/master/applications/PFEM2Application/python_scripts/pfem_2_process.py


--- layout: archive title: Zulip Chat Archive permalink: /stream/113488-general/topic/unreachable.20code.html ---
sometimes _
causes "unreachable code" error. it is quite clear that they won't fix it, so I'm not here to "feed the fed horse". Rather, I think I've found a temporary fix by just replacing _
with by skip
or any tactic mode thing at all
That's a bit vague. Do you have an example?
instance : group (ℕ × ℕ) := { mul := λ _ _, (_, _) }
@Sebastian Ullrich known bug?
Probably not. Probably not worth fixing, either?
To be honest, the Lean 4 error messages are so bad right now that I don't see any problem at all with this :laughing:
Oh dear!
{% endraw %}Last updated: Apr 24 2020 at 19:02 UTC


There will probably be a function to create a map in one run in the next major version of {DatawRappr}. In the meantime, I wrote this tutorial:
There are three map types in Datawrapper: locator, symbol and choropleth. I’m trying to explain in short, how you can use DatawRappr to create a map programmatically for symbols and choropleths. And as an add-on: How to create a tooltip using {DatawRappr}.
Why exclude Locator-maps? They are a little tricky and probably not so heavily automated compared to choropleths and symbols. That’s why I decided place them a little lower on my priority list and keep them out here. There is a tutorial on Locator-maps with the API by Datawrapper using curl
.
The basic steps are always the same:
map
.If you want to update the data, you will only need steps 2 and 4.
You can use this code to create a new chart and save the chart to your current environment. You don’t have to save it. You will just need the chart-id later.
new_choropleth_chart <- dw_create_chart( title = "This is a automated choropleth map", type = "d3-maps-choropleth" ) #> New chart's id: qt3eo
We will now upload some data to our newly created map. Beforehand, we have to decide on an basemap and a key that maps the data to the chart.
Datawrapper provides an API-endpoint with their basemaps, which you might curl
Or you can use the built-in dataframe in DatawRappr:
head(dw_basemaps) #> # A tibble: 6 x 6 #> id level slug value label description #> <chr> <chr> <chr> <chr> <chr> <chr> #> 1 world-20… World world DW_NAME Name The three-letter ISO-code of… #> 2 world-20… World world DW_STATE_C… ISO-Code The written name of the coun… #> 3 world-20… World world GERMAN_NAM… Name (Germa… The written name of the coun… #> 4 world-20… World world GERMAN_NAME Name old (G… The written name of the coun… #> 5 africa-2… Africa africa DW_NAME Name The three-letter ISO-code of… #> 6 africa-2… Africa africa DW_STATE_C… ISO-Code The written name of the coun…
First, you have to decide, which map to use. It is identified by the id
-column.
You can use dplyr’s View()
to get an interactive table. Or you might want to filter using grepl()
dw_basemaps %>% filter(grepl("us-nyc", id)) #> # A tibble: 10 x 6 #> id level slug value label description #> <chr> <chr> <chr> <chr> <chr> <chr> #> 1 us-nyc-bor… USA » New York C… usa-new-york-c… BoroN… Borough … "Name of the … #> 2 us-nyc-cen… USA » New York C… usa-new-york-c… BoroC… BoroCT20… "" #> 3 us-nyc-cen… USA » New York C… usa-new-york-c… geoid GEOID co… "" #> 4 us-nyc-cit… USA » New York C… usa-new-york-c… CounD… Council … "" #> 5 us-nyc-com… USA » New York C… usa-new-york-c… BoroCD Boro CD … "" #> 6 us-nyc-hoo… USA » New York C… usa-new-york-c… NTANa… NTA Name "" #> 7 us-nyc-hoo… USA » New York C… usa-new-york-c… NTACo… NTA Code "" #> 8 us-nyc-pol… USA » New York C… usa-new-york-c… Preci… Precinct… "" #> 9 us-nyc-sch… USA » New York C… usa-new-york-c… Schoo… School D… "" #> 10 us-nyc-zip… USA » New York C… usa-new-york-c… ZIPCO… ZIP code ""
In a second step, you have to choose a key for the map, which is identified in value
. label
and description
provide some more details about it.
The key is the variable that binds the data to the map.
dw_basemaps %>% filter(grepl("germany-nuts3", id)) #> # A tibble: 2 x 6 #> id level slug value label description #> <chr> <chr> <chr> <chr> <chr> <chr> #> 1 germany-n… Germany » NUTS3… germany-nuts… NUTS_N… Name The written name of t… #> 2 germany-n… Germany » NUTS3… germany-nuts… NUTS_ID Code code / desc
In this example the basemap germany-nuts3
offers two key-options: NUTS_ID
and NUTS_NAME
. If you already have one of these options in your dataset, select the right one.
Otherwise, you will have to wrangle the data anyway.
Getting Country IDs
You can easily transform country names in various formats and languages with the {countrycode}-package. In most cases you won’t need a manual translation table. The package is available via CRAN or Github.
After installation, simply add a column with something like countrycode::countrycode(sourcevar = SOURCE VARIABLE, origin = "country.name.de", destination = "iso3c")
to your dataframe.
Just in case you need it: You can retrieve the expected keys for a basemap by calling this API-endpoint. Simply enter the id
of the basemap and the value
of the key:
you could also use the {jsonlite}-package for this task:
library(jsonlite) r <- fromJSON("https://api.datawrapper.de/plugin/basemaps/germany-states/name") r$data$values #> [1] "Nordrhein-Westfalen" "Baden-Württemberg" "Hessen" #> [4] "Bremen" "Niedersachsen" "Thüringen" #> [7] "Hamburg" "Schleswig-Holstein" "Rheinland-Pfalz" #> [10] "Saarland" "Bayern" "Berlin" #> [13] "Sachsen-Anhalt" "Sachsen" "Brandenburg" #> [16] "Mecklenburg-Vorpommern"
We are using a simple dataset for German States here as an example: It contains the share of foreign population per German federal state (source: Federal Statistical Office Germany (Destatis)).
df_foreign_pop <- read.csv("data/foreign_pop.csv", stringsAsFactors = FALSE) str(df_foreign_pop) #> 'data.frame': 16 obs. of 2 variables: #> $ state : chr "Baden-Württemberg" "Bayern" "Berlin" "Brandenburg" ... #> $ share_foreign_population: num 15.5 13.2 18.5 4.7 18.1 16.4 16.2 4.5 9.4 13.3 ...
You can simply upload the data as you would do with any other {DatawRappr}-chart.
dw_data_to_chart(df_foreign_pop, chart_id = new_choropleth_chart) #> Data in qt3eo successfully updated.
The metadata of a chart gives us the full flexibility to change what we want to change. In this case, we have to set the axes. A chart in Datawrapper returned as a JSON-Object, which contains differents sublevels. One of those is called metadata and contains the relevant keys:
"metadata": {
"axes": {
"keys": "KEY FROM DATA",
"values": "VALUE FROM DATA"
},
"visualize": {
"basemap": "ID of the basemap",
"map-key-attr": "VALUE of the map key"
}
}
In our example from above, we are using the names of the German federal states as the IDs. We will therefore use the basemap germany-states with the value name. name consists of the keys that are already present in our dataset in the state-column. So we don’t need any transformation here. We just need to tell Datawrapper which column to use.
dw_edit_chart(new_choropleth_chart, axes = list( keys = "state", values = "share_foreign_population" ), visualize = list( basemap = "germany-states", "map-key-attr" = "name" ) ) #> Chart qt3eo succesfully updated.
At that point, you might want to switch to Datawrapper’s UI to make the final adjustments to the legend before publishing. But: You could do them via dw_edit_chart
as well. It’s probably just not that much fun.
This is probably the easiest part:
dw_publish_chart(new_choropleth_chart) #> Chart qt3eo published!### Responsive iFrame-code: ### #>  #> #> ### Chart-URL:### #> https://datawrapper.dwcdn.net/qt3eo/1/
A symbol map maps a certain value to a geographic location. We will use predefined coordinates here. Datawrapper’s user interface allows geocoding of adresses.
The workflow is pretty similar to the choropleth map. The main difference: We will use Latitude and Longitude coordinates, instead of the key.
You can use this code to create a new chart and save the chart to your current environment. You don’t have to save it. You will just need the chart-id later.
new_symbol_chart <- dw_create_chart( title = "This is a automated symbol map", type = "d3-maps-symbols" ) #> New chart's id: MyjEc
We will now upload some data to our newly created map. Beforehand, we have to decide on an basemap.
Datawrapper provides an API-endpoint with their basemaps, which you might curl
Or you can use the built-in dataframe in {DatawRappr}:
head(dw_basemaps) #> # A tibble: 6 x 6 #> id level slug value label description #> <chr> <chr> <chr> <chr> <chr> <chr> #> 1 world-20… World world DW_NAME Name The three-letter ISO-code of… #> 2 world-20… World world DW_STATE_C… ISO-Code The written name of the coun… #> 3 world-20… World world GERMAN_NAM… Name (Germa… The written name of the coun… #> 4 world-20… World world GERMAN_NAME Name old (G… The written name of the coun… #> 5 africa-2… Africa africa DW_NAME Name The three-letter ISO-code of… #> 6 africa-2… Africa africa DW_STATE_C… ISO-Code The written name of the coun…
First, you have to decide, which map to use. It is identified by the id
-column.
You can use dplyr’s View()
to get an interactive table. Or you might want to filter using grepl()
dw_basemaps %>% filter(grepl("us-nyc", id)) #> # A tibble: 10 x 6 #> id level slug value label description #> <chr> <chr> <chr> <chr> <chr> <chr> #> 1 us-nyc-bor… USA » New York C… usa-new-york-c… BoroN… Borough … "Name of the … #> 2 us-nyc-cen… USA » New York C… usa-new-york-c… BoroC… BoroCT20… "" #> 3 us-nyc-cen… USA » New York C… usa-new-york-c… geoid GEOID co… "" #> 4 us-nyc-cit… USA » New York C… usa-new-york-c… CounD… Council … "" #> 5 us-nyc-com… USA » New York C… usa-new-york-c… BoroCD Boro CD … "" #> 6 us-nyc-hoo… USA » New York C… usa-new-york-c… NTANa… NTA Name "" #> 7 us-nyc-hoo… USA » New York C… usa-new-york-c… NTACo… NTA Code "" #> 8 us-nyc-pol… USA » New York C… usa-new-york-c… Preci… Precinct… "" #> 9 us-nyc-sch… USA » New York C… usa-new-york-c… Schoo… School D… "" #> 10 us-nyc-zip… USA » New York C… usa-new-york-c… ZIPCO… ZIP code ""
We are using a simple dataset for German States here as an example: It contains the share of foreign population per German federal state (source: Federal Statistical Office Germany (Destatis)).
df_foreign_pop_symbol <- read.csv("data/foreign_pop_symbol.csv", stringsAsFactors = FALSE) str(df_foreign_pop_symbol) #> 'data.frame': 16 obs. of 4 variables: #> $ Lat : num 48.6 48.9 52.5 52.8 53.1 ... #> $ Lon : num 9.19 11.4 13.39 13.25 8.81 ... #> $ name : chr "Baden-Württemberg" "Bayern" "Berlin" "Brandenburg" ... #> $ share_foreign_population: num 15.5 13.2 18.5 4.7 18.1 16.4 16.2 4.5 9.4 13.3 ...
The data is already geocoded into the Lat and Lon-columns. They are required for the symbol map.
Geocoding Adresses
There are loads of resources on how to geocode places with R. For example, you might want to check out the {ggmap}-package. Unfortunately geocoding with Google does require an API-Key.
For open alternatives you might have a look at hrbrmstr’s {nominatim} or the geocode_OSM()
-function in {tmaptools}.
With Lat and Lon-columns set, you can simply upload the data as you would do with any other {DatawRappr}-chart.
dw_data_to_chart(df_foreign_pop_symbol, chart_id = new_symbol_chart) #> Data in MyjEc successfully updated.
The metadata of a chart gives us the full flexibility to change what we want to change. In this case, we have to set the axes. A chart in Datawrapper returned as a JSON-Object, which contains differents sublevels. One of those is called metadata and contains the relevant keys:
"metadata": {
"axes": {
"lat": "Lat-Col",
"lon": "Lon-Col",
"area": "Value-Col",
"values": "Value-Col"
},
"visualize": {
"basemap": "world-2019"
}
}
In our example from above, we are using the names of the German federal states as the IDs. We will therefore use the basemap germany-states. We just need to tell Datawrapper which basemap and columns to use for the mapping. Further options in axes
would be:
area
: for the area/size of the symbolvalue
: for the color of the symboldw_edit_chart(new_symbol_chart, axes = list( lat = "Lat", lon = "Lon", area = "share_foreign_population" ), visualize = list( basemap = "germany-states" ) ) #> Chart MyjEc succesfully updated.
At that point, you might want to switch to Datawrapper’s UI to make the final adjustments to the legend before publishing. But: You could do them via dw_edit_chart
as well. It’s probably just not that much fun.
This is probably the easiest part:
dw_publish_chart(new_symbol_chart) #> Chart MyjEc published!### Responsive iFrame-code: ### #>  #> #> ### Chart-URL:### #> https://datawrapper.dwcdn.net/MyjEc/1/
Including a tooltip is a task that is not only useful for maps, but also for scatterplots. The way to change them via tha API are pretty easy. Just use the visualize
-argument in dw_edit_chart()
and add a list which includes another list called tooltip
.
tooltip has three different keys:
body
: which is the body text of the tooltip. Add double brackets ton include a variable: {{ variable }}
.title
: is the title of the tooltip. It may also contain a variable with double brackets.fields
: is a list that contains the mapping between the chart data and the variables in the tooltips. You have to include each variable here that is used in the tooltip double brackets in the format: "variable in tooltip" = "variable in data"
. You may (although it makes things more complicated) map variables to different names, as shown below where "name" = "b"
.dw_edit_chart(CHART_ID, visualize = list( tooltip = list( body = "{{ name }} has value {{ a }}.", title = "{{ name }}", fields = list( "name" = "b", "a" = "a" ) )))


Easily create pretty popup messages (modals) in 'Shiny'. A modal can contain text, images, OK/Cancel buttons, an input to get a response from the user, and many more customizable options.
| Version: | 1.0 |
| Depends: | R (≥ 3.0.2) |
| Imports: | digest, shiny (≥ 1.0.4), stats |
| Suggests: | colourpicker, knitr, rmarkdown |
| Published: | 2018-02-12 |
| Author: | Dean Attali [aut, cre] (R interface), Tristan Edwards [aut] (sweetalert library) |
| Maintainer: | Dean Attali <daattali at gmail.com> |
| BugReports: | https://github.com/daattali/shinyalert/issues |
| License: | MIT + file LICENSE |
| URL: | https://github.com/daattali/shinyalert https://daattali.com/shiny/shinyalert-demo/ |
| NeedsCompilation: | no |
| SystemRequirements: | pandoc with https support |
| Materials: | README NEWS |
| CRAN checks: | shinyalert results |
| Reference manual: | shinyalert.pdf |
| Vignettes: |
Package shinyalert |
| Package source: | shinyalert_1.0.tar.gz |
| Windows binaries: | r-devel: shinyalert_1.0.zip, r-release: shinyalert_1.0.zip, r-oldrel: shinyalert_1.0.zip |
| OS X binaries: | r-release: shinyalert_1.0.tgz, r-oldrel: shinyalert_1.0.tgz |
| Reverse imports: | wiseR |
Please use the canonical form https://CRAN.R-project.org/package=shinyalert to link to this page.


Hi! My name is Fahrina Nurreishi, I'm 20 years old and a college student at Politeknik Negeri Banjarmasin. I'm a food enthusiast that's why I choose to make this food journal. This food journal is assignment to Human and Computer Interaction subject.


| Package | Description |
|---|---|
| java.awt |
Contains all of the classes for creating user
interfaces and for painting graphics and images.
|
| java.awt.color |
Provides classes for color spaces.
|
| java.awt.dnd |
Drag and Drop is a direct manipulation gesture found in many Graphical
User Interface systems that provides a mechanism to transfer
information between two entities logically associated with presentation
elements in the GUI.
|
| java.awt.event |
Provides interfaces and classes for dealing with different
types of events fired by AWT components.
|
| java.awt.geom |
Provides the Java 2D classes for defining and performing operations
on objects related to two-dimensional geometry.
|
| java.awt.image |
Provides classes for creating and modifying images.
|
| java.awt.print |
Provides classes and interfaces for a general printing API.
|
| java.lang |
Provides classes that are fundamental to the design of the Java
programming language.
|
| java.net |
Provides the classes for implementing networking applications.
|
| Modifier and Type | Field and Description |
|---|---|
static int |
SystemColor.ACTIVE_CAPTION
The array index for the
SystemColor.activeCaption system color. |
static int |
SystemColor.ACTIVE_CAPTION_BORDER
The array index for the
SystemColor.activeCaptionBorder system color. |
static int |
SystemColor.ACTIVE_CAPTION_TEXT
The array index for the
SystemColor.activeCaptionText system color. |
static int |
DisplayMode.BIT_DEPTH_MULTI
Value of the bit depth if multiple bit depths are supported in this
display mode.
|
static int |
Transparency.BITMASK
Represents image data that is guaranteed to be either completely
opaque, with an alpha value of 1.0, or completely transparent,
with an alpha value of 0.0.
|
static int |
BasicStroke.CAP_BUTT
Ends unclosed subpaths and dash segments with no added
decoration.
|
static int |
BasicStroke.CAP_ROUND
Ends unclosed subpaths and dash segments with a round
decoration that has a radius equal to half of the width
of the pen.
|
static int |
BasicStroke.CAP_SQUARE
Ends unclosed subpaths and dash segments with a square
projection that extends beyond the end of the segment
to a distance equal to half of the line width.
|
static int |
AlphaComposite.CLEAR
Both the color and the alpha of the destination are cleared
(Porter-Duff Clear rule).
|
static int |
SystemColor.CONTROL
The array index for the
SystemColor.control system color. |
static int |
SystemColor.CONTROL_DK_SHADOW
The array index for the
SystemColor.controlDkShadow system color. |
static int |
SystemColor.CONTROL_HIGHLIGHT
The array index for the
SystemColor.controlHighlight system color. |
static int |
SystemColor.CONTROL_LT_HIGHLIGHT
The array index for the
SystemColor.controlLtHighlight system color. |
static int |
SystemColor.CONTROL_SHADOW
The array index for the
SystemColor.controlShadow system color. |
static int |
SystemColor.CONTROL_TEXT
The array index for the
SystemColor.controlText system color. |
static int |
SystemColor.DESKTOP
The array index for the
SystemColor.desktop system color. |
static int |
AlphaComposite.DST
The destination is left untouched
(Porter-Duff Destination rule).
|
static int |
AlphaComposite.DST_ATOP
The part of the destination lying inside of the source
is composited over the source and replaces the destination
(Porter-Duff Destination Atop Source rule).
|
static int |
AlphaComposite.DST_IN
The part of the destination lying inside of the source
replaces the destination
(Porter-Duff Destination In Source rule).
|
static int |
AlphaComposite.DST_OUT
The part of the destination lying outside of the source
replaces the destination
(Porter-Duff Destination Held Out By Source rule).
|
static int |
AlphaComposite.DST_OVER
The destination is composited over the source and
the result replaces the destination
(Porter-Duff Destination Over Source rule).
|
static int |
Adjustable.HORIZONTAL
Indicates that the
Adjustable has horizontal orientation. |
static int |
SystemColor.INACTIVE_CAPTION
The array index for the
SystemColor.inactiveCaption system color. |
static int |
SystemColor.INACTIVE_CAPTION_BORDER
The array index for the
SystemColor.inactiveCaptionBorder system color. |
static int |
SystemColor.INACTIVE_CAPTION_TEXT
The array index for the
SystemColor.inactiveCaptionText system color. |
static int |
SystemColor.INFO
The array index for the
SystemColor.info system color. |
static int |
SystemColor.INFO_TEXT
The array index for the
SystemColor.infoText system color. |
static int |
BasicStroke.JOIN_BEVEL
Joins path segments by connecting the outer corners of their
wide outlines with a straight segment.
|
static int |
BasicStroke.JOIN_MITER
Joins path segments by extending their outside edges until
they meet.
|
static int |
BasicStroke.JOIN_ROUND
Joins path segments by rounding off the corner at a radius
of half the line width.
|
static int |
SystemColor.MENU
The array index for the
SystemColor.menu system color. |
static int |
SystemColor.MENU_TEXT
The array index for the
SystemColor.menuText system color. |
static int |
Adjustable.NO_ORIENTATION
Indicates that the
Adjustable has no orientation. |
static int |
SystemColor.NUM_COLORS
The number of system colors in the array.
|
static int |
Transparency.OPAQUE
Represents image data that is guaranteed to be completely opaque,
meaning that all pixels have an alpha value of 1.0.
|
static int |
DisplayMode.REFRESH_RATE_UNKNOWN
Value of the refresh rate if not known.
|
static int |
SystemColor.SCROLLBAR
The array index for the
SystemColor.scrollbar system color. |
static int |
AlphaComposite.SRC
The source is copied to the destination
(Porter-Duff Source rule).
|
static int |
AlphaComposite.SRC_ATOP
The part of the source lying inside of the destination
is composited onto the destination
(Porter-Duff Source Atop Destination rule).
|
static int |
AlphaComposite.SRC_IN
The part of the source lying inside of the destination replaces
the destination
(Porter-Duff Source In Destination rule).
|
static int |
AlphaComposite.SRC_OUT
The part of the source lying outside of the destination
replaces the destination
(Porter-Duff Source Held Out By Destination rule).
|
static int |
AlphaComposite.SRC_OVER
The source is composited over the destination
(Porter-Duff Source Over Destination rule).
|
static int |
SystemColor.TEXT
The array index for the
SystemColor.text system color. |
static int |
SystemColor.TEXT_HIGHLIGHT
The array index for the
SystemColor.textHighlight system color. |
static int |
SystemColor.TEXT_HIGHLIGHT_TEXT
The array index for the
SystemColor.textHighlightText system color. |
static int |
SystemColor.TEXT_INACTIVE_TEXT
The array index for the
SystemColor.textInactiveText system color. |
static int |
SystemColor.TEXT_TEXT
The array index for the
SystemColor.textText system color. |
static int |
Transparency.TRANSLUCENT
Represents image data that contains or might contain arbitrary
alpha values between and including 0.0 and 1.0.
|
static int |
Adjustable.VERTICAL
Indicates that the
Adjustable has vertical orientation. |
static int |
SystemColor.WINDOW
The array index for the
SystemColor.window system color. |
static int |
SystemColor.WINDOW_BORDER
The array index for the
SystemColor.windowBorder system color. |
static int |
SystemColor.WINDOW_TEXT
The array index for the
SystemColor.windowText system color. |
static int |
AlphaComposite.XOR
The part of the source that lies outside of the destination
is combined with the part of the destination that lies outside
of the source
(Porter-Duff Source Xor Destination rule).
|
| Modifier and Type | Field and Description |
|---|---|
static int |
ColorSpace.CS_CIEXYZ
The CIEXYZ conversion color space defined above.
|
static int |
ColorSpace.CS_GRAY
The built-in linear gray scale color space.
|
static int |
ColorSpace.CS_LINEAR_RGB
A built-in linear RGB color space.
|
static int |
ColorSpace.CS_PYCC
The Photo YCC conversion color space.
|
static int |
ColorSpace.CS_sRGB
The sRGB color space defined at
http://www.w3.org/pub/WWW/Graphics/Color/sRGB.html
.
|
static int |
ColorSpace.TYPE_2CLR
Generic 2 component color spaces.
|
static int |
ColorSpace.TYPE_3CLR
Generic 3 component color spaces.
|
static int |
ColorSpace.TYPE_4CLR
Generic 4 component color spaces.
|
static int |
ColorSpace.TYPE_5CLR
Generic 5 component color spaces.
|
static int |
ColorSpace.TYPE_6CLR
Generic 6 component color spaces.
|
static int |
ColorSpace.TYPE_7CLR
Generic 7 component color spaces.
|
static int |
ColorSpace.TYPE_8CLR
Generic 8 component color spaces.
|
static int |
ColorSpace.TYPE_9CLR
Generic 9 component color spaces.
|
static int |
ColorSpace.TYPE_ACLR
Generic 10 component color spaces.
|
static int |
ColorSpace.TYPE_BCLR
Generic 11 component color spaces.
|
static int |
ColorSpace.TYPE_CCLR
Generic 12 component color spaces.
|
static int |
ColorSpace.TYPE_CMY
Any of the family of CMY color spaces.
|
static int |
ColorSpace.TYPE_CMYK
Any of the family of CMYK color spaces.
|
static int |
ColorSpace.TYPE_DCLR
Generic 13 component color spaces.
|
static int |
ColorSpace.TYPE_ECLR
Generic 14 component color spaces.
|
static int |
ColorSpace.TYPE_FCLR
Generic 15 component color spaces.
|
static int |
ColorSpace.TYPE_GRAY
Any of the family of GRAY color spaces.
|
static int |
ColorSpace.TYPE_HLS
Any of the family of HLS color spaces.
|
static int |
ColorSpace.TYPE_HSV
Any of the family of HSV color spaces.
|
static int |
ColorSpace.TYPE_Lab
Any of the family of Lab color spaces.
|
static int |
ColorSpace.TYPE_Luv
Any of the family of Luv color spaces.
|
static int |
ColorSpace.TYPE_RGB
Any of the family of RGB color spaces.
|
static int |
ColorSpace.TYPE_XYZ
Any of the family of XYZ color spaces.
|
static int |
ColorSpace.TYPE_YCbCr
Any of the family of YCbCr color spaces.
|
static int |
ColorSpace.TYPE_Yxy
Any of the family of Yxy color spaces.
|
| Modifier and Type | Field and Description |
|---|---|
static int |
DnDConstants.ACTION_COPY
An
int representing a "copy" action. |
static int |
DnDConstants.ACTION_COPY_OR_MOVE
An
int representing a "copy" or
"move" action. |
static int |
DnDConstants.ACTION_LINK
An
int representing a "link" action. |
static int |
DnDConstants.ACTION_MOVE
An
int representing a "move" action. |
static int |
DnDConstants.ACTION_NONE
An
int representing no action. |
static int |
DnDConstants.ACTION_REFERENCE
An
int representing a "reference"
action (synonym for ACTION_LINK). |
| Modifier and Type | Field and Description |
|---|---|
static int |
ActionEvent.ACTION_PERFORMED
This event id indicates that a meaningful action occurred.
|
static int |
AdjustmentEvent.BLOCK_DECREMENT
The block decrement adjustment type.
|
static int |
AdjustmentEvent.BLOCK_INCREMENT
The block increment adjustment type.
|
static int |
InputMethodEvent.CARET_POSITION_CHANGED
The event type indicating a changed insertion point in input method text.
|
static int |
ComponentEvent.COMPONENT_HIDDEN
This event indicates that the component was rendered invisible.
|
static int |
ComponentEvent.COMPONENT_MOVED
This event indicates that the component's position changed.
|
static int |
ComponentEvent.COMPONENT_RESIZED
This event indicates that the component's size changed.
|
static int |
ComponentEvent.COMPONENT_SHOWN
This event indicates that the component was made visible.
|
static int |
InputMethodEvent.INPUT_METHOD_FIRST
Marks the first integer id for the range of input method event ids.
|
static int |
InputMethodEvent.INPUT_METHOD_LAST
Marks the last integer id for the range of input method event ids.
|
static int |
InputMethodEvent.INPUT_METHOD_TEXT_CHANGED
The event type indicating changed input method text.
|
static int |
AdjustmentEvent.TRACK
The absolute tracking adjustment type.
|
static int |
AdjustmentEvent.UNIT_DECREMENT
The unit decrement adjustment type.
|
static int |
AdjustmentEvent.UNIT_INCREMENT
The unit increment adjustment type.
|
static int |
MouseWheelEvent.WHEEL_BLOCK_SCROLL
Constant representing scrolling by a "block" (like scrolling
with page-up, page-down keys)
|
static int |
MouseWheelEvent.WHEEL_UNIT_SCROLL
Constant representing scrolling by "units" (like scrolling with the
arrow keys)
|
static int |
WindowEvent.WINDOW_ACTIVATED
The window-activated event type.
|
static int |
WindowEvent.WINDOW_CLOSED
The window closed event.
|
static int |
WindowEvent.WINDOW_CLOSING
The "window is closing" event.
|
static int |
WindowEvent.WINDOW_DEACTIVATED
The window-deactivated event type.
|
static int |
WindowEvent.WINDOW_DEICONIFIED
The window deiconified event type.
|
static int |
WindowEvent.WINDOW_GAINED_FOCUS
The window-gained-focus event type.
|
static int |
WindowEvent.WINDOW_ICONIFIED
The window iconified event.
|
static int |
WindowEvent.WINDOW_LOST_FOCUS
The window-lost-focus event type.
|
static int |
WindowEvent.WINDOW_OPENED
The window opened event.
|
static int |
WindowEvent.WINDOW_STATE_CHANGED
The window-state-changed event type.
|
| Modifier and Type | Field and Description |
|---|---|
static int |
PathIterator.SEG_CLOSE
The segment type constant that specifies that
the preceding subpath should be closed by appending a line segment
back to the point corresponding to the most recent SEG_MOVETO.
|
static int |
PathIterator.SEG_CUBICTO
The segment type constant for the set of 3 points that specify
a cubic parametric curve to be drawn from the most recently
specified point.
|
static int |
PathIterator.SEG_LINETO
The segment type constant for a point that specifies the
end point of a line to be drawn from the most recently
specified point.
|
static int |
PathIterator.SEG_MOVETO
The segment type constant for a point that specifies the
starting location for a new subpath.
|
static int |
PathIterator.SEG_QUADTO
The segment type constant for the pair of points that specify
a quadratic parametric curve to be drawn from the most recently
specified point.
|
static int |
PathIterator.WIND_EVEN_ODD
The winding rule constant for specifying an even-odd rule
for determining the interior of a path.
|
static int |
PathIterator.WIND_NON_ZERO
The winding rule constant for specifying a non-zero rule
for determining the interior of a path.
|
| Modifier and Type | Field and Description |
|---|---|
static int |
ConvolveOp.EDGE_NO_OP
Pixels at the edge of the source image are copied to
the corresponding pixels in the destination without modification.
|
static int |
ConvolveOp.EDGE_ZERO_FILL
Pixels at the edge of the destination image are set to zero.
|
static int |
AffineTransformOp.TYPE_BICUBIC
Bicubic interpolation type.
|
static int |
AffineTransformOp.TYPE_BILINEAR
Bilinear interpolation type.
|
static int |
DataBuffer.TYPE_BYTE
Tag for unsigned byte data.
|
static int |
DataBuffer.TYPE_DOUBLE
Tag for double data.
|
static int |
DataBuffer.TYPE_FLOAT
Tag for float data.
|
static int |
DataBuffer.TYPE_INT
Tag for int data.
|
static int |
AffineTransformOp.TYPE_NEAREST_NEIGHBOR
Nearest-neighbor interpolation type.
|
static int |
DataBuffer.TYPE_SHORT
Tag for signed short data.
|
static int |
DataBuffer.TYPE_UNDEFINED
Tag for undefined data.
|
static int |
DataBuffer.TYPE_USHORT
Tag for unsigned short data.
|
| Modifier and Type | Field and Description |
|---|---|
static int |
PageFormat.LANDSCAPE
The origin is at the bottom left of the paper with
x running bottom to top and y running left to right.
|
static int |
PageFormat.PORTRAIT
The origin is at the top left of the paper with
x running to the right and y running down the
paper.
|
static int |
PageFormat.REVERSE_LANDSCAPE
The origin is at the top right of the paper with x
running top to bottom and y running right to left.
|
static int |
Pageable.UNKNOWN_NUMBER_OF_PAGES
This constant is returned from the
getNumberOfPages
method if a Pageable implementation does not know
the number of pages in its set. |
| Modifier and Type | Field and Description |
|---|---|
static int |
Integer.MAX_VALUE
A constant holding the maximum value an
int can
have, 231-1. |
static long |
Long.MAX_VALUE
A constant holding the maximum value a
long can
have, 263-1. |
static int |
Integer.MIN_VALUE
A constant holding the minimum value an
int can
have, -231. |
static long |
Long.MIN_VALUE
A constant holding the minimum value a
long can
have, -263. |
static int |
Integer.SIZE
The number of bits used to represent an
int value in two's
complement binary form. |
static int |
Long.SIZE
The number of bits used to represent a
long value in two's
complement binary form. |
| Modifier and Type | Field and Description |
|---|---|
static int |
SocketOptions.IP_MULTICAST_IF
Set which outgoing interface on which to send multicast packets.
|
static int |
SocketOptions.IP_MULTICAST_IF2
Same as above.
|
static int |
SocketOptions.IP_MULTICAST_LOOP
This option enables or disables local loopback of multicast datagrams.
|
static int |
SocketOptions.IP_TOS
This option sets the type-of-service or traffic class field
in the IP header for a TCP or UDP socket.
|
static int |
SocketOptions.SO_BINDADDR
Fetch the local address binding of a socket (this option cannot
be "set" only "gotten", since sockets are bound at creation time,
and so the locally bound address cannot be changed).
|
static int |
SocketOptions.SO_BROADCAST
Sets SO_BROADCAST for a socket.
|
static int |
SocketOptions.SO_KEEPALIVE
When the keepalive option is set for a TCP socket and no data
has been exchanged across the socket in either direction for
2 hours (NOTE: the actual value is implementation dependent),
TCP automatically sends a keepalive probe to the peer.
|
static int |
SocketOptions.SO_LINGER
Specify a linger-on-close timeout.
|
static int |
SocketOptions.SO_OOBINLINE
When the OOBINLINE option is set, any TCP urgent data received on
the socket will be received through the socket input stream.
|
static int |
SocketOptions.SO_RCVBUF
Set a hint the size of the underlying buffers used by the
platform for incoming network I/O.
|
static int |
SocketOptions.SO_REUSEADDR
Sets SO_REUSEADDR for a socket.
|
static int |
SocketOptions.SO_SNDBUF
Set a hint the size of the underlying buffers used by the
platform for outgoing network I/O.
|
static int |
SocketOptions.SO_TIMEOUT
Set a timeout on blocking Socket operations:
|
static int |
SocketOptions.TCP_NODELAY
Disable Nagle's algorithm for this connection.
|
Submit a bug or feature
For further API reference and developer documentation, see Java SE Documentation. That documentation contains more detailed, developer-targeted descriptions, with conceptual overviews, definitions of terms, workarounds, and working code examples.
Copyright © 1993, 2015, Oracle and/or its affiliates. All rights reserved.


{% load static %}
{%block links%}{%endblock%}
{{title}}
Home
Sign In
Sign Up
"It's one thing to make a picture of what a person looks like, it's another thing to make a portrait of who they are."
{%block content%} {%endblock%} {%block scripts%}{%endblock%}


The following compatibility issues were found. If you continue, all non-compatible property editors will be converted to a Readonly/Label. You will be able to change the property editor to a compatible type manually by editing the data type after installation.
Otherwise, if you choose not to proceed, you will need to fix the errors listed below. Refer to v{{installer.current.model.newVersion}} upgrade instructions for full details.


Student Registration Form
RVCE Placement Management System
Gender
Male
Female
Other
Section
A
B
C
D
UG/PG
UG
PG
Diploma
Yes
No
Semester
1
2
3
4
5
6
7
8


{% extends 'base.html' %} {% block content %} {% for pitch in pitches %}
{{pitch.title}}
{{pitch.description}}
{{pitch.posted}}
Posted by: {{pitch.user.username}}


Chapter 8 Joint Distributions
So far, we learned about joint probabilities in Bayesian context such as \(P(A|B) = P(A,B)/P(B)\). Now, we are going to expand this concept into discrete and continuous distributions. Define \(P(X = x, Y=y) = f(x,y)\) as the probability mass function (discrete) or probability density function (continuous).
Same probability laws apply to joint distributions as well.
- \(f(x,y) \ge 0\) for all \((x,y)\).
- \(\sum_x \sum_y f(x,y) = 1\) or \(\int_x \int_y f(x,y) dx dy = 1\)
Example (Discrete): Suppose there are 10 balls in a box; 3 white, 4 black and 3 red.   (a) Find the joint probability function and (b) find the probabilities.
- Let’s first enumerate the alternatives. \((x,y)\) pair can be either of \((0,0),(0,1),(0,2),(1,1),(2,0),(1,0)\). Total number of alternatives are \(\binom{10}{2}\). To calculate, number of ways of getting 1 white and 1 black ball is \(\binom{3}{1}\binom{4}{1}\binom{3}{0}\). So, the probability will be \(\dfrac{\binom{3}{1}\binom{4}{1}\binom{3}{0}}{\binom{10}{2}}\). We can generalize it to a function.
\[f(x,y) = \dfrac{\binom{3}{x}\binom{4}{y}\binom{3}{2-x-y}}{\binom{10}{2}}\]
Let’s also make it into an R function
f_xy_ballpick <- function(x,y,picked=2,n_balls=10,n_x=3,n_y=4){
#picked is the number of balls picked
#n_balls is the total number of balls
#n_x is the number of balls belonging to rv X (white)
#n_y is the number of balls belonging to rv Y (black)
#x and y are values to our random variables their total cannot exceed picked
#If the sum of x and y is greater than picked, then its probability is zero.
if(x+y > picked){
return(0)
}
#Remember choose is the R function of binomial coefficient (or combination)
(choose(n_x,x)*choose(n_y,y)*choose(n_balls - n_x - n_y,picked-x-y))/choose(n_balls,picked)
}
f_xy_ballpick(x=1,y=1)
## [1] 0.2666667
- Using the above formula we can calculate all the probabilities within the specified region \(x+y \le 2\).
#First create an empty probability matrix.
#Let's say that columns are x = 0,1,2 and rows are y = 0, 1, 2
prob_matrix<-matrix(0,ncol=3,nrow=3)
#Indices in R start from 1 so 1,1 is actually x=0,y=0
prob_matrix[1,1]<-f_xy_ballpick(x=0,y=0)
prob_matrix[1,2]<-f_xy_ballpick(x=1,y=0)
prob_matrix[1,3]<-f_xy_ballpick(x=2,y=0)
prob_matrix[2,1]<-f_xy_ballpick(x=0,y=1)
prob_matrix[2,2]<-f_xy_ballpick(x=1,y=1)
prob_matrix[2,3]<-f_xy_ballpick(x=2,y=1)
prob_matrix[3,1]<-f_xy_ballpick(x=0,y=2)
prob_matrix[3,2]<-f_xy_ballpick(x=1,y=2)
prob_matrix[3,3]<-f_xy_ballpick(x=2,y=2)
#Let's also define the colnames and rownames of the matrix.
#paste0 is an R command which just appends statements
colnames(prob_matrix) <- paste0("x_",0:2)
rownames(prob_matrix) <- paste0("y_",0:2)
round(prob_matrix,2)
## x_0 x_1 x_2
## y_0 0.07 0.20 0.07
## y_1 0.27 0.27 0.00
## y_2 0.13 0.00 0.00
Example (continuous): (This is from the textbook, Example 3.15) A privately owned business operates both a drive-in facility and a walk-in facility. On a randomly selected day, let X and Y, respectively, be the proportions of time that the drive-in and the walk-in facilities are in use and suppose that the joint density function of these random variables is
\[ f(x,y) = \dfrac{2}{5}(2x + 3y), 0 \le x \le 1, 0 \le y \le 1 \]
and 0 for other values of x and y.
- Verify \(\int_x \int_y f(x,y) dx dy = 1\)
Find \(P[(X,Y) \in A]\), where \(A = \{(x,y)|0 < x < 1/2, 1/4 < y < 1/2\}\)
(see the book for the full calculations)
\[ \int_x \int_y f(x,y) dx dy = \int_0^1 \int_0^1 \dfrac{2}{5}(2x+3y) dx dy = 1 \]
- (see the book for the full calculations)
\[ \int_x \int_y f(x,y) dx dy = \int_{1/4}^{1/2} \int_0^{1/2} \dfrac{2}{5}(2x+3y) dx dy = 13/160 \]
Example (with special distributions)
Patients arrive at the doctor’s office according to Poisson distribution with \(\lambda = 2\)/hour.
- What is the probability of getting less than or equal to 2 patients within 2 hours?
- Suppose each arriving patient has 50% chance to bring a person to accompany. There are 10 seats in the waiting room. At least many hours should pass that there is at least 50% probability that the waiting room is filled with patients and their relatives?
Solution
- \(P(X\le 2|\lambda t = 2)= \sum_{i=0}^2 \dfrac{e^{-\lambda t}(\lambda t)^i}{i!}\)
## [1] 0.2381033
First let's define the problem. Define \(n_p\) as the number of patients and \(n_c\) is the number of company. We want \(n_p + n_c \ge 10\) with probability 50% or higher for a given \(t^*\). Or to paraphrase, we want \(n_p + n_c \le 9\) w.p. 50% or lower.
What is \(n_c\) affected by? \(n_p\). It is actually a binomial distribution problem. \(P(n_c = i|n_p) = \binom{n_p}{i} (0.5)^i*(0.5)^{n_p-i}\). It is even better if we use cdf \(P(n_c \le k|n_p) = \sum_{i=0}^{k} \binom{n_p}{i} (0.5)^i*(0.5)^{n_p-i}\).
We know the arrival of the patients is distributed with poisson. So, \(P(n_p = j|\lambda t^*) = \dfrac{e^{-\lambda t}(\lambda t)^j}{j!}\). So \(P(j + k \le N) = \sum_{a=0}^j P(n_p = a|\lambda t^*)*P(n_c \le N-a | n_p = a)\). Remember it is always \(n_c \le n_p\).
#Let's define a function
calculate_probability<-function(N=9,t_star=1,lambda=2){
#N is the max desired number of patients
the_prob<-0
for(n_p in 0:N){
the_prob <- the_prob + dpois(n_p,lambda=lambda*t_star)*pbinom(q=min(N-n_p,n_p),size=n_p,prob=0.5)
}
return(the_prob)
}
#Try different t_stars so probability is below 0.5
calculate_probability(t_star=2)
## [1] 0.8631867
## [1] 0.5810261
## [1] 0.4905249
8.0.1 Marginal Distributions
You can get the marginal distributions by just summing up or integrating the other random variable such as \(P(Y=y) = \sum_x f(x,y)\) or \(f(y) = \int_x f(x,y) dx\). Let’s calculate the marginal distribution of black balls (rv Y) in the above example.
## x_0 x_1 x_2
## y_0 0.07 0.20 0.07
## y_1 0.27 0.27 0.00
## y_2 0.13 0.00 0.00
#rowSums is an R function that calculates the sum of each row.
#It is equivalent to y_0 = prob_matrix[1,1] + prob_matrix[1,2] + prob_matrix[1,3]
rowSums(prob_matrix)
## y_0 y_1 y_2
## 0.3333333 0.5333333 0.1333333
Marginal distribution of y in the second example is calculated as follows.
\[\int_x \dfrac{2}{5}(2x+3y) dx = \dfrac{2(1+3y)}{5}\]
8.0.2 Conditional Distribution
Similar to Bayes’ Rule, it is possible to calculate conditional probabilities of joint distributions. Let’s denote g(x) as the marginal distribution of x and h(y) as the marginal distribution of y. The formula of conditional distribution of x given y is as follows.
\[f(x|y) = f(x,y)/h(y)\]
Note that conditional distribution function is useless if x and y are independent. (\(f(x|y)=f(x)\))


The difference between SEO and SEM is simply that Search Engine Optimization is part of Search engine marketing or Search marketing as it is widely known. Both processes aim in increasing visibility in search engines.
The purpose of a domain name strategy is to proactively protect your brand online by reducing the chance for others to use your brand name in their online activities, specifically, in their website URLs.
Linking strategy refers to the process of getting external pages to link to a page on your website.
Your keyword strategy should involve selecting high-performing keywords that drive relevant traffic to your business. Choosing the right keywords for advertising can make all the difference in your campaigns, determining how well your advertisements rank on Google and other search engine platforms.
Title tags are part of the meta tags that appear at the top of your HTML inside the < head> area. Think of title tags like the title of the chapter of a book. It tells people and search engines what your page is about.Title tags are also part of what makes people decide whether to visit your site when it shows up in the search results. The title tag should contain important keywords to help the search engine determine what the page is about.
Meta elements are HTML or XHTML elements used to provide information about a web page for the search engines and website users. A well-written meta description can give your site an advantage in search engine results pages (SERPs), resulting in more click-throughs to your site where you have more chances to convert that visitor into a lead or new customer.
Alt tags make it possible for search engines to properly read and understand what an image is conveying. In other words, it’s one more element on your site for search engines to crawl and another chance for you to infuse your keywords (assuming the image is relevant to your keywords). It will also help you think more strategically about the images on your page to make sure you’re maximizing your targeted keywords.
Search engine indexing is the process of a search engine collecting, parses and stores data for use by the search engine. The actual search engine index is the place where all the data the search engine has collected is stored. It is the search engine index that provides the results for search queries, and pages that are stored within the search engine index that appear on the search engine results page.
It is very possible since it is important to make a website that is competitive in the Internet. I would choose the domain name strategy and linking strategy; simply because through linking strategy, there is a way for the website to be competitive in the SEO marketing. And domain name strategy, a unique and catchy name is necessary to catch the attention of the users. With these strategies combined, the website will be much more effective on search engines and specially on marketing.


Cling Goes Public
July 25th, 2011
Cling is a completely new development, based on the opensource projects clang and LLVM. Cling is a new generation interpreter implemented as an interactive compiler interface of clang. The developer team has carefully designed the project, taking in mind the lessons that they had learn from CINT.
Cling has been developed as prototype since quite a while. We have got more manpower and we managed to improve the prototype a lot. We have gotten to stage where the project could be useful.
Since cling heavily depends on clang and LLVM we feel responsible to offer the project to the community. On July the 25-th 2011 we have announced the stable status we have and kindly asked the community for feedback. It became clear there are many people interested in it. Some of the them even asked for the status of objC/objC++!
The overall good mark is a good motivation to keep walking in that direction. We follow our milestones and we are getting there!
<< Back


Where is it sunny?
Where You Are
°C
Humidity:
%
Need Inspiration?
Lisbon
Portugal
12 hours of sun
18ºC
Cape Town
South Africa
12 hours of sun
18ºC
Sydney
Australia
12 hours of sun
18ºC


In the last year, I have developed a real interest in Buddhism, conducted a great deal of reading and began to meditate every day. For some reason, I stumbled across Salvia on line and read thru many accounts of its use. When I read about how it was supposed to be conducive to meditation and may lead to insight, I decided that it might be helpful to give it a try.
I had a fair amount of experience with psychedelics during college. However, since that time I have given up all recreational substance use, including drinking in this last year. In the past, I had always found hallucinogens very interesting and only had one minor bad experience with them. I’m a 39 year old senior professional in an industry that tests for drugs and was very, very clean.
At a head shop near our beach house, I bought some 20X extract, a glass bowl and butane torch cigar lighter since I had read that high heat would be needed. My wife would most definitely not have approved and neither would any of my friends. So, I decided that I would try it without the safety net of a sitter when my wife traveled on business. In all my past experience with hallucinogens, I had never really felt out of control, so I didn’t consider going it alone much of a risk. Plus, it was supposed to be a very short trip. I could manage it.
The night that I had the house to myself, I came home and began to get ready. I got in comfortable clothing and relaxed for a while. I packed a half bowl with the 20X extract, since I didn’t want to go overboard and went up to the bedroom. I put the bowl and lighter on the windowsill by the bed and I took a moment to get myself mentally ready and meditated for a bit.
When I felt comfortable, I sat on the edge of the bed, facing directly out the window so that I could exhale the smoke outside. I looked over at the digital clock that read 9:59, lit the butane torch and took a long hit on the pipe. I could feel the dense smoke rushing into my lungs. I held the hit for a count of 20 and then exhaled out the window.
I don’t remember putting down the pipe and lighter. I think that I lost all consciousness for a while.
In fact, all that I remember is a kaleidoscope explosion of thousands of pinwheel patterns. Like thru a kaleidoscope, if I looked at the individual pieces of the pattern, I could recognizes that they were the steeple of a church that I lived next to when I was 5 years old and hadn’t seen for over 33 years.
I became aware of the fact that I could travel into the edges of these steeples and it would lead to a whole new reality and an entirely different life. As I peered into these edges, it was like a video would play snippets of the scenes in a life – knees, hips, a room, faces. There were thousands of millions of lives. At the end of some scenes, a deep authoritative voice would say, “Wrather, wrather, wrather”. I did not understand the word at first (or the idea of language), but then realized that it was saying “would you rather”.
Somehow, I knew that I could go into any of these realities and it would become my own and would begin to make sense as a full world to me. I understood that if I chose any of these, it would become my new life – memories would return to me from that life and I would simply “come down” there and pick up living that life.
In fact, I did not know where to find my old reality. It was somewhere lost in the countless lives flashing in front of me. I couldn’t even remember which one was my reality. I couldn’t remember who I was or what my life was like – I had no idea if I would recognize it any better than any other reality. “Wrather, wrather, wrather, wrather”
Suddenly, I became really scared and began to understand that I could really hurt myself if I fell into one of these realities. Looking back, I am frightened that if I did, I would have jumped out of the third floor window that I was sitting directly in front of in this reality. Perhaps the kaleidoscoping forms were the frames of the window. It was like an intense fear of falling took hold on me and I lurched away from the pattern.
But, the pattern just kept on coming. It was like I had moved to the side of it now. The pattern was flipping at me like the pages of a book with more and more lives on rubbery orange sheets. I was completely lost. I began to panic that I was never coming down. I was panicked that could not find my old reality. Every image had something familiar for me to latch onto. I knew that I could assume any of these lives before me and it would come to feel completely normal.
Finally, I latched onto something that looked familiar and comforting. I had to fight my way back into that reality to see what more was there.  I saw more familiar things and then lost them again. I fought back and saw more.
Finally, I saw the clock and understood it as a clock. It read 10:10. I was unsure that this was the reality that I left. But, as I spent more and more time recognizing the things in this reality, I began to reorient and some memories of them returned. This reality was beginning to take hold.
(Even now, the next afternoon, I am not entirely sure that this was my old life or if I chose a new one during this experience. I am sure that if I saw something that looked familiar in any of the lives that I was shown and fought to go there like I fought to come here, I would be there now and it would all make as much sense, be full of memories and be as normal as this reality. There is no essential self.)
In this reality, only 10 minutes had passed and I was, somehow, pacing around on the other side of the room. I had no memory of moving away from the window. I was drenched in sweat. As the memories of this reality flooded back and things began to make more and more sense to me, I just wanted to turn on the light and get back to normal.
However, the book of lives kept on flipping at me in the back of my mind. Sometimes, visuals of it would come back. I became afraid that I would hurt myself and that I would not move from where I was pacing safely back and forth until it was 10:15 and I came down a bit more. The next 5 minutes passed like an eternity as I began to remember this whole life. Thinking back on what I saw, I started saying to myself over and over, “Many, many, many, many, many.”
Slowly, I was becoming more capable of rational thought and understood that I had been catapulted into a terrifying vision of Samsara, the endless cycle of birth and death. I was looking at my origins, my future and the whole of the endlessly and violently changing universe. There is no such thing as the essential self. There is nothing but everything, every form is temporary and endlessly changing. So, what was “I” could assume any part of the universe, any life and play that role perfectly normally. “I” was only here in this reality for a while and then I would go back to this wheel and assume another reality some day.
With this, I breathed and realized that there was experience outside of this cycle – that I could pull away from it a bit. I could not see what was outside of the wheel, but I realized that the vision didn’t need to completely occupy my experience, at some time, I could turn away from it and see else was there.
The vision of the violently turning wheel of Samsara slowly subsided and my surroundings became more and more familiar. It felt good to come home after being so far away for such a long time. I finally trusted myself to turn on the light, pet the dog and go downstairs for some tea.
According to the clock in the room, only 25 minutes had passed.
Be very careful with this stuff - it’s no joke. In retrospect, this was incredible, terrifying, insightful and valuable, but this reality could have easily ended with my jumping out of that window last night.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


zebra.layout.Layoutable Class
Layoutable class defines rectangular component that has elementary metrical properties like width, height and location and can be a participant of layout management process. Layoutable component is container that can contains other layoutable component as its children. The children components are ordered by applying a layout manager of its parent component.
Constructor
zebra.layout.Layoutable
()
Item Index
Methods
- add
- calcPreferredSize
- doLayout
- find
- findAll
- getBottom
- getByConstraints
- getLeft
- getPreferredSize
- getRight
- getTop
- indexOf
- insert
- invalidate
- invalidateLayout
- kidAdded
- kidRemoved
- laidout
- properties
- recalc
- relocated
- remove
- removeAt
- removeMe
- resized
- setAt
- setBounds
- setId
- setLayout
- setLocation
- setParent
- setPreferredSize
- setSize
- validate
- validateMetric
Methods
add
-
constr
-
d
Add the new children component with the given constraints
Parameters:
-
constr
Objecta constraints of a new children component
-
d
zebra.layout.Layoutablea new children component to be added
added layoutable component
calcPreferredSize
-
target
Internal implementation of the component preferred size calculation.
Parameters:
-
target
zebra.layout.Layoutablea component for that the metric has to be calculated
a preferred size. The method always returns { width:10, height:10 } as the component preferred size
doLayout
()
private
By default layoutbable component itself implements layout manager to order its children components. This method implementation does nothing, so children component will placed according locations and sizes they have set.
find
-
path
Find a first children component that satisfies the passed path expression.
Parameters:
-
path
Stringpath expression. Path expression is simplified form of XPath-like expression:
"/Panel" - find first children that is an instance of zebra.ui.Panel "/Panel[@id='top']" - find first children that is an instance of zebra.ui.Panel with "id" property that equals "top" "//Panel" - find first children that is an instance of zebra.ui.Panel recursively
Shortcuts:
"#id" - find a component by its "id" attribute value. This is equivalent of "//*[@id='a component id property']" path "zebra.ui.Button" - find a component by its class. This is equivalent of "//className" path
found children component or null if no children component can be found
findAll
-
path
-
[callback]
Find children components that satisfy the passed path expression.
Parameters:
-
path
Stringpath expression. Path expression is simplified form of XPath-like expression:
"/Panel" - find first children that is an instance of zebra.ui.Panel "/Panel[@id='top']" - find first children that is an instance of zebra.ui.Panel with "id" property that equals "top" "//Panel" - find first children that is an instance of zebra.ui.Panel recursively
Shortcuts:
"#id" - find a component by its "id" attribute value. This is equivalent of "//*[@id='a component id property']" path "zebra.ui.Button" - find a component by its class. This is equivalent of "//className" path
-
[callback]
Function optionalfunction that is called every time a new children component has been found.
return array of found children components if passed function has not been passed
getBottom
()
Integer
Get bottom padding.
bottom padding in pixel
getByConstraints
-
c
Get a children layoutable component by the given constraints.
Parameters:
-
c
zebra.layout.Layoutablea constraints
a children component
getLeft
()
Integer
Get left padding.
left padding in pixel
getPreferredSize
()
Object
Get preferred size. The preferred size includes top, left, bottom and right paddings and the size the component wants to have
return size object the component wants to have as the following structure:
{width:{Integer}, height:{Integer}} object
getRight
()
Integer
Get right padding.
right padding in pixel
getTop
()
Integer
Get top padding.
top padding in pixel
indexOf
-
c
Detect index of a children component.
Parameters:
-
c
zebra.ui.Layoutbalea children component
insert
-
i
-
constr
-
d
Insert the new children component at the given index with the specified layout constraints. The passed constraints can be set via a layoutable component that is inserted. Just set "constraints" property of in inserted component.
Parameters:
-
i
Integeran index at that the new children component has to be inserted
-
constr
Objectlayout constraints of the new children component
-
d
zebra.layout.Layoutbalea new children layoutable component to be added
an inserted children layoutable component
invalidate
()
Invalidate component layout and metrics.
invalidateLayout
()
protected
Invalidate the component layout. Layout invalidation means the component children components have to be placed with the component layout manager. Layout invalidation causes a parent component layout is also invalidated.
kidAdded
-
i
-
constr
-
d
The method can be implemented to be informed every time a new component has been inserted into the component
Parameters:
-
i
Integeran index at that the new children component has been inserted
-
constr
Objectlayout constraints of the new children component
-
d
zebra.layout.Layoutbalea new children layoutable component that has been added
kidRemoved
-
i
-
c
The method can be implemented to be informed every time a children component has been removed
Parameters:
-
i
Integera children component index at which it has been removed
-
c
zebra.layout.Layoutablea children component that has been removed
laidout
()
The method can be implemented to be informed every time the component has completed to layout its children components
properties
-
[path]
-
props
Apply the given set of properties to the given component or a number of children components.
var c = new zebra.layout.Layoutable();
c.properties({
width: [100, 100],
location: [10,10],
layout: new zebra.layout.BorderLayout()
})
c.add(new zebra.layout.Layoutable()).add(zebra.layout.Layoutable()).add(zebra.layout.Layoutable());
c.properties("//*", {
size: [100, 200]
});
Parameters:
-
[path]
String optionala path to find children components
-
props
Objecta dictionary of properties to be applied
a component itself
recalc
()
protected
By default there is no any implementation of "recalc" method in the layoutable component. In other words the method doesn't exist. Developer should implement the method if the need a proper and efficient place to calculate component properties that have influence to the component preferred size. The "recalc" method is called only when it is really necessary to compute the component metrics.
relocated
-
px
-
py
The method can be implemented to be informed every time the component has been moved
Parameters:
-
px
Integerx previous coordinate of moved children component
-
py
Integery previous coordinate of moved children component
remove
-
c
Remove the given children component.
Parameters:
-
c
zebra.layout.Layoutablea children component to be removed
a removed children component
removeAt
-
i
Remove a children component at the specified position.
Parameters:
-
i
Integera children component index at which it has to be removed
a removed children component
removeMe
()
Remove the component from its parent if it has a parent
resized
-
w
-
h
The method can be implemented to be informed every time the component has been resized
Parameters:
-
w
Integera previous width of the component
-
h
Integera previous height of the component
setAt
-
i
-
d
Replace a children component at the specified index with the given new children component
Parameters:
-
i
Integeran index of a children component to be replaced
-
d
zebra.layout.Layoutablea new children
a previous component that has been re-set with the new one
setBounds
-
x
-
y
-
w
-
h
Set the layoutable component bounds. Bounds defines the component location and size.
Parameters:
-
x
Integerx coordinate relatively to the layoutable component parent
-
y
Integery coordinate relatively to the layoutable component parent
-
w
Integera width of the component
-
h
Integera height of the component
setId
-
id
Set the given id for the component
Parameters:
-
id
Stringan ID to be set
setLayout
-
m
Set the given layout manager that is used to place children component. Layout manager is simple class that defines number of rules concerning the way children components have to be ordered on its parent surface.
Parameters:
-
m
zebra.ui.Layouta layout manager
setLocation
-
xx
-
yy
Set the layoutable component location. Location is x, y coordinates relatively to a parent component
Parameters:
-
xx
Integerx coordinate relatively to the layoutable component parent
-
yy
Integery coordinate relatively to the layoutable component parent
setParent
-
o
Set the parent component.
Parameters:
-
o
zebra.layout.Layoutablea parent component
setPreferredSize
-
w
-
h
Set the specified preferred size the component has to have.
Component preferred size is important thing that is widely
used to layout the component. Usually the preferred
size is calculated by a concrete component basing on
its metrics. For instance, label component calculates its
preferred size basing on text size. But if it is required
the component preferred size can be fixed with the desired
value.
Parameters:
-
w
Integera preferred width. Pass "-1" as the argument value to not set preferred width
-
h
Integera preferred height. Pass "-1" as the argument value to not set preferred height
setSize
-
w
-
h
Set the layoutable component size.
Parameters:
-
w
Integera width of the component
-
h
Integera height of the component
validate
()
Force validation of the component metrics and layout if it is not valid
validateMetric
()
protected
Validate the component metrics. The method is called as a one step of the component validation procedure. The method causes "recalc" method execution if the method has been implemented and the component is in invalid state. It is supposed the "recalc" method has to be implemented by a component as safe place where the component metrics can be calculated. Component metrics is individual for the given component properties that has influence to the component preferred size value. In many cases the properties calculation has to be minimized what can be done by moving the calculation in "recalc" method
Attributes
constraints
Object
The component layout constraints. The constraints is specific to the parent component layout manager value that customizes the children component layouting on the parent component.
Default: null
layout
zebra.layout.Layout
readonly
Layout manager that is used to order children layoutable components
Default: itself


We are Julie & David, a young belgian couple passionate by the local culture and environment. We fell in love with Dominican Republic and, after travelling around the world, we decided we wanted to settle here in Bayahibe and create our own diving and excursion trips. Dominican Republic is our second homeland, and we want to share a part of it with you, and make you discover its natural resources and great people!
For many people, Dominican Republic is seen as a touristic country, with only all-inclusive luxury resorts and nothing to do apart from drinking rum on the beach. Although we like the good Dominican rhum, for us, it is much more than that! We love Dominican Republic, first, because of the people. Dominican Republic is still one of the few countries in the world where people are truly good, and where foreigners are welcomed to be part of their family. Then, because of the natural and cultural beauty it has to offer.
Learn moreWe want to stay small… like a chihuahua! Our world is run by more and more big companies. We want to stay a small family business, sustainable, ethical and fair-trade, to offer some quality services at reasonable prices. We chose to buy a little Dominican style house in the village, instead of an apartment in a closed condominium, because this is where we belong. We like to live with the people, and we want to contribute to preserve Bayahibe’s village authentic life and architecture. The name Casa Chihuahua was also given because of our small dogs that we adopted and rescued, with Collares Rojos.
Learn moreWe are passionate about nature and we do our best to be as eco-friendly and sustainable as we can, like reducing the amount of plastic we use, or consuming local food products. Either when diving with us, going to an adventure trip, or staying in our Bed & Breaksfast, you can be part of some projects we support, do or learn something about how to protect the environment. We participate as volunteers in some local non-profit projects. You can join us as a volunteer too during your holidays and contribute to a coral restauration program operated by Fundemar, and add something else in the country than just money.
Learn more


Home
Introduction
Activity
Guide Book
Join Us
Letter For us
Fun
Join US
Now!
All Activity are
Free
In This Year
Only $3 for the whole school year!


{{ block title }}Tax Decison{{ endblock }} {{ block content }}
You are a government. How much will you set corporate tax rate this round?
{{ next_button }}


Ocean [av46], ocean, in The Inner Sea
Last updated Turn #78
Ocean [av46], ocean, in The Inner Sea
------------------------------------------------------------------------
3: The Savvy Aardvark [ha5r], ship, 2 hulls, 1 rowing port, 6 sails,
3: 9% damaged, arrived from Ocean [au46], owner:
3: Phantasm [n4b], Imperial Empire, marquess, with two peasants,
3: eight sailors
5: The Savvy Aardvark [ha5r], ship, 2 hulls, 1 rowing port, 6 sails,
5: 9% damaged, departed for Ocean [aw46].
Routes leaving Ocean:
North, to Ocean [au46], 6 days
East, to Ocean [av47], 6 days
South, to Ocean [aw46], 6 days
West, to Ocean [av45], 6 days
It is raining.


Are new `.js` ui frameworks and - libs a fad?
Good question!
TL-DR: Most are, except:
Frameworks - not for me!
In web UI, frameworks like BackBone, Ember and Angular might be all nice and stuff, but when you start using them to compose larger applications, things tend to break down quite easily with less experienced developers.
Developing large client-side applications requires the same modelling skillset as developing large server-side applications; the complexity is usually not located in the infrastructure, but in properly mapping boundaries and responsibilities within your solution space.
I tend to grow my architecture as my application progresses. Using frameworks you can get something up and running very fast, but they enforce you into a single way of doing things.
As I am unable to predict the future, I have no guarantees that the framework I’ve picked will be able to provide the needs I require. If the needs are not fulfilled, I’ll need to work around this respecting the framework’s approach, or implement a plugin following the framework’s conventions and respecting it’s paradigms.
This requires lots of study and a deeper understanding of the framework you are using, so now you’re spending time on learning the ins and outs of the framework, which will probably contain lots of features that are not required for your specific use case.
After a while you waste more time on the framework and it’s quirks than on your solution domain.
This is exactly the reason why I advise strongly against using frameworks for anything that is not completely known upfront.
Things like getting a http request and parsing it are unlikely to change during the life-cycle of your project, so there’s not a lot of risk involved when you opt for a certain de-facto industry-standard webserver.
UI frameworks tend to be written for certain use cases, like grids etc, but once you get in to the more complex cases, It will come back to you with a vengeance.
Frameworks are all about “Don’t call us, we’ll call you”, while libraries are about “I’ll call you”. It’s about who is in control.
What I’ve seen a lot, is that people start using these frameworks to get something up and running fast, without overthinking the architecture much. After a while, the cost of migrating becomes to high, so they end up using the framework as a top-level architecture.
Frameworks - “just say NO”, unless you can keep it contained and/or requirements are frozen forever.
Libs - yes, but …
I’ve been programming since I was seven years old. As I’m now nearing forty, I can tell you that I have seen quite a lot of fads passing by.
For example, I recall a moment where one of my product managers was dreaming about selecting personnel files from a cabinet in 3D as opposed to selecting it from a list on the screen, back when 3D was all shiny and stuff. Can you imagine that?!?!?
I’ve been doing web front-end development more than ten years now. I’ve only learned two client-side UI libraries over this decade, and this week I’m considering to invest some time in a new one.
Here’s the ramp up:
jQuery
Well, I guess nobody can ignore the importance of jQuery. It allowed us to separate behavior from representation in a proper way. The key difference between jQuery and it’s predecessors, are the way they allowed you to traverse your DOM: libraries like jQuery introduces us to declarative document traversal, so we went from (pseudo-code)
for each domEl in body.children
if domEl.id == "some-list"
for each domEl2 in domEl.children
if domEl2.id == "some-item-id"
domEl2.innerHTML = "Woohoo"
to
$("#somelist #someItemId").html("Woohoo")
So instead of specifying the computer how to traverse the DOM, we just tell him what we want, and the computer figures it out on his own, hence declarative
.
However, whenever you changed some data in your app, you still had to manually update the DOM elements. It took a decade and a plethora of frameworks to get to the next revelation.
React
When you use jQuery, most of your code ends up something like this:

<input id="some-text"/>
$("#someText").change( () => $("#some-div").html($("#some-text").val()));
This gets old really fast, especially when you have a lot of UI to update.
It also requires a lot of discipline to keep it well-structured. So can we somehow make this declarative as well?
Enter React/jsx:
var SomeComponent = React.createClass({
getInitialState: function() {
return {someText:""}
},
handleChange: function() {
this.setState({someText: this.refs.someText.value})
},
render: function() {
return (

The text in the input box is {this.someText}

<input ref="some-text" onChange={this.handleChange}/>
);
}
});
ReactDOM.render(
<SomeComponent />,
document.getElementById('content')
);
I know this example is a lot larger than the previous one, but imagine you’d have to update 20 DOM elements. In react, all you do is set the state, the lib does everything else for you.
Another thing that’s not really obvious when you first start, is that React is really - and I mean really - picky about which component owns which data. This enforces you to properly structure your application, and think about these boundaries that we consider so important.
Another thing to notice is that, while react only updates the DOM elements that require updating, it does this with an intermediate step using VirtualDom
, so whenever an element in your view requires re-rendering, react renders the whole tree, diffs it with the old version, and than updates the DOM.
Next to this, you should also notice the whole getInitialState
and the use of setState
. Why can’t I just declare the data on my component and modify it using regular JavaScript ops?
The new kid on the block: Vue.js
Welcome to vue.js. Vue.js is like React, but without the warts: it doesn’t require VirtualDom, but just updates the relevant dom elements based on the changes of your state.  Let me show you an example for this code in vue.js:

The text in the input box is {{someText}}

<input v-model="someText" />

new Vue({
el: '#some-div',
data: {
someText: ''
},
})
So, the whole thing is declarative now. But there’s more: every Vue instance is also a proxy for it’s data, so you can both read and change data by using the default JavaScript this.someText = "abc"
. If you make your instance global and set it in the JavaScript console, your view will still update. So no more ugly setState
, setInitialState
etc.
There’s more: vue allows you to define computed properties on your data, and what’s even better, is that it knows which computed properties it needs to recompute in order to stay up to date.
So it has all the benefits of react, but without the ugly setState
or the overhead of the VirtualDom.
And, by the way, your data no longer needs to be owned by a component; you can now have data as the root, and pass it in to your components. So there is no longer the need for a flux/redux architecture if you are using a rather straightforward app.
Finally, vue.js puts the declarative back in the views. As react is basically javascript, you had to re-introduce things like if statements and for-loops in your jsx.  Vue opted for attributes like v-for
and v-if
, which allow you to get rid of the ugly warts in your jsx files.
UPDATE: here’s an example why declarative is better in templates:
@jen20 here's an example: I need a loop, but I don't want to create a child component. also : closing brackets etc. pic.twitter.com/CFhpO8N6Ug
— Tom Janssens (@ToJans) 28 oktober 2015
Finally, on learning libs and frameworks:
I tend to take month-long sabbaticals to learn new things; over the years I’ve studied F#, Erlang, Haskell, TDD, BDD, DDD, CQRS, …
However, I tend to be picky in what I choose; every single thing had something that would somehow require me to change the way I think about things on a higher level.
On the opposite side: recently I learned about BackBone/Marionette so I could help on a project, but it wasn’t exactly a stimulating experience as no new paradigms were introduced.
I try to invest my learning time in things that will actually make a difference
Which is exactly why I think you should at least take a look at vue.js right now.
The added benefit over react is not that large that it will make me rewrite my react apps into vue apps, but I’ll probably use it for new projects.
PS: on ELM
For the ones asking: I did take a look to ELM, but for me the whole FRP things feels too alien from HTML. I’d rather implement my domain logic in a typed functional language, and use simple javascript for the representation.


Delegate for the encryption service.
Called when the encryption service has been.
- (void)serviceEncryptionUpdatedOnService:(SDLServiceType)type
encrypted:(BOOL)encrypted
error:(NSError *_Nullable)error;
func serviceEncryptionUpdated(serviceType type: SDLServiceType, isEncrypted encrypted: Bool, error: Error?)
will return whichever type had an encryption update (for now probably only SDLServiceTypeRPC), but it could also apply to video / audio in the future.
return true if the encryption service was setup successfully, will return false if the service is presently not encrypted.
will return any error that happens or nil if there is no error.


Stealthy python leaps from pond to catch deer as its stops for a drink
Incredible footage captured at the watering hole in Maharashtra, India, shows the snake using it's sneaky hunting skills to devastating effect
by Lila RandallIncredible footage shows the moment an enormous python leaps from a pond to catch a wild deer as it drinks.
The unfortunate animal was with several other members of its herd as they stopped to rehydrate at the pool of water in Maharashtra, India.
The CCTV footage shows the herd of deer sensing danger at the watering hole as they timidly go back and forth to the water’s edge.
But it isn’t long before the serpent seizes its opportunity to ambush the helpless animal by rocketing out of the water at lightening speed.
It then sinks its fangs into the deer as it goes in for the kill on the muddy banks of the swamp in the Karwa forest.
The shock of the attack sees the deer squirming but only for a brief moment as the snake quickly coils itself around its prey and wrestles until its lifeless.
For almost a minute, the snake, now tightly knotted around the deer, squeezes as the pair bob in the shallows of the water.
The Central Chanda Forest Department released CCTV footage on November 21 showing the eye-popping incident.
Maharashtra is rich in biodiversity, with the central-western Indian state home to at least seven national parks and wildlife sanctuaries.
Last month, a 15-foot python weighing nearly 70kg was rescued from a sugarcane field in Hapur that took six men to remove it from the village, ANI, an Asian media site, reported.
Gyanendra Tiwari farmer told ANI: While working on the farm we saw a long python, after which we informed the other local villagers who reached the spot and caught the python.”
The Forest Department released the snake near to the river.


About Me
I am Mabotle Pienaar located in Nyanga KTC.I joined this programme called Codetelligent Bootcamp as a Frontnd Web Developer, because of the love I have for and I want to learn more about it.Web Development its something special and interesting, sometimes you will be asking yourself how did this website come out to this presentable feature, that's where you learn the inside of developing.
EDUCATION
2016: SENIOR CERTIFICATE
- IsiXhosa Home Language
- English First Language
- Mathematical Literacy
- Life Orientation
- Accounting
- Business Studies
- Computer Application Technology
2018-2020:NATIONAL CERTIFICATE IN:
MANAGEMENT ASSISTANT(N4-N6)
- Office Practice
- Communication
- Information Processing
- Computer Practice
CURRECTLY
2020:CODETELLIGENT
SKILLS
- Communication
- Computer skills
- Problem Solving
- Willingness to learn
- Management Skill-Task delegation
-Team Communication
-Team leadership
HOBBIES & INTEREST
- Travelling,socialising with friends and family,reading and learning new things,cooking on a weekly basis, mentoring and being a team player,Computing(creating and designing websites and software.)
EXPERIENCE
GOALS & OBJECTIVES
- Become Successful
- Fulfills desires and the sets new goals
- Have an exact plan for achieving success
- Use time to best ability and sticks to plane
ACCOPLISHENT
- Re-Organized somethimg to make it work better
- Come up with new idea that improved things
- Work on special projects
- Identified a problem and solved it
Back to Top


There might not exist direct evidence implying a relationship between A and B. However, if both A and B is known to be related to concept X, it might infer a certain relationship between A and B. This tool aims at finding the intermediate concept X which servers as a bridge connecting A and B.
We don't know how DRUG (B) can be used to treat DISEASE (A). However, if we know that DRUG (B) targets GENE (X) and mutations in GENE(X) is known to cause DISEASE(A). Then, we might infer that DRUG(B) might be used to treat DISEASE(A)


CSSound my final project for Dynamic Interface Design at Wellesley College Fall 2015. After doing my first two major projects using Flash Animation, I wanted to do something different for my final. Fortunately, we were given creative flexibility and I decided I wanted to learn a new skill. I’m interested in front-end development, so I decided to write my project in HTML, CSS, and Javascript. I felt that these languages were more applicable to my major, Software Product Design, and I would challenge myself.
The concept is simple, each of the number keys, 0-9, as well as the space bar, are mapped to an animation and a sound. This creates a pleasant yet surprising audio-visual experience. Each animation is set to 50% opacity, creating an overlaying effect of the animations as multiple keys can be pressed in succession to make patterns and artistic effects. The space bar changes the background color, changing the feel of the piece.
I achieved this project using primarily CSS animations and JQuery. I found the sounds for free on SoundSwap, and wanted electronic drum sounds yet still ambient. I worked to develop the animations using CSS transitions with the different ‘div’ elements in the HTML. Each key press triggers the adding of a CSS class to the ‘div,’ which then delays waiting for the animation to finish, then removes the class. This was achieved using JQuery. I initially load all of the sounds to prevent from too much lag when the keys are pressed.
I hope you enjoy this site as much as I enjoyed making it. Thanks for visiting!
-Keenan
Back to Portfolio


Shepherd
security
Password Recovery
Please answer the security question and if correct, password appears here.
username
Whats the last five digits of your phone number?
submit answer


{% include "templates/includes/header.html" %}
Manage natural disasters efficiently, in real time
Our system is powered by the latest techniques in Artificial Intelligence to manage natural disaster response and ensure the right information is flowing to the right people.
Learn More
Information is critical
Learn more about how Rescue Line utilizes the Cloud and AI to gather, analyze and distribute valuable information that aids in disaster relief.
Epic Video
Get Started
Citizen
I'm a citizen that wants to take advantage of RescueLine's features
Responder
I will be out in the field. ( Firefighter, Police Officer, NGO, and more )
Coordinator
I'm tasked with helping coordinate disaster response for an area
Hospital
I'm a Hospital Manager that wants to be better prepared for an emergency
{% include "templates/includes/footer.html" %}


Arpit Singh Ahluwalia
Director
Arnav Tomar
Neeraj Pandey
Technical Head
Dikshita Aggarwal
Editor
Mehak Singh
Siddharth Gupta
Hawk Eye
Sanisht Mehndiratta
Abhyuday Singhal
Investment head
Himaank Bhutani
Atishay khanna
Economics Head
Arjun Sahni
Sarthak Ahuja
Marketing Head
Harmandeep Singh
Sparsh Sehgal
Quizzing Head
Karan kawa
Kashish Arora
Resources Head
Daksh Sadna
Gursidak SSingh
Partner Head
Simarpreet Saggu


Gautam MittalPresident |
Hannah KimPresident |
Ryan FeathermanHead of Speakers |
Sylvana DomokosHead of Speakers |
Divya KameswaranHead of Business |
Sarika SaksenaHead of Business |
Adnaan SachidanandanHead Technology Coordinator |
Austin HoTechnology Coordinator |
Bridget HoDesigner |
Stephanie ZhangDesigner |
Mr. Eric LedgerwoodAdvisor |
Mrs. Jessica HexselAdvisor |
If you are interested in joining TEDxGunnHighSchool please email<EMAIL_ADDRESS>or drop by at one of our meetings.


{% extends 'brambling/layouts/12_xs.html' %} {% load i18n %} {% block title %}{{ title }} – {{ block.super }}{% endblock %} {% block main %}
{% trans "Your password has been set. You may go ahead and log in now." %}
{% trans 'Log in' %}


This presentation is a test for video embedding from You Tube and Vimeo.
"LOAD" from Brian Sørensen on Vimeo.