Use arrow keys/swipes to navigate
If you get lost you can hit esc or zoom out to see a minimap
Some thoughts on the impetus behind this project
Conceptually, people know that a lot of their information is online. However, I believe that they don't know specifics, which makes it hard for them to understand why it's such a big issue.
Without knowing what personal information of theirs is publically accessible online, people cannot make informed decisions about what data they would like others to have access to.
According to Career Builder's survey of hiring managers
60% of employers shared that they use social media sites to research potential employees. This is just one example of
The following is a guide to finding information about yourself online and some resources on how you can get that information removed.
The Goal behind the guide is to help inform you about what people online can find out about you, and provide some resources on how to get that taken down.
While there is a lot of data about you online, you should pay special attention to see if there is anything that you don't want others to see
Some things that are available about you include:
The Goal behind this website is to provide a resource to help you locate that information and some resources on how to get it taken down
As you're going through each of the steps outlined later, make sure that you're tracking what you find and saving all the links so you can go back later to remove them.
Each search engine will have different search results so try entering your name in the following and see what pops up.
The goal of this is to start filtering our noise and unnecessary results to really find some important information and where it's hidden. There are many paid companies that do this automatically, but we want to figure out what people can surface for free if they use the right query.
Try some keywords associated with yourself, like what school you went to, the company you work at, passions of yours, the city you live in, etc.
Try searching your name in association with some friends or family in order to narrow your search further
If there is a different popular spelling of your name, try that in your search as well. For example, "Cong" and "Kong"
If you go by a nickname, make sure to try both combinations of your name
Same as above, try both your married name and your maiden name.
Search modifiers are powerful ways of narrowing your search results by structuring your search in a specific way
If the search modifiers are too confusing, try using the advanced search page for each search engine to narrow down your search
People know that everyone can see the information you post on social networks. But the question is, what information do you post, and what does that say about you?
Try searching for what data you can find about yourself on these platforms. Use private browsing or a friends account to see what's visible when others look at your profile
While there are many social networks, it becomes tedious to check them all
There are websites which will allow others to search across all social media platforms and provide that information to users Let's see what they turn up
This will allow us to find the accounts you made and then forgot about
This will allow you to find and track what has been said about you by others online
This also allows you to find and track what has been said about you by others online
There are search engines online designed to specifically search for what public records on you are available. Let's see what they can find.
Tip: try using a couple which sound interesting. No need to try them all
Like an online yellow pages, this allows you to find addresses and phone numbers of people
One of the scariest people search I've found. It finds employment, usernames, dates of birth, news articles, and online posts
Can Find: age, address, relatives, locations where you have lived.
Provide them an email address, and this service will fill in the rest of the information on what it knows for everyone in your address book. Great for business users, but also quite scary!
Intelius provides phone numbers, addresses, names of relatives, and past employment data
Often there are specialized databases that don't show up in traditional search results that we need to check
While this list is not comprehensive, it gives an idea of things you can look for
Make sure to check the Google News results separately. The Search modifier information still apples
Often times local news records are not publically searchable
Try a search query like "John Doe site:denverpost.com" in order to search their web facing archive
Also try going to the local newspaper's website directly and running some searches there to see what you can unearth.
Cities sometimes keep records about their citizens publically accessible. Mouse around on your city website and see if you can find out what information about you they're sharing to the world
Given a name, this will list your party affiliation, address, and where you are registered to vote
See if your birth record is publically accessible
Gives the names and locations of all known sex offenders, gives you pictures and profiles. If you're on here, you already know, but it is interesting to see what data on other people is available. Think about whether this is something you support or not.
Once you grabbed a photo of yourself with a decently high resolution, run it through a reverse image search engine to see what it can find.
Some engines are
Now, using everything that we've found, go through and think about what you would like taken off the internet and what you don't mind leaving online.
Great! You're protected under the Right to be Forgotten. You can contact Google and the other search engines, and ask for your private information to be removed from their search results.
Read the factsheet on the right to be forgotten ruling to understand your rights.
There is no single overarching federal law giving citizens something similar to the right to be forgotten.
Read here for more information
Read on for tips you can follow to make it harder to find your information
Search Engine algorithms operate using something called Page Rank which tries to surface the latest and most relevant content
You can trick these algorithms by creating new fresh content that you've chosen to represent you
See this article on how Pornstar Sasha Grey cleaned up her social media presence to give you a good idea on how to start. NOTE: this article has some NSFW language and imagery


Remaining skill points:
CREW CHIEF
MUSCLE
ARMORER
ROGUE
HITMAN
CROOK
BURGLAR
INFILTRATOR
SOCIOPATH
GAMBLER
GRINDER
YAKUZA
EX-PRESIDENT
MANIAC
ANARCHIST
BIKER
KINGPIN
SICARIO
STOIC
TAG TEAM
HACKER
LEECH
COPYCAT
Share your Build with anyone!
Credits
This site was made possible by the combined effort of r/paydaybuilds community.
Contributors of this project can be found here.
This software is provided under the MIT license. Do what you want with it, but please respect its open-source nature.
Reach us at:


test
This is a style test...
 Thank you Hfu for iframe
Simple map(Map1)
Simple map with country label (Map1-3)
Simple map (Map3) only limited area


| Constants' Details |
ONE_SHOT
const byte ONE_SHOT =0;
- Description
- The [0,1] parameter range is sweeped through exactly once.
The [0,1] parameter range is sweeped through exactly once,
starting with 0 and ending with 1.
|
|
ONE_SHOT_PINGPONG
const byte ONE_SHOT_PINGPONG =1;
- Description
- The [0,1] parameter range is sweeped through exactly twice.
The [0,1] parameter range is sweeped through exactly twice,
starting with 0, going to 1, and going back to 0. When
plotting the value over time, this yields a triangle curve.
|
|
PINGPONG
const byte PINGPONG =2;
- Description
- The [0,1] parameter range is sweeped through infinitely.
The [0,1] parameter range is sweeped through infinitely,
starting with 0, going to 1, and going back to 0, and then
starting again. When plotting the value over time, this yields
a repeated triangle curve.
|
|
REPEAT
const byte REPEAT =3;
- Description
- The [0,1] parameter range is sweeped through infinitely.
The [0,1] parameter range is sweeped through infinitely,
starting with 0, going to 1, and starting with 0 again. When
plotting the value over time, this yields a repeated saw-tooth
curve.
|
|
Copyright © 2013, The Apache Software Foundation, Licensed under the Apache License, Version 2.0. Apache, the Apache feather logo, Apache OpenOffice and OpenOffice.org are trademarks of The Apache Software Foundation. Other names may be trademarks of their respective owners.


Green box means winning streak. Red box means losing streak. White box means no streak (wins or losses not consecutive) NEW! Click a single match to see the game report


 I have graduated in B.Com (Hons) and I am currently pursuing Communication Design from Pearl Academy.
I have always been deeply inclined towards creativity and I am a firm believer that
The desire to create is one of the deepest yearnings of the human soul. Also, one can mimic the result but not the creativity and holding my ground on this belief, I decided to share my design ideas and invested them to help school and college students with their projects.
I have gained myself a steady experience of more than 2 years and have slowly and steadily increased my line of business to bring you more creativity.
I assure you that all my ideas are 100% original, the products are handmade with delicacy and created and assembled with pure dedication and to the best of my efforts.
The desire to create is one of the deepest yearnings of the human soul. Also, one can mimic the result but not the creativity and holding my ground on this belief, I decided to share my design ideas and invested them to help school and college students with their projects.
I have gained myself a steady experience of more than 2 years and have slowly and steadily increased my line of business to bring you more creativity.
I assure you that all my ideas are 100% original, the products are handmade with delicacy and created and assembled with pure dedication and to the best of my efforts.
" Creativity is a wild mind and a disciplined eye "
— Dorothy parker


Missing NJ woman last seen at family gathering, parents say
by Eyewitness NewsFREEHOLD, New Jersey (WABC) -- The parents of a missing woman from New Jersey are speaking out amid the desperate search for their daughter.
The parents of Stephanie Parze, 25, say she was last seen leaving a family gathering on Wednesday night.
Her family asked her to call or text when she arrived at her home in Freehold Township, but they never heard from her, and she missed work the next day.
Her parents say it appears Parze made it home - her phone was found inside, and her car was in the driveway.


Next: Tilde B-> Binary, Previous: Tilde R-> Radix, Up: FORMAT Radix Control
An arg, which should be an integer, is printed in decimal radix. ~D will never put a decimal point after the number.
~mincolD uses a column width of mincol; spaces are inserted on the left if the number requires fewer than mincol columns for its digits and sign. If the number doesn’t fit in mincol columns, additional columns are used as needed.
~mincol,padcharD uses padchar as the pad character instead of space.
If arg is not an integer, it is printed in ~A format and decimal base.
The @ modifier causes the number’s sign to be printed always; the default is to print it only if the number is negative.
The : modifier causes commas to be printed between groups of digits; commachar may be used to change the character used as the comma. comma-interval must be an integer and defaults to 3. When the : modifier is given to any of these directives, the commachar is printed between groups of comma-interval digits.
Thus the most general form of ~D is ~mincol,padchar,commachar,comma-intervalD.
~D binds *print-escape* to false, *print-radix* to false, *print-base* to 10,
and *print-readably* to false.


This page contains the notes for the first part of R Workshop Module 6: “To Infinity and Beyond”, which is part of the R Workshop series prepared by ICJIA Research Analyst Bobae Kang to enable and encourage ICJIA researchers to take advantage of R, a statistical programming language that is one of the most powerful modern research tools.
Click here to go to the workshop home page.
Click here to go to the workshop Modules page.
Click here to view the accompanying slides for Module 6, Part 1.
Navigate to the other workshop materials:
After learning how to use R to analyze data and get results, now is the time for us to explore various options to share our work effectively and elegantly.
Source: R Markdown
“R Markdown is a file format for making dynamic documents with R. An R Markdown document is written in markdown (an easy-to-write plain text format) and contains chunks of embedded R code.”
- Garret Grolemund from R Studio
R Markdown supports a variety of document formats and makes it easy to create amazing reports, presentation slides, or even websites to share your findings in R with others.
There are many benefits of using R Markdown.
First, it is a great way to incorporate your R code into a document. It not only shows your code to make it transparent, but also runs it as the document is rendered so that the resulting output is always true to the code. This is particularly useful when the code is used to compute certain key values or create tables/plots using data.
Second, R Markdown makes it easy to generate various formats of documents for the same contents–an HTML document, a PDF report, presentation slides, etc.–with little to no changes to the R Markdown script.
R Markdown’s ability to incorporate R code makes the rendered document and its content largely reproducible. If the data changes and we have to compute certain values again, we simply re-render the document using the modified data.
Finally, the report generating process can be largely automated with rmarkdown
tools.
To get started with R Markdown, we first have to install rmakrdown
package. If you are using RStudio IDE (which you should), this is already taken care of.
Creating a new R Markdown file is easily done using RStudio IDE. Go to its menu bar, and click File > New File > R Markdown.
Onces we have our R Markdown file ready to be rendered, we “Knit” the R Markdown file into a document in the desired format.
The following screenshots show how this is done:
On the RStuido IDE menu, click “File > New File > R Markdown”.
Alternatively, you can click a button right below File menu, which is for creating a new file. When you clikc the button, you will see various options for a new file. Click “R Markdown”.
When you click “R Markdown”, you will see a small window for specifying a few options, including “Title”, “Author”, and “Default Output format”.
Onces you click “OK”, a new R Markdown script shows up on the script pane of RStudio IDE. Now we are ready to work on our R Markdown file!
An R Markdown file starts with a YAML header, which specifies options for rendering the output document. In the following picture, the part in the red box is a YAML header, enclosed by three dashes (---
) on the top and bottom.
Basic YAML header options include the title, author, and date of the document as well as the output specifications (output format and related options). We will take a closer look at the output options below.
RStudio IDE offers a button for “knitting” the R Markdown file into documents of specified formats. Next to the “Knit” button is a button with options for previews.
Clickling the “Knit” button will simply knit the document. On the other hand, clicking a small down-arrow button will show some options for knitting the document.
Clikcing the cogwheel icon next to “Knit” button presents optiosn for preview.
The main body of the R Markdown file is a markdown script.
We will take a quick tour of markdown basics. More specifically, we will see the markdown syntax for the following elements:
# Header 1
## Header 2
### Header 3
_italic_ __bold__
*italic* **bold**
~~strikethrough~~
superscript^2^
Unordered list | Ordered list
|
* Item 1 | 1. Item 1
* Item 1a | 1. Item 1a
* Item 2 | 2. Item 2
+ Item 2a | 1. Item 2a
- Item 2b | 2. Item 2b
Mixed list
1. Item 1
* Item 1a
* Item 2
1. Item 2a
+ Item 2b
[text with hyperlink](http://link.path)
![](http://image.path/example.png)
![optional caption text](image/example.png)
> A line of text following the "> " is a blockquote.
A line of text following the “>” is a blockquote.
More then three asteriks or dashs
***
******
------
Inline math equations look like: $y = (x + 1)^2$
Inline math equations look like: \(y = (x + 1)^2\)
A block of math equations look like:
$$y = x^2 + 2x + 1$$
A block of math equations look like: \[y = x^2 + 2x + 1\]
The highlighted part in the markdown body is an R code chunk. Each code chunk can have R code that will be executed when knitting the whole document.
Inserting a new code chunk can be done with clicking the “Insert” button on the right top of the script pane. Alternatively, we can used a keyboard shortcut: Ctrl + Alt + i
.
Click the “Run” button to see options for executing R code chunks. Also, we can execute each code chunk separately with the green play button on the right top of the code chunk. Alternatively, we can use a keyboard shortcut: Ctrl + Enter
.
knitr
package offers various options to control the knitted output of code chunks. There are global options and local options.
# use the following to control global options
knitr::opts_chunk$set(eval = TRUE, echo = TRUE, ...)
Global options act as the default settings for the whole document. This can be specified using opts_chunk$set()
function
_```{r eval = FALSE, echo = FALSE, ...}
Local options per code chunk are only applied to the specific code chunck. They can specified in the curly braces {}
at the beginning of the code chunk. Local options overide the global options if relevant.
See here for full documentation of knitr
chunk options.
The following table lists commonly used code chunk options and their descriptions.
| Option (default) | Description |
|---|---|
eval (TRUE ) |
Evaluate code in chunk? If FALSE, only code is shown |
echo (TRUE ) |
Show code in chunk? If FALSe, only output is shown |
error (FALSE ) |
Preserve the error? If TRUE, knitting continues in case of errors |
message (TRUE ) |
Display code messages? |
warning (TRUE ) |
Display code warnings? |
include (TRUE ) |
Include the code chunk? If FALSE, neither code nor output is shown but code is still evaluated |
fig.show (asis ) |
How to show/arrange plots? ("asis" , "hold" , "animate" , "hide" ) |
fig.width , fig.height (7 ) |
Plot width and height in inches. |
There are often cases where we want to generate a table using R code and include it in the R Markdown output. There are different options for printing a table:
knitr::kable()
DT::datatable()
my_table <- data.frame(
my_fruits = c("apple", "banana", "clementine"),
my_animals = c("dogs", "cats", "llamas"),
my_flavors = c("chocolate", "vanila", "cookie dough"),
my_colors = c("red", "green", "orange"),
my_cities = c("Chicago", "New Work", "Los Angeles")
)
my_table
## my_fruits my_animals my_flavors my_colors my_cities
## 1 apple dogs chocolate red Chicago
## 2 banana cats vanila green New Work
## 3 clementine llamas cookie dough orange Los Angeles
kable
exampleknitr::kable(my_table)
| my_fruits | my_animals | my_flavors | my_colors | my_cities |
|---|---|---|---|---|
| apple | dogs | chocolate | red | Chicago |
| banana | cats | vanila | green | New Work |
| clementine | llamas | cookie dough | orange | Los Angeles |
datatable
exampleDT::datatable(my_table)
Source: Wikimedia Commons
R Markdown supports various output formats, including HTML, PDF, Microsoft Word, and more.
Output format can be specified using output
in the YAML header. R Markdown is not limited to generate a single format for the given file. In order words, depending on the YAML output
setting, the same file can be rendered in multiple formats.
Different output format has different YAML render options. Refer the page 2 of R Markdown cheat sheet on RStudio’s Cheat Sheets page for a full list.
The following table lists common output formats on YAML header and what they create.
output value |
Creates |
|---|---|
html_document |
HTML file |
html_notebook |
R Notebook HTML file |
pdf_document |
PDF (requires Tex) file |
word_document |
Microsoft Word file |
md_document |
Markdown file |
github_document |
GitHub compatible markdown file |
The following table lists commonly used YAML render options and their descriptions as well as availability.
| Option | Description | Available for |
|---|---|---|
css |
CSS file to use to style document | html |
highlight |
Syntax highlighting | html, pdf, word |
number_sections |
Add section numbering to headers | html, pdf |
theme |
Bootswatch theme to use for page | html |
toc |
Add a table of contents | html, pdf, word, md, github |
toc_depth |
The lowest level of headings in toc | html, pdf, word, md, github |
toc_float |
Float the toc on the left | html |
Available highlights for R Markdown documents are as follows: "default"
, "tango"
, "pygments"
, "kate"
, "monochrome"
, "espresso"
, "zenburn"
, "haddock"
, and "textmate"
Available themes for R Markdown documents are as follows: "default"
, "cerulean"
, "journal"
, "flatly"
, "readable"
, "spacelab"
, "united"
, "cosmo"
, "lumen"
, "paper"
, "sandstone"
, "simplex"
, and "yeti"
. R Markdown themes are in fact drawn from “Bootswatch” themes, so you can visit the website to get a feel for each theme for your own R Markdown document.
“An R Notebook is an R Markdown document with chunks that can be executed independently and interactively, with output visible immediately beneath the input.”
- “R Notebooks”, RStudio
While all other R Markdown formats requires “knitting” to see the final output, an R notebook document is automatically re-rendered each time the source file (.Rmd
) is saved. This offers a more interactive workflow.
htmlwidgets
for Rhtmlwidgets
include:
plotly
and highcharter
for interactive visualizationsleaflet
for interactive mapsDT
for interactive data tableshtmlwidgets
for R website to find out more“RPubs is a quick and easy way to disseminate data analysis and R code and do ad-hoc collaboration with peers.”
- RStudio Team
Publishing an R Markdown output on RPubs is as easy as clicking the “publish” button on RStudio. You may consider RPubs as something comparable to Tableau Public’s Gallery website, although there are some differences.
Click the image below to view what others have shared:
Source: Wikimedia Commons
RStudio supports many options for creating presentation slides that are both modern-looking and highly customizable.
Popular ways to create slides using R include:
ioslides_presentation
(HTML)revealjs::revealjs_presentation
(HTML)slidy_presentation
(HTML)beamer_presentation
(PDF)ioslides
---
title: "My first ioslide presentation"
output: ioslides_presentation
---
ioslides
output format is built into RStudio. ioslides
fully integrates R Markdown syntax. For example, creating new slides is as easy as using #
and ##
headings.
To learn more about ioslides
, read the “Presentations with ioslides” article on RStudio.
ioslides
sample source codeHere is a sample course code for creating simple ioslides
HTML slides. The result will have a title slide with the information in YAML header.
---
title: "My first ioslide presentation"
author: Bobae Kang
date: April 18, 2018
output: ioslides_presentation
---
# First section
## Normal slide
- Item one
- Item two
## Another slide | With a subtitle
This slide has a two-column layout
----
![picture saying hello](images/hello.png)
The following is my own sample ioslides
presentation slides:
revealjs
---
title: "My first revealjs presentation"
output: revealjs::revealjs_presentation
---
With revealjs
R package, it is possible to use R Markdown (and its syntax) to generate slides using reveal.js, a JavaScript library for interactive slides in HTML. Try this demo slides generated using reveal.js to see how its slides look like.
Creating slides with revealjs
is mostly the same as using ioslides
, except for certain options that are available only with revealjs
. To learn more about revealjs
, read the “Presentations with reveal.js” article on RStudio.
The following is my own sample reveal.js
presentation slides:
There are more options for creating presentation slides via R Markdown, including the following:
slidy
output: slidy_presentation
in the YAML headerbeamer
output: beamer_presentation
xaringan
output: xaringan::moon_reader
R Presentation is another file format for an interactive HTML slides that are built on amazing reveal.js. All Workshop slides are generated using R Presentation with some customizing work.
Unlike what we have seen abvoe, R Presentation is not a R Markdown document and has its own file extension (.RPres
). Similar to R Notebook, R Presentation offers an interactive “Preview” which gets automatically re-rendered each time the source file (.RPres
) is saved. This can support a more interactive workflow for creating slides.
Unfortunately, R Presentation is no longer in active development.
To learn more about R Presentation, visit relevant pages on RStudio Support website.
Source: R Studio
“Shiny is an open source R package that provides an elegant and powerful web framework for building web applications using R. Shiny helps you turn your analyses into interactive web applications without requiring HTML, CSS, or JavaScript knowledge.”
- RStudio.com
To get a feel for what Shiny is capable of, try my ICJIA Uniform Crime Report Data dashboard app here.
Also, check out more examples on RStudio’s “Shiny User Showcase” page.
Shiny opens up a whole new world of opportunities. Two common “applications” of Shiny include building dashboards and generating interactive documents.
A data dashboard is a visual interface to data to allow its viewers for gain key insights. It is often an interactive application that provides viewers with options to explore data from multiple angles interactively. A Shiny application is perfectly capable of making a great dashboard.
Shiny can be used to generate interactive documents with Shiny app widgets embedded. An interactive document can be created by knitting an R Markdown file with the YAML head including runtime: shiny
and output: html_document
or output: ioslids_presentation
. Embedded Shiny R code chunks will render a mini application, which can offer your readers yet another way to gain insights from your work.
The following figure offers a visual illustration of the structure of an interactive document powered by Shiny.
Source: “Introduction to interactive documents”. Shiny from R Studio
install.pacakges("shiny")
library(shiny)
runExample("01_hello")
Shiny is a package, so you first have to install and import it. Once the package is imported to your R environment, try a simple built-in example for Shiny application!
A Shiny app consists of two parts, server
and ui
.
They can be separated into two files, server.R
and ui.R
. In this case, both files must be located in the same directory, typically named “app”.
Alternatively, both parts can live in a single file, app.R
.
For interactive documents, the R Markdown document serves as the user interface, so there is no need for a serarate ui
file.
function(input, output, session) {
## R code for server logic
}
server.R
file contains the server-side logic of the application. It contains a function with two required arguments (input
and output
) and one optional argument (session
) to define the server logic.
input
object is an environment for storing user inputs modified by user’s interaction with the application ui
.
output
object is an environment for storing elements (plots, tables, texts, etc) to be rendered and shown in the ui
.
Finally, session
object is an environment that can be used to access information relating to the session. Using session
is optional.
fluidPage(
## R code for user interface
)
ui.R
file defines the user interface elements, such as layouts, panels, inputs and outputs. The file contains fluidPage()
function.
Available layouts include: the sidebar layout and grid layout.
Available panels include: the title panel, sidebar panel, main panel, tabset panel, navigation list panel, and more.
shiny
offers functions to take user inputs and functions to render outputs (as defined in server.R
).
library(shiny)
server <- function(input, output) {
# server-side logic
}
ui <- fluidPage(
# user interface
)
shinyApp(ui, server)
app.R
file must include shinyApp(ui, server)
at the end, where server
is an object containing code for server-side logic and ui
is an object containing user interface elements.
Developing a Shiny app takes much practice, planning and pain experiment. However, the reward is YUGE!
You can get started with Shiny using these tutorials by RStudio. Also, follow along these articles by RStudio to hone your Shiny skills.
If you need examples and inspirations for your own projects, visit Shiny Gallery and check out featured applications and widgets.
Shiny applications, including the interactive documents, can be deployed for use in the following ways:
The easiest way to deploy/publish a Shiny application is via shinyapps.io, RStudio’s cloud hosting service for Shiny application. Using shinyapps.io requires signing up to their service, which can also be done with Google or GitHub account. Onces registered, it takes only a few clicks on the RStudio IDE to deploy an application via shinyapps.io.
While free hosting of Shiny application is available, it is limited to 5 applications and 25 active hours per month. This might be sufficient for quickly sharing demo projects, but not enough for serious applications. See the pricing for hosting Shiny apps on shinyapps.io website for more.
Source: Wikimedia Commons
A collection R Markdown documents in HTML format can be made into a website.
To do so, we need a _site.yml
file in the same folder as individual documents to be put together. _site.yml
specifies the name and the routing structure of the resulting website.
With _site.yml
and all HTML documents ready, run rstudio::render_site()
to generate the website.
For details, see the “R Markdown Websites” article on RStudio website.
The following is a _site.yml format example. This is in fact the actual YAML file for the R Workshop website, which can be found here.
name: ICJIA R Workshop
output_dir: '.'
navbar:
title: ICJIA R WORKSHOP
right:
- text: Home
href: index.html
- text: Modules
href: modules.html
- text: About
href: about.html
output:
html_document:
includes:
after_body: include_footer.html
css: css/style.css
lib_dir: site_libs
self_contained: no
“GitHub Pages is a static site hosting service designed to host your personal, organization, or project pages directly from a GitHub repository.”
-“What is GitHub Pages?”, GitHub Help
GitHub is a free and commercial online repository service for storing and sharing projects using Git.
The ICJIA R Workshop website is hosted on GitHub Pages. (Please not that the ICJIA network currently blocks all websites hosted on GitHub Pages.)
Read more about GitHub Pages and hosting static sites on GitHub Pages on GitHub Help here.
blogdown
bookdown
package, built on R Markdown, facilitates writing books and long articles/reports. A bookdown
publication is made downloadable in PDF, EPUB and MOBI formats, making it more like a real electronic “book” than just an online documentation website.
Check out bookdown
package website to find out more.
Also, read Xie, Y. (2018). bookdown
: Authoring Books and Technical Documents with R Markdown for a comprehensive guide for bookdown
. The book itself is generated using bookdown
.
blogdown
blogdown
is a package to generate static websites using R Markdown and the Hugo, a popular open-source static website generator.
You can visit Awesome Blogdown website for a curated list of blogdown
examples.
Also, read Xie, Y. et al. (2018). blogdown
: Creating Websites with R Markdown for a comprehensive guide for blogdown
.
The following are examples of blogs/websites built using blogdown
:


Voronoi diagram
no canvas
Delaunay triangulation
Voronoi diagram
Draw triangulation on top of V. diagram
Number of points (3-100)
Alpha value (0-1)
Width
Height
Regenerate
|
Reset


Class for important global game values.
More...
#include <Mastermind.h>
|
| static unsigned long | CODE_COUNT () |
| | Amount of possible solutions. More...
|
| |
| static unsigned long | POWER (int lhs, int rhs) |
| | Calculate power of two int values. More...
|
| |
Class for important global game values.
§ ~Mastermind()
| virtual mastermind::Mastermind::~Mastermind |
( |
| ) |
|
|
inlinevirtual |
§ CODE_COUNT()
| static unsigned long mastermind::Mastermind::CODE_COUNT |
( |
| ) |
|
|
inlinestatic |
Amount of possible solutions.
- Returns
- number of possible solutions.
§ POWER()
| static unsigned long mastermind::Mastermind::POWER |
( |
int |
lhs, |
|
|
int |
rhs |
|
) |
| |
|
inlinestatic |
Calculate power of two int values.
- Returns
- lhs^rhs
§ COLOR_COUNT
| constexpr std::size_t mastermind::Mastermind::COLOR_COUNT = 6 |
|
static |
Amount of available colors.
§ MAX_MOVES
| constexpr std::size_t mastermind::Mastermind::MAX_MOVES = 7 |
|
static |
Maximum moves allowed until game finished.
§ SLOT_COUNT
| constexpr std::size_t mastermind::Mastermind::SLOT_COUNT = 4 |
|
static |
Amount of slots for colors.
The documentation for this class was generated from the following file:


WITNESS LIST Health & Human Services Committee March 1, 2005 - 9:00A SB 44 Registering, but not testifying: For: Allison, Jim General Counsel (County Judges and Commissioners Association of Texas), Austin, TX Foegelle, Tom County Indigent Health Care Program (DeWitt County), Cuero, TX On: Maberry, Jan Program Manager (Texas Department of State Health Services), Austin, TX SB 46 ON: McCulley, Sherry State Government (Texas Health and Human Services Commission), Austin, TX Montgomery, Michael State Government (Department of State Health Services), Austin, TX Rachofsky, Marcia Policy Analyst (Texas Mental Health Consumers), Austin, TX Registering, but not testifying: For: Dennis, Hilary Lobbyist (Texas Medical Association), Austin, TX Dunkelberg, Anne Assistant Director (Center for Public Policy Priorities), Austin, TX Kroll, John Consultant (Axalto, Inc.), Austin, TX Shields, Brad Lobbyist (Texas Retailers Association), Austin, TX On: Molina, Joanne State Government (Texas Health and Human Services Commission), Austin, TX SB 47 ON: Brewer, Helen Advocacy Consultant (Seton Healthcare Network), Austin, TX Dunkelberg, Anne Assistant Director (Center for Public Policy Priorities), Austin, TX Rachofsky, Marcia Policy Analyst (Texas Mental Health Consumers), Austin, TX Registering, but not testifying: For: Craven, Susan Executive Director (Texans Care for Children), Austin, TX Kroll, John Consultant (Axalto, Inc.), Austin, TX On: McCulley, Sherry State Government (Texas Health and Human Services Commission), Austin, TX Molina, Joanne State Government (Texas Health and Human Services Commission), Austin, TX SB 48 Registering, but not testifying: For: Caballero, Leticia Director of Governmental Relations (Texas Health Care Association), Austin, TX On: Cortes, Leslie Physician (Department of Aging and Disability Services), Austin, TX Thomason, David Vice President of Public Policy (Texas Association of Homes and Services for the Aging), Austin, TX SB 196 Registering, but not testifying: For: Barton, Yvonne Associate Director, Legislative Affairs (Texas Medical Association), Austin, TX Capelo, Jaime Legislative Consultant (Texas Alliance for Patient Access), Austin, TX Frasher, John Dentist (Texas Dental Association), Austin, TX On: Ablon, Ben Director of Enforcement (Texas Dental Board), Austin, TX Sanders, Sherri Director of Licensing (State Board of Dental Examiners), Austin, TX Schmidt, Bobby Executive Director (Texas State Board of Dental Examiners), Austin, TX SB 239 FOR: Ellett, Jack Sheriff - Panola County (State Child Fatality Review Commission), Carthage, TX Herrick, Marilyn Child Advocate Program Director (Dallas County Child Death Review Team & Dallas Children's Advocacy Center), Dallas, TX ON: Harris, Geraldine State Registrar (Texas Department of Health), Austin, TX Registering, but not testifying: For: Cotton, Troy Assistant District Attorney (Harris County District Attorney), Houston, TX Craven, Susan Executive Director (Texans Care for Children), Austin, TX Kroll, Carrie Lobbyist (Texas Pediatric Society), Austin, TX Rolater, John Assistant District Attorney (Bill Hill, Dallas County Criminal District Attorney), Dallas, TX On: Pena, Wanda Social Worker (Texas Department of Family and Protective Services), Austin, TX SB 316 FOR: Armstrong, Bonnie Director (The Shaken Baby Alliance), Fort Worth, TX Carbajal, Lori (Shaken Baby Alliance), Austin, TX Dittman, Kathryn Veterinarian (Prevent Child Abuse Texas/ The Shaken Baby Alliance), Harlingen, TX Floyd, Gary Pediatrician (Texas Pediatric Society), Fort Worth, TX Hendee, Robert Retired Pediatric Neurosurgeon (Prevent Child Abuse Texas/ TexProtects), Austin, TX Sjoberg, Elizabeth Associate General Counsel (Texas Hospital Association), Austin, TX ON: Bednar, Cindy (Department of State Health Services), Austin, TX Registering, but not testifying: For: Craven, Susan Executive Director (Texans Care for Children), Austin, TX SB 376 FOR: Correa, David Registered Nurse, Director of Patient Satisfaction (Bexar County Hospital District), San Antonio, TX Registering, but not testifying: For: Crowe, Michael Attorney (El Paso County Hospital District), Austin, TX Dahler, Erik Attorney (Bexar County Hospital District), San Antonio, TX Dunkelberg, Anne Assistant Director (Center for Public Policy Priorities), Austin, TX


Google removed Pinyin from Google Maps in Taiwan on April 26th.
I made an alternative, because
people are asking for it.
It's
really not ready for public release, but sending bug reports to Google has fallen on deaf ears. If you're travelling in Taiwan, please feel free to use it.
If you're a programmer and want to help improve the GUI, please contact me.
Download Galileo, add Maps from PC. Download map tiles using
MOBAC and a custom tile source, put sqlitedb file into app using iTunes or a file browser e.g. DiskAid.
Download BAMB, set up a local web server. Download map tiles in Galileo format using
MOBAC and a custom tile source. Put sqlitedb files into bamb/Maps folder.


###What is the assignment?
I recently did some analyses of crime rates in San Francisco using their Open Data datasets. This was part of two different assignments for the University of Washington’s “Data Science at Scale” course. One assignment was to use visualization to develop some new inference - I used an iPython / Jupyter notebook that can be found at this link. The second assignment was to compete in a Kaggle competition. My detailed write-up can be found here.
###What did I learn?
I did the exploratory exercise first, and the Kaggle exercise second. Using what I had learned from the exploratory exercise, I began creating new fields before even developing a model. I thought I had information that had explanatory power and that I already knew the solution. This was a huge mistake! I should have started with the dataset and let it give me a sense of what data was valuable and the overall structure. For example, using a cor() plot and/or pulling a variable importance (VarImp() ) from a Random Forest model. Not doing this led to several hours of wasted time and effort.
Running through this exercise had me thinking about the Unreasonable Effectiveness of Data:
“Choose a representation that can use unsupervised learning on unlabeled data, which is so much more plentiful than labeled data. Represent all the data with a nonparametric model rather than trying to summarize it with a parametric model, because with very large data sources, the data holds a lot of detail.
For those with experience in small-scale machine learning who are worried about the curse of dimensionality and overfitting of models to data, note that all the experimental evidence from the last decade suggests that throwing away rare events is almost always a bad idea, because much Web data consists of individually rare but collectively frequent events.“
This is useful when trying to develop the most accurate, dynamic model. But what if I am just trying to learn what is present in the data, and only want a semi-accurate high-level understanding? I had this conversation with one of our Principal Data Scientists, Drew Hardin. His guidance was to, in those situations, throw away as much data as possible. Why run a model on a sample of 700K if a 10K set is just as representative of the population? At the same time (and similar to the Halevy paper), don’t necessarily imbue assumptions of the underlying structure of the data because you made them elsewhere.
###Exploration Theft/Larceny is by far the most reported crime in the city. After analyzing at reported crimes by day and month, contrary to expectation, I found that July had more crimes reported “midweek” than over the weekends. I peeled into the type of crimes being addressed and found that “Warrants” and “Non-Criminal” activities rise during the week - during weekdays, the police are performing work that can be predicted in advance and managed.
I then looked at different neighborhoods/police districts to see if any patterns might emerge. The city center (SoMA = Southern, Financial District = Central, Tenderloin, etc) is where the highest crime emerges. Peculiarly, weekday crimes have a bump around 12pm and then again between 5-7pm. Presumably, this is when victims realize that a theft has occurred and contact the police. No such pattern is present on the weekends.
Looking here, we can see that July’s pattern of increased reporting during weekdays holds true across the board. There are, on average, almost 50% higher reporting of theft on weekdays than weekends - a trend that is not true for the month of August.
My conclusion is that over the weekend, people are not in town to report crimes. The elevated numbers are not due to the distribution of when the events occurred, but rather when they were reported.
Let’s now look at the Police Departments in San Francisco and where crimes are reported. The Top 4 (by volume of crime) are Central, Northern, Southern, and Mission. This would be expected, as they are in the city center and cover a relatively large volume of the city. The Tenderloin (#7) is known for not being safe, but is comparatively small.
###Kaggle Competition
The task is to predict the category of of a crime in San Francisco based on a variety of attributes, including the time at which the crime was reported, the street address, the day of the week, a general description of the crime, the precint reporting, and Lat/Long information. We are given the last 12 years of information, from 2003-2015, which provides ~878K reports.
There are 39 different different classes in the category we are trying to predict, although they are certainly not distributed evenly. The top 3 are “Larceny/Theft”, “Other Offenses”, and “Non-Criminal” with ~175K, ~125K, and ~92K reports, respectively. Solutions are evaluated by comparing the percentage of correct answers on a test dataset. The actual scoring is based “log loss.” It takes the probability of being able to predict the correct answer and uses the equation “LN(P(x)) - 1”.
Not seeing a good way to take the text data from “Address” and seeing that the precincts are too large to offer predictive value, I used the Lat/Long information to bin the different crimes. I dropped the ~700 values that did not have Lat/Long info (marked as -120.5, -90), and originally split the rest into a 100x100 grid. However, the bins were too small, some having only ~100 crimes. I reestablished the bins for a 25x25 grid (625 bins for SF).
Originally, I wanted to run a RandomForest model against all features and have the model tell me the variable importance of the different features (using the varImp() function). However, I ran into quite a few snags before making a submission.
- First, randomForest in R does not take NAs. It has a few options for addressing this in ‘na.action’, but I wasn’t sure if there was information I might have been leaving out by imputing the NAs.
- Second, randomForest in R only takes features with 53 or fewer bins. Therefore, my location bucketing (625 bins) was not acceptable. I split them into Lat and Long variables separately and hoped that the interaction would be picked up in the model.
- The randomForest challenges led me to try R’s other decision trees package, rpart(). However, the dataset was too large to get the algorithm to converge. I tried several things, none of which worked:
- I adjusted the sample size from ~878K down to 10K using the sample() function,
- I adjusted the minimum bucket size to 100 samples to reduce the number of splits in the model,
- I adjusted the complexity parameter to 0.01 to adjust when the model would accept a split as being necessary, and
- I took the 39 classes in the predictor and reduced it to 5 for model simplicity. In this final state, I let R run for ~4 hours and decided for a different approach when it did not converge.
- To get a convergence, I went back to the randomForest() model and decided to drop all rows that have an “NA” present. I also used the 10K sample instead of the full ~878K set
- Finally, running the model against the test set results in a list of ~885K predictions. Kaggle asks for the submission to be a sparse matrix of 1s and 0s (with the different classes as the column headings). I wrote a nested for loop to make this conversion, which isn’t great for R’s memory capabilities. That is - it starts off fast, and then slows as the matrix builds. I switched to the lapply() and my speeds dropped considerably.
- There seem to be two poles to the submissions - the first thousand submissions and the second thousand submissions have very different predictive capabilities. Reading through some answers, I realized the fields that I added were what gave me poor predictive information. If I ran randomForest without the extra fields, that would have put me in the top bucket of answers.
Now, if I had tried to place in the top ~25 spots - that would have required the Unreasonable Effectiveness of Data approach: I read through the open scripts for a few of the top answers, which use a combination of Keras, a deep learning library for Theano or TensorFlow, and a count featurizer from Microsoft Azure, which uses the frequency of events to indicate the strength or importance of different given features.


libconfort is a small library written in C and modern Fortran. There are numerous excellent libraries for handling configuration files written for C. None of them has a native, easy-to-use interface for Fortran, which is the leading language for numerical computing. The intrinsic I/O handling in Fortran is decent, however it lacks the full flexibility that a proper configuration file utility provides (such as comments or quoted strings).
libconfort, which stands for configuration for Fortran, is attempting to fill that niche. The library core is written in C, however all routines are wrapped into native Fortran interfaces, which provides a seamless experience for a Fortran programmer. The upcoming object interface is going to provide even better experience.
The library is still in very early stages of developement. The core and procedural interface is considered stable and ready for production use. The object interface is under development and it may change in the future.
Since libconfort relies on the latest Fortran 2008 features, it requires GCC 6 compiler suite. It should be freely available on most of the distributions. To build the library on CentOS 6/7, you need to do the following:
# install the scl
sudo yum install centos-release-scl
# install the GCC 6 collection
sudo yum install devtoolset-6-{gcc{,-gfortran},make}
# run the sub-shell with toolset enabled
scl enable devtoolset-6 bash
# build the library as usual...
Installation is easy and typical. The easiest way is to install from provided rpm files. If you want or need to install it from source, first build the library by typing:
make
Then, install it in /usr/local
by executing
sudo make install
or, if you want to sandbox the library for easy removal, execute:
sudo make install prefix=/opt/confort
Distributed under the MIT License. See the LICENSE document for full text and copyright information.


hoverIntent(query.all("#demo1 li"), makeTall, makeShort );
jQuery's built-in hover calls handlerIn and handlerOut functions immediately. If you move your cursor back and forth quickly across the tiles you'll see how the immediate execution can lead to problems.
hoverIntent(query.all("#demo2 li"), makeTall, makeShort );
hoverIntent is interchangeable with jQuery's hover. It can use the same exact handlerIn and handlerOut functions. It passes the same this and event objects to those functions.
hoverIntent(query.all("#demo3 li"), toggleHeight );
hoverIntent can also take a single handlerInOut, just like jQuery's hover.
To control hoverIntent more precisely and override the default configuration options, pass it an object as the first parameter. The object must at least contain an "over" function. If the "over" function is sent alone, it will act just like handlerInOut.
These are the common options you'll want to use. Note, nothing prevents you from sending an empty function as the handlerIn or handlerOut functions.
Required. The handlerIn function you'd like to call on "mouseenter with intent". Your function receives the same "this" and "event" objects as it would from jQuery's hover method. If the "over" function is sent alone (without "out") then it will be used in both cases like the handlerInOut param.
The handlerOut function you'd like to call on "mouseleave after timeout". Your function receives the same "this" and "event" objects as it would from jQuery's hover method. Note, hoverIntent will only call the "out" function if the "over" function has been called.
A simple delay, in milliseconds, before the "out" function is called. If the user mouses back over the element before the timeout has expired the "out" function will not be called (nor will the "over" function be called). This is primarily to protect against sloppy/human mousing trajectories that temporarily (and unintentionally) take the user off of the target element... giving them time to return. Default timeout: 0
Modify these if you are brave, test tirelessly, and completely understand what you are doing. When choosing the default settings for hoverIntent I tried to find the best possible balance between responsiveness and frequency of false positives.
If the mouse travels fewer than this number of pixels between polling intervals, then the "over" function will be called. With the minimum sensitivity threshold of 1, the mouse must not move between polling intervals. With higher sensitivity thresholds you are more likely to receive a false positive. Default sensitivity: 7
The number of milliseconds hoverIntent waits between reading/comparing mouse coordinates. When the user's mouse first enters the element its coordinates are recorded. The soonest the "over" function can be called is after a single polling interval. Setting the polling interval higher will increase the delay before the first possible "over" call, but also increases the time to the next point of comparison. Default interval: 100


HOME
Shiva Car Rentals
Reserve Your Car here...ok
Promotions
About us
Feedback!
Contact us
Reserve our Cars @ Low Prices...


The quick and dirty:
Add the minified CSS and JS in the head, and include jQuery before the Bootstrap JS
<script src="//ajax.googleapis.com/ajax/libs/jquery/1.10.2/jquery.min.js"></script> <link rel="stylesheet" href="bootstrap-min.css"> <script src="bootstrap-min.js"></script>Any styles you don't like from Bootstrap you'll have to overwrite.
Another way to do it would be to use the customizer script they have to download a version with only the bits you need. http://getbootstrap.com/customize/
Use the CDN
Details to use the CDN hosting Bootstrap's latest code here.
The real way to do it:
This method takes longer, and involves using a LESS to CSS compiler tool, but it allows you to really customize Bootstrap.
- Download the Bootstrap source from Github.
- Find the LESS and JS files (feel free to use the JS min file if only wanting to change things in the CSS) and copy into your own project.
- Find a LESS compiler and import bootstrap.less, which refrences the other files.
- Use that generated (and hopefully minified) file as your bootstrap stylesheet.


| Package | Description |
|---|---|
| com.ibm.team.scm.client | |
| com.ibm.team.scm.client.events | |
| com.ibm.team.scm.common | |
| com.ibm.team.scm.common.dto | |
| com.ibm.team.scm.common.internal |
| Class and Description |
|---|
| IAcceptCombinedUpdateReport |
| IAncestorReport
For a particular versionable item, its ancestor report describes all of the
hierarchical ancestors to them in the configuration, along with their name in
the parent folder, as obtained through the use of the
IConfiguration.locateAncestors(List) operation. |
| IBaselineSearchCriteria |
| IBaselineSetSearchCriteria |
| IChangeHistorySyncReport
Represents the relative synchronization of a pair of change histories, termed
the local and the remote, and provides the information needed to transfer
changes sets between them.
|
| IChangeSetFlowReport
Data transfer object which represents the results of a workspace flow query.
|
| IChangeSetLinkSummary
Provides a summary of the links associated with a change set including a
one line human presentable description of the links.
|
| IChangeSetSearchCriteria
This interface defines the criteria that changesets can match.
|
| IComponentizedAncestorList |
| IComponentLockReport
This report groups all versionable reservations by component within a stream.
|
| IComponentSearchCriteria
This interface defines the criteria that components can match.
|
| ILocateChangeSetsSearchCriteria
Specify which change sets to locate in the given workspaces, snapshots and baselines.
|
| ILocateChangeSetsSearchResult
Represents the workspaces, snapshots and baselines that contain change sets
specified in
ILocateChangeSetsSearchCriteria#changeSets . |
| ILockSearchCriteria
This interface defines the criteria that locks can match.
|
| ILockSearchResult
TODO
|
| IReadScope
Describes an arbitrary visibility.
|
| IStreamLockReport
This report describes the different versionable locks which are held upon
components in the indicated stream.
|
| ISynchronizationInfo
Interface for allowing a client to construct synchronization information that it cares about
to pass in to various SCM methods.
|
| ISynchronizationTimes
Marker interface for passing around synchronization information.
|
| ISyncTime
A wrapper interface for synchronization times to isolate the
client from changes in the storage format of those times.
|
| IUpdateReport
Describes what has happened to the workspace as the result of an operation like
IWorkspaceConnection.accept(boolean,List) operation. |
| IWorkspaceSearchCriteria
This interface defines the criteria that workspaces can match.
|
| Class and Description |
|---|
| IUpdateReport
Describes what has happened to the workspace as the result of an operation like
IWorkspaceConnection.accept(boolean,List) operation. |
| Class and Description |
|---|
| IChangeHistorySyncReport
Represents the relative synchronization of a pair of change histories, termed
the local and the remote, and provides the information needed to transfer
changes sets between them.
|
| IGapDescription
*UNDER CONSTRUCTION - do not use*
|
| IItemInfoData |
| IItemOverlapData
A data transfer object which describes the exact failure of an
ItemAlreadyInActiveChangeSetException . |
| IOrphanDescriptor
Describes the specific item (and current or potential parent) which would have become an orphan in
the configuration if the operation succeeded.
|
| IReadScope
Describes an arbitrary visibility.
|
| IStreamLockReport
This report describes the different versionable locks which are held upon
components in the indicated stream.
|
| ISyncTime
A wrapper interface for synchronization times to isolate the
client from changes in the storage format of those times.
|
| Class and Description |
|---|
| IAncestorReport
For a particular versionable item, its ancestor report describes all of the
hierarchical ancestors to them in the configuration, along with their name in
the parent folder, as obtained through the use of the
IConfiguration.locateAncestors(List) operation. |
| IBaselineSearchCriteria |
| IBaselineSearchCriteria.WorkspaceSearchCriteriaFactory |
| IBaselineSetSearchCriteria |
| IBaselineSetSearchCriteria.WorkspaceSearchCriteriaFactory |
| IChangeHistorySyncReport
Represents the relative synchronization of a pair of change histories, termed
the local and the remote, and provides the information needed to transfer
changes sets between them.
|
| IChangeSetPropertiesSearchCriteria |
| IChangeSetPropertiesSearchCriteria.ChangeSetPropertiesSearchCriteriaFactory |
| IChangeSetSearchCriteria
This interface defines the criteria that changesets can match.
|
| IChangeSetSearchCriteria.ChangeSetSearchCriteriaFactory |
| IComponentDeltaReport |
| IComponentDeltaReport.IComponentDeltaFactory |
| IComponentLockReport
This report groups all versionable reservations by component within a stream.
|
| IComponentLockReport.IFactory |
| IComponentOpDescriptor
DTO which describes an operation to perform upon a component in a workspace.
|
| IComponentOpDescriptor.IComponentOpDescriptorFactory |
| IComponentSearchCriteria
This interface defines the criteria that components can match.
|
| IComponentSearchCriteria.ComponentSearchCriteriaFactory |
| IComponentStateSummary
Describes the UUID of the configuration for a given component.
|
| IContributorDeferringScope
An item with contributor deferring scope:
must be owned by a contributor
defers read access decisions to a project area.
|
| IItemBaseReport
Base interface for all item reports.
|
| IItemConflictReport
Report which describes how a particular operation has left a single
item in conflict in the workspace.
|
| IItemInfoData |
| IItemInfoData.IFactory |
| IItemUpdateReport
A description of how a single item was affected.
|
| ILocateChangeSetsSearchCriteria
Specify which change sets to locate in the given workspaces, snapshots and baselines.
|
| ILocateChangeSetsSearchCriteria.ILocateChangeSetSearchCriteriaFactory |
| ILocateChangeSetsSearchResult
Represents the workspaces, snapshots and baselines that contain change sets
specified in
ILocateChangeSetsSearchCriteria#changeSets . |
| ILocateChangeSetsSearchResult.ILocateChangeSetSearchResultFactory |
| ILockSearchCriteria
This interface defines the criteria that locks can match.
|
| ILockSearchCriteria.LockSearchCriteriaFactory |
| IOrderedSearchCriteria |
| IPrivateScope
An item with private scope is visible only to the owner.
|
| IProcessAreaScope
An item with this scope is owned by a process area.
|
| IPublicScope
Items with this scope may be read by all contributors.
|
| IReadScope
Describes an arbitrary visibility.
|
| IReadScope.IReadScopeFactory
The source for readscope objects.
|
| IRepositoryDescriptor
This interface describes a remote repository, as used in cross-repository
comparisons and preflight accept.
|
| IRepositoryDescriptor.IFactory |
| ISearchCriteria
Marker interface for search criterias interfaces.
|
| IStreamLockReport
This report describes the different versionable locks which are held upon
components in the indicated stream.
|
| IStreamLockReport.IFactory |
| ISynchronizationInfo
Interface for allowing a client to construct synchronization information that it cares about
to pass in to various SCM methods.
|
| ISynchronizationInfo.SynchronizationInfoCreator |
| ISynchronizationTime
Marker interface for synchronization times
|
| ISynchronizationTimes
Marker interface for passing around synchronization information.
|
| ISyncTime
A wrapper interface for synchronization times to isolate the
client from changes in the storage format of those times.
|
| ISyncTime.SyncTimeFactory |
| ITeamAreaPrivateScope
Items with this scope must be owned by a team area.
|
| IUnknownScope
Indicates that the scope is not known to the client.
|
| IUpdateReport
Describes what has happened to the workspace as the result of an operation like
IWorkspaceConnection.accept(boolean,List) operation. |
| IVersionableLock
A versionable lock is a reservation in a component in a stream by a contributor,
to prevent others from changing the current state in the configuration.
|
| IVersionableLock.IFactory |
| IWorkspaceSearchCriteria
This interface defines the criteria that workspaces can match.
|
| IWorkspaceSearchCriteria.WorkspaceSearchCriteriaFactory |
| Class and Description |
|---|
| IOrderedSearchCriteria |
| ISearchCriteria
Marker interface for search criterias interfaces.
|


Group Meeting On Discord (13/04/2020,8pm)
Consolidating Research
Every team member shared their findings and conclude that the platform will be on a mobile application and will be adding the most important and fundamental features for a ride-hailing application
Discussed Payment Options(Business model)
- Incentives
- Petrol card
Discussed additional Functions we kept in view
- Baby Friendly
- Credit Card Security
- Multiple Drop Off
- Pet
- Points system
- Sensitive information encryption
- Shuttle Service
Key Feature
- Emergency Contact
- History
- Profile for passenger and driver
- Ratings
- Status of scheduled trip
- Safety Centre
Removed unnecessary functions
- Accident Detection
- Bicycle Rental
- Cancelled Trips
- E-wallet
- Hail for a friend
- Insurance
- Premium Services
- Recording
9:50pm - Creating a brief description in the App
We discuss everything that is to be done in-app including messaging services and application to be available to Apple and Android devices.
Reason
Exclusive to every students and staff of SIM using any device. Allow everyone to meet each other and knowing someone new. Reduce carbon footprint. Comfortable and faster way to get home as a lower cost. Our application prioritises safety and rest assured;you will be riding with people of the same community.
First Draft
Our platform is a carpool application that is available exclusively to students and staff of SIM using both android and apple devices. We care about the environment thus we promote one that reduces carbon footprint and traffic congestion. At the same time,lessen the financial burdens of the driver. Don't ever worry about not having a ride or squeezing with the evening crowd on public transport. Safety is our top priority,therefore, sit back and relax, knowing that you are getting home and reaching school with a member of the same community.
Company Tagline
Marketing it in a way to meet different students from other faculties. Lack of females in computer science major? Use our application to meet girls from art major.
10.00pm - Creating a brief description in the App
We added and filled up user requirements for the application based on the functionalities we chose, Entities and functions for Passenger, driver and system, rides, payments etc to store their unique IDs and corresponding functions. (ER Database).
Questions asked during the meeting
- Are we going to work with SIM Office for this service?
- Can passengers have a complaint section to give their feedback?
- Do we need a system admin and someone to monitor the system?
- Name of the platform?
- The business model of the platform?
- Which software development strategy do we use? Scrum/Agile or Waterfall.
We completed our objectives for week 2, Which was to decide which functionalities we want for our final product. We will continue to research to see if we have any other additional functions to add on throughout the development of the platform and after getting feedback with our supervisor. Towards the end of the meeting, we discussed the objectives for the following week which is to continue researching on other functions we potentially miss out before our second meeting with our supervisor. Ensuring we get feedback from our supervisor for our research before making any required changes.


Before Change
end.append(index - 1)
step.append(-1)
new_shape += (-3,)
elif isinstance(index, Symbol):
if new_shape != ():
new_shape += (-4,)
sliced = _npi.slice(result, begin, end, step)
After Change
raise ValueError("slice step cannot be zero")
elif isinstance(key, Symbol):
return _npi.advanced_indexing(self, key)
elif isinstance(key, tuple) and len(key) == 0:
return self
elif isinstance(key, tuple) and all(isinstance(k, Symbol) for k in key):
key = _npi.stack(*[i for i in key])
sliced = _npi.advanced_indexing_multiple(self, key)
return sliced


Debunking the #FloodLibel
24 Feb 2016The heavy rains in Israel were exacerbated this week by a decision by the Hamas government in Gaza to open the dams on the borders of the Gaza Strip. By opening these dams, Israeli towns and roads were submerged in water disrupting traffic and putting many Israeli lives at risk.
A shop owner in Sderot complained.
“I don’t understand why this happened to us. The last time, the municipality told us that [there was flooding] because there was more rain than normal, and therefore the drainage system couldn’t handle it. But what happened this time? There was a normal amount of rain, and here we are, again with flooding, even worse than the last time.”
Clearly this shop owner was unaware of the nefarious actions taken by Hamas and its intentions to flood Israel. While Hamas has denied these actions, citing the fact that there is similar flooding in Gaza and that no dams exist for it to open even if it wanted to, Israel stuck to its assertion of Hamas culpability.
The Israeli government also reported that the Palestinian Authority in the West Bank has opened barrages leading to flooding in central and southern Israel. These claims were also denied.
The above is obviously nonsense. Israel is flooding today due to heavy rains and not because of any dams Hamas opened. Hearing the story reported this way sounds completely ridiculous and immediately outs anyone parroting it a propagandist not a journalist.
However, year after year, this same narrative is churned out by the Palestinian media and picked up by news affiliates all over the world.
These news sources, hungry for a story that easily paints Israel as evil and Palestinians as victims jump on this without bothering to do the most basic research that would tell them:
- There are no dams around Gaza to be opened as admitted by Al Jazeera in an uncharacteristically forceful retraction.
- Israel suffers from the same exact flooding at the same exact time (see above videos).
- In anticipation of the natural flooding, Israel facilitates the transfer of heavy water pumps from the Palestinian Authority to Gaza.
The #FloodLibel hasn’t yet started to make major rounds this year, but when it does (and it will), be ready to debunk it with this easy to use chart:


inside.outside.inside.outside
music created by steel tipped dove using:
• other peoples music
• “stems” app by sunflower software
• Reason Studios 11
• Logic Pro X
website created by Joseph Fusaro:
• HTML and CSS
• github
• netlify
• Atom & VS Code software
artwork created by:
• Joseph Fusaro
record label
• U Don’t Deserve This Beautiful Art
Cassette Duplication
• duplication.ca
I used the stems app to separate out individual musical elements of songs I picked out from my digital music collection. the app will separate out bass, drums, acapella, piano, and another track labeled “other” — theoretically, these instrumental parts should sound isolated – but this is very difficult to achieve. I’ve heard other apps do it better – but I really like the weird messed up results that came while doing this. Everything...sounded… under-water-ish? Or as my friend Bobby put it: "a song I once heard, somewhere, some time ago"
I then used Reason Studios to play with looping those elements, manipulating them even more, slowing them down and speeding them up, adding additional sounds. Eventually, I'd created approx. 50 different instrumental pieces. Next, I used Logic Pro X to arrange and blend together 80 minutes of random soundscapes ranging from indoor spaces to outdoor spaces.
I then sorted through all my instrumentals created in Reason Studios and started blending them together underneath the soundscapes.
Eventually breaking them down into 4 individual 20-minute pieces of music & soundscape representing indoors during the day, outdoors during the day, indoors during the night, and finally outdoors during the night. During the time I spent making the music, I taught myself some very basic HTML and CSS programming so I could create a very basic website to stream the music from and a portal, so people could purchase/download it. From there my friend Joel Hooks walked me through getting the code I wrote onto github and netlify, so I could publish the site. This was fun. Hope you like it. Check the links below to start at the top of the site again or buy the album.
Joe
________________________________________
[LINKS]
start again


Learn jQuery
Task 1: jQuery effects: showing and hiding content.
What is jQuery?
jQuery is a JavaScript library. jQuery simplifies DOM modification and solves cross-browser problems.
How to get DOM elements with jQuery?
To get a specific element use $('selector')
method (equivalent to jQuery('selector')
). $()
searches through the DOM for elements that match the provided selector and returns a new jQuery object that references these elements.
How to use $(document).ready()
method?
.ready( handler )
method provides a way to execute JS code after the DOM is loaded. A handler
is a function that will run only after the DOM is ready.
These equivalent syntaxes can be used:
$( handler )
$( document ).ready( handler )
$().ready( handler )
this
with direct and delegated event handlers
For directly bound handlers this
keyword is a reference to an element where handler was attached. Syntax for directly bound handlers: $().on('event', handler)
.
For delegated events this
keyword is a reference to an element matching 'selector'
. Syntax for delegated events: $().on('event', 'selector', handler)
.
jQuery.ajax()
method
jQuery offers few methods to create AJAX requests. The full-featured core method is $.ajax()
.
$.ajax()
returns jQuery XMLHttpRequest (jqXHR) object which is a superset of the browser's native XMLHttpRequest object and implements the Promise interface. This gives the jqXHR object all properties and methods of a Promise object.
AJAX-related convenience methods
jQuery simple convenience methods include $.get()
, $.post()
, $.getJSON()
. These methods pre-set some of the options of the $.ajax()
method.
All jQuery AJAX-related methods return jqXHR object which implements the Promise interface and has all properties and methods of a Promise object.
Task 2: changing CSS styling.
Click on this paragraph to toggle text color: black/red.
Task 3: adding and removing DOM nodes.
A simple ToDo list (without saving entries feature)
- test entry×
- test entry×
- test entry×
Task 4: jQuery animate() examples.
Task 5: random background color generator in Grid CSS layout.
Click on the grid to change background color randomly.
Task 6: modal image gallery.
Image gallery size is set relative to viewport. Photos have equal height and different width.
Image gallery is responsive.
Click on any image to open modal.
Images are under CC0 license.
Task 7: slideshow image gallery.
Image gallery has fixed size. Photos have equal height and width.
Image gallery and images are responsive.
Images are under CC0 license.
Task 8: carousel with jQuery.
Image under CC0 license.
Link to the image source.
Image under CC0 license.
Link to the image source.
Image under CC0 license.
Link to the image source.
Image under CC0 license.
Link to the image source.
Task 9: tab panels.
CSS width, height, max-width, margin and padding properties.
- Width
- Height
- Margin
- Padding
Width auto for block-level elements
The initial width of a block-level element is auto. This makes it expand to fit the horizontal space of the content area of the containing block.
Width 100% for block-level elements
If the element's width is set to 100%, that means that the element's total width will be calculated as 100% of the containing block width plus all horizontal paddings, borders and margins (unless the box-sizing: border-box is set, in this case only margins will be added to the 100% value).
Margins and element height
By default elements' margins do not affect the containing block size. This can be changed by adding padding or border to the containing block.
Height auto for block-level elements
If the parent element does not have a height set, it's height has a default value auto. Then when for a child element the height is set to %, the browser should calculate height from an undefined value(auto). Since the result would be a null-value, browser does nothing with the height of child element.
When margin is set to auto the browser calculates margin value.
When margin is set in % it specifies the margin in % of the containing block's content area width.
When padding is set in % it specifies the padding in % of the containing block's content area width.


"Specialist of the Learning Management System and PeopleSoft Vendor Identity Management Module. I provide support to multiple divisions throughout the Alaska Air Group system, serving more than 27,000 internal employees, contractors and vendors. I act as an internal consultant by analyzing data and recommending solutions to utilize the LMS to deliver, track training and measure performance to meet organizational objectives. Identify and Communicate opportunities for process and quality improvements, providing feedback on usage, defects, and suggested enhancements. Collaborate with the HR Technology on training needs and opportunities for the expansion of talent development within the organization. Maintain policies and procedures to ensure the security and integrity of systems/networks. I’m committed to continued learning and online education. As a leader, I acquire and maintain knowledge of current technology as it applies to LMS software and systems"


disipyl Manual
This document provides information about disipyl, an
object-oriented Python library for generating scientific plots.
Documentation
The available documentation on disipyl is of two
types:
- A set of hand-crafted documents which provide an overview, tutorial, and
exposition on how and why disipyl is put together the way
that it is.
- Documentation automatically generated from source files (using pydoc
plus additional functionality found in
disipyldoc.py
).
Additionally, you should probably get a hold of the documentation that
comes with DISLIN.
Hand-crafted Documentation
Contents:
- Overview
- Features
- Screen shots
- Installation
- Tutorial
- Structure
Auto-generated Documentation
The root of the automatically generated documentation is disipyl.html.


2 #include "CommandMonitor.h"
27 static std::string FormHeader(
const Command& command,
const std::string& action);
29 void WriteMessage(
const Command& command, std::string message);
31 std::ofstream m_stream;
Represents an action that can be run synchronously or asynchronously.
Definition: Command.h:98
Implements CommandMonitor by writing diagnostic information to a log file that can be parsed and dyna...
Definition: CommandLogger.h:15
virtual void CommandFinished(const Command &command, const std::exception *exc) override
Invoked by the framework whenever a Command (including owned commands) is finishing execution,...
CommandLogger(const std::string &filename)
Constructor
virtual void CommandStarting(const Command &command) override
Invoked when a Command (including owned commands) starts execution
This is a callback interface for Command starting and finishing events. Its intended use is for loggi...
Definition: CommandMonitor.h:19
CommandLib contains a set of classes that can be used to easily coordinate synchronous and asynchrono...
Definition: AsyncCommand.h:5


California Baptist outlasts Central Arkansas in overtime
by The Associated PressRIVERSIDE, Calif. (AP) — Ferron Flavors Jr. scored 24 points, Tre Armstrong added 17 off the bench, and California Baptist defeated Central Arkansas 104-98 in overtime on Friday night in the 2K Empire Classic.
Milan Acquaah added 16 points and nine assists for the Lancers (3-2). He was 10 for 10 from the free-throw line. Dejon Davis scored 14 points and Omar Lo had 11.
Hayden Koval had 15 points, nine rebounds and eight assists for the Bears (1-5). Eddy Kayouloud scored 28 points and grabbed eight rebounds. He made 10 of 13 free throws but committed a costly foul near the end of regulation.
With eight seconds remaining in regulation, and Central Arkansas leading by one, Kayouloud made the first of two free throws. After a time out, he missed the second before fouling Acquaah who made both free throws to send the game into overtime tied at 88.
Ty Rowell and Acquuah sank 3-pointers early in the extra period and Cal Baptist went up by six near the three-minute mark. The Lancers scored their last eight points from the line.
Rylan Bergersen scored 20 points and Jaxson Baker 14 for Central Arkansas.
___
For more AP college basketball coverage: https://apnews.com/Collegebasketball and http://twitter.com/AP_Top25
The Associated Press


Crypto Wallet is the gateway to blockchain applications. You can Buy, store, send and swap tokens using wallet.wallet provides the simplest yet most secure way to connect to blockchain-based applications. You are always in control when interacting on the new decentralized web.
Wallet Examples - MetaMask, Bitski, Fortmatic, WalletConnect, WalletLink, Arkane Network, Dapper, Authereum, TORUS
Next Question: Different Types of NFT Platform?.


Currently a Computer Engineering student at UPRM passionate about algorthm design, AI, Deep Learning/Machine learning.
• Optimized the time of requesting a part number for electrical components from 1 week+ to 0.4s by creating a web interface
capable of generating unique part numbers on the laboratory by developing a C# RESTful API.
• Created a part scanning system capable of update and keep track of the part’s location, bill of materials
structure and import their records from ASP to ARAS Innovator by using their barcodes records with C# RESTful
API and Node.js web view.
• Developed a system for Product Data Management (PDM) error detection (Angular 6, Node.js, C#).
• Created a SolidWorks PDM add-in in C# Class library to synchronize revisions between sketches and CAD models
• Aras Innovator PLM Customizations (JavaScript)
• Developed solutions for cyber security on power system by exploring the different vulnerabilities it can have
• Taught over 30 6th, 7th and 8th graders basic concepts of robotics.
• Taught how to code using MIT’s Scratch Game Engine.
GPA: 3.32
Machine Learning: Python, PyTorch, Tensorflow, Tensorflow.js
Web Development: Node.js, MongoDB, Angular 2-6, CSS3,
HTLM5, Google firebase, PHP, SQL Server and JavaScript, jQuery,
ASP.NET.
App Development: Java and XML (Android) and C#
Operating Systems: Windows, Mac OS, Ubuntu and Kali Linux.
Firmware Programming: C/C++ (Arduino and TI MSP432).
Others: C++, OpenCV, Python, and MATLAB.
My experience and interests goes from web and game development to research on autonomous vehicles, AI, machine learning and algorthm design.
• Won 3rd place among the top 6 projects out of the initial 24+ projects for presenting an engineering idea to reduce the amount of plastic and micro plastic in the ocean.
• Awarded for the most altruistic engineering project among 24+ projects


Checkout
Photography Class
Name
Yusuf rafif
Email
<EMAIL_ADDRESS>Phone Number
081288749367
Bank BCA
Ridwan Ade
1243562356
Bank BCA
Ridwan Ade
1243562356
I Have Paid


Bags & Acsessories & Lingerie & Sportswear & Beauty & Swimwear
Sweaters & Hoodies & Puffer Jackets & Coats and Jackets & Knit
Poplin top with roll neckline, long sleeves
Pink/Sky Blue/Yellow
$129Embroidered Hoodie
Yellow/Lilac/Fuchsia/Orange
$89Faded Beach Trousers
Navy/Ochre/Black/Khaki
$139Text T-Shirt
White
$59Striped Long Sleeve Shirt
Red/Sky Blue
$119


TableModification
Short notations for Creating/Dropping a table
Syntax
Create Table+tablename([!primary_key], attribute_1, ..., attribue_n);
Drop Table-tablename;
Examples
+mytable(!id, attribute1, attribute2); -- create -mytable; -- drop
NativeSQL
BoilerSuit understands a subset of the native SQL as long as it is understood by the underlying database system.
Currently, the following commands are supported:
- SELECT
- CREATE TABLE [AS]
- DELETE
- INSERT
- UPDATE
Syntax
[result :=] sql-statement
Samples
SELECT FROM mytable;FROM mytable WHERE x = 2;
Export
Exports tables into various supported file types, currently csv, xls, xlsx
Syntax
variablename =: [filename [delim(delimcharacter)][quote(quotecharacter)][replacedelim(replacestring)][replacequote(replacestring)]]Extensions will be interpreted as follows:
- csv - exports as csv with default options
- xls - exports as Microsoft (R) Excel 1997-2003
- xlsx - exports as Microsoft (R) Excel
Samples
-- as simply as it can get - exports ALL variables
=:
existing_table_name =: file_name.xml;
existing_table_name =: file_name.xls;
existing_table_name =: file_name.xlsx;
existing_table_name =: file_name.csv;
existing_table_name =: file_name.csv with delim(";"), quote("\'"), replacedelim(","), replacequote("_");
On the use of delim, quote, etc. (Simple)
To export using ';' as a delimitator (instead of the default ','), you would use
existing_table_name =: file_name.csv with delim(";")
You could also use tabs, like so:
existing_table_name =: file_name.csv with delim("\t")
If you are in conflict with values using the desired symbols, use
-- replace e.g. O'Brien by O\'Brien not to come in conflict with quotes '
existing_table_name =: file_name.csv with delim(";"), quote("'"), replacequote("\\'")
On the use of delim, quote, etc. (Advanced)
- Argument of function delim() will be used as a delimitator to separate the strings in csv file.
- Argument of function quote() will be used as a quote to wrap the strings in csv file.
- Argument of function replacedelim() will be used for replace all of occurrences of delimitator in exported strings.
- Argument of function replacequote() will be used for replace all of occurrences of quote in exported strings.
Statistics
Counts the occurrence of selected attribute in the table, shows if there are any duplicates.
Syntax
?table_name(attribute)
LeftOuter
Imagine you have mycompanies and allcompanies and you want to look up the allcompanies records for all mycompanies. Some of the mycompanies will have allcompanies records corresponding, others won’t. You want to see those that have, with all the extra information from allcompanies. You want also to see those that do not have a correspondence at the same time.
A way to do this in SQL is a left outer join This is what BS left outer does for you:
Syntax
[result :=] left-table(left-key-attribute) -> companylist(right-key-attribute);
Examples
exactmatch := ourcompanies(name)->companylist(name);
TableExpression
This is to interpret BS's shorthand notation for SQL queries
Special features
Attribute qualifiers
Any given attribute in the brackets can be further qualified to filter it or to sort by it:
-- this customers(id, email{LIKE %co.uk, ASC}); -- is equivalent to: SELECT id, email FROM customers WHERE email LIKE '%.co.uk' ORDER BY email ASC;
Pre-processing functions (bsfXXX)
In addition, the concept of a "pre-processing" function is introduced, which will pre-process specific columns of a source table in certain ways. The pre-processing can be done using the following functions:
| Function | Purpose |
|---|---|
| Row ID | Short-hand notation to add a row number to the result
-- in sqlite for instance, this would translate to SELECT rowid AS id,* FROM source transformed := source(!id,*); |
| bsfMagicDate | Tries to recognize a date expression from various formats into the BS default format MM.dd.yyyy.
Works even if the formats in the source data vary from row
to row. For unrecognized expressions, a warning will be shown.
-- checking against common formats transformed := source(*, magicDate(MYDATE) AS STANDARDIZED_MY_DATE);If a preferred set of allowed formats should be used, they can be added as arguments: -- checking against y-m-d and y.m.d: transformed := source(*, magicDate(MYDATE, y-m-d, y.m.d[,...]) AS STANDARDIZED_MY_DATE); |
| bsfFormatNumber | Constructs a string using a pre-existing number in a certain way often useful to construct artificial IDs
for things. Lets assume we have a table with id's
id ----- 1 239 4000Then, we may want to construct id's of uniform length like so: result := table(id, formatNumber(id, A-DDDD) AS NEW_ID); -- Result will be as follows: id NEW_ID ---- ----------- 1 A-0001 239 A-0239 4000 A-4000 |
| bsfSuck | "Sucks" out specific patterns from the source data based on a regular expression |
| bsfHash | Hashes the source data using the String.hashCode method (probably depends on JVM used to run BS). If the hash value is > 0, an 'X' is added to the hash as a prefix, otherwise and 'Y' - this explains the Xxxxxx resp. Yxxxxx format of the hash result. |
- copy the result of an expression to a table
- import a file into a table
The expression can be on of the following:
- the name of an other, existing table or view (which will be copied to the assignment table)
- the result of a TableExpression, which is a special short notation for certain SQL queries
- a native SQL query
- in the case of an import, a filename with or without wildcards in it
Syntax
[new_table_name]:=filename | table-name | table-expression | native-sql-expression | wildcards
Examples
The most common and simple case is a short-hand notation for a SELECT statement:mytable(a,*) -- equivalent to SELECT a,* FROM mytable
Assert
Compares a boilersuit expression against a value and takes a specific action if the assertion is not true.
Any syntax or fatal error occurring during assertion will be handled as a fatal error and the script will be stopped. Assertion will be automatically false.
Syntax
ASSERT {bs-expression} = {value} ELSE {action}
{action} may be may be either STOP or WARN
Special features
- If {bs-expression}'s result is a table or view, the first column of the first row will be compared to the expected value
Examples
-- stop script if mytable has more or less than 3 rows ASSERT #mytable = 3 ELSE STOP;
-- the previous one is equivalent to... ASSERT SELECT COUNT(*) FROM mytable = 3 ELSE STOP
-- ...but it could be anything (here we would check first col of first row): ASSERT mytable = 3 ELSE STOP
FrequencyDifference
Analyse how often a value occurs accross two tables.
Syntax
[result := ]left-table.left-attribute ./. right-table.right-attribute
Example
official.claim_id ./. previous.claim_id;
This will produce something like
| claim_id_or_claim_id | official_count | previous_count |
|---|---|---|
| C123 | 100 | 50 |
| C234 | 0 | 50 |
Count
Counts the number of rows for a given variable.Syntax
#table-name[(where-clause)]
Examples
#table;
#mytable(attr1 like 'some value');
#cars(serialnumber = 12345);
ExecuteExternalScript
Reads in a text file and interprets it line per line as a BoilerSuit script. Commands have to be separated by ; and comments begin with --
Syntax
execute("filename");
Example
execute("scriptname.bs")Map
To map all occurences of a value in a specific attribute of a table to a target value as defined in the mapping
Syntax
MAP table(>attribute) USE mapping
where mapping is a table with columns source and target
Example
MAP cars(cartype) USE mapping
Mapping table should look like: "source", "target" "mercedes", "Boring_German_Car" "lada", "Racing_Machine" All occurrences of value 'mercedes' in cartypewill be replaced with 'Boring_German_Car' and all occurrences of value 'lada' will be replaced by 'Racing_Machine'.
Match
Fuzzy matching two data sets based on an attribute from both data sets. For instance, you may have table1 with "name" and table2 with "name". Result would be a new table containing all entries where table1's name is similar to table2's name. Various text similarity methods are used to determine the quality of the match (currently the Jaro/Jaro-Winkler Distance and Dice's coefficient
Syntax
[result_table_prefix :=] MATCH left_table(left_attribute) ON right_table(right_attribute) [WITH with-clause]
The with clause may contain the following parameters:
| Parameter | Result |
|---|---|
| DISPLAYLEFT(attribute_1, ..., attribute_n) | Will show all indicated attributes of the left table in the result table of the match (unless explicitly indicated, only match attributes plus match info will be shown but no other attributes, to keep the result table clean) |
| DISPLAYRIGHT(attribute_1, ..., attribute_n) | Will show all indicated attributes of the right table in the result table of the match (unless explicitly indicated, only match attributes plus match info will be shown but no other attributes, to keep the result table clean) |
| THRESHOLD(value) | Will ignore all "matches" below a certain threshold. If at least one of the applied similarity measures is above (greater than) the threshold indicated, the result match will appear, otherwise it will not. Note that there is no default threshold, so using this argument is important to prevent too many match results. |
| SUPPRESSSECONDBEST | For most records, there will be more than one match, and they all vary by quality. If the best match is just enough, then this option can be used to restrict the result to the best matches per left record against right record. |
Definition
The definition interpreter is probably the most frequently used in any BS script; it is used for two purposes:
- copy the result of an expression to a table
- import a file into a table
The expression can be on of the following:
- the name of an other, existing table or view (which will be copied to the assignment table)
- the result of a TableExpression, which is a special short notation for certain SQL queries
- a native SQL query
- in the case of an import, a filename with or without wildcards in it
Syntax
[new_table_name]:=filename | table-name | table-expression | native-sql-expression | wildcards [with-clause]
WITH Clauses
WITH delim([delim])
Examples
new_table_name := select from existing_table_name; -- sql new_table_name := file.csv; -- import file := file.csv; -- import file, give table name automatically (will be file_csv) := file*.csv; -- import list of files := -- import all files in directory (eq to :=) := file.csv WITH delim(',') -- import file.csv assuming the delimitor is ,
Variable
Displays the records from selected variable (variables are connected with tables). Usage: variable_nameChangeDirectory
Change or prints out current working directory
Syntax
CD {path}; -- to change directory CD; -- to print directory
Special features
Depending on operating system, syntax of path may vary. On Windows, backslash has been seen working; on linux slash.
After (successful) change of working directory, Boilersuit will automatically open the data.db file as current database.


Trader Ralford:
Ah, the Silver Dryad. How shall we proceed? I'll give you one Silver Dryad for 5 silver fairies and 5 silver ?golems. Or perhaps you would prefer a game of chance?
Exchange at the set rate
Play game. [Guess ?correctly in two tries - 3 silver fairies]
Play game. [Guess correctly in three tries - 7 silver fairies]
Play game. [Guess correctly in four tries - 9 silver fairies]
Explanation of game


Mushrooms - P. mexicana
I tried the philosophers stone truffles with a few friends last friday. The method for taking them suggested on the internet was in tea, so we prepared 10g each using a garlic crusher and added that to a cup of tea. We didn't have any other drugs that afternoon other than the truffles.
The weather was really nice and sunny so we decided to sit outside. The tea tasted fine, quite mushroomy obviously and it only started getting nasty when the tea was stone cold :). Anyway, for the first hour there were virtually no effects - maybe some mild perceptual changes, no noticeable nausea.
After about an hour the effects started to become much stronger. Overall was an extremely euphoric feeling, everything was very funny. Combined with this was a lack of coordination and sense of 'losing your mind'. This wasn't worrying though, but seemed really entertaining.
Eventually, about 2 hours after ingestion i guess, the transition from a normal state to the 'mushroom state' was complete and the 'losing your mind' sensation had vanished. For the next 2 hours, maybe longer, we had great feelings of empathy with nature. I felt that I could talk to the grass and the trees, who were all very friendly. We walked in to a wooded section of the garden and were a bit concerned to see that some of the plants were 'ill'. They had holes and suchlike in their leaves, but we were happy to hug and comfort them anyway. I hugged a large tree and felt a huge mutual love between us.
These effects lasted for a significant amount of time, it's hard to say exactly because time seemed to be going very slowly. The high was followed by a very steady and easy 'come down'. Everyone was incredibly relaxed and able to talk very easily and openly to one another.
After sitting outside for a while longer we decided to go inside since it was getting dark. Being inside a house was quite daunting at first, although more in a strange than scary way. Sitting inside, I could see trees outside the window and it was these that grabbed my attention for a long time. Gradually the effects of the truffles wore off and there was a slow, comfortable slide back to soberness.
Overall, I was very pleased with these truffles, the high was very happy and peaceful, a sense of 'oneness' with nature. These are by far the most mellow and pleasing drugs I've taken. The whole experience was very uplifting and didn't leave me tired like many other drugs would have.
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.


{{ define "main" }} {{- partial "header_2.html" . -}}
CIBIL RANK is only available for companies with current credit exposure between Rs. 10 lakhs to Rs. 50 crores.


Match Play. Red leads 2-1 to 7. How should Red play 65?
pips Red=165 White=136
(CorrectAnswer= 0/0, ErrorScore= 0)
8/2, 6/1* splits Red’s army in half and there is no real value in making the 2-pt.
Red needs an outfield presence. 24/18, 23/18 is wrong by a long way. Red needs to keep one of those checkers as a long-term goalkeeper.
Therefore the choice is between 23/12* and 24/13*. If Red does end up in back game then owning the 23-pt will be much better than the 24-pt in most variations.
This gives the nod to 24/12* as the correct play.
Red needs an outfield presence. 24/18, 23/18 is wrong by a long way. Red needs to keep one of those checkers as a long-term goalkeeper.
Therefore the choice is between 23/12* and 24/13*. If Red does end up in back game then owning the 23-pt will be much better than the 24-pt in most variations.
This gives the nod to 24/12* as the correct play.
1. Cubeful 2-ply 23/12* Eq.: -0.381 0.428 0.135 0.008 - 0.572 0.199 0.010 2. Cubeful 2-ply 24/13* Eq.: -0.400 (-0.019) 0.423 0.133 0.009 - 0.577 0.204 0.009 3. Cubeful 2-ply 8/2 6/1* Eq.: -0.445 (-0.064) 0.404 0.152 0.008 - 0.596 0.191 0.009 4. Cubeful 0-ply 24/18 23/18 Eq.: -0.610 (-0.229) 0.368 0.086 0.004 - 0.632 0.180 0.005 5. Cubeful 0-ply 21/10* Eq.: -0.618 (-0.238) 0.406 0.124 0.009 - 0.594 0.252 0.038


--- layout: archive title: Zulip Chat Archive permalink: /stream/113488-general/topic/universe.20enlargement.html ---
Suppose I have a universe-polymorphic proposition P.{u} : Prop
and a proof of P.{u0}
as a term (either in the empty context, or, ideally, in a context which only contains variables whose types are Type v
for v <= u0
). Is it then true that I can also prove P.{u1}
, for any u1 >= u0
?
Is this something I could prove just by inducting over the proof term?
Obviously it depends on my axioms, since for example I could consistently assume that Type 0
has no inaccessibles, which I can prove is false in Type 1
. I mean using the usual axioms of Lean.
Let P.{u} = |Type u| < |Type 1|
and u0 = 0
You need only the usual axioms to prove that P.{0}
is true and P.{1}
is false
Hmm, right. I need to find a better way to express what I mean.
One true thing is that there is a model of lean where the universes are any increasing countable sequence of inaccessibles, not necessarily the minimal one, which suggests that it is possible to convert any proof using universes Type 0, ..., Type k
into one using Type u_0, ..., Type u_k
where u_0 < ... < u_k
. However this is not so easy because of the existence of the universe successor function: Type 0
has type Type 1
but Type u_0
does not have type Type u_1
. So this doesn't work without modification
Last updated: Apr 24 2020 at 19:02 UTC