| About Dailyrotten |
|
Feedback
If you like this page, hate it, or would like to suggest changes,
<EMAIL_ADDRESS>is listening. This page
is experimental and somewhat different from what we usually offer, so please
do send your feedback.
Adding Stories
If you are a rotten newshound and you would like to suggest a story,
visit our submit page to
send us the URL. Stories that are accepted will have your name credited.
Posting Comments
In order to post comments to stories, you will have to
create an account.
Accounts will generally be validated within 24 hours, and of
course will be disabled if there is abuse.
Viewership
On the first full day this page went live, 100,000 people visited this Rotten
News page. Of course that was the day after the WTC attacks, so that number is
somewhat distorted. Right now this page gets between 50,000 and 75,000 people
every day.
Linking
We encourage everyone to link to this page; if you like it, others probably
will as well.
Other Rotten
Rotten
Gaping Maw
Celebrity Morgue
Mugshots
Rotten Store
Rate My Poo
Rate My Kitten
Rate My Finger
Penny Postcards
Phallic
Boners
Home
Make Dailyrotten your start page
|
|
|
March 29, 2002
Denver Police surveilling its own citizens
Reuters | Submitted by: Reid Fleming
The ACLU has filed a lawsuit against the Denver police department on behalf
of 3,200 residents, who are believed to have been the subjects of secret DPD
dossiers. The citizens were selected by virtue of their having participated
in peaceful civil rights demonstrations. The ACLU contends that the secret
files have shared this information with federal agencies, and that they
labeled some of Denver's law-abiding townspeople "criminal extremists."
|
|
Read article...
|
|
Big safe heist but police are MIA
Washington Post | Submitted by: f00f
"When we pointed out some of the evidence," Duggan said, a patrol officer
responding to the scene told him he had been "watching too much TV." Duggan
gathered telephone numbers, dates of birth, addresses and Social Security
numbers of band members, bartenders, security guards and patrons who were at
the bar that night. "I told them all that the police will be calling them, to
get ready to talk to a detective, to remember details of the night and to
please be helpful," Duggan said.  Police haven't called a single person."
|
|
Read article...
|
|
A separate latrine for Lesbians
San Diego Channel | Submitted by: Son of Benway
"Scott filed a complaint last month alleging discrimination and intolerance
by 'not addressing a very clear right of privacy violation' that required the
girl to share facilities with homosexual students and staff... Superintendent
Granger Ward said that it would be illegal to implement Scott's demand for
separate restrooms and locker rooms for students and staff who are or are
perceived to be gay or lesbian." Umm, what girl wouldn't want to share
facilities with hot lesbian chix0rs?
|
|
Read article...
|
|
Bin Laden sending Bin-Email again
Guardian | Submitted by: Bad Paper
"What makes me think it is from Bin Laden is that they have sent us other
material before, and it is written in the same way. The language is really
typical of him," he said... The email [traced to Karachi], which was
written in Arabic, was sent to the paper's general email address. "It
was not a message to our newspaper but to the whole
Islamic community," he said.
|
|
Read article...
|
|
Lil' Amber gets undies in a bunch
MSNBC | Submitted by: McWhat
"Why are you stuck on the few photos we have of her in her custom-made
clothing? Have you seen the great updates where she shows you how to make
an excellent salmon dish using only tinfoil to bake it with? What about
the very fun and informative software reviews that took her months to
put together? Any [of] her Yoga video/pics!??" Mmmm, salmon.
|
|
Read article...
|
|
Media runs out of news to report
Associated Press | Submitted by: george_lazenby
Dateline Afghanistan. A fascinating story from the front lines about a
guy... who eats rocks. "When I started stone-eating, people couldn't
believe it. They told me that this was magic. This is the one quality I have.
Wherever I go, people watch me and gather around... I had a very healthy
and strong body when I started eating stones. Then I became weak and thin."
 Recent attempts to decriminalize these
forms of sexual congress through new legislation were scuttled last year by
state representative Tony Perkins. His rationale? "The heart of this
legislation has nothing to do with what married couples choose to do. This
has everything to do with legitimizing homosexuality." And we can't have
that. God knows there aren't any queers in Louisiana.
|
|
Read article...
|
|
Surgeon General nominee once killed a guy
Tuscon Citizen | Submitted by: Reid Fleming
President Bush's nominee for Surgeon General could definitely kick C.
Everett Koop's ass. Dr. Richard Carmona, a Green Beret who served in Vietnam
and currently member of an Arizona SWAT team, was the recipient of a "Top Cop"
award from the National Association of Police Organizations a couple of years
ago. Why?  Not to mention the other guy he shot to
death ten years prior. You should expect this Surgeon General to get a
lot less shit from people.
|
|
Read article...
|
|
Guarding the "A" Root Server
Washington Post | Submitted by: Soylent
"The last thing I'd want someone to think is that they could put a bomb
around their waist and hug the A root and think they're going to significantly
impact the Internet," Rippe said. "While such an attack could kill many
employees, the Internet's addressing system is designed to withstand the
destruction of much of the physical infrastructure that houses it."
|
|
Read article...
|
|
Donut trail leads to thieves
Reuters | Submitted by: Milky Bong Toke 420
"Two people left a 15-mile-long- trail of doughnuts after they took a Krispy
Kreme truck from a parking lot and fled, police said Thursday...
Houk told police they had been smoking crack cocaine for several hours before
the incident, which occurred Wednesday, said Callahan."
|
|
Read article...
|
|
|
|
|


You create an estimate based upon a predefined download template.
if you import the template it will look roughtly:
if you convert the template it will look roughtly:
which you can import into gitlab without a problem


Testing the wind - Barriere Star Journal
by Jill HaywardA young eagle opens its wings to the wind while perching in a tree high above the North Thompson River after flying with its parents and two other siblings. The photographer thinks the young birds were approximately five to six months old at the time this photograph was taken early in November.
(Jill Hayward photo)


--- layout: post title: What's this, a blog you say? summary: It had to happen one day tags: [] ---
It had to happen one day
Like the iPod before it, a blog is inevitable, best not to fight it. Instead, write something people will read... Hey, get back here!


| Name: smt. Padmavathi.k | Reg No: 3-4SMMHC18 |
|---|---|
| Age / Sex:68/f | Contact No:9449909460 |
| Marital Status:ml- | Date:7/4/18 |
| Occupation: | Dr. PJFP |
Address: UMA MAHESHWARIS MOM. |
DIAGNOSIS- |
DM FRM 25 YEARS.
VITILIGO FROM 2 YEARS. STARTED FROM BREAST MORE.
 ITCHING. ALLO RX.
KEEPS GETTING BURNING SENSATION IN URINE WHENEVR TAKES HOMOEO. SO AVOIDS HOMOEO.
RX:
URAN NIT 200 – 3-0-3 PILLS.
CANTHARIS 200- 3-0-3 PILLS.
HEPAR SULPH 30 2 DRAM PILLS 4-4-4-4.


Height field geometry class. More...
#include <PxHeightFieldGeometry.h>
Public Member Functions | |
| PX_INLINE | PxHeightFieldGeometry () |
| PX_INLINE | PxHeightFieldGeometry (PxHeightField *hf, PxMeshGeometryFlags flags, PxReal heightScale_, PxReal rowScale_, PxReal columnScale_) |
| PX_INLINE bool | isValid () const |
| Returns true if the geometry is valid. More... | |
| Public Member Functions inherited from PxGeometry | |
| PX_CUDA_CALLABLE PX_FORCE_INLINE PxGeometryType::Enum | getType () const |
| Returns the type of the geometry. More... | |
Public Attributes | |
| PxHeightField * | heightField |
| The height field data. More... | |
| PxReal | heightScale |
| The scaling factor for the height field in vertical direction (y direction in local space). More... | |
| PxReal | rowScale |
| The scaling factor for the height field in the row direction (x direction in local space). More... | |
| PxReal | columnScale |
| The scaling factor for the height field in the column direction (z direction in local space). More... | |
| PxMeshGeometryFlags | heightFieldFlags |
| Flags to specify some collision properties for the height field. More... | |
| PxPadding< 3 > | paddingFromFlags |
| padding for mesh flags. More... | |
Additional Inherited Members | |
| Protected Member Functions inherited from PxGeometry | |
| PX_CUDA_CALLABLE PX_FORCE_INLINE | PxGeometry (PxGeometryType::Enum type) |
| Protected Attributes inherited from PxGeometry | |
| PxGeometryType::Enum | mType |
Height field geometry class.
This class allows to create a scaled height field geometry instance.
There is a minimum allowed value for Y and XZ scaling - PX_MIN_HEIGHTFIELD_XZ_SCALE, heightfield creation will fail if XZ value is below this value.
|
inline |
|
inline |
| PxReal PxHeightFieldGeometry::columnScale |
The scaling factor for the height field in the column direction (z direction in local space).
| PxHeightField* PxHeightFieldGeometry::heightField |
The height field data.
| PxMeshGeometryFlags PxHeightFieldGeometry::heightFieldFlags |
Flags to specify some collision properties for the height field.
| PxReal PxHeightFieldGeometry::heightScale |
The scaling factor for the height field in vertical direction (y direction in local space).
| PxPadding<3> PxHeightFieldGeometry::paddingFromFlags |
padding for mesh flags.
| PxReal PxHeightFieldGeometry::rowScale |
The scaling factor for the height field in the row direction (x direction in local space).


class: center, middle, inverse, title-slide # 05 Proximal methods and SGD ### STAT 535A ### Daniel J. McDonald ### Last modified - 2021-01-25 --- ## Last time $$ \newcommand{\R}{\mathbb{R}} \newcommand{\argmin}[1]{\underset{#1}{\textrm{argmin}}} \newcommand{\norm}[1]{\left\lVert #1 \right\rVert} \newcommand{\indicator}{1} \renewcommand{\bar}{\overline} \renewcommand{\hat}{\widehat} \newcommand{\tr}[1]{\mbox{tr}(#1)} \newcommand{\Set}[1]{\left\{#1\right\}} \newcommand{\dom}[1]{\textrm{dom}\left(#1\right)} \newcommand{\st}{\;\;\textrm{ s.t. }\;\;} $$ Looked at unconstrained optimization `\begin{equation} \min_x f(x) \end{equation}` .pull-left[ __Gradient descent__ - Choose `\(x^{(0)}\)` - Iterate `\(x^{(k)} = x^{(k-1)} - \gamma_k\nabla f(x^{(k-1)})\)` - Stop sometime ] .pull-right[ - Rates of convergence: "linear" means `\(\epsilon\)`-suboptimal in `\(O(1/\log(\epsilon))\)` iterations - Improvements: acceleration, momentum, backtracking line search - stopping criteria ] -- Assumed `\(f\)` convex and **differentiable** If not differentiable, used subgradient --- ## Today **Some special cases** 1. Avoid subgradient method 2. `\(f(x) = g(x) + h(x)\)` with certain "nice" `\(g\)` and `\(h\)` 3. `\(f(x) = \sum_{i=1}^n f_i(x)\)` --- ## Composite functions Subgradient can be slow Suppose (still unconstrained) $$ \min_x f(x) = g(x) + h(x) $$ * `\(g(x)\)` is convex and differentiable * `\(h(x)\)` is convex -- Taylor approximation to `\(f \longrightarrow\)` gradient descent In GD, our update was (given `\(x\)` from previous iterate) $$ `\begin{aligned} x^{(k)} &= \arg\min_z f(x^{(k-1)}) + \nabla f(x^{(k-1)})^\top (z - x^{(k-1)}) + \frac{1}{2\gamma}\norm{z - x^{(k-1)}}_2^2\\ &= x^{(k-1)} - \gamma \nabla f(x^{(k-1)}) \end{aligned}` $$ -- Instead, do Taylor approximation to `\(g\)` only --- ## Approximate `\(g\)` only $$ `\begin{aligned} x^{(k+1)} &= \arg\min_z g(x^{(k)}) + \nabla g(x^{(k)})^\top (z - x^{(k)}) + \frac{1}{2\gamma}\norm{z - x^{(k)}}_2^2 + h(z)\\ &= \arg\min_z \frac{1}{2\gamma} \norm{ z - (x^{(k)} - \gamma \nabla g(x^{(k)})) }_2^2 + h(z) \end{aligned}` $$ This has two parts: * `\(\frac{1}{2\gamma} \norm{z - (x^{(k)} - \gamma \nabla g(x^{(k)})) }_2^2\)` means "stay close to the gradient update for `\(g\)`" * `\(h(z)\)`, need to make this small too * We're minimizing both over `\(z\)`. -- Define the "proximal mapping/operator" of `\(h\)`: $$ \textrm{prox}_{h,\gamma}(y) = \arg\min_z \frac{1}{2\gamma} \norm{ z - y }_2^2 + h(z) $$ --- ## Proximal gradient descent Iterate: 1. `\(x^{g} = x^{(k)} - \gamma \nabla g(x^{(k)})\)` 2. `\(x^{(k+1)} = \textrm{prox}_{h,\gamma}(x^g)\)` -- **What good did this do?** * We swapped performing GD on `\(f\)` for GD on `\(g\)` plus some weird prox thing * So unless, `\(\textrm{prox}_{h,\gamma}\)` is "simple", this is dumb. -- Luckily, `\(\textrm{prox}_{h,\gamma}\)` **is** simple for many common `\(h\)`. Often has closed form. Furthermore, `\(g\)` can be complicated, as long as we can compute it's gradients. --- ## Example: LASSO `$$\min_\beta \underbrace{\frac{1}{2}\norm{y-X\beta}_2^2}_g + \underbrace{\lambda\norm{\beta}_1}_h$$` `$$\begin{aligned} \textrm{prox}_{\lambda\norm{\cdot}_1,\gamma} (\beta) &= \arg\min_z \norm{z-\beta}_2^2 + \lambda\norm{z}_1\\ &=: S_{\lambda \gamma}(\beta) \end{aligned}$$` `$$[S_{\tau}(a)]_i = \textrm{sign}(a_i)(|a_i|-\tau)_+ = \begin{cases} a_i - \tau & a_i > \tau\\ 0 & |a_i| \leq \tau\\ a_i + \tau & a_i < -\tau \end{cases}$$` So the update becomes: 1. `\(\beta \leftarrow \beta + \gamma X^\top(y - X\beta)\)` 2. `\(\beta \leftarrow S_{\lambda \gamma}(\beta)\)` This is called "Iterative soft thresholding" (ISTA) --- ## Projected gradient descent $$ \min_{x\in C} f(x) $$ - Incorporate the constraint into the objective using the indicator function: `$$I_C(x) = \begin{cases} 0 & x \in C\\ +\infty & x \not\in C \end{cases}.$$` - Call the indicator `\(h\)`, and use proximal GD - Now `\(\textrm{prox}_t(x) = \arg\min_{z\in C} \norm{z-x}_2^2\)` - This is just the Euclidean projection onto `\(C\)` So the update becomes: 1. Use GD on `\(f\)` 2. Project onto `\(C\)` --- ## Constrained least squares `$$\min_{l < \beta < u} \frac{1}{2n}\norm{y-X\beta}_2^2$$` * You can perhaps imagine better ways to do this .pull-left[ 1. `\(\beta \leftarrow \beta + \frac{\gamma}{n}X^\top(y-X\beta)\)` 2. `\(\beta \leftarrow \Pi_{\{\beta : l < \beta < u\}} (\beta)\)` Can show that `$$[\Pi(z)]_i = \begin{cases}u_i & z_i > u_i \\ l_i & z_i < l_i \\ z_i & \textrm{else} \end{cases}$$` ] .pull-right[ ```r set.seed(12345) n <- 100 p <- 10 X <- matrix(rnorm(n*p), n) bstar <- c(rep(1,3),runif(p-6,-1,1),rep(-1,3)) y <- X %*% bstar + rnorm(n) Xy <- crossprod(X,y) / n XX <- crossprod(X) / n maxit <- 200 gamma <- .05 bhat <- matrix(0, p, maxit) grad <- function(b) - (Xy - XX %*% b) for (i in 2:maxit) { g <- grad(bhat[,i-1]) prop <- bhat[,i-1] - gamma * g prop[prop > 1] <- 1 prop[prop < -1] <- -1 bhat[,i] <- prop if (sum(g^2) < 1e-4) break } ``` ] --- <img src="rmd_gfx/05-proximal-methods/unnamed-chunk-2-1.svg" style="display: block; margin: auto;" /> | | X1| X2| X3| X4| X5| X6| X7| X8| X9| X10| |:------|----:|----:|----:|----:|----:|----:|----:|-----:|-----:|-----:| |bstar | 1.00| 1.00| 1.00| 0.91| 0.24| 0.06| 0.78| -1.00| -1.00| -1.00| |ProjGD | 0.90| 1.00| 0.99| 0.90| 0.16| 0.13| 0.67| -1.00| -1.00| -0.93| |OLS | 0.92| 1.19| 1.00| 0.89| 0.14| 0.08| 0.70| -1.22| -1.01| -0.92| --- ## Enhancements Alternative formulation: Define the "generalized gradient" as `$$G_\gamma(x) = \frac{x - \textrm{prox}_{h,\gamma}(x - \gamma \nabla g(x))}{\gamma}$$`. Then Proximal GD is (in 1 step): `$$x^{(k)} = x^{(k)} - \gamma G_\gamma(x^{(k)})$$` We use this definition for **backtracking** (on `\(g\)` only): shrink if `$$g\left(x- \gamma G_\gamma(x)\right) > g(x) - \gamma \nabla g(x)^\top G_\gamma(x) + \gamma \alpha \norm{G_\gamma(x)}_2^2$$` * There are other formulations to avoid frequent evalutations of prox For **acceleration**, need to express differently than last time (set `\(x^{(0)} = x^{(-1)}\)`): 1. `\(v \leftarrow x^{(k-1)} + \frac{k-2}{k+1} (x^{(k-1)} - x^{(k-2)})\)` 2. `\(x^{(k)} \leftarrow \textrm{prox}_{h,\gamma} (v - \gamma \nabla g(v))\)` --- ## Stochastic gradient descent - Workhorse in Neural Networks - Suppose `$$f(x) = \frac{1}{n} \sum_{i=1}^n f_i(x)$$` - GD would use `$$x^{(k)} = x^{(k-1)} - \frac{\gamma}{n} \sum_{i=1}^n \nabla f_i(x^{(k-1)})$$` - SGD uses `$$x^{(k)} = x^{(k-1)} - \gamma \nabla f_{i_k}(x^{(k-1)})$$` `\(i_k\in\{1,\ldots,n\}\)` is an index chosen at time `\(k\)`. --- ## Choosing the batches Standard choices for `\(i_k\)` 1. Draw `\(i_k\sim \textrm{Unif}(\{1,\ldots,n\})\)`. 2. Set `\(i_k=1,\ldots,n,1,\ldots,n,1,\ldots,n,\ldots\)` (or a random permutation of these) Most frequently update "mini-batches". 3. Split `\(\{1,\ldots,n\}\)` into `\(l\)` "blocks" that don't overlap. Why? 1. Convergence rates are slower for SGD than GD. 2. Batches improves this. 3. SGD is computationally more efficient in per-iteration cost, memory 4. Efficient when far from the optimum, less good close to the optimum (but statistical properties don't care when you're close) --- ## Returning to our example ```r Xy <- crossprod(X,y) / n # depends on the sum XX <- crossprod(X) / n # depends on the sum maxit <- 200 gamma <- .05 bhat <- matrix(0, p, maxit) grad <- function(b) - (Xy - XX %*% b) # no longer depends on the sum for (i in 2:maxit) { g <- grad(bhat[,i-1]) # no longer depends on the sum prop <- bhat[,i-1] - gamma * g prop[prop > 1] <- 1 prop[prop < -1] <- -1 bhat[,i] <- prop if (sum(g^2) < 1e-4) break } ``` --- ## What about the naive version? ```r maxit <- 200 gamma <- .05 bhat <- matrix(0, p, maxit) grad <- function(b) - t(X) %*% (y - X %*% b) / n # depends on the sum for (i in 2:maxit) { g <- grad(bhat[,i-1]) # also depends on the sum prop <- bhat[,i-1] - gamma * g prop[prop > 1] <- 1 prop[prop < -1] <- -1 bhat[,i] <- prop if (sum(g^2) < 1e-4) break } ``` * Better to avoid the repeated calculations than to use SGD * But have to load all the data into memory.


What's this all about?
We'd like to create a memento of our wedding that we'll be able to use everyday. And we like food, and we'd really like to get better at cooking it.
So our plan is to create a guest book from all your tasty recipes that everyone can then sign on the day. Then we'll be reminded of all of you and our wedding day every time we cook a tasty dinner.
Along with an RSVP, we asked all of our wedding guests to send us a tasty recipe – whether a link to a favourite online, a self-made creative concoction, or even great grandma's secret recipe.


|
Cassandra PHP Client Library
Cassandra PHP-based client library for managing and querying your Cassandra cluster.
|
Public Member Functions | |
| __construct ($host= '<IP_ADDRESS>', $port=9160, $useFramedTransport=true, $sendTimeoutMs=null, $receiveTimeoutMs=null) | |
| __destruct () | |
| close () | |
| isOpen () | |
| getClient () | |
| getTransport () | |
| getProtocol () | |
| useKeyspace ($keyspace, $username=null, $password=null) | |
Protected Member Functions | |
| createSocket ($host, $port, $sendTimeoutMs, $receiveTimeoutMs) | |
| createFramedTransport (TSocket $socket) | |
| createBufferedTransport (TSocket $socket) | |
Protected Attributes | |
| $host | |
| $port | |
| $useFramedTransport | |
| $sendTimeoutMs | |
| $receiveTimeoutMs | |
| $socket | |
| $transport | |
| $protocol | |
| $client | |
| $isOpen |
Represents a connection to a single Cassandra node.
Provides direct access to the low-level Cassandra client.
Definition at line 50 of file Cassandra.php.
| CassandraConnection::__construct | ( | $ | host = '<IP_ADDRESS>' , |
| $ | port = 9160 , |
||
| $ | useFramedTransport = true , |
||
| $ | sendTimeoutMs = null , |
||
| $ | receiveTimeoutMs = null |
||
| ) |
Constructs the connection, setting access parameters.
| string | $host | Hostname or IP of the node |
| integer | $port | Port of the instance |
| boolean | $useFramedTransport | Use framed or buffered transport |
| integer | $sendTimeoutMs | Timeout of send operations in milliseconds |
| integer | $receiveTimeoutMs | Timeout of receive operations |
Definition at line 131 of file Cassandra.php.
{ $this->host = $host; $this->port = $port; $this->useFramedTransport = $useFramedTransport; $this->sendTimeoutMs = $sendTimeoutMs; $this->receiveTimeoutMs = $receiveTimeoutMs; $this->isOpen = false; $this->socket = $this->createSocket( $host, $port, $sendTimeoutMs, $receiveTimeoutMs ); if ($useFramedTransport) { $this->transport = $this->createFramedTransport($this->socket); } else { $this->transport = $this->createBufferedTransport($this->socket); } $this->transport->open(); $this->isOpen = true; $this->protocol = new TBinaryProtocolAccelerated($this->transport); $this->client = new CassandraClient($this->protocol); }
| CassandraConnection::__destruct | ( | ) |
Closes the connection on destruction.
Definition at line 168 of file Cassandra.php.
{ $this->close(); }
| CassandraConnection::close | ( | ) |
Forces the connection to close.
Generally there's no need to call it yourself as it will be closed on termination.
Definition at line 178 of file Cassandra.php.
| CassandraConnection::createBufferedTransport | ( | TSocket $ | socket | ) | [protected] |
Creates buffered transport.
| TSocket | $socket | Socket to base the transport on |
Definition at line 316 of file Cassandra.php.
{ require_once THRIFT_PATH.'/transport/TBufferedTransport.php'; return new TBufferedTransport($socket, 512, 512); }
| CassandraConnection::createFramedTransport | ( | TSocket $ | socket | ) | [protected] |
Creates framed transport.
| TSocket | $socket | Socket to base the transport on |
Definition at line 304 of file Cassandra.php.
{ require_once THRIFT_PATH.'/transport/TFramedTransport.php'; return new TFramedTransport($socket, true, true); }
| CassandraConnection::createSocket | ( | $ | host, |
| $ | port, | ||
| $ | sendTimeoutMs, | ||
| $ | receiveTimeoutMs | ||
| ) | [protected] |
Creates the socket to use.
| string | $host | Hostname/IP |
| integer | $port | Port number |
| integer | $sendTimeoutMs | Send operations timeout |
| integer | $receiveTimeoutMs | Receive operations timeout |
Definition at line 279 of file Cassandra.php.
{ $socket = new TSocket($host, $port); if ($sendTimeoutMs !== null) { $socket->setSendTimeout($sendTimeoutMs); } if ($receiveTimeoutMs !== null) { $socket->setRecvTimeout($receiveTimeoutMs); } return $socket; }
| CassandraConnection::getClient | ( | ) |
Returns the low-level Cassandra client used by the wrapper.
Definition at line 201 of file Cassandra.php.
{ if (!$this->isOpen) { throw new CassandraConnectionClosedException( 'The connection has been closed' ); } return $this->client; }
| CassandraConnection::getProtocol | ( | ) |
Returns the used transportation protocol.
Definition at line 225 of file Cassandra.php.
{
return $this->transport;
}
| CassandraConnection::getTransport | ( | ) |
Returns the used transport method.
Definition at line 216 of file Cassandra.php.
{
return $this->transport;
}
| CassandraConnection::isOpen | ( | ) |
Is the connection open.
Definition at line 192 of file Cassandra.php.
{ return $this->isOpen; }
| CassandraConnection::useKeyspace | ( | $ | keyspace, |
| $ | username = null , |
||
| $ | password = null |
||
| ) |
Attempts to start using given keyspace.
Using the keyspace is attempted three times before giving up.
| string | $keyspace | Name of the keyspace |
| string | $username | Optional username in case authentication is used |
| string | $password | Optional password |
Definition at line 238 of file Cassandra.php.
{ $attempts = 3; $success = false; while($attempts-- > 0 && !$success) { try { $this->client->set_keyspace($keyspace); $success = true; } catch (cassandra_InvalidRequestException $e) { continue; } } if (!$success) { throw new CassandraSettingKeyspaceFailedException( 'Using keyspace "'.$keyspace.'" failed after several attempts' ); } if ($username !== null) { $request = new cassandra_AuthenticationRequest( array('credentials' => array($username, $password)) ); $this->client->login($request); } }


2. Usage examples¶
Exemplary propagation scenarios obtained using py-fmas. Click on any image to see more details and source code.
For more detailed tutorials, see our Extended user guide page.
2.1. Exemplary propagation scenarios¶
This gallery shows examples demonstrating the dynamical evolution of ultrashort optical pulses in terms of \(z\)-propagation models for the analytic signal.
2.2. Two-frequency pulse compounds¶
This gallery shows specific examples demonstrating the generation and dynamical evolution of two-frequency pulse compounds.
2.3. Simulation of other models¶
This gallery shows how the functionality of the provided software can be extended by implementing additional propagation models.


Mass surveillance is the surveillance of an entire or a substantial fraction of a population for collecting personal data; it is often carried out by governments or governmental organisations, but may also be carried out by corporations, either on behalf of governments or at their own initiative. Depending on each nation’s laws and judicial systems, the legality of and the permission required to engage in mass surveillance varies.
Mass surveillance has often been cited as necessary to fight terrorism, to prevent social unrest, to protect national security, to fight child pornography and protect children. Conversely, mass surveillance has equally as often been criticized for violating privacy rights, limiting civil and political rights and freedoms, and being illegal under some legal or constitutional systems. There is a fear that increasing mass surveillance will ultimately lead to a totalitarian state where political dissent is undermined by surveillance programs (as the distopyan world created by Orwell in "1984"). Such a state may also be referred to as a surveillance state or an electronic police state.
In 2013, the practice of mass surveillance by world governments was called into question after Edward Snowden‘s 2013 global surveillance disclosure. Reporting based on documents, Snowden leaked to various media outlets triggered a debate about civil liberties and the right to privacy in the digital age.


SMD (1206) 10 uF Capacitor (Tantalum) 16v - CTS1U010F
Summary
Name: SMD (1206) 10 uF Capacitor (Tantalum) 16v
ID: CAPT-1206-X-UF10-VF
Hex ID: CTS1U010F
WebPage: https://github.com/oomlout/oomlout-OOMP/wiki/CAPT-1206-X-UF10-VF
Short URL: http://oom.lt/CTS1U010F
Revision History: https://github.com/oomlout/oomlout-OOMP/blob/master/parts/CAPT-1206-X-UF10-VF/
| Type |
Size |
Color |
Description |
Index |
CAPT Capacitor (Tantalum) |
1206 SMD (1206) |
X
|
UF10 10 uF |
VF 16v |
Images
About
This part is awaiting a description.
Specifications
| Info |
Value |
| Type |
Capacitor (Tantalum) |
| Size |
SMD (1206) |
| Description |
10 uF |
| Index |
16v |
Extra Details
Spotted a mistake, want to add more? Let us know<EMAIL_ADDRESS>All images and resources are licensed [CC BY-SA] unless otherwise stated (ie. the datasheets)


--- layout: program title: Tutorials group: navigation tags : [Tutorials, programs, program] author : Võ Hoàng Hiệp css: js: keywords: bootstrap4, UI kit, jekyll canonical: https://vhoanghiep.github.io/tutorials --- {% include JB/setup %} {% for tutorial in site.tutorials %}


-----Original Message-----
From: Geaccone, Tracy
Sent: Tuesday, October 16, 2001 11:33 AM
To: Copeland, Erin; Maddox, Lori; Perchal, Cheryl; Keiser, John; Botello, Mary
Subject: FW: Updated 2002 Corporate Assessments - Revision #3
let me know if we need to discuss.
Thanks
-----Original Message-----
From: Derr, Dawn
Sent: Tuesday, October 16, 2001 10:27 AM
To: Geaccone, Tracy; Killen, Faith; Lee, Dana; Massey, Rachel; Smith, Kirk; Wood, Stephen; Copeland, Erin; Selzer, Howard; Erwin, Jill; Pritt, Deborah; Stevens, Kirk; Schwertner, Brian; Galvan, Michael S.; Roper, Kerry; Myers, Thomas; Smith, Jeff E.; Ueckert, Allen W.; Tran, Agatha; Kaster, Mei-Ling
Cc: West, Terry
Subject: Updated 2002 Corporate Assessments - Revision #3
Attached are the latest revised Corporate Assessments for 2002. There have been some minor changes but the major update is to the Click at Home program. Remember that the Click at Home program assesses actual dollars so the numbers included in the spreadsheet are estimates for planning purposes.
Please contact me if you have any questions.
Dawn
37775
***********
EDRM Enron Email Data Set has been produced in EML, PST and NSF format by ZL Technologies, Inc. This Data Set is licensed under a Creative Commons Attribution 3.0 United States License <http://creativecommons.org/licenses/by/3.0/us/> . To provide attribution, please cite to "ZL Technologies, Inc. (http://www.zlti.com)."
***********
California


genes somatic expression embryos ATG gene expressed Arabidopsis leaf embryo embryogenesis Plant DNA tissues analysis embryogenic related SE_D .E- vitro cell data development GO:: highly level biosynthesis higher patterns showed transcript developmental tissues. using ATG, file protein levels plant subset early detected identified methylation molecular samples {border-style (original histone repository: study Figure enriched family involved px;} reads #ffffff;} Additional WRKY active based compared functional Cell MYB callus tissue used AP-EREBP majority seed transcripts Genevestigator factor mapped microarray Expression Gene Illumina RNA bHLH cycle pathways respectively. transcription (AraCyc) (Figure Biol biological cultures different embryonic regulation replication terms total transcriptome (), LINK culture function generated plants process transcriptionally zygotic (%) (Log ./s--- SE. SE_D, Somatic Therefore, addition, cells clustering clusters collected differentially encoding epigenetic families formation future genes, high networks relatively signalling similar stages thaliana time-points (AT-) CRF However, MADS Zhang accumulation binding; cDNA characterization embryos, list proteins represent sequence stage tool (GO:), (cluster GEO HAC Moreover, Physiol TFs Table cellular cluster co-expressed cytosine developing differential distinct distribution domain embryogenesis. embryos. extracted i.e. information key pathway present process; processes px; reference regulate reported role stress these, torpedo {font-family (Additional ./pp.. ATS Additionally, ArrayExpress CYCB;, Log Mol Transcriptome WT_L acid annotated considered font-size genome identify increased likely metabolic model pattern potential profiles provide selected sequencing shown specific tissues, (A) (AT-), (B) (C) ABA ATG), AtGenExpress DEGs DML DNA-binding FPKM Glucosinolate HD-tuins MADS-box RNA-Seq Sci WT_L: Wang approximately associated auxin average binding containing culture, development; double; downstream filtered genes. given global hormone induction instance, main mainly maturation members provides read regulated regulator repair studies subsequent transcriptional vegetative (E-GEOD-); (GSE)). (Table (expression ./j.-X...x ATG) Analysis BMC CMT CRF, CYCA;, Different EMBRYO Furthermore, Gaj Genomics Gibberellin Interestingly, Involved LEA Mature SE_D. SE_D; Transcript Transcription VIM actively activity; anatomical atlas border-color border-width catabolic conditions control core coverage derived development); dividing essential finger genes; group important included induce ion maintaining marker modifications mutants network noted novo observed order particular play pooled provided regulators regulatory remaining required research response responses revealed solid; study, type values {font-style {font-weight %), (GSE); (KEGG) (i.e. -N-glucoside AGAMOUS-like ARREST Based COTYLEDON Cao Cult Curr Cytokinins DEGs. HATs HiSeq ID: LEAFY Liu MYB-related NAC Organ Protein Proteome RAP. SE, Tiss Total abundance analysed article available bold chromosome comprehensive considerably construct courier; defects demethylation determine em; exception experiment flowering growth homeobox hydroxylation) involves leaves libraries maintain maize material mechanisms meristem metabolism methylation/demethylation overview percentage presented pt;} reduced reproductive responsive sample scale sequenced significantly silencing silico siliques software stable studies. subsets suggests summary, time-points. transcribed transcriptomes useful validate


How to make a Dragon Ball memory game - PART 2
Hi guys. This is the second part of this series. Here you can read part 1
Recap
During the first part, we started to build the HTML structure of the game page. We began with the header, continued with the score panel and finished with one card built. We focused on the flip logic - made with a combination of JavaScript and CSS.
Here’s the CodePen from last time
See the Pen Memory Game - p1 by Davide (@davide2894) on CodePen.
Let’s take it from here.
There is only one working card at the moment. We need 15 more.

1

<div class="card__back"

1

<div class="card__back"

2

<div class="card__back"

2

<div class="card__back"

And so on, until you have a total of 16 cards.
Pay attention here: every single card has a unique id
number.
We can recognize the 8 pairs because we numbered them from 1 to 8: you can see these numbers on both sides of the card. So 16 id
s and 8 numbered pairs.
The numbered pairs have a span--hide
class. These will become handy when we will be testing the game features, or when you want to add a feature of your own. Look at the styling. Because you can hide and show them as you like so you can control.
/*
.span--hide {
display: none;
}*/
For now, let’s keep it commented: we’ll need it later.
Dimension fix
At their actual state, cards are way too big. Another problem is how we are displaying them.
Let’s address one thing at a time.
First, the dimension.
.flip-container,
.card__front,
.card__back {
width: 6.5em;
height: 6.5em;
}
Second, the way they are displayed. As you can see, now they are organized vertically. We can fix this by addressing the cards’ container
.cards {
display: -webkit-box;
display: -ms-flexbox;
display: flex;
-ms-flex-wrap: wrap;
flex-wrap: wrap;
-webkit-box-pack: center;
-ms-flex-pack: center;
justify-content: center;
margin-top: 2em;
width: 100%;
}
With display: flex
and flex-wrap: wrap
we make sure the cards respond to changes affecting the screen width. In other words, we make sure they are responsive. Besides, we give some breathing space between the score panel and the cards grid.
Reset
I want to take a second and add a reset.
A reset is a CSS technique that allows us to nullify differences among browsers when they render a page. In fact, each browser has a different default style. This means, for example, that an header, say
 My Title

will have different font-size
and font-weight
in different browsers.
Reset waterproofs our code from these differences.
If we use it, then we can make sure browsers will render our custom style in the same way.
Quite helpful.
And easy to implement.
There’s an online tool for this: the Meyerweb reset. Check the link provided and paste that code at the beginning of your CSS. If you are too lazy for even that, here it is:
/* http://meyerweb.com/eric/tools/css/reset/
v2.0 | 20110126
License: none (public domain)
*/
html, body, div, span, applet, object, iframe,
h1, h2, h3, h4, h5, h6, p, blockquote, pre,
a, abbr, acronym, address, big, cite, code,
del, dfn, em, img, ins, kbd, q, s, samp,
small, strike, strong, sub, sup, tt, var,
b, u, i, center,
dl, dt, dd, ol, ul, li,
fieldset, form, label, legend,
table, caption, tbody, tfoot, thead, tr, th, td,
article, aside, canvas, details, embed,
figure, figcaption, footer, header, hgroup,
menu, nav, output, ruby, section, summary,
time, mark, audio, video {
margin: 0;
padding: 0;
border: 0;
font-size: 100%;
font: inherit;
vertical-align: baseline;
}
/* HTML5 display-role reset for older browsers */
article, aside, details, figcaption, figure,
footer, header, hgroup, menu, nav, section {
display: block;
}
body {
line-height: 1;
}
ol, ul {
list-style: none;
}
blockquote, q {
quotes: none;
}
blockquote:before, blockquote:after,
q:before, q:after {
content: '';
content: none;
}
table {
border-collapse: collapse;
border-spacing: 0;
}
Now let’s check how our game page looks like.
Make all cards flippable
We began with one flipping card.
Then, we made a grid of 16 cards. You may have guessed it by now, we need to make all cards flippable.
Replace the code written during last part - handling only one card - with the following:
const container = document.getElementById('container');
var cards = container.getElementsByClassName('card'),
isFlipped = false;
for(let card of cards){
card.addEventListener('click', function(){
if(!isFlipped){
flipCard(card);
isFlipped = true;
} else if(isFlipped){
flipCardBack(card);
isFlipped = false;
}
})
}
First we grab the cards container by declaring const container
and selecting tìhe div
s id
.
Then, with var cards
we grab all the cards by selecting and getting all the elements with class card
.
At this point, we loop through the cards. On each card, we place an event listener:
- if isFlipped value is equal to false, flip the card and set
isFlipped = true
- if isFlipped value is equal to true, it means
flipCard(card)
was invoked. Hence, we can assume the card was flipped - the visual feedback tells us the truth anyway. We can nvokeflipCardBack()
to set the card to its initial position.
Now, we need to adjust the handleTouch()
function in order to make sure mobile users can flip all the cards as well.
function handleTouch(card) {
if (!isFlipped) {
flipCard(card);
isFlipped = true;
} else if (isFlipped){
flipCardBack(card);
isFlipped = false;
}
}
Compared to the old version:
- we replaced the
else
statement with anif else
one, and put as conditiontouchCount === 2
- when
touchCount === 2
, card gets flipped back andtouchCount
is set back to 0
Shuffle card
Cards are not cards if you can’t shuffle them.
In the real game, cards are shuffled everytime we start a new game. This keeps it challenging and ensures no one is cheating.
Just a few moments ago we selected all the cards and stored them in a variable.
var cards = container.getElementsByClassName('card');
To implement shuffling, we need these cards in an array.
This is tricky: var cards
is not an array now. It is a NodeList: a collection of DOM elements
.
This means we need to convert this NodeList to an array. We can do it with a function.
function nodeListToArray(nodeList) {
let arr = [];
for (let card of cards) {
arr.push(card);
}
return arr.slice();
}
Here’s what it does:
- it takes a NodeList as an argument
- it creates a local, empty array named
arr
- it populates it with each card element
- it uses the
slice()
method onarr
to create a copy of it and returns it.
When we call nodeListToArray(nodeList)
we are sure we will get an array back.
We are now ready to handle the shuffling. But how can we do it?
Let’s create the shuffle function
function shuffleArray(array) {
for (let i = 0, n = array.length - 1; i < n; i++) {
let random = Math.floor(Math.random() * (n + 1));
let tmp = array[i];
array[i] = array[random];
array[random] = tmp;
}
return array;
}
Here’s what it does:
- it takes the converted array of cards as an argument
- it iterates through the cards
- for each card:
- it calculates a random number ranging through the array’s indexes
- creates a
tmp
variable and points it to the card at the current index - takes the card at the current index and points it to a random position in the array (given by the
random
variable) - takes the element at said random position and points it to
tmp
By doing this, at each iteration two cards swap their position, one of which is selected randomly. This ensure the reality of the shuffle.
To recap, there’s a function convert the cards
NodeList
to an actual array. There’s also a function that shuffles this array of cards.
The last to implement shuffling is to decide **how to handle the position change of cards in the DOM.
Well, to be precise, their position change in the cards
div.
So how do we go to actually do that?
Here’s how: we remove each div with class card
from the parent container div. Then the actual shuffling takes place. Finally, we append cards to the container div in their new poisitions.
function shuffleCards() {
// convert Node list to array
let arrayOfCards = nodeListToArray(cards);
// remove cards from dom
arrayOfCards.forEach(function (card) {
container.removeChild(card);
})
// shuffle them
shuffleArray(arrayOfCards);
// put them back in the dom
arrayOfCards.forEach(function (card) {
container.appendChild(card);
})
}
Here’s a little demonstration.
Notice that at each time I click the ‘Shuffle’ button, the shuffleCards()
function is invoked and executed.
End of part 2
This is it for the time being!
Here’s the CodePen of what we just did.
See the Pen Memory Game - p2 by Davide (@davide2894) on CodePen.
Thank you for reading this post, from the bottom of my heart. You can’t even imagine how this makes me happy!
Please, if you have questions or want to say hi, reach out here or on Twitter.
If you find this useful, please subscribe to my blog. You will be up to date to every new post I write. I won’t waste your time.
This post was originally published on Codeburst.io


This spec has been deprecated, please see the Accessibility Object Model Explainer and index to specs for up to date information.
This specification provides a way for authors to make web apps accessible using scripting, rather than the only option being declarative accessibility features of HTML markup. In the first phase, the author is able to programmatically modify the accessible representation of an existing DOM element. In future phases, the author is able to respond to additional input events from assistive technology, create new virtual accessible objects on the page that don't correspond to an HTML element at all, and explore the computed accessibility tree.
Please refer to the Accessibility Object Model Explainer for the background and motivation.
If you have questions, comments, or other feedback, please file an issue on GitHub.
The Accessibility Object Model spec is narrowly focused on the goal of creating a scripting API for web accessibility. It's intended to complement existing web accessibility APIs such as [[!WAI-ARIA]], not replace them. In particular, this spec attempts to avoid proposing new roles, states, and properties an of accessible objects except where necessary.
This specification is not intended to solve all accessibility problems on the Web. It is currently impossible to make some web features accessible, so the primary goal is to resolve immediate needs quickly for existing, inaccessible web interfaces. The specification editors are purposefully deferring many useful ideas in order to maintain a realistic timeline for highest priority features.
We have defined Inclusion/Exclusion Criteria in order to clarify exactly what will be considered in-scope.
Element
interface
The author can request an accessible node from any valid [[!DOM]]
Element
.
partial interface Element { readonly attribute AccessibleNode accessibleNode; };
The accessibleNode attribute returns the accessible
node associated with this DOM element
. It always returns
a valid object if the browser supports the AOM.
AccessibleNode
interface
interface AccessibleNode { attribute DOMString? role; attribute DOMString? roleDescription; // Accessible label and description. attribute DOMString? label; attribute AccessibleNodeList? labeledBy; attribute AccessibleNodeList? describedBy; // Global states and properties. attribute DOMString? current; // Widget properties. attribute DOMString? autocomplete; attribute boolean? hidden; attribute DOMString? keyShortcuts; attribute boolean? modal; attribute boolean? multiline; attribute boolean? multiselectable; attribute DOMString? orientation; attribute boolean? readOnly; attribute boolean? required; attribute boolean? selected; attribute DOMString? sort; // Widget states. attribute DOMString? checked; attribute boolean? expanded; attribute boolean? disabled; attribute DOMString? invalid; attribute DOMString? hasPopUp; attribute DOMString? pressed; // Control values. attribute DOMString? valueText; attribute DOMString? placeholder; attribute double? valueNow; attribute double? valueMin; attribute double? valueMax; // Live regions. attribute boolean? atomic; attribute boolean? busy; attribute DOMString? live; attribute DOMString? relevant; // Other relationships. attribute AccessibleNode? activeDescendant; attribute AccessibleNodeList? controls; attribute AccessibleNode? details; attribute AccessibleNode? errorMessage; attribute AccessibleNodeList? flowTo; attribute AccessibleNodeList? owns; // Collections. attribute long? colCount; attribute unsigned long? colIndex; attribute unsigned long? colSpan; attribute unsigned long? posInSet; attribute long? rowCount; attribute unsigned long? rowIndex; attribute unsigned long? rowSpan; attribute long? setSize; attribute unsigned long? level; };
Initially all AccessibleNode properties must return null.
All AccessibleNode properties, on setting, store the provided value. On getting, they return the user-provided value if present and valid, and null otherwise. The validity of a property valid is specified in greater detail below.
Values set on a DOM element's AccessibleNode are used for the browser's implementation of native accessibility APIs for that accessibility property. When both an AccessibleNode property and its equivalent ARIA attribute are both present, the ARIA attribute overrides the AccessibleNode property.
If a property of AccessibleNode is set to an invalid value, it is ignored.
AccessibleNodeList
interface
An AccessibleNodeList
represents an ordered
list of AccessibleNodes.
It's used to represent relationships between one
AccessibleNode
and other
AccessibleNodes
in the accessibility tree.
Unlike AccessibleNode
, AccessibleNodeList
has a constructor.
[ Constructor(optional sequence<AccessibleNode> nodes = []) ] interface AccessibleNodeList { attribute unsigned long length; getter AccessibleNode? item(unsigned long index); setter void (unsigned long index, AccessibleNode node); void add(AccessibleNode node, optional AccessibleNode? before = null); void remove(long index); };
In Phase 1, there's a 1:1 correspondence between the set of properties on AccessibleNode and the list of valid ARIA attributes from the [[!WAI-ARIA]] 1.1 spec. This table shows the mappings and also includes deprecated ARIA attributes that are not mapped into AccessibleNode properties.
The Accessibility Object Model does not define new semantics. The semantic meaning of each AccessibleNode property is identical to the meaning of the ARIA attribute.
| Attribute name | Type | Equivalent ARIA attribute |
|---|---|---|
activeDescendant |
AccessibleNode? |
aria-activedescendant |
atomic |
boolean? |
aria-atomic |
autocomplete |
DOMString? |
|
busy |
boolean? |
aria-busy |
checked |
DOMString? |
|
colCount |
long? |
|
colIndex |
unsigned long? |
|
colSpan |
unsigned long? |
|
controls |
AccessibleNodeList? |
aria-controls |
current |
DOMString? |
|
describedBy |
AccessibleNodeList? |
aria-describedby |
details |
AccessibleNode? |
aria-details |
disabled |
boolean? |
|
(deprecated)
|
||
errorMessage |
AccessibleNode? |
aria-errormessage |
expanded |
boolean? |
|
flowTo |
AccessibleNodeList? |
aria-flowto |
(deprecated)
|
||
hasPopUp |
DOMString? |
|
hidden |
boolean? |
|
invalid |
DOMString? |
|
keyShortcuts |
DOMString? |
|
label |
DOMString? |
|
labeledBy |
AccessibleNodeList? |
aria-labeledby, |
level |
unsigned long? |
|
live |
DOMString? |
|
modal |
boolean? |
|
multiline |
boolean? |
|
multiselectable |
boolean? |
|
orientation |
DOMString? |
|
owns |
AccessibleNodeList? |
aria-owns |
placeholder |
DOMString? |
|
posInSet |
unsigned long? |
|
pressed |
DOMString? |
|
readOnly |
boolean? |
|
relevant |
DOMString? |
|
required |
boolean? |
|
roleDescription |
DOMString? |
|
rowCount |
long? |
|
rowIndex |
unsigned long? |
|
rowSpan |
unsigned long? |
|
selected |
boolean? |
|
setSize |
long? |
|
sort |
DOMString? |
|
valueMax |
double? |
|
valueMin |
double? |
|
valueNow |
double? |
|
valueText |
DOMString? |
|
While ARIA attributes are all strings, AccessibleNode properties
can have many different types. Most of these are straightforward,
for example valueNow
, valueMin
, and
valueMax
are of type double
, while
rowCount
is of type long
.
The primary difference is with ARIA attributes that take one or more IDREFs. In AccessibleNode, they take references to one or more AccessibleNodes directly. This makes it possible to establish relationships between nodes that aren't in the same tree scope, such as in different frames (with the same origin), or in the shadow DOM of a custom element.
In particular,
activeDescendant
,
details
, and
errorMessage
are set with another AccessibleNode, while
controls
,
flowTo
,
labeledBy
,
describedBy
, and
owns
all take an AccessibleNodeList.
Upon setting a property of AccessibleNode, no validation is done. The user-provided value is simply stored, converted to the appropriate type via the standard rules for JavaScript types. This is to ensure that backwards compatibility is maintained; when a new property is added or a new value is recognized as valid, authors do not have to worry that browsers who have not yet added support will break or throw an exception upon encountering this code.
See Phase 2
See Phase 3
See Phase 4
Many thanks for valuable feedback, advice, and tools from: Alex Russell, Bogdan Brinza, Chris Fleizach, Cynthia Shelley, David Bolter, Domenic Denicola, Ian Hickson, Joanmarie Diggs, Marcos Caceres, Nan Wang, Robin Berjon, and Tess O'Connor.
Bogdan Brinza and Cynthia Shelley of Microsoft contributed to the first draft of this spec but are no longer actively participating.


Jeremy Corbyn calls on Jacob Rees-Mogg to apologise for Grenfell ‘common sense’ comments
Jeremy Corbyn has called on Jacob Rees-Mogg to apologise for suggesting Grenfell victims should have used “common sense” and ignored fire service guidance not to leave the burning tower block.
Speaking on LBC about the public inquiry report into the blaze, Mr Rees-Mogg discussed London Fire Brigade’s “stay-put” policy, which the report said cost lives.
The UK Commons leader said on Monday: “If you just ignore what you’re told and leave you are so much safer.
“I think if either of us were in a fire, whatever the fire brigade said, we would leave the burning building.
“It just seems the common sense thing to do, and it is such a tragedy that that didn’t happen.”
The UK Labour leader said Mr Rees-Mogg should apologise for the “crass and insensitive comments immediately”.
Mr Corbyn said: “What possesses someone to react to an entirely avoidable tragedy like Grenfell by saying the victims lacked common sense?
“People were terrified, many died trying to escape.”
His sentiments were echoed by shadow housing minister, Sarah Jones.
She said: “These are appalling comments.
“Jacob Rees-Mogg should retract them and apologise immediately.
“Statements like this just go to show how out of touch the Tories are and are a glaring admission of their failure to act in the interest of the Grenfell victims and their families.”
READ MORE
Man on trial for murder of British backpacker Grace Millane in New Zealand


|
Day 1: June 30, 2016 |
|
|
Workshop opening Remarks by UN Resident Country Coordinator Ms. Rosa Malango Remarks by Guest of Honour (to be confirmed) |
09:00 – 09:30 |
|
Introduction Presentation Pulse Lab Kampala data science team on current projects |
09:30 – 10:00 |
|
Break |
10:00 – 10:20 |
|
Keynote: Current data science work at IBM Research Africa, including Cognitive Companions in Healthcare and Education. Oliver Bent and Simone Fobi – IBM Research Africa |
10:20 – 11:00 |
|
Data Science for Agriculture (session 1)
Evan Girvetz - International Center for Tropical Agriculture (CIAT) |
11:00 – 12:00 |
|
Refreshments |
12:00 – 13:00 |
|
Data Science for Agriculture (session 2)
Richard Ssekibuule - Kudu |
13:00 – 14:30 |
|
Data Collection and Curation
Prestone Adie – Kenya Open Data Initiative |
14:30 – 15:00 |
|
Break |
15:00 – 15:30 |
|
Data Science for Sustainable Cities
Bernard Wright - Geo Gecko |
15:30 – 17:00 |
|
Keynote: Extremely Supervised Learning Moustapha Cisse - Facebook |
17:00 – 17:30 |
|
Networking |
17:30 – 18:00 |
|
Day 2: July 1, 2016 |
|
|
Keynote: The Kenya Bioacoustics Project Ciira wa Maina – Dedan Kimathi University of Technology, Nyeri, Kenya |
09:00 – 09:30 |
|
Keynote : New Directions in Data Science Neil Lawrence – University of Sheffield |
09:30 – 10:00 |
|
Break |
10:00 – 10:30 |
|
Data Science for Health
Ricardo Andrade - University of California San Francisco |
10:30 – 12:00 |
|
Refreshments |
12:00 – 13:00 |
|
Data Science for Poverty Alleviation and the Environment Anthony Gidudu - Geomatics and Land Management, Makerere University Other speakers to be confirmed |
13:00 – 14:00 |
|
Data Science Training and Mentorship in Africa
Paula Hidalgo Sanchis - Pulse Lab Kampala |
14:00 – 15:30 |
|
Networking |
15:30 – 16:30 |


# readable-stream
*Node-core streams for userland* [![Build Status](https://travis-ci.org/nodejs/readable-stream.svg?branch=master)](https://travis-ci.org/nodejs/readable-stream)
[![NPM](https://nodei.co/npm/readable-stream.png?downloads=true&downloadRank=true)](https://nodei.co/npm/readable-stream/) [![NPM](https://nodei.co/npm-dl/readable-stream.png?&months=6&height=3)](https://nodei.co/npm/readable-stream/)
[![Sauce Test Status](https://saucelabs.com/browser-matrix/readable-stream.svg)](https://saucelabs.com/u/readable-stream)
`bash
npm install --save readable-stream
`
*Node-core streams for userland*
This package is a mirror of the Streams2 and Streams3 implementations in Node-core, including [documentation](doc/stream.markdown).
If you want to guarantee a stable streams base, regardless of what version of Node you, or the users of your libraries are using, use readable-stream only and avoid the “stream” module in Node-core, for background see [this blogpost](http://r.va.gg/2014/06/why-i-dont-use-nodes-core-stream-module.html).
As of version 2.0.0 readable-stream uses semantic versioning.
# Streams WG Team Members
- Chris Dickinson ([@chrisdickinson](https://github.com/chrisdickinson<EMAIL_ADDRESS>- Release GPG key: 9554F04D7259F04124DE6B476D5A82AC7E37093B
- Calvin Metcalf ([@calvinmetcalf](https://github.com/calvinmetcalf<EMAIL_ADDRESS>- Release GPG key: F3EF5F62A87FC27A22E643F714CE4FF5015AA242
- Rod Vagg ([@rvagg](https://github.com/rvagg<EMAIL_ADDRESS>- Release GPG key: DD8F2338BAE7501E3DD5AC78C273792F7D83545D
- Sam Newman ([@sonewman](https://github.com/sonewman<EMAIL_ADDRESS>- Mathias Buus ([@mafintosh](https://github.com/mafintosh<EMAIL_ADDRESS>- Domenic Denicola ([@domenic](https://github.com/domenic)) <d@domenic.me>


This is a simple demonstration of using D3.js to render
a dynamic bar chart, using a public data feed. Specifically, the following concepts/APIs are covered:
- SVG (rect)
- Scale (d3.scale.ordinal, d3.scale.linear)
- Axis (d3.svg.axis)
- Transitions (delay, duration)
- Data Join (enter/update/exit)
- User Interactions (mouseover, mouseout)
- Dynamic Data Updates (AJAX, REST)
Fremont Bridge Bicycle Usage
The number of bikes that cross the bridge using the pedestrian/bicycle pathways, by hour, per month.
Inductive loops on the east and west pathways count the passing of bicycles regardless of travel
direction.
Fun Facts:
Total Bike Crossings:
Busiest Single Day:
Busiest Day of the Week (total):


Before last night, I had never done any drug besides a lot of pot. I am always open to new experinces so I was happy when my friend Kevin made the offer of mushrooms to me.
The one negative thing I had heard about mushrooms was the taste, but Kevin said he had that taken care of. He prepared the mushrooms by crushing them up and mixing them in with melted chocolate, then pouring it into a ice cube tray to make small cubes of chocolate mushrooms.
We took three 'cubes' with us that night to a party, one for me, one for Kevin and one for his girlfriend Michelle. We ate them around 10:00pm, and they didn't taste bad at all, just sort of like chewy chocolate. After about 20 minutes I started to feel something, but I wasn't sure if I was really trippin yet because I had never tripped before. After an hour I really started to feel good, just very relaxed and enjoying listening to people talk and watch their mouths move.
 Once I got outside I realized how much more comfortable I was when we weren't around so many people. After watching the lightning for a while, it started to drizzle, which was the most amazing feeling. It felt like everytime a drop hit my skin, it would send a rippling sensation throughout my body, kind of like what happens when you through a rock in a pond. It just felt so amazing lying there, but after about 30 mins it started to rain harder, so I went inside again.
I really was feeling good, but I wanted to be by myself because most people there were drunk and I felt like they were to loud and rowdy for me. I got home and lay in my bed, feeling physically exausted but not like I was about to fall asleep. I started shaking my head back and fourth and watched in amazement as my room began to jump all over the place.
The next day I realized how similar it was to the song 'Bouncing Around the Room' by Phish. I closed my eyes and I suddenly was in another world, soaring down an endless, colorful tunnel. I didn't get to sleep that night til around 3am, and woke up for no reason at 7am. I found in the morning that I could remember most of what happened the night before, but found it diffucult to remember what I had done during the day.
Looking back I realize what an incredibly awesome experince it was, but I would recommend at least for the first few times tripping in a quiet setting with a few good friends, not a big party. Some time alone is good as well just to explore your mind and truly feel the drugs effects with out having to worry about much else.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


****
This is a link
Here is some more information about this product that is only revealed once clicked on.


What... Me?
Diversity in Silicon Valley
July 12, 2015
“There’s a lot of work we need to do.” If there’s one statement that was echoed across the largest firms in Silicon Valley, it would be that, according to the latest diversity reports.
In Facebook’s latest issue on new hiring, despite the ramp up in public relations, hiring of ethnically minority groups remained flat with 4 percent of its employee base being Hispanic and 2 percent African American. Facebook hired seven African American employees in 2013 out of an on boarding of 1,200, according to the New York Times. Things didn’t fair much better at Google whose numbers remained virtually unchanged in their 2014 report. Why the lack of diversity? It’s hard to say. Companies are investing heavily going forward in programs to encourage more diverse candidacy but nothing yet has taken hold. It could take years before any of these investments come to fruition. What brought us to this point today?
Since this is a personal blog, I can only speak from personal experience. I could go into an in-depth analysis of societal and economic inequality, but I honestly did enough of that in college. I can however, discuss the reasons that led me, a biracial (African American and Hispanic) male to pursue computer science at a relatively late (post college degree) stage.
It takes role models. Growing up in the 90s there really weren’t many people of color in the technology industry. Unless you had a scientist, or engineer in your family, the path to becoming one was always hazy and distant. My family got our first computer when I was 10 years old. I loved that thing and spent far too many hours nestled under its cold blue glow. My parents didn’t know how to use it, but it was always fun teaching them how to do things and watching their eyes light up. Back then, computers were still relatively uncommon, especially in minority households, they were also extremely expensive. So I had the early interest and encouragement, but I didn’t choose technology as a career path. The reason for that was simple… I didn’t know I could. I didn’t know how. So, has anything changed today?
I have many young kids in my family. Sure, some have phones and computers, but none have expressed an interest in technology. It’s simply off their radars. They know no-one, who has gone down that path, there are no posters of young black or hispanic women and men to hang on their walls. Honestly, there’s a bit of resistance as well. Because the path to becoming an engineer is so hazy in our culture, questions like: “What exactly do you do?” or “You sit at a computer all day?” and “You can’t make money doing that…” all permeate within my own extended family.
There’s definitely a cultural shift happening, but without changes in perception today, it will still take many years before we see any appreciable benefit. No, there aren’t many people my young family members can look towards for advice in a career in technology today — but hopefully I might be able to change that soon, maybe I’ll even be able to teach them how to code.


|
Elektra
0.8.26
|
Elektra serves as a universal and secure framework to access configuration parameters in a global, hierarchical key database. For a small demo see here:
Gpg is now used to decrypt a master password, which is used by the individual crypto backends. So all necessary parts for encryption of decryption of individual keys is present.
Furthermore, a new botan backend was implemented.
Thanks to Peter Nirschl.
When Elektra directly modifies config files which are on the disc, and applications read the config files without Elektra, Elektra has no control over the access, e.g. we cannot dynamically calculate values. To avoid this, we wrote a library that intercepts the open
-call.
Together with the mozprefs
plugin, we got control over the configuration of Firefox and can dynamically change config values with all possibilities Elektra provides.
For easy setup, we implemented the script configure-firefox
.
Thanks to Thomas Waser.
Resolvers in Elektra are the code that are responsible to determine where content should be read from and stored to. They are independent of the actual configuration file syntax.
The gitresolver allows you to get/store config data in git.
The blockresolver allows Elektra to take control of parts of the configuration file. This is useful for config files such as vim or zsh, which contain program code. The plugin allows you to split config files with special markers into parts containing code and others controlled by Elektra.
Added zsh completion file, and a script (kdb install-sh-completion
) that installs bash+zsh completion when the default installation places do not work (e.g. for macOS).
Thanks to Sebastian Bachmann.
kdb-import
man page, thanks to Kurt MichelikeyIsSystem
/keyIsUser
as internalglobal-mount
or gmount
will overwrite previously mounted global pluginsmake test
, thanks to Kurt Micheli and René Schwaiger (Warning: might remove present keys when it conflicts with their mountpoints)As always, the ABI and API of kdb.h is fully compatible, i.e. programs compiled against an older 0.8 version of Elektra will continue to work (ABI) and you will be able to recompile programs without errors (API).
Libtools got a new major version (SOVERSION 0 -> 1):
The plugins conditionals and mathcheck are incompatible in some cases because of changes in syntax.
New API: keyRel2
which differs from keyRel
by allowing you to specify which relation should be checked.
internal
which can be used for meta-data that is not relevant for other plugins.INCLUDE_SYSTEM_DIRECTORIES
in add_plugin allows you to add a include path where warnings are suppressed (useful for boost).infos/provides
now allows multiple entriesCRYPTO
can be used to enable/disable all crypto plugin variants (not enabled by default because its experimental).ENABLE_OPTIMIZATIONS
, enable by default: trade more memory for speed (can be turned off on embedded systems)INSTALL_SYSTEM_FILES
is now off by default on macOS./usr/share/bash-completion/completions/kdb
) was /etc/bash_completion.d/kdb
(removed)/usr/share/zsh/vendor-completions/_kdb
(except for Darwin, where /usr/local/share/zsh/site-functions
is used)/etc/profile.d/kdb.sh
: the script elektraenv.sh
was removed (and is no longer installed), superseded by elektrify-getenv
kdb
command-list: commands are written in bolddoc/paper
contains some info for jossYou can download the release from here and also here on github
This release tarball now is also available signed by me using gpg
already built API-Docu can be found here
Subscribe to the RSS feed to always get the release notifications.
For any questions and comments, please contact the Mailing List the issue tracker on github or by email elekt. ra@m arkus -raa b.org
For more information, see https://libelektra.org
Best regards, Markus


Home
Team
Gallery
File Repository
Contact
WELCOME TO COMMERCIAL DEPARTMENT
CORPORATE
HOME
GALLERY
Gallery
This is an example of a comment made on a post.
Our Gallery
Album 1
Click Me
Album 2
Click Me
Album 3
Click Me
Album 4
Click Me
Album 5
Click Me
Album 6
Click Me


?The
New
York
copyright
reserved
Botanical
Garden
PLANTS
OF
JAMAICA
COLLECTED
FOR
THE
HERBARIUM
OF
DUKE
UNIVERSITY
rosea
(Sw.)
DC.
det.
C.D.
Adams
1963
St.
Andrew
Parish:
Port
Royal,
at
sea
Common,
trailing
over
sand
on
beach.
Calyx
and
stigma
green;
corolla
purple,
greenish
or
white
at
base;
standard
somewhat
marked
with
white
basally;
staminal
tube
and
ovary
white;
anthers
yellow;
ovary
green
M.
R.
CROSBY
in
fruit.
HEW
Yo^S,
Botanical
New
York
Botanical
Garden
1616332
Legend -
Level of confidence that token is an accurately-transcribed word
extremely low
very low
low
undetermined
medium
high
very high