Want to get involved in the local arts scene? Sun Gallery welcomes new members as well as new volunteers for various projects. What are your strengths? Arts education? Nonprofit operations? Just want to help out and enjoy the gallery setting? Give us a call!
Want to help, but don’t have time? We accept donation through PayPal to support our operations and programming—and every little bit helps.


Module: ViewModels
- Defined in:
- lib/view_models/base.rb,
lib/view_models/view.rb,
lib/view_models/version.rb,
lib/view_models/path_store.rb,
lib/view_models/helpers/view.rb,
lib/view_models/render_options.rb,
lib/view_models/extensions/view.rb,
lib/view_models/helpers/mapping.rb,
lib/view_models/context_extractor.rb,
lib/view_models/helpers/collection.rb,
lib/view_models/extensions/model_reader.rb
Overview
Makes model reader installation, including filtering in-between possible.
Defined Under Namespace
Modules: Extensions, Helpers, RenderOptions Classes: Base, ContextExtractor, PathStore, View
Constant Summary
- MissingTemplateError =
Gets raised when render_as, render_the, or render_template cannot find the named template, not even in the hierarchy.
Class.new(StandardError)
- VERSION =
The current version of the gem
'3.0.0'.freeze


| Fetching from a bam file | |
|---|---|
| Margin around a variant or manually entered coordinate where reads will be pulled from a bam file (use this parameter carefully as importing too much data can crash your web browser due to memory overload) | bp |
| Automation | |
| Make Ribbon automatically go to each variant in a bedpe file and take pictures of the multi-read view and a selection of reads. Instructions: Load a bedpe file and a bam file first, set the settings below and in the right-side panel as you want them and click Run! | |
| Prefix for image files | |
| Number of reads to take pictures of (randomly selected) | |
| Print variant coordinates onto multi-read view | |
| Download a file with info and coordinates for each variant alongside the images | |
| Only select reads with alignments that start or end near the bedpe variant | |
| If a region is too large for the browser to load, automatically subsample | |
| Distance: | |
Ribbon is made by Maria Nattestad with support from Pacific Biosciences and Cold Spring Harbor Laboratory.
The code is open-source at https://github.com/MariaNattestad/Ribbon
Please cite our paper on the bioRxiv:
Ribbon: Visualizing complex genome alignments and structural variation: http://biorxiv.org/content/early/2016/10/20/082123
Ribbon stands on the shoulders of giants:
Ribbon also uses two D3 plug-ins created by Maria Nattestad:
Please cite our paper in Bioinformatics:
Ribbon: intuitive visualization for complex genomic variation: https://doi.org/10.1093/bioinformatics/btaa680
Also see the preprint on the bioRxiv:
Examples:
PacBio, Illumina, and genome/assembly examples shown in the Examples tab above.
Visualize your own alignment data:
Ribbon can be used for long reads, short reads, paired-end reads, and assembly/genome alignments. Instructions for each data format are available by clicking on "instructions" in each tab on the right.
Local installation:
You can install Ribbon locally from Github by following the instructions here: https://github.com/MariaNattestad/Ribbon
Introduction video:
| Filter reference chromosomes | ||
|---|---|---|
| Zoom to chromosome | all |
|
| Minimum number of alignments: | 1 |
|
| Maximum chromosome length: | ||
| Reference settings | ||
| Color scheme: | ||
| Collapse reference sequences within distance: | ||
| Draw black border on selected region |
| Filter reads | ||
|---|---|---|
| Number of alignments: | ||
| Minimum read length: | ||
| Minimum mapping quality: | 0 | |
| Read settings | ||
| Sort reads vertically: | ||
| Orient reads by: |
| Indels | ||
|---|---|---|
| Show indels as: | ||
| Features | ||
| Show features as: | ||
| Variants | ||
| Show only the chosen variant when others are in view |
| Selected read | ||
|---|---|---|
| Search reads: |
| Minimum mapping quality: | 0 | |
| Minimum alignment length: | inf |
| Match reference from region view | ||
| Highlight selected read | ||
| Minimum indel size to split: | inf | |
| Alignment outlines on ribbon plot: | ||
| Colors on dotplot: |
Paste a few lines from a sam file here:
or upload a small sam file:
For larger files (above 10MB) see the "load bam file" tab.
InstructionsSelect bam and corresponding index (bai/csi)
InstructionsMake sure the bam file exists and that it has a corresponding index (.bai or .csi) file with an identical filename except for the addition of the .bai or .csi suffix. If the bam file does not exist or cannot be read, a header will fail to appear but there will be no error message. If the header of the bam file does not show up within about 10 seconds, loading the bam file has probably failed and you should check to make sure it actually exists at the given address. (To test for this, put the url into your web browser. If it starts downloading the bam file, then also check whether adding .bai or .csi to the url downloads the index file. If one of these does not start a download, then the file does not exist.)
Note that the bam file does not get read into memory, but the index file does, so if the index file is huge, it will take a while the first time you fetch reads from the bam file.
Paste coordinates here:
or upload a file:
InstructionsUpload a .vcf or .bed file
Instructions for .vcf file
Instructions for .bed file
Upload a .bedpe file
Paste lines from a bed file here:
InstructionsPaste lines from a vcf file here:
InstructionsUpload a bed file with genes, repeats, or any other types of elements you want to annotate
Instructions for .bed file
Showing only the first 30 variants. Sort by clicking column names. Filter by typing =chr20, >2000, etc. for each column. For bam files, click on a row in the table to fetch reads around that feature.
Showing only the first 30 variants. Sort by clicking column names, and filter by typing into the text boxes for each column. For instance, type >20 or =chr2. Separate multiple filters in a single column using spaces. For bam files, click on a row in the table to fetch reads around that feature.
Showing only the first 15 features. Sort by clicking column names. Filter by typing queries into text input boxes, e.g. =17, >200.


{% octicon beaker class:"mt-n1" %} Development docs may describe unreleased features · Go to {{ site.release }} docs · For shortcuts, type ?


Patients that enter Intensive Care Units (ICUs) require specialized care and
close monitoring to address often severe and life-threatening conditions. Different studies have
found that between 55-75% of patients survive. This can lead one to consider if we can use machine
learning to model patients' survival outcomes using available health data.
MIMIC-III (Medical Information Mart for Intensive Care) is a clinical database comprised of
deidentified health-related data from 2001 and 2012 associated with over 46,000 ICU patients.
Ask:
Can we predict the probability of a patient surviving after being admitted to the ICU
using only their admissions information?
Response:
A machine learning model was trained to predict the probability of survival
for patients admitted to the ICU using attributes from admissions data.
Explore:
Continue onward to learn more about the data
and how a subset of the original dataset was selected to train the model.
After exploratory data analysis, 4 attributes
were selected to train the predictive model: age, gender, type of admission, and initial
diagnosis.
Age represents the continuous variable of a patient's age, while gender and type of admission
are
categorical variables. Based on the dataset, gender can be either female or male and the 3
types of admissions are elective, emergency, and urgent. MIMIC provides that
the main difference between elective and emergency/urgent is that elective
indicates a planned medical visit.
The initial diagnosis is the preliminary diagnosis of a patient at hospital admission
usually assigned by the admitting clinician. This attribute is a line of free text—and this
project expects that this text attribute holds a great deal of information that is not
available in the numerical or categorical data.
Examples of initial diagnoses include:
- 'Pneumonia'
- 'Post-op knee infection'
Of the original 46,000+ patients, the dataset was filtered for adults between the ages of 18 and 89
and
for patients who spent less than 31 days in the ICU.
Patients who did not survive were determined by those who passed away within 1 day of being
discharged (inclusive of passing away in the ICU). This resulted in approximately 25,000 unique
patients, of whom about 5,000 did not survive. To have a balanced dataset,
a random selection of
5,000 patients was selected from the 20,000 who survived to train the model along with the
5,000 who did not survive.
About the Model:
A logistic regression model was trained on approximately 10,000 adult patients using attributes
of age, gender, admission type, and initial diagnosis.
The initial diagnosis
was vectorized to retrieve term significance
with term frequency-inverse document frequency (TF-IDF).
The train and test accuracies were between 75-78% (with a classification threshold of
0.5)—thus,
overfitting does not appear to be a notable concern. The AUROC when trained on the entire
dataset was about 0.78.
Select values for the following 4 attributes:
Prediction Results:
{% if prediction_value %}
A {{ gender }} patient who is {{ age }} years old with
an {{ type }} admission to the ICU and diagnosed with {{ description }}
is expected to have
{{ prediction_value }}% chance of survival.
What does this result mean?
This is the prediction of a model trained on a specific set of attributes and patients, but
there are numerous other factors such as
medical history and treatment that can affect
survival rate.
Please do not consider this as
medical advice.
{% else %}
Select values to make a prediction.
{% endif %}
Most patients spend a short period of time in the ICU, with a significant amount spending up to
10 days. This graph shows that the number of patients who have survived substantially decreases
as the
number of days spent in the ICU increases. There is a slower [declining] progression for
patients who do not survive, nevertheless the number of such patients also decreases with time.
This project expects that patients that remain in the ICU for a long period of
time have more critical needs than the average ICU patient. Thus, a cutoff of 30 days was
selected and only patients that spent up to 30 days in the ICU were considered for this project.
A majority of patients entering the ICU are between the ages of 40 and 90. There is a a general trend showing that as age increases, more older patients are admitted to the ICU. Moreover, of these older patients who are admitted, a smaller portion survive (the size of the orange bars increase with age denoting a larger portion who do not survive).
Close WindowWe see that a vast majority of admissions to the ICU are emergency. Moreover, it appears to be highly likely for an elective admission to result in survival.
Close Window


How to Build a Program
The design protocol below, is similar to the 6-step process described in the previous part. This document is shamelessly lifted from http://users.csc.calpoly.edu/~jdalbey/101/Lectures/HowToBuildAProgram.html here I am using the concept of program and notebook as the same thing.
Building a program is not an art, it is an engineering process. As such there is a process to follow with clearly defined steps.
Analysis (Understand the Requirements)
In this class you will be given the problem requirements, unlike the real-world where you have to elicit the requirements from a customer. For you the first step will be to read the problem and be sure you understand what the program must do. Summarize your understanding by writing the Input data, Output data, and Functions (operations or transformation on the data).
Create a Test Plan
You must be able to verify that your program works correctly once it is written. Invent some actual input data values and manually compute the expected result.
Invent a Solution
This is the creative, exploratory part of design where you figure out how to solve the problem. Here is one strategy: Solve the problem manually, the way you would do it as a human. Pay careful to attention what operations you perform and write down each step. Look for a pattern in the steps you performed. Determine how this pattern could be automated using the 3 algorithm building blocks (Sequence, Selection, Iteration).
Design (Formalize your solution)
Arrange your solution into components; this is called the architecture. Write the algorithm for each component. Refine your algorithm in a step-wise manner if necessary. Determine the data types and constraints for each data item. Review
Perform a hand trace of your solution and simulate how the computer will carry out your algorithm. Make sure your algorithm works correctly before you put it into the computer.
Implementation (coding)
Translate your algorithm into a programming language and enter it into the computer.
Compile your source code to produce an executable program.
You may want to compile and test each subprogram individually before combining them into a complete program.
Testing
Execute the program using the Test Plans you created above. Correct any errors as necessary.


Reasonable Faith is a course designed to guide senior students through a critical analysis of basic beliefs. This is accomplished through a critique of basic beliefs by examining uncritically held presuppositions about life. In the first unit, the students will be exposed to principles of basic philosophy. As the students continue to examine basic beliefs, the course moves to a basic presentation and critique of the defense of theistic and Christian basic beliefs. The course is, therefore, a blend of basic philosophy and Christian apologetics.
British Literature:
This course aims to familiarize students with a range of British literature, moving chronologically from Anglo-Saxon poetry to the modern novel. It will develop students’ skills in analyzing texts thematically and stylistically. Students will work to understand the ways in which the different cultural contexts influence writers and their texts. Students will also improve writing skills by working through the writing process in a variety of modes.
Yearbook:
The Yearbook course is an interdisciplinary course that teaches project management, business, leadership, photography, journalism, and graphic design. Students will create and execute a project plan to develop and produce a product they will sell: the 2015 Logos International School Yearbook, in time for delivery in the Spring.
Web Design:
Students will experience the entire software development lifecycle with an introduction to SCRUM and Agile methodology. Students will create a working website using a variety of programming languages including PHP and Javascript and demonstrate understanding of the underlying protocols and architectures of the Internet. Teamwork will be practiced extensively.
AP Calculus:
AP Calculus will begin with limits which will lead into differentiation and its applications. Some pre-calculus review will be mixed into what will be covered. Integration and more will be covered in the second semester. A more detailed syllabus can be found at www.collegeboard.com. Every AP student should go to this site and open a free account.
AP Stats:
This is a college level, introductory statistics course that is aimed at giving students the tools to collect, analyze, and draw conclusions from data. The main themes include: exploring data by describing patterns, sampling and experimentation by planning and conducting a study, anticipating patterns by using probability, and statistical inference to estimate populations and test hypotheses. www.collegeboard.com offers several additional resources for students.
Physics:
In this course we will study the basic relationships and laws of the physical universe, which cover motion,, forces, energy, waves and electricity and magnetism. Students will be expected to do homework problems and additional problems at the end of each chapter to solidify the concepts that are taught in class. Students will also use mathematical equations and diagrams to explore these concepts and physical laws. For each chapter, there is an experiment that allows students to reinforce their understanding of physics laws in nature and to give them hands-on experiences. In addition, they will analyse the interrelationships between physics and technology, and consider the impact of technological applications of physics on society and the environment. Students who take this course should be comfortable using and rearranging simple algebraic equations.
AP World History:
The AP World History course is a college-level course designed to prepare the ambitious student for the AP Exam in World History. The primary purpose of the course is to develop a better understanding of the events, people, and places throughout history that caused our world to become what it is today. The curriculum of the course is both content and skill based. Students are expected to gain knowledge of significant historical facts and to apply the skills of an historian to the study of these facts. Among these skills are those of analyzing primary source documents, making comparisons between major societies, and determining the ways societies both change and stay the same. These skills require the student to be a critical and creative thinker. Additionally, students should be able to see the ways in which the “Five Themes of History” connect elements over all of world history.


This is a simulator for the HP-15C advanced scientific programmable calculator.
Click on the calculator image to open the calculator window.
The calculator is also avalable as a downloadable application for various platforms. The downloadable version is (usually) faster than the web version and supports clipboard copy and paste.
For other platforms, you can download the source code and build it yourself. The Qt version is portable to any platform which supports Qt.
This calculator application should be considered experimental and its results should not be used for anything important. In particular, there are situations where the numeric display is known to be totally wrong.
This web site and software is not associated with HP or is subsidiaries. HP and the HP logo are trademarks of HP.


Places I have Been
Add a place:
Country/City
Landmark
Date
Notes
Another Attraction
Add
Places:
Attractions:


Benchmark¶
Dataset¶
In this benchmark the local weather data in March 2015 gathered by all weather stations in the USA is parsed.
You can obtain the data QCLCD201503.zip
from:
The File size is 557 MB
and it has 4,496,262
lines.
Setup¶
Software¶
The Java Version used is 1.8.0_66
.
C:\Users\philipp>java -version
java version "1.8.0_66"
Java(TM) SE Runtime Environment (build 1.8.0_66-b18)
Java HotSpot(TM) 64-Bit Server VM (build 25.66-b18, mixed mode)
Hardware¶
- Intel (R) Core (TM) i5-3450
- Hitachi HDS721010CLA330 (1 TB Capacity, 32 MB Cache, 7200 RPM)
- 16 GB RAM
Measuring the Elapsed Time¶
Java 1.8 introduced new classes like LocalDate
, LocalDateTime
or Duration
to work with time. Combined with lambda functions we can
easily write a nice helper class MeasurementUtils
, that measures the elapsed time of a function.
You simply have to pass a description and an Action
into the MeasurementUtils.MeasureElapsedTime
method, and it will print out the elapsed time.
// Copyright (c) Philipp Wagner. All rights reserved.
// Licensed under the MIT license. See LICENSE file in the project root for full license information.
package de.bytefish.jtinycsvparser.utils;
import java.time.Duration;
import java.time.Instant;
public class MeasurementUtils {
/**
* Java 1.8 doesn't have a Consumer without parameters (why not?), so we
* are defining a FunctionalInterface with a nullary function.
*
* I call it Action, so I am consistent with .NET.
*/
@FunctionalInterface
public interface Action {
void invoke();
}
public static void MeasureElapsedTime(String description, Action action) {
Duration duration = MeasureElapsedTime(action);
System.out.println(String.format("[%s] %s", description, duration));
}
public static Duration MeasureElapsedTime(Action action) {
Instant start = Instant.now();
action.invoke();
Instant end = Instant.now();
return Duration.between(start, end);
}
}
Reading a File Sequentially¶
First we have to find out, if the CSV parsing is an I/O or CPU bound task. The lower bound of the CSV Parsing is obviously given by the time needed to read a text
file, the actual CSV parsing and mapping cannot be any faster. I am using Files.lines
, in order to consume a Stream<String>
with the data.
Benchmark Code¶
@Test
public void testReadFromFile_SequentialRead() {
MeasurementUtils.MeasureElapsedTime("LocalWeatherData_SequentialRead", () -> {
// Read the file. Make sure to wrap it in a try, so the file handle gets disposed properly:
try(Stream<String> stream = Files.lines(FileSystems.getDefault().getPath("C:\\Users\\philipp\\Downloads\\csv", "201503hourly.txt"), StandardCharsets.UTF_8)) {
List<String> result = stream
.collect(Collectors.toList()); // turn it into a List!
// Make sure we got the correct amount of lines in the file:
Assert.assertEquals(4496263, result.size());
} catch(IOException e) {
throw new RuntimeException(e);
}
});
}
Make sure to always close the Stream returned by Files.lines
, because it is not closed automatically!
Benchmark Result¶
[LocalWeatherData_SequentialRead] PT4.258S
Reading the CSV File takes approximately 4.3
seconds. So the entire mapping from CSV to objects cannot be faster, than 4.3
seconds.
Benchmarking JTinyCsvParser¶
In order to parse a CSV file into a strongly-typed object, you have to define the domain model in your application and a CsvMapping
for the class.
Domain Model¶
public class LocalWeatherData
{
private String WBAN;
private LocalDate Date;
private String SkyCondition;
public String getWBAN() {
return WBAN;
}
public void setWBAN(String WBAN) {
this.WBAN = WBAN;
}
public LocalDate getDate() {
return Date;
}
public void setDate(LocalDate date) {
Date = date;
}
public String getSkyCondition() {
return SkyCondition;
}
public void setSkyCondition(String skyCondition) {
SkyCondition = skyCondition;
}
}
CsvMapping¶
We only want to map the columns WBAN
(Column 0), Date
(Column 1) and SkyCondition
(Column 4) to the Domain Model, which is done by using the mapProperty
function.
public class LocalWeatherDataMapper extends CsvMapping<LocalWeatherData>
{
public LocalWeatherDataMapper(IObjectCreator creator)
{
super(creator);
mapProperty(0, String.class, LocalWeatherData::setWBAN);
mapProperty(1, LocalDate.class, LocalWeatherData::setDate, new LocalDateConverter(DateTimeFormatter.ofPattern("yyyyMMdd")));
mapProperty(4, String.class, LocalWeatherData::setSkyCondition);
}
}
Benchmarking JTinyCsvParser (Single Threaded)¶
Benchmark Code¶
@Test
public void testReadFromFile_LocalWeatherData_Sequential() {
// Not in parallel:
CsvParserOptions options = new CsvParserOptions(true, ",", false);
// The Mapping to employ:
LocalWeatherDataMapper mapping = new LocalWeatherDataMapper(() -> new LocalWeatherData());
// Construct the parser:
CsvParser<LocalWeatherData> parser = new CsvParser<>(options, mapping);
// Measure the Time using the MeasurementUtils:
MeasurementUtils.MeasureElapsedTime("LocalWeatherData_Sequential_Parse", () -> {
// Read the file. Make sure to wrap it in a try, so the file handle gets disposed properly:
try(Stream<CsvMappingResult<LocalWeatherData>> stream = parser.readFromFile(FileSystems.getDefault().getPath("C:\\Users\\philipp\\Downloads\\csv", "201503hourly.txt"), StandardCharsets.UTF_8)) {
List<CsvMappingResult<LocalWeatherData>> result = stream
.filter(e -> e.isValid())
.collect(Collectors.toList()); // turn it into a List!
Assert.assertEquals(4496262, result.size());
}
});
}
Benchmark Results¶
[LocalWeatherData_Sequential_Parse] PT19.252S
Parsing the entire file takes approximately 20 seconds. I think this is a reasonable speed for a Single Threaded run. A lot of stuff is going on in the parsing, especially Auto Boxing Values is a time-consuming task I guess. I didn’t profile the entire library, so I cannot tell exactely where one could squeeze out the last CPU cycles.
Benchmarking JTinyCsvParser (Parallel Streams, Without JDK Bugfix)¶
Java 1.8 introduced Parallel Streams to simplify parallel computing in applications.
You can basically we can turn every simple Stream into a Parallel Stream, by calling the parallel()
method on it. One weird thing is, that I don’t have any control over
the degree of parallelism at this point. By default the number of processors is used for the default ForkJoinPool
. But describing Parallel Streams in Java 1,.8 is out of scope
for this article.
Why using a Parallel Stream?¶
We have learnt, that the mapping to objects is largely CPU bound. It is a well-defined problem and by throwing some more cores at it, we should see a significantly improved performance.
Benchmark Code¶
In order to process the data in parallel, you have to set the parallel
parameter in the CsvParserOption
.
@Test
public void testReadFromFile_LocalWeatherData_Parallel() {
// See the third constructor argument. It sets the Parallel processing to true!
CsvParserOptions options = new CsvParserOptions(true, ",", true);
// The Mapping to employ:
LocalWeatherDataMapper mapping = new LocalWeatherDataMapper(() -> new LocalWeatherData());
// Construct the parser:
CsvParser<LocalWeatherData> parser = new CsvParser<>(options, mapping);
// Measure the Time using the MeasurementUtils:
MeasurementUtils.MeasureElapsedTime("LocalWeatherData_Parallel_Parse", () -> {
// Read the file. Make sure to wrap it in a try, so the file handle gets disposed properly:
try(Stream<CsvMappingResult<LocalWeatherData>> stream = parser.readFromFile(FileSystems.getDefault().getPath("C:\\Users\\philipp\\Downloads\\csv", "201503hourly.txt"), StandardCharsets.UTF_8)) {
List<CsvMappingResult<LocalWeatherData>> result = stream
.filter(e -> e.isValid())
.collect(Collectors.toList()); // turn it into a List!
Assert.assertEquals(4496262, result.size());
}
});
}
Benchmark Results (without JDK Bugfix)¶
The results are not satisfying! Although all cores are utilized during processing the file, it actually leads to a slow-down.
[LocalWeatherData_Parallel_Parse] PT26.232S
Why is that?
Well in order to parallelize a task Java has to split the problem into sub problems somehow. This is done by using a Spliterator
, which basically means “splittable Iterator”.
The Spliterator
has a method trySplit()
, that splits off a chunk of elements to be processed by the threads. I assume, that the estimation about the size of the data
is not known ahead and that’s why Java 1.8 initializes the estimated size with Long.MAX_VALUE
(unknown size).
We can find the confirmation for it, if we take a look into the OpenJDK Bugtracker titled:
Benchmarking JTinyCsvParser (Parallel Streams, With JDK Bugfix)¶
We have seen, that there is a bug in the Spliterator
for the Files.lines
method, but the OpenJDK Bug ticket JDK-8072773 also references a bug fix.
When I backport the bugfix mentioned in JDK-8072773 to Java 1.8 (which is very easy), then the file is split into correctly sized chunks. The file is then
parsed in 12
seconds.
[LocalWeatherData_Parallel_Parse] PT11.773S
But since the OpenJDK code is released under terms of the GPL v2 license, I cannot include the mentioned bugfix into JTinyCsvParser.


African bush elephants are the largest living terrestrial animals on earth. It is the largest of the three elephant species and can weigh up to 11 tons and live up to 70 years—longer than any other mammal except humans. African bush elephants are herbivores and need to eat about 350 pounds of vegetation daily.
Bulls(males) can reach a shoulder height of up to 3.96 m (13.0 ft) and up to 24 feet in length. Both sexes have tusks, which erupt when they are 1–3 years old and grow throughout life.
The African bush elephant is the largest and heaviest land animal on Earth. It weighs around 10.4 tonnes. On average, males are about 3.2 metres (10.5 ft) tall at the shoulder and 6 tonnes (6.6 short tons) in weight, while females are much smaller at about 2.6 metres (8.5 ft) tall at the shoulder and 3 tonnes (3.3 short tons) in weight.
The trunk is a strong appendage, with more than 40,000 muscles and tendons. Its sensitive tip ends in two finger-like projections, which can manipulate small objects. The trunk can lift objects of more than 400 pounds. Water is sucked up through the trunk and then blown into the mouth for a drink or onto the back as a cooling mist. The trunk is so strong that elephants can use it for lifting about 3% of their own body weight. They use it for smelling, touching, feeding, drinking, dusting, producing sounds, loading, defending and attacking.
Tusks, which are large modified incisors that grow throughout an elephant's lifetime, occur in both males and females and are used in fights and for marking, feeding, and digging. The tusks erupt when elephants are 1–3 years old and grow throughout life. They are composed of dentin and coated with a thin layer of cementum. Tusks of bulls grow faster than tusks of females. Mean weight of tusks at the age of 60 years is 109 kg (240 lb) in bulls, and 17.7 kg (39 lb) in cows. The dental formula of the African bush elephant develops six molars in each jaw quadrant that erupt at different ages and differ in size.
The core of elephant society is the family unit, which comprises several adult cows, their daughters of all ages and their sons of prepubertal(following early childhood and preceding adolescence) age. The family unit is led by a matriarch.
The African bush elephant is herbivorous. Its diet consists mainly of grasses, creepers and herbs, and in the dry season also of leaves and bark. To supplement their diet with minerals, they congregate at mineral-rich water-holes, termite mounds and mineral licks.
Spermatogenesis starts when bulls are about 15 years old. Females ovulate for the first time at the age of 11 years. African bush elephants mate during the rainy season. Gestation lasts 22 months. Intervals between birth has different estimate across different parks ranging from 2.9-5yrs on average.
Despite a ban on the international trade in ivory, African elephants are still being poached in large numbers. Their ivory tusks are the most sought after, but their meat and skin are also traded. The ivory is often carved into ornaments and jewellery – China is the biggest consumer market for such products.


Toggle navigation
Menu
Rick Rejeleene
About
Books
Poetry
Travel
Blog
Github
Resume
Robert Clive & Shah Alam
On 12 August 1765,
Shah Alam II and Robert Clive signed , "Treaty of Allahabad."
This gave the English East India company rights to collect taxes from Bengal, Bihar and Orissa.
Welcome
Graduate Student - University of Rhode Island - Active Leader - Aspiring Coach


Within the first billion years of Earth's history, life appeared in the oceans and began to affect Earth's atmosphere and surface, leading to the proliferation of anaerobic and, later, aerobic organisms. Some geological evidence indicates that life may have arisen as early as 4.1 billion years ago. Since then, the combination of Earth's distance from the Sun, physical properties and geological history have allowed life to evolve and thrive. In the history of life on Earth, biodiversity has gone through long periods of expansion, occasionally punctuated by mass extinctions. Over 99% of all species that ever lived on Earth are extinct. Estimates of the number of species on Earth today vary widely; most species have not been described. Almost 8 billion humans live on Earth and depend on its biosphere and natural resources for their survival.
Main article: Properties of water See also: Water data page and Water model Water. 2O is a polar inorganic compound that is at room temperature a tasteless and odorless liquid, nearly colorless with a hint of blue. This simplest hydrogen chalcogenide is by far the most studied chemical compound and is described as the "universal solvent" for its ability to dissolve many substances. This allows it to be the "solvent of life": indeed, water as found in nature almost always includes various dissolved substances, and special steps are required to obtain chemically pure water. Water is the only common substance to exist as a solid, liquid, and gas in normal terrestrial conditions.
Earth's axis of rotation is tilted with respect to its orbital plane, producing seasons on Earth. The gravitational interaction between Earth and the Moon causes tides, stabilizes Earth's orientation on its axis, and gradually slows its rotation. Earth is the densest planet in the Solar System and the largest and most massive of the four rocky planets. Earth's atmosphere consists mostly of nitrogen and oxygen. More solar energy is received by tropical regions than polar regions and is redistributed by atmospheric and ocean circulation. Greenhouse gases also play an important role in regulating the surface temperature. A region's climate is not only determined by latitude, but also by elevation and proximity to moderating oceans, among other factors. Severe weather, such as tropical cyclones, thunderstorms, and heatwaves, occurs in most areas and greatly impacts life.
Earth's outer layer (lithosphere) is divided into several rigid tectonic plates that migrate across the surface over many millions of years. About 29% of Earth's surface is land consisting of continents and islands. The remaining 71% is covered with water, mostly by oceans but also lakes, rivers and other fresh water, which all together constitute the hydrosphere. The majority of Earth's polar regions are covered in ice, including the Antarctic ice sheet and the sea ice of the Arctic ice pack. Earth's interior remains active with a solid iron inner core, a liquid outer core that generates Earth's magnetic field, and a convecting mantle that drives plate tectonics. Earth is the third planet from the Sun and the only astronomical object known to harbor and support life. About 29.2% of Earth's surface is land consisting of continents and islands. The remaining 70.8% is covered with water, mostly by oceans, seas, gulfs, and other salt-water bodies, but also by lakes, rivers, and other freshwater, which together constitute the hydrosphere. Much of Earth's polar regions are covered in ice. Earth's outer layer is divided into several rigid tectonic plates that migrate across the surface over many millions of years, while its interior remains active with a solid iron inner core, a liquid outer core that generates Earth's magnetic field, and a convective mantle that drives plate tectonics.
The modern English word Earth developed, via Middle English,[n 6] from an Old English noun most often spelled eorðe.[24] It has cognates in every Germanic language, and their ancestral root has been reconstructed as *erþō. In its earliest attestation, the word eorðe was already being used to translate the many senses of Latin terra and Greek γῆ gē: the ground,[n 7] its soil,[n 8] dry land,[n 9] the human world,[n 10] the surface of the world (including the sea),[n 11] and the globe itself.[n 12] As with Roman Terra/Tellūs and Greek Gaia, Earth may have been a personified goddess in Germanic paganism: late Norse mythology included Jörð ('Earth'), a giantess often given as the mother of Thor. Earth's gravity interacts with other objects in space, especially the Moon, which is Earth's only natural satellite. Earth orbits around the Sun in about 365.25 days. Earth's axis of rotation is tilted with respect to its orbital plane, producing seasons on Earth. The gravitational interaction between Earth and the Moon causes tides, stabilizes Earth's orientation on its axis, and gradually slows its rotation. Earth is the densest planet in the Solar System and the largest and most massive of the four rocky planets.
Historically, earth has been written in lowercase. From early Middle English, its definite sense as "the globe" was expressed as the earth. By Early Modern English, many nouns were capitalized, and the earth was also written the Earth, particularly when referenced along with other heavenly bodies. More recently, the name is sometimes simply given as Earth, by analogy with the names of the other planets, though earth and forms with the remain common.[24] House styles now vary: Oxford spelling recognizes the lowercase form as the most common, with the capitalized form an acceptable variant. Another convention capitalizes "Earth" when appearing as a name (e.g. "Earth's atmosphere") but writes it in lowercase when preceded by the (e.g. "the atmosphere of the earth"). It almost always appears in lowercase in colloquial expressions such as "what on earth are you doing. According to radiometric dating estimation and other evidence, Earth formed over 4.5 billion years ago. Within the first billion years of Earth's history, life appeared in the oceans and began to affect Earth's atmosphere and surface, leading to the proliferation of anaerobic and, later, aerobic organisms. Some geological evidence indicates that life may have arisen as early as 4.1 billion years ago.


About Leanheat
Leanheat provides a software solution that enables the space heating optimization of centrally heated multifamily residential buildings. This is done by installing wireless sensors to track temperature and humidity, and a connection to the central heating controller is established. The system collects data from apartments, heating system and weather in order to automatically create a thermodynamic model for the building. Then the space heating is optimized based on the parameters resulting a minimized simultaneous usage of heat and thus lowering the peak loads caused by it.
Business Objective
In Finland, from the big apartment buildings around one third is owned by the professional property owners and in that specific market the case company is already the market lead. The rest of the buildings are housing companies which means that reaching them as clients is strategically important in order to grow bigger in the market. Leanheat and district heating companies are forming partnerships because the system provides a way for the district heating companies to optimize their energy production. Moreover, consumer customers are becoming active in acquiring services which means that the energy companies should be more active in providing service business in order to engage better with their customers.
Goal
Selling services for housing companies requires resources and knowledge about how they operate and the reasons for their actions. On top of that, district heating companies are valuable since currently they have their existing customer relationships with housing companies because they provide them heat.
The goal of the study was to create new and better understanding about the purchase decision making process inside housing companies by exploring the background motivation for people to be in the board and what affects the decision making. Additionally, the goal was to design and develop a sales process guidance and guidelines on how to reach the potential market of the housing companies
The main research questions were
Design process
The research followed the design science research methodology and it was conducted as a service design project with the help of Lean Service Creation. I started the project by forming an understanding of the current state of the business. I took part in different meetings and conducted interviews with the board members of housing companies. Additionally, I designed support material for sales and iterated those based on feedback and interviews.
User research & data gathering: To answer the first research question I interviewed board members of housing companies. I wanted to find out why they were part of the board, what things influence their decision making and how they make investment decisions. I decided to do semi-structured interviews in order to discover the real feelings and operations inside the board. In addition, I wanted to understand the current sales process by mapping customer journey together with energy company. Based on the insights I decided to focus my research on awareness, engagement and purchase phases because those were the biggest bottlenecks.
Prototyping: I designed new material to support the sales for consumer customers. I also took part in an open day event where I was able to test personal selling and provide support for the decision making. Lastly, I designed fake ads to test and find out which pricing model is thought as “easiest to buy” among housing companies. The test was conducted in a housing company fair where the ads were shown for board members and asked their feedback.
Result
Main insights gained from the interviews were that the purchase decision making is mainly affected by the motivation of the board, the deputy landlord’s role and board culture.
I identifed three different board cultures based on their goals and board members. Additionally, I also suggested improvments for the awarness, engagement and purchase phase. For example, the pricing model moved from investment based to service fee based model.
I made Leanheat's solution easily approachable by simplifying communication and designing new materials which were iterated throughout the process and taken into use in sales. Main change was that the value proposition for housing companies transformed from energy savings to offering stable indoor conditions.
Lastly I designed a flyer where I wrote the main insights learned from the research. The flyer can be shared for example to district heating companies.
Aftermath
I got confidence in conducting user research and learnt a lot about energy industry as well as limited liability housing company operations. I learned to apply service design methods in different situations. I gained experience in business design and saw how difficult it might be to facilitate customer centricity. I also became really interested in science behind decision making.


Translator: Fulin Li
Author:labuladong
There are a series of problems with Two Sum in LeetCode, and this article will pick out some representative problems to demonstrate how to resolve the Two Sum problems.
The most basic form of Two Sum problems is like this: Given an array of integers nums
, and a specific integer target
. Return indices of the two numbers such that they add up to target
. You may assume that each input would have exactly one solution.
For example, given nums = [3,1,3,6], target = 6
, the program should return an array [0,2]
because 3 + 3 = 6.
So, how to solve this problem? First, the simplest method, of course, is the exhaustive search.
int[] twoSum(int[] nums, int target) {
for (int i = 0; i < nums.length; i++)
for (int j = i + 1; j < nums.length; j++)
if (nums[j] == target - nums[i])
return new int[] { i, j };
// If no such two numbers exists
return new int[] {-1, -1};
}
This method is straightforward. The time complexity is O(n^2) and space complexity is O(1).
We can use a hash table to reduce the time complexity:
int[] twoSum(int[] nums, int target) {
int n = nums.length;
index<Integer, Integer> index = new HashMap<>();
// Constructing a hash table: Elements are mapped to their corresponding indices
for (int i = 0; i < n; i++)
index.put(nums[i], i);
for (int i = 0; i < n; i++) {
int other = target - nums[i];
// IF 'other' exists and it is not nums[i].
if (index.containsKey(other) && index.get(other) != i)
return new int[] {i, index.get(other)};
}
return new int[] {-1, -1};
}
In this way, because the query time of a hash table is O(1), the time complexity of the algorithm is reduced to O(N). However, the space complexity is increased to O(N) for storing the hash table. Generally, it is more efficient than the exhaustive search method.
I think the objective of the two sum problems is to tell us how to use the hash table. Let’s go on to the next.
We can modify the last script slightly to design a class with two functions:
class TwoSum {
// Add a 'number' to data structure
public void add(int number);
// Find out whether there exist two numbers and their sum is equal to 'value'.
public boolean find(int value);
}
So how to implement these two functions? We can follow the last problem and use a hash table to realize the ‘find’ function.
class TwoSum {
Map<Integer, Integer> freq = new HashMap<>();
public void add(int number) {
// Recording the number of times that number has occurred
freq.put(number, freq.getOrDefault(number, 0) + 1);
}
public boolean find(int value) {
for (Integer key : freq.keySet()) {
int other = value - key;
// Situation 1
if (other == key && freq.get(key) > 1)
return true;
// Situation 2
if (other != key && freq.containsKey(other))
return true;
}
return false;
}
}
When diving into find
function, there are two situations, for example:
Situation 1: After [3,3,2,5]
is inputted in add
function, find(6)
is executed. There are two 3
exists and 3 + 3 = 6, thus, it will return true.
Situation 2: After [3,3,2,5]
is inputted in add
function, find(7)
is executed. Only when key
is equal to 2 and other
is equal to 5, it will return true.
Except for the two situations mentioned above, find
function will only return false.
What’s the time complexity of this algorithm? The time complexity of add
function and find
function is O(1) and O(N) respectively. The space complexity is O(N), which is similar to the last problem.
However, we should take realities of the situation into account in API design. For example, in our class, the function find
is used very frequently, and each time it requires O(N) times. It is a massive waste of time. Can we optimize the algorithm given in this situation?
Of course, we can optimize the algorithm when find
function is used frequently. We can refer to the brute force method in the last problem and utilize a hash set to optimize find
function pertinently.
class TwoSum {
Set<Integer> sum = new HashSet<>();
List<Integer> nums = new ArrayList<>();
public void add(int number) {
// Recording all possible sum of two numbers
for (int n : nums)
sum.add(n + number);
nums.add(number);
}
public boolean find(int value) {
return sum.contains(value);
}
}
In this way, all possible sum of two numbers is stored in sum
. Every time find
function takes O(1) time to search whether the target exists in the collection. Obviously, it is very suitable for frequent use of find function.
For TwoSum problems, one of the difficulties is that the given array is unordered. For an unordered array, it seems that we don’t have any efficient methods, and an exhaustive search method may be the only way.
In ordinary circumstances, we will sort the unordered array first and then consider applying the dual-pointer method. TwoSum problems make us aware that HashMap or HashSet could help us to resolve unordered array problems.
Remarkably, the essence of such method is to trade time for space, using different data structures to improve the algorithm performance pertinently.
Finally, if the given array in TwoSum I is ordered, how do we design the algorithm? It’s very easy and you can refer to the previous article「Summary of usage of dual-pointer」:
int[] twoSum(int[] nums, int target) {
int left = 0, right = nums.length - 1;
while (left < right) {
int sum = nums[left] + nums[right];
if (sum == target) {
return new int[]{left, right};
} else if (sum < target) {
left++; // Make sum bigger
} else if (sum > target) {
right--; // Make sum smaller
}
}
// If no such two numbers exists
return new int[]{-1, -1};
}
Mission: Stick to original high-quality articles, and work hard to make algorithmic problems clear. Welcome to subscribe my Wechat public account ID:labuladong
for latest articles.


Match Play. Double Match Point. How should Red play 65?
pips Red=83 White=84
(CorrectAnswer= 0/0, ErrorScore= 0)
It would seem logical to play 18/7, not losing ground in the race but it does leave 28 shots.
Perhaps 8/2, 6/1 is better?
For money, 18/7 is correct because it wins many more gammons than 8/2, 6/1 but at DMP it turns out that 8/2, 6/1 is correct by a very small margin. Move White’s checker on the 14-pt to his mid-point and 18/7 is right by a long way.
A one-pip change makes a huge difference!
Perhaps 8/2, 6/1 is better?
For money, 18/7 is correct because it wins many more gammons than 8/2, 6/1 but at DMP it turns out that 8/2, 6/1 is correct by a very small margin. Move White’s checker on the 14-pt to his mid-point and 18/7 is right by a long way.
A one-pip change makes a huge difference!
1. Cubeful 2-ply 8/2 6/1 Eq.: -0.028 0.486 0.016 0.000 - 0.514 0.031 0.001 2. Cubeful 2-ply 18/7 Eq.: -0.058 (-0.030) 0.471 0.058 0.001 - 0.529 0.016 0.000 3. Cubeful 0-ply 18/13 8/2 Eq.: -0.299 (-0.271) 0.350 0.046 0.001 - 0.650 0.086 0.002


Page Editors, Administrators and SuperUsers can configure access to view, edit and manage module content by roles and/or usernames. In DNN Platform, module management permissions consist of only two settings: View and Edit. In Evoq Content and Evoq Content Enterprise, fine grain module management has seven permissions. In this section you will find an overview of the different module permissions available. For details on setting these permissions,
The following module permissions available in DNN Platform:
Module Permissions in DNN Platform


Checked/Enabled
Item 1
Item 2
Item 3
Checked/Disabled
Unchecked/Enabled
Unchecked/Disabled
Custom radio toggles by class
This message's visibility toggles by class with a radio above.


The Hitman's Bodyguard
The world's top protection agent (Ryan Reynolds) is called upon to guard the life of his mortal enemy...
SEE MOREThor: Ragnarok
Imprisoned on the other side of the universe, the mighty Thor (Chris Hemsworth) finds himself...
SEE MOREWonder Woman
Before she was Wonder Woman (Gal Gadot), she was Diana, princess of the Amazons, trained...
SEE MOREBlade Runner 2049
Thirty years after the events of the first film, a new blade runner, LAPD Officer K (Ryan Gosling), unearths...
SEE MORESpider-Man: Homecoming
Several months after the events of Captain America: Civil War, Peter Parker (Tom Holland), with the help...
SEE MORELogan Lucky
Trying to reverse a family curse, brothers Jimmy (Channing Tatum) and Clyde Logan (Adam Driver) set out...
SEE MOREWolf Warrior 2
China's deadliest special forces operative settles into a quiet life on the sea. When sadistic mercenaries...
SEE MOREUnlocked
After failing to apprehend the terrorist behind a Paris attack that claimed dozens of lives, CIA agent Alice...
SEE MORE


  %}
Please wait several minutes for our email. If you're still having trouble, you can contact us at: support@openhumans.org.


Baby, I love you more than .
Yeah, .
And you know how much i looove .
I mean do you remember last valentine's day.
When I made you pancakes? Damn those were delicious.
Or remember that time i turned one wall into a shrine
And when i started a cult and was making animal sacrifices and such?
Hey, I ain't apologizing - my love for is deep... and throbbing.
But baby, no mater how much i love .
and no matter how much i talk about how much i love .
I love
!
I want more
!
Babe, why
can't you be more like ?
I love you more.
“I Love You More Than” is a digital love card created by Ruben and Joel. Ruben loves his fiancé more than beer and Joel loves his girlfriend more than bacon. And trust us, that’s saying a lot. I mean have you tasted bacon? They have bacon that’s been smoked on applewood. And maple bacon. That’s the food of Gods. Seriously though, it’s amazing.


I am a Lambda School Student learning Web Development! My hobbies include fitness, cooking, and socializing.
I am a Web28 Full Stack Web Student. I love to play soccer and my passion are airplanes, airports and everything whats connected to aviation.


{{ _('To add a title to your message, use the number sign (#) followed by a space. To add a subtitle, use two number signs (##) followed by a space. For example:') }}
# {{ _('This is a title') }}
## {{ _('This is a subtitle') }}
{{ _('This is plain paragraph text') }}
{{ _('This is plain paragraph text') }}
{{ _('To add bold, use two asterisks (**) on each side of your text. To add italic, use underscores (_) on each side of your text. For example:') }}
{{ _('This is a paragraph with **bold** and _italic_.') }}
{{ _('This is a paragraph with bold and italic.') }}
{{ _('To separate the message into sections, use three underscores') }} (___) {{ _('to create a horizontal line. For example:') }}
{{ _('Section 1') }}
___
{{ _('Section 2') }}
{{ _('Section 1') }}
{{ _('Section 2') }}
{{ _('To add bullet points, use asterisks (*) followed by a space. Bullet points help recipients identify important information quickly. For example:') }}
* {{ _('point 1') }}
* {{ _('point 2') }}
* {{ _('point 3') }}
{{ _('To add a vertical grey bar to the side of text, use a caret (^) followed by a space in front of the text. For example:') }}
^ {{ _('Text') }}
{{ _('Text') }}


College GameDay Announces It’s Headed To Columbus For Ohio State vs. Penn State
by Matt LombardiNext Saturday, Penn State and Ohio State will meet in one of the biggest games of the 2019 college football season. ESPN College GameDay will be in town for the affair.
ESPN announced the news Saturday night. The show was in Waco, Texas for this week’s showdown between Baylor and Oklahoma.
Ohio State boasts a 10-0 record and is currently the No. 2 team in the College Football Playoff rankings. Penn State, after a close win over Indiana, is 9-1 and No. 9 in the rankings.
An Ohio State win would secure the Big Ten East title for the Buckeyes. A Penn State victory would give the Nittany Lions the tiebreaker – assuming they can also take care of business against Rutgers.
Both teams still likely control their own destiny when it comes to the College Football Playoff.
Ohio State, at this point, likely needs to finish the season undefeated to be part of the mix. Penn State lost to Minnesota last week, but a 12-1 record with a Big Ten title and a win over Ohio State would be hard to ignore.
Next week’s game is scheduled to start at Noon ET.


[1]
Good picture; Too much aspect distortion.
[2]
Brilliant, colorful display; Stuck Pixel
[3]
WARRANY STINKS; Customer services is HORRIBLE.


My Warranty
Options
Add
Category
Back
Add
Settings
Show Expiry:
Off
On
Alert:
Off
On
Cancel
Save
New Category
Cancel
Add
New Product
Expiry Alert:
No
Yes
Cancel
Add
Cancel
Update
Add Documents
ALL
DELETE
Loading...


node-red-contrib-bacnet
Building Automation and Control Networks Protocol toolbox for Node-RED.
!!!
Support for the project straight away!
- based on bacstack library v0.0.x
Install
Run command on Node-RED installation directory.
npm install node-red-contrib-bacnet
or run command for global installation.
npm install -g node-red-contrib-bacnet
try these options on npm install to build, if you have problems to install
--unsafe-perm --build-from-source
Contributing
Let's work together! Please read and in best case accept CONTRIBUTING by your sign and send it via E-Mail. You could also send just a pull request.
License
The MIT License
Important
This is not an official product of the BACnet Advocacy Group. It is just to provide BACnet to Node-RED based on node-bacstack package. BACnet® is a registered trademark of American Society of Heating, Refrigerating and Air-Conditioning Engineers (ASHRAE).
Contribution BACnet
I'd like to give special thanks to Fabio Huser for the BACnet node-bacstack package!


cars
planes
trains
automobiles
planes
boeing
airbus
trains
ghan
orient express
tvg
bikes
Kawasaki
Yamaha
Honda
Suzuki
Harly Davidson


You can get the the latest version from the official Wordpress Plugin Directory.
After installing and activating it as any other Wordpress plugin, it is also necessary to connect the plugin with Finch. This is done by registering your Finch project's API credentials in the plugin settings view.
The API credentials is a pair that consist of an API key and an API secret. Both of these can be found under the project options dropdown.
Finding your API credentials
Don't tell your API credentials to anyone!
Copy and paste your API credentials to their respective fields in Settings -> Finch screen in the Wordpress Dashboard.
If there's a problem, recheck the credentials you've provided. If problems still persist, feel free to contact us!


Vendors
Products
Shopping
Cart
Name
Email
Login
Products in Cart:
Name
Price
Quantity
Vendor Name
Options


[gecode-users] Variable base implementation question
Gustavo Gutierrez
gutierrez.gustavo at uclouvain.be
Tue Jan 6 17:01:04 CET 2009
Hello all,
I have a question regarding the specification for variable base
implementation in gecode. As far as i can see, there is some code in the
gecode kernel which is automatically generated from *.vis files.
Modification events and propagation conditions are defined in this kind of
files. I am implementing a new variable type and i want to be sure i am
doing it in the right way, so here is my question:
- There are some special words to define modification events: FAILED, NONE,
ASSIGNED and SUBSCRIBE. I am fine with the first three of them because it is
straight forward what they mean. However the fourth one is not clear to me.
According with the documentation (int.vis) SUBSCRIBE is used the first time
a propagator subscription is processed. Does it means that after the first
execution of the propagator, it will subscribe using the propagation
conditions specified in its class definition?. In my particular case, i
have only 3 modification events apart from the generic ones: lower bound
modification, upper bound modification and both bounds modification events.
I defined the last one (called ME_GRAPH_BB in my implementation) to be the
one equal to the word SUBSCRIBE.
For this case, if a propagator P subscribes to the propagation condition
PC_GRAPH_GLB (i.e. class SomeProp : public UnaryProp<View,PC_GRAPH_GLB>
...), what is the effect of ME_GRAPH_BB=SUBSCRIBE with respect to other
possible definition such as ME_GRAPH_GLB=SUBSCRIBE?
thanks in advance,
Gustavo.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.ps.uni-sb.de/pipermail/users/attachments/20090106/784e69c7/attachment.htm>
More information about the gecode-users
mailing list


Maria's favorite things...
Your favorites...
Add to your favorites
Favorite foods?
Animals you love?
Other favorites?
Enter your favorites...


Sneakers, running shoes, shoes...
{{ shoepairs.length }}
Existing shoes (delete by checking an item)
{{ shoepair.name }}, in use since {{shoepair.acquisitionDate}}, {{shoepair.kilometresRun}} km
Add a new pair of shoes
Add shoepair
Existing users (delete by checking an item)
{{ user.username }}
Add a new user
Add user


| DOSE: T+ 0:00 |
45 mg |
oral |
AMT |
(capsule) |
| T+ 1:30 |
1 bowl |
smoked |
Cannabis |
|
It was monday afternoon and I had just picked up my package of AMT from the mailroom. The week prior was spent reading stories and doing research on this substance.  (I will also mention here that the AMT I purchased was rated at 99.8% purity, and the strong smell usually associated with this substance was nearly non-existant.
Later that nite I met up with some of my friends (who had never heard of the substance before) and inquired if they would like to trip. At 9:00pm, I ingested one of the 45mg doses and let the other 3 people choose which dose they would like to take. After about 20 minutes I noticed the beginnings of some nausea. 35 minutes after ingestion, I was sweating profusely and decided to go throw up in the bathroom in hopes of relieving the nausea. After throwing up for 5 minutes, the nausea subsided rather quickly and I returned to the group. The other three who had taken the AMT mentioned a slight feeling of nausea, but none of them threw up.
1.5 hours after ingestion we all decided to go outside and smoke a fat cone of some cannabis that we had purchased earlier in the day. 3.5 grams were smoked between 5 people and we were all feeling high by the time we finished. Around the 2 hour mark I started getting the urge to smile and express feelings of warmth. Our group went and sat in the lounge on our floor and munched out on food that we had purchased at the nearby vending machines. At 2.5 hours everyone had completely stopped talking about AMT and we were all very talkative. It was at this time that we all started mentioning how weird we were feeling. All at once we all started spitting out adjectives to describe our current state: 'warm', 'happy', 'buzzing', and 'insane clarity' were the typical comments.
At 3.5 hours we were all sinking deep into the peak. The mind blowing aspect of this drug was the indescribable clarity of my mind. There was no mind fuck, no depression, and no paranoia whatsoever. Also, everyone was acting very level-headed: everyone was in control of themselves and there was no feeling of being an e-tard. Around 2am (t+5 hours), we got our friend B to drive us around the city so we could enjoy our buzz on the road. As for the visuals, there were definitely visual anomalies but only when I specifically looked for them. All bright objects seemed to be colorful and have an electric glow to them (similar to a low-dose of LSD). At this point the four of us who were tripping were talking non-stop and were communicating with an indescribable happiness among one another. We ended up rambling on to our friend B for the next 3 hours about how good we felt and how everyone in the world should be able to try this divine substance.
The rest of the night was spent watching television and talking to one another. The come down was surpisingly smooth and the happiness lasted well into the day. I went to sleep at 10:30am (t+25.5) and woke up at 7pm feeling slightly tired.
Overall, this was hands-down the best drug I have ever experienced in my life. The best part of this drug is the clarity of my mind: imagine LSD combined with MDMA without the mind-fuck and feeling of stupidity. This drug also produced a feeling of immense satisfaction during and after the peak.
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.


ic-request
|
This will always be true for intercooler requests.
|
_method
|
Because not all browsers support PUT and DELETE requests
in AJAX, intercooler uses the Rails convention and adds a _method parameter to the request
whose
value will be the HTTP Method type (e.g. DELETE ).
|
ic-element-id
|
The HTML id of the element that caused the request, that is the element that has the ic-post-to
or similar attribute on it.
|
ic-element-name
|
The HTML name of the element that caused the request, that is the element that has the ic-post-to
or similar attribute on it.
|
ic-target-id
|
The ID of the target element of the request. This can be used to figure out which bit of partial HTML to
render, if a given URL is used to target different areas depending on the context.
|
ic-trigger-id
|
The ID of the target that initially triggered the request. This can be different than the element that
caused the request: it could be a child element.
|
ic-element-name
|
The HTML name of the target that initially triggered the request. This can be different than the element that
caused the request: it could be a child element.
|
ic-current-url
|
The current URL of the page.
|
ic-prompt-value
|
The user input from the javascript prompt if the ic-prompt
attribute is used
|


Test for jQuery Functions
The Oatmeal (Opens to same tab)
Hyperbole and a Half (Opens to new tab)
XKCD (Opens to same tab)
Dinosaur Comics (Opens to new tab)


You have to dream before your dreams can come true.
var fs = require("fs"); var data = ''; // Create a readable stream var readerStream = fs.createReadStream('input.txt'); // Set the encoding to be utf8. readerStream.setEncoding('UTF8'); // Handle stream events --> data, end, and error readerStream.on('data', function(chunk) { data += chunk; }); readerStream.on('end',function(){ console.log(data); }); readerStream.on('error', function(err){ console.log(err.stack); }); console.log("Program Ended");
$ node main.js
Program Ended You have to dream before your dreams can come true.
var fs = require("fs"); var data = 'Simply Easy Learning'; // Create a writable stream var writerStream = fs.createWriteStream('output.txt'); // Write the data to stream with encoding to be utf8 writerStream.write(data,'UTF8'); // Mark the end of file writerStream.end(); // Handle stream events --> finish, and error writerStream.on('finish', function() { console.log("Write completed."); }); writerStream.on('error', function(err){ console.log(err.stack); }); console.log("Program Ended");
$ node main.js
Program Ended Write completed.
Simply Easy Learning
var fs = require("fs"); // Create a readable stream var readerStream = fs.createReadStream('input.txt'); // Create a writable stream var writerStream = fs.createWriteStream('output.txt'); // Pipe the read and write operations // read input.txt and write data to output.txt readerStream.pipe(writerStream); console.log("Program Ended");
$ node main.js
Program Ended
You have to dream before your dreams can come true.
var fs = require("fs"); var zlib = require('zlib'); // Compress the file input.txt to input.txt.gz fs.createReadStream('input.txt') .pipe(zlib.createGzip()) .pipe(fs.createWriteStream('input.txt.gz')); console.log("File Compressed.");
$ node main.js
File Compressed.
var fs = require("fs"); var zlib = require('zlib'); // Decompress the file input.txt.gz to input.txt fs.createReadStream('input.txt.gz') .pipe(zlib.createGunzip()) .pipe(fs.createWriteStream('input.txt')); console.log("File Decompressed.");
$ node main.js
File Decompressed.


ID:
Medicine Name:
Medicine Details:
Medicine manufacturing Date:
Expiry Date:
Medicine Category:
Quantity:


---
layout: page
title: About Us
description: The Honeynet Project - R&D for Honeypot/Honeynet Technology and InfoSec Research
background: '/img/banner.jpg'
---
Founded in 1999, The Honeynet Project is an international, non-profit (501c3) research organization dedicated to improving the security of the Internet at no cost to the public.
Our achievements are based on the principles of open source and volunteer efforts, with all software or papers created being licensed as open source and made freely available to the community.
We help coordinate the development, deployment, advancement and analyze the findings of honeypot and anti-malware related technologies. With over 45 international chapters, 350 members and 30 open source research projects around around the world, we are a mature, highly diverse and international organization.
Simply put, our goal is to make a difference. We accomplish this via:
- Awareness - We raise awareness of the threats and vulnerabilities that exist in the Internet today. Many individuals & organizations do not realize they are a target, nor understand who is attacking them, how, or why. We provide this information, so people can better understand that they are a target, and understand the basic measures they can take to mitigate these threats. This is provided through our Know Your Enemy series of papers.
- Tools - For organizations interested in continuing their own research about cyber threats, we provide the tools and techniques we have developed. All tools are specifically licensed open source. Organizations all over the world use our tools.
- Information - In addition to raising awareness, we provide details to better secure assets. Historically, information about attackers has been limited to the tools they use. We provide critical additional intelligence, such as their motives in attacking, how they communicate, when they attack systems and their actions after compromising a system. We provide this service through our Know Your Enemy whitepapers and our periodic Scan of the Month challenges.
The Honeynet Project uses GSoC as a incubator for new R&D projects, and to recruit active new members.


---
layout: post
title: Compile Java Files At Runtime
date: '2012-03-18T14:30:00.002-07:00'
author: Babji Prashanth, Chetty
categories:
- java
tags:
- compile java source files at runtime
- dynamic compilation
- jsr 199
- javax.tools package
- java 6 compiler api
modified_time: '2013-06-03T09:54:43.352-07:00'
blogger_id: tag:blogger.com,1999:blog-290045043624227719.post-7186146868790600183
blogger_orig_url: http://java-bytes.blogspot.com/2012/03/compile-java-files-at-runtime.html
---
Java 6 has a new Compiler API, as a result of JSR 199, which requests for a standard way to compile java source files. Although I use a lot of Java, I don't get to use some of the Java API's, as they are not required for the business functionality that I usually code. So, I was looking around for some new ideas or code to try and thought of working on a simple Java IDE and got to work on JavaCompiler class from javax.tools package of Java 6. Here's a naive example, that shows how to compile a Java source file at runtime:


ZwWdP vom 28.12.2010
|
Zeit |
Interpret |
Titel |
|
20 Uhr |
Madness |
NW5 |
|
|
The Coral |
More Than A Lover |
|
|
Tracey Thorn |
Why Does The Wind |
|
|
The Autumn Defense |
Back Of My Mind |
|
|
Fitz & The Tantrums |
Breakin' The Chains Of Love |
|
|
Twin Shadow |
Yellow Balloon |
|
|
Colorama |
Etiquette |
|
|
Carl Barat |
So Long, My Lover |
|
|
Rumer |
Am I Forgiven |
|
|
Seeland |
Cardinal |
|
|
Ben Folds |
Password |
|
|
The Soundcarriers |
Last Broadcast |
|
|
Paul Weller |
No Tears To Cry (Leo Zero Remix) |
|
21 Uhr |
Erdmöbel |
Erster Erster |
|
|
Danger Mouse & Sparklehorse & The Flaming Lips |
Revenge |
|
|
The Silver Seas |
Jane |
|
|
The Bird & The Bee |
Kiss On My List |
|
|
The Clientele |
As The World Rises And Falls |
|
|
Fyfe Dangerfield |
So Brand New |
|
|
Ocean Colour Scene |
Twenty One |
|
|
Le Futur Pompiste |
Five Hundred Heartbeats |
|
|
Treefight For Sunlight |
What Became Of You And I |
|
|
Divine Comedy |
I Like |
|
|
Daniel Carlson |
Velvet |
|
|
Alb |
Safeguard |
|
|
The Superimposers |
Tumbledown |
|
|
Paul Weller |
In Amsterdam |
|
22 Uhr |
Brian Wilson |
The Like In I Love You |
|
|
Seahawks |
Oh Baby |
|
|
The Ocean Tango |
The Ocean Tango |
|
|
Engineers |
What It's Worth |
|
|
Element Of Crime |
You Only Tell Me You Love Me When You're Drunk |
|
|
Katie Melua |
No Fear Of Heights |
|
|
Nouvelle Vague |
Amoureux Solitaires |
|
|
Fyfe Dangerfield |
Barricades |
|
|
Bart Davenport |
Wonder People |
|
|
The Brigadier |
The Insomnia (Man From Another Place Remix) |
|
|
Midlake |
Acts Of Man |
|
|
The Bees |
Skill Of The Man |
|
|
Alpha |
Alpha Christmas |
|
|
Symfonieorkestern |
Reprise |


This is the short story of my first experience with Salvia 10x powder.
A little background:
My first experience with a psychadelic, acid, ended badly. The first two hours were good, but then the girl I was 'dating' at the time starting making out with somebody else. I was 15 then, I'm 23 now. Every time after that, I hoped for the trippy fun of the first two hours, but it never came, and on turn five I gave up.
I don't smoke weed anymore, either, for a simuliar reason.
I'm agnostic, so in the below report, I'm going to avoid pinpointing any of the semi/pseudo mystical implifications of the trip.
This is the tale of my first experience with 'Lady Salvia,' and she welcomed me with open arms.
Now, I didn't know exactly how much I should smoke, but I decided to err on the side of caution. In retrospect, I should have done it the other way around, but that's a story that I'll write another day.
Bowl Number One
I used a small pinch for the first hit, mixed with some Tobacco. Now, this is a bong. My thought was that I'd use the Tobacco to buffer the Salvia so that it wouldn't fall straight down into the chamber. It didn't work too well, and the Tobacco made me cough. By the way, I smoke 20-30 cigarettes a day. Go figure.
Bowl Number Two
So, I went against my principles and put a screen into the bong. I loaded the bowl with the Salvia 10x so that it was about even with the top of the bowl, tightly packed. Lighter in hand, I inhaled. It was smooth.
So, so smooth. Not harsh at all.
I held it in for 25-30 seconds, it's hard to remember exactly when the numbers went away and the trip showed up. You see, my mouth was open. It felt like my jaw had become disjointed, rendering my mouth stuck open -- or more like this: for a few moments, I had no body, and when I came back to it, there needed to be an explanation. The only logical conclusion for this, of course, was that there was a GIANT CROUTON in my mouth, and I started laughing hysterically at the thought. But it was a calm hysteria, which is of course totally contradictory, but it just was...
Nothing spectacular happened. Just some great, calm, but somehow hysterical laughter. Nothing was scary or weird -- it was just great fun, which is weird in retrospect, because most people say that this isn't a 'fun' drug.
After the crouton wore off, it seemed like the trip was pretty much over. It lasted maybe five minutes, and after that I just felt euphoric. I wanted bigger, and better. And more than that, I felt as though something was inviting me to join the party.
Bowl Number Three/Four 12:10 AM
This time, I packed it even tighter, lit it for longer, and held it for longer. Repeat once. Two hits, about 2 minutes apart.
My eyes stayed closed. In the background, Orbital's Snivlization was playing, and I could see the music coming in from behind me, swirling into a vortex of vibrating colors and rolling down a drain that resembled a tie-dyed black hole. When the drain filled, the music kept flowing in, still rotating, and it slowly spun out into a disc of gas and stars. It slowly became a galaxy; speeding away from me. And it was beautiful.
The stream of music was still coming in from behind my closed eyes. It split down the center and flew off into forever in both directions, it merged in the center, and became a fence.  They invited me to come with them, but for some reason or another, I couldn't follow. With that, the whole scene sunk off into the distance, speeding away from me until it was finally gone. There was no sense of rejection, just a sort of ... disappointment. Not in myself, or in anything tangible. 'Maybe next time,' I thought to myself.
And then the music started flowing from behind my eyes again, and again it went off into two directions of infinity. It split along the vertical axis, and then came together like a zipper without the teeth.
The whole thing was serene and beautiful, and I knew that it was over.
I opened my eyes, and it looked like the area infront of me was a crashing ocean -- as if reality was suddenly being splashed back upon me. The effect didn't last, and suddenly I was back.
I still felt euphoric, but I wasn't tripping.
12:30ish AM
All in all, it was a very positive experience and I'm looking forward to doing it again. I've only got one question: Is this as powerful as it gets? I've read other trip reports where people who have done as much as I did (I think), and their experiences are much more intense.
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.


|
OR-Tools
7.1
Google Optimization software suite
|
#include <max_flow.h>
Public Types | |
| typedef Graph::NodeIndex | NodeIndex |
| typedef Graph::ArcIndex | ArcIndex |
| typedef Graph::OutgoingArcIterator | OutgoingArcIterator |
| typedef Graph::OutgoingOrOppositeIncomingArcIterator | OutgoingOrOppositeIncomingArcIterator |
| typedef Graph::IncomingArcIterator | IncomingArcIterator |
| typedef ZVector< ArcIndex > | ArcIndexArray |
| typedef NodeIndex | NodeHeight |
| typedef ZVector< NodeHeight > | NodeHeightArray |
| Public Types inherited from operations_research::MaxFlowStatusClass | |
| enum | Status { NOT_SOLVED, OPTIMAL, INT_OVERFLOW, BAD_INPUT, BAD_RESULT } |
Public Member Functions | |
| GenericMaxFlow (const Graph *graph, NodeIndex source, NodeIndex sink) | |
| virtual | ~GenericMaxFlow () |
| const Graph * | graph () const |
| Status | status () const |
| NodeIndex | GetSourceNodeIndex () const |
| NodeIndex | GetSinkNodeIndex () const |
| void | SetArcCapacity (ArcIndex arc, FlowQuantity new_capacity) |
| void | SetArcFlow (ArcIndex arc, FlowQuantity new_flow) |
| bool | Solve () |
| FlowQuantity | GetOptimalFlow () const |
| FlowQuantity | Flow (ArcIndex arc) const |
| FlowQuantity | Capacity (ArcIndex arc) const |
| void | GetSourceSideMinCut (std::vector< NodeIndex > *result) |
| void | GetSinkSideMinCut (std::vector< NodeIndex > *result) |
| bool | CheckInputConsistency () const |
| bool | CheckResult () const |
| bool | AugmentingPathExists () const |
| void | SetUseGlobalUpdate (bool value) |
| void | SetUseTwoPhaseAlgorithm (bool value) |
| void | SetCheckInput (bool value) |
| void | SetCheckResult (bool value) |
| void | ProcessNodeByHeight (bool value) |
| FlowModel | CreateFlowModel () |
Protected Attributes | |
| const Graph * | graph_ |
| QuantityArray | node_excess_ |
| NodeHeightArray | node_potential_ |
| QuantityArray | residual_arc_capacity_ |
| ArcIndexArray | first_admissible_arc_ |
| std::vector< NodeIndex > | active_nodes_ |
| PriorityQueueWithRestrictedPush< NodeIndex, NodeHeight > | active_node_by_height_ |
| NodeIndex | source_ |
| NodeIndex | sink_ |
| Status | status_ |
| std::vector< bool > | node_in_bfs_queue_ |
| std::vector< NodeIndex > | bfs_queue_ |
| bool | use_global_update_ |
| bool | use_two_phase_algorithm_ |
| bool | process_node_by_height_ |
| bool | check_input_ |
| bool | check_result_ |
| StatsGroup | stats_ |
Static Protected Attributes | |
| static const FlowQuantity | kMaxFlowQuantity |
Definition at line 144 of file max_flow.h.
| typedef Graph::NodeIndex operations_research::GenericMaxFlow< Graph >::NodeIndex |
Definition at line 317 of file max_flow.h.
| typedef Graph::ArcIndex operations_research::GenericMaxFlow< Graph >::ArcIndex |
Definition at line 318 of file max_flow.h.
| typedef Graph::OutgoingArcIterator operations_research::GenericMaxFlow< Graph >::OutgoingArcIterator |
Definition at line 319 of file max_flow.h.
| typedef Graph::OutgoingOrOppositeIncomingArcIterator operations_research::GenericMaxFlow< Graph >::OutgoingOrOppositeIncomingArcIterator |
Definition at line 321 of file max_flow.h.
| typedef Graph::IncomingArcIterator operations_research::GenericMaxFlow< Graph >::IncomingArcIterator |
Definition at line 322 of file max_flow.h.
| typedef ZVector<ArcIndex> operations_research::GenericMaxFlow< Graph >::ArcIndexArray |
Definition at line 323 of file max_flow.h.
| typedef NodeIndex operations_research::GenericMaxFlow< Graph >::NodeHeight |
Definition at line 327 of file max_flow.h.
| typedef ZVector<NodeHeight> operations_research::GenericMaxFlow< Graph >::NodeHeightArray |
Definition at line 328 of file max_flow.h.
| operations_research::GenericMaxFlow< Graph >::GenericMaxFlow | ( | const Graph * | graph, |
| NodeIndex | source, | ||
| NodeIndex | sink | ||
| ) |
|
inlinevirtual |
Definition at line 335 of file max_flow.h.
|
inline |
Definition at line 338 of file max_flow.h.
|
inline |
Definition at line 343 of file max_flow.h.
|
inline |
Definition at line 346 of file max_flow.h.
|
inline |
Definition at line 349 of file max_flow.h.
| void operations_research::GenericMaxFlow< Graph >::SetArcCapacity | ( | ArcIndex | arc, |
| FlowQuantity | new_capacity | ||
| ) |
| void operations_research::GenericMaxFlow< Graph >::SetArcFlow | ( | ArcIndex | arc, |
| FlowQuantity | new_flow | ||
| ) |
| bool operations_research::GenericMaxFlow< Graph >::Solve | ( | ) |
|
inline |
Definition at line 361 of file max_flow.h.
|
inline |
Definition at line 365 of file max_flow.h.
|
inline |
Definition at line 375 of file max_flow.h.
| void operations_research::GenericMaxFlow< Graph >::GetSourceSideMinCut | ( | std::vector< NodeIndex > * | result | ) |
| void operations_research::GenericMaxFlow< Graph >::GetSinkSideMinCut | ( | std::vector< NodeIndex > * | result | ) |
| bool operations_research::GenericMaxFlow< Graph >::CheckInputConsistency | ( | ) | const |
| bool operations_research::GenericMaxFlow< Graph >::CheckResult | ( | ) | const |
| bool operations_research::GenericMaxFlow< Graph >::AugmentingPathExists | ( | ) | const |
|
inline |
Definition at line 414 of file max_flow.h.
|
inline |
Definition at line 418 of file max_flow.h.
|
inline |
Definition at line 419 of file max_flow.h.
|
inline |
Definition at line 420 of file max_flow.h.
|
inline |
Definition at line 421 of file max_flow.h.
| FlowModel operations_research::GenericMaxFlow< Graph >::CreateFlowModel | ( | ) |
|
inlineprotected |
Definition at line 430 of file max_flow.h.
|
inlineprotected |
Definition at line 437 of file max_flow.h.
|
inlineprotected |
Definition at line 442 of file max_flow.h.
|
protected |
|
protected |
|
protected |
|
inlineprotected |
Definition at line 460 of file max_flow.h.
|
inlineprotected |
Definition at line 468 of file max_flow.h.
|
inlineprotected |
Definition at line 477 of file max_flow.h.
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
inlineprotected |
Definition at line 532 of file max_flow.h.
|
inlineprotected |
Definition at line 533 of file max_flow.h.
|
protected |
|
protected |
|
protected |
|
protected |
|
staticprotected |
Definition at line 544 of file max_flow.h.
|
protected |
Definition at line 547 of file max_flow.h.
|
protected |
Definition at line 550 of file max_flow.h.
|
protected |
Definition at line 563 of file max_flow.h.
|
protected |
Definition at line 581 of file max_flow.h.
|
protected |
Definition at line 584 of file max_flow.h.
|
protected |
Definition at line 590 of file max_flow.h.
|
protected |
Definition at line 597 of file max_flow.h.
|
protected |
Definition at line 600 of file max_flow.h.
|
protected |
Definition at line 603 of file max_flow.h.
|
protected |
Definition at line 606 of file max_flow.h.
|
protected |
Definition at line 610 of file max_flow.h.
|
protected |
Definition at line 611 of file max_flow.h.
|
protected |
Definition at line 614 of file max_flow.h.
|
protected |
Definition at line 621 of file max_flow.h.
|
protected |
Definition at line 629 of file max_flow.h.
|
protected |
Definition at line 634 of file max_flow.h.
|
protected |
Definition at line 638 of file max_flow.h.
|
mutableprotected |
Definition at line 641 of file max_flow.h.


@NonExistentClass @NotNull fun readUnitLabel(@NotNull reader: NonExistentClass): NonExistentClass
Reads a single characteristic unit and label from the JsonObject and returns it
reader
- JsonReader to be consumed
Return
ArrayList of String containing unit and label of a currently parsed characteristic


Install #
Math.js can be installed via various package managers:
| Package Manager | Installation |
|---|---|
| npm | npm install mathjs |
| bower | bower install mathjs |
| component(1) | component install josdejong/mathjs |
When installed globally with npm (using the -g
option), math.js is available as a command line application mathjs
, see documentation on Command Line Interface.
Download #
Math.js can be downloaded or linked from cdnjs:
| Development (version 1.4.0) | 868 kB, uncompressed with comments |
| Production (version 1.4.0) | 63 kB, minified and gzipped |
Web Service #
Math.js is available as a RESTful web service: http://api.mathjs.org
History #
A changelog describing the changes with each release is available on the page History.
Source code #
The source code of math.js is available on GitHub: https://github.com/josdejong/mathjs.
License #
Math.js is open source and licensed under the Apache 2.0 License


Game Setup
Split into 2, 3 or 4 teams.
Assign one Word Master to
each team. Other are Agents.
Open Game Board on a tablet or phone and place it in the middle, visible to all.
Larger screen is better,
as all players will be clicking
on words to reveal colors.
If you are a Word Master, open the Chief Card on your phone.
Sync the Chief Card with current game by entering the 4-digit game ID found on Game Board.
Make sure Agents can't see this card!
First team starts the Round. Word Master looks at the Chief Card and tries to come up with a single word clue to hint words that belong to his/her team.
Word Master states a single word, plus number indicating how many cards the word relates to. Careful not to hint to words belonging to other teams!
For example, you can use the word "Fruit" to combine "Apple" and "Kiwi".
Agents discuss what they think their Word Master meant. Then, after making a collective decision, one of the agents clicks the words on the Game Board. Ideally, agents should open only the words of their own color. As soon as they make a wrong guess, the turn ends and the next team starts guessing.
The round ends when all Word Masters had a chance to hint words to their Agents. First team to have all its words revealed at the end of a round wins the game. You may have more than one winner.
When giving clues, Word Master can't say a word containing the same root as any word on the Game Board.


Generates boxplots summarizing results generated during mvp.analysis.
mvpPlot( object, which.data = "all", group.by = NULL, which.parameter = NULL, which.phantom = NULL, which.precision = "all", which.analysis = NULL, var2plot = "cv", which.assay = NULL, outliers = T, jitter.width = 0.1, color.option = "cividis", color.begin = 0, color.end = 1, point.size = 2, point.alpha = 1, box.alpha = 0.5, return.plt.handle = F, combine.plots = F, combine.ncols = 2, show.rms.statistic = F, show.legend.flag = T )
| object | Calibration Object. |
|---|---|
| which.data | Character specifying which dataset to plot svp analysis for. One of:
|
| group.by | Vector of features to stratify analysis by. If specified, rms-statistic is not overlaid on boxplot. |
| which.parameter | Character specifying which parameters to plot. If unspecified, all parameters are plotted. |
| which.phantom | Character specifying which phantoms to plot. If unspecified, all phantoms are plotted. |
| which.precision | Character specifying which precision errors to plot. One of:
|
| which.analysis | Character indicating which mvp.analysis to get results from. If unspecified, available analyses will be used. |
| var2plot | Character specifying which precision error metric to plot. One of:
|
| which.assay | Character specifying which assay to plot. |
| outliers | Logical specifying whether to omit outliers from analysis |
| jitter.width | Numerical specifying width of jitter in boxplot. Default is 0.1. |
| color.option | Character indicating which color map option to use (from viridis palette). One of:
|
| color.begin | Hue in [0,1] at which the viridis color map begins. Default is 0. |
| color.end | Hue in [0,1] at which the viridis color map ends. Default is 1. |
| point.size | Numeric specifying size of scatter plot points. |
| point.alpha | Numeric [0,1] specifying degree of transparency for points. Default is 1. |
| box.alpha | Numeric [0,1] specifying degree of transparency for box plots. Default is 0.5. |
| return.plt.handle | Logical indicating whether list of ggplot handle is returned. Default is false. |
| combine.plots | Logical indicating whether plots are combined. Default is false. |
| combine.ncols | Number of columns when combining plots (Only if combine.plot is true). Default is 2. |
| show.rms.statistic | Logical indicating to overlay RMS statistic (rms-std or rms-cv) on boxplots. Default is false. |
| show.legend.flag | Logical indicating to show legend |
list of ggplot objects (if return.plt.handle is true)


Ilene Gorski
eyelean7
Intro to Programming
Ping-Pong will count up to your number from 1 with the following exceptions:


Widget module.
MIT. See LICENSE for full details.
A label frame widget is a container used to group other widgets together. It has an optional label, which may be a plain text string or another widget.
auto labelFrame = new LabelFrame("Text") .pack(0, 10); // Add a button to the label frame. auto button = new Button(labelFrame, "Text") .pack();
Anchor
Height
Padding
Text
Underline
Width
<<Invoke>>, <<PrevWindow>>, <Alt-Key>, <Key-F10>, <Key-Tab>,
Construct the widget.
| UiElement parent | The parent of this widget. |
| string text | The text of the widget. |
Construct the widget.
| string text | The text of the widget. |
Set a widget to use for the label. The widget must be a child of the labelframe widget or one of the labelframe's ancestors, and must belong to the same top-level widget as the labelframe. If set, overrides the text parameter.
| Widget widget | The widget to use as the label. |
This widget to aid method chaining.
Specifies how text in the widget is positioned relative to the inner margins.
| string position | The position of the anchor. |
This widget to aid method chaining.


Second man admits trying to rob Arsenal’s Ozil and Kolasinac
LONDON, Nov 7 — A second man pleaded guilty yesterday to trying to rob Arsenal stars Mesut Ozil and Sead Kolasinac of their watches in a moped ambush.
Jordan Northover, 26, admitted trying to steal the expensive items from the Premier League footballers in northwest London on July 25, a court heard.
Ashley Smith has already pleaded guilty to his role in the attempted raid involving Ozil, 31, and Kolasinac, 26.
New CCTV footage released by the police shows Kolasinac standing beside his close friend Ozil’s gold-trimmed black Mercedes G class 4x4 before the two attackers pull up.
Despite being threatened with what appears to be a knife, the burly Bosnia defender remains unfazed.
The full-back, nicknamed the “Tank”, then chases off the pair, who were disguised by helmets and dark clothing.
German midfielder Ozil, remains in his vehicle with his wife Amine before speeding off and taking refuge in a Turkish restaurant after being pursued by the raiders.
Police said a key breakthrough came when a moped without number plates was spotted by a member of the public.
At a previous court hearing, the value of one of the watches was given as £200,000 (RM1.06 million).
Chief Inspector Jim Corbett said: “Northover and Smith attempted this brazen robbery after travelling around streets nearby, looking for people to rob.
“Northover didn’t hesitate to draw a weapon when making demands, but he didn’t bargain on being challenged and the pair went away empty-handed.”
World Cup winner Ozil and full-back Kolasinac were left out of Arsenal’s squad for their opening Premier League game but have since returned to action.
Ozil told the Athletic website in October that his main concern at the time was his wife’s safety.
“They told him (Kolasinac) directly, ‘Give us your watch’. Sead’s reaction was really, really brave because he attacked one of the attackers,” Ozil said in the interview.
“The second one was in front of my car on his moped so I couldn’t drive.
“We were newly wed and I was scared about my wife. I was scared about Sead. I wasn’t thinking about myself. I was worried they were going to open my wife’s door and they tried, so I reached across her to keep it closed.” — AFP


Song written by J. Lynn Eisenstein ©2002. Based on the activist work of poet Brett
Axel.
Vocals and acoustic guitar - J. Lynn Eisenstein
Production and electric guitar - John Trainello
O-ní o-ní-na*
There's a place in my heart
that doesn't want to fight
a little breath of light before
I go to bed each night
I'll get up off my couch
and travel to the sea
and I will work
for peace in this world
and in me
oh I know who rules the land
and who wears the crown
the ones who kill their brothers
and beat their sisters down
the ones who never had someone
to set their love free
but I will work
for peace in this world
and in me
for the poor who work each day
to earn their daily bread
for the women and the men
walking lonely up to bed
for those who gave their lives
and the children yet to be
I will work
for peace in this world
and in me
and if you want to find me
I'm standing in the road
holding up my sign
and carrying my load
call upon the Lord
cause he knows where I'll be
I will work
for peace in this world
and in me.
will work for peace, will work for peace
yes, I will work for peace
in this world, and in me.
* (oní means peace in Manu, one of the languages spoken in the country of Liberia. translation by Mariama Koroma)
Joshua Lynn Eisenstein is a poet/songwriter from South Orange, NJ, USA. He has a Master of Arts from N.Y.U. and is a doctoral candidate at Temple University. Lynn is currently producing his first album, to be titled "Morning Voice." For more information on the songs and poetry of J. Lynn Eisenstein, e-mail<EMAIL_ADDRESS>John Trainello is a songwriter/instrumentalist from Newark, NJ, USA. He will be recording an album this year (2004). For more information, e-mail jtrainello@optonline.net.


Pickup Available
Information
Time: x
Restaurant: x
Location: x
Ordered Item: x
Delivery Location: x
Accept
Decline