source
code documentation
sha1.c File Reference
Detailed Description
RFC 3174 - US Secure Hash Algorithm 1 (SHA1) and RFC 2104 - HMAC: Keyed-Hashing for Message Authentication.
- Author:
- Christian Scheurer <http://www.christianscheurer.ch>
OUTLINE: RFC3174 (US Secure Hash Algorithm 1 (SHA1)) implementation. Requires Infineon C167 MCU and Keil C166 compiler.
IMPLEMENTATION: "This product includes cryptographic software written by Eric Young (eay@cryptsoft.com)" (taken form www.openssl.org)"
NOTES:
This document is part of embedded IPsec
Copyright (c) 2003 Niklaus Schild and Christian Scheurer, HTI Biel/Bienne
All rights reserved.
This file contains code from the OpenSSL Project
portions Copyright (c) 1998-2003 OpenSSL (www.openssl.org)
Definition in file sha1.c.
#include <string.h>
#include "ipsec/sha1.h"
#include "ipsec/debug.h"
Go to the source code of this file.
|
Defines |
| #define | Xupdate(a, ix, ia, ib, ic, id) |
| #define | SHA_CBLOCK (SHA_LBLOCK*4) |
| #define | SHA_LAST_BLOCK (SHA_CBLOCK-8) |
| #define | SHA_LBLOCK (SHA_CBLOCK/4) |
| #define | HOST_c2l(c, l) |
| #define | HOST_p_c2l(c, l, n) |
| #define | HOST_p_c2l_p(c, l, sc, len) |
| #define | HOST_c2l_p(c, l, n) |
| #define | HOST_l2c(l, c) |
| #define | INIT_DATA_h0 0x67452301UL |
| #define | INIT_DATA_h1 0xefcdab89UL |
| #define | INIT_DATA_h2 0x98badcfeUL |
| #define | INIT_DATA_h3 0x10325476UL |
| #define | INIT_DATA_h4 0xc3d2e1f0UL |
| #define | K_00_19 0x5a827999UL |
| #define | K_20_39 0x6ed9eba1UL |
| #define | K_40_59 0x8f1bbcdcUL |
| #define | K_60_79 0xca62c1d6UL |
| #define | F_00_19(b, c, d) ((((c) ^ (d)) & (b)) ^ (d)) |
| #define | F_20_39(b, c, d) ((b) ^ (c) ^ (d)) |
| #define | F_40_59(b, c, d) (((b) & (c)) | (((b)|(c)) & (d))) |
| #define | F_60_79(b, c, d) F_20_39(b,c,d) |
| #define | BODY_00_15(i, a, b, c, d, e, f, xi) |
| #define | BODY_16_19(i, a, b, c, d, e, f, xi, xa, xb, xc, xd) |
| #define | BODY_20_31(i, a, b, c, d, e, f, xi, xa, xb, xc, xd) |
| #define | BODY_32_39(i, a, b, c, d, e, f, xa, xb, xc, xd) |
| #define | BODY_40_59(i, a, b, c, d, e, f, xa, xb, xc, xd) |
| #define | BODY_60_79(i, a, b, c, d, e, f, xa, xb, xc, xd) |
| #define | X(i) XX##i |
Functions |
| unsigned char * | SHA1 (const unsigned char *d, unsigned long n, unsigned char *md) |
| void | sha1_block_host_order (SHA_CTX *c, const void *p, int num) |
| void | sha1_block_data_order (SHA_CTX *c, const void *p, int num) |
| void | SHA1_Update (SHA_CTX *c, const void *data_, unsigned long len) |
| void | SHA1_Transform (SHA_CTX *c, const unsigned char *data) |
| void | SHA1_Final (unsigned char *md, SHA_CTX *c) |
| void | SHA1_Init (SHA_CTX *c) |
| void | hmac_sha1 (unsigned char *text, int text_len, unsigned char *key, int key_len, unsigned char *digest) |
Define Documentation
| #define BODY_00_15 |
( |
i, |
|
|
a, |
|
|
b, |
|
|
c, |
|
|
d, |
|
|
e, |
|
|
f, |
|
|
xi |
|
) |
|
|
|
|
Value:
Definition at line 336 of file sha1.c. |
| #define BODY_16_19 |
( |
i, |
|
|
a, |
|
|
b, |
|
|
c, |
|
|
d, |
|
|
e, |
|
|
f, |
|
|
xi, |
|
|
xa, |
|
|
xb, |
|
|
xc, |
|
|
xd |
|
) |
|
|
|
|
Value:
Definition at line 340 of file sha1.c. |
| #define BODY_20_31 |
( |
i, |
|
|
a, |
|
|
b, |
|
|
c, |
|
|
d, |
|
|
e, |
|
|
f, |
|
|
xi, |
|
|
xa, |
|
|
xb, |
|
|
xc, |
|
|
xd |
|
) |
|
|
|
|
Value:
Definition at line 345 of file sha1.c. |
| #define BODY_32_39 |
( |
i, |
|
|
a, |
|
|
b, |
|
|
c, |
|
|
d, |
|
|
e, |
|
|
f, |
|
|
xa, |
|
|
xb, |
|
|
xc, |
|
|
xd |
|
) |
|
|
|
|
Value:
Definition at line 350 of file sha1.c. |
| #define BODY_40_59 |
( |
i, |
|
|
a, |
|
|
b, |
|
|
c, |
|
|
d, |
|
|
e, |
|
|
f, |
|
|
xa, |
|
|
xb, |
|
|
xc, |
|
|
xd |
|
) |
|
|
|
|
Value:
Definition at line 355 of file sha1.c. |
| #define BODY_60_79 |
( |
i, |
|
|
a, |
|
|
b, |
|
|
c, |
|
|
d, |
|
|
e, |
|
|
f, |
|
|
xa, |
|
|
xb, |
|
|
xc, |
|
|
xd |
|
) |
|
|
|
|
Value:
Definition at line 360 of file sha1.c. |
| #define F_00_19 |
( |
b, |
|
|
c, |
|
|
d |
|
) |
((((c) ^ (d)) & (b)) ^ (d))
|
|
| #define F_20_39 |
( |
b, |
|
|
c, |
|
|
d |
|
) |
((b) ^ (c) ^ (d))
|
|
| #define F_40_59 |
( |
b, |
|
|
c, |
|
|
d |
|
) |
(((b) & (c)) | (((b)|(c)) & (d)))
|
|
| #define F_60_79 |
( |
b, |
|
|
c, |
|
|
d |
|
) |
F_20_39(b,c,d)
|
|
| #define HOST_c2l |
( |
c, |
|
|
l |
|
) |
|
|
|
|
Value: (l =(((unsigned long)(*((c)++)))<<24), \
l|=(((unsigned long)(*((c)++)))<<16), \
l|=(((unsigned long)(*((c)++)))<< 8), \
l|=(((unsigned long)(*((c)++))) ), \
l)
Definition at line 119 of file sha1.c. |
| #define HOST_c2l_p |
( |
c, |
|
|
l, |
|
|
n |
|
) |
|
|
|
|
Value: { \
l=0; (c)+=n; \
switch (n) { \
case 3: l =((unsigned long)(*(--(c))))<< 8; \
case 2: l|=((unsigned long)(*(--(c))))<<16; \
case 1: l|=((unsigned long)(*(--(c))))<<24; \
} }
Definition at line 140 of file sha1.c. |
| #define HOST_l2c |
( |
l, |
|
|
c |
|
) |
|
|
|
|
Value: (*((c)++)=(unsigned char)(((l)>>24)&0xff), \
*((c)++)=(unsigned char)(((l)>>16)&0xff), \
*((c)++)=(unsigned char)(((l)>> 8)&0xff), \
*((c)++)=(unsigned char)(((l) )&0xff), \
l)
Definition at line 147 of file sha1.c. |
| #define HOST_p_c2l |
( |
c, |
|
|
l, |
|
|
n |
|
) |
|
|
|
|
Value: { \
switch (n) { \
case 0: l =((unsigned long)(*((c)++)))<<24; \
case 1: l|=((unsigned long)(*((c)++)))<<16; \
case 2: l|=((unsigned long)(*((c)++)))<< 8; \
case 3: l|=((unsigned long)(*((c)++))); \
} }
Definition at line 124 of file sha1.c. |
| #define HOST_p_c2l_p |
( |
c, |
|
|
l, |
|
|
sc, |
|
|
len |
|
) |
|
|
|
|
Value: { \
switch (sc) { \
case 0: l =((unsigned long)(*((c)++)))<<24; \
if (--len == 0) break; \
case 1: l|=((unsigned long)(*((c)++)))<<16; \
if (--len == 0) break; \
case 2: l|=((unsigned long)(*((c)++)))<< 8; \
} }
Definition at line 131 of file sha1.c. |
| #define INIT_DATA_h0 0x67452301UL
|
|
| #define INIT_DATA_h1 0xefcdab89UL
|
|
| #define INIT_DATA_h2 0x98badcfeUL
|
|
| #define INIT_DATA_h3 0x10325476UL
|
|
| #define INIT_DATA_h4 0xc3d2e1f0UL
|
|
| #define K_00_19 0x5a827999UL
|
|
| #define K_20_39 0x6ed9eba1UL
|
|
| #define K_40_59 0x8f1bbcdcUL
|
|
| #define K_60_79 0xca62c1d6UL
|
|
| #define SHA_CBLOCK (SHA_LBLOCK*4)
|
|
| #define SHA_LAST_BLOCK (SHA_CBLOCK-8)
|
|
| #define SHA_LBLOCK (SHA_CBLOCK/4)
|
|
| #define Xupdate |
( |
a, |
|
|
ix, |
|
|
ia, |
|
|
ib, |
|
|
ic, |
|
|
id |
|
) |
|
|
|
|
Value: ( (a)=(ia^ib^ic^id), \
ix=(a)=ROTATE((a),1) \
)
Definition at line 73 of file sha1.c. |
Function Documentation
| void hmac_sha1 |
( |
unsigned char * |
text, |
|
|
int |
text_len, |
|
|
unsigned char * |
key, |
|
|
int |
key_len, |
|
|
unsigned char * |
digest |
|
) |
|
|
| unsigned char* SHA1 |
( |
const unsigned char * |
d, |
|
|
unsigned long |
n, |
|
|
unsigned char * |
md |
|
) |
|
|
| void sha1_block_data_order |
( |
SHA_CTX * |
c, |
|
|
const void * |
p, |
|
|
int |
num |
|
) |
|
|
| void sha1_block_host_order |
( |
SHA_CTX * |
c, |
|
|
const void * |
p, |
|
|
int |
num |
|
) |
|
|
| void SHA1_Final |
( |
unsigned char * |
md, |
|
|
SHA_CTX * |
c |
|
) |
|
|
| void SHA1_Transform |
( |
SHA_CTX * |
c, |
|
|
const unsigned char * |
data |
|
) |
|
|
| void SHA1_Update |
( |
SHA_CTX * |
c, |
|
|
const void * |
data_, |
|
|
unsigned long |
len |
|
) |
|
|
|


SUV sent flying into FamilyMart in N. Taiwan
Red light runner sends SUV hurtling into FamilyMart in Taoyuan, Taiwan
by Keoni Everington(Breaking News Commune photo)
TAIPEI (Taiwan News) — An SUV was sent hurtling into a FamilyMart convenience store after it was struck by a vehicle running a red light in northern Taiwan's Taoyuan City early Wednesday morning (Nov. 20).
At 2 a.m. on Wednesday morning, a female driver behind the wheel of a black SUV failed to notice a red light at the intersection of Fuxing Road and Yushan Street in Taoyuan City, reported ETtoday. As she blew through the red light, her vehicle slammed into a white SUV, sending it caroming toward a FamilyMart.
The white SUV smashed tail first through the plate glass entrance of the shop and collided with the checkout counter. It finally came to a stop leaning on the checkout counter at a 45-degree angle.
Fortunately, the clerk on duty happened to be away from the counter at the time of the accident. The crash left shattered glass strewn in all directions and the metal frame of the store's front entrance badly mangled.
According to a preliminary investigation by police, the black SUV ran through a red light and collided into the white SUV, which had the right of way, causing the latter to ricochet out of control into the store, reported UDN. While holding her pet dog and quivering in fear, the driver of the black SUV confessed to police that she had been driving home from work and out of fatigue had failed to notice the red light.
At the time of the accident, there were four passengers in the black vehicle, two of whom required medical treatment. Meanwhile, the driver of the white vehicle only suffered minor injuries from the crash.
Netizens were shocked and awed by the powerful crash:
"Fast and Furious 100."
"This is too dangerous! The car flew too far."
"With a car in hand, the power is infinite."
"This is an expert."
"The concept of a drive-through FamilyMart."
"Another Google scenic spot."
Police are currently investigating the exact cause of the accident by reviewing surveillance camera footage.


projx - Graph transformations in Python.
alpha
projx provides a simple and extensible API for interacting with graphs in Python. Its core functionality is built around making graph transformations using the NetworkX module and a DSL based on Neo4j's Cypher query language. It also provides an extensible ETL pipeline that uses JSON configuration (roughly modeled after orientdb-etl) to translate graph data between various persistent and in-memory representations.
Some other relevant links:
projx on PyPI
Demo Notebook with projx DSL
Demo Notebook with Neo4j2NetworkX
Demo Notebook: Loading the Flickr group graph to Neo4j**
Thanks to @versae for inspiring this project.


Social Color
HTML5 Color
Tap The color Code to Copy.
Color Picker
RGB VALUE
HEX VALUE
120
120
120
Custom Gradient
pro
Extract Color
pro
Material UI Color
Social Color
HTML5 Color
Made with
By Prateek.
© Magic PC 2018-50
Coppied to Clipboard:
Hello


ADVENTURE
GAME FLIX ; categories -->
Home
Racing
Adventure
Action Games
Sports
Download
Download
Download
Download
Download
Download
Download
Download


A large scale configurable system typically offers thousands of options or parameters to let the engineers customize it for specific needs. Among the resulting many billions possible configurations, relating option and parameter values to desired performance is then a daunting task relying on a deep know how of the internals of the configurable system. We propose a staged configuration process to narrow the space of possible configurations to a good approximation of those satisfying the wanted high level customer requirements. Based on an oracle (e.g. a runtime test) that tells us whether a given configuration meets the non-functional requirements (e.g. speed or memory footprint), we leverage machine learning to retrofit the acquired knowledge into a variability model of the system that can be used to automatically specialize the configurable system.
SPLC'16: In the repository https://github.com/learningconstraints/SPLC-16, you will find all the required artefacts to replicate the experiments included in our paper submitted to the 20th International Systems and Software Product Line Conference. The goal was mostly to avoid faulty configurations and correct a video generator developed in the industry. The oracle was simply a yes/no procedure.
In ICSE'17, we have considered performance qualities. The oracle is parametrized with an objective value that users of our specialization method can control. Hence our proposal can be seen as a generalization of the idea originally proposed in SPLC'16. Moreover our empirical results cover more systems and classification metrics while taking training sizes and objective values into account https://github.com/learningconstraints/ICSE-17.
Objective of this page: Our ICSE'17 results show that, for many different kinds of objectives and performance qualities, the approach has interesting accuracy, precision and recall after a learning stage based on a relative small number of random samples. This page describes how we gather and process input data, how we compute classification metrics. Furthermore, all plots, heatmaps, and figures can be visualized. We aim here to supplement our original material (it is impossible to include all relevant figures we have generated!) and also support an independent verification and replication of our study. We also aim to provide a practical reading grid of classification metrics for users of our method.
We performed our experiments on a publicly-available dataset used in previous works. The dataset includes sets of configurations of real-world configurable systems that have been executed and measured over different performance metrics (more details hereafter). Configurable systems come from various domains and are implemented in different languages (C, C++ and Java). The number of options varies from as little as ten, up to about sixty; options can take Boolean and numerical values. The two last columns show, first, the total number of different possible configurations existing for the system and, last, the number of configurations that have been generated and measured in previous works ("All" meaning all different configurations have been measured). It should be noted that most benchmarks measure a single performance value, except for x264 where benchmarks evaluate 7 performance metrics.
For each subject system, we have randomly selected a certain number of configurations from the ones available in the public dataset: our ML method operates over a training sample to learn a separating function. All remaining configurations form the test sample, i.e., it is the whole configuration set minus the training set. They are used to verify whether the classification of our ML is correct. For instance, the public dataset contains 69,000 different configurations for x264. If we used 500 of them to learn constraints, then we evaluate the classification quality of ML on the remaining 68,500 configurations.
For each configurable system, we make vary the sample size one by one, from 1 to the total number of configurations. We make vary the objective value between the lower and upper bounds of the performance measured in each dataset. We notice that threshold values have direct influence on the percentage of acceptable configurations. For instance, for x264, an execution time (speed) threshold less than 100s leads to only 21.4% of acceptable configurations. We thus vary the objective value from 0% to 100% of acceptable configuration with steps of 5%.
We consider that configurations are acceptable (resp. non-acceptable) w.r.t a performance objective.
Our learning-based technique can introduce errors in the following cases:
We expect to observe such cases:
In our case, positive class (also called class-1) corresponds to non-acceptable configurations that we want to discard. The negative class (also called class-0) corresponds to acceptable configurations that we want to keep. There are four possible situations represented in a confusion matrix (see Figure):
For obtaining TP, TN, FP, and FN, we confront the classifications made by ML in the training set with the oracle decisions available in the testing set. Based on a confusion matrix, we can compute several classification metrics.
We rely on standard metrics used for binary classification problems. We used 5 metrics since they give a different and complementary perspective on the "quality" of our learning-based method.
However accuracy alone can have limited interest since it hinders important phenomena.
In the example (see Figure), you can have a high accuracy despite the clear limits of the learning phase of identifying non-acceptable configurations (precision is 29% and recall is 40%).
So why is there a high accuracy and a low precision and recall?
Because the class of "acceptable configurations" is much more represented (800+100=900 out of 1000). It is too easy to have a high accuracy with basically no specialization.
On the one hand, accuracy gives a global classification measurement of our method.
On the other hand, accuracy is unable to show the weaknesses of a naÃ¯ve classification strategy (e.g., "keeping everything as acceptable")
Intuitively, in our specific problem, we also need to measure the precision and recall of our classification. It can give better insights on our ability to (1) discard non-acceptable configurations and (2) to keep acceptable configurations.
Precision: measure our ability to correctly classify non-acceptable configurations. In our example, precision is 40 / (100 + 40) = 40 / 140 = 29%. The learning wrongly classifies a large portion of non-acceptable configurations.
Recall (also called true positive rate): measure our ability to comprehensively identify non-acceptable configurations. In our example, recall is 40 / (40 + 60) = 40%. Here, the learning misses a large portion of non-acceptable configurations.
A low recall may be problematic, since numerous non-acceptable configurations have not been classified as such: Users may still choose unsafe configurations. A low precision may be problematic as well since numerous non-acceptable configurations are actually acceptable: Users may lose some flexibility.
Precision and recall measure the ability of our system to classify non-acceptable configurations. However it says nothing on how safe and flexible is our resulting specialized configurable system:
We thus need two additional metrics. Specificity (also called true negative rate) quantifies how flexible is the specialized system. In the example, (800 / 800 + 100) = 89% of configurations will be reachable in the new specialized system.
NPV (also called negative predictive value) quantifies how safe is the specialized system. In In the example, (800 / 800 + 60) = 93% of configurations will be safe in the new specialized system.
The example shows that, despite a low precision (29%) and recall (40%), the resulting specialized configurable system is quite safe (93%) and flexible (89%). Our learning phase misses some opportunities and introduces some errors, but the overall process may still be of interest since we have a safer system than originally and the flexibility is arguably reasonable.
Without a specialization, all configurations are classified as acceptable, and the metrics are as follows in our specific example:
It shows an improvement of 3% for the safety of the system. Obviously, it is just an example. The potential of our technique mostly resides in cases the performance objective leads to numerous non-acceptable configurations: We can learn and identify them, leading to safer configurable systems.
In general, a non-learning based method has always a precision is equal to 0, recall is equal to 0, specificity is equal to 100%. Hence we cannot beat a non-learning in terms of flexibility, since it keeps everything as acceptable.
However the safety of the resulting system may be very low. It is equal to: NPV_nonlearning = TN / (TN + TP) = number of acceptable configurations / number of configurations in total. We can thus compute a new metric, called negNPV, that is equal to NPV - NPV_nonlearning. The higher negNPV, the safer is our specialized system comparatively to a non-specialized system. Our empirical results confirm that we are safer in the vast majority of cases, even for a small training set.
Similarly, we can compute negAccuracy (difference of accuracy between a non-specialized method and our learning-based method).
To sum up:
A "specializer" (i.e., user of our specialization method) can employ:
An important point is that some performance objectives (w.r.t. execution time, energy consumption, etc.) can lead to a high (resp. low) percentage of non-acceptable configurations. It can complicate the learning phase and thus both influence accuracy, precision, and recall. The definition of performance objectives can also influence NPV and specificity. For example, it is hard to be completely safe when numerous non-acceptable configurations have to be removed. You can miss a small portion of them and, yet, it is a lot of unsafe configurations that remain within the specialized system. Another factor is the size of the training set. It may influence both accuracy, precision, recall, NPV, and specificity.
With our empirical results, we aim to further understand the effectiveness of our learning-based method w.r.t any performance objective and training set. For each configurable system, performance objective (defining the percentage of acceptable configurations in the population), and size of the training set, we have computed accuracy, precision, recall, NPV, specificity, negNPV and negAccuracy.
For the sake of verifiability and reproducibility of the experiments we provide:
The repository is available here: https://github.com/learningconstraints/ICSE-17
We have generated numerous heatmaps for each configurable system.
X-axis: size of the training set Y-axis: percentage of acceptable configurations (as influenced by the objective treshold value) Classification metric: the darker, the higher is the classification metric (usually from 0 to 1) It includes accuracy, precision, recall, NPV, specificity, negNPV and negAccuracy. It is a total of 7 heatmaps per system, with variations of training sets and performance objectives.
The tables (CSV files) out of which we have produced heatmaps are also available.
In addition we have fixed the number of acceptable configurations (in the population and as defined by an objective value) to 20%, 50%, and 80% and we have ploted the evolution of classification metric (accuracy, precision, recall, etc.) with regards to the size of the training set.
Such graphs help to visualize the effect of the size of the training set. The general trend is that the more configurations we have in the training set, more effective our technique is. https://github.com/learningconstraints/ICSE-17/tree/master/2.metric_view/results
Performance measurements of subject systems. It is available here: https://github.com/learningconstraints/ICSE-17/tree/master/datasets


In this work, we introduce a new saliency map model which formulates a map as a generalized Bernoulli distribution. We then train a deep architecture to predict such maps using novel loss functions which pair the softmax activation function with measures designed to compute distances between probability distributions. We show in extensive experiments the effectiveness of such loss functions over standard ones on four public benchmark datasets, and demonstrate improved performance over state-of-the-art saliency methods.
[paper]
[code]
[video]


*** User 2017-05-05 20:12:23.756 ***
20:12:23.756 [info] Disabling blocking sync...
*** User 2017-05-05 20:12:23.761 ***
20:12:23.761 [info] Configured peer_service_manager partisan_default_peer_service_manager on node 'node-1@MacBook-Pro-de-Anne-France'
*** User 2017-05-05 20:12:25.310 ***
20:12:25.309 [info] Enabling membership...
*** User 2017-05-05 20:12:25.311 ***
20:12:25.311 [info] Disabling blocking sync...
*** User 2017-05-05 20:12:25.316 ***
20:12:25.316 [info] Configured peer_service_manager partisan_default_peer_service_manager on node 'node-2@MacBook-Pro-de-Anne-France'
*** User 2017-05-05 20:12:26.885 ***
20:12:26.885 [info] Enabling membership...
*** User 2017-05-05 20:12:26.887 ***
20:12:26.887 [info] Disabling blocking sync...
*** User 2017-05-05 20:12:26.891 ***
20:12:26.891 [info] Configured peer_service_manager partisan_default_peer_service_manager on node 'node-3@MacBook-Pro-de-Anne-France'
*** User 2017-05-05 20:12:27.126 ***
Joining node: 'node-3@MacBook-Pro-de-Anne-France' to 'runner@MacBook-Pro-de-Anne-France' at port 58410
*** User 2017-05-05 20:12:27.127 ***
Joining issued: 'node-3@MacBook-Pro-de-Anne-France' to 'runner@MacBook-Pro-de-Anne-France' at port 58410
*** User 2017-05-05 20:12:27.127 ***
Joining node: 'node-2@MacBook-Pro-de-Anne-France' to 'runner@MacBook-Pro-de-Anne-France' at port 58394
*** User 2017-05-05 20:12:27.128 ***
Joining issued: 'node-2@MacBook-Pro-de-Anne-France' to 'runner@MacBook-Pro-de-Anne-France' at port 58394
*** User 2017-05-05 20:12:27.129 ***
Joining node: 'node-1@MacBook-Pro-de-Anne-France' to 'runner@MacBook-Pro-de-Anne-France' at port 58381
*** User 2017-05-05 20:12:27.130 ***
Joining issued: 'node-1@MacBook-Pro-de-Anne-France' to 'runner@MacBook-Pro-de-Anne-France' at port 58381
*** User 2017-05-05 20:12:27.191 ***
Waiting for join to complete with manager: partisan_default_peer_service_manager
*** User 2017-05-05 20:12:27.193 ***
Finished.
*** CT 2017-05-05 20:12:27.194 *** COVER INFO
Adding nodes to cover test: ['runner@MacBook-Pro-de-Anne-France']
*** CT 2017-05-05 20:12:27.204 *** COVER INFO
Successfully added nodes to cover test: []
*** User 2017-05-05 20:12:27.204 ***
Manager: partisan_default_peer_service_manager
*** User 2017-05-05 20:12:27.204 ***
20:12:27.204 [info] Nodes: ['runner@MacBook-Pro-de-Anne-France','node-3@MacBook-Pro-de-Anne-France','node-2@MacBook-Pro-de-Anne-France','node-1@MacBook-Pro-de-Anne-France']
*** User 2017-05-05 20:12:27.204 ***
20:12:27.204 [info] Waiting for cluster to stabilize.
*** User 2017-05-05 20:12:37.207 ***
Case finished: membership_test
*** User 2017-05-05 20:12:44.253 ***
20:12:44.253 [info] Application lasp exited with reason: stopped
*** User 2017-05-05 20:12:44.254 ***
20:12:44.254 [info] Application partisan exited with reason: stopped
=== Ended at 2017-05-05 20:12:44
=== successfully completed test case
=== Returned value: ok
Test run history
| Top level test index


How much it reduces velocity. 1 for no effect, 0 for full effect.
Note: TTAN is not powered by this and this means you can't make TTAN simply by setting this value to zero. Pressure can jump around a bit, too!


Class: Zif::Services::SpriteRegistry
- Inherits:
-
Object
- Object
- Zif::Services::SpriteRegistry
- Defined in:
- lib/zif/services/sprite_registry.rb
Overview
This service is for registering your sprite assets once, and assists in creating new Zif::Sprite instances from the parameters described when registering.
Instance Attribute Summary collapse
-
#registry ⇒ Hash<(Symbol, String), Zif::Sprite>
readonly
The registry of your sprites.
1. Public Interface collapse
-
#add_sprite(name, sprite) ⇒ Object
Add an already created sprite object to the registry.
- #alias_sprite(name, alias_to) ⇒ Object
-
#construct(name) ⇒ Zif::Sprite, Object
Create a new copy of a sprite which has been previously registered, using
#dup
. -
#initialize ⇒ SpriteRegistry
constructor
——————.
-
#register_autotiles(name, width:, height:, edges: 48, &block) ⇒ Object
Some background on autotiling (note the author uses a different numbering scheme - NEWS instead of NESW) gamedevelopment.tutsplus.com/tutorials/cms-25673.
-
#register_basic_sprite(name, width:, height:, &block) ⇒ Object
Creates a new Zif::Sprite which by convention is named the same as it’s
path
, in “app/sprites/<name>.png” You can, of course, modify the prototype after creation. -
#reset_registry ⇒ Object
Clears #registry.
-
#sprite_registered?(name) ⇒ Boolean
Does the registry have a sprite object with this name?.
2. Private-ish methods collapse
Constructor Details
#initialize ⇒ SpriteRegistry
28 29 30 |
# File 'lib/zif/services/sprite_registry.rb', line 28 def initialize reset_registry end |
Instance Attribute Details
#registry ⇒ Hash<(Symbol, String), Zif::Sprite> (readonly)
Returns The registry of your sprites.
23 24 25 |
# File 'lib/zif/services/sprite_registry.rb', line 23 def registry @registry end |
Instance Method Details
#add_sprite(name, sprite) ⇒ Object
Add an already created sprite object to the registry
40 41 42 |
# File 'lib/zif/services/sprite_registry.rb', line 40 def add_sprite(name, sprite) @registry[name] = sprite end |
#alias_sprite(name, alias_to) ⇒ Object
52 53 54 55 56 57 58 |
# File 'lib/zif/services/sprite_registry.rb', line 52 def alias_sprite(name, alias_to) raise "SpriteRegistry: No sprite named #{name.inspect} in the registry" unless @registry[name] # puts "SpriteRegistry#alias_sprite: #{alias_to} is now an alias for #{name}" @registry[alias_to] = @registry[name] end |
#autotile_name_from_bits(bits) ⇒ Object
This method is part of a private API. You should avoid using this method if possible, as it may be removed or be changed in the future.
200 201 202 203 204 205 206 207 208 209 210 211 212 |
# File 'lib/zif/services/sprite_registry.rb', line 200 def autotile_name_from_bits(bits) direction_name = '' direction_name += '_north' if (bits & 1).positive? direction_name += '_east' if (bits & 2).positive? direction_name += '_south' if (bits & 4).positive? direction_name += '_west' if (bits & 8).positive? direction_name += '_ne' if (bits & 16).positive? direction_name += '_se' if (bits & 32).positive? direction_name += '_sw' if (bits & 64).positive? direction_name += '_nw' if (bits & 128).positive? direction_name end |
#construct(name) ⇒ Zif::Sprite, Object
Create a new copy of a sprite which has been previously registered, using #dup
189 190 191 192 193 194 |
# File 'lib/zif/services/sprite_registry.rb', line 189 def construct(name) raise "SpriteRegistry: No sprite named #{name.inspect} in the registry" unless @registry[name] raise "Invalid sprite in registry: #{name.inspect}" unless @registry[name].respond_to?(:dup) @registry[name].dup end |
#register_autotiles(name, width:, height:, edges: 48, &block) ⇒ Object
Some background on autotiling (note the author uses a different numbering scheme - NEWS instead of NESW) gamedevelopment.tutsplus.com/tutorials/cms-25673
This method will automatically register all of the tiles for autotiling with BitmaskedTiledLayer. It’ll register every possible direction, aliasing the ones that don’t actually exist to the ones that do, depending on the number of edges specified (16 for cardinal directions only, 48 for inside corners, or 256 for every possibility). This expects that the actual filenames are using cardinal directions & diagonal directions, separated by underscores, in the following order:
_north _east _south _west _ne _se _sw _nw
It will also alias these to the raw bitmask value.
Let’s work through an example so this is clearer. You are using a 48-tile set, so you have two different versions of the tile that has an adjacent tile to the north and east, either the corner is cut or not. The one where the corner is not cut - the only adjacent tiles are north, northeast and east - looks like |_ You need to have the file for this at “sprites/name_north_east_ne.png” From that one file, it will generate the following aliases:
-
name_north_east_ne (the actual sprite)
-
All of the corner cases that don’t actually exist because this is just the 48-set and not the full 256 name_north_east_ne_se, name_north_east_ne_sw, name_north_east_ne_nw, name_north_east_ne_se_sw, …
-
Both of the above, but using the raw bitmask integer instead of the cardinal directions: 1+2+16= name_19, 1+2+16+32= name_51, …
rubocop:disable Metrics/PerceivedComplexity
134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 |
# File 'lib/zif/services/sprite_registry.rb', line 134 def register_autotiles(name, width:, height:, edges: 48, &block) # No edges: register_basic_sprite(name.to_sym, width: width, height: height, &block) alias_sprite(name.to_sym, "#{name}_0".to_sym) aliases_to_create = [] 1.upto 255 do |i| north = (i & 1).positive? east = (i & 2).positive? south = (i & 4).positive? west = (i & 8).positive? ne = (i & 16).positive? se = (i & 32).positive? sw = (i & 64).positive? nw = (i & 128).positive? cur_tile_name = "#{name}#{autotile_name_from_bits(i)}".to_sym actual_i = nil case edges when 16 actual_i = i & 31 when 48 actual_i = i actual_i -= 16 if ne && (!north || !east) actual_i -= 32 if se && (!south || !east) actual_i -= 64 if sw && (!south || !west) actual_i -= 128 if nw && (!north || !west) else actual_i = i end actual_tile_name = "#{name}#{autotile_name_from_bits(actual_i)}".to_sym # puts "#{i} -> #{actual_i}: #{cur_tile_name} -> #{actual_tile_name}" bits_alias = "#{name}_#{i}".to_sym if actual_i == i register_basic_sprite(cur_tile_name, width: width, height: height, &block) alias_sprite(cur_tile_name, bits_alias) else aliases_to_create << [cur_tile_name, bits_alias, actual_tile_name] end end aliases_to_create.each do |(cur_tile_name, bits_alias, alias_tile_from)| alias_sprite(alias_tile_from, cur_tile_name) alias_sprite(alias_tile_from, bits_alias) end end |
#register_basic_sprite(name, width:, height:, &block) ⇒ Object
Creates a new Zif::Sprite which by convention is named the same as it’s path
, in “app/sprites/<name>.png” You can, of course, modify the prototype after creation
77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 |
# File 'lib/zif/services/sprite_registry.rb', line 77 def register_basic_sprite(name, width:, height:, &block) sprite = Zif::Sprite.new(name) sprite.assign( { w: width, h: height, path: "sprites/#{name}.png", angle: 0, a: 255, r: 255, g: 255, b: 255, source_x: 0, source_y: 0, source_w: width, source_h: height } ) sprite.on_mouse_up = block if block_given? add_sprite(name, sprite) end |
#reset_registry ⇒ Object
Clears #registry
33 34 35 |
# File 'lib/zif/services/sprite_registry.rb', line 33 def reset_registry @registry = {} end |
#sprite_registered?(name) ⇒ Boolean
Returns Does the registry have a sprite object with this name?.
46 47 48 |
# File 'lib/zif/services/sprite_registry.rb', line 46 def sprite_registered?(name) @registry.key?(name) end |


Actors, or the Actor model is to replace the concurrency that was done via multithreading which has shared memory, but also has problems such as synchronizations, race conditions, etc.
Actors are communicating via asynchronous messages. Never share state. An actor is single threaded.
Each thread can run multiple actors concurrently, but a single actor is in a single thread. There are two additional advantages of this model: CPU utilization within a single computer and the ability to distribute the workload to several computers.
In the cloud things get even more complicated regarding distributed computing.
New Actor types:
Actors are actually Nanonservices very similar to Microservices
Microservices is an organizational decision, not so much a technical decision.
Base the communication on Interfaces instead of Messages.


{% extends "base.html" %} {% block content %} {% include 'navbar.html' %}
About Zhale and Zentaur designs
Hello, I am a freelance web developer, based in Surrey. I am available to work on projects now. Please get in touch if you would like more info on collaborating and setting up your online business.
{% endblock %}


You will be shown a series of 100 images, and be asked whether it is real or computer-generated.
Your correctness score will be displayed.
At the end, you'll be given a completion code. Please submit the completion code on MTurk. Thanks so much for your help and work. Here's an example image - they will be of flooded homes.


.html
<div> <img src="img/example.jpg"/> </div>
.scss
@import "compass"; @import "sassmatic.scss"; div { @include filter-sanfran; }
.scss
@import "compass"; @import "sassmatic.scss"; div { @include filter-custom(sepia(100%)); // REQUIRED but doesn't have to have a value @include filter-color(#ffb400, 0.5);// Filter color and opacity @include filter-vignette(white, 70%, 90%, 3rem); // Color, start, stop and inset boxshadow }


Simple demonstration of jQuery Rollover Image Plugin.
Method 1: Explicit hover state url:
Method 2: Regular expression and hover state url replacement text


Cesare Emiliani proposed in 1993 to add 10,000 more years to the current date for a better grasping of our human civilization, to have a Holocene Epoch.
The Holocene Epoch Timestamp grants the user with the possibility of making the conversion easy between the two types of date. The browser extension can be used to automatically convert the timestamps from the web page.
Julius Caesar on Wikipedia with the Holocene Epoch Timestamp added in brackets.
Isaac Newton on Wikipedia with the Holocene Epoch Timestamp replacing the page timestamps.


Pass in URL to be shortened as "/new/{exampleURL}"
Example: https://urlshortener-bartowski20.c9users.io/new/http://www.youtube.com


Quick Links
Screenshots of applications
GUI User Guide
Click on the following images to see a closer look at the GUI running under both Windows XP and Linux.
The Open Dialog (WinXP)
Viewing converted code (WinXP)
The Options Dialog (WinXP)
The Find Dialog (Linux)
The Save Dialog (Linux)
Automatic Code Testing


For my project, I only used one tool to complete all my tasks, Adobe Animate CC.
I used Animate CC as it had powerful tools capable of creating an interactive animation, while creating all assets within Animate CC itself.
I was able to create all my shapes, form objects, create interactivity and animation all within the single program.
In future, if I wanted to be more creative, I could use a tool like Adobe Illustrator to create more in-depth vector drawings.
The process of making this project started with thinking of what type of interactive animation I wanted
I chose to make something like a small game, where something pops out, you click it, and it disappears, later reappearing. I found this was simplistic, yet displayed my strengths.
Once I had thought of what I wanted to do, I looked around on the internet about what other people had made.
I then drew all my assets in Animate CC, and then thought about what different parts I could make interactive.
Creating a gradient, I could make the sky. Using certain brush strokes, I could make the tree. Using circles, I could make bushes.
I wanted stuff to move on mouse movement, something to happen on a click event, and to incorporate sound.
When working with interactivity, I had to research how the CreateJS tool library would help me implement the functionality I wanted.
This project wasn't too difficult, the main difficulty came when having to make everything interactive.
I had to research about how you make things interactive, how you make objects interact with mouse movement, and how to work with nested timelines.
The most time consuming part was drawing assets and creating inner timelines. This was because there was many smaller parts, to one big part.
When I published my work, I also noted that my click event and sound was not working on my browser. I researched, tried different methods to fix it, but found when I switched browser to Microsoft Edge, the animation worked as intended.
Just like my animation project, exporting my work required publishing an HTML5 canvas and JavaScript file.
This time however, it also exported a sound folder, to include in the root of my website folder.
Including my project in my website was the same as my animation, adding Javascript, embedding an HTML5 canvas, and including neccesary files in my root folder.
Managing my assets were relatively easy for this project, given that I wasn't dealing with big file sizes.
I stored all my assets in a subfolder within a project folder. Since I was making all my assets, I didn't need any subfolders.
When exporting, the exported files were contained within the same folder, I simply needed to move them to my websites root folder.
This task was fun to complete.
The project is marketed towards younger children, where a bug pops out from bushes, they click the bug and the bug disappears. You also get movement from bushes and the bugs eyes which move with the cursor.
I was able to learn how animation interacts with the user and how inner timelines work, as opposed to just one single timeline per asset.
The project was easy to manage in terms of files and file size.
Things that were difficult included learning CreateJS and learning how to incorportate mouse movements, and also the small technical challenge where my project won't play in Chrome.
Overall, after researching thoroughly, I found creating an interactive project not too difficult to create.


I've had the privilege of performing with some of the biggest names in jazz such as Wynton Marsalis and Christian McBride. My primary instruments are saxophone and trombone.
Lately, I've been composing original music for short films and documentaries.


All pic implementations support the following font-styling escapes within text objects:
|
\fR, \f1 |
Set Roman style (the default)
|
\fI, \f2 |
Set Italic style
|
\fB, \f3 |
Set Bold style
|
\fP |
Revert to previous style; only works one level deep, does not stack.
In the pic implementations that are preprocessors for a toolchain that include [gtn]roff, text objects may also contain [gtn]roff vertical- and horizontal-motion escapes such as \h or \v. Troff special glyphs are also available. All \-escapes will be passed through to the postprocessing stage and have their normal effects. The base font family is set by the [gtn]roff environment at the time the picture is rendered.
pic2plot replaces [gtn]roff horizontal- and vertical-motion escapes with \-escapes of its own. Troff special glyphs are not available, but in most back ends Latin-1 special characters and a square-root radical will be. See the pic2plot documentation for full details.
We’ve already seen that the modifier dashed can change the line style of an object from solid to dashed. GNU gpic permits you to dot or dash ellipses, circles, and arcs (and splines in TeX mode only); some versions of DWB may only permit dashing of lines and boxes. It’s possible to change the dash interval by specifying a number after the modifier.
Figure 6-1: Dashed objects
Another available qualifier is dotted. GNU gpic permits you to dot or dash ellipses, circles, and arcs (and splines in TeX mode only); some versions of DWB may only permit dashing of lines and boxes. It too can be suffixed with a number to specify the interval between dots:
Figure 6-2: Dotted objects
It is also possible, in GNU gpic only, to modify a box so it has rounded corners:
Figure 6-3: box rad with increasing radius values
Radius values higher than half the minimum box dimension are silently truncated to that value.
GNU gpic supports slanted boxes:
Figure 6-4: Various slanted boxes.
The xslanted and yslanted attributes specify the x and y offset, respectively, of the box’s upper right corner from its default position.
Lines and arcs can be decorated as well. Any line or arc (and any spline as well) can be decorated with arrowheads by adding one or more as modifiers:
Figure 6-5: Double-headed line made with line <- ->
In fact, the arrow command is just shorthand for line ->. And there is a double-head modifier <->, so the figure above could have been made with line <->.
Arrowheads have a width attribute, the distance across the rear; and a height attribute, the length of the arrowhead along the shaft.
Arrowhead style is controlled by the style variable arrowhead. The DWB and GNU versions interpret it differently. DWB defaults to open arrowheads and an arrowhead value of 2; the Kernighan paper says a value of 7 makes solid arrowheads. GNU gpic defaults to solid arrowheads and an arrowhead value of 1; a value of 0 produces open arrowheads. Note that solid arrowheads are always filled with the current outline color.
It’s also possible to change the line thickness of an object (this is a GNU extension, DWB pic doesn’t support it). The default thickness of the lines used to draw objects is controlled by the linethick variable. This gives the thickness of lines in points. A negative value means use the default thickness: in TeX output mode, this means use a thickness of 8 milliinches; in TeX output mode with the -c option, this means use the line thickness specified by .ps lines; in troff output mode, this means use a thickness proportional to the pointsize. A zero value means draw the thinnest possible line supported by the output device. Initially it has a value of -1. There is also a thickness attribute (which can be abbreviated to thick). For example, circle thickness 1.5 would draw a circle using a line with a thickness of 1.5 points. The thickness of lines is not affected by the value of the scale variable, nor by any width or height given in the .PS line.
The modifier invis[ible] makes an object entirely invisible. This used to be useful for positioning text in an invisible object that is properly joined to neighboring ones. Newer DWB versions and GNU pic treat stand-alone text in exactly this way.
It is possible to fill boxes, circles, and ellipses. The modifier fill[ed] accomplishes this. You can suffix it with a fill value; the default is given by the style variable fillval.
DWB pic and gpic have opposite conventions for fill values and different defaults.
Figure 6-6: circle fill; move; circle fill 0.4; move; circle fill 0.9;
GNU gpic makes some additional guarantees. A fill value greater than 1 can also be used: this means fill with the shade of gray that is currently being used for text and lines. Normally this is black, but output devices may provide a mechanism for changing this. The invisible attribute does not affect the filling of objects. Any text associated with a filled object is added after the object has been filled, so that the text is not obscured by the filling.
The closed-object modifier solid is equivalent to fill with the darkest fill value (DWB pic had this capability but mentioned it only in a reference section).
As a GNU extension, three additional modifiers are available to specify colored objects. outline sets the color of the outline, shaded the fill color, and color sets both. All three keywords expect a suffix specifying the color. Example:
Figure 6-7: box color "yellow"; arrow color "cyan"; circle shaded "green" outline "black";
Alternative spellings are colour, colored, coloured, and outlined.
Predefined color names for [gtn]roff-based pic implementations are defined in the device macro files, for example ps.tmac; additional colors can be defined with the .defcolor request (see the manual page of GNU troff(1) for more details). Currently, color support is not available at all in TeX mode.
The pic2plot(1) carries with its own set of color names, essentially those recognized by the X window system with “grey” accepted as a variant of “gray”.
pic assumes that at the beginning of a picture both glyph and fill color are set to the default value.


Key Modifiers: v-on:keyup.13
enter/tab/delete (captures both “Delete” and “Backspace” keys)/esc/space/up/down/left/right
Input Modifiers: v-model.lazy
.lazy/.number/.trim
events: .stop/.prevent/.capture/.self
v-if seen {{number + 1}}
v-else seen {{number - 1}}


|
| #define | ALDC_WND 40 |
| | SIZE OF THE ALDC WINDOW IN SAMPLES. (ALDC_WND % ALEC_WND) MUST ALAWAYS BE EQUAL TO 0. More...
|
| |
| #define | ALEC_WND 10 |
| | SIZE OF THE ALEC WINDOW IN SAMPLES. (ALDC_WND % ALEC_WND) MUST ALAWAYS BE EQUAL TO 0. More...
|
| |
| #define | LECOPT '1' |
| | LEC's unique Huffman table. Go to file huftlb.c to see the available tables. More...
|
| |
| #define | AL2OPT1 '2' |
| | ALEC2's first Huffman table. Go to file huftlb.c to see the available tables. More...
|
| |
| #define | AL2OPT2 '3' |
| | ALEC2's second Huffman table. Go to file huftlb.c to see the available tables. More...
|
| |
| #define | AL3OPT1 '1' |
| | ALEC3's first Huffman table. Go to file huftlb.c to see the available tables. More...
|
| |
| #define | AL3OPT2 '2' |
| | ALEC3's second Huffman table. Go to file huftlb.c to see the available tables. More...
|
| |
| #define | AL3OPT3 '3' |
| | ALEC3's third Huffman table. Go to file huftlb.c to see the available tables. More...
|
| |
| #define | AL3OP1_CD 0X2U |
| | The unique prefix code '10' expresses the compression with the first Huffman table of ALEC 3. More...
|
| |
| #define | AL3OP2_CD 0X3U |
| | The unique prefix code '11' expresses the compression with the second Huffman table of ALEC 3. More...
|
| |
| #define | AL3OP3_CD 0X0U |
| | The unique prefix code '0' expresses the compression with the third Huffman table of ALEC 3. More...
|
| |
| #define | AL3OP1_CD_LN 2U |
| | Unique's prefix code '10' size in bits. More...
|
| |
| #define | AL3OP2_CD_LN 2U |
| | Unique's prefix code '11' size in bits. More...
|
| |
| #define | AL3OP3_CD_LN 1U |
| | Unique's prefix code '0'size in bits. More...
|
| |
| #define | AL2OP1_CD 0X1U |
| | The unique prefix code '1' expresses the compression with the first Huffman table of ALEC 2. More...
|
| |
| #define | AL2OP2_CD 0X0U |
| | The unique prefix code '0' expresses the compression with the second Huffman table of ALEC 2. More...
|
| |
| #define | AL2OP1_CD_LN 1U |
| | Unique's prefix code '1' size in bits. More...
|
| |
| #define | AL2OP2_CD_LN 1U |
| | Unique's prefix code '0' size in bits. More...
|
| |
| #define | END_TRNM_CD1 0x000DU |
| | First part of the unique END OF TRANSIMISION prefix code that can be used when encoding with tables '1' '2' or '3'. More...
|
| |
| #define | END_TRNM_CD2 0x0001U |
| | Second part of the unique END OF TRANSIMISION prefix code that can be used when encoding with tables '1' '2' or '3'. More...
|
| |
| #define | END_TRNM_CD1_LEN 4U |
| | Unique's prefix code '1101' size in bits. More...
|
| |
| #define | END_TRNM_CD2_LEN 8U |
| | Unique's prefix code '00000001' size in bits. More...
|
| |
IMPORTANT! READ THIS FIRST. The header aldc.h describes the compression interface and includes essential macros that must be defined properly before compilation.
author: Palaiologos Efstathios
SECTION 1 : COMPRESSION METHOD
Select one of the compilation options definitions from "__ALDC_3_1__" to "__LEC__" in order to compile the source code of this project into the corresponding compression programm. If you compile using Visual Studio or Codeblocks(Windows) then you must define exactly one of the above compilation options, the rest options must remain inactive with comment-out. If you compile using GCC or CLANG (Linux) you may skip the definitiion of any of the available compression methods and include the command : "-D [compilation-option] 1" during compilation.
SECTION 2 : SIZE OF THE ALDC and ALEC WINDOWS
ALDC_WND defines the number of samples that are compressed using the ALDC-DR algorithm. ALDC_WND must always be defined even if the selected compression method is not ALDC (eg: LEC, ALEC2, ALEC3).
ALEC_WND defines the number of samples that are compressed using the ALEC algorithm. ALDC_WND must always be defined even if the slected compression method is LEC. IMPORTANT RULE : ALDC_WND must always be an integer multiple of ALEC_WND.
SECTION 3 : COMPRESSION (HUFFMAN) TABLES
In the preprocessor directive "#define ALxOPTy z", x represents the number of huffman tables used by the selected compression method y repersents the contents of the the corresponding table, z is the definition (char ) that matches the option y to one of the available Huffman tables that are included in the file "huftbl.c"
Definition in file aldc.h.
SIZE OF THE ALDC WINDOW IN SAMPLES. (ALDC_WND % ALEC_WND) MUST ALAWAYS BE EQUAL TO 0.


Irving is passionate for technology, especially hardware and software development. He has a degree as a Electronic engineer, but for the last four years has found a real passion in software development. He has worked on many projects around the world, this allowed him to meet other great developers and learn from them. In the last years Irving has been working as a mobile developer, he has experience in almost all mobile platforms, mostly focusing on Android and BlackBerry 10.
Irving is currently improving his Web Development skills, currently he is learning and working on backend technologies, he has experience with NodeJS and the most popular Javascript's frameworks. On his spare time, he is working on different technologies such as Djando (Python), Ruby on Rails (Ruby), unit test, distributed version control systems, basics of frontend development and even UX and usability principles. Irving is devoted to to get more experience with electronics platforms such as Arduino, Raspbery Pi, Beagleabone, PCduino and much more.


| expect_reference {testthat} | R Documentation |
expect_reference()
compares the underlying memory addresses of
two symbols. It is for expert use only.
expect_reference( object, expected, info = NULL, label = NULL, expected.label = NULL )
object |
Computation and value to compare it to. Both arguments supports limited unquoting to make it easier to generate readable failures within a function or for loop. See quasi_label for more details. |
expected |
Computation and value to compare it to. Both arguments supports limited unquoting to make it easier to generate readable failures within a function or for loop. See quasi_label for more details. |
info |
Extra information to be included in the message. This argument is soft-deprecated and should not be used in new code. Instead see alternatives in quasi_label. |
label |
Used to customise failure messages. For expert use only. |
expected.label |
Used to customise failure messages. For expert use only. |
expect_reference()
is deprecated in the third edition. If you know what
you're doing, and you really need this behaviour, just use is_reference()
directly: expect_true(rlang::is_reference(x, y))
.
Other expectations:
comparison-expectations
,
equality-expectations
,
expect_error()
,
expect_length()
,
expect_match()
,
expect_named()
,
expect_null()
,
expect_output()
,
expect_silent()
,
inheritance-expectations
,
logical-expectations


About Me
I currently live in Chilliwack, BC. Though it is far away, I don't mind commuting into Vancouver and taking full advantage of public transit whenever possible. I also plan to move closer to Vancouver once I gain stable, full-time employment.
Hobbies
- Board / Card Games
- Japanese Anime and Culture
- Movies and TV Shows
- Watching Video Podcasts
- Computer / Video / Mobile games
- Updating Wikipedia
Games (in detail)
Board / Card games Computer Games Video Games Game Genres- Racing games
- Golf games
- Adventure games
- Party games (Jackbox Party Pack)
Foods and Cuisines
- Chinese
- Greek
- Indian
- Japanese
- Mexican
- Western
Movies and TV Shows
Movies-
Animated
- Disney/Pixar movies
- Dreamworks movies
- Studio Ghibli movies
- Live Action
-
Live Action with CG
- Indiana Jones series
- Lord of the Rings / The Hobbit series
- Star Trek movie series
- Marvel Cinematic Universe series
- Classic game shows
- QI (Quite Interesting)
- Star Trek series
- The Big Bang Theory
- The Simpsons


Definition in file CBezier.h.
Include dependency graph for CBezier.h:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.


A set of functions provide calculations like those used to process
the original files and, in some cases, to extend those calculations.
A full list of Ranadu functions can be viewed by using the R command
“?Ranadu”, and clicking on the items in that list then will provide
the standard “help” information for the functions. Some of these
are listed below. For additional details, see the technical note titled
“Processing Algorithms”.
- AdiabaticTandLWC( ): Calculate the temperature and liquid
water content produced by adiabatic ascent.
- AirTemperature( ): The standard calculation of temperature
from the measured recovery temperature.
- BoltonEquivalentPotentialTemperature( ): Equivalent potential
temperature as calculated using the Bolton formula. In standard processing,
this has been replaced now by the Davies-Jones representation; see
“EquivalentPotentialTemperature( )” below.
- ButterworthFilter( ): Implementation of a Butterworth low-pass
filter, used in wind processing; see “ComplementaryFilter( )”.
- calcAttack( ): This function calculates the angle of attack
from the pitch and rate of climb of the aircraft under the assumption
that the vertical wind is zero. This algorithm may be useful when
determining or checking sensitivity coefficients for the measured
angle of attack.
- ComplementaryFilter( ): The standard calculation of wind
uses this complementary filter to combine the aircraft ground-speed
components measured by the inertial system at high rate with the corresponding
components measured by the global positioning system at lower rate.
- CorrectHeading( ), CorrectPitch( ) and CorrectRoll(
): Algorithms that use the observed Schuler oscillation of the inertial
system to improve the measurements of pitch and roll, and that calculates
a related correction to the heading based on a comparison of the observed
acceleration vector and the velocity derivatives from the global positioning
system.
- DPfromE( ): Calculation of the dewpoint temperature corresponding
to a specified vapor pressure.
- EquivalentPotentialTemperature( ): The pseudo-adiabatic equivalent
potential temperature calculated using the Davies-Jones (2009) formula.
See also BoltonEquivalentPotentialTemperature( ) and RossbyEquivalentPotentialTemperature(
) for alternate values.
- GeoPotHeight( ): Calculates the geopotential height associated
with a specified geometric height above sea level and location.
- Gravity( ): The acceleration of gravity as represented by
the Somigliana formula.
- GV_AOAfromRadome( ), GV_YawFromRadome( ): Algorithms used
to find the angles of attack and sideslip or yaw from pressure differences
measured on the radome of the GV.
- KingProbe( ): Calculation of the liquid water content from
the power measured by the CSIRO/King probe.
- LCL( ): Find the lifted condensation level from the observed
pressure, temperature, and water-vapor mixing ratio.
- MachNumber( ): Calculate the Mach number from the measured
dynamic pressure, ambient pressure, and humidity.
- memCoef( ), memEstimate( ): Routines used to implement the
“maximum entropy” method of spectral estimation; see “VSpec()”.
- MixingRatio( ): Calculates the water vapor mixing ratio.
- MurphyKoop( ), MurphyKoopIce( ): Calculate the water vapor
pressure from the Murphy-Koop formulas.
- PCORfunction( ): The algorithm used to correct measured ambient
and dynamic pressures for the static defect.
- PotentialTemperature( ): Calculates the potential temperature.
- PressureAltitude( ): Calculates the pressure altitude from
the pressure.
- RAFdata: This is a sample data.frame as might be constructed
by getNetCDF(), containing a short period of measurements from an
NSF/NCAR GV flight in a project called IDEAS-4.
The data.frame contains a set of measurements, one row per second,
and a Time variable. This is provided
for use in the Ranadu examples and can be used to test various Ranadu
functions.
- RecoveryFactor( ): Returns the recovery factor used to process
measurements of air temperature from probes exposed to the airstream.
- RossbyEquivalentPotentialTemperature( ): The Rossby formula
for the equivalent potential temperature.
- SpecificHeats( ): At the value of the ratio of water vapor
pressure to total pressure provided as an argument, returns the values
of the specific heat at constant pressure, the specific heat at constant
volume, and the gas constant.
- Sqs( ): The quasi-steady supersaturation that will exist
in a cloud with specified droplet size distribution and updraft.
- StandardConstant( ): Provides standardized values of some
constants used in the processing algorithms. See “StandardConstant(“?”)
for a list of available constants.
- TrueAirspeed( ): Calculate the airspeed from the Mach number
and temperature.
- VirtualTemperature( ) and VirtualPotentialTemperature(
): Functions to calculate these variables.
- WetEquivalentPotentialTemperature( ): Wet-equivalent potential
temperature.
- WindProcessor( ): Calculates the wind vector from the basic
measurements and adds new wind variables to the input data.frame.


About Us
PDX Hackerspace - Established 2014
Who We Are
PDX Hackerspace is a 501(c)(3) non-profit organization promoting and encouraging technical, scientific and artistic skills through individual projects, social collaboration and education. We are located at 7608 N Interstate Avenue in Portland, Oregon and serve as a local community hub as well as a thriving online community with roots extending around the world.
Our organization provides two unique, very deep universal needs. Two needs that have been way too scarce for way too long. Community and Creative Expression. We evolved as a species on the planet to survive in a sometimes hostile environment, and have done so by supporting each other in community. We need community. One of the things we did in community was get together to make and share useful tools. And just because we, as a species, might be able to now buy the things we need doesn’t mean we don’t also need to create. We have a deep inner drive to create. It’s who we are.
What We Do
The essence of hacking is to take something, improve it, then share it with the rest of the world. Our Hackerspace fosters supportive community where individuals teach because they love teaching and learn because they love learning; All geared towards enabling individuals to live the lives they want to live.
We exist for a couple really important reasons. One is that real education happens at Hackerspaces. As education bureaucracies around the world continue to sometimes fail us, Hackerspaces will continue to fill in more of the void, where people teach because they love teaching and where people learn because they love learning. And secondly, local economies grow at Hackerspaces. Hackerspaces provide supportive community for exploring and doing what you love. And if you do what you love, chances are really good other people are going to love it too, and in a capitalist society, if people love what you do, people will pay you to do it. Many companies have grown this way, so if your company grows and you need help, you can hire from the local community! This creates local economy that works for everyone. The future of economies everywhere is creative and Hackerspaces are a fantastic place to explore your creativity.


Frequently Asked Questions
Thank you for wanting to contribute!
Unfortunately, our collection system is built on Hearthstone Deck Tracker for Windows, which has an API and supports plugins.
If we develop a mobile solution, we'll let you know!
Data Drinker does not collect any information about the player (i.e. you, the person).
We collect game data and metadata, and take steps to ensure it cannot be used maliciously.
We take the privacy of our contributors seriously, and have protections in place to ensure it is not breached.
For more information, please check our privacy page.
We're sorry about that.
Please copy the error log (if any), and submit a bug report.
Absolutely!
We are focused on ranked Hearthstone played in both Standard and Wild format.
Arena, Dungeon Run, and casual games are not used in our analysis.


Colorful and fragrant, flowers scatter.
Nothing in this world is forever.
I cross life’s rugged mountain today.
This is no dream. I am ever sober.


--- layout: post title: "Of mounts and trees" subtitle: "New Zealand 2019" date: 2019-02-13 16:00:00 -0500 categories: [Travels] tags: [New Zealand] background: 'https://hwmckenzie.github.io/img/posts/nz2019/header.jpg' ---
We woke up this morning to a wonderful view of our own personal valley, enjoyed from an airy tiny house-pod.
 It also features prominently in local Maori mythology. As usual, it was a already quite hot as we walked around the base of the mount. The trail went right along the water and we had some great views of the harbour and also right out to the South Pacific Ocean.
We even got to watch a big seal floating around in a calm area doing barrel rolls and waving his (her?!) flippers. I can’t be sure, but I think it was just enjoying the water. When we had almost fully circled the base is when things got serious as we started up to the summit. The trail went mostly up and there were only a few shady spots, in which we took breaks and I sucked wind! Lea, if you are reading this, it reminded me very much of our hike in Hawaii up that switchback track, when we later met the pig hunters! If I ever felt my resolve to continue waver, it was renewed by seeing the age of some of the people who were hiking with us. I hope I can be hiking up mounts like this when I am their age! I felt quite accomplished when we reached the top and we got to enjoy some breeze and great views.
The descent was much quicker and soon we were standing on a very wavy beach.
We went “swimming” to cool off, which consisted mainly of standing on a steep sand slope which appeared to be metres from the water, only to have big waves arrrive and crash on us! Chris was much braver than I. I felt like a small bird gingerly venturing forward in the wake of a retreating wave, only to rush back as the next approached. After a bit of that, we took an outdoor shower (which I found to be by far more refreshing than trying to cool off in the surf, and afforded the same views!) and went in search of food. Our energy restored, we said goodbye to the Bay of Plenty and headed off to Rotorua, our home for the evening.
Upon our arrival we were greeted by Shawnee and Zak, the two resident Austrailian cattle dogs. Shawnee was quite old, mostly blind, and disabled after suffering an embolism in her youth. She was a little cranky at first with us. But once she taught us where to scratch her we became fast friends and she hung out with us the whole time we were there, lying under the Rpod camper we were sleeping in. Since I am on this trip, this was of course not the end of our day :). After a quick break we headed out to see the Redwoods Tree walk, a neat installation of suspension bridges in a group of redwood trees, adorned with lanterns and lights at night. Our camper was quite close, so we were able to walk there through an experimental forest area, which was quite cool. The treewalk was popular, so we had to wait in line and it was quite busy up in the trees.The walk was very beatiful, although I also enjoyed our own private walk home in the dark through the forest by the light of Chris’s phone.
By this time our camper had cooled down and we were soon asleep after a very full day.
Chris & Hannah


|
SimJava v2.0 |
||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
SimJava
.
See:
Description
| Interface Summary | |
| Sim_output | The interface that a trace output class must provide. |
| Sim_reporter | This interface defines the functionality that must be present in the simulation's reporter. |
| Class Summary | |
| Sim_accum | A class for collecting basic statistical data during simulations. |
| Sim_any_p | A predicate which will match any event on the deferred event queue. |
| Sim_entity | This class represents the types of entities or processes of the simulation. |
| Sim_event | This class represents events which are passed between the entities in the simulation. |
| Sim_from_p | A predicate which selects events from specific entities. |
| Sim_none_p | A predicate which will not match any event on the deferred event queue. |
| Sim_not_from_p | A predicate which selects events that have not been sent by specific entities. |
| Sim_not_type_p | A predicate to select events that don't match specific tags. |
| Sim_port | This class represents ports which are used to connect entities for event passing. |
| Sim_predicate | Predicates are used to select events from the deferred queue. |
| Sim_stat | A class that provides entities with statistical support. |
| Sim_system | The SimJava simulation kernel. |
| Sim_type_p | A predicate to select events with specific tags. |
| Error Summary | |
| Sim_exception | Top-level error thrown when an error in the simulation occurs. |
| Sim_stat_exception | Error thrown when an error occurs in a Sim_stat object. |
Classes that form the main simulation structure of SimJava
.
|
SimJava v2.0 |
||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |


Take a Screenshot of this page and send it to
the below number to claim your prize today!!!
Nalin Bhardwaj:<PHONE_NUMBER>


Namespace WizardWrx.ConsoleAppAids3
Classes
ConsoleAppStateManager
ConsoleAppStateManager is an WizardWrx.DLLServices2.StateManager adapter, which exposes the adapted object through its read only BaseStateManager property, and extends it with methods that provide services applicable exclusively to character mode (console mode) programs.
DisplayAids
Use the methods of this sealed (implicitly static) class to precisely control the way your application handles pauses.
FixedConsoleWriter
Instances of this class permit a line of a console window to be used repeatedly for successive lines of text, replacing the contents of the previous print statement, so that the lines above it don't scroll off the screen. Once instantiated, instances of this class behave almost exactly like Console.WriteLine, and you can drop them into your code in its place, because its overloads have identical signatures.
Please see the Remarks.
Enums
ConsoleAppStateManager.NormalExitAction
This enumeration governs when the NormalExit method suspends a task by calling WaitForCarbonUnit.
DisplayAids.InterruptCriterion
Use this enumeration to specify whether, and under what conditions, the TimedWait method may be interrupted by user inputs.
FixedConsoleWriter.CRBehavior
Use the members of this enumeration to control the behavior of the ReturnCarriage method.


This is the element's name outside the Lua API. It's what will be drawn on top of the element's button and what one will use to refer to the element in the exclamation-point command interface.
An example value could be:
Name = "BCOL";


/*====================================================================* * * Copyright (c) 2013 Qualcomm Atheros, Inc. * * All rights reserved. * * Redistribution and use in source and binary forms, with or * without modification, are permitted (subject to the limitations * in the disclaimer below) provided that the following conditions * are met: * * * Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * * * Redistributions in binary form must reproduce the above * copyright notice, this list of conditions and the following * disclaimer in the documentation and/or other materials * provided with the distribution. * * * Neither the name of Qualcomm Atheros nor the names of * its contributors may be used to endorse or promote products * derived from this software without specific prior written * permission. * * NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE * GRANTED BY THIS LICENSE.  IN NO EVENT SHALL THE COPYRIGHT OWNER * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * *--------------------------------------------------------------------*/ #ifndef CHIPSET_SOURCE #define CHIPSET_SOURCE #include "../plc/plc.h" #include "../tools/types.h" #include "../tools/symbol.h" /*====================================================================* * * char const * chipsetname (uint8_t MDEVICE) * * plc.h * * return the ASCII name string associated with the MDEVICE_CLASS * field in the VS_SW_VER.CNF message; this field represents the * chipset family or class of device; * * the MDEVICE_CLASS field was named MDEVICEID at one time; * * Contributor(s): * Charles Maier<EMAIL_ADDRESS>* *--------------------------------------------------------------------*/ char const * chipsetname (uint8_t MDEVICE_CLASS) { static const struct _type_ chipsets [] = { { CHIPSET_UNKNOWN, "UNKNOWN" }, { CHIPSET_INT6000, "INT6000" }, { CHIPSET_INT6300, "INT6300" }, { CHIPSET_INT6400, "INT6400" }, { CHIPSET_AR7400, " AR7400" }, { CHIPSET_AR6405, " AR6405" }, { CHIPSET_PANTHER_LYNX, "PANTHER/LYNX" }, { CHIPSET_QCA7450, "QCA7450" }, { CHIPSET_QCA7451, "QCA7451" }, { CHIPSET_QCA7420, "QCA7420" }, { CHIPSET_QCA6410, "QCA6410" }, { CHIPSET_QCA7000, "QCA7000" } }; return (typename (chipsets, SIZEOF (chipsets), MDEVICE_CLASS, chipsets [0].name)); } /*====================================================================* * * void chipset (void const * memory); * * Chipset.h * * replace VS_SW_VER message MDEVICE_CLASS field with correct value; * the MDEVICE_CLASS field was named MDEVICEID at one time; * * Atheros chipsets are identified by code in the VS_SW_VER vendor * specific management message; the chipset [] vector translates a * chipset code to a chipset name; * * the basic assumption is that the firmware always tells the truth * but the bootrom does not; because of engineering changes, the * firmware uses a different device identification scheme than that * used by the bootrom and that information appears in different * locations depending on the source of the VS_SW_VER confirmation; * see the Programmer's Guide for more information. * * INT6000 0x01 / 0x01 0x00000042 / NA * INT6300 0x01 / 0x02 0x00006300 / NA * INT6400 0x03 / 0x03 0x00006400 / NA * AR7400 0x03 / 0x04 0x00007400 / NA * AR6405 0x03 / 0x05 0x00006400 / NA * QCA7450 0x03 / 0x20 0x0F001D1A / NA * QCA7420 0x06 / 0x20 0x001CFCFC * QCA6410 0x06 / 0x21 0x001B58EC * QCA6411 0x06 / 0x21 0x001B58BC * QCA7000 0x06 / 0x22 0x001B589C * QCA7000 0x06 / 0x22 0x001B58DC * QCA7005 0x06 / 0x22 0x001B587C * * some chipsets have have multiple IDENT field values; this is * not an error; there may be multiple versions of a chipset; * *--------------------------------------------------------------------*/ void chipset (void const * memory) { #ifndef __GNUC__ #pragma pack (push,1) #endif struct __packed vs_sw_ver_confirm { struct ethernet_hdr ethernet; struct qualcomm_hdr qualcomm; uint8_t MSTATUS; uint8_t MDEVICE_CLASS; uint8_t MVERLENGTH; char MVERSION [254]; } * confirm = (struct vs_sw_ver_confirm *) (memory); typedef struct __packed { uint32_t IDENT; uint8_t DEVICE_CLASS; uint8_t DEVICE; } tDevMap; struct __packed tDevClass { uint8_t RESERVED; uint32_t IDENT; uint32_t STEP_NUMBER; } * pDevClass = (struct tDevClass *) (& confirm->MVERSION [64]); #ifndef __GNUC__ #pragma pack (pop) #endif tDevMap bootrom [] = { { 0x00000042, 0x01, CHIPSET_INT6000 }, { 0x00006300, 0x01, CHIPSET_INT6300 }, { 0x00006400, 0x03, CHIPSET_INT6400 }, { 0x00007400, 0x03, CHIPSET_AR7400 }, { 0x0F001D1A, 0x03, CHIPSET_QCA7450 }, { 0x0E001D1A, 0x03, CHIPSET_QCA7451 }, { 0x001CFC00, 0x05, CHIPSET_QCA7420 }, { 0x001CFCFC, 0x05, CHIPSET_QCA7420 }, { 0x001CFCFC, 0x06, CHIPSET_QCA7420 }, { 0x001B58EC, 0x06, CHIPSET_QCA6410 }, { 0x001B58BC, 0x06, CHIPSET_QCA6411 }, { 0x001B58DC, 0x06, CHIPSET_QCA7000 }, { 0x001B587C, 0x06, CHIPSET_QCA7000 } }; tDevMap firmware [] = { { 0x00000000, 0x01, CHIPSET_INT6000 }, { 0x00000000, 0x02, CHIPSET_INT6300 }, { 0x00000000, 0x03, CHIPSET_INT6400 }, { 0x00000000, 0x05, CHIPSET_AR6405 }, { 0x00000000, 0x04, CHIPSET_AR7400 }, { 0x0F001D1A, 0x20, CHIPSET_QCA7450 }, { 0x0E001D1A, 0x20, CHIPSET_QCA7451 }, { 0x001CFCFC, 0x20, CHIPSET_QCA7420 }, { 0x001B58EC, 0x21, CHIPSET_QCA6410 }, { 0x001B58BC, 0x21, CHIPSET_QCA6411 }, { 0x001B58DC, 0x22, CHIPSET_QCA7000 } }; unsigned chip; if (!strcmp (confirm->MVERSION, "BootLoader")) { for (chip = 0; chip < SIZEOF (bootrom); chip++) { if (bootrom [chip].DEVICE_CLASS != confirm->MDEVICE_CLASS) { continue; } if (bootrom [chip].IDENT != LE32TOH (pDevClass->IDENT)) { continue; } confirm->MDEVICE_CLASS = bootrom [chip].DEVICE; return; } } else { for (chip = 0; chip < SIZEOF (firmware); chip++) { if (firmware [chip].DEVICE_CLASS != confirm->MDEVICE_CLASS) { continue; } if (firmware [chip].IDENT <= 5) { confirm->MDEVICE_CLASS = firmware [chip].DEVICE; return; } pDevClass = (struct tDevClass *) (& confirm->MVERSION [65]); if (firmware [chip].IDENT == LE32TOH (pDevClass->IDENT)) { confirm->MDEVICE_CLASS = firmware [chip].DEVICE; return; } pDevClass = (struct tDevClass *) (& confirm->MVERSION [129]); if (firmware [chip].IDENT == LE32TOH (pDevClass->IDENT)) { confirm->MDEVICE_CLASS = firmware [chip].DEVICE; return; } pDevClass = (struct tDevClass *) (& confirm->MVERSION [254]); if (firmware [chip].IDENT == LE32TOH (pDevClass->IDENT)) { confirm->MDEVICE_CLASS = firmware [chip].DEVICE; return; } } } return; } #endif


Download HTML5 textarea content to Markdown file from client side with JavaScript
Markdown Editor
.md
Download Markdown File


Choose a framework:
preact-v8.2.7-keyed
preact-v8.2.7-keyed-instance
Table Report
Interactive Table Report


Structure of module
Syllabus
- Introduction
- What is a democratic innovation?
- Theories of democracy: What should we expect from democratic innovations?
Different types of democratic innovations:
- Mini-publics
- Participatory Budgeting
- Referendums and Citizens' Initiatives
The digital age and democratic innovations:
- Digital possibilities and democratic innovations
- Digital challenges and democratic innovations: Communication overload
Context and issues:
- Implementing democratic innovations
- Impact of democratic innovations
- Critiques and arguments against democratic innovations
Wrapping up:
- Presentations of research paper topics
- Revision, questions, and feedback
Literature and resources
Assigned readings available on Moodle.
Books of particular interest:
- Elstub, S., Escobar, O., 2019. Handbook of Democratic Innovation and Governance. Edward Elgar Publishing Limited (available as an e-book from the TUM library)
- Smith, G., 2009. Democratic Innovations: Designing Institutions for Citizen Participation. Cambridge University Press.
- Saward, M., 2021. Democratic Design, 1st ed. Oxford University Press.
Useful web resources:
Typical seminar
- Introduction: Practicals and questions
- Student presentation(s)
- Discussion
- Conclusion with main take-aways.
Readings:
- Required reading (for everyone)
- Additional readings (for presentation and inspiration to papers)
Assessment
Two parts:
-
Presentation and facilitation of discussion (20%)
- Present topic based on assigned text(s).
- Written hand-out (1-2 pages)
- Lead a discussion.
-
Research Paper (80%)
- Develop a more complete understanding of specific topic investigated during the seminar.
- 13-15 pages (excl. figures, tables, and references)
- Concise and workable research question.
- Independent literature review.
- Critical discussion of your topic (must be analytical and not just descriptive!)
Student presentations (20%)
You will be marked on all three elements together: the presentation, your written hand-out, and your facilitation of a discussion.
You can use these three elements to illustrate that you are able to:
- Accurately and concisely summarise the text/topic.
- Apply the presented theory to real-life cases.
- Think critically about the texts/theories/topics.
Practicals:
10-15min: 10min presentation max + discussion
Prepare at least a couple of questions for discussion.
Pick a topic and date by next weeek (19th April, 12:00)
Research paper (80%)
Can take many forms, but should include the following elements:
- Title page: Spend a bit of time to develop a precise and meaningful title!
- Introduction (2-3 pages): Present a precise research question that your paper will answer. And justify why it is relevant.
- Main part (10-12 pages): literature review, selected methods, theoretical framework, empirical evidence, evalutaion and analysis of data/evidence.
- Conclusion (2-3 pages): Clear answer to your research question based on the main part.
- References
- (Appendices - but do not overdo this!)
Hand-in deadline: 15th September 2021 through Moodle.


User Forum for Cybersecurity R&D Testbeds
|
Date & Time:November 10, 2016 (11AM-1PM) Venue: NUS School of Computing, Cerebro@SoC, COM 1 #02-05
This workshop aims to explain to the current and potential NCL users the capabilities of the testbeds as well as to gather interests and requirements for future testbed development. This will be done through an open discussion in conjunction with our partner from the US.
We are honored to have Ms Terry V. Benzel as our distinguished guest speaker. Ms Terry V. Benzel is the Deputy Director for the Computer Networks Division at the Information Sciences Institute (ISI) of the University of Southern California (USC). She is also the technical project lead for the Cyber Defense Technology Experimental Research (DETER) testbed projects funded by DHS, NSF and DARPA.
The National Cybersecurity R&D Lab is a shared national infrastructure that provides computing resources, repeatable and controllable experimentation environments, as well as application services. The infrastructure includes a cluster of 300 nodes that provides a wide range of provisioning mechanisms, security data and security services. NCL aims to provide a platform that fosters and encourages collaboration among researchers in academia, government bodies and the industry.
One of the key components of NCL testbed is the provisioning software from ISI DeterLab. DeterLab is a state-of-the-art scientific computing facility for cyber-security researchers engaged in research, development, discovery, experimentation, and testing of innovative cyber-security technology. To date, DeterLab-based projects have included behavior analysis and defensive technologies including DDoS attacks, worm and botnet attacks, encryption, pattern detection, and intrusion-tolerant storage protocols.
|
11:00 - 11:05
|
WELCOME by Prof Chang EeChien |
|
11.05 -11:25
|
Overview of Cyber Ranges by Prof Chang EeChien |
| 11:25-11:45 |
Overview of DeterLab by Ms Terry V.Benzel
|
| 11:45-12:50 |
Interactive Open Discussion
|
| 12:50-13:00 |
Closing Remarks
|
| 13.00 |
Refreshments
|
|


Theo Parrish - This Is For You feat. Maurissa Rose
Theo at his most tender.
by Max Graef Lakin| Label / Sound Signature SS078 |
Released / November 2019 |
Style / House, Deep House |
The centre label of Theo Parrish's new single bears the exciting news that an album called Wuddaji is on the way. It will be Theo's first since American Intelligence in 2014, and this single suggests he's on top form. "This Is For You" has the organic, evolving instrumentation that's been a common thread in his recent work. But it also shows off his songwriting skills, bringing a focus to his improvisational meanderings.
Sometimes instrumental versions of vocal house tracks can be the best, stripping the arrangement down, leaving something more immersive. In this case Maurissa Rose's warm, wistful vocals blend so effortlessly into Theo's keys that the instrumental version feels like it's missing something. As always, Theo's percussion ticks and fidgets along, rudimentary and awkward but brilliant in a way that only he can pull of reliably. It's Theo at his most harmonious and tender.
Tracklist /
A This Is For You feat. Maurissa Rose
B This Is For You (Instrumental)


--- title: Blogging Like a Hacker ---
We are a professional family owned business based out of Chandler. We are committed to superior personal customer service and pride ourselves on our professionalism. As former professional employees we understand the importance of professionalism and trustworthiness. As Phoenix natives, we understand the difficulties associated with maintaining your swimming pool during the long hot summers. We strive to keep your pool at its best, so that all you have to worry about is enjoying yourself. As members of the Independent Pool and Spa Service Association (IPSSA) we have both professional liability insurance and associates who will service your pools if one of us is injured. Most small pool service companies do not offer you that protection. We provide reliable high quality service and repairs at a reasonable price.


countryCodes()
defaultZone()
descriptions()
number()
OID_ASTERISK_DEFAULT_INDICATION
OID_ASTERISK_INDICATIONS_COUNT
OID_ASTERISK_INDICATIONS_COUNTRY
OID_ASTERISK_INDICATIONS_DESCRIPTION
A class for performing SNMP V2 queries on Asterisk
| see | \OSS_SNMP\MIBS\Asterisk\https://wiki.asterisk.org/wiki/display/AST/Asterisk+MIB+Definitions |
|---|---|
| copyright | Copyright (c) 2012, Open Source Solutions Limited, Dublin, Ireland |
| author | Barry O'Donovan |
countryCodes() : array
Country for which the indication zone is valid, typically this is the ISO 2-letter code of the country.
array
An array of ISO country codes for the defined indications zones (indexed by SNMP table entry)defaultZone() : string
Default indication zone to use.
string
The default indication zone to usedescriptions() : array
Description of the indication zone, usually the full name of the country it is valid for.
array
An array of indications zone descriptionsnumber() : int
Number of indications currently defined in Asterisk.
int
The number of indications defined in AsteriskOID_ASTERISK_DEFAULT_INDICATION
OID_ASTERISK_INDICATIONS_COUNT
OID_ASTERISK_INDICATIONS_COUNTRY
OID_ASTERISK_INDICATIONS_DESCRIPTION


In July, Ohio Gov. Mike DeWine signed the anti-hazing legislation into law following its unanimous passing in the Ohio House and Ohio Senate earlier in June. Collin’s Law, otherwise known as Senate Bill 126, is named in memoriam of Collin Wiant, an OU student who died of asphyxiation in November 2018 at the unofficial Sigma Pi annex house.
According to a previous Post report, after Collin’s death, his family learned he had been beaten, belted, waterboarded and forced to take drugs.
Prior to its signing, support for the bill was reinforced in March when various Ohio public university presidents, including former OU President Duane Nellis, signed a letter urging the passing of the legislation.
The letter followed the death of Bowling Green State University student Stone Foltz, who died in a hazing-related incident in March.
As part of the legislation, Collin’s Law, which officially went into effect in October, raises certain hazing penalties from a misdemeanor to a felony. It also requires universities to keep a public record of all student organization Code of Conduct violations. The law additionally stipulates that universities need to develop educational plans for preventing hazing at such institutions.
In accordance with the legislation, OU implemented mandatory hazing education modules for all faculty, staff and students in September. According to a previous Post report, the modules covered why hazing is illegal, what the university community can do to prevent hazing and information about what hazing is.
“Some of the modules or learning platforms that I’m looking at, I think are really going to change the game in that they will be engaging and hopefully facilitate some person-to-person conversation next year,” Ariel Tarosky, director of Sorority and Fraternity Life, said. “I think that this was a good starting point to at least facilitate a conversation for our community this year, and we're actually one of the universities that are ahead of the game with all of our other peers in the state, so I think we did a good job this year.”
Tarosky said the modules are particularly important for the entire student body because hazing is power-based violence that may occur in any student organization, and students need to know how to identify hazing and what steps to take in supporting other students.
On Monday, the Singing Men of Ohio was issued a cease and desist order for allegedly violating the Student Code of Conduct and endangering the health and safety of its members.
In July, both Sigma Chi fraternity and Delta Tau Delta fraternity were suspended from campus for numerous code of conduct violations, including reports of hazing.
As of Dec. 1, only 7,087 students have completed the training module. Carly Leatherwood, a university spokesperson, said that number continues to increase, and the university expects 100% compliance for incoming students who will complete the modules as part of orientation.
OU also implemented a hazing education course, known as UC 1500, that new members of sororities and fraternities on campus were required to take in the Fall Semester. The course concluded in November and strived to lead discussions on hazing prevention, bystander intervention, power-based violence and the transition into Greek Life and academic success.
Allison Lusk, a freshman studying business management who is also a member of a sorority on campus, said it was particularly interesting to learn about the history of the sororities and fraternities on campus outside of the chapter of which she is a member.
“I really think that it helped them not only transition to college, but helped them get a deeper understanding of their sorority and fraternity experience,” Tarosky said. “You could tell we were talking with them about things that I don't think they necessarily have talked about prior and their fraternity and sorority new member experience.”
Tarosky said those conversation topics included health and safety standards, hazing, rights and responsibilities of new members and the Make Respect Visible campaign.
Lusk also said she enjoyed the discussion element of the course because other students would mention a point of view on a particular topic that she hadn’t necessarily considered.
While Lusk maintained the course was primarily Greek Life centered, she said some of the topics would be useful for all students on a daily basis.
“We did a whole entire week on the make respect visible … campaign. I saw those posters everywhere, but I didn't know what they meant or anything,” Lusk said. “It was beneficial to learn about that kind of stuff and if I probably didn't join a sorority, I wouldn't have learned anything about that.”
Tarosky said the course, in its first year, was primarily education focused, as many students, faculty and staff did not know what hazing was or their role in preventing such behavior.
“I think we've definitely made strides in that area this year,” Tarosky said. “That education piece, I think that was critical. I think that we're going to continue to do that next semester, next year. I think that we're going to continue to really grow as a university and as a state as far as bystander intervention is concerned, and how we empower students to step in and take a stand.”
Tarosky added that she is a member of task forces that talk about hazing education that would be consistent for all universities in Ohio and is working to create robust education for staff, faculty and students moving forward.


Login
Username
Password
Incorrect Password
Forgot password?
Create account
Remember me
Contact Us
Login


Class RootPackageFileManagerImpl
Manages changes to the root package file.
Use this class to make persistent changes to the puli.json of a project. Whenever you call methods in this class, the changes will be written to disk.
- Puli\Manager\Config\AbstractConfigManager implements Puli\Manager\Api\Config\ConfigManager
- Puli\Manager\Package\RootPackageFileManagerImpl implements Puli\Manager\Api\Package\RootPackageFileManager
Namespace: Puli\Manager\Package
Author: Bernhard Schussek<EMAIL_ADDRESS>Since: 1.0
Located at Package/RootPackageFileManagerImpl.php
Author: Bernhard Schussek<EMAIL_ADDRESS>Since: 1.0
Located at Package/RootPackageFileManagerImpl.php
public
|
#
__construct(
Creates a new package file manager. |
public
Config
|
|
public
|
|
public
|
|
public
null|string
|
|
public
|
|
public
|
|
public
|
|
public
|
#
removePluginClasses( Webmozart\Expression\Expression $expr )
Removes the plugin classes from the package file that match the given expression. |
public
|
|
public
boolean
|
|
public
boolean
|
#
hasPluginClasses( Webmozart\Expression\Expression $expr = null )
Returns whether the package file contains any plugin classes. |
public
string[]
|
|
public
string[]
|
#
findPluginClasses( Webmozart\Expression\Expression $expr )
Returns all installed plugin classes matching the given expression. |
public
|
|
public
|
|
public
|
|
public
|
#
removeExtraKeys( Webmozart\Expression\Expression $expr )
Removes the extra keys from the package file that match the given expression. |
public
|
|
public
boolean
|
|
public
boolean
|
#
hasExtraKeys( Webmozart\Expression\Expression $expr = null )
Returns whether the file contains any extra keys. |
public
mixed
|
|
public
array
|
|
public
array
|
#
findExtraKeys( Webmozart\Expression\Expression $expr )
Returns the values of all extra keys matching the given expression. |
public
|
|
protected
|


O Brother, Here Thou Art
O Brother, Where Art Thou? A film review by Michael Redman Copyright 2001 by Michael Redman
**** (out of ****)
After such a dismal year that "Castaway" is considered one of its best films, the release of a Coen Brothers film is certainly cause for celebration. Luckily for us, this one is near perfect.
No deep messages here, just a collection of hilarious episodes as Homer's "Odyssey" is overlaid on a tale of a thirties prison break in the deep south. Exactly what we need during the chilling gray days of January.
With a collection of actors including Holly Hunter, John Turturro, Charles Durning and John Goodman, it's surprising that George Clooney emerges as the stand-out.  This could be Clooney's break-out film.
There are so many surrealistic scenes (the Klan rally, the sirens, the Soggybottom Boys and more) that you'll sit slack-jawed during the entire film amazed that anyone would put these on the screen. And even more amazed that they work so spectacularly.
[This appeared in the 1/18/2001 "Bloomington Independent", Bloomington, Indiana. Michael Redman can be contacted at<EMAIL_ADDRESS>--<EMAIL_ADDRESS>Film reviews archive: http://us.imdb.com/ReviewsBy?Michael+Redman
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


Planet Sick-Boy: http://www.sick-boy.com "We Put the SIN in Cinema"
© Copyright 2001 Planet Sick-Boy. All Rights Reserved.
If you dug American High, the canceled high-school-based reality show recently brought back to life by PBS, you should definitely check out Jim McKay's Our Song, a gritty but fictitious look at the lives of three young girls and how they spent their summer. McKay shot the entire film using a handheld camera, which, given the overabundance of reality programming as of late, makes Song look and feel too real to be watching from an air-conditioned theatre. This is the kind of thing you watch from your couch, possibly while involved in some kind of drinking game (every time Mike says something to piss off Coral, you have to drink a shot).
Armed with a budget of under $500,000, writer/director McKay (Girls Town) headed to Crown Heights, Brooklyn to tell this story of three girls hovering around their 16th birthdays. Each is a member of the Jackie Robinson Steppers Marching Band, who may be headed to Alaska for a competition, and each has just found out their school is being closed because of a recently discovered asbestos problem. Instead of rejoicing, like most kids their age, these girls are upset, realizing the commute to a new school could add hours to their scholastic day. They're good kids, for the most part, which is part of the film's offbeat realism.
The girls are played by Anna Simpson, Melissa Martinez and the promising Kerry Washington, who had a part in Save the Last Dance. Like real girls their age, they have to deal with the various everyday problems causing teen angst: divorce, pregnancy, suicide, clashes with parents and fights with siblings. But there's fun stuff, like movies, ice cream, sleepovers, birthday parties and shoplifting, to offset the trauma. There isn't a lot of excitement, as the film is meant to be a slice of life, but it also makes the 95-minute running time seem to last forever.
The coolest thing about Song may be the opening credits, where McKay forgoes the typical "A Film By" credit and lists the names of everyone involved in the production instead of just his own. Song looks terrific, with photography courtesy of Jim Denault (Boys Don't Cry). R.E.M. frontman Michael Stipe serves as the film's executive producer.
1:35 - R for language and some teen drug use
========== X-RAMR-ID: 29210 X-Language: en X-RT-ReviewID: 244181 X-RT-TitleID: 1098000 X-RT-SourceID: 595 X-RT-AuthorID: 1146
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