Stephen Hawking
The man who changed the way we see the universe.
“One of the basics rules of the universe, is that nothing is perfect. Perfection simply doesn’t exist… Without imperfection, neither you nor I would exist.” - Stephen Hawking
A Brief History of Hawking
- 1942: Born on 8 January in Oxford, England.
- 1953-1958: Attended St Albans school in North London, where he developed a passion for mathematics.
- 1959: Began his university education at University of Oxford.
- 1962: Specialised in physics. Graduated with a first class degree in natural sciences.
- 1963: Began his research in cosmology and general relativity at the University of Cambridge. Also in this year, Hawking was diagnosed with an "incurable disease", which is later found to be Amyotrophic Lateral Sclerosis, a rare progressive disease that affects movement and speech. At the time, doctors gave him two years of life.
- 1965: Married his first wife, Jane Wilde.
- 1966: Completed his doctorate and is awarded a fellowship at Gonville and Caius College, Cambridge. He worked on singularities in the theory of general relativity and applied his ideas to the study of black holes. Collaborated with mathematician Roger Penrose.
- 1967: Robert, his first child, was born.
- 1970: Hawking and Penrose published a proof that if the universe obeys the general theory of relativity, then it must have begun as a singularity (Big Bang). Lucy, his second child, was born also this year.
- 1974: Discovered a remarkable property: by using quantum theory and general relativity he was able to show that black holes could emit radiation, known today as Hawking Radiation. A few weeks later, he was elected a Fellow of the Royal Society.
- 1979: Hawking was elected Lucasian Professor of Mathematics at the University of Oxford. In April of that same year, Timothy, his third child, was born.
- 1983: In Collaboration with Jim Hartle, he proposed that the universe had no boundary in spacetime. That means before the Big Bang, time did not exist, so the concept of the beginning of time is meaningless. This model is know as Hartle-Hawking State
- 1985: Lost his capacity to talk.
- 1986: He received a computer program called the “Equalizer” from Walter Woltosz, CEO of Words Plus. Hawking could now simply press a switch to select phrases, words or letters.
- 1988: Published his bestseller book:“A Brief History of Time”, a book that explains his ideas in non-technical language.
- 1990: Hawking broke up with Jane.
- 1993: Published the book “Black Holes and Baby Universes and Other Essays”.
- 1995: Hawking married Elaine Manson, she was his nurse in the late 1980s.
- 1996: Co-authored with Roger Penrose “The Nature of Space and Time”.
- 2001: Published the book “The Universe in a Nutshell”
- 2007: Published his first children’s fiction with his daughter Lucy, he wanted to explain physics to kids. The title of the book was “George's Secret Key to the Universe”.
- 2009: Published his second children’s fiction with his daughter Lucy, “George’s Cosmic Treasure Hunt”.
- 2011: Published his third children’s fiction with his daughter Lucy, “George’s and the Big Bang”.
- 2013: Published “My Brief History”, the book is about Hawking’s life.
- 2014: He published his fourth children’s fiction with his daughter Lucy, “George’s and the Unbreakable Code”. In september came out “The Theory of Everything”, a movie about Hawking’s romance with his first wife, Jane Wilde.
“However difficult life may seem, there is always something you can do and succeed at.” - Stephen Hawking
To know more about Stephen Hawking, visit his Wikipedia page.
This page was made by Bruno Lavanini
Feel free to contact me, your feedback will be very appreciated.


Twin siblings Dipper and Mabel Pines spend the summer at their great-uncle's tourist trap in the enigmatic Gravity Falls, Oregon.
A 12-year-old boy and his best friend, wise 28-year-old dog with magical powers, go on a series of surreal adventures with each other in a remote future.
Phineas and Ferb invent, scheme, and stay one step ahead of their bratty sister. Meanwhile, their pet platypus plots against evil Dr. Doofenshmirtz.
A team of intergalactic warriors fights to protect the universe, but the combination of three highly trained beings and one quirky young boy leaves the team struggling to overcome the dangerous scenarios that are put in front of them.
Lincoln Loud is an eleven-year-old boy who lives with ten sisters. With the help of his right-hand man Clyde, Lincoln finds new ways to survive in such a large family every day.

The daily surreal adventures of a blue jay and raccoon duo that attempt to deal with their mundane jobs as groundskeepers at the local park.
In Marzipan City, the young, excitable food-loving Chowder is the apprentice of Mung Daal, a very old chef who runs a catering company with his wife, Truffles and assistant, Shnitzel.
The misadventures of a magical uncle and grandpa to everyone in the world and his friends.
The adventures of a 4th grader named Clarence along with his two best friends, Sumo and Jeff.
The misadventures of a talking sea sponge who works at a fast food restaurant, attends a boating school, and lives in an underwater pineapple.


The org.hsqldb.test
package contains a number
of tests for various functions of the database engine. Among these, the
TestUtil
class performs the tests that are based on
scripts. To run the tests, you should compile the
hsqldbtest.jar
target with Ant and JUnit.
The TestUtil
class should be run in the
/testrun/hsqldb directory of the distributed files. It then runs the set
of TestSelf*.txt files in the directory. To start the application in
Windows, change to the directory and type:
java org.hsqldb.test.TestUtil
All files in the working directory with names matching TestSelf*.txt are processed in alphabetical order.
You can add your own scripts to test different series of SQL queries. The format of the TestSelf*.txt file is simple text, with some indentation and prefixes in the form of Java-style comments. The prefixes indicate what the expected result should be.
The class org.hsqldb.test.TestScriptRunner
is
a more general program which you can use to test any script files which
you specify (with scripts of the same exact format as described below).
For example,
java org.hsqldb.test.TestScriptRunner --urlid=mem script1.tsql script2.sql
You must have the HSQLDB classes, including the util and test classes, in
your CLASSPATH
. The urlid must be set up in an RC file
as explained in the RC File Authentication Setup section. Use the
rcfile=
argument to specify an RC file other than the
default of testscriptrunner.rc
in the current
directory. To see all invocation possibilities, just run TestScriptRunner
with no arguments at all. TestScriptRunner can run tests sequentially (the
default) or in simultaneous asynchronous threads.
Comment lines must start with -- and are ignored
Lines starting with spaces are the continuation of the previous line (for long SQL statements)
SQL statements with no prefix are simply executed.
The remaining items in this list exemplify use of the available command line-prefixes.
The /*s*/ option stands for silent. It is used for executing queries regardless of results. Used for preparation of tests, not for actual tests.
/*s*/ Any SQL statement - errors are ignored
The /*c<rows>*/ option is for SELECT queries and asserts the number of rows in the result matches the given count.
/*c<rows>*/ SQL statement returning count of <rows>
The /*u*/ option is for queries that return an update count, such as DELETE and UPDATE. It asserts the update count matches.
/*u<count>*/ SQL statement returning an update count equal to <count>
The /*e*/ option asserts that the given query results is an error. It is mainly used for testing the error detection capabilities of the engine. The SQL State of the expected error can be defined, for example /*e42578*/, to verify the returned error. This option can be used with syntactically valid queries to assert a certain state in the database. For example a CREATE TABLE can be used to assert the table of the same name already exists.
/*e*/ SQL statement that should produce an error when executing
The /*r....*/ option asserts the SELECT query returns a single row containing the given set of field values.
/*r<string1>,<string2>*/ SQL statement returning a single row ResultSet equal to the specified value
The extended /*r...*/ option asserts the SELECT query returns the given rows containing the given set of field values.
/*r <string1>,<string2> <string1>,<string2> <string1>,<string2> */ SQL statement returning a multiple row ResultSet equal to the specified values
(note that the result set lines are indented).
The /*d*/ directive just displays the supplied text.
/*d*/ Some message
The /*w MILLIS*/ directive causes the test to Wait for a specified number of millisedonds.
/*w 1000*/ Optional message
The /*w ENFORCE_SEQUENCE WAITER_NAME*/ directive causes the
test to Wait for the specified Waiter. A waiter
is just name that is used to associate a /*w*/ directive to its
corresponding /*p*/ directive. The ENFORCE_SEQUENCE argument must be
set to true
or false
to specify
whether to fail unless the /*p*/ command runs after the /*w*/ command
is waiting.
/*w true script4*/ Optional message
The /*p ENFORCE_SEQUENCE WAITER_NAME*/ directive is the peer directive to /*w*/, which causes a waiting thread to Proceed.
/*p true script4*/ Optional message
All the options are lowercase letters. During development, an uppercase can be used for a given test to exclude a test from the test run. The utility will just report the test blocks that have been excluded without running them. Once the code has been developed, the option can be turned into lowercase to perform the actual test.
See the TestSelf*.txt files in the /testrun/hsqldb/ directory for actual examples.
The String ${timestamp}
may be used in script
messages (like in /*d*/, /*w*/, /*p*/). It expands to the current time,
down to the second. For example,
/*d*/ It is now ${timestamp}
$Revision: 5063 $


{% raw %}
{: .-one-column}
As of github-pages v156. For an updated list, see: Dependency versions (pages.github.com)
Put this in your _config.yml
. See: Repository metadata on GitHub pages
{% for repository in site.github.public_repositories %}
<a href='{{ repository.html_url }}'>
{{ repository.name }}
</a>
{% endfor %}
See: jekyll-gist
This places a Gist in your page.
See: jekyll-mentions
Just mention anyone in any page. Their names will be turned into links.
{: .-three-column}
See: jekyll-redirect-from
Place on any page.
Place on any page. See: redirect to
{% endraw %}


Sound Channel 4
Sound channel 4 produces Pseudo-Noise with an envelope function. Noise is generated by a polynomial counter also known as a Linear-Feedback Shift Register (LFSR). LFSRs are special type of binary counter that have the particularity of not counting in the normal binary increment/decrement sequence. These counters find common uses in pseudorandom-numbers generation. Theory behind LFSRs and Polynomial counters are out of the scope of this document but a simple approach to key concepts will be described. Good references on the subjects are given at the end of this document.
The pseudo-noise pattern playback frequency can be controlled by a 3-bit clock divider used to divide the Sound system's clock (4.194304Mhz). The clock divider's output is then fed into a pre-scaler which output is then used as the polynomial counter's clock. The counter can be set to user either 7 or 15 stages/steps. Resulting into a 127 or 32767 input clock cycle period. Using 7 stages give more metallic sounding effects when played faster (lower divider ratios) while 15 stages sounds much like white noise.
Selection of the clock divider is done by bits 0-2 of REG_SOUND4CNT_H:
000: f*2
001: f
010: f/2
011: f/3
100: f/4
101: f/5
110: f/6
111: f/7 Where f=4.194304
Mhz/8
Bit 3 of REG_SOUND4CNT_H control the number of counter stages: 0=15 stages, 1=7 stages.
Selection of the pre-scaler divider value is done by bits 4-7 of REG_SOUND4CNT_H:
0000: Q/2
0001: Q/2^2
0010: Q/2^3
0011: Q/2^4
....
1101: Q/2^14
1110: Not used
1111: Not used Where Q
is the clock divider's output
The REG_SOUND4CNT_L contains the envelope function and the sound's length and its functionality is identical to channel 1.
Bit 14 of REG_SOUND4CNT_H control the loop/timed mode. If set to 1 sound plays for the duration specified in REG_SOUND4CNT_L otherwise sound plays continuously. Bit 15 resets the sound and the LSFR counter.
All registers can be modified during playback but sound need to be reinitialized when modifying the envelope initial volume or the clock divider for changes to take effects.
How it works
This section is more intended to emulator writers who wants to implement the exact sound of the original Gameboy sound system.
An LFSR counter with n stages can implement a maximum of (2^n)-1 states, n representing the degree of the polynomial. All zeros state is not allowed because it locks the counters. Each state in the entire count sequence is generated once and only once.
The Gameboy sound circuit implements a switchable 7/15-stages LFSR. Below is an representation of the logic used by the Gameboy. It is important to realize that channel 4 does not generate white noise per-se but Pseudo-noise. White noise is a special type of signal containing an equal amount of all frequencies and has no cycle period. LFSR counters have a cycle period of (2^n)-1 input clock cycles. Played at high speed, the pattern starts to exhibit a fundamental derived from the input clock frequency. This is clearly evident when using the 7-stages mode since the cycle is only 127 input clocks. 15-stages mode has a much bigger cycle, 32767, so the pseudo-noise sounds much more like white noise.
When initialized, all shift registers are set to 1. On each clock pulse, bits are shifted from left to right (on the picture) s1 being the least significant bit and the output that is sent to the channel's envelope generator. The count sequence for the 7-stage LFSR, once the sound channel is resetted is then:
Counter Steps
|
By looking at s1 output (the the least significant bit), we can see it matches the pattern on the picture, which is a capture of the GBA output for channel 4 in 7-stage mode. Since the counter is always counting in the same sequence, the output bits can be stored in a lookup table for fast emulation of this function. By packing the bits, a 4 KB lookup table is sufficient to represent all states for both the 7 and 15 stages of the LFSR. |
n-Stage LFSR simulator Java applet
Code
#include <gba.h>
void AgbMain(void){
//Play a sound on channel 4
//turn on sound circuit
REG_SOUNDCNT_X = 0x80;
//full volume, enable sound 4 to left and right
REG_SOUNDCNT_L=0x4477;
// Overall output ratio - Full
REG_SOUNDCNT_H = 2;
REG_SOUND4CNT_L=0xf700; //envellope decay, initial vol
max
REG_SOUND4CNT_H=0x8032; //Loop mode, clk div:6, 7-stage,pre-scaler:3
}


{block name="style"} {include file="public:head"} {block name="title"}
测试
{/block} {block name="head"}{/block} {/block}
{include file="public:header" /} {include file="public:side" /} {block name="full"}
{block name="body"} {include file="public:body"} {/block}
{/block}
{block name="foot"} {include file="public:footer"/} {block name="footer"}{/block} {/block} {include file="public:var" /} {block name="script"}{/block}


{% extends "hydraviewer/base.html" %} {% load tethys_gizmos staticfiles %} {% block styles %} {{ block.super }} {% endblock %} {% block scripts %} {{ block.super }} {% endblock %} {% block app_content_override %}
Cyclone Komen August 2015
During the 2015 monsoon season Cyclone Komen made
landfall in Bangladesh in July, bringing additional heavy rains into Myanmar. These rains lead to a significant
increase in monsoonal flood water, leading to severe flooding and landslides.
Monsoonal Rains July 2016
Heavy monsoonal rains and resultant flooding started in June of
2016. Continued heavy rainfall lead to exacerbated flooding and landslides across the region.
Monsoonal Rains August 2018
Localized heavy monsoonal rains and thunderstorms lead to the
overflow of rives and eventually a the failure of the Yedashe Township dam in the Bago region.


Sanjay Raut upset over being moved to back-row in RS, writes to Chairman
Raut also said that the Sena has not been formally removed from the NDA.
by ANINew Delhi: Shiv Sena leader Sanjay Raut on Wednesday wrote a letter to Rajya Sabha chairman Venkaiah Naidu after he was allocated a back-row seat in the House and said that it was "correlated to the tussle in government formation in Maharashtra".
"I was astonished to know that my seating position in the Rajya Sabha chamber has been changed from 3rd row to 5th row. It is correlated to the tussle in the government formation in Maharashtra state," Raut stated in the letter.
BJP, which emerged as a single largest party in the recently concluded Assembly elections, could not stake claim to form a government after failing to accept its ally Shiv Sena's power-sharing demands.
"I fail to understand the reason for this unwarranted step of re-allocation of seats since there is no formal announcement about the removal from NDA alliance," Raut stated.
He said that the decision was taken deliberately to hurt the sentiments of his party and suppress their voice in the House.
Catch the latest news, live coverage and in-depth analyses from India and World. Follow us on Facebook and Twitter.


Nokia Lumia 720
GENERAL
| 2G Network | GSM 850 / 900 / 1800 / 1900 |
| 3G Network | HSDPA 850 / 900 / 1900 / 2100 |
| SIM | Micro-sim |
| Announced | 2013, February |
| Status | Available. Released 2013, April |
BODY |
|---|---|
| Dimensions | 127.9 x 67.5 x 9 mm, 78 cc (5.04 x 2.66 x 0.35 in) |
| Weight | 128 g (4.52 oz) |
DISPLAY |
| Type | IPS LCD capacitive touchscreen, 16M colors |
| Size | 480 x 800 pixels, 4.3 inches (~217 ppi pixel density) |
| Multitouch | Yes |
| Protection | Corning Gorilla Glass 2 |
SOUND |
| Alert Types | Vibration; MP3 ringtones, WAV ringtones |
| Loudspeaker | Yes |
| 3.5mm Jack | Yes - Dolby headphone sound enhancement |
MEMORY |
| Card slot | microSD, up to 64 GB |
| Internal | 8 GB storage, 512 MB RAM |
FEATURES |
| OS | Microsoft Windows Phone 8 |
| Chipset | Qualcomm MSM8227 |
| CPU | Dual-core 1 GHz |
| GPU | Adreno 305 |
| Sensors | Accelerometer, proximity, compass |
| Messaging | SMS (threaded view), MMS, Email, IM, Push Email |
| Browser | HTML5 |
| Radio | No |
| GPS | Yes, with A-GPS support and GLONASS |
| JAVA | No |
| Colors | White, Red, Yellow, Cyan/Black |


Hello world, I'm Riyan Pramana. I am a back-end and front-end developer living on Bandung, Indonesia.
Since the day I'm graduating from my college I never thought my skill on developing a program would be usefull. One day my friend ask me to join his project, since then I never stop to improve my skill on the infinite world of developers.
August 2017 - present
Core Backend & API Developer
Java | Play Framework | Spring Boot
February 2015 - Juny 2017
Creating e-commerce website
PHP | Code Igniter
September 2014 - January 2015
Creating logo, clothes design and banner Design
Photoshop | Ilustrator | Corel Draw


* Worst case model of wet body or broken skin; dry body may have resistance up to 100kΩ
Electric Shocks
Dry human body resistance: 10-100kΩ
Lethal current: 0.1-0.2A (100-200mA)
UK Mains Voltage: 230V
Ohm's law: I = V / R
I = 230V / 10000Ω = 0.023A (23mA)
Approximate Shock Thresholds
Affect
AC Current
AC Voltage
DC Current
DC Voltage
Slight sensation
1mA
0.5V
5mA
2.5V
Minor shock
2mA
1V
8mA
4V
Painful shock
7mA
3.5V
50mA
25V
Muscle contraction
12mA
6V
65mA
32V
Breathing trouble
20mA
10V
75mA
37.5V
Fibrillation
100mA
50V
500mA
250V
Values expressed are subject to variation and are not intended to be guaranteed safety advice.
Experimental verification of these numbers may lead to death. Avoid wherever possible.
AC voltage at 60Hz. Bodily resistance assumed to be 500Ω (wet body / broken skin)
Data source: Health and Safety Manual, LBNL/PUB-3000.
Voltage usually decides your fate
Components
Passives
Resistor
Resistance, ohms (Ω)
Limits current
Capacitor
Capacitance, farads (F)
Stores charge
Ceramic (MLCC) - nonpolar, small capacitance
Electrolytic - polar, big capacitance
Not perfectly conductive - ESR
Other types: tantalum, alupoly, film
Inductors
Actives
Transistors
Opamps
Logic gates
...
Diodes
... and LEDs!
Passive? Active?
Circuit Boards
Designators
Reference designator or "refdes"
Refdes
Component
R
Resistor
C
Capacitor
L
Inductor
Q
Transistor
D
Diode (or LED)
F
Fuse
U
Integrated Circuit (IC)
Y / XTAL
Crystal
J
Jack or Connector
Circuit Diagrams
source: https://xkcd.com/730/
Logic
Logic
Value
Voltage
0
low
1
high
Logic
Value
Voltage
0
0V
1
+V
Logic Levels
+5V
+3.3V
+1.8V
Don't blow up your hardware
Hardware
Logic Level
Arduino Uno
5V
Arduino Mega
5V
Arduino Due
3.3V
Raspberry Pi
3.3V
ESP8266 / ESP32
3.3V
Teensy
3.3V (5V tolerant)
Clocks
Processors
Processors
Microprocessors
Microcontrollers
Programmable Logic
Microprocessors
Fetch instructions
Decode instructions
Execute instructions
Use external memory
Use external peripherals
Example: Zilog Z80
Microcontrollers
Contain a microprocessor
Contain memory
Contain program flash
Internal peripherals
Standalone / general purpose
Example: Atmel ATmega328P
Programmmable Logic
Array of configurable logic gates
Interconnected logic, not instructions
Used for specialist applications
Types: PAL, PLA, CPLD, FPGA
Can implement MPUs / MCUs
Example: Lattice iCE40 FPGA
Example application: RISC-V
Interfaces
GPIO
void setup() {
pinMode(13, OUTPUT); // sets the digital pin 13 as output
}
void loop() {
digitalWrite(13, HIGH); // sets the digital pin 13 on
delay(1000); // waits for a second
digitalWrite(13, LOW); // sets the digital pin 13 off
delay(1000); // waits for a second
}
UART
void setup() {
Serial.begin(9600); // 9600 baud (bytes per second)
}
void loop() {
Serial.println("Hello world!"); // print text to UART
}


Makayla Price's Portfolio
Hello there! I am a sophomore Computer Science Major
at Xaver University of Louisiana. A few of my hobbies include
crocheting, painting, and dancing. I also love watching
crime documentaries and anime. I love traveling and discovering new places!
Gallery of Places I've Traveled Abroad to!
LinkedIn and Github links!
Click here to view my LinkedIn Profile.
Click here to view my GitHub Profile.
Click here to see content created by server code.
Click here to get a random message😄:


Bankruptcy prediction¶
In this tutorial, you will learn to:
Train a machine learning model for bankruptcy prediction
Carry out inferencing
Screen out stocks based on the results
Intro to bankruptcy prediction¶
In this problem setting, we assume that the bankruptcy of a company could be
predicted several years ahead. We presume that certain financial ratios are
significant for the prediction of bankruptcy, and that we would compute these
ratios using the fundamentals data we have collected and train a machine learning
model to guess if a company would go bankrupt in one year based on these financial
ratios.
Bankruptcy prediction with machine learning¶
The workflow of the prediction model is outlined as follows:
Collect labelled data (bankrupted = 0, survived = 1)
Split the dataset into training set and test set a ratio of 7:3
Train the machine learning model(s) with the labelled data (training set)
Evaluate the accuracy of the training model with the test set
Make use of the models to predict our own set of data (i.e. inferencing)
We will go through these steps one by one, and try to predict the bankruptcy of a set of
companies in Hong Kong.
Data collection¶
The labelled dataset featured in the repository is collected by the UCLA School of Law.
It contains a total of about 200 records, which includes the fundamentals data of public companies in US as well as its
bankruptcy status (bankrupted = 0, survived = 1). Note that in the suffix of the dataset file names,
t1
means 1 year, t2
means 2 years, and so on.Based on the training data and other references 1, the below ratios have been selected as input variables for the machine learning model:
\[\begin{split}X_1 &= \text{Working capital } / \text{ Total assets} \\
X_2 &= \text{Retained earnings } / \text{ Total assets} \\
X_3 &= \text{EBIT } / \text{ Total assets} \\
X_4 &= \text{Total equity (book) } / \text{ Total assets} \\
X_5 &= \text{Net income } / \text{ Total assets} \\
X_6 &= \text{Total liabilities } / \text{ Total assets} \\\end{split}\]
The code snippet for concatenating the dataset and creating the variables as shown below:
# Concatenate data
data_full = pd.concat([bankrupt_data, non_bankrupt_data], ignore_index=True)
# Add and scale variables
data_full["X1"] = preprocessing.scale(data_full["WoCap"] / data_full["ToAsset"])
data_full["X2"] = preprocessing.scale(data_full["CFOper"] / data_full["ToLia"])
data_full["X3"] = preprocessing.scale(data_full["EBIT"] / data_full["ToAsset"])
data_full["X4"] = preprocessing.scale(data_full["ToEqui"] / data_full["ToAsset"])
data_full["X5"] = preprocessing.scale(data_full["NetInc"] / data_full["ToAsset"])
data_full["X6"] = preprocessing.scale(data_full["ToLia"] / data_full["ToAsset"])
Train-test split¶
The dataset is then split into training set and test set (with a ratio of 7:3),
so that we could achieve unbiased evaluation (i.e. the model is evaluated with fresh data).
# Split data for training and testing
X = data_full[["X1", "X2", "X3", "X4","X5","X6"]]
y = data_full['Status']
self.X_train, self.X_test, self.y_train, self.y_test = train_test_split(X, y, test_size=0.3, random_state=101)
In the example, three machine learning models typically used for classification have been chosen:
Support Vector Machine
Decision Tree
Random Forest
K-Nearest Neighbor (KNN)
They are defined as methods of the bankruptcy prediction model class in the example file. Thus,
it would be easier for us to compare and evaluate the performance of different machine learning
models.
Training the model¶
# after loading and pre-processing the data
# create an instance of the class
model = bankrupt_prediction(bankrupt_t1, non_bankrupt_t1, input_df, False)
# train with knn
t1_results = model.knn()
Evaluate accuracy¶
We can check the performance of the model by looking into the confusion matrix and classification
report:
# ouput:
Confusion Matrix using Decision Tree:
[[7 2]
[2 9]]
Classification Report using Decision Tree:
precision recall f1-score support
0 0.78 0.78 0.78 9
1 0.82 0.82 0.82 11
accuracy 0.80 20
macro avg 0.80 0.80 0.80 20
weighted avg 0.80 0.80 0.80 20
Inferencing¶
To carry out prediction with our own dataset, simply set the boolean of
inferencing
to True
and call the method again.model.inferencing = True # set Inferencing as True
t1_results = model.knn()
# save results to a csv file
t1_results.to_csv("./results/t1_results-knn.csv", header='column_names', index=False)
To check what are the companies that survived in 1 year, load the results csv file and
filter out companies with a label of
1
.df_t1 = pd.read_csv("./results/t1_results-knn.csv", index_col=None, header=0)
mask = (df_t1['knn'] == 1)
# get the percentage of survival
len(df_t1[mask]) / len(df_t1)
And we could save the filtered list as another csv file.
df_filtered = df_t1[mask]
df_filtered.to_csv("survived-t1.csv", header='column_names', index=False)
Sources
Attention
All investments entail inherent risk. This repository seeks to solely educate
people on methodologies to build and evaluate algorithmic trading strategies.
All final investment decisions are yours and as a result you could make or lose money.


Afraid of being an uneducated voter? Think there's nothing to care about? Tell us what you're interested in and we'll show you the type of legislation that you can have a voice in.
We'll send you a text about the bills and legislation that might interest you so go check them out!!


|
That's
The Way It Is
(Celine Dion) |
|
Hmm,
yeah
I can read your mind And I know your story I see what you're going through, yeah It's an uphill climb And I'm feeling sorry But I know it will come to you, yeah And don't surrender 'cause you can win In this thing called love 1 - When you want it the most There's no easy way out When you're ready to go And your heart's left in doubt Don't give up on your faith Love comes to those who believe it And that's the way it is When you question me For a simple answer I don't know what to say, no But it's plain to see If you stick together You're gonna find the way, yeah So don't surrender 'cause you can win In this thing called love Repeat 1 That's the way it is When life is empty with no tomorrow And loneliness starts to call (Loneliness starts to call) Baby don't worry forget your sorrow 'Cause love's gonna conquer it all, yeah Repeat 1(2x) That's the way it is (That's the way it is) That's the way it is (That's the way it is) Don't give up on your faith (Don't give up on your faith) Love comes to those who believe it And that's the way it is (oh) |


Color Mode
default
average
Color By
rank
frequency
groupedFrequency
count
reference
Order By
rank
frequency
groupedFrequency
count
Match On
word
rank
frequency
groupedFrequency
count
Color Scheme
Blue-Yellow Sequential
Red-Blue Diverging
Purple-Orange Diverging
Grey
Ramp Theme
Red-Blue Diverging
Blue-Yellow Sequential
Purple-Orange Diverging
Grey
Inverted Coloring
Reference Ordering
Set Reference
Show Words
Clear Line Markings
Sequences
Matches
Working....


Cheesecake Order Form
Quantity Topping
1
2
3
Plain
Cherry
Chocolate
Notes:
Order
Total Orders of
Jan
Jan
Feb
Mar
Apr
May
Jun
Jul
Aug
Sep
Oct
Nov
Dec
11 cherry
17 chocolate
31 plain


Installing Durable Functions
Durable Functions is an extension of Azure Functions which uses a brand new binding extensibility model. This extensibility model is in the very early stages of development (see this GitHub issue for updates) and does not yet provide a decent setup experience. Because of this, the setup for Durable Functions currently involves 1) manually deploying a set of files to the function app and 2) adding an app setting which points to the directory containing these files. In the coming weeks, we hope to reduce this down to a simple NuGet package reference.
In the meantime, you will need to follow the below manual steps to use Durable Functions in your function app.
Using the Durable Task Binding Extension in Visual Studio (Windows Only)
If you can't or don't want to use Visual Studio for development, you can do development directly in Azure using the Azure Management portal. In that case, skip these instructions and go straight to the Azure instructions further below.
Visual Studio currently provides the best experience for evaluating Durable Functions. Here is how to get started:
- Install the Visual Studio Tools for Azure Functions if you haven't already.
- Download the DurableFunctionsBinding.zip file and unzip its contents into your C:\ directory (any location will work, but the samples currently assume it's in the C:\ directory). Once unzipped, you should have a
C:\BindingExtensions
directory that contains a single folder namedDurableTask
. TheDurableTask
directory will contain several DLLs. - Create a new Function App project (an existing one also works).
- Add a new app setting called
AzureWebJobs_ExtensionsPath
in yourlocal.settings.json
file. Set it toC:\\BindingExtensions
(the\\
is to escape the backslash, since this is a JSON file). - In Visual Studio, select Tools --> NuGet Package Manager --> Manage NuGet Packages for Solution...
- In the upper-right hand corner, click the "Settings" gear icon.
- Add a new package source with
https://www.myget.org/F/azure-appservice/api/v3/index.json
as the Source, click Update, and click OK. The Durable Task packages are published to our team's myget feed (and not NuGet.org) because they are still in active development. Note that this is the same location for nightly builds of Azure Functions and Azure WebJobs packages. - Add the following NuGet package reference to your .csproj file:
<PackageReference Include="Microsoft.Azure.WebJobs.Extensions.DurableTask" Version="0.1.0-alpha" />
This allows your project to download and reference the DurableTask extension which is required for Durable Functions.
This should be sufficient for local F5 development. If you would like to publish your solution to Azure, then you'll need to follow the Azure instructions below.
Deploying the Durable Task Binding Extension in Azure
The below steps assume you have a function app up and running. If you do not, go ahead and create one by navigating to https://functions.azure.com/signin and create a new function app there. It only requires a few clicks.
Deploying the extension requires uploading some assemblies and creating an app setting.
- Open your function app in the Azure Functions portal.
- Navigate to the Kudu console (Platform Features --> Advanced Tools (Kudu))
- Click Debug Console and select CMD
- Drag/drop the DurableFunctionsBinding.zip file onto the right-side of the directory list in the browser window to unzip the contents into your function app.
Note
Chrome is the recommended browser for drag-dropping zip files. If you can't or don't want to use Chrome or drag/drop isn't working, you can alternatively upload the zip file using FTP and use the unzip
command in the Kudu console window to unzip the contents in the remote file system.
At this point you should have a D:\home\BindingExtensions
directory which contains a single folder named DurableTask
. The DurableTask
directory will contain several DLLs.
- Back in the Functions portal, click Application settings (under General Settings)
- Add a new app setting named
AzureWebJobs_ExtensionsPath
and set the value toD:\home\BindingExtensions
. - Stop and start your function app to load the extension.
Warning
Do NOT point your app setting to the DurableTask directory or else the runtime will not find your extension.
At this point, your binding extension should be installed and you can start using it in your function code!


This example shows live weather data from
openweathermap.org.
In order to run the model, you need to sign up and get an appid from the
here
and enter it in the text box below.
After you have done this, the model should load and the weather data should begin to display.


Tanzania taxman’s Shinyanga commissioner, regional police bosses suspended in tax evasion claims
by The Citizen ReporterDar es Salaam. President John Magufuli has suspended the Shinyanga Regional Police Commander (RPC), Mr Richard Abwao and the Regional Crimes Officer (RCO) John Rwamlema to pave way for investigations into their alleged misconduct and economic sabotage claims.
The two are suspected of colluding with Tanzania Revenue Authority (TRA) Regional Commissioner for Shinyanga, Mr Jumbe Samson in aiding a private investor to evade tax.
The two regional police bosses are also accused of disrespecting the Shinyanga Regional Commissioner, Ms Zainab Telack by not implementing her directives.
Acting director for taxpayer services and education at TRA, Mr Richard Kayombo confirmed on Sunday, 24 November 2019 that the President’s directive was immediately implemented.
“That was implemented immediately,” he quipped, saying he was not ready to get into the details of the issue.
In a statement released by the Tanzania Police Force spokesperson, Mr David Misime, the three are accused of aiding the management of spirits maker in Shinyanga, Canon, to evade tax.
Advertisement
Available information allege that Canon was making use of ‘outdated’ excise duty stamps as a way of evading tax and that despite several reports being sent to TRA and the police force in the region, no action was taken.
At one point, a team from the office of the Regional Commissioner has impounded a lorry carrying spirits from Canon.


Dr. Strange
Doctor Strange serves as the Sorcerer Supreme, the primary protector of Earth against magical and mystical threats.
Spiderman
Spider-Man has spider-like abilities including superhuman strength and the ability to cling to most surfaces. He is also extremely agile and has amazing reflexes. Spider-Man also has a “spider sense,” that warns him of impending danger.
Iron Man
Inventor Tony Stark applies his genius for high-tech solutions to problems as Iron Man, the armored Avenger.
Basic
$100
- Bodyguard for 1 hr.
- 1 photo with your super hero.
Pro
$500
- Bodyguard for 24 hrs.
- 1 photo with your super hero.
- A souvenir of your hero.
- You can talk with your superhero.
Avenger
$10,000
- Bodyguard for 1 week.
- 1 photo with your super hero.
- A souvenir of your hero.
- You can talk with your superhero.
- Your superhero will cook for you.
- You can be an avenger.


2014-01-10 Charlottesville High School Students in Robotics Competition [WAHU 27]
2012-02-23 Cool Schools: Students Write Code To Control Satellite In Space [WUSA 9]
2012-02-07 Bonners Ferry robotics clubs builds technology used by ISS [Krem 2 News]
2012-01-26 Pride and hope for the future of robotics [The Rachel Maddow Show]
2014-02-14 Space Station SPHERES Run Circles Around Ordinary Satellites [nasa.gov]
2014-01-20 Space station robots to act out Irvine students' algorithm [Orange County Register]
2014-01-13 LHS group competing for control of robots on the International Space Station [Lubbock Avalanche-Journal]
2012-09-27 Want to Run Code on the ISS? There's a Competition For That [mashable.com]
2012-02-29 Student scientists reach Top 20 in international robotics tourney [The Salt Lake Tribune]
2012-02-01 West Essex robotics team makes finals in design challenge [The Progress]
2012-01-31 Flying for Me [Huffington Post]
2012-01-31 Code Competition Lets Students Program Real Robots Aboard the International Space Station [T.H.E Journal]
2012-01-30 Prince William students compete in national robotics event [Washington Post]
2012-01-30 Zero Robotics Competition Plays Out Robots on International Space Station [Azo Robotics]


Granit Xhaka: Arsenal to offer the Swiss footballer to Borussia Monchengladbach
- Granit Xhaka could be making a return to Borussia Monchengladbach
- But Arsenal want Denis Zakaria plus cash for them to release Granit Xhaka
- Xhaka has not played for Arsenal since he had a confrontation with Gunners fans
Premier League giants Arsenal are reportedly ready to offer German club Borussia Monchengladbach a chance to resign Granit Xhaka when the transfer window opens.
But the German club will have to give the Gunners their star man Denis Zakaria before luring Granit Xhaka back to Germany.
Granit Xhaka's days at Arsenal are now numbered after the confrontation he had with Gunners fans at the Emirates stadium in which he failed to apologize.
He was also stripped of the captaincy at Arsenal after his outburst against Gunners' fans as Unai Emery named Gabon international Pierre Aubameyang as the new captain.
PAY ATTENTION: Install Pitch Football App for FREE to get the latest football News & Scores
Another AFCON 2013 winner aims to make strong return after 2 years out of active football
Xhaka remains fans favorite at Monchengladbach having spent four years there before making the move to the Emirates in 2016.
The German club will have to enter serious competition with Premier League side Newcastle United who are also interested in signing Granit Xhaka.
Arsenal are currently occupying sixth position on the Premier League standings with 17 points after 12 games played this season.
Earlier, Legit.ng had reported how Premier League side Newcastle United are now relying on the help of their star defender Fabian Schar to convince Granit Xhaka to join the club on loan in January 2020.
Granit Xhaka has been left out of Arsenal squad since the confrontation he had with the Gunners' fans against Crystal Palace when he was being substituted.
The 27-year-old midfielder was angry with the way he was booed by Arsenal fans, and he made some abusive statement angrily while he was leaving the pitch.
Liverpool eye mega move for Super Eagles star also wanted by Real Madrid and Barcelona
Abu Azeez: Meet the only Nigerian rated among top 50 beach soccer players worldwide | Legit TV


Read a literate programming file (.lss) and tangle togther the source for the language processor.
The source file for stangle (or sweave) consists
of chunks. Each chunk is either a documentation
chunk or a code chunk. Code chunks begin with
<<name>>=
and end with
a @
. Each code chunk is named. If the name
is already associated with a code chunk, it is appended
to. If it doesn't, a new code chunk is created. Within
a code chunk, other code chunks can be referenced by
<<name>>
.
Some formatting is applied by sweave. Lines beginning with *!#|; are formatted in grey and italic. The chevron definition and reference lines, and the terminator @ line are bolded. SNOBOL4 goto fields are bolded.
Documentation chunks are not delimited. Anything not in
a code chunk is a documentation chunk. The first blank
line after the start of a documentation chunk terminates
the chunk (but this is changed with [[
and
{{
). Each of the documentation chunks is
discarded by stangle, and rendered as an html paragraph
by sweave.
Within a documentation chunk [[text]]
is
rendered in the code font. The entire sequence must be
on the same input line. A {{text}}
sequence
is rendered in the handwriting (annotation) font.
If the [[
is not balanced on the same line,
lines following are rendered in the code font, with a bar
(|) inserted at the left. Unbalanced [[
(or {{
on a line by it) continue until
the terminating ]]
or }}
is
seen. This process does not terminate on a blank line,
and is the exception to the normal rule that documentation
chunks finish on a blank line.
A {{
sequence on a line by itself begins an
annotation. Either code or documentation chunks can be
annotated. Annotations are rendered as right-side insets
in a handwriting font.
Code is rendered with a green-bar background to facilitate horizontal tracking. Annotations are rendered with a blue box rule background. Documentation is on the default browser background.
A footer is added indicating that sweave has been used to render the html file, the date and time of the rendering and a link to index.html.
The default root for producing the tangled output is
the unnamed chunk (<<>>
). This
can be changed to produce other possible “tangles”
from the same source. The environment variable
STANGLE_ROOT
holds the name of the root chunk
for code generation. This can be exploited to extract
unit tests from the code, or other such tasks, as needed.
stangle is aware of the embed utility syntax. If a
-SNOBOL
directive is seen, the directive
(and continuation lines) are copied, and then a line
directive is generated to resynchronize the output with
the source .lss file. This assumes that errors within the
the inline -SNOBOL
code are rare, because
this should be more carefully written and tested.
Read a literate programming file (.lss) and weave together the html document file for code publication. See stangle for more details.
Read CSNOBOL4 source and write source to standard out, expanding all -INCLUDE (-COPY) statements. This produces a version of the program runnable without the include files being available.
Used to interactively test SNOBOL4 statements. Allows entry, editing and running of a retained program. In “code”, these programs are line numbered (1..9999). Renumbering, editing lines, calling an external editor and using DDT on a retained program are supported features.
Expressions can be evaluated and the results displayed with the = command. If an input line is not matched as a command, it is executed as a statement. Lines beginning with a number (1 to 9999) are stored. The stored lines can be saved, loaded, run and edited.
=EXPRESSION DISPLAY VALUE OF EXPRESSION !COMMAND SHELL OUT TO COMMAND ? THIS HELP STATEMENT EXECUTE STATEMENT N STATEMENT ENTER/REPLACE/DELETE PROGRAM LINE RUN [N] RUN RETAINED PROGRAM DDT DDT ON RETAINED PROGRAM LIST [[N][,M]] LIST RETAINED PROGRAM EDIT [N] EDIT RETAINED PROGRAM SAVE ['FILE'] SAVE RETAINED PROGRAM LOAD ['FILE'] LOAD RETAINED PROGRAM NAME ['FILE'] CHANGE OR DISPLAY NAME SCRATCH CLEAR RETAINED PROGRAM RENUM [N] RENUMBER RETAINED PROGRAM QUIT EXIT CODE
Combine a SNOBOL4 program with the language processor itself to produce a “compiled” object program.
This is experimental. The CSNOBOL4 is reconfigured to use memory files. The code is converted into a C string initializer which is included into the CSNOBOL4 source. CSNOBOL4 is then recompiled with the new program included within it. This produces a native executable that should run the included SNOBOL4 application.
For example, the following example
compiles the compile utility itself to
compile.exe
. We need to collect all of
the includes used by compile first, and then compile
the result.
bundlecompile.sno compile compile.sno compile.exe
Convert a “SAVE” program from code into a source code file. Used to export programs from code. Removes the first 5 columns from SAVE files. To format a SAVE file into something more presentable (well I like it, anyway), try:
upcase <SAVE | deretn | snofmt >SNOBOL4
The name is short for "de-retain". Retained is what programs SAVEd in code are called. See the code utility.
Remove left sequence numbers. These can appear in fixed format COBOL source, or BASIC source. Replaces columns 1 through 6 with blanks.
Remove right sequence numbers. Retains columns 1 through 72, and removes all data from column 73 onward. Do not use this on UTF-8 source. This desequences FORTRAN source.
Process files with embedded code/data and executable SNOBOL4 code. Reads its input, looking for control cards that indicate a file to be produced (the name “embed” comes from the fact that the file was originally embedded and is now being reconstituted). Also allows commands to be run (that can use the reconstituted files as input).
Control cards interpreted by embed are
-SNOBOL SNOBOL_CODE -EMBED C|FORTRAN|COBOL|SCHEME|DATA|FILE 'VNAME' -END -SNOBOLX SNOBOL_CODE -CMNT COMMENT
Lines between -EMBED and -END are copied to file named by VNAME. The type is used to determine the extension(.c, .FTN, .CBL, .SCM and .dat). If type FILE is used, no extension is added.
-SNOBOL and -SNOBOLX lines begin a line of SNOBOL4 code to be executed. If the line requires contination, a '+' can be given at the end of the line and the line continued. -SNOBOL simply executes its code. -SNOBOLX does the same but also copies its code to the output.
-CMNT introduces a comment.
Process conditionals (%IF) and includes (%INCLUDE). From IF.SPT. Converted to run under CSNOBOL4, and to allow the lead-in character to be changed. The lead-in character is normally %, but can be set with the environment variable IFSLC. For example IFSLC=@ would change it to the @ sign.
Operators supported are AND, OR, NE and EQ. Expressions must be fully parenthesized.
%* (A SAMPLE COMMENT) %SET(NAME1,1) %SET(NAME2,0) %SET(NAME3,1) %SET(NAME4,1) %SET(NAME5,HOST(HOST_POINTER_BITS)) %INCLUDE(FILE) %IF ((NAME1 OR NAME2) EQ NAME3) %IF (NAME4) %ENDIF %ELSE %ENDIF
Takes a sentence as input. Illuminate the first character, and outputs the character (using banner) and the rest of the sentence boxed with UTF-8 linedraw characters.
list is a simple file viewer. Supports find, line numbering and UTF-8 encoding.
Primitive SNOBOL4 formatter. Slightly useful - I use it to re-align right justified comments after editing. Where snofmt lacks is not assembling continuation lines, so it will not bring lines together. It makes no attempt to format comments.
Generate sequence numbers on the right. Generates sequence numbers for FORTRAN.
Generate sequence numbers on the left. Generates sequence numbers for COBOL.
List INCLUDE files needed. Related to the
bundle
utility, which actually “de-includes”
the file.
UTF-8 line draw characters used to produce banner. Similar
to banner
.
Convert SNOBOL4 program to uppercase. Does not uppercase quoted strings, or comments. If the /L switch is used, converts from uppercase to lowercase.
An example of a CGI script. Tested with the Apache Web Server. This example will be extended to illustrate CGI, fast CGI (when implemented), sessions, templates and Javascript.
From Griswold's String and List Processing in SNOBOL4, we take the ED4 editor. This is used as a stream editor to make changes to files driven by command scripts. ED4 is enhanced to support some additional commands. Griswold suggests other features, but since we only use ED4 as a stream editor, most of these are not implemented.
Scan input for pattern. Outputs relative lines to next match. The first argument is an optional flag /G (or /g).
The remaining arguments are gathered. If any of these is simply '=', the action is substitution. If no '=' is seen, the action is find. A find action scans its input, and outputs the relative line of a matching line. If /G is used, all lines are scanned, and relative lines for each match is output (relative to the previous match). If the action is substitute, a replacement is made, and the output is the replaced line. All lines are subjected to replacement. If /G is given, the substitute is made on all occurences on the line (if not, only one occurence).
scan /g %old = %new
changes the each occurence
of 'old' to 'new' on each line of input. scan
%target
displays the relative line numbers of
each line containing target. The relative line numbers
are designed to be read into cpmed
with
the .N
command and applied with & line
specifier in that editor. An argument beginning with % has
the % removed and is then quoted with single quotes. This
handles the common case of simple strings. Parentheses (
and ) still need "shell" quoting. Outside of the editor,
useful to perform search and replace on files.
scan loads functions from SCAN.INC to aid in useful pattern construction. Patterns to represent objects to be searched or replaced are to be put into SCAN.INC, to be used while editing.
DDT is a source level debugger for CSNOBOL4.
-INCLUDE 'DDT.INC'
into the program to be debugged. At
the point that the debugger should be activated, insert the statement
DDT()
which will enter the debugger.
Source statements can be made available by creating an environment
variable named LIST
equated to the name of a listing
file, or
DDT: X snobol4 -n -l SRC.LST SRC.SNO DDT: S LISTING: SRC.LST SOURCE LISTING LOADED DDT:
Supplying a LIST=
environment automatically
attempts loading the listing at debugger start. This
will give a symbolic line for the first line after the
DDT()
invocation.
If there is a block of statements that are to be excluded
from tracing (such as initializations), bracket them with
&TRACE = 0 ... &TRACE = 999999999
DDT()
(also known as
DEBUG()
) are the primary calls into the
debugger. DDT_SUSPEND()
will suspend
the debugger, and DDT_RESUME()
will
resume normal operation. DDT_ACTIVE
and DDT_LOADED
variables can
be examined. DDT_LOADED
will be
NULL
if DDT has not been loaded. See
BQ for an example of this use.
The DDT()
function can be invoked to
re-enter the debugger. This is usually used to generate
“complex” breakpoints. DDT()
can be
given an argument. This name can be referenced in an I
command: I 'MSG' N
which ignores the next
N
calls to DDT/DEBUG
with
the matching string. After this, the DDT()
or DEBUG()
call will enter the debugger.
Commands available in DDT are
STNO - STATEMENT NUMBERS SPECIFIED AS INTEGERS, OR LABEL +- N BRACKETED ITEMS ARE OPTIONAL H (OR ?) HELP (THIS LIST) C STATEMENT (OR TAB) IMMEDIATE EXECUTION OF STATEMENT E EXPRESSION (OR =EXP) EVALUATE EXPRESSION X COMMAND (OR !) EXECUTE SHELL COMMAND T [N] TRACE N STATEMENTS (INTO PROCEDURES) P [N] TRACE N STATEMENTS (NO PROCEDURES) B STNO [,STNO,...] SET BREAKPOINT(S) K BKPT [,BKPT,...]  GO (FROM SPECIFIED LABEL), SETTING TEMPORARY BREAKPOINT(S) L [STNO1 [,STNO2]] LIST STATEMENT OR RANGE + [N] OR -[N] LIST NEXT/PREVIOUS N STATEMENTS ++ OR -- LIST 12 STATEMENTS FORWARD OR BACK Q QUIT O (OR ^D) OFF - RESUME PROGRAM, STOP DEBUGGING S (FILE) LOAD SOURCE M NAME MODIFY VARIABLE I 'MSG' N IGNORE NEXT N CALLS TO DDT(MSG) * COMMENT COMMENT (NO ACTION) . FILE SOURCE FILE (DO NOT NEST) V (FILE) VIEW FILE (DEFAULT TO LIST FILE)
cpmed is very lightweight in memory. Typically, virtual memory is 6.4MB, resident size is 2.6MB with 0.5MB shared. This is with 2MB edit region, a 128K auxillay region, and 8192 undo steps.
Typical SNOBOL4 programs require 8MB for dynamic storage, and around 400K for the interpreter and around 200K for the interpreter stack and pattern stack. Total virtual memory is 35 to 100MB, (and I would like to find out why!) with a resident size of around 10MB and a 1.5MB shared.


Welcome to The University of Texas at Dallas. The Department of computer science
Department Chair
Dr. Gopal Gupta is the Head of the Department of Computer Science at UT Dallas


--- title: "Info" description: "" images: [] draft: false menu: main weight: 3 type: "info" layout: "info" ---


Class RTPSessionStream
Inheritance
Inherited Members
Namespace: SIPSorcery.Net
Assembly: SIPSorcery.dll
Syntax
public class RTPSessionStream
Constructors
| Improve this Doc View SourceRTPSessionStream(SDPMediaTypesEnum, Int32, List<Int32>)
Creates a lightweight class to track an RTP stream within an RTP session. When supporting RFC3550 (the standard RTP specification) the relationship between an RTP stream and session is 1:1. For WebRTC and RFC8101 there can be multiple streams per session.
Declaration
public RTPSessionStream(SDPMediaTypesEnum mediaType, int payloadTypeID, List<int> remotePayloadIDs)
Parameters
| Type | Name | Description |
|---|---|---|
| SDPMediaTypesEnum | mediaType | The type of media for this stream. There can only be one stream per media type. |
| System.Int32 | payloadTypeID | The payload type ID set in RTP packets sent by us. |
| System.Collections.Generic.List<System.Int32> | remotePayloadIDs | The list of potential payload ID's that the remote party may use in RTP packets sent to us. Must be mutually exclusive across all streams in the same session. |
Properties
| Improve this Doc View SourceMediaType
Declaration
public SDPMediaTypesEnum MediaType { get; }
Property Value
| Type | Description |
|---|---|
| SDPMediaTypesEnum |
PayloadTypeID
The selected format (codec) ID from the type available in the media announcement.
Declaration
public int PayloadTypeID { get; }
Property Value
| Type | Description |
|---|---|
| System.Int32 |
SeqNum
Declaration
public ushort SeqNum { get; }
Property Value
| Type | Description |
|---|---|
| System.UInt16 |
Ssrc
Declaration
public uint Ssrc { get; }
Property Value
| Type | Description |
|---|---|
| System.UInt32 |
Methods
| Improve this Doc View SourceIsRemotePayloadIDMatch(Int32)
Checks whether the payload ID in an RTP packet received from the remote call party is in this stream's list.
Declaration
public bool IsRemotePayloadIDMatch(int remotePayloadID)
Parameters
| Type | Name | Description |
|---|---|---|
| System.Int32 | remotePayloadID | The payload ID set in the remote party's RTP header. |
Returns
| Type | Description |
|---|---|
| System.Boolean | True if the payload ID matches this stream. False if not. |
UpdateRemotePayloadIDs(List<Int32>)
Updates the remote payload IDs for this session media type.
Declaration
public void UpdateRemotePayloadIDs(List<int> remotePayloadIDs)
Parameters
| Type | Name | Description |
|---|---|---|
| System.Collections.Generic.List<System.Int32> | remotePayloadIDs | The new list of remote payload IDs to match against. |


--- title: People headline: DDD Resources bodyclass: docs resources layout: docs ---
The creators and drivers of the DDD ideas
The author of the DDD methodology. Domain linguist. The author of “Domain-Driven Design: Tackling Complexity in Software”.
Domain Model Whisperer. The author of “Implementing Domain-Driven Design” and “Domain-Driven Design Distilled”. Founder of Vlingo Platform.
Creator of CQRS and the driver of Event Sourcing. Founder of the Event Store.
The inventor of #EventStorming. Practicing engineer and a coach. The author of Introducing “EventStorming – An act of deliberate collective learning”.
And many more advancing the approach every day.


Thank you for your interest in Diyar Al Muharraq's Projects.
We will contact you as soon as possible.


 I use this to keep track of the animes I want to watch and the ones I've watched.
You can find my list below but feel free to create your own anime list.
(You can't edit this one because it's mine. Sign up to create your own!)
| English Title | Japanese Title | Year | ||
|---|---|---|---|---|
| {{ title.title }} | {{ title.japanese_title }} | {{ title.year }} | {{ title.status }} | {{ title.rating }} |


Important Update for 2020 Due to the COVID-19 pandemic, the R/Pharma conference for 2020 will be an online/virtual conference. The R/Pharma organizing committee is finalizing a new date and the logistics regarding calls for proposals and the infrastructure on hosting the conference. Please stay tuned for further updates on the conference via this web site and the R/Pharma twitter account. Thank you for your support!
R/Pharma is an ISC working group (www.r-consortium.org/projects/isc-working-groups) under the R Consortium. The conference is envisioned as a relatively small, scientifically & industry oriented, collegial event focused on the use of R in the development of pharmaceuticals. The conference will cover topics including reproducible research, regulatory compliance and validation, safety monitoring, clinical trials, drug discovery, research & development, PK/PD/pharmacometrics, genomics, diagnostics, immunogenicity and more. All will be discussed within the context of using R as a primary tool within the drug development process. The conference will showcase the current use of R that is helping to drive biomedical research, drug discovery & development, and clinical initiatives. (Note that topics related to the use of R in hospitals/clinics for patient care by clinicians, doctors, and researchers will likely be the focus of the upcoming R/Medicine conference.)
The conference will be a single track conference consisting of keynotes from renowned industry practitioners to key R developers to leading academics, pre-conference workshops and full-length presentations as well as a number of shorter, highly-energetic lightning talks.
R/Pharma is dedicated to providing a harassment-free conference experience for everyone regardless of gender, sexual orientation, disability or any feature that distinguishes human beings. For more information, please see the R Consortium code of conduct.


Master of Science in Computer Science with honors from Aalto University
3rd year student @ Feup
Python, C / C++
Machine Learning Research
Biometrics, Interpretability
and Computer-aided Diagnosis
September 2022 to Present: FEUP
October 2020 to Present: INESC TEC
July 2020 to September 2020: Feedzai
September 2019 to April 2020: Aalto University
Summer 2019: INESC TEC
Summer 2017: Armis Group
Jason Downing © 2015 - 2020. All rights reserved. Powered by Bootstrap.
Source on GitHub. Theme based on the Creative Bootstrap Theme by Start Bootstrap.


- GET_FROM_GALLERY - Static variable in class com.c301t3.c301t3app.NewTaskActivity
-
- getAddress() - Method in class com.c301t3.c301t3app.UserAccount
-
Returns teh address of the user
- GetAllTask() - Constructor for class com.c301t3.c301t3app.ElasticsearchController.GetAllTask
-
- getAssignee() - Method in class com.c301t3.c301t3app.Task
-
Getter for assignee's id
- getBids() - Method in class com.c301t3.c301t3app.Task
-
Method that gets the list of bids of the Task.
- getCurrUser() - Static method in class com.c301t3.c301t3app.ApplicationController
-
Gets the current user account logged in
- getDescription() - Method in class com.c301t3.c301t3app.Task
-
Method that returns the description of Tasks.
- getEmailAdd() - Method in class com.c301t3.c301t3app.UserAccount
-
Returns the email of the user
- getFirstName() - Method in class com.c301t3.c301t3app.UserAccount
-
Return the first name of the user
- getId() - Method in class com.c301t3.c301t3app.Task
-
Getter for id
- getID() - Method in class com.c301t3.c301t3app.UserAccount
-
Returns the unique ID of the account
- getItem(int) - Method in class com.c301t3.c301t3app.TasksRequestedAdapter
-
- getItemCount() - Method in class com.c301t3.c301t3app.TasksRequestedAdapter
-
- getLastName() - Method in class com.c301t3.c301t3app.UserAccount
-
Returns the last name of the user
- getLatitude() - Method in class com.c301t3.c301t3app.Task
-
Method that returns the latitude of Task.
- getLongitude() - Method in class com.c301t3.c301t3app.Task
-
Method that returns the longitude of Task.
- getName() - Method in class com.c301t3.c301t3app.Task
-
Method that returns the name of Tasks.
- getOwner() - Method in class com.c301t3.c301t3app.Task
-
Getter for owner
- getOwnerName() - Method in class com.c301t3.c301t3app.Task
-
Getter for owner's username
- getPassword() - Method in class com.c301t3.c301t3app.UserAccount
-
Returns the password of the user
- getPhoneNum() - Method in class com.c301t3.c301t3app.UserAccount
-
Returns the phone number of the user
- getPicture() - Method in class com.c301t3.c301t3app.Task
-
Method that reuturns the picture of Task.
- getPosition() - Method in class com.c301t3.c301t3app.TasksRequestedAdapter
-
- getPrice() - Method in class com.c301t3.c301t3app.Task
-
Method that returns the price of Tasks.
- getStatus() - Method in class com.c301t3.c301t3app.Task
-
Status that returns the description of Tasks.
- GetTask() - Constructor for class com.c301t3.c301t3app.ElasticsearchController.GetTask
-
- getTask(int) - Method in class com.c301t3.c301t3app.TaskList
-
Returns the task in the list at index i
- GetTaskByAssignee() - Constructor for class com.c301t3.c301t3app.ElasticsearchController.GetTaskByAssignee
-
- GetTaskByOwner() - Constructor for class com.c301t3.c301t3app.ElasticsearchController.GetTaskByOwner
-
- getTaskList() - Method in class com.c301t3.c301t3app.TaskList
-
Return the entire arrayList
- getTasks() - Method in class com.c301t3.c301t3app.TaskPasser
-
Get the ArrayList passed, ALL the items
- GetUserByID() - Constructor for class com.c301t3.c301t3app.ElasticsearchController.GetUserByID
-
- GetUserByUsername() - Constructor for class com.c301t3.c301t3app.ElasticsearchController.GetUserByUsername
-
- getUserId() - Method in class com.c301t3.c301t3app.Bid
-
Return the user id of the bidder
- getUsername() - Method in class com.c301t3.c301t3app.UserAccount
-
Return the username of the user
- getValue() - Method in class com.c301t3.c301t3app.Bid
-
Return the value of the bid
- goToMap(View) - Method in class com.c301t3.c301t3app.NewTaskActivity
-
The method is used to launch an activity to pick out coordinates
from google maps by the click of the "map" icon
- goToMap(View) - Method in class com.c301t3.c301t3app.SelectedTaskActivity
-
The method is used to launch an activity to view the location of the tasks
from google maps by the click of the "map" icon


{% load staticfiles %}
Overnight.asia | Hotel & Property Dashboard
Hi, {{request.user.first_name}}
Logout
Property Dashboard
From
To
{% for hotel in hotels%}
{{hotel.hotelName}}
{% endfor %}
Update
{% for hotel in hotels%}
{{hotel.hotelName}}
{% endfor %}
Check Availability


always room for improvement.mp3
call that a fair fight.mp3
enemy teleporter dest.mp3
enemy turret destroyed.mp3
feeling right at home.mp3
i could use some armor.mp3
i feel like a new man.mp3
i guess its on me now.mp3
im not one for standing around.mp3
im putting out a bounty.mp3
im staking my claim on the.mp3
ive secured the payload.mp3
just what the doctor ordered.mp3
mans gotta have rules.mp3
theres gotta be a teleporter.mp3
thought i was a goner.mp3
we could really use a tank.mp3
well its high noon somewhere.mp3
you gotta work on that.mp3


| [Overview][Types][Classes] |
uses |
Classes, |
SysUtils; |
The uWordList unit contains a TWordList class that implements a basic DAWG (Directed Acyclic Word Graph). While this class was not created explicitly for use with pLua it provides a fast word searching ability that we really need within a scripting engine. One of the advantages of this implementation are that it allows for data to be attached to a word or a letter within a word.
In reality, you don't need to pay attention to this unit at all. The help file has been placed here in case you find need for a fast word manager within your project, and because the pLuaObject methods and types make use of the TWordList class.


Class-02
Introduce myself
my name is obada al matrami i`m 27 years old i really love BMW it`s,
my favorite cars company
and i love coding and solving puzzle also i love gaming.
nice to meet you all guys thank you all.
if you want to solve any problem :
As you know i want to look to my laptop so That`s Great.
Do obada love coding?
which is the most car company obada love ?
when the first time obada drive his first car ?
which is the most country do obada love ?
where does obada live ?
my favorite movies
- seven pounds
- the pursuit of happiness
- alita battle angel
- transformers
- shawshank redemption
- fast and furious
- me before you
- Thor
- the pirates of the caribbean
- john wick
Top ten places to visit
- Maldive
- Turkey
- Brazil
- Jordan-petra
- Wild Coast, South Africa
- Komodo National Park, Indonesia
- The Ring Road and northern lights, Iceland
- Italy
- Sydney, Australia
- New York City, USA


Router
Extends:
Backbone.Router - Provides methods for routing client-side pages, and connecting them to actions and events.
(http://backbonejs.org/#Router)
Web applications often provide linkable, bookmarkable, shareable URLs for important locations in the app. Until recently, hash fragments (#page) were used to provide these permalinks, but with the arrival of the History API, it's now possible to use standard URLs (/page). Backbone.Router provides methods for routing client-side pages, and connecting them to actions and events. For browsers which don't yet support the History API, the Router handles graceful fallback and transparent translation to the fragment version of the URL.
During page load, after your application has finished creating all of its routers, be sure to call Backbone.history.start() or Backbone.history.start({pushState: true}) to route the initial URL.
routes - router.routes The routes hash maps URLs with parameters to functions on your router (or just direct function definitions, if you prefer), similar to the View's events hash. Routes can contain parameter parts, :param, which match a single URL component between slashes; and splat parts *splat, which can match any number of URL components. Part of a route can be made optional by surrounding it in parentheses (/:optional).
For example, a route of "search/:query/p:page" will match a fragment of #search/obama/p2, passing "obama" and "2" to the action.
A route of "file/*path" will match #file/nested/folder/file.txt, passing "nested/folder/file.txt" to the action.
A route of "docs/:section(/:subsection)" will match #docs/faq and #docs/faq/installing, passing "faq" to the action in the first case, and passing "faq" and "installing" to the action in the second.
Trailing slashes are treated as part of the URL, and (correctly) treated as a unique route when accessed. docs and docs/ will fire different callbacks. If you can't avoid generating both types of URLs, you can define a "docs(/)" matcher to capture both cases.
When the visitor presses the back button, or enters a URL, and a particular route is matched, the name of the action will be fired as an event, so that other objects can listen to the router, and be notified. In the following example, visiting #help/uploading will fire a route:help event from the router.
Example:
routes: {
"help/:page": "help",
"download/*path": "download",
"folder/:name": "openFolder",
"folder/:name-:mode": "openFolder"
}
router.on("route:help", function(page) {
...
});
Old extend - Backbone.Router.extend(properties, [classProperties])
Get started by creating a custom router class. Define actions that are triggered when certain URL fragments are
matched, and provide a routes hash that pairs routes to actions. Note that you'll want to avoid using a leading
slash in your route definitions:
var Workspace = Backbone.Router.extend({
routes: {
"help": "help", // #help
"search/:query": "search", // #search/kiwis
"search/:query/p:page": "search" // #search/kiwis/p7
},
help: function() {
...
},
search: function(query, page) {
...
}
});
Converting the above example to ES6 using a getter method for `routes`:
class Workspace extends Backbone.Router {
get routes() {
return {
"help": "help", // #help
"search/:query": "search", // #search/kiwis
"search/:query/p:page": "search" // #search/kiwis/p7
};
}
help() {
...
},
search(query, page) {
...
}
}
Basic default "no route router":
new Backbone.Router({ routes: { '*actions': 'defaultRoute' } });
Constructor Summary
| Public Constructor | ||
| public |
constructor(options: object) When creating a new router, you may pass its routes hash directly as an option, if you choose. |
Method Summary
| Public Methods | ||
| public |
Execute a route handler with the provided parameters. |
|
| public abstract |
Initialize is an empty function by default. |
|
| public |
Simple proxy to |
|
| public |
Manually bind a single named route to a callback. |
Public Constructors
public constructor(options: object) source
When creating a new router, you may pass its routes hash directly as an option, if you choose. All options will also be passed to your initialize function, if defined.
Params:
| Name | Type | Attribute | Description |
| options | object | Optional parameters which may contain a "routes" object literal. |
Public Methods
public execute(callback: function, args: *[], name: string) source
Execute a route handler with the provided parameters. This is an excellent place to do pre-route setup or post-route cleanup.
public abstract initialize() source
Initialize is an empty function by default. Override it with your own initialization logic.
public navigate(fragment: string, options: object): Router source
Simple proxy to Backbone.history
to save a fragment into the history.


The next section of your CWA Pay Stub will provide the gross amount of your pay stub, as well the taxes and deductions withheld from your pay, and finally the amount of the net pay you will be receiving.
| Type | Amount | Year to date |
|---|---|---|
| Gross | $2,706.08 | $52,406.31 |
| Taxable Gross | $2,706.08 | $52,406.31 |
| Total Taxes and Deductions | $1,008.78 | $20,849.18 |
| Net | $1,697.30 | $31,557.13 |
Continue below to find a detailed breakdown of the main sections of the pay stub.
When in CWA, clicking on Help will provide you with some useful information. For example, in this section, clicking on Help will display a detailed description of each type of entitlement or deduction.
Total amount of money you earned before deductions.
Gross amount that is taxable on your payment. Note this amount might be different to your gross amount.
Total amount of mandatory and other deductions which will be withheld from your payment.
Amount you will receive after taxes and deductions. This is the amount which will be deposited into your account.


My Constituency
Share Who Targets Me with your friends to support fair and transparent campaigning.
Official Party Pages
National Statistics
| Adverts | Party |
|---|
The results above are based on adverts, shown to volunteers. The results are skewed to the demographics of our volunteers and are thus not representative of the UK.
Official Party Pages
Targeting You
| Adverts | Photo | Advertiser |
|---|
The data above shows the number of political adverts the Who Targets Me extension has logged in your newsfeed. We are currently in the process of filtering the data and will be displaying local candidates/parties soon.
One sec
There are some errors
Thanks for volunteering, did you know that campaigns spent over £1.3m on Facebook advertising during the 2015 general election?
Thanks to people like you, we're a step closer to understanding the reach and messages being used in the era of dark advertising.


Note 1 : Recommended statistics for this type of classification highlighted in aqua
Note 2 : The recommender system assumes that the input is the result of classification over the whole data rather than just a part of it. If the confusion matrix is the result of test data classification, the recommendation is not valid.
| Actual | Predict
|
| Class | D003920 | D006262 | Description |
| ACC | 0.87857 | 0.87857 | Accuracy |
| AGF | 0.86697 | 0.87487 | Adjusted F-score |
| AGM | 0.88368 | 0.85934 | Adjusted geometric mean |
| AM | -2 | 2 | Difference between automatic and manual classification |
| AUC | 0.87016 | 0.87016 | Area under the ROC curve |
| AUCI | Very Good | Very Good | AUC value interpretation |
| AUPR | 0.84119 | 0.90176 | Area under the PR curve |
| BCD | 0.00357 | 0.00357 | Bray-Curtis dissimilarity |
| BM | 0.74031 | 0.74031 | Informedness or bookmaker informedness |
| CEN | 0.58015 | 0.42693 | Confusion entropy |
| DOR | 48.75 | 48.75 | Diagnostic odds ratio |
| DP | 0.93063 | 0.93063 | Discriminant power |
| DPI | Poor | Poor | Discriminant power interpretation |
| ERR | 0.12143 | 0.12143 | Error rate |
| F0.5 | 0.84586 | 0.89862 | F0.5 score |
| F1 | 0.84112 | 0.90173 | F1 score - harmonic mean of precision and sensitivity |
| F2 | 0.83643 | 0.90487 | F2 score |
| FDR | 0.15094 | 0.10345 | False discovery rate |
| FN | 18 | 16 | False negative/miss/type 2 error |
| FNR | 0.16667 | 0.09302 | Miss rate or false negative rate |
| FOR | 0.10345 | 0.15094 | False omission rate |
| FP | 16 | 18 | False positive/type 1 error/false alarm |
| FPR | 0.09302 | 0.16667 | Fall-out or false positive rate |
| G | 0.84116 | 0.90175 | G-measure geometric mean of precision and sensitivity |
| GI | 0.74031 | 0.74031 | Gini index |
| GM | 0.86938 | 0.86938 | G-mean geometric mean of specificity and sensitivity |
| IBA | 0.70015 | 0.81147 | Index of balanced accuracy |
| IS | 1.13833 | 0.54548 | Information score |
| J | 0.72581 | 0.82105 | Jaccard index |
| LS | 2.20126 | 1.4595 | Lift score |
| MCC | 0.74295 | 0.74295 | Matthews correlation coefficient |
| MCCI | Strong | Strong | Matthews correlation coefficient interpretation |
| MCEN | 0.78536 | 0.62272 | Modified confusion entropy |
| MK | 0.74561 | 0.74561 | Markedness |
| N | 172 | 108 | Condition negative |
| NLR | 0.18376 | 0.11163 | Negative likelihood ratio |
| NLRI | Fair | Fair | Negative likelihood ratio interpretation |
| NPV | 0.89655 | 0.84906 | Negative predictive value |
| OC | 0.84906 | 0.90698 | Overlap coefficient |
| OOC | 0.84116 | 0.90175 | Otsuka-Ochiai coefficient |
| OP | 0.83626 | 0.83626 | Optimized precision |
| P | 108 | 172 | Condition positive or support |
| PLR | 8.95833 | 5.44186 | Positive likelihood ratio |
| PLRI | Fair | Fair | Positive likelihood ratio interpretation |
| POP | 280 | 280 | Population |
| PPV | 0.84906 | 0.89655 | Precision or positive predictive value |
| PRE | 0.38571 | 0.61429 | Prevalence |
| Q | 0.9598 | 0.9598 | Yule Q - coefficient of colligation |
| RACC | 0.14602 | 0.38173 | Random accuracy |
| RACCU | 0.14603 | 0.38175 | Random accuracy unbiased |
| TN | 156 | 90 | True negative/correct rejection |
| TNR | 0.90698 | 0.83333 | Specificity or true negative rate |
| TON | 174 | 106 | Test outcome negative |
| TOP | 106 | 174 | Test outcome positive |
| TP | 90 | 156 | True positive/hit |
| TPR | 0.83333 | 0.90698 | Sensitivity, recall, hit rate, or true positive rate |
| Y | 0.74031 | 0.74031 | Youden index |
| dInd | 0.19087 | 0.19087 | Distance index |
| sInd | 0.86503 | 0.86503 | Similarity index |
Generated By PyCM Version 2.4


Online version can be found here:
https://ay1920s2-cs2103t-f10-2.github.io/main/UserGuide.html
By: CS2103T-F10-2
Since: Feb 2020
Licence: MIT
- 1. Introduction
- 2. Quick Start
- 3. Key Information
- 4. Commands
- 4.1. Viewing offline user guide:
help
- 4.2. Viewing unarchived
internship applications:
list
- 4.3. Viewing archived
internship applications:
archival
- 4.4. Selecting an
internship application to display:
select
- 4.5. Adding an internship
application:
add
- 4.6. Deleting internship
application:
delete
- 4.7. Archiving internship
application:
archive
- 4.8. Unarchiving
internship application:
unarchive
- 4.9. Editing an internship
application:
edit
- 4.10. Locating internship
applications:
find
- 4.11. Sorting internship
companies by field:
sort
- 4.12.
Modifying an interview in an internship application:
interview
- 4.13.
Getting applications due or have interviews in 7 days:
reminder
- 4.14. Clearing all entries:
clear
- 4.15. Retrieving statistics:
stats
- 4.16. Exiting the program:
exit
- 4.17. Saving the data
- 4.1. Viewing offline user guide:
- 5. FAQ
- 6. Command Summary
- 7. Glossary
1. Introduction
Internship Diary is a desktop application that assists university students in managing their internship applications.
With the Internship Diary, you can leave behind your troubling times trying to to organize, track, and review all your past and upcoming internship applications. The application is designed and optimized for users who can type quickly, and provides an elegant design which is easy on the eyes.
2. Quick Start
Here are the steps to get you started on using Internship Diary:
-
Ensure you have Java
11
or above installed in your Computer. -
Copy the file to the folder you want to use as the home folder for your Internship Diary.
-
Double-click the file to start the app. The Graphical User Interface (GUI) should appear in a few seconds.
Figure 1. Graphical User Interface of Internship Diary -
Test the application by typing the command
help
in the command box and pressing Enter to execute it. This should open the help window. -
Refer to Section 4, “Commands” to find out what other commands you can use on Internship Diary.
3. Key Information
Here are some important information you should know.
3.1. Graphical user interface
The above image illustrates the major graphical components of Internship Diary to help you navigate our application.
3.2. Structure of internship application
| Field | Prefix | Can Be Empty? | Max Number of Values | Remarks |
|---|---|---|---|---|
|
Company |
c/ |
No |
1 |
No restrictions on input. |
|
Role |
r/ |
No |
1 |
No restrictions on input. |
|
Address |
a/ |
Yes |
1 |
No restrictions on input. |
|
Phone |
p/ |
Yes |
1 |
"+" at the start is optional. Must have between 4 and 15 digits if not empty. |
|
|
e/ |
Yes |
1 |
Email should be of format "LOCAL@DOMAIN". LOCAL consists of at least 1 character. DOMAIN starts and ends with alphanumeric characters, and consists of alphanumeric characters, periods or hyphens for the characters in between. E.g<EMAIL_ADDRESS>|
|
Application Date |
d/ |
Yes |
1 |
Must be a valid date of the
form |
|
Priority |
w/ |
No |
1 |
Must be an integer from 0 to 10 (inclusive). If left empty, default to 5. |
|
Status |
s/ |
No |
1 |
Possible values listed in Section 3.3, “Valid status”. The first letter of the Status can be used to input the respective Status values. |
|
Interviews |
Not applicable |
Yes |
No limits |
See below, Section 3.4, “Structure of interview” |
3.3. Valid status
The following are the valid statuses for internship application, listed in sort order:
1. |
|
An internship application that you are planning to apply for. |
2. |
|
An internship application that you have already applied for. |
3. |
|
An internship application that you have applied to, and have been invited to an interview. |
4. |
|
An internship application that you have received a job offer for. |
5. |
|
An internship application that you have been rejected for. |
6. |
|
An internship application that you have heard no reply from for a long time. |
3.4. Structure of interview
-
Interview
represents an interview that you have been given by the company you are applying to. It exists within anInternshipApplication
-
Currently there are two types of
Interview
provided by the Internship Diary:-
Online Interview — No address is needed.
-
Offline Interview — Address must be provided when interview is added or modified from online to offline.
-
-
You can specify what type of interview you want to add by using the
o/IS_ONLINE
prefix. -
In order to facilitate your tracking of interviews, there are no restriction to what
InternshipApplication
you can add your interview to.
Therefore, it is possible for you to add an interview to anInternshipApplication
with any status.-
This is so that just in case you forgot to record an interview after you already got offered or rejected, you could still add it into the Internship Diary for your personal tracking.
-
In v2.0, we will create a prompt on whether you want to automatically change your
InternshipApplication
status to 'interview'.
-
| Field | Prefix | Can Be Empty? | Max Number of Values | Remarks |
|---|---|---|---|---|
|
isOnline |
o/ |
No |
1 |
Can only be
|
|
Interview Date |
d/ |
No |
1 |
Must be a valid date of the
form |
|
Interview Address |
a/ |
online: yes offline: compulsory |
1 |
No restrictions on input. |
3.5. Command format
-
Words in
UPPER_CASE
are the parameters to be supplied by the user.
(e.g. inadd n/COMPANY_NAME
,COMPANY_NAME
is a parameter which can be used asadd c/Google
) -
Items in square brackets are optional.
(e.gc/COMPANY_NAME [w/PRIORITY]
can be used asc/Google w/5
or asc/Google
) -
Items with
…
after them can be used multiple times including zero times.
(e.g.delete INDEX, [INDEX],…
can be used asdelete 1
ordelete 1, 2, 3
) -
Parameters can be entered in any order.
(e.g. if the command specifiess/STATUS r/ROLE
,r/designer s/applied
is also acceptable) -
An input consisting of only spaces is considered empty.
3.6. Viewing command history
Use the up
and down
arrow keys while the command box is being focused
to scroll through your command history.
3.7. Other important information
3.7.1. Index of an internship application
-
We will use
INDEX
to refer to a particular internship application.-
INDEX
can be found on the left side of an internship application card. -
INDEX
will start from 1 (inclusive). -
INDEX
is not unique to a particular internship application — it will change as the list is updated. -
INDEX
only serves as a reference for you to choose the correct internship application.
-
-
For any command that uses
INDEX
:-
INDEX
must be among those displayed in the current list.-
For example, if the current list displays
INDEX
1 to 10,INDEX
11 will not be considered valid.
-
-
3.7.2. Multiple fields
-
Commands that contain fields (see: Section 3.2, “Structure of internship application”) will be able to take in multiple entry of each field (except
sort
which only allows one field). -
However, when multiple fields are inputted, eg.
c/Google c/Facebook
, only the last field will be recognised by the application. In the example above, onlyc/Facebook
will be registered,c/Google
will be ignored by the application.
3.7.3. Command availability
-
Commands will work on both main list and archival list.
-
The exceptions are:
Archive
,Unarchive
,Reminder
-
3.7.4. Colored internship applications
-
Some internship applications in the list may be colored green or red. This is what each color means:
-
Internship applications colored green indicates that there is an upcoming application deadline or interviews for that internship application.
-
Internship applications colored red indicates that the internship application’s status is
ghosted
and you might want to take action to keep the list relevant.
-
4. Commands
4.1.
Viewing offline user guide: help
Format: help
4.2.
Viewing unarchived internship applications: list
Displays unarchived internship applications. This is known as your main list.
Format: list
4.3.
Viewing archived internship applications: archival
Displays archived internship applications. This is known as your archival list.
Format: archival
4.4.
Selecting an internship application to display: select
Selects an internship application to display on the right panel of the internship diary.
Only one internship application may be selected at any point in time.
| Alternatively, you may use your mouse to click on a specific internship application on the left panel of the internship diary. |
Format: select INDEX
Example(s):
-
select 1
4.5.
Adding an internship application: add
Adds an internship application to the current list.
Format: add c/COMPANY r/ROLE d/DATE s/STATUS [p/PHONE] [e/EMAIL] [a/ADDRESS]
[w/PRIORITY]
Refer to Section 3.2, “Structure of internship application” for details about the input constraints.
Examples:
-
add c/Microsoft r/software engineer d/01 01 2020 s/rejected
-
add c/Google r/Software Engineer d/20 02 2020 s/applied p/91234567<EMAIL_ADDRESS>a/123 Orchard Road
4.6.
Deleting internship application: delete
Deletes internship application from the current list.
Formats:
-
delete INDEX
-
delete INDEX, [INDEX],…
-
delete s/STATUS [STATUS]…
Example(s):
-
list
delete 2
Deletes the 2nd internship application from the main list. -
list
delete 1, 2, 3
Deletes the 1st, 2nd, and 3rd internship applications from the main list. -
archival
delete s/applied
Deletes all the internship application(s) with theapplied
status from the archival list. -
archival
delete s/applied rejected
Deletes all the internship application(s) with theapplied
orrejected
status from the archival list.
4.7.
Archiving internship application: archive
Moves internship application from the main list to the archival
list.
Formats:
-
archive INDEX
-
archive INDEX, [INDEX],…
-
archive s/STATUS [STATUS]…
Example(s):
-
list
archive 2
Archives the 2nd internship application in the main list. -
list
archive 1, 2, 3
Archives the 1st, 2nd, and 3rd internship application in the main list. -
list
archive s/applied
Archives all the internship application(s) with theapplied
status in the main list. -
list
archive s/applied rejected
Archives all the internship application(s) with theapplied
orrejected
status in the main list.
4.8.
Unarchiving internship application: unarchive
Moves internship application from the archival list to the main
list.
Formats:
-
unarchive INDEX
-
unarchive INDEX, [INDEX],…
-
unarchive s/STATUS [STATUS]…
Example(s):
-
archival
unarchive 2
Unarchives the 2nd internship application in the archival list. -
archival
unarchive 1, 2, 3
Unarchives the 1st, 2nd, and 3rd internship application in the archival list. -
archival
unarchive s/applied
Unarchives all the internship application(s) with theapplied
status in the archival list. -
archival
unarchive s/applied rejected
Unarchives all the internship application(s) with theapplied
orrejected
status in the archival list.
4.9.
Editing an internship application: edit
Edits an internship application in the internship diary.
Format: edit INDEX [c/COMPANY] [r/ROLE] [d/DATE] [s/STATUS] [p/PHONE] [e/EMAIL]
[a/ADDRESS] [w/PRIORITY]
Examples:
-
edit 1 s/applied r/Product Management
Edits the status and role of the internship application to beapplied
andProduct Management
respectively.
4.10.
Locating internship applications: find
Finds all internship application(s) with the specified fields containing any of the given keywords.
| The find parameters will appear at the bottom left of the internship diary |
Format: find [KEYWORDS] [c/COMPANY] [r/ROLE] [a/ADDRESS] [p/PHONE] [e/EMAIL] [d/DATE]
[w/PRIORITY] [s/STATUS]
Example(s):
-
find Google
Lists internship application(s) with companyGoogle
OR with<EMAIL_ADDRESS>.
-
find c/Google s/applied
Lists internship application(s) with companyGoogle
AND statusapplied
.
4.11.
Sorting internship companies by field: sort
Sort displayed internship companies based on a given FIELD.
| The sort parameters will appear at the bottom left of the internship diary |
Type reverse
before FIELD
to sort in the reverse order.
Format: sort [reverse] FIELD
.
Available values for FIELD
:
c/
: Sorts by company name (Dictionary Order).
d/
: Sorts by application date (Chronological Order).
r/
: Sorts by role (Dictionary Order).
s/
: Sorts by status (Refer to Section 3.3, “Valid
status”).
w/
: Sorts by priority level (Ascending Order).
Examples:
-
Sort c/
Returns a list of currently displayed companies sorted by company name.
4.12.
Modifying an interview in an internship application: interview
Add, list, edit or delete interviews within an internship application
|
An interview must contain a date and a boolean (true or false) that represents whether
an interview is conducted online or not. If the interview is not conducted online, an additional address field must be provided. See Section 3.4, “Structure of interview” for more information. |
Format:
-
Overview
interview INTERNSHIP_INDEX COMMAND_WORD [INTERVIEW_INDEX] [a/ADDRESS] [d/DATE] [o/IS_ONLINE]
-
Specific format of each
COMMAND_WORD
:-
Add interview
interview INTERNSHIP_INDEX add d/DATE o/IS_ONLINE [a/ADDRESS]
-
Address field
a/ADDRESS
is listed as optional here as online interview do not require an address but offline interview does.
-
-
List interview
interview INTERNSHIP_INDEX list
-
Edit interview
interview INTERNSHIP_INDEX edit INTERVIEW_INDEX [a/ADDRESS] [d/DATE] [o/IS_ONLINE]
-
If you are editing an online interview into an offline interview, Address field
a/ADDRESS
is a requirement.
-
-
Delete interview
interview INTERNSHIP_INDEX delete INTERVIEW_INDEX
-
Examples:
-
list
interview 2 list
Lists all interviews in the 2nd internship application in the list
-
interview 2 add o/false d/05 02 2020 a/Raffles City #02-22
Adds an interview to the 2nd internship application in the list.
-
interview 2 list
interview 2 edit 1 d/05 05 2020
Edits the date of the 1st interview in the 2nd internship application in the list to05 05 2020
.
-
interview 2 list
interview 2 delete 3
Deletes the 3rd interview in the 2nd internship application in the list.
4.13.
Getting applications due or have interviews in 7 days: reminder
Displays all internship application(s) that:
-
have status
wishlist
and need to be submitted in 7 days -
have status
interview
and interviews scheduled in 7 days
The applications will be displayed in order of earliest application date or scheduled interview date followed by those with later dates.
This command helps to remind you of applications which you might want to focus on first, so that you do not miss submission deadlines or any upcoming interviews.
Format: reminder
reminder can be used anytime, but it does not work on archived
applications.
|
Any command after reminder will be ignored.e.g. reminder dummy variable be just be treated as reminder
|
4.14.
Clearing all entries: clear
Clears all entries from the Internship Diary.
Format: clear
4.15.
Retrieving statistics: stats
Displays the statistics about your internship application(s) on the current list.
It will open a separate window that contains a bar chart and a pie chart.
The statistics will dynamically update as you modify the current list (e.g. switching between main and archival list).
Format: stats
| Alternatively, you may use your mouse to click on "Statistics" and then "View Statistics" to bring up the statistics window. |
4.16.
Exiting the program: exit
Exits the program.
Format: exit
4.17. Saving the data
Internship Diary is saved in the hard disk automatically after any command that changes the data.
There is no need to save manually.
5. FAQ
Q: How do I transfer my data to another Computer?
A: Install the app in the other computer and overwrite the empty data file it
creates with the file that contains the data of your previous Internship Diary folder.
Q: What happens if I directly change the data stored in the hard drive?
A: The application cannot guarantee the integrity of your data if you tamper with
the file in the storage.
6. Command Summary
-
Help :
help
-
List :
list
-
Archival :
archival
-
Select :
select INDEX
-
Add
add c/COMPANY r/ROLE d/DATE s/STATUS [p/PHONE] [e/EMAIL] [a/ADDRESS] [w/PRIORITY]
e.g.add c/Google r/Software engineer s/wishlist d/10 10 2010
-
Delete :
delete INDEX
e.g.delete 1
-
Archive :
archive INDEX
e.g.archive 1
-
Unarchive :
unarchive INDEX
e.g.unarchive 1
-
Edit :
edit INDEX [c/COMPANY] [r/ROLE] [d/DATE] [s/STATUS] [p/PHONE] [e/EMAIL] [a/ADDRESS] [w/PRIORITY]
e.g.edit 2 c/Google s/applied
-
Find :
find [KEYWORDS] [c/COMPANY] [r/ROLE] [a/ADDRESS] [p/PHONE] [e/EMAIL] [d/DATE] [w/PRIORITY] [s/STATUS]
e.g.find c/google r/engineer
-
Sort :
sort FIELD
e.g.sort c/
-
Interview :
-
Add:
interview INTERNSHIP_INDEX add d/DATE o/IS_ONLINE [a/ADDRESS]
e.g.interview 1 add d/20 12 2020 o/true
-
List:
interview INTERNSHIP_INDEX list
e.g.interview 1 list
-
Edit:
interview INTERNSHIP_INDEX edit INTERVIEW_INDEX [a/ADDRESS] [d/DATE] [o/IS_ONLINE]
e.g.interview 1 edit 1 d/10 10 2020
-
Delete:
interview INTERNSHIP_INDEX delete INTERVIEW_INDEX
e.g.interview 1 delete 1
-
-
Reminder :
reminder
-
Clear :
clear
-
Statistics :
stats
-
Exit :
exit
7. Glossary
-
Alphanumerical
-
Either a letter of the English language (a-z, A-Z) or a Roman numeral (0-9).
-
-
Chronological order
-
The order of events in which events which occurred earlier would be placed before events which occurred later.
-
-
Dictionary order:
-
The order which words would be ordered in a dictionary.
-


Republic of Ireland can beat anyone in Euro 2020 play-offs, claims confident McCarthy
by OmnisportMick McCarthy remains confident his Republic of Ireland squad can book a place at Euro 2020 despite missing out on automatic qualification.
Ireland were held to a 1-1 draw in Monday's must-win qualifier against Denmark at the Aviva Stadium to finish third in Group D, three points behind their opponents.
Matt Doherty headed home five minutes from time to cancel out Martin Braithwaite's 73rd-minute opener, but McCarthy's men must settle for a play-off spot.
A one-legged semi-final and final will be played in March and McCarthy believes his side are in with a shot, provided they replicate their performance against Denmark.
"We can beat anyone in the play-offs," he told Sky Sports.
"The players will go back to their clubs and we don't have a game until March. I'll be getting round them and reminding them it has been a good campaign and that we can play like that, so why not play like that in March."
Ireland lost only one of their eight qualifiers - a 2-0 reverse to Switzerland last month - and McCarthy was full of praise for his players after the draw with the Danes in Dublin.
"I am immensely proud of them," he said. "They pushed Denmark right to the limit. If my players and my team leave everything on the pitch, I will take the result as it comes so I will have to take this.
"You just need that bit of luck. We had opportunities but I am not going to criticise the lads because they've been brilliant. We lost one game out of eight so I'm very proud of them."
Denmark are now unbeaten in 17 qualifying matches since October 2016 and can look forward to next year's tournament, having failed to qualify last time around.
Age Hareide's men managed just two attempts on target against Ireland, however, and goalkeeper Kasper Schmeichel admitted his side were "terrible".
"It was dramatic enough," he told Sky Sports. "There wasn't a lot of quality from both sides - it was a cagey and tight affair.
"We were terrible. We didn't hit anything we tried to today and we had to rely on our grit and determination. We needed it today as we were under a lot of pressure."
Denmark have faced Ireland six times since 2017 and have not lost any of those meetings, but Schmeichel feels the hosts are improving.
"This is the best Ireland have been against us," Schmeichel added. "We had to ride our luck at times, but you need that when you're fighting for qualification."


Version control keeps your work saved at many different points to allow you to look back at changes you've made previously and see how they've affected your code.
If mistakes were made it allows you to go back to a previous version and see where you went wrong, and when working on code that has gone live it allows you to keep working code running while you make changes. It also will keep you from losing massive amounts of work if your machine crashes...
My intro to HTML was like falling in the deep end of a pool. It was my first real experience with any kind of real code.
I was unable to do some of the things I had originally planned for the webpages, so I found alternatives to them. I learned quite a few new elements to HTML, mostly things associated with linking images and other webpages to an existing page. It was nice to be able to have an idea in your head of how you wanted something to look and work....
The margin, border, and padding are aspects of each HTML element. That is, they define the spacing around each and every part of a webpage.
They are used in conjunction with positioning to keep a site from getting cluttered, as well as ensuring it has a good flow to it. Without these aspects, everything on the page would be butting up against one another....
Ruby has two similar data structures, arrays and hashes, that at first glance look quite similar.
Both contain multiple items, such as integers (whole numbers), floats (numbers with decimal points), and strings (words). The main difference, however, is that a hash contains paired values (such as a name paired with an address)....
The enumerable module in Ruby puts many new methods at your disposal.
The .inject method is used, in its simplest form, to input something between each element in an array....
Ruby has this wonderful way to organize your code into neat segments of code called classes.
 It also keeps them from being acted upon by code outside of the class, unless of course you so desire...
Looping, also known as iterating, is a fundamental concept in any programming language. It is used to go through a set of data and apply some block of code to every element it is told to.
There are many way to iterate through code so let's look at an example in each of the two languages and see how they compare...
The Internet is a very complicated thing. It is what connects the world, far more than any other medium.
We all use it (all the time), but do we really have an understanding of how it works? I'll try to break it down a little and explain the many processes behind it....
I started this website in my first couple weeks in Dev Bootcamp. It looked like something out of the mid 1990's.
It was just a framework of HTML, there was no styling or flow to it, just some raw text. Since then it has come a long way, I've used CSS to add some color and positioning to it...