A recent paper of mine proposed an algorithm to do weakly-supervised inverse RL from goal states (check out the paper!). The algorithm is derived through an interesting framework called "control as inference", which analogizes (max-ent) reinforcement learning as inference in a graphical model. This framework has been gaining traction recently, and it's been used to justify many recent contributions in IRL (Finn et al, Fu et al), and some interesting RL algorithms like Soft Q-Learning(Haarnoja et al).
I personally think the framework is very cute, and it's an interesting paradigm which can explain some weird quirks that show up in RL. This document is a writeup which explains exactly what "control as inference" is. Once you've finished reading this, you may also enjoy this lecture in Sergey Levine's CS294-112 class, or his primer on control as inference as a more detailed reference.
In this article, we'll focus on a finite-horizon MDP with horizon $T$ : this is simply for convenience, and all the derivations and proofs can be extended to the infinite horizon case simply. Recall that an MDP is $(\mathcal{S}, \mathcal{A}, \mathcal{T}, \rho, R)$ , where $\mathcal{S,A}$ are the state and action spaces, $T(\cdot \vert s,a)$ is the transition kernel, $\rho$ the initial state distribution, and $R$ the reward.
Trajectories in an MDP as detailed above can be modelled by the following graphical model.
The graphical model has a state variable $S_t$, an action variable $A_t$ for each timestep $t$.
We'll define the distributions of the variables in this graphical model in a way such that the probability of a trajectory $\tau = (s_0, a_0, s_1, a_1, \dots s_T)$ is equal to the probability of the trajectory under the MDP's dynamics.
We set the distribution of $S_0$ to be $\rho(s)$ (the initial state distribution of the MDP).
For subsequent $S_{t}$, the distribution is defined using transition probabilities of the MDP.
$$P(S_{t+1} = s' \vert S_{t}=s, A_t = a) = T(s' \vert a,s)$$The distribution for the action variables $A_t$ is uniform on the action space.
$$P(A_t = a) = C$$It may seem odd that the actions are sampled uniformly, but don't worry! These are only prior probabilities, and we'll get interesting action distributions once we start conditioning (Hang tight!)
The probability of a trajectory $\tau = (s_0, a_0, s_1, a_1 , \dots s_T,a_T)$ in this model factorizes as
$$\begin{align*}P(\tau) &= P(S_0 = s_0) \prod_{t=0}^{T-1} P(A_t = a_t)P(S_{t+1} = s_{t+1} | S_t = s_t, A_t = a_t)\\ &= C^T \left(\rho(s_0) \prod_{t=0}^{T-1} T(s_{t+1} \vert s_t, a_t)\right)\\ &\propto \left(\rho(s_0)\prod_{t=0}^{T-1} T(s_{t+1} | s_t,a_t)\right) \end{align*}$$The probability of a trajectory in our graphical model is thus directly proportional to the probability under the system dynamics.
In the special case that dynamics are deterministic, then $P(\tau) \propto \mathbb{1} \{\text{Feasible}\}$ (that is, all trajectories are equally likely).
So far, we have a general structure for describing the likelihood of trajectories in an MDP, but it's highly uninteresting since at the moment, all trajectories are equally likely. To highlight interesting trajectories, we'll introduce the concept of optimality.
We'll say that an agent is optimal at timestep $t$ with some probability which depends on the current state and action : $P(\text{Optimal at } t) = f(s_t,a_t)$. We'll embed optimality into our graphical model with a binary random variable at every timestep $e_t$, where $P(e_t = 1 \vert S_t=s_t, A_t=a_t) = f(s_t,a_t)$.
While we're at it, let's define a function $r(s,a)$ to be $r(s_t,a_t) = \log f(s_t,a_t)$ . The notation is very suggestive, and indeed we'll see very soon that this function $r(s,a)$ plays the role of a reward function.
The final graphical model, presented below, ends up looking much like one for a Hidden Markov Model.
For a trajectory $\tau$, the probability that it is optimal at all timesteps is proportional (exponentially) to the total reward received in the trajectory.
$$P(\text{All } e_t=1 | \tau) =\exp (\sum_{t=0}^T r(s_t,a_t))$$$$\begin{align*}P(\text{All } e_t=1 | \tau) &= \prod_{t=0}^T P(e_t = 1 \vert S_t=s_t, A_t=a_t) \\ &= \prod_{t=0}^T f(s_t,a_t) \\ &= \prod_{t=0}^T \exp{r(s_t,a_t)} \\ &= \exp (\sum_{t=0}^T r(s_t,a_t))\end{align*}$$
We'll describe the optimal trajectory distribution as the distribution when conditioned on being optimal at all time steps. $$\pi_{\text{optimal}}(\tau) = P(\tau \vert \text{All } e_t =1) = P(\tau~\vert~e_{1:T} = 1)$$
Explicitly writing out this distribution, we have that
$$P(\tau ~\vert ~e_{1:T} = 1) \propto \exp(\sum_{t=0}^T r(s_t,a_t))P(\tau)$$$$\begin{align*}P(\tau ~\vert~ e_{1:T} =1) &= \frac{P(e_{1:T} =1 \vert \tau)P(\tau)}{P(e_{1:T} =1)} \\ &\propto P(e_{1:T} =1 \vert \tau)P(\tau) \\ &\propto \exp(\sum_{t=0}^T r(s_t,a_t))P(\tau)\end{align*}$$
Under deterministic dynamics, since $P(\tau) \propto \mathbb{1}\{\text{Feasible}\}$, the probability of any feasible trajectory is $$P(\tau~\vert~ e_{1:T} =1) \propto \exp(\sum_{t=0}^T r(s_t,a_t))$$
This can be viewed as a special form of an energy-based model, where the energy of a trajectory is proportional to the reward.
We now have a model for what the optimal trajectory distribution is, so the next appropriate step is to look at optimal action distributions. If I am at state $s$ on timestep $t$, what is the "optimal" distribution of actions?
Pedantically, this corresponds to finding $$\pi_{t}(a \vert s) = P(A_t = a~\vert~S_t = s,e_{1:T} =1)$$
In our graphical model, $A_t$ is independent of all events before $t$ ($A_t \perp E_1 \dots E_{t-1})$. We can verify this mathematically, but the intuition is that the distribution of actions at a timestep shouldn't be impacted by what happened previously (the environment is Markovian). So,
$$\pi_{t}(a \vert s) = P(A_t = a \vert S_t = s, e_{t:T} =1)$$Solving for these probabilities corresponds to doing exact inference in the graphical model above, which looks much like the forward-backward algorithm for HMMs. The procedure goes as follows:
We can compute these backward messages recursively, since
Working through the math (see the proof for more details)
$$P(e_{t:T} = 1 = e^{r(s,a)} \mathbb{E}_{s' \sim T(\cdot \vert s,a)}[P(e_{t+1:T}=1 \vert S_{t+1}=s')]$$
$$P(e_{t:T} = 1\vert S_t=s) = \mathbb{E}_{a}[P(e_{t:T} = 1 \vert A_t=a, S_t =s)]$$
$$ \begin{align*} P(e_{t:T} = 1&\vert A_t =a, S_t=s)\\ &= \int_{\mathcal{S}} P(e_{t:T}=1, S_{t+1}=s' \vert S_t=s, A_t=a) ds'\\ &= \int_{\mathcal{S}} P(e_t = 1 | S_t=s, A_t=a)P(e_{t+1:T}=1, S_{t+1}=s' \vert S_t=s, A_t=a) ds'\\ &= P(e_t = 1 | S_t=s, A_t=a) \int_{\mathcal{S}} P(e_{t+1:T}=1 \vert S_{t+1}=s') P(S_{t+1} = s' \vert S_t=s, A_t=a) ds'\\ &= e^{r(s,a)} \mathbb{E}_{s' \sim T(\cdot \vert s,a)}[P(e_{t+1:T}=1 \vert S_{t+1}=s')]\\ P(e_{t:T} = 1&\vert S_t=s)\\ &= \int_{\mathcal{A}} P(e_{t:T} = 1, A_t=a \vert S_t=s) da\\ &= \int_{\mathcal{A}} P(e_{t:T} = 1 \vert A_t=a , S_t=s) P(A_t=a) da \\ &= \mathbb{E}_{a}[P(e_{t:T} = 1 \vert A_t=a, S_t =s)]\\ \end{align*} $$
That looks pretty ugly and uninterpretable, but if we view the expressions in log-probability space, there's rich meaning.
Let's define $$Q_t(s,a) = \log P(e_{t:T} = 1\vert A_t =a, S_t=s)$$ $$V_t(s) = \log P(e_{t:T} = 1 \vert S_t=s)$$
$Q$ and $V$ are very suggestively named for a good reason: we'll discover that they are the analogue of the $Q$ and $V$ functions in standard RL. Rewriting the above expressions with $Q_t(\cdot, \cdot)$ and $V_t(\cdot)$:
$$Q_t(s,a) = r(s,a) + \log \mathbb{E}_{s' \sim T(\cdot \vert s,a)}[e^{V_{t+1}(s')}]$$$$V_t(s) = \log \mathbb{E}_a [e^{Q_t(s,a)}]$$Remember that the function $\log \mathbb{E}[\exp(f(X))] $ acts as a "soft" maximum operation: that is $$\log \mathbb{E}[\exp(f(X))] = \text{soft} \max_X f(X) \approx \max_{X} f(X)$$
We'll denote it as $\text{soft} \max$ from now on - but don't get it confused with the actual softmax operator. With this notation:
$$Q_t(s,a) = r(s,a) + \text{soft} \max_{s'} V_{t+1}(s')$$$$V_t(s) = \text{soft} \max_{a} Q_{t}(s,a)$$These recursive equations look very much like the Bellman backup equations!
These are the soft Bellman backup equations. They differ from the traditional Bellman backup in two ways:
Passing backwards messages corresponds to performing Bellman updates in an MDP, albeit with slightly different backup operations
Now that we know that the $Q$ and $V$ functions correspond to backward messages, let's now compute the optimal action distribution.
$$ \begin{align*} P(A_t =a \vert S_t=s, e_{t:T}=1) &= \frac{P(e_{t:T}=1 \vert A_t =a, S_t=s)P(A_t = a \vert S_t =s)}{P(e_{t:T}=1\vert S_t=s)}\\ &= \frac{e^{Q_t(s,a)}C}{e^{V_t(s)}}\\ &\propto \exp(Q_t(s,a) - V_t(s))\\ &\propto \exp(A_t(s,a)) \end{align*} $$If we define the advantage $A_t(s,a) = Q_t(s,a) - V_t(s)$, then we find that the optimal probability of picking an action is simply proportional to the exponentiated advantage!
Haarnoja et al perform a derivation similar to this to find an algorithm called Soft Q-Learning. In their paper, they show that the soft bellman backup update is a contraction, and so Q-learning with the soft backup equations have the same convergence guarantees that Q-learning has in the discrete case. Empirically, they show that this algorithm can learn complicated continuous control tasks with high sample efficiency. In follow-up works, they deploy the algorithms on robots and also present actor-critic methods in this framework.
Let's try to look at inference in this graphical model in a different way. Instead of doing exact inference in the original model to get a policy distribution, we can attempt to learn a variational approximation to our intended distribution $q_{\theta}(\tau) \approx P(\tau \vert e_{1:T}=1)$.
The motivation is the following: we want to learn a policy $\pi(a \vert s)$ such that sampling actions from $\pi$ causes the trajectory distribution to look as close to $P(\tau \vert e_{1:T} = 1)$ as possible. We'll define a variational distribution $q_{\theta}(\tau)$ as follows:
$$q_\theta(\tau) = P(S_0 = s_0) \prod_{t=0}^T q_{\theta}(a_t \vert s_t) P(S_{t+1} = s_{t+1} \vert S_{t} = s_t, A_t = a_t) = \left(\prod_{t=0}^T q(a_t | s_t)\right) P(\tau)$$This variational distribution can change the distribution of actions, but fixes the system dynamics in place. This is a form of structured variational inference, and we attempt to find the function $q_{\theta}(a \vert s)$ which minimizes the KL divergence with our target distribution.
$$\min_{\theta} D_{KL}(q_{\theta}(\tau) \| P(\tau \vert e_{1:T} = 1))$$If we simplify the expressions, it turns out that
$$\arg\min_{\theta} D_{KL}(q_{\theta}(\tau) \| P(\tau \vert e_{1:T} = 1)) = \arg \max_{\theta} \mathbb{E}_{\tau \sim q}[ \sum_{t=0}^T r(s_t,a_t) + \mathcal{H}(q_{\theta}(\cdot \vert s_t)]$$Remember from the first section that $P(\tau \vert \text{All } e_t=1) = P(\tau) \exp(\sum_{t=0}^T r(s_t,a_t))$ $$ \begin{align*} D_{KL}(q_{\theta}(\tau) \| P(\tau \vert \text{All } e_t = 1)) &= -\mathbb{E}_{\tau \sim q}[\log \frac{P(\tau \vert \text{All } e_t = 1)}{q_{\theta}(\tau)}]\\ &= -\mathbb{E}_{\tau \sim q}[\log \frac{P(\tau) \exp(\sum_{t=0}^T r(s_t,a_t))}{ P(\tau)\left(\prod_{t=0}^T q_{\theta}(a_t | s_t)\right)}]\\ &= -\mathbb{E}_{\tau \sim q}[\log \frac{\exp(\sum_{t=0}^T r(s_t,a_t))}{\prod_{t=0}^T q_{\theta}(a_t | s_t)}]\\ &= -\mathbb{E}_{\tau \sim q}[\log \frac{\exp(\sum_{t=0}^T r(s_t,a_t))}{\exp (\sum_{t=0}^T \log q_{\theta}(a_t | s_t)}]\\ &= -\mathbb{E}_{\tau \sim q}[ \sum_{t=0}^T r(s_t,a_t) - \log q_{\theta}(a_t | s_t))]\\ \end{align*} $$ Recalling that $-\log q(a_t | s_t)$ is a point estimate of the entropy of $q_{\theta}$: $\mathcal{H}(q(\cdot \vert s))$, we get our result.
$$D_{KL}(q_{\theta}(\tau) \| P(\tau \vert e_{1:T} = 1)) = -\mathbb{E}_{\tau \sim q}[ \sum_{t=0}^T r(s_t,a_t) + \mathcal{H}(q_{\theta}(\cdot \vert s_t)]$$The best policy $q_{\theta}(a|s)$ is thus the one that maximizes expected reward with an entropy bonus. This is the the objective for maximum entropy reinforcement learning. Performing structured variational inference with this particular family of distributions to minimize the KL divergence with the optimal trajectory distribution is equivalent to doing reinforcement learning in the max-ent setting!
This tutorial is a work in progress. Stay tuned for more updates!


To unlock the party, you will all need to work together with all the people around you! To get started, please tell a bit more about yourself.
There are currently 0 other players that are ready to go. There are still 0 players that are answering the questions. Once everyone is ready, the game will begin...
Please await further instructions...
Round 1 starting in...
The first code is simple. Find all the other guests that have the same screen color as you have and tell me with how many you are...
Waiting for other teams to finish...
Round 1 completed, get ready for round 2...


hello every one hello every one hello every one hello every one hello every one hello every one hello every one hello every one hello every one hello every one hello every one hello every one hello every one hello every one


--- layout: post title: Home Is Where The Heart Is . . . Monitored date: '2012-03-01T09:28:27-08:00' tags: tumblr_url: http://alexhwilliams.tumblr.com/post/18556301318/home-is-where-the-heart-is-monitored ---
http://bit.ly/wUYCPU


{% extends "base_templates/page_base.html" %} {# base_templates/page_base.html extends base_templates/base.html #} {% block main %}
In order for you to take advantage of all that SimpleMetrics has to offer, we need a little bit of information from you. More specifically, we need access to your Stripe API in order to pull transaction history from your account. Use the following intstructions to get your Stripe API Credentials:
1.) Start by logging into your Stripe account at https://www.stripe.com/. Click your account name in the upper right corner to open a dropdown menu, then select "Account settings".
2.) Click the third tab in the popup box, API Settings. You will see four API keys, two for test mode and two for live mode. We need the one labeled 'Live Secret Key'. Copy and paste it into the form below, then click "Submit Credentials". Don't worry, we'll keep it safe!


REGISTER ACCOUNT
Username, email, password, repeat password criteria are not met! Please check again.
Already have an account?
Login


Mark Lush, Flight Instructor
Rate information
Austin, San Marcos, etc.
Extra material
Want to schedule a lesson or just learn more about flying? Feel free to reach out!
123-456-6789
<EMAIL_ADDRESS>Student quote or story.


0.1.13
Hypothesis client class
(any)
The token to query hypothes.is API
(any)
Configuration parameters for the client. See Config.js for an example.
Giving an annotation data, it is created in Hypothes.is
(any)
Function to execute after annotation creation
Creates in hypothes.is server sequentially a given list of annotations
(any)
A list of annotation bodies
(any)
Function to execute after annotations are created
any
:
progress Holds progress of creating process, current and max values in number of pending annotations to finish.
Create a list of annotations in parallel
(any)
A list of annotation bodies
(any)
Function to execute after annotations are created
Given an array of annotations creates them in the hypothes.is server
(any)
(any)
Returns users profile
(any)
Fetches an annotation by id
(any)
(any)
Updates the annotation with
(any)
(any)
(any)
Given an annotation or annotation id string, it deletes from Hypothes.is
(any)
(any)
Given a list of annotations or annotation ids, they are deleted in Hypothes.is
(any)
a list of annotations or list of strings with each id
(any)
Search annotations
(any)
(any)
Get list of groups for current user
(any)
(any)
Create a new, private group for the currently-authenticated user.
(any)
Check the body request schema in
https://h.readthedocs.io/en/latest/api-reference/#operation/createGroup
(any)
Update a group metadata: name, description or id (only for Authorities). Check: https://h.readthedocs.io/en/latest/api-reference/#tag/groups/paths/~1groups~1{id}/patch
(any)
(any)
(any)
Retrieve a group data by its ID
(any)
(any)
Remove a member from a Hypothes.is group. Currently only is allowed to remove yourself.
(any)
(any)


---
layout: api
title: "v2.1.8 JavaScript Library: L.ImageOverlay"
categories: api
version: v2.1.8
permalink: /api/v2.1.8/l-imageoverlay/
---
ImageOverlay
Used to load and display a single image over specific bounds of the map, implements ILayer interface.
Usage example
var imageUrl = 'http://www.lib.utexas.edu/maps/historical/newark_nj_1922.jpg',
imageBounds = [[40.712216, -74.22655], [40.773941, -74.12544]];
L.imageOverlay(imageUrl, imageBounds).addTo(map);
Creation
| Factory |
Description |
L.ImageOverlay(
<String> imageUrl,
<LatLngBounds> bounds,
<ImageOverlay options> options? )
|
Instantiates an image overlay object given the URL of the image and the geographical bounds it is tied to. |
Options
| Option |
Type |
Default |
Description |
opacity |
Number |
1.0 |
The opacity of the image overlay. |
attribution |
String |
'' |
The attribution text of the image overlay. |
Methods
| Method |
Returns |
Description |
addTo(
<Map> map )
|
this |
Adds the overlay to the map. |
setOpacity(
<Number> opacity )
|
this |
Sets the opacity of the overlay. |
setUrl(
<String> imageUrl )
|
this |
Changes the URL of the image. |
bringToFront() |
this |
Brings the layer to the top of all overlays. |
bringToBack() |
this |
Brings the layer to the bottom of all overlays. |


Products
Dashboard
Photo
David Tramp
Online
Users
Customers
Sale
Reviews
Photo
David Tramp
Newsletter
Orders
Log out
REVIEWS
1
Name
ReviewText
Posted at
2
Name
ReviewText
Posted at
3
Name
ReviewText
Posted at
4
Name
ReviewText
Posted at
5
Name
ReviewText
Posted at
6
Name
ReviewText
Posted at
7
Name
ReviewText
Posted at
8
Name
ReviewText
Posted at
Name
Review
Posted at
1
2
3


Welcome to the InfoVis Toolkit version ${project.version}
Copyright (C) 2003-2010 Jean-Daniel Fekete and INRIA, France.
This software is published under the terms of the X11 Software License a copy of which has been included with this distribution in the license-infovis.txt file.


Page 1 of 2
Preliminary animation video
Posted:
Wed Jul 11, 2007 11:47 pm
by thadiusofx3
of my man I made with just his legs walking
(made in about 10 minutes, which is why his legs are just moving)
http://poorserver.no-ip.org/projectvolu ... anwalk.avi
next stage is to make his arms move, and his body twist, this is just a preview for myself to make sure I could do it lol
Posted:
Thu Jul 12, 2007 5:25 am
by Karl G.
Looks like a good start! Will this be exported in .X, or some other way?
Posted:
Thu Jul 12, 2007 11:18 am
by thadiusofx3
That's a good question. How are animations handled in .x?
Posted:
Thu Jul 12, 2007 2:17 pm
by Karl G.
Badly. They can be keyframed, but it's going to be a dog to use them because the DXSDK code is slow and I haven't bothered rewriting it. I will, later, but for now it takes up a bunch of memory.
Posted:
Thu Jul 12, 2007 4:35 pm
by thadiusofx3
OMG I found a sweet tool for making human bodies.
expect some pretty awesome looking models very soon
Posted:
Thu Jul 12, 2007 6:08 pm
by Karl G.
great!
Posted:
Fri Jul 13, 2007 3:15 am
by thadiusofx3
some sort of ogre looking enemy
Posted:
Fri Jul 13, 2007 3:23 am
by thadiusofx3
female elf with subsurf level 1 on
Posted:
Fri Jul 13, 2007 3:28 am
by thadiusofx3
a mummy
Posted:
Fri Jul 13, 2007 7:25 am
by 9sam1
Damn, you made these? Very nice.
Posted:
Fri Jul 13, 2007 8:08 am
by thadiusofx3
with a program, yeah
Posted:
Fri Jul 13, 2007 7:56 pm
by thadiusofx3
a male mage possibly
Posted:
Fri Jul 13, 2007 8:29 pm
by thadiusofx3
some sort of demon
Posted:
Fri Jul 13, 2007 8:47 pm
by 9sam1
the mage looks like there wearing a dress. Id say go with the robe look.

One thing you can do to reduce polycounts though is flatten out portions when you're texturing (such as the mage's face)
Posted:
Sat Jul 14, 2007 10:26 am
by thadiusofx3
the screenshots (except the ogre) are taken with subsurfacing level 1 or 2 on, so they look alot smoother than they actually are
they're actually decently low-poly, and I can reduce them more automatically
Posted:
Sat Jul 14, 2007 1:46 pm
by thadiusofx3
my awesome gnome!
Posted:
Sat Jul 14, 2007 4:21 pm
by 9sam1
whats with those weird beards lol. And why are they naked!
Posted:
Sat Jul 14, 2007 4:24 pm
by thadiusofx3
I dunno lol
they're naked cause they don't have clothes (imagine that!)
Posted:
Sun Jul 15, 2007 9:23 pm
by 9sam1
saw your post on XT about "makehuman" Gonna dl it and give it a try, hopefully it aint to hard , so maybe i can make some models
Posted:
Sun Jul 15, 2007 9:35 pm
by thadiusofx3
hint: click on the pictures and move your mouse left or right
Posted:
Mon Jul 16, 2007 1:00 am
by ziggman
these look awsome!
Posted:
Mon Jul 16, 2007 1:07 am
by thadiusofx3
thanks!
Posted:
Mon Jul 16, 2007 11:53 am
by 9sam1
K ive made a model, now how do i add textures to it and stuff? Is there a way to save it as a file thats editable by blender?
Posted:
Mon Jul 16, 2007 1:17 pm
by thadiusofx3
yeah theres a button to export it to obj and .mtl
then go into blender, delete the default cube, go to import>wavefront obj> then find the file (my documents>makehuman>myobjs by default


“Bookshelves” — A RESTful demonstration
Waiting for Data...
{{message}}
{{endpoint}}
Author
Title
{{book.author}}
{{book.title}}
Add


SIGALTSTACK
Section: Linux Programmer's Manual (2)Updated: 20 September 1999
Index Return to Main Contents
NAME
sigaltstack - get or set alternate signal stack contentSYNOPSIS
#include <signal.h>int sigaltstack(const stack_t *ss, stack_t *oss);
where:
- ss
- points to a signalstack structure defined in <signal.h> containing stack content after the call.
- oss
- if not NULL, points to a signalstack structure containing stack content before the call.
DESCRIPTION
sigaction(2) may indicate that a signal should execute on an alternate stack. Where this is the case, sigaltstack(2) stores the signal in an alternate stack structure ss where its execution status may be examined prior to processing.
The sigaltstack struct is defined in <signal.h> as follows:
-
void *ss_sp /* SVID3 uses caddr_t ss_sp int ss_flags size_t ss_size
- ss_sp
- points to the stack structure.
- ss_flags
-
specifies the stack state to SS_DISABLE or SS_ONSTACK as follows:
If ss is not NULL,the new state may be set to SS_DISABLE, which specifies that the stack is to be disabled and ss_sp and ss_size are ignored. If SS_DISABLE is not set, the stack will be enabled.
If oss is not NULL, the stack state may be either SS_ONSTACK or SS_DISABLE. The value SS_ONSTACK indicates that the process is currently executing on the alternate stack and that any attempt to modify it during execution will fail. The value SS_DISABLE indicates that the current signal stack is disabled.
- ss_size
- specifies the size of the stack.
The value SIGSTKSZ defines the average number of bytes used when allocating an alternate stack area. The value MINSIGSTKSZ defines the minimum stack size for a signal handler. When processing an alternate stack size, your program should include these values in the stack requirement to plan for the overhead of the operating system.
RETURN VALUES
sigaltstack(2) returns 0 on success and -1 on failure.ERRORS
sigaltstack(2) sets errno for the following conditions:- EINVAL
- ss is not a null pointer the ss_flags member pointed to by ss contains flags other than SS_DISABLE.
- ENOMEM
- The size of the alternate stack area is less than MINSIGSTKSZ.
- EPERM
- An attempt was made to modify an active stack.
STANDARDS
This function comforms to: XPG4-UNIX.SEE ALSO
getcontext(2), sigaction(2), sigsetjmp(3).
Index
This document was created by man2html, using the manual pages.
Time: 05:33:05 GMT, December 24, 2015


[gecode-users] Branching allowing values back in the domain
Guido Tack
tack at gecode.org
Wed Aug 25 21:33:24 CEST 2010
Hi David,
I think the problem with your propagator might be the PC_INT_BND propagation condition in combination with your domain pruning (using the minus_r operations). The thing is that your propagator won't be scheduled when an inner value is removed from one of its variables' domains, but it could actually perform propagation (given that the other variable is assigned). I'm not 100% sure (I haven't tried to understand the subsumption logic in detail), but try using PC_INT_DOM and see if that solves the problem.
Cheers,
Guido
--
Guido Tack, http://people.cs.kuleuven.be/~guido.tack/
More information about the users
mailing list


About me
Hi! My name is Iain van der Wiel, 37 years old and I live in Oosterhout, The Netherlands.
Husband of Margot, father of Esmée and buddy of our labrador Luna.
Passionate about frontend and UX, I write HTML, CSS and JavaScript/TypeScript to build great websites and applications that are usable by everyone.
My core principles
- Semantic HTML - Use the right HTML elements for the right purpose
- Accessibility - The web should be usable by anyone, anywhere
- Extensibility - Easily extendable code is great to work with
- Code quality - Express complex problems in clear and simple code
- Performance - People don't like slow websites and apps
- Diversity - Equal opportunities for everyone, remove obstacles that impose boundaries
- Collaboration - Work together to achieve goals, make use of each other's experience
- Mentoring and coaching - Stimulate growth in people by motivation
- Move fast - Quick increments give results and valuable feedback sooner
Professional experience
-
Senior frontend engineer and consultant at iO Consultancy in Eindhoven, from November 2018 until present. Worked for the following clients:
-
Luminus in Brussels - from Jan 2023 until present.
Started up a new team to build a new website application for Luminus in NextJS. At the start, I was part of a team researching the various options for the CMS to replace the existing Sitecore CMS, providing the team with insights from a technical perspective and comparing it to the existing setup. During the RFP phase for CMS vendor selection, I was part of the team that evaluated the proposals and gave input for selecting a vendor.
As a member of the frontend team, I was also involved in developing and maintaining the existing comonent library, which was built in MUI. For the CMS we decided to update our design system and implement the new version into the component library through the use of design tokens. These design tokens would be synchronized to development tokens through the use of the Tokens Studio Figma plugin and Style Dictionary.
As the project advanced from the RFP phase, I also started onboarding new team members onto the CMS and Design System project to help speed up the development of the new website.
Stack: TypeScript, React, NextJS, Jest, React Testing Library, MUI, Storybook, Chromatic, Figma, Tokens Studio, Style Dictionary, Azure DevOps, BitBucket
-
PortXchange in Rotterdam - from July 2019 until Dec 2022.
Continued development of main Synchronizer application for optimising ship port calls in various ports around the world. Large focus on data clarity and quality, presenting a lot of valuable information to a large user base. Expanded several existing features and developed entirely new features in a large code base.
Did a complete redevelopment of the UI of the Vessel Planner application to improve UX, accessibility and code quality. Wrote an integration test suite to improve upon an untested code base, covering the most crucial parts of the application. This brought the code coverage to ~60% in the first iteration.
Through Q4 2021 until Q1 2022 I led the effort in creating the PilotTracker application for the Port of Houston to deprecate an older unmaintained piece of software they used before. Keeping an eye on performance, accessibility and user experience, we created an optimised product to track vessel movements and pilots within the port.
Stack: TypeScript, fp-ts, React, Redux, React Router, Jest, React Testing Library, Enzyme, Auth0, CircleCI, Netlify, Trello, GraphQL, Lerna, Jotai
-
VONQ in Rotterdam - from November 2018 until July 2019.
Continued development of a React application where companies can order job marketing campaigns and view campaign analytics to track (potential) candidates viewing their vacancies.
Started as the only frontender as their two previous frontend developers left in quick succession shortly before I started. Helped VONQ with selecting and interviewing candidates to rebuild their frontend development team. Onboarded, coached and mentored the new hires to get up to speed quickly.
Stack: React, Redux, React Router, Recharts, Webpack, Jest, Enzyme, Docker, Jenkins, Jira
-
-
Senior frontend developer at E-sites in Breda, from March 2013 until October 2018.
Worked on websites and applications for smaller and larger clients with greatly varying requirements per project.
Took the lead in improving and automating a lot of the developer workflow. Organized periodic frontend meetings to discuss projects, improve collaboration and share knowledge. Gave several trainings and presented at several meetups on various topics.
Coached and mentored several interns. Showed them the ropes in the world of frontend development, team processes and collaboration. Also coached them in areas of frontend development that interested them the most.
Stack: PHP, Symfony, Twig, React, Redux, React Router, Gatsby, GraphQL, Jest, Mocha, Chai, Istanbul, Angular.js, jQuery, Jenkins, Jira
-
Frontend developer at Estate (now iO Digital) in Tilburg, from March 2011 until February 2013
Stack: ASP.Net, Sitecore, Sitefinity, jQuery
-
Web developer and designer at Tirato (now NoBears) in Drunen, from August 2008 until February 2011
Stack: PHP, Silverstripe, WordPress, jQuery
-
Print and web designer at Reach Strategische Communicatie, from February 2008 until August 2008
Languages, tools, libraries and frameworks
I consider myself to be (very) familiar with:
- The basics: HTML, CSS and JavaScript
- TypeScript
- Functional programming
- Unit/integration/end-to-end testing
- React and its ecosystem
- Jest, React Testing Library, Enzyme
- Webpack
- Node.js
- Gulp.js
- jQuery
- Twig, Handlebars and Mustache template engines
- Scrum/agile
- Jira, Trello
To some extent, I have experience in the following:
- PHP 5.6/7
- Symfony PHP framework
- Kunstmaan, Symfony-based CMS
- WordPress
- Silverstripe CMS
- Angular
- Vue
- Angular.js
Courses and trainings
- CSS Grid course by Wes Bos
- ES6.io course by Wes Bos
- Learn Node course by Wes Bos
- Scrum Master Essentials training by Agile Works
- Workshop ES2015+ from Fronteers
- React for beginners course by Wes Bos
- Effective communication by MXF Bedrijfspsychologie
Education
- MBO Multimedia and Design at ROC Zoomvliet College Roosendaal, from 2004 to 2007. Acquired diploma.
- HBO ICT at Hogeschool 's Hertogenbosch, from 2003 to 2004.
- HBO ICT at Hogeschool Breda, from 2002 to 2003.
- HAVO Natuur & Techniek at KSE Etten-Leur, from 1997 to 2002


Parse Large Data Sets Efficiently with Transferrable Objects
Transferable Objects are lightning fast! The prefixed [window|worker].webkitPostMessage() now supports sending an ArrayBuffer as a transferable.
[window|worker].webkitPostMessage()
ArrayBuffer


Bangladesh evacuates 100 000 as Cyclone Bulbul approaches
Bangladesh authorities have evacuated around 100 000 people from the country's low-lying coastal villages and islands with Cyclone Bulbul set to slam into the country later on Saturday, officials said.
The Meteorological Department has asked local authorities and two ports to raise their highest alert, as the cyclone is expected to unleash a storm surge as high as two metres in coastal districts.
Bulbul, packing a maximum wind speed of 120km/h (75 miles), is on course to make landfall near the Sundarbans, the world's largest mangrove forest, which straddles Bangladesh and part of eastern India and is home to the endangered Bengal tigers.
The cyclone is expected to hit the Bangladesh coast at around 20:00 (1400 GMT), disaster management secretary Shah Kamal told AFP, adding there are plans to evacuate some 1.5 million people before that.
Authorities have suspended a nationwide school test, cancelled the holidays of officials posted in coastal districts and called off a traditional fair that draws tens of thousands of people in the Sundarbans.
Operations at the country's two major ports - Mongla and Chittagong - have been suspended, Kamal said.
Aound 55 000 volunteers have been mobilised to go door to door and alert people about the storm.
Bangladesh's low-lying coast, home to 30 million people, is regularly battered by powerful cyclones that leave a trail of devastation in their wake.
Hundreds of thousands of people have been killed over the last few decades in cyclones, whose frequency and intensity have increased.
Bangladesh has, however, improved its preparedness in recent years, cutting the number casualties since Cyclone Sidr killed more than 3000 people in 2007.
In May this year, Fani became the most powerful storm to hit the country in five years, but just over a dozen people were killed.


Here is a simple @x:Act script for computing factorial.
When this script is run it produces the following output on STDOUT.
fact(1)=1@x:Act commands all start with @x:. The @ indicates the start of a command. This approach allows @x:Act to have no reserved words. The x: identifies a namespace (much as it does in XML). The x namespace is predefined for @x:Act commands. @x:Act allows other command sets to be defined, each with its own namespace. Note that the if-then-else involves two consecutive commands.
In the @x:Act language every expression and command has a value. Some commands such as @x:func and @x:var produce a null which is here discarded.
Expression prefix and infix operators are similar to those of Java with a couple of exceptions. Here := is the assignment operator (rather than the = used in Java).


Video: Scripting and adjusting playspeed of videos
This browser does not support the video element.
Play
Playback Speed (
1
)
Event type:
Current source file:
Video size:
×


home
properties
contacts
news
absolute ESTATE
get a house at a reasonable price
contacts
kololi 19
th
street, banjul the gambia
+220 3202829 / +220 793898
stay connected
let's talk


If the character stops being a Truck, 4-Wheel Drive stops applying, and its base attack will revert to whatever is printed on the card.
How do other attack bonuses work with 4-Wheel Drive?
Changing a character’s base attack is just like changing the number that’s printed on the card. From there, all other bonuses apply as normal. For example, if you have a Truck with 3 attack upgraded with Indestructible Sword (that gives it +2 attack), its attack will be 9 (7 from 4-Wheel Drive +2 from the upgrade). If it stops being a Truck that turn, its attack will be 5 (base 3 attack +2 from the upgrade).


Adding items at the end and at the beginning of the Scroller's Buffer is possible with {{appendCallSample}} and {{prependCallSample}} methods respectively. The items parameter is an array of items we want to add. Both methods act in the same way, so let's discuss prepend.
In this demo we have 20 items on start, 5 of them (95-99) are invisible on the backward direction. By pushing "Prepend" button we want to add 4 (which is the input value) new items to the top of the list. After they are prepended, they become visible when scrolling up. The Scroller accurately injects prepended items into its Buffer consisting of 95-114 rows initially, so 1-4 new items temporary take place of items with indexes 91-94.
But if we scroll away and make '90s items invisible and deleted from the viewport, and then scroll back, we will realise that nothing changes: "new" items are gone and the old 91-94 items returned to initial position. The point is that the changes we provide via Adapter over the internal Scroller's Buffer don't affect the external Datasource we implemented on the Component level. This is our responsibility to take care of data passing to the Scroller through the Datasource. The next sample provides one of the approach of consistent Datasource implementation with Adapter.append and Adapter.prepend methods usage.


--- layout: post permalink: eidolongolf.html Tags: Array NameOfCoupon: Eidolon Golf Cash Back Summary: See our Eidolon Golf Coupon Code, Eidolon Golf Rebate, Eidolon Golf Promo Code, Eidolon Golf Discount, Eidolon Golf Coupon Cash Back Rebate here. MetaKeywords: Eidolon Golf Coupon Code, Eidolon Golf Rebate, Eidolon Golf Promo Code, Eidolon Golf Cash Back Rebate, Eidolon Golf Discount, Eidolon Golf Coupon Image: images/25522.gif LinkURL: http://www.shareasale.com/r.cfm?b=209821&u=412002&m=25522 affiliate_url_link: http://www.icouponblog.com/jane.php?id=114 thesis_readmore: See the Eidolon Golf Coupon thesis_thumb: http://www.icouponblog.com/tn.php?merchantURL=eidolongolf.com Title: Save 6% - Eidolon Golf Coupon Code for eidolongolf.com. Eidolon Golf Rebate & Discount thesis_description: Our Eidolon Golf Discount Coupon Code for eidolongolf.com. We have the best Eidolon Golf Rebate anywhere. thesis_keywords: Eidolon Golf, Eidolon Golf Coupon Code, Eidolon Golf Discount, Eidolon Golf Rebate product_name: Eidolon Golf hop_url: http://www.icouponblog.com/hop.php?id=114 ---
Eidolon Golf is the leader in custom built wedges. It offers the finest wedges to the golf public. Eidolon Golf guarantees a better short game that allows you to score better. Eidolon Golf has the only wedges that have Patented V-SOLE® technology. "V-Sole" refers to slightly v-shaped sole, which creates two bounce angles, one forward, one aft. Get 6% cash back on Eidolon Golf with our discount coupons.
Eidolon Golf makes three V-Sole wedges - 52-degree gap wedge, 56-degree mid-wedge, 60-degree lob wedge. Only Eidolon Golf builds each and every wedge specifically for the golfer who’s going to play them. No other brand has Eidolon Golf's patented V-sole technology. Improve your short game with Eidolon Golf the best wedges available in the market. Get discount with our discount coupon on 4 models of Eidolon Golf clubs that will vastly enhance your game and impress your friends and opponents alike.
Eidolon V-SOLE wedges are designed and crafted to be the finest in golf, and are built specifically for the golfer who's going to play them. Eidolon wedges have the Better technology, more spin, premium shafts custom built to fit you and your game. If your short game is worth the extra attention, you've come to the right place to begin to shave strokes. Just select the profile that best matches your game, and learn how Eidolon Golf can build you the scoring tools you need to make your game the best ever! Don't forget to use the 6% cash back offer coupon.<.br>


Pipeline Multisampling state configuration: Number of samples, alpha to coverage, alpha to one, sampling mask. More...
Public Member Functions | |
| MultiSampleStateCreateParam (bool stateEnabled=false, bool sampleShadingEnable=false, bool alphaToCoverageEnable=false, bool alphaToOneEnable=false, types::SampleCount rasterizationSamples=types::SampleCount::Count1, float32 minSampleShading=0.f, uint32 sampleMask=0xffffffff) | |
| Constructor. Create a multisampling configuration. More... | |
| MultiSampleStateCreateParam & | enableState (bool active) |
| Enable/disable multisampling More... | |
| float32 | getMinSampleShading () const |
| Get the number of minimum samples More... | |
| uint32 | getNumRasterizationSamples () const |
| Return the number of rasterization (MSAA) samples More... | |
| uint32 | getSampleMask () const |
| Get the sample mask More... | |
| bool | isAlphaToCoverageEnabled () const |
| Get alpha to coverage state More... | |
| bool | isAlphaToOneEnabled () const |
| Get alpha to one state More... | |
| bool | isSampleShadingEnabled () const |
| Get the sample shading state More... | |
| bool | isStateEnabled () const |
| Return true if multisampling state is enabled More... | |
| MultiSampleStateCreateParam & | setAlphaToCoverage (bool enable) |
| Enable/ Disable alpha to coverage More... | |
| MultiSampleStateCreateParam & | setAlphaToOne (bool enable) |
| Controls whether the alpha component of the fragment’s first color output is replaced with one More... | |
| MultiSampleStateCreateParam & | setMinSampleShading (float32 minSampleShading) |
| Set minimum sample shading. More... | |
| MultiSampleStateCreateParam & | setNumRasterizationSamples (types::SampleCount samplesCount) |
| Set the number of samples per pixel used in rasterization (Multi sample anti aliasing) More... | |
| MultiSampleStateCreateParam & | setSampleMask (uint32 mask) |
| Set a bitmask of static coverage information that is ANDed with the coverage information generated during rasterization. More... | |
| MultiSampleStateCreateParam & | setSampleShading (bool enable) |
| Enable/ disable sampler shading (Multi Sampling Anti Aliasing). More... | |
Pipeline Multisampling state configuration: Number of samples, alpha to coverage, alpha to one, sampling mask.
Defaults: No multisampling
|
inline |
Constructor. Create a multisampling configuration.
| stateEnabled | Enable/disable multisampling (default false) |
| sampleShadingEnable | Enable/disable sample shading (defalt false) |
| alphaToCoverageEnable | Enable/disable alpha-to-coverage |
| alphaToOneEnable | Enable/disable alpha-to-one |
| rasterizationSamples | The number of rasterization samples (default 1) |
| minSampleShading | The minimum sample Shading (default 0) |
| sampleMask | sampleMask (default 0) |
|
inline |
Enable/disable multisampling
| active | true enable, false disable if the pipeline has rasterization disabled. |
|
inline |
Get the number of minimum samples
|
inline |
Return the number of rasterization (MSAA) samples
|
inline |
Get the sample mask
|
inline |
Get alpha to coverage state
|
inline |
Get alpha to one state
Return true if alpha to one is enabled, false if disabled
|
inline |
Get the sample shading state
|
inline |
Return true if multisampling state is enabled
|
inline |
Enable/ Disable alpha to coverage
| enable | True to enable Alpha to Coverage, false to Disable |
|
inline |
Controls whether the alpha component of the fragment’s first color output is replaced with one
| enable | true enable alpha to one, false disable |
|
inline |
Set minimum sample shading.
| minSampleShading | The number of minimum samples to shade |
|
inline |
Set the number of samples per pixel used in rasterization (Multi sample anti aliasing)
| samplesCount | The number of samples |
|
inline |
Set a bitmask of static coverage information that is ANDed with the coverage information generated during rasterization.
| mask | The sample mask. See the corresponding API spec for exact bit usage of the mask. |
|
inline |
Enable/ disable sampler shading (Multi Sampling Anti Aliasing).
| enable | true enable per-sample shading, false to disable |


@* * Copyright 2017 HM Revenue & Customs * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. *@ @import uk.gov.hmrc.play.views.html.helpers._ @import uk.gov.hmrc.cbcrfrontend.AppConfig @import uk.gov.hmrc.cbcrfrontend.views.html._ @import helper._ @import tags._ @import uk.gov.hmrc.cbcrfrontend.controllers.routes @(asideBusiness: Html, phaseBannerBeta: Html, form:Form[_], submissionContext: Boolean = false)( implicit request: Request[_], messages: Messages) @sidebarContent = { @asideBusiness } @emailErrors = @{form.error("reconfirmEmail").isDefined} @main_template("Country by Country Reporting", sidebarLinks = Some(sidebarContent)) {
@Messages("contactInfoSubmitter.reconfirm.email.wrong")


Table of Contents
It is possible to improve the multiprocessor scaling of your DB databases by implementing slices. Slices cause your database records to be spread evenly across sub-environments and sub-databases using an internal hashing algorithm. Because your records are stored in separate physical environments and databases, this allows for better parallel processing support by spreading read and write workloads across separate, discrete processor cores.
To use slices, you must enable slice support for your library at compile time. You must also configure your environment and database to support slices. Optionally, you can also indicate which portion of your keys are slice-relevant; that is, which portions of your keys are used to determine which slice they belong to.
Be aware that use of slices has some ramifications when it comes to transactional processing of of multiple records within a single transaction. Because your records are distributed not just across physical databases, but also across physical environments, atomic operations can only be performed on records contained within the same physical slice.
Slices are only supported for databases using the BTree and Hash access methods. Also, slices are not supported for in-memory only databases, or for sub-databases.
Slices are not supported for Windows in this release.
To create a sliced database, do all of the following:
Enable slices when you compile your DB library. Use
the --enable-slices
configuration
option when compiling a *nix version of the library.
Configure slice support for your environment using the set_slice_count DB_CONFIG parameter. This parameter simply identifies the total number of slices you want to use. For best performance, the number of slices you configure should be equal to the number of cores available on your platform.
Because using slices means that a sub-environment is created for each slice, it is sometimes necessary to perform configuration on a sub-environment basis. You can do this using the slice DB_CONFIG parameter.
Open your database so that it supports slices. Use the
DB_SLICED
flag with the DB->open()
method to do this. Note that this flag is only required
when you initially create the database. After that,
using the database will be open with sliced support
regardless of whether the flag is present.


JOSH AND S.A.M. A film review by John Walker Copyright 1993 John Walker
My form of "rating": I saw this first at matinee price--but to get there, I had to take time off from work. Since I've used up leave time, I took leave without pay. I don't really want to think what it works out to, but I figure *it was worth it*. I'll try to see it again this week at the (far cheaper for me) full rate. If I can't, it'll be LWOP rates again for another matinee. And I'll buy the video when it comes out.
<>
"Expectations" may be an obsession of mine, but I'll say it: *If you can park virtually every expectation at the door*, this will be a flick that can become addictive.
It will hit you on more levels than most three other movies. It's a romp--the sort of thing lots of us wanted to do as kids--screw everything, grab a car, and beat it for the border. It's an adventure--where the stakes are high, and the hero must play everything right or face disaster. It's a comedy--where adults are somewhat silly, and two kids create their own universe. It's sort of like a horror story, but without magic or the supernatural--where the demons are utterly ordinary people doing ordinary sorts of things. And it's a morality play--where the hero has to face himself and his own actions.
But if you can't park the expectations, you may very well hit a wall with this film. Others have.
<>
Josh (Jacob Tierney), a 12-year-old or so, and Sam (Noah Fleiss), 8 or so, are brothers. Their parents (Stephen Tobolowsky and Joan Allen) are divorced. Sam is sweet kid, a natural jock, and bright--but withdrawn. The other kids call him "Robot" and "Alien". Josh is one of those kids who has given the word "hacker" a bad name. Besides the usual computer stuff, he duplicates credit-card magnetic strips to use the accounts of his mother's boyfriend.
Josh also lies a lot. After the kids get sent to the father's for the end of the summer, Josh's opening gambit (besides previous stories about the boyfriend) is to tell Sam that he (Sam) is really a Strategically Altered Mutant (S.A.M.), and to generate documents to "prove" it. Sam believes it--and the further lies that he's set to be sold to the Pentagon to be a child warrior and that his only hope is to escape to Canada.
When the two are going to be suddenly shuttled back to Mom for a farewell because she's leaving for Europe and dumping them with Dad for a year, Josh embarks on still further lies, that lead to mistaken/fake identity, and a crunch where he has to kill a violent drunk (Chris Penn). (At least Josh thinks he's killed him; he can't find a pulse.)
By the way, have I said that Josh is the *hero*?!
In any event, now they *both* have reason to clear the territory. They steal the drunk's rental car and make their move. Along the way, they'll pick up a friendly hitch-hiker, Alison (Martha Plimpton). But it ain't gonna be smooth sailing.
<>
When I talk to anyone about a movie, I try to think of two things: what did I go through in seeing the flick, and what do I think other people will do. I'd like to flag things things that I think others have missed, either to warn people of a negative *before* they go, or to point out something that might be attractive.
Before I saw JOSH AND S.A.M., I had signals from two quarters: 1) Stanley Drew Rosenbaum (rosenbau@ucsu.Colorado.EDU); and 2) the reviews of a) James Berardinelli<EMAIL_ADDRESS>and b) Scott Renshaw, Stanford University<EMAIL_ADDRESS>(IDC Database)).
<>
Rosenbaum seemed to be describing JOSH AND S.A.M. as what I'd call "a romp"--fun, plain and simple. (I refer you to "The JOSH and S.A.M. Audience Participation Guide 1.2" rec.arts.movies thread, among others.)
Well, I'd give a note of caution there. (I'd caution you about doing the Guide's "vocal" parts in a first-run theater!) After the movie jelled, I was wired throughout it. It wasn't simply a nifty comedy. For me, it was an adventure.
The only image I have is that it was like falling onto a sled in winter and going down a totally new hill. In one sense, you're in complete control: turn left, turn right, shift your weight here, drag your foot just a little bit there, the sled goes where you tell it. But there are rocks and trees everywhere, and you can't see very far ahead.
The one thing you can never do is *stop*. Try, and body parts will be decorating the landscape. All you can do is hope that the trail you're making doesn't go off a ledge somewhere, or smack into a dead-end rock.
That's the situation Josh finds himself in.
One test of a movie is whether my attention wanders, whether I think of other stuff while it's running. Two ideas came up, one right after another--only a few times, and JOSH AND S.A.M. immediately got my attention again. The *second* thing was "What's gonna happen?! How's it gonna *end*!?" I could only see terror and disaster. That is *not* what I think of during a light comedy! (Maybe I have a problem with getting into films too easily.)
So, I think I'll use the Guide for *later* viewings, when I'm not so wired. (Let it be noted, however, that if I go to a theater that sells hot dogs, it will be positively disloyal not to buy one or two! Candy bars just won't cut it. Also, the half-pepperoni, half-pineapple pizza *has* acquired a permanent significance. It has only a small role in the film, but I will nonetheless concede to Rosenbaum that it must now be regarded as a cultural icon!)
<>
But I said that my fear of the end was the *second* thing--what was the first? It was "they [meaning: lots of you folks] are *not* gonna believe this." The closest I could come to finding a neutral term to describe why was "a pervasive air of unreality". And I don't like that term, because in some sense, this film is completely realistic--after you concede *one* premise.
Although I disagree with their conclusions, I have to thank both Berardinelli and Renshaw for stating the real problem very clearly:
Berardinelli: >How much are you willing to suspend your disbelief? In the answer to >that question lies the degree to which you'll buy into the underlying >premise of JOSH AND S.A.M, and how much you will therefore enjoy it.
Renshaw: > Every once in a while, I come upon a movie where I simply can't >get beyond the basic premise; as well as certain individual elements >might be executed, I'm so turned off by that premise that I can't >possibly enjoy the film.
(Note: I want to thank them both for stating the real problem. Too few reviewers in the general press warn us of the decisions *we* make that can radically alter our perception of a film. However, now I'm going to go into what *I* think the root premises of JOSH AND S.A.M. are. I don't want to imply that I'm representing what *Berardinelli or Renshaw* view as the premises.)
To some extent, I think there are *at least* two premises involved in people's perception of JOSH AND S.A.M., but they will both stick in the craw for some people.
The *false* premise, as far as I can see, is to view Josh and Sam as poor-little-abused-kids, or poor-little-disturbed-kids. To mix comedy with such kids is unacceptable: "poor-little-abused-or- disturbed-kids never have a nice day."
Well, first, that's *false* about kids in trouble in the real world. Humor is sometimes what keeps them *alive*. Presenting *both* the humorous aspects *and* the abuse can make a film a lot truer than keeping each in its own tidy little niche.
Regardless of that, however, it's *false* about the film. The screenplay (by Frank Deese) has to walk a very fine line, and does so. Josh and Sam are neither abused nor disturbed--at least no more so than lots of the rest of us.
Yes, the mother seems too self-concerned. Yes, the boyfriend seems like a Continental lounge lizard.   Yes, Josh and Sam have both coped poorly with the breakup, Josh by withdrawing into computers and lying and petty larceny, Sam by withdrawing into himself except to get into fights.
*None of those are neat things*, and the screenplay does not pass them off as trivial. They're real. For Josh and Sam, they could develop into *major* problems, and right now the parents are doing *nothing* constructive. But those problems are not yet the stuff of high melodrama--sympathy and concern, yes, but not pegging Josh and Sam as basket cases or everyone else as creeps. No matter how lousy their situations are, many kids go through similar things--*most* pull out of them before things become a disaster. Yes, some don't, and maybe Josh and Sam were turning into two who wouldn't. But that point hadn't been reached yet.
(If either Josh or Sam is a bona fide basket case, we shouldn't even *think* about what many average kids are--much less the average USENET reader!)
<>
But there's another premise, and it's this one I think that gives JOSH AND S.A.M. an air of unreality. It's remarkably simple.
Josh is a liar, right? He can tell his mother lies about her boyfriend; she ignores him. But when he once tells Sam that Sam is a mutant, the lying game changes. Sam *believes* him. Why? Because it *fits*. He's really got a lot of electronics inside? It explains *everything*. Why he feels cold inside, why the other kids think he's an alien, a robot, why he thinks about being dead.
You and I can see those as the result of his not being able to handle the breakup. But for Sam, that's just how he *feels*. Now he's got an *explanation*. (Do you remember when it seemed entirely plausible that if you swallowed an orange seed, it would sprout into a tree in your stomach? Or lots of comparable ideas?)
With further lies, the same thing will happen to Josh again: people will *believe* him. The film establishes clearly that Josh's lies--*for the people he tells them to*--will be *plausible*, even *wanted*.  Or they'll be out for revenge at being betrayed. He will have to follow the lie out to its end--even if it means apparently killing someone.
Josh tells a series of lies that leads to that event--after that, the escape.
<>
Now, I've said that Josh's lies will be believed. What if they would be *real*? What sort of a story would we have then? We'd have a story line that goes back to Midas and underlies any number of horror stories: What you *say* (want, ask for, etc.) becomes *real*--the protagonist calls the demon into being and must thereupon destroy it or be destroyed. JOSH AND S.A.M. is a non-magical, utterly "realistic" working out of the same idea.
*That* strikes me as the root premise of JOSH AND S.A.M.. If you're willing to accept that premise, JOSH AND S.A.M. can be a romp or an adventure, but the events of the story do *not* thereafter require any great suspension of disbelief.
The premise itself doesn't seem to be that strange. It's starkly simple. It's a traditional staple of literature dealing with the supernatural. What's so wrong with giving a perfectly naturalistic interpretation? It's been used in comedy. And haven't we seen small cases like it in real life?
Of course, maybe we'd rather not think too closely about what it would be like if everything we *said* were believed or actually came true!
<>
But conceding the premise can do more than simply allow us to enjoy a romp or and adventure. It also opens up a further layer of meaning. Josh has to deal with the consequences of his words. And his habit of casual lying can no longer be casual. Now, even if *must* lie, he has to realize that his words have consequences. It's no longer a game.
When Sam buys into the S.A.M. lie so completely, Josh realizes how cruel he's been--to someone who has never done anything to him. Josh has to face the fact that Sam is a nice sweet kid that he's been jealous of because Sam can do things that he finds next to impossible.
The movie, then, is to some extent more about Josh than Sam because Josh created the lies, and must work them out. Sam's working out of the lies is his own journey, too, but it's also under Josh's tutelage. (I would like to write something strictly from Sam's perspective, but, let's face it, this review is already *huge*!)
<>
Seeing JOSH AND S.A.M. as a morality play eases one criticism that some have made. The hitch-hiker--Alison--has been seen as a possible romantic interest for Josh. But nothing is made of it. Why is her character given short shrift?
Well, first, Josh is *12*! Alison, is *at least* 20-something, and has had a *lot* of hard time. She's far from bonkers, but she's not totally with us when she shows up, and it's dealing with Josh and Sam that brings her closer to reality.
If this were a simple coming-of-age flick, then, yes, she'd be important for the possible romantic interest, even as "the older woman". But if it's *not*, if it's really Josh's dealing with the demons he's called into being, then her role is radically different--and probably parallel to Josh's.
Sorry, going further would take up too much space--and go right into spoiler territory.
<<*My* one real criticism>>
So, did I like absolutely *everything*?
I had one disappointment: The scene where Josh's lies produce the mistaken/fake identity. This was the one place where I think JOSH AND S.A.M. was trying for stock comedy.
The comic scene reminded me of "I Love Lucy" shows where Lucy was digging herself in deeper. Now, I happen to know that lots and lots of people think such scenes are funny. When I watched "Lucy" as a kid, they drove me up a wall. I'd cover my ears and scratch my head until the scene was over. (Hey--no remote control--no mute!) Very little got through the noise. Just enough so I'd know it was safe to listen again.
Sorry, gang, I *still* can't stand that form of humor.
<>
It's embarrassing, but I've been so wrapped up in the story that I haven't mentioned the actors. In that regard, I get the impression that I can safely refer you to practically anybody for an opinion. People may criticize the film, but the acting seems totally beyond criticism. Tierney and Fleiss are simply excellent.
The thing that sort of shocked me was that I felt they were *real kids*! Somehow, actors always look like actors to me. Maybe it's just a pervasive air of unreality to all movies. I just don't think I'll meet the people on the screen when I go outside the theater.
With Tierney and Fleiss, it was like two kids from outside had somehow gotten on screen. The acting doesn't come across as acting: they just do things, and it happens to be on screen. I never once got the idea that one of them was going too far or not far enough; there weren't any wrong notes. I wasn't watching either one of them play a role; I was just seeing them in situations. How much of that is their own talent, how much is the result of careful cultivation by the director (Billy Weber), I don't know. But it was there.
It might well be that their unstoppable realism nullified any hesitations I might have had about the story's reality.
<>
So, where does all this leave us? Well, note what I said about "Lucy."  It would be fascinating to figure out why. (I once saw an article that cheerfully posited "Lucy" and "Gilligan's Island" as symbolizing the great social/cultural divide of contemporary history. I think I agree.)
Regardless of the explanation or lack thereof, our preferences are a fact. Some will just not be able to get into the basic premise(s) of JOSH AND S.A.M.. The question is the one I indicated at the very beginning: *Can you park virtually every expectation at the door?*
If you can't, you may very well hit a wall. But if you *can*, I think JOSH AND S.A.M. will pay off. This is one film where our expectations, our demand for something to fit into preconceived niches, is the real objection. JOSH AND S.A.M. doesn't just break a niche or two, it obliterates them. It creates it own, and gives you multiple layers to explore.
See it! And don't forget the hot dogs!
By the way, I concur with Rosenbaum's pizza advisory in the Guide:
> Before or after the movie don't forget to go out and get a > 1/2 Pepperoni > 1/2 Pineapple pizza and be sure to eat it outside. > with root beers. > Preferably after the movie so you can reminisce.
a) Ya gotta have someone to talk it over with. And b) even if the theater management doesn't object, pizza is a mess to eat in the dark!
<<"Parental advisory" with something of a spoiler>>
an ending spoiler, more or less
I wonder whether some of you may be thinking that this is *not* the thing young minds should be exposed to.  They heist a car, pick up a babe, and make for the border. Since you've probably assumed (correctly) that it has a happy ending, that means that Josh gets off scot-free.
Yeah, just what we want kids to think! (Insert irony symbol.)
Well, we don't know he gets off absolutely scot-free. But it's the most plausible explanation.
But when you see it as a morality tale, then it all fits. The only way he realizes how down his brother is, is by seeing him buy what started out as just one of his snotty tricks. *Then* he sees that they're cruel, and not just wiseguy stuff.
Further, the whole journey becomes one of Josh's trying to get Sam *out* of the lie. He can't let Sam go on alone. Nothing else counts. Moreover, he comes to realize that his lies can't just be withdrawn. "I'm sorry" doesn't cut it. He has to face the fact that he put Sam in the lie, and he has to go in and get him out. That's his first task. His own safety comes second. (Note that the reason he's really in jeopardy is because he had to protect Sam from getting hit by the drunk.) All the other lies are beasts/demons that must be defeated on their own turf, not just disappeared by admitting he lied.
None of this is laid on with a trowel. There's no card at the end giving the moral of the tale. The moral (or morals) is (or are) there nonetheless, sometimes explicitly (as when Josh tells Sam about forgiveness), sometimes implicitly (as when the lies turn out to mean more to others than they mean to him).
Admittedly, a little preaching might be better for younger kids. But it would be a turn-off for almost everyone else. But with this review in hand, you at least have fuel for a little discussion of your own.
True, there's always the chance you'll notice your 12-year-old going over road maps and casting lusting eyes on the family conveyance. If so, the only thing I can say is that he was probably doing so beforehand. Now, (since presumably you, too, will have seen the movie) you will at least be alert to the warning signs!
John Walker<EMAIL_ADDRESS>.
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


Motorcyclist, 25, in critical condition following McCully Street crash
by HNN StaffHONOLULU, Hawaii (HawaiiNewsNow) -Honolulu police believe speed was a factor in an overnight crash that left a motorcyclist in critical condition.
The crash took place around 12:05 a.m. Saturday morning.
Police say a 64-year-old man was heading south on McCully Street when he attempted to turn left onto Citron.
As he was turning, a 25-year-old motorcyclist heading north on McCully at a high rate of speed slammed into the man’s vehicle. The 25-year-old was ejected from the bike.
HPD says the motorcyclist was not wearing a helmet at the time of the crash. He was taken to a hospital in critical condition.
The man behind the wheel was not injured.
“At this time, speed appears to be a contributing factor to this collision. It is unknown at this time if drugs or alcohol were contributing factors to this collision,” HPD said.
This story may be updated.
Copyright 2019 Hawaii News Now. All rights reserved.


pgcli
Pgcli is a command line interface for Postgres with auto-completion and syntax highlighting.
Source: https://github.com/amjith/pgcli
Quick Start
If you already know how to install python pacakges, then you can simply do:
$ pip install pgcli
If you're having trouble with the quick start, check the install page for detailed instructions.
Usage
$ pgcli --help [21:54:33] Usage: pgcli [OPTIONS] DATABASE Options: -h, --host TEXT Host address of the postgres database. -p, --port INTEGER Port number at which the postgres instance is listening. -U, --user TEXT User name to connect to the postgres database. -W, --password Force password prompt. --help Show this message and exit.
Examples
$ pgcli local_database $ pgcli postgres://amjith:passw0rd@example.com:5432/app_db $ pgcli -h localhost -p 5432 -U amjith app_db
Request
If you know how to build a brew formula for Python packages, please get in touch.


John Moon
2238 Barton Lane Apt.4, Montrose, CA 91020 |
(818) 486 5979 |<EMAIL_ADDRESS>Education
University of California, Irvine (in progress, expected completion June 2018)
B.S. in Computer Science
Specialization: Intelligent Systems &
Networked Systems
Work Experience
Phenomenex June
2015 - Present
Software Developer Torrance, CA
www.phenomenex.com
Assisted in the transition from an in-house
Customer Relation System to Microsofts Dynamic
Customer Relation System. Created worker roles on virtual machines with C# to
sync all orders made on the website [website uses NoSQL
Microsoft Azure Table Storage] to the new Microsoft CRM system. It was crucial
that all data was synced correctly because online orders represent
approximately 25% of Phenomenexs Gross Sales.
www.neoteryx.com
Lead developer on website, www.neoteryx.com. Used
Microsoft Visual studio with .Net MVC 4 framework, non-relational database Microsoft
Azure Table Storage, C# for backend development, and front-end libraries/frameworks
such as bootstrap, JQuery, and angularJS.
Worked closely with marketing team and graphic designer to review, maintain,
and develop the website.
www.phenova.com
Assisted in front-end and back-end bug fixes. Debugged
logic errors to fix data corruption and optimized users loading speeds of large
CSV files available for download on the website.
Private Tutor September 2011 - June 2015
Self-Employed La Canada, CA
Established a local tutoring client base in La
Canada. Provided private tutoring services to two middle school students and
six high school students in various levels of Math (Pre-Algebra through
Calculus).
Torres Construction May 2014 - August 2014
Administrative Assistant Glendale, CA
Screened phone calls; opened the office in the
morning and closed at nights; filed and organized documents for the HR and
Accounting department. Drove the company car to pick up checks from clients. Learned
to use office equipment such as postage meter, scanner, printer, and fax
machine.
California Offset Printers September 2011 - June 2013
Bindery Department Glendale, CA
Responsible for keeping work area clean,
inspecting magazines to ensure the quality is ready for distribution, and
binding the magazines to be packaged and shipped on time. Learned how to
operate heavy machinery such as forklifts, paper shredders, and paper cutters.
Occasionally drove to the local gas station to pick up diesel fuel for heavy
machinery.
Skills
Computer: C#, .Net, Microsoft Dynamic CRM,
Microsoft SQL, Microsfot Azure Table Storage, C++,
Python, Java, JavaScript, JQuery, HTML, CSS,
Bootstrap, NodeJS, Express, MongoDB,
AngularJS, Excel, and TFS.
Languages: Korean, Spanish
Awards and Recognition
Scholarships
Center Bank Merit Scholarship
December
2010
Deans Honor List
Pasadena City College Deans Honor List
September
2012 - June 2015


The <blink> Element
The <blink> element is deprecated. To attain blinking effect you should use CSS or JavaScript.


| Top |
Functions
| NcmNNLS * | ncm_nnls_new () |
| NcmNNLS * | ncm_nnls_ref () |
| void | ncm_nnls_free () |
| void | ncm_nnls_clear () |
| void | ncm_nnls_set_umethod () |
| NcmNNLSUMethod | ncm_nnls_get_umethod () |
| void | ncm_nnls_set_reltol () |
| gdouble | ncm_nnls_get_reltol () |
| guint | ncm_nnls_get_nrows () |
| guint | ncm_nnls_get_ncols () |
| gdouble | ncm_nnls_solve () |
| gdouble | ncm_nnls_solve_LH () |
| gdouble | ncm_nnls_solve_lowrankqp () |
| gdouble | ncm_nnls_solve_splx () |
| gdouble | ncm_nnls_solve_gsmo () |
| NcmVector * | ncm_nnls_get_residuals () |
Functions
ncm_nnls_clear ()
void
ncm_nnls_clear (NcmNNLS **nnls
);
Decrease the reference count of nnls
by one, and sets the pointer *nnls
to
NULL.
ncm_nnls_set_umethod ()
void ncm_nnls_set_umethod (NcmNNLS *nnls
,NcmNNLSUMethod umethod
);
Sets which unconstrained least-squares method to use.
ncm_nnls_get_umethod ()
NcmNNLSUMethod
ncm_nnls_get_umethod (NcmNNLS *nnls
);
Gets the unconstrained least-squares method being used.
ncm_nnls_set_reltol ()
void ncm_nnls_set_reltol (NcmNNLS *nnls
,const gdouble reltol
);
Sets relative tolerance to reltol
.
ncm_nnls_get_reltol ()
gdouble
ncm_nnls_get_reltol (NcmNNLS *nnls
);
Gets the relative tolerance being used.
ncm_nnls_solve ()
gdouble ncm_nnls_solve (NcmNNLS *nnls
,NcmMatrix *A
,NcmVector *x
,NcmVector *f
);
Solves the system $A\vec{x} = \vec{f}$ for $\vec{x}$ imposing the non negativity constraint on $\vec{x}$, i.e., $\vec{x} > 0$.
ncm_nnls_solve_LH ()
gdouble ncm_nnls_solve_LH (NcmNNLS *nnls
,NcmMatrix *A
,NcmVector *x
,NcmVector *f
);
Solves the system $A\vec{x} = \vec{f}$ for $\vec{x}$ imposing the non negativity constraint on $\vec{x}$, i.e., $\vec{x} > 0$. This method solves the system using the original code by Charles L. Lawson and Richard J. Hanson translated to C using f2c.
ncm_nnls_solve_lowrankqp ()
gdouble ncm_nnls_solve_lowrankqp (NcmNNLS *nnls
,NcmMatrix *A
,NcmVector *x
,NcmVector *f
);
Solves the system $A\vec{x} = \vec{f}$ for $\vec{x}$ imposing the non negativity constraint on $\vec{x}$, i.e., $\vec{x} > 0$. This method solves the system using the LowRankQP quadratic programming code.
ncm_nnls_solve_splx ()
gdouble ncm_nnls_solve_splx (NcmNNLS *nnls
,NcmMatrix *A
,NcmVector *x
,NcmVector *f
);
Solves the system $A\vec{x} = \vec{f}$ for $\vec{x}$ imposing the non negativity constraint on $\vec{x}$, i.e., $\vec{x} > 0$. This method solves the system using function libqp_splx_solver from libqp.
ncm_nnls_solve_gsmo ()
gdouble ncm_nnls_solve_gsmo (NcmNNLS *nnls
,NcmMatrix *A
,NcmVector *x
,NcmVector *f
);
ncm_nnls_get_residuals ()
NcmVector *
ncm_nnls_get_residuals (NcmNNLS *nnls
);
Gets the solution residuals, this method return the last residuals
computed during ncm_nnls_solve()
. If ncm_nnls_solve()
was not
called the return is undefined.
Types and Values
enum NcmNNLSUMethod
Method used to solve the intermediate unconstrained least-squares.
Property Details
The “ncols”
property
“ncols” guint
Number of cols.
Owner: NcmNNLS
Flags: Read / Write / Construct Only
Allowed values: >= 1
Default value: 1
The “nrows”
property
“nrows” guint
Number of rows.
Owner: NcmNNLS
Flags: Read / Write / Construct Only
Allowed values: >= 1
Default value: 1
The “reltol”
property
“reltol” double
Relative tolerance.
Owner: NcmNNLS
Flags: Read / Write / Construct
Allowed values: [G_MINDOUBLE,0.1]
Default value: 2.22045e-16
The “umethod”
property
“umethod” NcmNNLSUMethod
Unconstrained method.
Owner: NcmNNLS
Flags: Read / Write / Construct
Default value: NCM_NNLS_UMETHOD_NORMAL


| trajectory {pomp} | R Documentation |
Compute trajectories of the deterministic skeleton of a Markov process.
## S4 method for signature 'missing'
trajectory(
t0,
times,
params,
skeleton,
rinit,
...,
ode_control = list(),
format = c("pomps", "array", "data.frame"),
verbose = getOption("verbose", FALSE)
)
## S4 method for signature 'data.frame'
trajectory(
object,
...,
t0,
times,
params,
skeleton,
rinit,
ode_control = list(),
format = c("pomps", "array", "data.frame"),
verbose = getOption("verbose", FALSE)
)
## S4 method for signature 'pomp'
trajectory(
object,
params,
...,
skeleton,
rinit,
ode_control = list(),
format = c("pomps", "array", "data.frame"),
verbose = getOption("verbose", FALSE)
)
## S4 method for signature 'traj_match_objfun'
trajectory(object, ..., verbose = getOption("verbose", FALSE))
t0 |
The zero-time, i.e., the time of the initial state.
This must be no later than the time of the first observation, i.e., |
times |
the sequence of observation times.
|
params |
optional; named numeric vector of parameters.
This will be coerced internally to storage mode |
skeleton |
optional; the deterministic skeleton of the unobserved state process.
Depending on whether the model operates in continuous or discrete time, this is either a vectorfield or a map.
Accordingly, this is supplied using either the |
rinit |
simulator of the initial-state distribution.
This can be furnished either as a C snippet, an R function, or the name of a pre-compiled native routine available in a dynamically loaded library.
Setting |
... |
additional arguments supply new or modify existing model characteristics or components.
See When named arguments not recognized by |
ode_control |
optional list;
the elements of this list will be passed to |
format |
the format in which to return the results.
|
verbose |
logical; if |
object |
optional; if present, it should be a data frame or a ‘pomp’ object. |
In the case of a discrete-time system, the deterministic skeleton is a map and a trajectory is obtained by iterating the map.
In the case of a continuous-time system, the deterministic skeleton is a vector-field;
trajectory
uses the numerical solvers in deSolve to integrate the vectorfield.
The format
option controls the nature of the return value of trajectory
.
See above for details.
More on pomp elementary algorithms:
elementary_algorithms
,
kalman
,
pfilter()
,
pomp-package
,
probe()
,
simulate()
,
spect()
,
wpfilter()
More on methods for deterministic process models:
flow()
,
skeleton_spec
,
skeleton()
,
traj_match
## The basic components needed to compute trajectories
## of a deterministic dynamical system are
## rinit and skeleton.
## The following specifies these for a simple continuous-time
## model: dx/dt = r (1+e cos(t)) x
trajectory(
t0 = 0, times = seq(1,30,by=0.1),
rinit = function (x0, ...) {
c(x = x0)
},
skeleton = vectorfield(
function (r, e, t, x, ...) {
c(x=r*(1+e*cos(t))*x)
}
),
params = c(r=1,e=3,x0=1)
) -> po
plot(po,log='y')
## In the case of a discrete-time skeleton,
## we use the 'map' function. For example,
## the following computes a trajectory from
## the dynamical system with skeleton
## x -> x exp(r sin(omega t)).
trajectory(
t0 = 0, times=seq(1,100),
rinit = function (x0, ...) {
c(x = x0)
},
skeleton = map(
function (r, t, x, omega, ...) {
c(x=x*exp(r*sin(omega*t)))
},
delta.t=1
),
params = c(r=1,x0=1,omega=4)
) -> po
plot(po)
# takes too long for R CMD check
## generate a bifurcation diagram for the Ricker map
p <- parmat(coef(ricker()),nrep=500)
p["r",] <- exp(seq(from=1.5,to=4,length=500))
trajectory(
ricker(),
times=seq(from=1000,to=2000,by=1),
params=p,
format="array"
) -> x
matplot(p["r",],x["N",,],pch='.',col='black',
xlab=expression(log(r)),ylab="N",log='x')


Preparation time
less than 30 mins
Cooking time
1 to 2 hours
Serves
Serves 4-6
Dietary
If you like the combination of chocolate and orange then this is the pudding for you. The clementines are festive enough to make this an alternative to Christmas pudding.
For the sponge, butter a 1.2 litre/2 pint heatproof bowl.
Carefully cut the skin off the clementines and cut the flesh into thick slices.
Lay the clementine slices in the buttered bowl – with one in the centre then five around it, repeating all the way up the side of the bowl.
Place the butter, sugar, eggs, flour, cocoa, baking powder and pinch of salt into a bowl and whisk until light and fluffy. Spoon carefully into the clementine-lined bowl.
Lay a sheet of greaseproof paper onto a sheet of foil, then fold a pleat down the middle. Place on top of the pudding bowl and secure with string. Take a long piece of foil and fold to make a long strip which will form a handle. Place the foil strip under the bowl and wrap over the top.
Place an upside down saucer or small plate on a cloth into the bottom of a large saucepan and fill half way up with water.
Place the foil-covered bowl into the saucepan. Cover with a lid and bring to a boil, then reduce the heat and simmer for 1½-2 hours.
For the sauce, heat a sauté pan or large frying pan until hot. Add the caster sugar and vanilla seeds and heat until the sugar has melted and formed a light golden-brown caramel.
Add the orange liqueur and flambé by carefully tipping the pan towards the flame or lighting with cooks’ matches. Add the orange juice and clementine juice and cook for 2-3 minutes, or until it all comes together into a thin sauce.
Add the butter and swirl to combine and thicken.
To serve, lift the pudding from the saucepan using the foil strip to help you. Discard the foil and baking parchment.
Place a plate on top and turn over, tipping the pudding onto the plate.
Pour the sauce over the top, spoon some crème fraîche over and then dig in!


/*
* Copyright (c) 2018, WSO2 Inc. (http://www.wso2.org) All Rights Reserved.
*
* WSO2 Inc. licenses this file to you under the Apache License,
* Version 2.0 (the "License"); you may not use this file except
* in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*/
import Constants from "../constants";
import moment from "moment";
class QueryUtils {
static YEARS = "years";
static MONTHS = "months";
static DAYS = "days";
static HOURS = "hours";
static MINUTES = "minutes";
static SECONDS = "seconds";
static TIME_GRANULARITY_MINIMUM_VALUE = 2;
/**
* Parse a time query string.
*
* @param {string} query Query string
* @returns {moment.Moment} The time referred to by the time query
*/
static parseTime = (query) => {
let time = moment(query, Constants.Pattern.DATE_TIME, true);
if (new RegExp(Constants.Pattern.Query.RELATIVE_TIME, "i").test(query)) {
const timeRegex = new RegExp(Constants.Pattern.Query.TIME, "gi");
// Finding the matching times
const matches = [];
let matchResult;
while ((matchResult = timeRegex.exec(query))) {
matches.push({
amount: matchResult[1],
unit: matchResult[2]
});
}
// Calculating the proper time based on the query
time = moment();
for (let i = 0; i < matches.length; i++) {
const match = matches[i];
const amount = match.amount;
const unit = match.unit.toLowerCase();
time = time.subtract(amount, (unit.endsWith("s") ? unit : `${unit}s`));
}
} else if (time.format() === "Invalid date") {
throw Error("Invalid time");
}
return time;
};
/**
* Returns suitable granularity for the provided time range.
*
* @param {moment.Moment} fromTime The time from which the query considers
* @param {moment.Moment} toTime The time till which the query considers
* @returns {string} The granularity to be used
*/
static getTimeGranularity = (fromTime, toTime) => {
let timeGranularity;
if (toTime.diff(fromTime, QueryUtils.YEARS) > QueryUtils.TIME_GRANULARITY_MINIMUM_VALUE) {
timeGranularity = QueryUtils.YEARS;
} else if (toTime.diff(fromTime, QueryUtils.MONTHS) > QueryUtils.TIME_GRANULARITY_MINIMUM_VALUE) {
timeGranularity = QueryUtils.MONTHS;
} else if (toTime.diff(fromTime, QueryUtils.DAYS) > QueryUtils.TIME_GRANULARITY_MINIMUM_VALUE) {
timeGranularity = QueryUtils.DAYS;
} else if (toTime.diff(fromTime, QueryUtils.HOURS) > QueryUtils.TIME_GRANULARITY_MINIMUM_VALUE) {
timeGranularity = QueryUtils.HOURS;
} else if (toTime.diff(fromTime, QueryUtils.MINUTES) > QueryUtils.TIME_GRANULARITY_MINIMUM_VALUE) {
timeGranularity = QueryUtils.MINUTES;
} else {
timeGranularity = QueryUtils.SECONDS;
}
return timeGranularity;
};
}
export default QueryUtils;
|


The senator who is the deputy chief whip of the upper legislative chamber made this known in a statement released on Sunday, November 24.
According to the statement, the lawmaker, who is representing Niger North senatorial district, said the bill will be modified to reflect the views and wishes of Nigerians before it is passed into law.
Abdullahi also reportedly expressed the willingness of the Senate to accept contributions by critics and supporters of the bill.
He added that such contributions will help in shaping the bill to ensure it effectively puts a stop to the disturbing trend of hate speech when it becomes law.
Abdullahi said hate speech has led to the death of many and is a major factor behind depression and suicide in Nigeria.
"We have followed closely arguments for and against the hate speech bill, and seen the reason why some kicked against it.
“Given the high respect which we have for Nigerians, we will make amendment to the death penalty aspect that most Nigerians objected to, so that a bill that meets their expectations is passed into law.
"Clearly from the conversations, Nigerians agree that we have a problem in the society today as a result of hate speech which has fueled so many killings and violence, and is responsible for cases of depression and suicides,” said.
Citing a World Health Organization report, Abdullahi claimed Nigeria which is the seventh-largest country in the world “has Africa’s highest rate of depression and ranks fifth in the world frequency of suicide.”
He explained that the Independent National Commission for the Prohibition of Hate Speech to be established will guard against every act of discrimination against Nigerians by way of victimization.
"The overall concern is to curb violence and unnecessary loss of lives and livelihoods of Nigerians due to hate-induced violence,” he said.
PAY ATTENTION: Get the Latest Nigerian News Anywhere 24/7. Spend less on the Internet!
Earlier, Legit.ng reported that the leadership of the Nigerian Senate disowned the controversial hate speech bill which has passed first reading.
According to the Senate, the bill was solely being sponsored by the deputy chief whip, Senator Abdullahi, based on his conviction.
Senator Godiya Akwashiki, acting spokesperson for the red chamber, made the Senate's position known.
He told journalists in Abuja on Monday, November 18, that contrary to widespread impression, the bill was not the idea of the ninth Senate.
NAIJ.com (naija.ng) - Legit.ng. We have upgraded to serve you better.
Buhari's successor is not a pastor, he's inside Aso Rock - Prophetess| Legit TV


Default Title
Note: items will be moved back to inventory if the location is not safe to remove
Name
Location #
Safe to Remove
Remove
Remove


First Accordian Body, it will have description
Second Accordian Body, it will have description
Third Accordian Body, it will have description


jetblue
Businessmodel of JetBlue
Customer Segments
JetBlue provides air travel services to a broad range of travellers. The Company is among the largest airlines in the US by available seating, providing affordable air fares and ancillary services. JetBlue is not a solely an economy-class airline, and as such attracts customers from spectrum of consumer segments. The Company primarily serves solo and group travellers, families, and business professionals.
JetBlue provides bespoke travel services to corporate customers through its Blue Inc service, covering the management of flight, hotel and car bookings for small and medium-sized companies across multiple sectors. Until recently, JetBlue also offered cargo and freight services. These offerings, however, were discontinued in 2015.
JetBlue primarily serves customers in the US, where it offers connections between numerous major cities. It also serves customers across parts of Central and Latin America, and the Caribbean, providing services between the US and destinations such as Bogota, Quito, Mexico City, Nassau and Aruba.
Value Propositions
JetBlue provides value to its customers in the following ways:
- Its affordable air fares, with the Company providing national and short-haul international air travel to consumers at low-cost prices;
- Its provision of full-service corporate travel, with the Company providing flight, hotel and transportation booking services to corporate travels as one-stop shop solution for small and medium-sized businesses;
- Its range of on-board services, with the Company offering food and entertainment services to passengers, including television, radio, movies and on-board Wi-Fi connectivity; and
- Its frequent flyer reward program, with the Company offering various benefits, discounts and rewards for frequent travel in collaboration with a range of commercial partners. Channels
JetBlue operates a website at www.jetblue.com, through which it provides information on its activities, destination network and schedules. This website hosts the Company’s online booking portal, which serves as its primary, preferred, and lowest cost distribution channel to customers. JetBlue also operates an online store, ShopBlue, hosted at www.shopjetblue.com, through which customers can by JetBlue merchandise and travel accessories.
Additionally, JetBlue participates in a number of global distribution systems – including Amadeus and Travelport – and collaborates with online travel agents to broaden its sales network. The Company also operates an affiliate marketing program, through which participating websites and businesses drive traffic and sales through the JetBlue portal, in return for commissions on sales generated.
JetBlue also provides services through a network of kiosks and self-service terminals, located principally at airports.
Customer Relationships
JetBlue air fares are principally available to customers on a self-service basis, with passengers able to make flight reservations, as well as organise car rental and hotel services, through the Company’s online booking portal. These self-service reservations require no interaction with members of the JetBlue sales team and can be completed autonomously in minutes.
JetBlue provides a more personalised service to customers through its direct sales team, which can be contacted over the phone or through the Company’s in-airport kiosks. The Company often deals directly with corporate customers in order to provide a tailored service that accurately fulfils their requirements.
JetBlue provides reservation support to its customers over the phone and via email, handling refunds and alternative travel arrangements in the event of flight cancellations. The Company also makes a range of FAQs and guides available to customers through its website.
Customers can interact directly with JetBlue through its social media accounts with Facebook, Twitter, YouTube, and Instagram.
Key Activities
JetBlue is a passenger airline carrier. It provides air transportation services across more than 100 destinations in the US, the Caribbean and Latin and Central America, including in Mexico, Colombia, the Bahamas, and Ecuador. It operates a varied fleet of aircraft, including Airbus A321s, Airbus A320s and Embraer E190s.
The Company provides three branded fares of varying price range: Blue, Blue Plus and Blue Flex. These fares include different levels of ancillary offerings, including free checked luggage, reduced fees and extra reward scheme points.
JetBlue also provides a range of in-flight entertainment services, such as Wi-Fi and television. Customers are also able to take advantage of the Company’s intercontinental Mint service, which includes lie-flat seats, some of which come as part of a private suite.
Key Partners
Jet Blue collaborates with a network of partner to provide its customers with a quality service. These partnerships include:
- Rewards Partners, comprising a range of commercial businesses that provide products, services and discount deals as part of JetBlue’s TrueBlue rewards program;
- Airline Partners, comprising national and international commercial carriers that collaborate with the Company on flight inter-connectivity, code-sharing, coordinated flight schedules, frequent flyer program reciprocity and joint marketing schemes;
- Distribution Partners, comprising travel agents, affiliate marketers, and global distribution system operators that help to extend JetBlue’s own sales and marketing reach; and
- Alliance Partners, with which the Company participates on joint-venture projects. JetBlue partners with airlines including British Airways, Aer Lingus, Lufthansa, Korean Air, and Hawaiian Airlines, and includes MasterCard, Avis, Emirates and NRG Home among its rewards partners.
Key Resources
JetBlue’s key resources are its fleet of aircraft, its ground and support infrastructure, its sales channels and IT infrastructure, its partnerships, and its personnel.
As of 31st December 2015, JetBlue operated a fleet of 25 Airbus A321 aircraft, 130 Airbus A320 aircraft and 60 Embraer E190 aircraft. The Company also relies heavily on its supply of jet fuel.
Cost Structure
JetBlue incurs costs in relation to the acquisition and maintenance of its aircraft, the purchase and supply of consumables – notably fuel, its operation of sales and marketing programs, the maintenance of its physical infrastructure and ground support facilities, the management of its partnerships, the maintenance of its IT infrastructure, and the retention of its personnel.
JetBlue’s largest expense relates to the payment of salaries and benefits to its workforce of more than 18,000 employees, with personnel costs amounting to $1.54 billion in 2015. The acquisition of aircraft fuel is one of JetBlue’s most significant expenses, with prices and availability fluctuating due to unpredictable global economic and geopolitical factors.
In 2015 fuel costs amounted to $1.35 billion, amounting to 25.9% of the Company’s total expenses for the year. JetBlue also accrues costs in relation to the operation of its offices and facilities, in the form of rental and utility fees.
Revenue Streams
JetBlue generates revenue through the provision of passenger airlines services to consumers and professionals. This principally comprises:
- The sale of air fares and related fees;
- The sale of premium in-flight services, such as access to movie content; and
- The sale of JetBlue merchandise and travel accessories. In 2015 JetBlue generated $6.42 billion in operating revenue, an increase of $599 million on revenue recorded by the Company in 2014, due primarily to an increase in revenue from passengers and a small increase in the price of the average fare.
The vast majority of JetBlue’s revenue is generated by the Company’s sale of air fares and ancillary passenger services and products. Revenue derived from other sources amounted to just $523 million in 2015.


Camera Example
The Camera Example demonstrates how you can use Qt Multimedia to implement some basic Camera functionality to take still images and record video clips with audio.
Running the Example
To run the example from Qt Creator, open the Welcome mode and select the example from Examples. For more information, visit Building and Running an Example.
A Camera class is created that will act as our Camera. It has a user interface, control functions, setting values and a means of defining the location where the image or video clip is to be saved. It will also store the image and video settings.
The Camera class contains an instance of QCamera, the API class interface to the hardware. It also has an instance of QCameraImageCapture to take still images and an instance of QMediaRecorder to record video. It also contains the user interface object.
The Camera constructor does some basic initialization. The camera object is set to '0', the user interface is initialized and UI signal are connected to slots that react to the triggering event. However, most of the work is done when the setCamera() function is called, passing in a QByteArray.
setCamera() sets up various connections between the user interface and the functionality of the Camera class using signals and slots. It also instantiates and initializes the QCamera, QCameraImageCapture and QMediaRecorder objects mentioned above. The still and video recording visual tabs are enabled and finally the start() function of the QCamera object is called.
Now that the camera is ready for user commands it waits for a suitable event. Such an event will be the key press of either the Qt::Key_CameraFocus or Qt::Key_Camera buttons on the application window. Camera focus will simply display the viewfinder and lock the camera settings. Key_Camera will either call takeImage() if the captureMode() is QCamera::CaptureStillImage, or if the capture mode is for video then one of two actions will occur. If the recording state shows that we are currently recording then the stop() function is called resulting in a call to QCamera::stop(), whereas if we are not recording then a video recording is started with a call to QMediaRecorder::record().
Files:
- multimediawidgets/camera/camera.cpp
- multimediawidgets/camera/camera.h
- multimediawidgets/camera/camera.ui
- multimediawidgets/camera/imagesettings.cpp
- multimediawidgets/camera/imagesettings.h
- multimediawidgets/camera/imagesettings.ui
- multimediawidgets/camera/videosettings.cpp
- multimediawidgets/camera/videosettings.h
- multimediawidgets/camera/videosettings.ui
- multimediawidgets/camera/main.cpp
- multimediawidgets/camera/camera.pro


|
GOAL AREA - The central five cells of the
player's first row.
|
|
OUTSIDES - The edge cells around the
central area (the marked cells in the diagram).
|
|
MOVE - A stone
may move on the following ways:
|
Slide diagonally or orthogonally into to an
empty cell, except diagonally backward. |
|
Slide diagonally or orthogonally (with no
restrictions) into the ball. Then:
|
The ball slides in the same direction of
the previous moved stone, and must meet another stone
(friendly or foe) bouncing on it, making a 90º or 180º turn.
The pivot cell is the cell just before the bouncing stone. |
|
The ball can bounce more than one time on
several stones. |
|
It is the player that moved the ball that
decides where it ends its movement. |
|
The ball cannot move into the outside,
but it can bounce on stones that are there. |
|
|
A stone may move into the outside. |
|
A stone may move thru the opponent central
area, but is not allowed to stop there. |
|
A player cannot have more than one stone on
his goal area (they may be empty). |
|
Point - If a player moves the ball
into the opponent's goal area, it scores one point. After that
move, the stones resume the initial position and the opponent
starts moving. |
|
|
GOAL
- Wins the player to score five points. |
|


- 1976 - Born in Metairie, Louisiana, U.S.
- 1998 - Khan attended the Massachusetts Institute of Technology, graduating with Bachelor of Science degrees in mathematics, electrical engineering, and computer science, later getting his Master of Science in electrical engineering and computer science. Khan was class president in his senior year.
- 2002 - Khan was a summer intern at PARC. ,
- From 2003 to late 2009 - Khan worked as a hedge fund analyst at Connective Capital Management.
- 2003 - Khan began tutoring his cousin, Nadia, in mathematics over the internet using Yahoo!'s Doodle notepad.
- 2006 - When other relatives and friends sought his tutoring, he moved his tutorials to YouTube where he created an account.
- 2009 - The popularity of his educational videos on the video-sharing website prompted Khan to quit his job as a financial analyst
- 2011 - Salman Khan was invited to speak at TED by Bill Gates who says he uses Khan Academy Exercise Software to teach his own children.
- 2012 - Khan Academy, initially a tool for students, added the Coach, promoting the connection of teachers with students through videos and monitor tools.
I teach the way that I wish I was taught. The lectures are coming from me, an actual human being who is fascinated by the world around him.
If you have time, you should read more about this incredible human being on his Wikipedia entry, and visit Khan Academy.


What is Ivory Academy?
What is Ivory Academy? Ivory Academy is a personal project of mine. It's a test website that I use to practice my web development skills. Most web pages on this website are about learning new things, that's because I really enjoy computer science and would like to share my (limited) knowledge with others. Of course, I am still learning and I completely welcome constructive criticism!
by FrostTusk
Programming, Where to Start?
It all depends... Why do you want to learn programming?
My Projects
To see my Projects, check out my Github.