java -version
.python --version
.tar -xvf apache-cassandra-3.6-bin.tar.gz cassandra
The files will be extracted into apache-cassandra-3.6
, you need to substitute 3.6 with the release number that you
have downloaded.
apache-cassandra-3.6\bin
to your path.bin/cassandra -f
from the command line. Press “Control-C” to stop
Cassandra. Start Cassandra in the background by invoking bin/cassandra
from the command line. Invoke kill pid
or pkill -f CassandraDaemon
to stop Cassandra, where pid is the Cassandra process id, which you can find for
example by invoking pgrep -f CassandraDaemon
.bin/nodetool status
from the command line.conf
sub-directory.logs
and data
sub-directories respectively.
Older versions defaulted to /var/log/cassandra
and /var/lib/cassandra
. Due to this, it is necessary to either
start Cassandra with root privileges or change conf/cassandra.yaml
to use directories owned by the current user,
as explained below in the section on changing the location of directories./etc/apt/sources.list.d/cassandra.sources.list
, for example for version
3.6:echo "deb https://downloads.apache.org/cassandra/debian 36x main" | sudo tee -a /etc/apt/sources.list.d/cassandra.sources.list
curl https://downloads.apache.org/cassandra/KEYS | sudo apt-key add -
sudo apt-get update
GPG error: http://www.apache.org 36x InRelease: The following signatures couldn't be verified because the public key is not available: NO_PUBKEY A278B781FE4B2BDA
Then add the public key A278B781FE4B2BDA as follows:
sudo apt-key adv --keyserver pool.sks-keyservers.net --recv-key A278B781FE4B2BDA
and repeat sudo apt-get update
. The actual key may be different, you get it from the error message itself. For a
full list of Apache contributors public keys, you can refer to this link.
sudo apt-get install cassandra
sudo service cassandra start
and stop it with sudo service cassandra stop
.
However, normally the service will start automatically. For this reason be sure to stop it if you need to make any
configuration changes.nodetool status
from the command line./etc/cassandra
./var/log/cassandra/
and /var/lib/cassandra
.


Notes for Machine Learning - Week 4
Contents
Neural Networks: Representation
Motivations
Non-linear Hypotheses
Performing linear regression with a complex set of data with many features is very unwieldy. For 100 features, if we wanted to make them quadratic we would get 5050 resulting new features.
We can approximate the growth of the number of new features we get with all quadratic terms with $\mathcal{O}(n^2/2)$
. And if you wanted to include all cubic terms in your hypothesis, the features would grow asymptotically at $\mathcal{O}(n^3)$
. These are very steep growths, so as the number of our features increase, the number of quadratic or cubic features increase very rapidly and becomes quickly impractical.
Example: let our training set be a collection of 50x50 pixel black-and-white photographs, and our goal will be to classify which ones are photos of cars. Our feature set size is then n=2500 if we compare every pair of pixels (7500 if RGB). Now let’s say we need to make a quadratic hypothesis function. With quadratic features, our growth is $\mathcal{O}(n^2⁄2)$. So our total features will be about 25002/2=3125000, which is very impractical.
Neurons and the Brain
Origins: Algorithms that try to mimic the brain.
- Was very widely used in 80s and early 90s; popularity diminished in late 90s.
- Recent resurgence: State-of-the-art technique for mant applications
The “one learning algorithm” hypothesis
There is evidence that the brain uses only one “learning algorithm” for all its different functions. Scientists have tried cutting (in an animal brain) the connection between the ears and the auditory cortex and rewiring the optical nerve with the auditory cortex to find that the auditory cortex literally learns to see.
Neural Networks
Model Representation I
Neuron in the brain
At a very simple level, neurons are basically computational units that take input (dendrites, 树突) as electrical input (called “spikes”) that are channeled to outputs (axons, 轴突).
Neuron model: Logistic unit
- In our model, our dendrites are like the input features ($x_1 \cdots x_n$), and the output is the result of our hypothesis function $h_\theta (x)$:
- In this model our $x_0$ input node is sometimes called the “bias unit.” It is always equal to 1.
- In neural networks, we use the same logistic function as in classification: $\frac{1}{1 + e^{-\theta^Tx}}$. In neural networks however we sometimes call it a sigmoid (logistic) activation function.
- Our $\theta$ parameters are sometimes instead called “weights” in the neural networks model.
Neural Network
- The first layer is called the “input layer” and the final layer the “output layer”, which gives the final value computed on the hypothesis.
- We can have intermediate layers of nodes between the input and output layers called the “hidden layer”.
- $a_i^{(j)}$ = “activation” of unit $i$ in layer $j$
- $a_1^{(2)} = g(\Theta_{10}^{(1)}x_0 + \Theta_{11}^{(1)}x_1 + \Theta_{12}^{(1)}x_2 + \Theta_{13}^{(1)}x_3)$
- $a_2^{(2)} = g(\Theta_{20}^{(1)}x_0 + \Theta_{21}^{(1)}x_1 + \Theta_{22}^{(1)}x_2 + \Theta_{23}^{(1)}x_3)$
- $a_3^{(2)} = g(\Theta_{30}^{(1)}x_0 + \Theta_{31}^{(1)}x_1 + \Theta_{32}^{(1)}x_2 + \Theta_{33}^{(1)}x_3)$
- $h_\Theta(x) = a_1^{(3)} = g(\Theta_{10}^{(2)}a_0^{(2)} + \Theta_{11}^{(2)}a_1^{(2)} + \Theta_{12}^{(2)}a_2^{(2)} + \Theta_{13}^{(2)}a_3^{(2)})$
- $\Theta^{(j)}$ = matrix of weights controlling function mapping from layer $j$ to layer $j+1$
- If network has
$s_j$
units in layer $j$ and$s_{j+1}$
units in layer $j+1$, then$\Theta ^{(j)}$
will be of dimension$s_{j+1}×(s_{j}+1)$
.
- If network has
Model Representation II
Forward propagation: Vectorized implementation
The vector representation of $x$ and $z^{(j)}$ is:
$x = \begin{bmatrix}x_0 \\ x_1 \\ \cdots \\ x_n\end{bmatrix} , z^{(j)} = \begin{bmatrix}z_1^{(j)} \\ z_2^{(j)} \\ \cdots \\ z_n^{(j)}\end{bmatrix}$
Setting $x=a^{(1)}$, we can rewrite the equation as:
$z^{(j)} = \Theta^{(j-1)}a^{(j-1)}$
Now we can get a vector of our activation nodes for layer $j$ as follows:
$a^{(j)} = g(z^{(j)})$
We can then add a bias unit (equal to 1) to layer $j$ after we have computed $a^{(j)}$. This will be element $a^{(j)}_0$ and will be equal to 1.
We then get our final result with:
$h_\Theta(x) = a^{(j+1)} = g(z^{(j+1)})$
This last theta matrix ($\Theta ^{(j)}$) will have only one row so that our result is a single number.
All of this is called Forward propagation (前向传播). The forward propagation step in a neural network works where you start from the activations of the input layer and forward propagate that to the first hidden layer, then the second hidden layer, and then finally the output layer.
Neural Network learning its own features
The neural network, instead of being constrained to feed the features $x_1$, $x_2$, $x_3$ to logistic regression. It gets to learn its own features, $a_1$, $a_2$, $a_3$, to feed into the logistic regression.
Depending on what parameters it chooses for $\Theta _1$, you can learn some pretty interesting and complex features and therefore you can end up with a better hypotheses than using the raw features.
Applications
Examples and Intuitions I
AND function
We have:
- $x_1, x_2 \in {0,1}$
- $y=x_1\ AND\ x_2$
- $\Theta^{(1)} =\begin{bmatrix}-30 & 20 & 20\end{bmatrix}$
And we know the plot of sigmoid function
So the results of $h_\Theta(x) = g(-30 + 20x_1 + 20x_2)$ are
| $x_1$ | $x_2$ | $h_\Theta (x)$ |
|---|---|---|
| 0 | 0 | $g(-30) \approx 0$ |
| 0 | 1 | $g(-10) \approx 0$ |
| 1 | 0 | $g(-10) \approx 0$ |
| 1 | 1 | $g(10) \approx 1$ |
OR function
$\Theta^{(1)} =\begin{bmatrix}-10 & 20 & 20\end{bmatrix}$
| $x_1$ | $x_2$ | $h_\Theta (x)$ |
|---|---|---|
| 0 | 0 | $g(-10) \approx 0$ |
| 0 | 1 | $g(10) \approx 1$ |
| 1 | 0 | $g(10) \approx 1$ |
| 1 | 1 | $g(10) \approx 1$ |
Examples and Intuitions II
Negation (NOT function)
$\Theta^{(1)} =\begin{bmatrix}10 & -20\end{bmatrix}$
| $x_1$ | $h_\Theta (x)$ |
|---|---|
| 0 | $g(10) \approx 1$ |
| 1 | $g(-10) \approx 0$ |
NOR function
$\Theta^{(1)} = \begin{bmatrix}10 & -20 & -20\end{bmatrix}$
| $x_1$ | $x_2$ | $h_\Theta (x)$ |
|---|---|---|
| 0 | 0 | $g(10) \approx 1$ |
| 0 | 1 | $g(-10) \approx 0$ |
| 1 | 0 | $g(-10) \approx 0$ |
| 1 | 1 | $g(-30) \approx 0$ |
XNOR function
Multiclass Classification
To classify data into multiple classes, we let our hypothesis function return a vector of values. Say we wanted to classify our data into one of four final resulting classes:
Our final layer of nodes, when multiplied by its theta matrix, will result in another vector, on which we will apply the $g()$ logistic function to get a vector of hypothesis values.
Our resulting hypothesis for one set of inputs may look like:
$h_\Theta(x) = \begin{bmatrix}0 \\ 0 \\ 1 \\ 0 \\ \end{bmatrix}$
In which case our resulting class is the third one down, or $h_\Theta (x)_3$.
We can define our set of resulting classes as $y$:
$y^{(i)} = \begin{bmatrix}1\\ 0\\ 0\\ 0\end{bmatrix},\ \begin{bmatrix}0 \\ 1\\ 0\\ 0\end{bmatrix},\ \begin{bmatrix}0\\ 0\\ 1\\ 0\end{bmatrix},\ \begin{bmatrix}0\\ 0\\ 0\\ 1\end{bmatrix}$
Our final value of our hypothesis for a set of inputs will be one of the elements in $y$.
Quiz
Which of the following statements are true? Check all that apply.
- TRUE If a neural network is overfitting the data, one solution would be to increase the regularization parameter $\lambda$.
- FALSE If a neural network is overfitting the data, one solution would be to decrease the regularization parameter $\lambda$.
- FALSE Suppose you have a multi-class classification problem with three classes, trained with a 3 layer network. Let $a^{(3)}_1 = (h_\Theta(x))_1$ be the activation of the first output unit, and similarly $a^{(3)}_2 = (h_\Theta(x))_2$ and $a^{(3)}_3 = (h_\Theta(x))_3$. Then for any input x, it must be the case that $a^{(3)}_1 + a^{(3)}_2 + a^{(3)}_3 = 1$.
- The outputs of a neural network are not probabilities, so their sum need not be 1.
- TRUE In a neural network with many layers, we think of each successive layer as being able to use the earlier layers as features, so as to be able to compute increasingly complex functions.
Consider the following neural network which takes two binary-valued inputs $x_1,x_2\in {0,1}$ and outputs $h_\Theta (x)$. Which of the following logical functions does it (approximately) compute?
- OR
- Consider the neural network given below. Which of the following equations correctly computes the activation $a{(3)}_1$? Note: $g(z)$ is the sigmoid activation function.
- $a_1^{(3)} = g(\Theta_{1,0}^{(2)}a_0^{(2)} + \Theta_{1,1}^{(2)}a_1^{(2)} + \Theta_{1,2}^{(2)}a_2^{(2)})$
- You have the following neural network:
You’d like to compute the activations of the hidden layer $a^{(2)}\in R^3$. One way to do so is the following Octave code:
|
|
You want to have a vectorized implementation of this (i.e., one that does not use for loops). Which of the following implementations correctly compute $a^{(2)}$? Check all that apply.
a2 = sigmoid (Theta1 * x);
- You are using the neural network pictured below and have learned the parameters $\Theta^{(1)} = \begin{bmatrix} 1 & 0.5 & 1.9 \\ 1 & 1.2 & 2.7 \end{bmatrix}$ and $\Theta^{(2)} = \begin{bmatrix} 1 & -0.2 & -1.7 \end{bmatrix}$. Suppose you swap the parameters for the first hidden layer between its two units so $\Theta^{(1)} = \begin{bmatrix} 1 & 1.2 & 2.7 \\ 1 & 0.5 & 1.9 \end{bmatrix}$ and also swap the output layer so $\Theta^{(2)} = \begin{bmatrix} 1 & -1.7 & -0.2 \end{bmatrix}$. How will this change the value of the output $h_\Theta (x)$?
- It will stay the same.


Next: Parsing Loop Clauses, Previous: Extended Loop, Up: Overview of the Loop Facility
Loop keywords are not true keywords_1; they are special symbols, recognized by name rather than object identity, that are meaningful only to the loop facility. A loop keyword is a symbol but is recognized by its name (not its identity), regardless of the packages in which it is accessible.
In general, loop keywords are not external symbols of the COMMON-LISP package, except in the coincidental situation that a symbol with the same name as a loop keyword was needed for some other purpose in Common Lisp. For example, there is a symbol in the COMMON-LISP package whose name is "UNLESS" but not one whose name is "UNTIL".
If no loop keywords are supplied in a loop form, the Loop Facility executes the loop body repeatedly; see Simple Loop.


Is any mail delivered?No. Further, GreenMail stores all recieved messages in memory.Which versions of JDK does GreenMail run under?JDK 1.4 and aboveHow do I create User Accounts?Servers server ...; User user =<EMAIL_ADDRESS>"login", "password"); How come I don't have to create any accounts to send/retrieve?By default GreenMail accepts all incoming emails. If there is no corresponding existing email account, one is automatically created with login and password being the same as the to-address.What other library dependencies are there?javamail.jar activation.jar slf4j-api.jar How come I don't need to install any SSL/TLS related certificates?GreenMail is designed to be used out of the box with no need to generate, sign or install any cerificates into your keystore. GreenMail ships with a builtin keystore with a self signed RSA key. Refer to the source code of DummySSLServerSocketFactory for details. |


To create a new passport, specify your desired passphrase and confirm.
NEO Wallet Options
Provide a private key to import an existing NEO wallet. Leave blank to create a new wallet.
Create New Bridge Passport
Import a Passport >
Please wait
Bridge Network Settings
Bridge API Url
Bridge Explorer Url
OK


{% set current_link = "deploy" %}
{% extends "base.html" %}
{% block body %}
Basic configuration
{% if enabled %}
{% from "macros/_formhelpers.html" import render_field %}
{% else %}
You have already deployed the system, so you can not redeploy it again. You can access it here. If you need to change anything, contact the administrator.


Blockchain
- A transaction must occur.
- That transaction must be verified.
- That transaction must be stored in a block.
- That block must be given a hash.
Where Is the Blockchain Stored?
Blockchain Security
- Decentralization
- Blockchain is working 24 hours a day, seven days a week
- Privacy
- Security
- Transparency
Disadvantage of Blockchain
- Banks
- Cryptocurrency
- Healthcare
- Smart Contracts
- Supply Chains
- Voting


NiiVue has many built in features and canvas interactions (e.g. mouse clicks and keyboard button presses).
The links on this page can be used to navigate to each demo in a new page.


public class BooleanCircuit
extends java.lang.Object
The circuit is constructed from Wire
s and Gate
s. Once input has been set, the compute() function performs the
computation and returns the computed output Wire
s.
The equals function verifies that two gates are equivalent.
| Constructor and Description |
|---|
BooleanCircuit(java.io.File f)
Constructs a BooleanCircuit from a File.
|
BooleanCircuit(Gate[] gates,
int[] outputWireIndices,
java.util.ArrayList<java.util.ArrayList<java.lang.Integer>> eachPartysInputWires)
Constructs a {code BooleanCircuit} from an array of gates.
|
BooleanCircuit(java.util.Scanner s)
Constructs a BooleanCircuit from a Scanner.
|
| Modifier and Type | Method and Description |
|---|---|
java.util.Map<java.lang.Integer,Wire> |
compute()
Computes the circuit if the input has been set.
|
boolean |
equals(java.lang.Object obj)
The verify method tests the circuits for equality returning
true if they are and false if they are not. |
Gate[] |
getGates() |
java.util.ArrayList<java.lang.Integer> |
getInputWireIndices(int partyNumber) |
int |
getNumberOfInputs(int partyNumber) |
int |
getNumberOfParties()
Returns the number of parties of this boolean circuit.
|
int[] |
getOutputWireIndices() |
void |
setInputs(java.io.File inputWires,
int partyNumber)
Sets the input to the circuit by reading it from a file.
|
void |
setInputs(java.util.Map<java.lang.Integer,Wire> presetInputWires,
int partyNumber)
Sets the specified party's input to the circuit from a map containing constructed and set
Wire s. |
public BooleanCircuit(java.io.File f) throws java.io.FileNotFoundException, CircuitFileFormatException
The File first lists the number of Gate
s, then the number of parties.
Then for each party: party number, the number of inputs for that party, and following there is a list of indices of each of these input Wire
s.
Next it lists the number of output Wire
s followed by the index of each of these Wires
.
Then for each gate, we have the following: number of inputWires, number of OutputWires inputWireIndices OutputWireIndices and the gate's truth Table (as a 0-1 string).
example file: 1 2 1 1 1 2 1 2 1 3 2 1 1 2 3 0001
f
- The File
from which the circuit is read.java.io.FileNotFoundException
- if f is not found in the specified directory.CircuitFileFormatException
- if there is a problem with the format of the file.public BooleanCircuit(java.util.Scanner s) throws CircuitFileFormatException
The Scanner's underyling contents contains a lists the number of Gate
s, then the number of parties.
Then for each party: party number, the number of inputs for that party, and following there is a list of indices of each of these input Wire
s.
Next it lists the number of output Wire
s followed by the index of each of these Wires
.
Then for each gate, we have the following: number of inputWires, number of OutputWires inputWireIndices OutputWireIndices and the gate's truth Table (as a 0-1 string).
example file: 1 2 1 1 1 2 1 2 1 3 2 1 1 2 3 0001
s
- The Scanner
from which the circuit is read.CircuitFileFormatException
- if there is a problem with the format of the circuit.public BooleanCircuit(Gate[] gates, int[] outputWireIndices, java.util.ArrayList<java.util.ArrayList<java.lang.Integer>> eachPartysInputWires)
Each gate keeps an array of the indices of its input and output wires. The constructor is provided with a list of which
Wire
s are output Wire
s of the BooleanCircuit
.
gates
- An array of Gate
s to create from which to construct the BooleanCircuit
.outputWireIndices
- An array containing the indices of the wires that will be output of the BooleanCircuit
.eachPartysInputWires
- An arrayList containing the indices of the input Wire
s of this
BooleanCircuit
indexed by the party number.public void setInputs(java.util.Map<java.lang.Integer,Wire> presetInputWires, int partyNumber) throws NoSuchPartyException
Wire
s. It updates that this party's input has been set. Once the input is set for all parties that have input, the circuit is ready to be computed.
presetInputWires
- The circuit's input wires whose values have been previously set.NoSuchPartyException
- if the party number is negative or bigger then the given number of parties.public void setInputs(java.io.File inputWires, int partyNumber) throws java.io.FileNotFoundException, InvalidInputException, NoSuchPartyException
Written in the file is a list that contains the number of input Wire
s followed by rows of Wire
numbers and values.
inputWires
- The File
containing the representation of the circuit's input.java.io.FileNotFoundException
InvalidInputException
NoSuchPartyException
public java.util.Map<java.lang.Integer,Wire> compute() throws NotAllInputsSetException
Map
that maps the output Wire
index to the computed Wire
.NotAllInputsSetException
- in case there is a party that has no input.public boolean equals(java.lang.Object obj)
true
if they are and false
if they are not.
In order to be considered equal, Gate
s and Wire
s must be indexed identically and Gate
s must contain
the same truth table.
equals
in class java.lang.Object
obj
- A BooleanCircuit
to be tested for equality to this BooleanCircuit
true
if the given BooleanCircuit
is equivalent to this Boolean Circuit
, false
otherwise.public int[] getOutputWireIndices()
Wire
indices of this circuit.public java.util.ArrayList<java.lang.Integer> getInputWireIndices(int partyNumber) throws NoSuchPartyException
partyNumber
- The number of the party whose input wires will be returned.Wire
indices of the specified party.NoSuchPartyException
- if the given party number is less than 1 and greater than the given number of parties.public int getNumberOfInputs(int partyNumber) throws NoSuchPartyException
partyNumber
- The number of the party whose number of input wires will be returned.NoSuchPartyException
- if the given party number is less than 1 and greater than the given number of parties.public int getNumberOfParties()


Tracing and Logging |
Tracing and Logging includes the following topics:
Tracing is a facility to redirect any output in the Java Console to a trace file.
Tracing can be turned on by enabling the property javaplugin.trace
.
However, it turns on all tracing facilities inside Java Plug-in. To enable more
fine-grained tracing, javaplugin.trace.option
may be used. You
can set trace-level options (0-5) in the Java
Console, shown in the previous chapter, with the following meanings:
This enables tracing on the fly.
Another way to set fine-grained tracing is through the Java Control Panel. For instance, to enable tracing for everthing (option 5 above), enter the following in the "Java Run Time Parameters" textfield:
-Djavaplugin.trace=true
-Djavaplugin.trace.option=basic|net|cache|security|ext|liveconnect|temp
Tracing set through the Control Panel will take effect when the Plug-in is launched, but changes made through the Control Panel while a Plug-in is running will have no effect until restart.
To set the initial trace level for a Java Web Start application, you can create a .javawsrc
file in either your home directory or the jre/bin
directory. This file can have entries:
TraceBasic=true
TraceNetwork=true
TraceSecurity=true
TraceCache=true
TraceExtensions=true
TraceTemp=true
Similar to tracing, logging is a facility to redirect any output in the Java
Console to a log file using the Java Logging API. Logging can be turned on by
enabling the property javaplugin.logging
:
-Djavaplugin.logging=true
By default the trace and log file names are, respectively:
.plugin<version>.trace
and.plugin<version>.log
However, you can give them different names by setting the properties:
javaplugin.trace.filename
andjavaplugin.log.filename
in the Java Plug-in Control Panel.
The default location (directory) of Java Plug-in related files is:
/usr/home
on Unix/Linux\Winnt\Profiles\<user>
on WindowHowever, the location can be set with the environment variable USER_JPI_PROFILE
.
Furthermore, if you do not want to overwrite trace and log files each session,
you can set the property javaplugin.outputfiles.overwrite=false
.
If the property is set false
, then trace and log files will be
uniquely named for each session. E.g., if default trace and log file names are
used as shown above, then date information would be included as follows:
.plugin<username><date hash code>.trace
and.plugin<username><date hash code>.log


01 / Search for jobs
Property men the smallest graceful insisted smallness expenses as material
Finding your next job or career more 1000+ availabilities
Property men the smallest graceful insisted smallness expenses as material
Ecstatic elegance disposed smallness rent been part breeding insisted
Property men the smallest graceful insisted smallness building to in
Prevailed sincerity behaviour to so do principle departure.
Sigh ever way now many. Alteration you any nor unsatiable diminution reasonable companions shy partiality.
All having but you edward genius though remark one.
Ferrars all spirits his imagine effects amongst neither.

Blush on in jokes sense do do. Brother hundred he assured reached
Way extensive and dejection get delivered deficient sincerity gentleman age.
Saved he do fruit woody of to. Met defective are allowance two perceived listening consulted contained. It chicken oh colonel pressed excited suppose to shortly.
Read moreOn at tolerably depending do perceived. Luckily eat joy see own shyness minuter. So before remark at depart. Did son unreserved themselves indulgence myself its.
Read moreUnfeeling agreeable suffering it on smallness newspaper be. So come must time no as. Do on unpleasing possession as of unreserved. Her questions favourite him concealed.
Read more


{% load i18n %}
{% trans "Data Senders use their mobile phone to send in data via SMS." %}
{% trans "Data Senders use any Computer to send in data via Web." %}
{% trans "Data Senders use their Android Smartphone to send in data." %}


RED DUST A film review by Thomas E. Billings Copyright 1991 Thomas E. Billings
Synopsis: The story of two women and their romantic affairs in China during the period 1938-1949. A romantic drama set against the history of China during the period: the Japanese occupation of World War II, and the Nationalist-Communist civil war. Extremely well made, the film is an excellent romantic melodrama.
Hong Kong (English subtitles), color, 1990, 94 minutes. Director/Writer: Yim Ho
The film centers on a beautiful writer, Shen Shaohua, who falls in love with one of her readers, Zhang Nengcai. The time is 1938; they are in a part of China that is occupied by Japanese forces. Nengcai works for the Japanese-controlled occupation government, so he is seen as a traitor and collaborator by many Chinese.
Soon Shaohua's best friend, Yuefeng, returns for a visit. Yuefeng is in a romantic relationship with a resistance fighter, hence she is harshly critical of Nengcai, even though he affirms that "There is no blood on my hands," i.e., he is not involved in the atrocities and cruelties of the Japanese occupation force. However, social disapproval doesn't deter Shaohua, for she is in love. The two women maintain their friendship through the political complications and turmoil of the time.
The film flashes forward to 1945, the eve of Japan's surrender in World War II. Nengcai must go into hiding to avoid retribution after the fall of the occupation government. The story continues with the separation of the lovers....
This film manages to neatly blend the story of Shaohua's romance, Yuefeng's romance, and a dramatization of one of Shaohua's stories (the romance of two peasants, Jade Flower and Spring Hope), with the historic events of the period: the Japanese occupation during World War II, and their eventual defeat; the economic collapse of the Nationalist government in 1947; the civil war, and the eventual Communist victory in 1949. The result is a "classy," very well made romantic melodrama.
The photography is superb and the acting is excellent. Elaborate sets and location scenes (including mass crowd scenes) reflect a large budget for the film. The story moves slowly at first, then picks up in the middle of the film as the plot is moved along by the historical events of the period.
As I was watching the film, I was concerned for a while that it was just another soap opera. Alas, the slow pace of the first half of the film seemed to confirm this. However, be patient -- the second half of the film is extremely dramatic and will definitely hold your attention. Indeed, the second half can be accurately described as riveting and compelling!
I must admit that I am not much of a fan of romantic melodrama. However, this film succeeds both as romantic melodrama and as standard drama. It is certainly one of the best romantic melodramas that I have ever seen! Because of this, I strongly recommend the film to fans of melodrama, and it is also worth seeing by a general audience. Overall, the film rates in the excellent/very good range.
Print Source: Creative Workshop; Flat F, 18/F; Tonnochy Tower A; 272 Jaffe Road; Wanchai, Hong Kong
Reviewer contact<EMAIL_ADDRESS>teb .
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


#{include 'Application/top_head_wizard.html'/} #{include 'Application/top_nav.html'/}
Please enter target nodes by fqdn line by line (no additional symbols).
CAUTION: Please VERIFY the command you selected here.
Select the REST command on the target nodes.
Now will (1) generate requests, (2) insert data if needed (3) send request to target node group. Responses normally take 10 seconds for 1000 nodes, less than 75 seconds for 20,000 nodes. Speed also depends on the timeout setting defined in application.conf. Please wait.


Meraki
The New AV Room Standard Switch
Created by Kevin Liao
Kevin Liao
Sr. Network Engineer
Current Status and Issues
Currently Juniper 12 Port non-PoE switch for AV
Switch is managed by Network
- Slow - AV team takes long time to make any changes or test any new AV devices due to lack of control
- Incapable - When swithes have any failures, AV team cannot restore the service
- Cost - AV/Network team have to travel to the regional offices to turn on the service
What we need for new Teams Room System
- 48 ports PoE Switch to support new MS Teams room system
- AV team easy to manage and configure the switch
- Zero touch provisioning to support plug-n-play to reduce travel
- AV team easy to replace the defective switch and restore the service
What's the best solution?
We were looking and trying...
Sky Enterprise ... No
Juniper EX3400 ... No
AV to learn networking ... No
... and the answer is...
Cisco Meraki
Cisco Meraki is a cloud controller based networking solution


Rendering test to draw some translucent shapes with SVG (with D3JS) & Canvas(with EaselJS & D3) & WBGL(TWO.js)
Draw SVG
Draw Canvas
Draw SVG (same data without clearing)
Draw WebGL (with pixi.js)
Draw Canvas (with pixi.js)
x
Generate Sample Nodes


After studying Ruby for four weeks, this week we jumped into JavaScript. This was my first exposure to JavaScript and I found the differences between it and Ruby a little disorienting. By far, one of my biggest challenges was understanding how Ruby classes compare to JavaScript constructor functions.
In Ruby, if you want to create a series of related objects the easiest way to do this is to write a class and then use the 'new' method to create instances of that class. The class declaration can include attributes and methods. It can control the access to these properties using keywords like 'private' and it can inherit from other classes. Since everything in Ruby is an object this means that classes, which create objects, are themselves objects. This seems strangely circular but in practice can be easily ignored.
Creating objects in Javascript is a little different. Instead of classes, JavaScript uses constructors. Javascript constructors are functions which happen to be used as constructors (things which create new objects). Unlike other languages Javascript doesn't have a special constructor feature. To call a constructor we use the 'new' keyword. When this is done four things happen. First, a new object is created. Second, the constructor property of that object is set. Third, the new object is set to delegate to the constructor's prototype object. Fourth, the constructor function itself is called. These four steps result in a new object being created. These constructor functions can set properties of the object (like attributes in Ruby) and can implement subfunctions of the object which can be used like object methods in Ruby.


Broken Bookshelf:
According to legend, the Moon Face Flower only blooms on moonlit nights.
It's very shy, and shows its face only to its future husband. This legend made it quite popular among young, single, aristocratic ladies.
I wonder who might have owned this one?
Take the hairpin.


COMMUNE-IC8
Party Pics
Card title
Quick sample text to create the card title and make up the body of the card's content


--- layout: page title: "Community commissioned" permalink: /community-commissioned/ main_image_path: main_image_caption: _options: layout: hidden: true main_image_path: width: 1200 height: 1200 resize_style: contain mime_type: image/jpeg image: width: 1200 height: 1200 resize_style: contain mime_type: image/jpeg _comments: main_image_path: Cover image main_image_caption: Alt text for cover image posts_number: How many posts to show alink: Optional web link from the slide caption: optional caption ---
Turtle Song
(2017)
Waving Hello
(2017)
Beat It Percussion
(2016)
Artscape
(2009-2015)
Oxford Concert Party
(2012)
Seesaw
(2009-2010)
'Voices from the Falling Sky' Exhibition
(2007-2008)


{% extends '../base.html' %} {% block title %}File Storage{% end %} {% block content %}
You can add new files to the storage by dragging and dropping them to this window.Folders cannot be uploaded to the system directly. Please use multiple files upload or ZIP folder to upload the archive.
| File | Info | Size | Created at | Add Files |
|---|---|---|---|---|
| Info | ||||
There are no files in the storage |
||||
| Total: 0 |


JEE
NEET
GATE
Computer Courses
Data Structures
Algorithm
Projects
Marketing Courses on BigB
Learn the marketing skills required to add a value to your business
Digital marketing
Brand positioning
Brand awareness
Demand generation
Inbound marketing
Ideal customer profile (ICP)
Account-based marketing (ABM)
Word-of-mouth marketing (WOM)
Churn rate
Net Promoter Score (NPS)
Minimum viable product (MVP)
Flywheel
Lead nurturing
Polish your marketing skills with these courses
1 Course
3 Courses
5 Courses
Start learing about Digital Marketing
1/3
2/3
3/3
Enroll in a free Digital Marketing course
Start learing about Brand Management
1/3
2/3
3/3
Watch this playlist to know more
Learn about other relevant topics in Marketing
1/5
2/5
3/5
4/5
5/5


Sacred Forms, Virbant Soul
Book Design | Editoral
The Challenge
This project challenge is to create a robust artist catalogue for Moe Brooker, – a Philadelphia-based artist with a vision for vibrant abstract paintings that evoke a sense of religious connection. The catalogue must express the content within, and convey the meaning and spirit of Moe Brooker's collection of works.
The Goals
-
Uncoventionally Formal
The catalogue must express Brooker's strong connection to the idea of divine inspiration, worship, and light as a medium of the divine and the spiritual.
-
Playfully Colorful
The catalogue must express the vibrancy and freeform boldness of Brooker's use of colors, patterns, and various lineworks, which must also express his evolving style.
-
Creatively Inspired
The catalogue must borrow and inspire the elements from Brooker's work but they should be in a meaningful and insightful way.
The Journey
The book aethestics is mostly founded on the idea of light, as the chapters can be identified by their unique light gradient emitting from the center of the book. And each chapter of the book follows a certain themes involving lines, and shape that evolves over the catalogue – which reference either the text or the elements of Brook's signature style.
The Conclusion
The catalogue is strong and interesting visually with many references to both the themes and forms of Brooker's artworks, while also exploring many interesting typographic layouts and formal geometric compositions.


|
libcaer
2.0.0-r03701472c913c547a88c15e2d287b3729f798d31
|
#include <stdint.h>
Go to the source code of this file.
Macros | |
| #define | ATTRIBUTE_FORMAT |
| #define | CAER_LOG_EMERGENCY (0) |
| #define | CAER_LOG_ALERT (1) |
| #define | CAER_LOG_CRITICAL (2) |
| #define | CAER_LOG_ERROR (3) |
| #define | CAER_LOG_WARNING (4) |
| #define | CAER_LOG_NOTICE (5) |
| #define | CAER_LOG_INFO (6) |
| #define | CAER_LOG_DEBUG (7) |
Functions | |
| void | caerLogLevelSet (uint8_t logLevel) |
| uint8_t | caerLogLevelGet (void) |
| void | caerLogFileDescriptorsSet (int fd1, int fd2) |
| void | caerLog (uint8_t logLevel, const char *subSystem, const char *format,...) ATTRIBUTE_FORMAT |
Logging functions to print useful messages for the user.
| #define CAER_LOG_ALERT (1) |
Log levels for caerLog() logging function. Log messages only get printed if their log level is equal or above the global system log level, which can be set with caerLogLevelSet(). The default log level is CAER_LOG_ERROR. CAER_LOG_EMERGENCY is the most urgent log level and will always be printed, while CAER_LOG_DEBUG is the least urgent log level and will only be delivered if configured by the user.
| #define CAER_LOG_CRITICAL (2) |
Log levels for caerLog() logging function. Log messages only get printed if their log level is equal or above the global system log level, which can be set with caerLogLevelSet(). The default log level is CAER_LOG_ERROR. CAER_LOG_EMERGENCY is the most urgent log level and will always be printed, while CAER_LOG_DEBUG is the least urgent log level and will only be delivered if configured by the user.
| #define CAER_LOG_DEBUG (7) |
Log levels for caerLog() logging function. Log messages only get printed if their log level is equal or above the global system log level, which can be set with caerLogLevelSet(). The default log level is CAER_LOG_ERROR. CAER_LOG_EMERGENCY is the most urgent log level and will always be printed, while CAER_LOG_DEBUG is the least urgent log level and will only be delivered if configured by the user.
| #define CAER_LOG_EMERGENCY (0) |
Log levels for caerLog() logging function. Log messages only get printed if their log level is equal or above the global system log level, which can be set with caerLogLevelSet(). The default log level is CAER_LOG_ERROR. CAER_LOG_EMERGENCY is the most urgent log level and will always be printed, while CAER_LOG_DEBUG is the least urgent log level and will only be delivered if configured by the user.
| #define CAER_LOG_ERROR (3) |
Log levels for caerLog() logging function. Log messages only get printed if their log level is equal or above the global system log level, which can be set with caerLogLevelSet(). The default log level is CAER_LOG_ERROR. CAER_LOG_EMERGENCY is the most urgent log level and will always be printed, while CAER_LOG_DEBUG is the least urgent log level and will only be delivered if configured by the user.
| #define CAER_LOG_INFO (6) |
Log levels for caerLog() logging function. Log messages only get printed if their log level is equal or above the global system log level, which can be set with caerLogLevelSet(). The default log level is CAER_LOG_ERROR. CAER_LOG_EMERGENCY is the most urgent log level and will always be printed, while CAER_LOG_DEBUG is the least urgent log level and will only be delivered if configured by the user.
| #define CAER_LOG_NOTICE (5) |
Log levels for caerLog() logging function. Log messages only get printed if their log level is equal or above the global system log level, which can be set with caerLogLevelSet(). The default log level is CAER_LOG_ERROR. CAER_LOG_EMERGENCY is the most urgent log level and will always be printed, while CAER_LOG_DEBUG is the least urgent log level and will only be delivered if configured by the user.
| #define CAER_LOG_WARNING (4) |
Log levels for caerLog() logging function. Log messages only get printed if their log level is equal or above the global system log level, which can be set with caerLogLevelSet(). The default log level is CAER_LOG_ERROR. CAER_LOG_EMERGENCY is the most urgent log level and will always be printed, while CAER_LOG_DEBUG is the least urgent log level and will only be delivered if configured by the user.
| void caerLog | ( | uint8_t | logLevel, |
| const char * | subSystem, | ||
| const char * | format, | ||
| ... | |||
| ) |
Main logging function. This function takes messages, formats them and sends them out to a file descriptor, respecting the system-wide log level setting and prepending the current time, the log level and a user-specified common string to the actual formatted output. The format is specified exactly as with the printf() family of functions. Please see their manual-page for more information.
| logLevel | the message-specific log level. |
| subSystem | a common, user-specified string to prepend before the message. |
| format | the message format string (see printf()). |
| ... | the parameters to be formatted according to the format string (see printf()). |
| void caerLogFileDescriptorsSet | ( | int | fd1, |
| int | fd2 | ||
| ) |
Set to which file descriptors log messages are sent. Up to two different file descriptors can be configured here. By default logging to STDERR only is enabled. If both file descriptors are identical, logging to it will only happen once, as if the second one was disabled.
| fd1 | first file descriptor to log to. A negative value will disable it. |
| fd2 | second file descriptor to log to. A negative value will disable it. |
| uint8_t caerLogLevelGet | ( | void | ) |
Get the current system-wide log level. Log messages are only printed if their level is equal or above this level.
| void caerLogLevelSet | ( | uint8_t | logLevel | ) |
Set the system-wide log level. Log messages will only be printed if their level is equal or above this level.
| logLevel | the system-wide log level. |


01 Data Binding
Simple Binding
We can bind to simple values declared in JavaScript such as the value below.
this.hello = 'world';
And we can bind to it in HTML using doubly curly braces
{{main.hello}}
Which will produce
{{main.hello}}
Challenge
Change the value this.hello
in script.js
to see the new value rendered.
Binding to an Object
We can also bind to properties of objects such as the object below.
this.item = {
name: 'My Name',
description: 'This description'
};
And we can bind to it in HTML using doubly curly braces
Name: {{main.item.name}}
Description: {{main.item.description}}
Which will produce
Name: {{main.item.name}}
Description: {{main.item.description}}
Challenge
Change the value of a property on this.item
in script.js
to see the new value rendered.


Pokémon is a series of video games developed by Game Freak and published by Nintendo and The Pokémon Company as part of the Pokémon media franchise. Created by Satoshi Tajiri with assistance from Ken Sugimori,the first games released in 1996 in Japan for the Game Boy,and the main series of role-playing video games (RPGs), also referred as the "core series" by their developers. Let us know some pokemon types.
The AR game's potential for weight loss was a big part of that discussion. In the process of getting out their doors and visiting parks, players found they were losing weight almost in spite of themselves. A Reddit Pokémon Go fan won acclaim for reporting that he'd lost 65 pounds between July and December.
Pokémon GO is one of the most successful mobile games of all time, breaking records like fastest to earn $100 million and most-downloaded in its first month of release. To date, it has grossed almost $2 billion in revenue and been downloaded 800 million times. Although no longer the global phenomenon it was in 2016, the game remains incredibly popular.
Type chart, effectiveness and weakness explained in Pokémon Go
Pokémon battles appear in most forms of Pokémon media, being the central gameplay aspect of the core series games, as well as being a constant focus of the anime.
Pokémon Go’s Types are exactly the same as those in the main Pokémon games, but the effect of those type matchups is slightly different: in brief, things like effective or resisted attacks have slightly different multipliers to the main Pokémon games - although a December 2018 update brought them slightly closer in line.
| Type | Strong Against | Weak Against | Resistant To |
|---|---|---|---|
| Normal | None | Rock, Ghost, Steel | Ghost |
| Fighting | Normal, Rock, Steel, Ice, Dark | Flying, Poison, Psychic, Bug, Ghost, Fairy | Rock, Bug, Dark |
| Flying | Fighting, Bug, Grass | Rock, Steel, Electric | Fighting, Ground, Bug, Grass |
| Poison | Grass, Fairy | Poison, Ground, Rock, Ghost, Steel | Fighting, Poison, Grass, Fairy |
| Ground | Poison, Rock, Steel, Fire, Electric | Flying, Bug, Grass | Poison, Rock, Electric |
Pokémon Go in 2020 continues to add new features, such the arrival of the Go Battle League, Remote Raids and the trade evolution feature. There are also planned changes to PokéCoins on the way. Meanwhile, coming soon is the Johto Throwback quest.
Book you tickets now.
Greninja
Ability: Torrent
It is the final evolution of Froakie,
the Water-type starter from Kalos.
(1996–1999)
The original Pokémon games are Japanese role-playing video games (RPGs) with an element of strategy, and were created by Satoshi Tajiri for the Game Boy. The Pokémon series began with the release of Pocket Monsters Red and Green for the Game Boy in Japan. When these games proved popular, an enhanced Blue version was released sometime after, and the Blue version was reprogrammed as Pokémon Red and Blue for international release. The original Green version was not released outside Japan
(1992–2002)
The second generation of Pokémon video games began in 1999 with the Japanese release of Pokémon Gold and Silver for the Game Boy Color, with Australia and North America getting the game in October 2000 and European release date of April 2001. Like the previous generation, an enhanced version, titled Pokémon Crystal, was later released.
(2002-2006)
Pokémon entered its third generation with the 2002 release of Pokémon Ruby and Sapphire for Game Boy Advance and continued with the Game Boy Advance remakes of Pokémon Red and Green, Pokémon FireRed and LeafGreen (Red and Green representing the original Japanese first generation games; territories outside Japan instead saw releases of Red and Blue). An enhanced remake of Pokémon Ruby and Sapphire titled Pokémon Emerald followed after.
(2006-2010)
In 2006, Japan began the fourth generation of the franchise with the release of Pokémon Diamond and Pearl for Nintendo DS. The games were released in North America on April 22, 2007 and in Australia on June 21, 2007. The game was released in the UK and Europe on July 27, 2007. Other main series games in the fourth generation include Pokémon Platinum, a director’s cut version of Diamond and Pearl in the same vein as Pokémon Yellow, Crystal, and Emerald. It was released for the Nintendo DS in Japan on September 13, 2008, in North America on March 22, 2009, and in Australia and Europe on May 14, 2009 and May 22, 2009
Pokémon GO
Pokémon Go is a 2016 augmented reality mobile game developed.
Developer: Niantic
Pokémon: Let’s Go, Pikachu!
Take a Pokémon™ journey to the Kanto region with your energetic partner, Pikachu!
Publishers: Nintendo, The Pokémon Company
Pokémon Sleep
Pokémon Sleep is an upcoming mobile game for Android and iOS, as part of the Pokémon series.
Publisher: The Pokémon Company
Junichi Masuda
Japanese video game designer
"Junichi Masuda is a Japanese video game composer, director, designer, producer, singer, and programmer best known for his work in the Pokémon franchise. He is a member of the Game Freak board of directors, and has been employed at the company since 1989 when he founded it along Satoshi Tajiri and Ken Sugimori "
Shigeki Morimoto
Game designer
"Shigeki Morimoto is a game designer and programmer currently working at Game Freak. He has been involved in nearly every main series Pokémon game, since Pokémon Red and Blue Versions where he was a programmer, and the creator of the battle system and the Pokémon “Mew”. "
Ken Sugimori
Japanese video game designer
"Ken Sugimori is a Japanese video game designer, illustrator, manga artist, and director. He is most famous as the character designer and art director for the Pokémon franchise. Sugimori is also credited with the art direction for other titles, including Pulseman "
Pokémon is short for the original Japanese title of Pocket Monsters. Created by. Satoshi Tajiri.


Upload Test
Select IP version:
IPv4
IPv6
Event Trail:
Upload IPv4 Result
Upload IPv6 Result
Run Test


% _.each(musicians, function (musician, musicianIndex) { %>
<%- musician.last_name %>
<%- musician.stagename %>
<% _.each(musicians[musicianIndex].instruments, function (instrument, index) { %> <%- instrument.name_de %> - <% }); %>
<% _.each(musicians[musicianIndex].artists, function (artist, index) { %>


3.2.1. Architecture Overview¶
HTTP messaging provides a function to build a web service that processes http messages sent from outside (such as a browser or an external system).
Important
Use of RESTful web service instead of this function is recommended. For more information, see reason why RESTful web service is recommended .
<IP_ADDRESS>. Structure of HTTP messaging¶
It has the same structure as the Nablarch web application. For more information, see Structuring a web application.
<IP_ADDRESS>. Process flow of HTTP messaging¶
The process flow of HTTP messaging, from processing a request to returning a response, is shown below.
- WebFrontController (implementation class of javax.servlet.Filter) receives a request.
- WebFrontController delegates the process for the request to a handler queue (handler queue).
- DispatchHandler configured in the handler queue specifies the action class to be processed based on the URI and adds it to the end of the handler queue.
- The action class executes business logic using a form class and an entity class.
For more information on each class, see Responsibility Assignment of the Application . - The action class creates and returns a ResponseMessage indicating the process result.
- HTTP Messaging Response Conversion Handler in the handler queue is converted into a response (such as json or xml) that is returned to the client, which is returned to the client.
<IP_ADDRESS>. Handlers used in HTTP messaging¶
Nablarch provides several handlers as standard, which are required to build web services using HTTP messaging. Build the handler queue in accordance with the requirements of the project (a custom handler will have to be created for the project depending on the requirements)
For details of each handler, refer to the link.
- Handlers that convert request and response
- Handler for filtering requests
- Handlers associated with database
- Error handling handler
- Other handlers
<IP_ADDRESS>. Minimum handler configuration for HTTP messaging¶
When building web services using HTTP messaging, the minimum required handler queue is as below: With this as the base, add standard handlers of Nablarch or custom handlers created in the project according to the project requirements.
| No. | Handler | Request process | Response process | Exception handling |
|---|---|---|---|---|
| 1 | Thread Context Variable Delete Handler | Deletes all the values configured on the thread local by the Thread Context Variable Management Handler . | ||
| 2 | Global Error Handler | Outputs the log for a runtime exception or error. | ||
| 3 | HTTP Response Handler | Performs any one of servlet forward, redirect, or response writing. | Displays the default error page in the case of a runtime exception or error. | |
| 4 | Thread Context Variable Management Handler | Initializes thread context variables such as request ID from the request information. | ||
| 5 | HTTP Messaging Error Control Handler | If the response body generated by the subsequent handler is empty, the default body corresponding to the status code is configured. | Log output and response according to the exception is generated. | |
| 6 | Request Dispatch Handler | Identifies the business action to be processed from the request path and adds it to the end of the handler queue. | ||
| 7 | HTTP Messaging Request Conversion Handler | Parses the body of the http request, creates RequestMessage , and passes it to the subsequent handler as a request object. | ||
| 8 | Database Connection Management Handler | Acquires DB connection. | Releases the DB connection. | |
| 9 | HTTP Messaging Response Conversion Handler | Generates HTTP response for an error based on the message for the error generated by the business action. | ||
| 10 | Transaction Control Handler | Begin a transaction. | Commits the transaction. | Rolls back a transaction. |
| 11 | HTTP Messaging Response Conversion Handler | Generates a response for HTTP based on the message generated by the business action. | Generates HTTP response for an error based on the exception thrown by the subsequent handler. |
<IP_ADDRESS>. Action used in HTTP messaging¶
Nablarch provides action classes as standard, which are required for building HTTP messaging. Click on the link for more information.


|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
| Class Summary | |
|---|---|
| FinderFromClass | A rule-finding algorithm which expects the caller to specify a classname and methodname as plugin properties. |
| FinderFromDfltClass | A rule-finding algorithm which looks for a method with a specific name on a class whose name is derived from the plugin class name. |
| FinderFromDfltMethod | A rule-finding algorithm which looks for a method with a specific name on the plugin class. |
| FinderFromDfltResource | A rule-finding algorithm which looks for a resource file in the classpath whose name is derived from the plugin class name plus a specified suffix. |
| FinderFromFile | A rule-finding algorithm which expects the user to specify an absolute or relative path in the plugin declaration. |
| FinderFromMethod | A rule-finding algorithm which expects the caller to specify a methodname as a plugin property, where the method exists on the plugin class. |
| FinderFromResource | A rule-finding algorithm which expects the user to specify a resource name (ie a file in the classpath). |
| FinderSetProperties | A rule-finding algorithm which expects the user to specify whether "automatic property setting" is desired. |
| LoaderFromClass | A RuleLoader which invokes a static method on a target class, leaving that method to actually instantiate and add new rules to a Digester instance. |
| LoaderFromStream | A rule-finding algorithm which loads an xmlplugins-format file. |
| LoaderSetProperties | A RuleLoader which creates a single SetPropertiesRule and adds it to the digester when its addRules() method is invoked. |
This package contains "rule-finding" strategy classes, and their associated "helper" loader classes.
Note that you do not need to understand or deal with any of the classes in this package in order to use the plugins functionality. If you wish to use plugins functionality in non-english languages and therefore want to change the attribute names used on plugin declaration tags ("id", "file", etc) then you will need some familiarity with this package. Otherwise, this package is only relevant to people really wishing to tweak plugins in unexpected ways. If this is the case, come and talk to us on the digester email lists as we would be interested in knowing about your requirements.
When the plugins module is being used and the input xml indicates that a specific plugin class is to be instantiated, that class may then wish to configure itself from the xml attributes on that tag or xml attributes and elements nested within that tag.
The question is: how is the digester going to figure out where the plugin keeps its custom rules which are to be applied to the xml within that plugin tag?
Well, the answer is that there is a list of "rule finding strategies", generally containing an instance of each of the Finder classes in this package in a specific order. The strategies provided here should satisfy just about everyone, but if they don't you can add extra strategies if desired.
A RuleFinder is essentially a "strategy" or "algorithm" for finding the dynamic rules associated with a plugin class. When a plugin declaration is encountered in the input xml, the PluginContext object is asked for the list of RuleFinder objects, then each RuleFinder instance in turn is passed the declaration parameters, and asked "are you able to locate custom parsing rules for this declaration?". When one can, it returns a RuleLoader instance which is remembered. When the input xml indicates that an instance of the declared plugin class is to be created, that RuleLoader is invoked to temporarily add the relevant custom rules to the Digester in order to map xml attributes/elements/etc into the instantiated plugin object. Once the end of the plugin tag is encountered, those temporary rules are removed. This repeats each time the input xml indicates that an instance of a plugin class is to be instantiated.
If the plugin is declared "inline", using the "plugin-class" attribute instead of using "plugin-id" to reference a previous declaration then the process is exactly the same, except that the RuleFinder objects don't have any user-provided attribute "hints" to tell them where the custom rules are.
The RuleFinder list is carefully ordered; classes which look at the user-provided data in the declaration come first, and classes which look in "well-known places" come later so that users can override default behaviour by providing the appropriate tags on the plugin declaration.
See the javadoc on the different Finder classes for information on what each does, and what attribute (if any) it looks for in the declaration.
|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |


Monday-Thursday 9:30 a.m. - 3:30 p.m.
Friday 9:30 a.m. - 12:30 p.m.
1st Saturday of the month
10:00 a.m. - 12:00 p.m.
Walk-ins welcome. No appointment needed.
Call 1-800-550-4900 (After hours hotline)
If you or someone you know is pregnant or thinks they may be, we can offer love, support, and friendship. Please contact us.
1502 1st Street, Suite F Humble, TX 77338


Under the hood, Nest makes use of Express, but as mentioned already, provides compatibility with a wide range of other libraries, like e.g. Fastify. How does it work? In fact, what Nest needs to use your favorite library, is a compatible adapter, that primarily proxies corresponding handlers to appropriate library-specific methods. Additionally, your library has to provide at least similar request-response cycle management as express.
A Fastify fits here very well because it solves design issues in a similar manner as express does. However, fastify is much faster, achieving almost two times better benchmarks results. The question, why Nest still uses express as a default HTTP provider then? Because express is widely-used, well-known, and has a huge set of compatible middleware.
But we don't lock people in a single paradigm. We let them use whatever they need. Fastify is a better choice when you care about really good performance, that's why we provide a built-in FastifyAdapter
that helps to integrate this library with Nest.
Firstly, we need to install required packages:
{{ packages }}
Once fastify is installed, we can use a FastifyAdapter
.
{{ bootstrap }}
And that's all. Also, you are able to pass options into fastify constructor through FastifyAdapter
constructor.
Keep in mind that now, Nest uses fastify as an HTTP provider, meaning, each recipe that relays on express won't work anymore. You should rather use fastify equivalent packages.
A working example is available here.


Get the event dates or datetimes from a schedule.
schedule(x, from = NULL, to = NULL, during = NULL, period_type = "day", n = 1) schedule_days(x, from = NULL, to = NULL, during = NULL) schedule_hours(x, from = NULL, to = NULL, during = NULL) schedule_next_days(x, n, from, limit = lubridate::years(1))
| x | A schedule object. |
|---|---|
| from, to, during | The limits to place on the output (see Details). |
| period_type | The period type of the output. Eg. "day" (the default),
"hour" etc. Can be any unit accepted by |
| n | The increment of the period type. Eg. for events occurring every
half-hour the |
A date or datetime object.
schedule_days()
is a convenience function for schedule()
where
period_type
is pre-filled as "day". Likewise for schedule_hours()
,
where period_type
is pre-filled as "hour". These functions are
recommended as they cover the most common use cases.
The from
and to
arguments set limits on the output.
They are only required when the schedule x
doesn't
have implicit limits (and therefore has an infinite number of possible
events).
from
and to
can each be either:
a single date or datetime value or,
A numeric year.
In the case of from
, a numeric year translates to the
start date of the year eg. from = 2000
translates to
as.Date("2000-01-01")
.
In the case of to
it translates to the end of the year eg.
to = 2001
translates to as.Date("2001-12-31")
.
during
is a shortcut for when setting a single year limit.


Citizenship
Citizenship enables you to register
new citizens by storing their details
onto the Ethereum Blockchain
Register a Citizen
Search for a Citizen
View Citizen ID's


This will someday be the Help page. Actually we hope the Android version is simple enough to use that you don't need a 17-minute Yowtube video in order to understand it, but you never know.


Sales (YTD) / Goal
$16,087
Sales By Category - July
Snacks
Candy
Beverage
Gummy Bento Box
ICEE Squeeze
Watermelon Gum
Mochi Candy
Wax Candy Bottles


I am a Research Fellow at the National University of Singapore working with the Biorobotics research group in the Biomedical Engineering department. I do research on sensing and control methods for stroke rehabilitation robotics.
PhD in Biomedical Engineering, 2021
National University of Singapore
B. Tech in Electronics and Communication Engineering, 2016
National Institute of Technology, Trichy
I try to solve Google Code Jam Problems using Haskell.
I’ve been working with inertial measurement units lately, and I’ve come to realize that there’s a surprising amount of mathematics involved in processing the raw data from the sensors. The story begins with me trying to integrate a three-dimensional angular velocity vector to get the orientation of an object.
I walk you through writing a simple cyclic task in Xenomai.
I’ve been recently doing a lot of programming using Swift and I’m quite enjoying how intuitive it is to pick up. It also helps that SwiftUI generally produces good looking user interfaces with less effort than other things I’ve tried.
Introduction The first half of 2022 has not been kind to the world of crypto. Everyone expects a recession, cryptocurrency valuations are crashing; crypto firms file for bankruptcy every other week and many are predecting a “crypto winter”.
I take a morning walk along the rail corridor and take some photos of the sunrise.
I try to wrap my head around one of Haskell’s main higher order functions.
I talk about the messages from Demon Slayer: Kimetsu no Yaiba that inspire me.
My Blockchain projects.
Photos from around Buona Vista
Photographs from My Years in Ipoh
What coffee means to me, recipes and more.
Amateur musical recordings.
My dabblings in digital art.


Class vfsStreamWrapperTestCase
Test for org\bovigo\vfs\vfsStreamWrapper.
- PHPUnit_Framework_TestCase
- org\bovigo\vfs\vfsStreamWrapperBaseTestCase
- org\bovigo\vfs\vfsStreamWrapperTestCase
Namespace: org\bovigo\vfs
Located at vendor/mikey179/vfsStream/src/test/php/org/bovigo/vfs/vfsStreamWrapperTestCase.php
Located at vendor/mikey179/vfsStream/src/test/php/org/bovigo/vfs/vfsStreamWrapperTestCase.php
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
#
renameOnSourceFileNotFound( )
assert that trying to rename from a non existing file trigger a warning |
public
|
#
renameOnDestinationDirectoryFileNotFound( )
assert that trying to rename to a directory that is not found trigger a warning |
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
|
public
|
setUp()
|
$bar,
$barURL,
$baz1,
$baz1URL,
$baz2,
$baz2URL,
$foo,
$fooURL
|


This application comprises a code challenge for the Junior Front End Developer position.
The user can see a retrieved a list of a json server database.
Actions
- Insert a new user pushing the button Add User in the Users tab.
- Update the data of a user pushing the pencil button in the row of the specific user.
- Delete a user pushing the remove button in the row of the specific user.


We can't just create a new p tag for every
paragraph line we create
Hence we use piping to avoid this problem as long as we are piping the content it is going to remain in a single tag the relevant HTML is given below


| Jump to DART Documentation Main Index |
dart_to_cam is the program that reads a DART restart or model advance file (e.g. perfect_ics, filter_ics, assim_model_state_id ... ). and overwrites the part of the CAM data in a single CAM restart file (usually caminput.nc) which is in the DART state vector. If you have multiple input files, you will need to rename the output files as you create them.
The list of variables extracted from the DART state vector and exported to the CAM netCDF file is controlled by the set of input.nml &model_nml:state_names_* variables.
If the input is a model advance file, containing 2 timestamps (the current model time and a future time the model should run until), this program also creates a separate file named times that contains three lines: the advance-to time, the current model time, and the number of hours to advance. These will need to be extracted and inserted in a CAM namelist to indicate to CAM how long to run.
This program also updates the date and datesec variables in the CAM netcdf file. Generally these are identical times since the assimilation doesn't change the time of the data, but in case the original file had a different time that was overwritten in the state vector, it will update the time for consistency.
Conditions required for successful execution of dart_to_cam:
Since this program is called repeatedly for every ensemble member, we have found it convenient to link the DART input and CAM restart files to the default filenames dart_ics and caminput.nc). The output files may be moved or relinked as necessary.
This namelist is read from the file input.nml. Namelists start with an ampersand '&' and terminate with a slash '/'. Character strings that contain a '/' must be enclosed in quotes to prevent them from prematurely terminating the namelist.
&dart_to_cam_nml dart_to_cam_input_file = 'dart_ics', dart_to_cam_output_file = 'caminput.nc', advance_time_present = .true., /
| Item | Type | Description |
|---|---|---|
| dart_to_cam_input_file | character(len=128) | The name of the DART restart file containing the CAM state. |
| dart_to_cam_output_file | character(len=128) | The name of the CAM restart netcdf file. |
| advance_time_present | logical | Set to .false. for DART initial condition and restart files. Use the .true. setting for the files written by filter during a model advance. |
assim_model_mod.f90 types_mod.f90 threed_sphere/location_mod.f90 model_mod.f90 null_mpi_utilities_mod.f90 obs_kind_mod.f90 random_seq_mod.f90 time_manager_mod.f90 utilities_mod.f90
none
none - all error messages come from modules that have their own documentation.
none
None.
DART software - Copyright UCAR. This open source software is provided by UCAR, "as is", without charge, subject to all terms of use at http://www.image.ucar.edu/DAReS/DART/DART_download


| Delaware Crime
Rates 1960 -
2015
|
| Delaware Population
and Number of
Crimes
1960 -
2015 |
|
|
|
|
|
|
|
Forcible |
|
Aggravated |
|
Larceny- |
Vehicle |
| Year |
Population |
Index |
Violent |
Property |
Murder |
Rape |
Robbery |
assault |
Burglary |
Theft |
Theft |
| 1960 |
446,292 |
9,642 |
375 |
9,267 |
33 |
41 |
157 |
144 |
2,661 |
5,867 |
739 |
| 1961 |
458,000 |
9,661 |
318 |
9,343 |
20 |
27 |
124 |
147 |
2,711 |
5,885 |
747 |
| 1962 |
469,000 |
10,495 |
338 |
10,157 |
20 |
44 |
140 |
134 |
2,814 |
6,479 |
864 |
| 1963 |
476,000 |
11,316 |
424 |
10,892 |
24 |
43 |
181 |
176 |
3,366 |
6,559 |
967 |
| 1964 |
491,000 |
12,342 |
541 |
11,801 |
23 |
40 |
203 |
275 |
3,313 |
7,211 |
1,277 |
| 1965 |
505,000 |
12,164 |
561 |
11,603 |
29 |
33 |
286 |
213 |
3,272 |
7,062 |
1,269 |
| 1966 |
512,000 |
13,413 |
655 |
12,758 |
46 |
49 |
300 |
260 |
3,903 |
7,469 |
1,386 |
| 1967 |
524,000 |
15,152 |
948 |
14,204 |
45 |
60 |
343 |
500 |
4,360 |
7,861 |
1,983 |
| 1968 |
534,000 |
16,904 |
1,288 |
15,616 |
45 |
75 |
561 |
607 |
4,726 |
8,647 |
2,243 |
| 1969 |
540,000 |
18,909 |
1,588 |
17,321 |
43 |
74 |
635 |
836 |
4,737 |
10,043 |
2,541 |
|
|
|
|
|
|
Forcible |
|
Aggravated |
|
Larceny- |
Vehicle |
| Year |
Population |
Index |
Violent |
Property |
Murder |
Rape |
Robbery |
assault |
Burglary |
Theft |
Theft |
| 1970 |
548,104 |
23,366 |
1,795 |
21,571 |
42 |
102 |
578 |
1,073 |
5,789 |
12,718 |
3,064 |
| 1971 |
558,000 |
27,984 |
2,060 |
25,924 |
34 |
102 |
804 |
1,120 |
7,759 |
14,902 |
3,263 |
| 1972 |
565,000 |
25,559 |
2,181 |
23,378 |
39 |
80 |
735 |
1,327 |
7,059 |
13,544 |
2,775 |
| 1973 |
576,000 |
26,396 |
2,016 |
24,380 |
34 |
91 |
520 |
1,371 |
7,024 |
14,552 |
2,804 |
| 1974 |
573,000 |
34,091 |
2,539 |
31,552 |
59 |
99 |
733 |
1,648 |
8,697 |
19,825 |
3,030 |
| 1975 |
579,000 |
38,609 |
2,270 |
36,339 |
42 |
105 |
910 |
1,213 |
10,574 |
22,737 |
3,028 |
| 1976 |
582,000 |
36,459 |
1,872 |
34,587 |
36 |
103 |
749 |
984 |
8,978 |
22,790 |
2,819 |
| 1977 |
582,000 |
36,143 |
2,224 |
33,919 |
35 |
145 |
914 |
1,130 |
9,793 |
21,408 |
2,718 |
| 1978 |
583,000 |
37,043 |
2,569 |
34,474 |
39 |
119 |
848 |
1,563 |
9,466 |
22,111 |
2,897 |
| 1979 |
582,000 |
37,980 |
3,127 |
34,853 |
33 |
162 |
753 |
2,179 |
8,890 |
23,081 |
2,882 |
|
|
|
|
|
|
Forcible |
|
Aggravated |
|
Larceny- |
Vehicle |
| Year |
Population |
Index |
Violent |
Property |
Murder |
Rape |
Robbery |
assault |
Burglary |
Theft |
Theft |
| 1980 |
594,779 |
40,306 |
2,824 |
37,482 |
41 |
144 |
815 |
1,824 |
9,698 |
25,077 |
2,707 |
| 1981 |
598,000 |
40,002 |
3,044 |
36,958 |
40 |
170 |
844 |
1,990 |
9,627 |
24,759 |
2,572 |
| 1982 |
602,000 |
38,437 |
3,370 |
35,067 |
32 |
186 |
737 |
2,415 |
8,698 |
23,891 |
2,478 |
| 1983 |
606,000 |
33,124 |
2,746 |
30,378 |
25 |
229 |
699 |
1,793 |
7,414 |
20,908 |
2,056 |
| 1984 |
613,000 |
30,692 |
2,671 |
28,021 |
25 |
300 |
711 |
1,635 |
6,678 |
19,747 |
1,596 |
| 1985 |
622,000 |
30,859 |
2,695 |
28,164 |
30 |
296 |
773 |
1,596 |
6,826 |
19,638 |
1,700 |
| 1986 |
633,000 |
30,584 |
2,703 |
27,881 |
31 |
360 |
786 |
1,526 |
6,598 |
19,562 |
1,721 |
| 1987 |
644,000 |
31,806 |
2,774 |
29,032 |
33 |
441 |
789 |
1,511 |
6,572 |
20,453 |
2,007 |
| 1988 |
660,000 |
31,674 |
2,981 |
28,693 |
34 |
491 |
784 |
1,672 |
6,868 |
19,824 |
2,001 |
| 1989 |
673,000 |
32,743 |
3,745 |
28,998 |
34 |
569 |
934 |
2,208 |
6,072 |
20,294 |
2,632 |
|
|
|
|
|
|
Forcible |
|
Aggravated |
|
Larceny- |
Vehicle |
| Year |
Population |
Index |
Violent |
Property |
Murder |
Rape |
Robbery |
assault |
Burglary |
Theft |
Theft |
| 1990 |
666,168 |
35,709 |
4,365 |
31,344 |
33 |
587 |
1,098 |
2,647 |
6,465 |
21,922 |
2,957 |
| 1991 |
680,000 |
39,912 |
4,857 |
35,055 |
37 |
588 |
1,460 |
2,772 |
7,668 |
24,836 |
2,551 |
| 1992 |
689,000 |
33,406 |
4,280 |
29,126 |
32 |
591 |
1,042 |
2,615 |
6,598 |
20,419 |
2,109 |
| 1993 |
700,000 |
34,105 |
4,801 |
29,304 |
35 |
539 |
1,307 |
2,920 |
6,244 |
20,853 |
2,207 |
| 1994 |
706,000 |
34,520 |
4,549 |
29,271 |
33 |
546 |
1,141 |
2,829 |
6,198 |
20,828 |
2,945 |
| 1995 |
717,000 |
36,988 |
5,198 |
31,790 |
25 |
575 |
1,425 |
3,173 |
6,491 |
22,329 |
2,970 |
| 1996 |
725,000 |
35,488 |
4,845 |
30,643 |
31 |
454 |
1,304 |
3,056 |
5,830 |
21,665 |
3,148 |
| 1997 |
732,000 |
37,612 |
4,962 |
32,650 |
18 |
476 |
1,314 |
3,154 |
5,620 |
23,312 |
3,718 |
| 1998 |
744,000 |
39,902 |
5,672 |
34,230 |
21 |
499 |
1,445 |
3,707 |
6,395 |
24,649 |
3,186 |
| 1999 |
753,538 |
36,456 |
5,534 |
30,922 |
24 |
529 |
1,492 |
3,489 |
5,245 |
22,634 |
3,043 |
|
|
|
|
|
|
Forcible |
|
Aggravated |
|
Larceny- |
Vehicle |
| Year |
Population |
Index |
Violent |
Property |
Murder |
Rape |
Robbery |
assault |
Burglary |
Theft |
Theft |
| 2000 |
783,600 |
35,090 |
5,363 |
29,727 |
25 |
424 |
1,394 |
3,520 |
5,216 |
21,360 |
3,151 |
| 2001 |
796,599 |
32,267 |
4,868 |
27,399 |
23 |
420 |
1,156 |
3,269 |
5,144 |
19,476 |
2,779 |
| 2002 |
805,945 |
31,803 |
4,836 |
26,967 |
26 |
358 |
1,154 |
3,298 |
5,355 |
18,555 |
3,057 |
| 2003 |
818,166 |
33,468 |
5,525 |
27,943 |
21 |
370 |
1,441 |
3,693 |
6,066 |
18,933 |
2,944 |
| 2004 |
830,069 |
32,361 |
5,105 |
27,256 |
28 |
357 |
1,343 |
3,377 |
5,669 |
19,285 |
2,302 |
| 2005 |
841,741 |
31,577 |
5,332 |
26,245 |
37 |
377 |
1,306 |
3,612 |
5,811 |
18,085 |
2,349 |
| 2006 |
853,476 |
34,488 |
5,817 |
29,171 |
42 |
400 |
1,735 |
3,640 |
6,189 |
20,166 |
2,816 |
| 2007 |
864,764 |
35,103 |
5,960 |
29,143 |
37 |
336 |
1,706 |
3,881 |
6,341 |
20,486 |
2,316 |
| 2008 |
876,211 |
37,532 |
6,187 |
31,385 |
57 |
371 |
1,847 |
3,912 |
6,783 |
22,045 |
2,557 |
| 2009 |
885,122 |
35,398 |
5,713 |
29,685 |
41 |
395 |
1,680 |
3,597 |
6,943 |
20,836 |
1,906 |
|
|
|
|
|
|
Forcible |
|
Aggravated |
|
Larceny- |
Vehicle |
| Year |
Population |
Index |
Violent |
Property |
Murder |
Rape |
Robbery |
assault |
Burglary |
Theft |
Theft |
| 2010 |
899,792 |
36,686 |
5,608 |
31,078 |
51 |
326 |
1,839 |
3,392 |
7,550 |
21,593 |
1,935 |
| 2011 |
908,137 |
36,307 |
5,144 |
31,163 |
48 |
307 |
1,558 |
3,231 |
7,617 |
22,001 |
1,545 |
| 2012
|
917,053
|
35,755
|
5,048
|
30,707
|
56
|
249
|
1,498
|
3,245
|
7,389
|
21,880
|
1,438
|
| 2013
|
925,240
|
33,634
|
4,633
|
29,001
|
41
|
278
|
1,233
|
2,960
|
6,299
|
21,347
|
1,355
|
| 2014
|
935,968
|
32,483
|
4,568
|
27,915
|
50
|
274
|
1,271
|
2,857
|
5,765
|
20,885
|
1,265
|
| 2015
|
945,934
|
30,175
|
4,720
|
25,455
|
63
|
243
|
1,235
|
3,081
|
4,773
|
19,501
|
1,181
|
|
|
|
Compiled
by the DisasterCenter.com
From:
FBI UCS Annual Crime Reports |
The
Uniform Crime
Reporting
(UCR) Program is the starting place
for those seeking
information on crime in the nation. The UCR is produced from data
received from over 18,000 law enforcement agencies voluntarily
participating
in the program. . |
|
|
| Delaware Population
and Rate of Crime per
100,000 People
1960 -
2015 |
|
|
|
|
|
|
Forcible |
|
Aggravated |
|
Larceny- |
Vehicle |
| Year |
Population |
Index |
Violent |
Property |
Murder |
Rape |
Robbery |
assault |
Burglary |
Theft |
Theft |
| 1960 |
446,292 |
2,160.5 |
84.0 |
2,076.4 |
7.4 |
9.2 |
35.2 |
32.3 |
596.2 |
1,314.6 |
165.6 |
| 1961 |
458,000 |
2,109.4 |
69.4 |
2,040.0 |
4.4 |
5.9 |
27.1 |
32.1 |
591.9 |
1,284.9 |
163.1 |
| 1962 |
469,000 |
2,237.7 |
72.1 |
2,165.7 |
4.3 |
9.4 |
29.9 |
28.6 |
600.0 |
1,381.4 |
184.2 |
| 1963 |
476,000 |
2,377.3 |
89.1 |
2,288.2 |
5.0 |
9.0 |
38.0 |
37.0 |
707.1 |
1,377.9 |
203.2 |
| 1964 |
491,000 |
2,513.6 |
110.2 |
2,403.5 |
4.7 |
8.1 |
41.3 |
56.0 |
674.7 |
1,468.6 |
260.1 |
| 1965 |
505,000 |
2,408.7 |
111.1 |
2,297.6 |
5.7 |
6.5 |
56.6 |
42.2 |
647.9 |
1,398.4 |
251.3 |
| 1966 |
512,000 |
2,619.7 |
127.9 |
2,491.8 |
9.0 |
9.6 |
58.6 |
50.8 |
762.3 |
1,458.8 |
270.7 |
| 1967 |
524,000 |
2,891.6 |
180.9 |
2,710.7 |
8.6 |
11.5 |
65.5 |
95.4 |
832.1 |
1,500.2 |
378.4 |
| 1968 |
534,000 |
3,165.5 |
241.2 |
2,924.3 |
8.4 |
14.0 |
105.1 |
113.7 |
885.0 |
1,619.3 |
420.0 |
| 1969 |
540,000 |
3,501.7 |
294.1 |
3,207.6 |
8.0 |
13.7 |
117.6 |
154.8 |
877.2 |
1,859.8 |
470.6 |
|
|
|
|
|
|
Forcible |
|
Aggravated |
|
Larceny- |
Vehicle |
| Year |
Population |
Index |
Violent |
Property |
Murder |
Rape |
Robbery |
assault |
Burglary |
Theft |
Theft |
| 1970 |
548,104 |
4,263.1 |
327.5 |
3,935.6 |
7.7 |
18.6 |
105.5 |
195.8 |
1,056.2 |
2,320.4 |
559.0 |
| 1971 |
558,000 |
5,015.1 |
369.2 |
4,645.9 |
6.1 |
18.3 |
144.1 |
200.7 |
1,390.5 |
2,670.6 |
584.8 |
| 1972 |
565,000 |
4,523.7 |
386.0 |
4,137.7 |
6.9 |
14.2 |
130.1 |
234.9 |
1,249.4 |
2,397.2 |
491.2 |
| 1973 |
576,000 |
4,582.6 |
350.0 |
4,232.6 |
5.9 |
15.8 |
90.3 |
238.0 |
1,219.4 |
2,526.4 |
486.8 |
| 1974 |
573,000 |
5,949.6 |
443.1 |
5,506.5 |
10.3 |
17.3 |
127.9 |
287.6 |
1,517.8 |
3,459.9 |
528.8 |
| 1975 |
579,000 |
6,668.2 |
392.1 |
6,276.2 |
7.3 |
18.1 |
157.2 |
209.5 |
1,826.3 |
3,926.9 |
523.0 |
| 1976 |
582,000 |
6,264.4 |
321.6 |
5,942.8 |
6.2 |
17.7 |
128.7 |
169.1 |
1,542.6 |
3,915.8 |
484.4 |
| 1977 |
582,000 |
6,210.1 |
382.1 |
5,828.0 |
6.0 |
24.9 |
157.0 |
194.2 |
1,682.6 |
3,678.4 |
467.0 |
| 1978 |
583,000 |
6,353.9 |
440.7 |
5,913.2 |
6.7 |
20.4 |
145.5 |
268.1 |
1,623.7 |
3,792.6 |
496.9 |
| 1979 |
582,000 |
6,525.8 |
537.3 |
5,988.5 |
5.7 |
27.8 |
129.4 |
374.4 |
1,527.5 |
3,965.8 |
495.2 |
|
|
|
|
|
|
Forcible |
|
Aggravated |
|
Larceny- |
Vehicle |
| Year |
Population |
Index |
Violent |
Property |
Murder |
Rape |
Robbery |
assault |
Burglary |
Theft |
Theft |
| 1980 |
594,779 |
6,776.6 |
474.8 |
6,301.8 |
6.9 |
24.2 |
137.0 |
306.7 |
1,630.5 |
4,216.2 |
455.1 |
| 1981 |
598,000 |
6,689.3 |
509.0 |
6,180.3 |
6.7 |
28.4 |
141.1 |
332.8 |
1,609.9 |
4,140.3 |
430.1 |
| 1982 |
602,000 |
6,384.9 |
559.8 |
5,825.1 |
5.3 |
30.9 |
122.4 |
401.2 |
1,444.9 |
3,968.6 |
411.6 |
| 1983 |
606,000 |
5,466.0 |
453.1 |
5,012.9 |
4.1 |
37.8 |
115.3 |
295.9 |
1,223.4 |
3,450.2 |
339.3 |
| 1984 |
613,000 |
5,006.9 |
435.7 |
4,571.1 |
4.1 |
48.9 |
116.0 |
266.7 |
1,089.4 |
3,221.4 |
260.4 |
| 1985 |
622,000 |
4,961.3 |
433.3 |
4,528.0 |
4.8 |
47.6 |
124.3 |
256.6 |
1,097.4 |
3,157.2 |
273.3 |
| 1986 |
633,000 |
4,831.6 |
427.0 |
4,404.6 |
4.9 |
56.9 |
124.2 |
241.1 |
1,042.3 |
3,090.4 |
271.9 |
| 1987 |
644,000 |
4,938.8 |
430.7 |
4,508.1 |
5.1 |
68.5 |
122.5 |
234.6 |
1,020.5 |
3,175.9 |
311.6 |
| 1988 |
660,000 |
4,799.1 |
451.7 |
4,347.4 |
5.2 |
74.4 |
118.8 |
253.3 |
1,040.6 |
3,003.6 |
303.2 |
| 1989 |
673,000 |
4,865.2 |
556.5 |
4,308.8 |
5.1 |
84.5 |
138.8 |
328.1 |
902.2 |
3,015.5 |
391.1 |
|
|
|
|
|
|
Forcible |
|
Aggravated |
|
Larceny- |
Vehicle |
| Year |
Population |
Index |
Violent |
Property |
Murder |
Rape |
Robbery |
assault |
Burglary |
Theft |
Theft |
| 1990 |
666,168 |
5,360.4 |
655.2 |
4,705.1 |
5.0 |
88.1 |
164.8 |
397.3 |
970.5 |
3,290.8 |
443.9 |
| 1991 |
680,000 |
5,869.4 |
714.3 |
5,155.1 |
5.4 |
86.5 |
214.7 |
407.6 |
1,127.6 |
3,652.4 |
375.1 |
| 1992 |
689,000 |
4,848.5 |
621.2 |
4,227.3 |
4.6 |
85.8 |
151.2 |
379.5 |
957.6 |
2,963.6 |
306.1 |
| 1993 |
700,000 |
4,872.1 |
685.9 |
4,186.3 |
5.0 |
77.0 |
186.7 |
417.1 |
892.0 |
2,979.0 |
315.3 |
| 1994 |
706,000 |
4,889.5 |
644.3 |
4,146.0 |
4.7 |
77.3 |
161.6 |
400.7 |
877.9 |
2,950.1 |
417.1 |
| 1995 |
717,000 |
5,158.7 |
725.0 |
4,433.8 |
3.5 |
80.2 |
198.7 |
442.5 |
905.3 |
3,114.2 |
414.2 |
| 1996 |
725,000 |
4,894.9 |
668.3 |
4,226.6 |
4.3 |
62.6 |
179.9 |
421.5 |
804.1 |
2,988.3 |
434.2 |
| 1997 |
732,000 |
5,138.3 |
677.9 |
4,460.4 |
2.5 |
65.0 |
179.5 |
430.9 |
767.8 |
3,184.7 |
507.9 |
| 1998 |
744,000 |
5,363.2 |
762.4 |
4,600.8 |
2.8 |
67.1 |
194.2 |
498.3 |
859.5 |
3,313.0 |
428.2 |
| 1999 |
753,538 |
4,838.0 |
734.4 |
4,103.6 |
3.2 |
70.2 |
198.0 |
463.0 |
696.0 |
3,003.7 |
403.8 |
|
|
|
|
|
|
Forcible |
|
Aggravated |
|
Larceny- |
Vehicle |
| Year |
Population |
Index |
Violent |
Property |
Murder |
Rape |
Robbery |
assault |
Burglary |
Theft |
Theft |
| 2000 |
783,600 |
4,478.1 |
684.4 |
3,793.6 |
3.2 |
54.1 |
177.9 |
449.2 |
665.6 |
2,725.9 |
402.1 |
| 2001 |
796,599 |
4,050.6 |
611.1 |
3,439.5 |
2.9 |
52.7 |
145.1 |
410.4 |
645.7 |
2,444.9 |
348.9 |
| 2002 |
805,945 |
3,946.0 |
600.0 |
3,346.0 |
3.2 |
44.4 |
143.2 |
409.2 |
664.4 |
2,302.3 |
379.3 |
| 2003 |
818,166 |
4,090.6 |
675.3 |
3,415.3 |
2.6 |
45.2 |
176.1 |
451.4 |
741.4 |
2,314.1 |
359.8 |
| 2004 |
830,069 |
3,898.6 |
615.0 |
3,283.6 |
3.4 |
43.0 |
161.8 |
406.8 |
683.0 |
2,323.3 |
277.3 |
| 2005 |
841,741 |
3,750.3 |
633.4 |
3,117.9 |
4.4 |
44.7 |
155.2 |
429.1 |
690.4 |
2,148.5 |
279.1 |
| 2006 |
853,476 |
4,099.5 |
681.6 |
3,417.9 |
4.9 |
46.9 |
203.3 |
426.5 |
725.2 |
2,362.8 |
329.9 |
| 2007 |
864,764 |
4,059.3 |
689.2 |
3,370.1 |
4.3 |
38.9 |
197.3 |
448.8 |
733.3 |
2,369.0 |
267.8 |
| 2008 |
876,211 |
4,288.7 |
706.1 |
3,581.9 |
6.5 |
42.3 |
210.8 |
446.5 |
774.1 |
2,515.9 |
291.8 |
| 2009 |
885,122 |
3,999.2 |
645.4 |
3,353.8 |
4.6 |
44.6 |
189.8 |
406.4 |
784.4 |
2,354.0 |
215.3 |
|
|
|
|
|
|
Forcible |
|
Aggravated |
|
Larceny- |
Vehicle |
| Year |
Population |
Index |
Violent |
Property |
Murder |
Rape |
Robbery |
assault |
Burglary |
Theft |
Theft |
| 2010 |
899,792 |
4,077.2 |
623.3 |
3,453.9 |
5.7 |
36.2 |
204.4 |
377.0 |
839.1 |
2,399.8 |
215.0 |
| 2011 |
908,137 |
3,997.9 |
566.4 |
3,431.5 |
5.3 |
33.8 |
171.6 |
355.8 |
838.8 |
2,422.7 |
170.1 |
| 2012
|
917,053
|
3,898.9
|
550.5
|
3,348.4
|
6.1
|
27.2
|
163.3
|
353.9
|
805.7
|
2,385.9
|
156.8
|
| 2013
|
925,240
|
3,635.1
|
500.7
|
3,134.4
|
4.4
|
30.0
|
133.3
|
319.9
|
680.8
|
2,307.2
|
146.4
|
| 2014
|
935,968
|
3,470.6
|
488.1
|
2,982.5
|
5.3
|
29.3
|
135.8
|
305.2
|
615.9
|
2,231.4
|
135.2
|
| 2015
|
945,934
|
3,190.0
|
499.0
|
2,691.0
|
6.7
|
25.7
|
130.6
|
325.7
|
504.6
|
2,061.6
|
124.9
|
|
| DisasterCenter.com
developed the following table to rank the rates of
crime in
Delaware over time in relation to the rates of crime of other
States . This new
way to examine fluctuations in the crime rate reveals patterns that are
important for
law enforcement executives, students of criminal justice, researchers,
members of the media, and the public at large seeking information on
crime in the nation..
|
|
The crime
"Index" is
made up of the total number of violent and
property crimes. Since most crime is
property related the crime index gives more weight to property
crime. |
|
|
Delaware Population
and
Rate of Crime
Rank Compared
to other States
|
| State |
Year |
Population |
Index |
Violent |
Property |
Murder |
Rape |
Robbery |
Assault |
Burglary |
Larceny |
Vehicle |
| Delaware |
1960 |
45 |
13 |
28 |
10 |
16 |
14 |
16 |
30 |
7 |
14 |
21 |
| Delaware |
1961 |
45 |
12 |
29 |
12 |
22 |
31 |
25 |
30 |
9 |
15 |
22 |
| Delaware |
1962 |
45 |
13 |
29 |
10 |
22 |
11 |
23 |
32 |
9 |
13 |
21 |
| Delaware |
1963 |
45 |
13 |
27 |
11 |
22 |
14 |
16 |
30 |
7 |
14 |
18 |
| Delaware |
1964 |
45 |
14 |
29 |
13 |
21 |
30 |
18 |
31 |
9 |
13 |
12 |
| Delaware |
1965 |
46 |
18 |
29 |
17 |
17 |
36 |
10 |
41 |
12 |
19 |
14 |
| Delaware |
1966 |
46 |
18 |
29 |
17 |
11 |
29 |
13 |
38 |
11 |
19 |
17 |
| Delaware |
1967 |
46 |
18 |
23 |
18 |
14 |
24 |
18 |
22 |
15 |
21 |
13 |
| Delaware |
1968 |
46 |
20 |
16 |
19 |
15 |
21 |
10 |
21 |
18 |
23 |
15 |
| Delaware |
1969 |
46 |
18 |
14 |
19 |
19 |
27 |
11 |
17 |
19 |
21 |
15 |
| State |
Year |
Population |
Index |
Violent |
Property |
Murder |
Rape |
Robbery |
Assault |
Burglary |
Larceny |
Vehicle |
| Delaware |
1970 |
46 |
14 |
14 |
15 |
22 |
15 |
17 |
11 |
16 |
13 |
8 |
| Delaware |
1971 |
46 |
10 |
15 |
11 |
28 |
20 |
11 |
15 |
11 |
12 |
6 |
| Delaware |
1972 |
46 |
13 |
14 |
12 |
26 |
36 |
16 |
12 |
12 |
13 |
10 |
| Delaware |
1973 |
46 |
14 |
22 |
13 |
32 |
37 |
25 |
15 |
17 |
13 |
14 |
| Delaware |
1974 |
46 |
10 |
15 |
10 |
19 |
35 |
21 |
8 |
14 |
8 |
15 |
| Delaware |
1975 |
47 |
8 |
23 |
6 |
30 |
32 |
18 |
22 |
9 |
5 |
11 |
| Delaware |
1976 |
47 |
9 |
25 |
7 |
30 |
36 |
21 |
31 |
15 |
5 |
12 |
| Delaware |
1977 |
47 |
7 |
24 |
7 |
29 |
26 |
13 |
26 |
8 |
6 |
13 |
| Delaware |
1978 |
47 |
7 |
18 |
7 |
29 |
34 |
20 |
17 |
9 |
6 |
12 |
| Delaware |
1979 |
47 |
8 |
14 |
8 |
32 |
26 |
23 |
8 |
17 |
6 |
13 |
| State |
Year |
Population |
Index |
Violent |
Property |
Murder |
Rape |
Robbery |
Assault |
Burglary |
Larceny |
Vehicle |
| Delaware |
1980 |
47 |
9 |
20 |
8 |
29 |
34 |
23 |
16 |
21 |
6 |
15 |
| Delaware |
1981 |
47 |
10 |
19 |
10 |
28 |
28 |
22 |
13 |
19 |
7 |
15 |
| Delaware |
1982 |
47 |
11 |
15 |
11 |
31 |
20 |
26 |
5 |
16 |
7 |
15 |
| Delaware |
1983 |
47 |
15 |
20 |
13 |
35 |
15 |
23 |
15 |
23 |
11 |
19 |
| Delaware |
1984 |
47 |
17 |
21 |
15 |
33 |
7 |
22 |
21 |
26 |
15 |
28 |
| Delaware |
1985 |
47 |
21 |
22 |
21 |
31 |
9 |
22 |
22 |
26 |
16 |
29 |
| Delaware |
1986 |
47 |
23 |
25 |
24 |
33 |
4 |
23 |
28 |
30 |
17 |
30 |
| Delaware |
1987 |
47 |
24 |
24 |
24 |
30 |
1 |
21 |
27 |
32 |
17 |
28 |
| Delaware |
1988 |
47 |
28 |
26 |
27 |
31 |
1 |
22 |
28 |
30 |
21 |
30 |
| Delaware |
1989 |
46 |
27 |
18 |
27 |
31 |
1 |
21 |
20 |
33 |
19 |
26 |
| State |
Year |
Population |
Index |
Violent |
Property |
Murder |
Rape |
Robbery |
Assault |
Burglary |
Larceny |
Vehicle |
| Delaware |
1990 |
46 |
23 |
16 |
25 |
30 |
1 |
18 |
18 |
32 |
16 |
24 |
| Delaware |
1991 |
46 |
18 |
16 |
18 |
31 |
2 |
15 |
18 |
27 |
9 |
28 |
| Delaware |
1992 |
46 |
29 |
22 |
31 |
34 |
2 |
23 |
23 |
30 |
25 |
35 |
| Delaware |
1993 |
46 |
27 |
19 |
28 |
33 |
2 |
18 |
21 |
30 |
23 |
36 |
| Delaware |
1994 |
46 |
26 |
21 |
28 |
34 |
1 |
23 |
21 |
30 |
26 |
27 |
| Delaware |
1995 |
46 |
22 |
12 |
25 |
41 |
2 |
12 |
14 |
26 |
21 |
26 |
| Delaware |
1996 |
46 |
23 |
12 |
26 |
31 |
3 |
12 |
14 |
30 |
24 |
24 |
| Delaware |
1997 |
46 |
19 |
12 |
18 |
41 |
2 |
11 |
11 |
29 |
16 |
16 |
| Delaware |
1998 |
45 |
11 |
7 |
13 |
40 |
2 |
9 |
6 |
21 |
11 |
19 |
| Delaware |
1999 |
45 |
13 |
5 |
15 |
36 |
2 |
6 |
6 |
25 |
14 |
20 |
| State |
Year |
Population |
Index |
Violent |
Property |
Murder |
Rape |
Robbery |
Assault |
Burglary |
Larceny |
Vehicle |
| Delaware |
2000 |
45 |
17 |
6 |
19 |
32 |
2 |
6 |
7 |
24 |
20 |
20 |
| Delaware |
2001 |
45 |
28 |
9 |
29 |
36 |
2 |
17 |
9 |
27 |
29 |
28 |
| Delaware |
2002 |
45 |
28 |
9 |
29 |
30 |
10 |
15 |
7 |
26 |
31 |
22 |
| Delaware |
2003 |
45 |
22 |
5 |
27 |
38 |
8 |
7 |
5 |
20 |
30 |
23 |
| Delaware |
2004 |
45 |
25 |
9 |
29 |
31 |
8 |
7 |
8 |
23 |
27 |
32 |
| Delaware |
2005 |
45 |
26 |
6 |
30 |
29 |
5 |
10 |
7 |
25 |
30 |
32 |
| Delaware |
2006 |
45 |
20 |
7 |
25 |
24 |
4 |
3 |
7 |
20 |
23 |
23 |
| Delaware |
2007 |
45 |
18 |
6 |
24 |
27 |
11 |
4 |
7 |
20 |
17 |
28 |
| Delaware |
2008 |
45 |
12 |
4 |
14 |
12 |
9 |
3 |
7 |
17 |
13 |
19 |
| Delaware |
2009 |
45 |
14 |
4 |
16 |
23 |
8 |
3 |
8 |
17 |
12 |
24 |
| State |
Year |
Population |
Index |
Violent |
Property |
Murder |
Rape |
Robbery |
Assault |
Burglary |
Larceny |
Vehicle |
| Delaware |
2010 |
45 |
6 |
3 |
11 |
12 |
12 |
1 |
7 |
14 |
10 |
24 |
| Delaware |
2011 |
45 |
9 |
6 |
13 |
15 |
18 |
2 |
7 |
15 |
3 |
32 |
| Delaware |
2012 |
45 |
10 |
6 |
13 |
9 |
30 |
3 |
6 |
14 |
7 |
35 |
| Delaware |
2013 |
45 |
14 |
7 |
16 |
24 |
20 |
7 |
8 |
17 |
9 |
36 |
| Delaware |
2014 |
45 |
11 |
8 |
14 |
8 |
20 |
3 |
9 |
17 |
10 |
37 |
| Delaware |
2015 |
45 |
19 |
8 |
21 |
8 |
35 |
4 |
10 |
20 |
14 |
40 |
| State |
Year |
Population |
Index |
Violent |
Property |
Murder |
Rape |
Robbery |
Assault |
Burglary |
Larceny |
Vehicle |
|
| Since we developed
the table
of "Delaware
Population
and
Rate of Crime
Rank Compared
to other States", we are interested in hearing how others are using the
table. Email:
<EMAIL_ADDRESS>|
|
|
|
|
| *
United States * Alaska* Alabama
* Arkansas
*
Arizona
*
California
*
Colorado
*
Connecticut* Delaware
* Florida
*
Georgia
*
Hawaii
*
Iowa
*
Idaho
*
Illinois
*
Indiana
*
Kansas
*
Kentucky *
Louisiana
*
Massachusetts
*
Maryland *
Maine
*
Michigan
*
Minnesota
*
Missouri
*
Mississippi
*
Montana
*
North
Carolina *
North
Dakota *
Nebraska
*
New
Hampshire *
New
Jersey *
New
Mexico *
Nevada
*
New
York *
Ohio
*
Oklahoma
*
Oregon
*
Pennsylvania
*
Rhode
Island *
South
Carolina *
South
Dakota *
Tennessee
*
Texas
*
Utah
*
Virginia *
Vermont
*
Washington
D. C. *
Washington *
Wisconsin
*
West
Virginia *
Wyoming
* |
|


Preparation time
overnight
Cooking time
30 mins to 1 hour
Serves
Serves 6
Dietary
A bread loaf is packed with sweet roasted vegetables, mozzarella and fresh basil to make a delicious addition to a picnic, or serve in slices at home with crisp croutons for contrast.
Preheat the oven to 180C/350F/Gas 4. Place all the chopped vegetables in a bowl and drizzle with half the oil and season with salt and pepper.
Toss to coat all the vegetables in the oil. Scatter the vegetables in a single layer on a baking tray and roast until the vegetables are softened, about 15 minutes. You may need to do this in two batches.
Cut the top off the loaf to create a lid.
Hollow out the loaf by scooping out the soft bread (keeping it in large chunks) and leaving an edge of around 3cm/1¼in so that the shell isn’t too thin.
Place half of the removed inner bread in a food processor and pulse to make breadcrumbs.
Mix the remaining oil with the sherry vinegar, breadcrumbs and garlic then mix with any juices from the roasting tin. Divide the liquor between the vegetables, season with salt and pepper and toss together. Leave to stand for an hour so that the vegetables and breadcrumbs soak up the juices.
Slice the mozzarella and pat dry with kitchen paper.
Take the hollowed out loaf and spread the pesto over the base. Begin layering the vegetables starting with the red pepper, then the aubergine, the mozzarella, the yellow pepper and finally the courgette, adding a little ripped basil between the layers. Repeat the layers until the loaf is full. Put the lid on, wrap tightly with cling film and place in the fridge overnight.
Slice the loaf and serve.


Sweather is a simple weather web app (PWA). Sweather is a king of portmanteau of the words "simple" and "weather". Sweather uses the National Weather Service API to get weather data and puts it on a simple webpage. Also, Sweather doesn't collect or do anything with your personal data.
Sweather uses the NWS API to find your local weather from your provided location and the US Census Bureau Geocoding Service to turn your provided zipcode into a usable location.
Sweather is still in progress. Here's a list of things Sweather hopes to accomplish


Ping-Pong
Play Now
Rules:
Ping-pong will count from 1 up to a number of your choice with the following exceptions:
Numbers divisible by 3 become "ping"
Numbers divisible by 5 become "pong"
Numbers divisible by 15 become "ping-pong"
PING !
PONG !
Let's Play:
Please enter a number greater than 0
Ping-pong!
Reset
back to top


Resume
Overview
Curious developer with 5+ years of experience architecting, developing, deploying and maintaining various pieces of software. Recognized for exceptional auto-didactic nature and being a tenacious problem-solver.
Skills & Abilities
- Built and maintained a backend service in Kotlin (for around 3 years) for a product with more than 5000 active users.
- Built and contributed to 11 published apps (both in Kotlin and Java) on the Play Store. Worked on many other apps from their design to device phases.
- Comfortable working with: Creating and consuming APIs (including integrations with other services), Unit & Integration testing, Continuous Integration, Software Architecture, Payments Integration, Git, Python, NodeJS.
- Mentored multiple developers over the years both as a mobile and a backend engineer to develop their own vision towards a better craft approach.
Experience
Product Engineer (Backend) - Remote | Obvious | 08/2020 - Ongoing
- Develop Obvious' first product - Pause (https://getpause.com)
- Partnered with product and design teams to understand their requirements and vision for the software
-
Constructed the architecture of the backend system consisting of PostgreSQL as database and a Kotlin codebase
for REST API and integrations with third-party services
- Developed the REST API to be used from the web-app
- Built the integrations with Slack and Google Calendar
- Integrated multi-currency payment flow using Stripe
- Lead the backend team and eventually the whole engineering team of Pause
- Wrote support documentation in form of how-to guides for various tasks in Pause
- Provided support to customers by both directly replying to their questions and by working on concerns brought up by the support team
- Ongoing maintenance in forms of debugging and fixing any discovered bugs in the backend system
Product Engineer (Mobile) - Remote | Obvious | 04/2020 - 07/2020
- Developed MVP of an Android application for a fintech client project in collaboration with team members
- Architect the structure of the application and its code organization
- Communicate with client team and design team ton understand their requirements
- Wrote the code for their periodic SMS sync feature on Android
Android Developer - Remote | Deliverr | 05/2018 - 05/2019
- Developed Customer, Driver and Store-Manager Android applications for Deliverr platform (https://deliverr.ca)
- Worked with one other engineer to add new features to the existing Customer and Driver applications
- Architect and code the redesign of customer app to allow item-customisation and improve user-experience
- Integrate existing applications with Firebase to add support for social-login via Google accounts
Android Developer | Crawded Technologies Pvt. Ltd. | 01/2015 - 06/2015
- Developed the MVP of their SchoolWeb and Crawded platforms' Android applications in a team of engineers
- Architected and coded the home-page feed in their Android applications
Android Developer | Udaan Dev Team | 2015 - 2017 | Volunteer
- Created companion Android application for Udaan (our college’s tech-fest) for 3 years by working alongside a team of 8 other peers to work through the design to deployment phases
- Mentored a budding Android developer through the phases of designing to publishing to Play Store
Education
- Bachelor of Engineering (Computer Science) | Birla Vishvakarma Mahavidyalaya Engineering College | (2013 - 2017)
Other Projects
- Typractice: A tracker-free and ad-free website where you can practice typing. (Website | GitHub)
- Contacts Calendar: Website to export a calendar of birthdays from your Google Contacts. (Website | GitHub)
- Improvement Roll: A website suggesting useful things to do in short breaks. (Website | GitHub)
- To-Read Manager: This app helps me manage my to-read links at one place on my phone without sharing it with any third-party. (GitHub | Play Store)
- My Places: This is an application which helps me record locations which I want to save and keep track of. (GitHub | Play Store)
Some of my writing (link to my blog)
Other Certifications
- Android Developer Nanodegree | Udacity (Certificate)
- Back End Development and APIs | freeCodeCamp (Certificate)
- JavaScript Algorithms and Data Structures | freeCodeCamp ( Certificate)
- Responsive Web Design | freeCodeCamp (Certificate)
You can also download a PDF version of this resume from here.


b:prettyprint An embeddable component that makes source-code snippets prettier.
See Google documentation for detailed information.