func runtime.readUnaligned32
6 uses
runtime (current package)
alg.go#L355: func readUnaligned32(p unsafe.Pointer) uint32 {
hash64.go#L34: h ^= uint64(readUnaligned32(p))
hash64.go#L35: h ^= uint64(readUnaligned32(add(p, s-4))) << 32
hash64.go#L83: v := uint64(readUnaligned32(p))
hash64.go#L95: h ^= uint64(readUnaligned32(p)) | uint64(readUnaligned32(add(p, 4)))<<32
The pages are generated with Golds v0.2.7-preview. (GOOS=darwin GOARCH=amd64)


<IP_ADDRESS>
- Upgraded to App Engine <IP_ADDRESS>
- Added ability to subscribe to points. Points can be found in the search engine and added to your account
as if they were you're points. You can then decided how you'd like to be alerted about data changes and alerts.
- You can now backup / restore your data through the admin console (for those running their own instances)


This section describes how to import XML data into Proximity using the provided ProxWebKB database as an example. Proximity lets you import a complete database, including any subgraphs and containers, or you can import individual attributes or containers.
By default, Proximity restricts the structure of the XML data
file to ensure that you cannot accidentally create identity
conflicts. For example, Proximity prohibits adding additional objects
to a database once the initial set of objects has been defined;
therefore, the XML data file can contain only a single objects section
and you cannot add more objects with a subsequent import. Similarly,
you cannot add new links or add more values to an attribute once you have
completed importing the initial set of links or attribute
values. You can override these restrictions by using the
noChecks
option to the import script, described in
“Importing XML data using noChecks
”.
|
You are responsible for ensuring the integrity of the data in an XML file. Proximity makes no checks to ensure that attributes are assigned to items (objects, links, subgraphs, or containers) that are actually present in the database. Assigning attribute values to non-existent items does not trigger an exception or warning. |
The sections below walk through the process of first importing a database and then importing values for a new attribute on the existing database objects.
The exercise below walks through the process of importing the XML version of the ProxWebKB database. ProxWebKB was developed from the WebKB relational data set [Craven et al., 1999] available from www-2.cs.cmu.edu/~WebKB/. The version used for the Proximity tutorial has been modified from the public distribution to meet the needs of this tutorial. Modifications include some data clean up and the the creation of additional object attributes based on the data in the distributed version.
Exercise 3.1. Importing the ProxWebKB data into Proximity:
Uncompress the compressed ProxWebKB XML data file.
>cd $PROX_HOME/doc/user/tutorial/examples
>gunzip proxwebkb.xml.gz
Copy the file prox3db.dtd
from
$PROX_HOME/resources
to the directory containing
the XML data file, $PROX_HOME/doc/user/tutorial/examples
.
> cp $PROX_HOME/resources/prox3db.dtd $PROX_HOME/doc/user/tutorial/examples/
Start the MonetDB server. Data files must be on the same machine as that serving the database.
> Mserver --dbname ProxWebKB $PROX_HOME/resources/init-mserver.mil
The init-mserver.mil
script sets the port
for the server to 30000. To use a different port, add
--set port=
(where nnnnn
nnnnn
is the new port number) to
the command line. For example:
> Mserver --dbname ProxWebKB $PROX_HOME/resources/init-mserver.mil \
--set port=45678
Remember to use a port number > 40000 if you are using MonetDB 4.6.2. See “Running the MonetDB database server” for more information on starting and using the MonetDB server.
Because the database does not exist, MonetDB prints warning statements along with its usual startup message:
!WARNING: GDKlockHome: created directory /usr/local/Monet-mars/var/MonetDB4/dbfarm/ProxWebKB/ !WARNING: GDKlockHome: ignoring empty or invalid .gdk_lock. !WARNING: BBPdir: initializing BBP. # MonetDB Server v4.20.0 # based on GDK v1.20.0 # Copyright (c) 1993-2007, CWI. All rights reserved. # Compiled for powerpc-apple-darwin8.10.0/32bit with 32bit OIDs; dynamically linked. # Visit http://monetdb.cwi.nl/ for further information. Listening on port 30000 MonetDB>
The startup message may be slightly different depending on your operating system and the version of MonetDB you are using.
MonetDB also creates a ProxWebKB
directory in its
dbfarm
directory to hold the new database.
Leave the MonetDB server running for the remainder of the import process. You must be serving the database for any Proximity action that interacts with database data.
Initialize the new Proximity database. (Substitute the appropriate port number if you are using a different port.)
>cd $PROX_HOME
>bin/db-util.sh localhost:30000 init-db
Proximity outputs the following trace (leading information showing elapsed time and execution thread has been omitted from the trace for brevity):
INFO app.DBUtil: * connecting to db INFO app.DBUtil: * database opened; initializing Prox tables INFO db.DB: * initializing Proximity database INFO app.DBUtil: * tables initialized INFO app.DBUtil: * disconnecting from db INFO app.DBUtil: * done
Import the XML data file into the new Proximity database. (Substitute the appropriate port number if you are using a different port.)
> bin/import-xml.sh localhost:30000 \
$PROX_HOME/doc/user/tutorial/examples/proxwebkb.xml
When the import process is finished, Proximity reports on the number of database entities created.
INFO app.ImportXMLApp: * done importing; counts: 4135 objects, 10934 links, 13 attributes, 222052 attribute values, 0 containers, 0 subgraph items


Crockfordizing the web one page at a time
Drag the following link to your bookmarks bar or click it to try it out:
Crockfordize
.


Directory used for the tutorials:
cd /home/training/ngs_course/association
In this practical we are going to use a tool called RvTests. Let’s see how to run it:
rvtest --help
Test every variant individually for association with the disease/trait. The phenotype can be binary (case/control) or quantitative.
| Single variant | Model | Traits(*) | Covariates | Related / unrelated |
|---|---|---|---|---|
| Score test | score | B, Q | Y | U |
| Wald test | wald | B, Q | Y | U |
| Exact test | exact | B | N | U |
| Fam LRT | famLRT | Q | Y | R, U |
| Fam Score | famScore | Q | Y | R, U |
| Grammar-gamma | famGrammarGamma | Q | Y | R, U |
| Firth regression | firth | B | Y | U |
(*) In trait column, B and Q stand for binary, quantitate trait.
To test related individuals, you will need to first create a kinship matrix. The tool to do it is called vcf2kinship
.
vcf2kinship --help
Let’s compute the kinship matrix:
rvtests \
--inVcf 4Kvariants_147samples.vcf.gz \
--ped 4Kvariants_147samples.ped \
--ibs \
--out 4Kvariants_147samples
head -n 10 4Kvariants_147samples.kinship | cut -f 1-10
Then we can use linear mixed model based association tests such as Fast-LMM score test, Fast-LMM LRT test and Grammar-gamma tests. These models only work when the studied phenotype is quantitative.
rvtest \
--inVcf 4Kvariants_147samples.vcf.gz \
--pheno 4Kvariants_147samples.ped \
--out 4Kvariants_147samples \
--kinship 4Kvariants_147samples.kinship \
--single famScore,famLRT,famGrammarGamma
head 4Kvariants_147samples.FamScore.assoc
rvtest \
--inVcf 4Kvariants_147samples.vcf.gz \
--pheno 4Kvariants_147samples.ped \
--out 4Kvariants_147samples \
--single score,wald,exact
head 4Kvariants_147samples.SingleWald.assoc
Do we have any significant variants?
awk -F'\t' '{if ($9 <= 0.05) print $0}' 4Kvariants_147samples.SingleWald.assoc | sort -k 9
! awk -F'\t' '{if ($9 <= 0.05) print $0}' 4Kvariants_147samples.SingleScore.assoc | sort -k 9
Groupwise tests includes three major kinds of tests.
Burden tests
| Burden tests | Model | Traits | Covariates | Related / unrelated | Description |
|---|---|---|---|---|---|
| CMC | cmc | B, Q | N | U | Collapsing and combine rare variants by Bingshan Li. |
| Zeggini | zeggini | B, Q | N | U | Aggregate counts of rare variants by Morris Zeggini. |
| Madsen-Browning | mb | B | N | U | Up-weight rare variant using inverse frequency from controls by Madsen. |
| Fp | fp | B | N | U | Up-weight rare variant using inverse frequency from controls by Danyu Lin. |
| Exact CMC | exactCMC | B | N | U | Collapsing and combine rare variants, then perform Fisher’s exact test. |
| RareCover | rarecover | B | N | U | Find optimal grouping unit for rare variant tests by Thomas Hoffman. |
| CMAT | cmat | B | N | U | Test non-coding variants by Matt Z. |
| CMC Wald | cmcWald | B, Q | N | U | Collapsing and combine rare variants, then perform Wald test. |
Variable threshold models
| Single variant | Model | Traits | Covariates | Related / unrelated | Description |
|---|---|---|---|---|---|
| Variable threshold model | vt | B, Q | N | U | Every rare-variant frequency cutoffs are tests by Alkes Price. |
| Variable threshold CMC | cmc | B, Q | N | U | This models is native so that it output CMC test statistics under all possible frequency cutoffs. |
Kernel models
| Kernel | Model | Traits | Covariates | Related / unrelated | Description |
|---|---|---|---|---|---|
| SKAT | skat | B, Q | Y | U | Sequencing kernel association test by Shawn Lee. |
| KBAC | kbac | B | N | U | Kernel-based adaptive clustering model by Dajiang Liu. |
All above tests requires to group variants into a unit. The simplest case is to use gene as grouping unit.
RvTests expects a refFlat file when using gene grouping units.


The datetime picker component is an opinionated composition of the fd-popover, fd-calendar and fd-time components to
accomplish the UI pattern for picking a date and time.
The datetime picker supports the same keyboard navigability as the calendar and time components. The popover can be
opened by focusing the
datetime picker input field and closed by focusing the icon button followed by pressing enter or space.
Fully compatible with Angular forms.
<fd-datetime-picker>
Simple Datetime Picker
The simplest form of the datetime picker. It makes use of ngModel to bind to the desired value.
The alternative is to use the date input combined with the dateChange output.
Non-Meridian Datetime Picker
Removing the am/pm from the time component. The string representation may or may not conserve it depending on locality.
Programmatic Change
It is possible to programmatically change the value of the date of the datetime picker and still conserve full functionality.


Bedroom: {{ house.bedroom }}
Bathroom: {{ house.bathroom }}
Balcony: {{ house.balcony }}
{{ house.created_at | date }}
Living area: {{ house.living_area }} sq-ft
Address: {{ house.address }}
Rent: {{ house.rent }} Tk
For: {{ house.ad_type }}
{{house.house_category}}


--- layout: post status: publish published: true title: Indian people phone directory author: display_name: vishvendra login: vishvendra email<EMAIL_ADDRESS>url: '' author_login: vishvendra author_email<EMAIL_ADDRESS>wordpress_id: 365 wordpress_url: http://vishvendrasingh.com/?p=365 date: '2016-10-20 18:20:30 +0530' date_gmt: '2016-10-20 18:20:30 +0530' categories: - Projects tags: [] comments: [] ---
232326-contact numbers are made availabe on shivalink.com with improved searching functionality. Will be increasing weekly enjoy and keep searching


Family recipes the secret of Bali's famous nasi campur warung
by Kiki SiregarSEMINYAK, Bali: Each plate of nasi campur is a meticulous art. A warm heap of fluffy white rice takes centre stage, surrounded by small portions of side dishes arranged in a neat and tight circle.
Vegetable curry, spinach, tempeh, cucumber, beef rendang, prawns and tofu are among the choices ordinarily available for this Balinese dish.
It is often accompanied by sate lilit, minced fish with grated coconut wrapped around a lemongrass stalk.
At Made’s Warung, nasi campur has been its crowd-puller for the last five decades, attracting not just the travellers but also dignitaries the likes of Indonesian President Joko Widodo.
Its secrets for thriving amid the fierce competition in Bali? Original recipes tried and tested over the years, revealed Mdm Nyoman Reniathi, the senior chef.
“Also, we use chicken powder as seasoning, unlike some others who rely on artificial food additives,” said the 61-year-old who has been with Made’s Warung for 43 years.
From its humble beginning as a small food stall, Made’s Warung has grown into a successful establishment with four outlets in Bali and one in the Netherlands.
It has become one of the must-visit eateries on the island of gods, winning over the foreign visitors with authentic Balinese flavours.
READ: Czech couple pray in cleansing ritual after Bali temple antics
FAMILY-RUN BUSINESS
Made’s Warung is named after its owner Mdm Made Masih.
Her younger sister Mdm Nyoman Sadihasih said the eatery was first established in 1969 by their parents in Bali’s now-famous touristy area Kuta, which back then was still a little fishing village.
The restaurant was originally a warung – a small food stall – which only sold Balinese snacks and gado-gado, an Indonesian salad served with peanut sauce dressing.
“Over time foreigners started to come to Bali. Hippies, people with long hair. They often visited our stall,” Mdm Sadihasih, 62, told CNA.
Their parents were poor back then and could not afford to hire staff, so everyone in the family had to help out at the warung.
But it was Mdm Masih, the second of five siblings, who was especially involved in the operations, until tourists started calling the food stall “Made’s Warung”.
It was also here Mdm Masih met the love of her life, a Dutch businessman who regularly visited the food stall.
The food stall grew bigger and the family expanded the business to other parts of Bali - Seminyak, currently the biggest branch, Canggu and Bali’s airport - and Amsterdam.
Another outlet will be opened in the Indonesian capital of Jakarta by the end of this year.
While Mdm Masih takes a back seat these days, Made’s Warung remains a family business.
Mdm Sadihasih takes care of everything, assisted by the other siblings, their children, as well as loyal staff.
She is the quality controller ensuring consistency of taste in all outlets. All chefs have to be trained by the family, including the new chef for the Jakarta outlet.
READ: From food to household appliances, Indonesia’s new law on halal certification a boost for Islamic economy
THE FAMOUS NASI CAMPUR
Over the years, the menu at Made’s Warung evolved from traditional Balinese food to include other Indonesian and Western delights, based on requests from tourists.
But nasi campur, priced at 95,000 rupiah (US$6.80), has remained the star of the show.
What sets this Balinese version of nasi campur apart from their counterparts in other corners of Indonesia is the spices used.
While nasi campur is often served with babi guling (spit-roasted pig) in Hindu-majority Bali, here at Made’s Warung, it also comes with Balinese ayam betutu (roasted chicken) and Balinese bebek betutu (roasted duck).
Every morning, chefs at the respective outlets will prepare the various side dishes.
The variety is a main draw, said Mdm Sadihasih. The wide selection is not only reflected in the menu, but the condiments as well.
“If someone asks for chili sauce, we have different kinds of sambal here – Balinese sambal matah, fried chili, chili shrimp paste, etc,” she counted off on her fingers.
CUSTOMERS FROM NEAR AND FAR
Photos of famous personalities dining at its restaurants lined the walls of Made's Warung in Seminyak.
Mr Widodo was here in December 2017, while former president Susilo Bambang Yudhoyono dropped by in 2007.
Celebrities such as Mick Jagger and Richard Gere had also been to Made’s Warung to have a taste of its delicacies.
“We never invited them, they just decided to eat here. Maybe they came to know us by word of mouth,” Mdm Sadihasih said.
A tourist from Jakarta, Mdm Meirina Endah Permana Dewi, 57, is a regular at Made’s Warung.
Every time she visits Bali, she makes sure she has nasi campur here.
“The presentation is beautiful. It tastes good too. It’s unique, clean, neat, so we like to eat nasi campur here,” she said.


Temperature
- Measures air temperature in Fahrenheit (°F).
- Range: -40 °F to 185 °F (-40°C to 85°C).
- A human can survive at 140°F for 10 minutes
(Source).
Hover or Press here for more information
Humidity
- Measured in Relative Humidity percentage (% RH).
- Indicates water vapor concentration (from 0% RH to 100% RH) in the air compared to the maximum amount it can hold at a specific temperature (saturated air has 100% humidity).
- When humidity is near 100% RH, water vapor condenses and forms fog near the surface (or clouds in the sky).
- When humidity is near 100% RH, water vapor condenses and forms fog near the surface (or clouds in the sky).
Hover or Press here for more information
Barometric Pressure
- Measures air pressure on Earth’s surface in Pascals (air’s force on a square meter).
- Range: 30,000Pa to 110,000Pa (Altitude Range: 0 to 30,000 ft).
- 101,325 Pa is the average pressure at sea-level and fluctuates depending on weather conditions.
- The higher altutide has lower air pressure, leading to altitude sickness due to the lack of oxygen in the air.
Hover or Press here for more information
VOCs
- Measures the amount of Volatile Organic Compounds (VOCs) in the air in parts per billion (ppb).
- Range: 0 to 32,768 parts per billion.
- VOCs are pollutants and/or sensory irritants from trees, animals, constructions,...
- Although VOCs are not used to calculate Air Quality Index, they are helpful to predict photochemical smog. .
- High levels of VOCs (tVOC over 5 ppb) can affect sensitive people (Source).Exposing to air with tVOC over 100ppb in long-term can cause nasal cancer (Source).
Hover or Press here for more information
eCO2
- Another scale to measure Volatile Organic Compounds. Mainly used to measure the greenhouse effect of VOCs compared to CO2.
- eCO2 sensing from 400 parts per million (ppm) to 29,206 ppm.
Hover or Press here for more information
Radiation
- Detection of Gamma and Beta radiation recorded in one-millionth of a sievert per hour (uSv/h). Sievert quantifies the amount of ionizing radiation absorbed by human tissues.
- Measurement range of 0.05uSv/h to 10mSv/h at 0.01 counts per minute (cpm) to 300Kcpm with a required measurement time of two minutes.
- Examples of some radiation reading of whole dosage in millisievert (uSv) (Source).
Hover or Press here for more information
Project Contributors


Joining Tribes helps you find likeminded Trustroots members.
Missing your Tribe? Send us suggestions!
Join Trustroots to find members behind Tribes.


One of the design principles of cxr
is to allow users to estimate parameters from their own models. cxr
already includes four families of well-known population dynamic models: Beverton-Holt (BH), Lotka-Volterra (LV), Ricker (RK), and Law-Watkinson (LW), all in their discrete time formulation (see the accompanying publication of cxr
for formulation of these general families). Users can choose between these default families by setting the model_family
argument to the acronym of the chosen model. In this vignette we show, step by step, how other user-defined models can be integrated in the package.
First of all, a common feature of the families included is that they rely on a common set of parameters, namely lambda
,alpha
(separated in alpha_intra
and alpha_inter
), lambda_cov
, and alpha_cov
. For now, user-defined models within cxr
must be restricted to these parameters. A detailed description of these parameters can be found in previous vignettes.
At the end of this vignette we include the full R code of a model template that can be used directly into cxr
. This template is also included as a stand-alone R file in the source files of the package (cxr_model_template.R
), and here we first explain each section of it.
First, model functions should be defined with the common set of arguments recognized by cxr
.
pm_family_alpha_form_lambdacov_form_alphacov_form <- function(par,
fitness,
neigh_intra_matrix = NULL,
neigh_inter_matrix,
covariates,
fixed_parameters)
Assuming data for \(n\) observations of a focal species and \(s\) neighbour species (including itself), the function arguments are:
the name of the function should be adapted to the parameters you want to fit:
Thus, if you code a model from your User Model (UM) family that includes pairwise alphas, but no effects of covariates over lambda or alpha, your function must be named as:
pm_UM_alpha_pairwise_lambdacov_none_alphacov_none <- function(par,
fitness,
neigh_intra_matrix = NULL,
neigh_inter_matrix,
covariates,
fixed_parameters)
The first step inside the function is to retrieve the different parameters from the one-dimensional par
vector. You should not have to change this section except for commenting or commenting out the section where parameters are retrieved. For example, if your model does not include lambda_cov
or alpha_cov
, you should comment their sections. Note that it includes a final parameter, sigma, that should always be there, as it keeps track of the error associated to the fit.
This is how this part in your ‘pm_UM_alpha_pairwise_lambdacov_none_alphacov_none’ model would look like:
# retrieve parameters -----------------------------------------------------
# parameters to fit are all in the "par" vector,
# so we need to retrieve them one by one
# order is {lambda,lambda_cov,alpha,alpha_cov,sigma}
# comment or uncomment sections for the different parameters
# depending on whether your model includes them
# note that the section on alpha_inter includes two
# possibilities, depending on whether a single alpha is
# fitted for all interactions (global) or each pairwise alpha is
# different (pairwise)
# both are commented, you need to uncomment the appropriate one
# likewise for the section on alpha_cov
# --------------------------------------------------------------------------
pos <- 1
# if a parameter is passed within the "par" vector,
# it should be NULL in the "fixed_parameters" list
# lambda
if(is.null(fixed_parameters$lambda)){
lambda <- par[pos]
pos <- pos + 1
}else{
lambda <- fixed_parameters[["lambda"]]
}
# lambda_cov
# if(is.null(fixed_parameters$lambda_cov)){
# lambda_cov <- par[pos:(pos+ncol(covariates)-1)]
# pos <- pos + ncol(covariates)
# }else{
# lambda_cov <- fixed_parameters[["lambda_cov"]]
# }
# alpha_intra
if(!is.null(neigh_intra_matrix)){
# intra
if(is.null(fixed_parameters[["alpha_intra"]])){
alpha_intra <- par[pos]
pos <- pos + 1
}else{
alpha_intra <- fixed_parameters[["alpha_intra"]]
}
}else{
alpha_intra <- NULL
}
# alpha_inter
if(is.null(fixed_parameters[["alpha_inter"]])){
# uncomment for alpha_global
# alpha_inter <- par[pos]
# pos <- pos + 1
# uncomment for alpha_pairwise
alpha_inter <- par[pos:(pos+ncol(neigh_inter_matrix)-1)]
pos <- pos + ncol(neigh_inter_matrix)
}else{
alpha_inter <- fixed_parameters[["alpha_inter"]]
}
# alpha_cov
# if(is.null(fixed_parameters$alpha_cov)){
# # uncomment for alpha_cov_global
# # alpha_cov <- par[pos:(pos+ncol(covariates)-1)]
# # pos <- pos + ncol(covariates)
#
# # uncomment for alpha_cov_pairwise
# # alpha_cov <- par[pos:(pos+(ncol(covariates)*
# # (ncol(neigh_inter_matrix)+ncol(neigh_intra_matrix)))-1)]
# # pos <- pos + (ncol(covariates)*(ncol(neigh_inter_matrix)+ncol(neigh_intra_matrix)))
# }else{
# alpha_cov <- fixed_parameters[["alpha_cov"]]
# }
# sigma - this is always necessary
sigma <- par[length(par)]
At this point, you can code your model. This is how the equivalent Beverton-Holt model looks like, for reference:
# MODEL CODE HERE ---------------------------------------------------------
# the model should return a "pred" value
# a function of lambda, alpha_intra, alpha_inter, lambda_cov, alpha_cov
# and neigh_intra_matrix, neigh_inter_matrix, and covariates
# we do not differentiate alpha_intra from alpha_inter in this model
# so, put together alpha_intra and alpha_inter, and the observations
# with intraspecific ones at the beginning
if(!is.null(alpha_intra)){
alpha <- c(alpha_intra,alpha_inter)
all_neigh_matrix <- cbind(neigh_intra_matrix,neigh_inter_matrix)
}else{
alpha <- alpha_inter
all_neigh_matrix <- neigh_inter_matrix
}
term = 1 #create the denominator term for the model
for(z in 1:ncol(all_neigh_matrix)){
term <- term + alpha[z]*all_neigh_matrix[,z]
}
pred <- lambda/ term
# MODEL CODE ENDS HERE ----------------------------------------------------
Note how there are no hard-coded checks for ensuring that alpha values and neigh_matrix values are appropriately sorted. This is performed in the cxr_pm_fit
function that internally sorts data and call this model for optimization.
The last part of the model function is returning the negative log-likelihood value for that particular parameter combination. This is the value that the numerical optimization algorithms aim to minimize. You should not change this code.
# the routine returns the sum of negative log-likelihoods of the data and model:
# DO NOT CHANGE THIS
llik <- dnorm(fitness, mean = (log(pred)), sd = (sigma), log=TRUE)
return(sum(-1*llik))
When you have a functioning model, you should be able to use it within cxr
as soon as you load your model into the global environment, which can be done simply by ‘sourcing’ your R file named with the name of your model, i.e. ‘pm_UM_alpha_pairwise_lambdacov_none_alphacov_none.R’ in our example.
Thus, for fitting a certain dataset with your custom model, you would call the cxr_pm_fit
function with the appropriate parameters:
# load your model into the global environment
source("./pm_UM_alpha_pairwise_lambdacov_none_alphacov_none.R")
# fit your data
custom_fit <- cxr_pm_fit(data = custom_data, # assuming custom_data is already set...
focal_column = my_focal, # assuming my_focal is already set...
model_family = "UM",
covariates = NULL, # as we have no covariate effects
alpha_form = "pairwise",
lambda_cov_form = "none",
alpha_cov_form = "none")
If the function cannot find a model matching the provided ‘model_family’,‘alpha_form’,‘lambda_cov_form’, and ‘alpha_cov_form’, it will output a message and return NULL. On a final note, if you think your bright new model can be useful for fellow scientists, we encourage you to make a pull request for integrating it in the set of default model families included in cxr
. An interesting update to the package would be, in addition to include other model families, to implement non-linear models of covariate effects over lambda and alpha values.
There are several issues that you should have in mind when developing custom models. First, recall that numerical optimization methods may be bounded or unbounded. If your model does not return meaningful values for part of the parameter space defined by the hypervolume of parameter boundaries, bounded optimization methods (such as ‘L-BFGS-B’ or ‘bobyqa’) will fail. This is well exemplified by the discrete Lotka-Volterra model:
\(\lambda_i - \alpha_{ii}N_i - \alpha_{ij}Nj\)
which can easily produce negative values and thus undefined log-likelihoods. The second point to note is that user-defined population dynamics models are sufficient to obtain tailored lambda and alpha values, but importantly, several MCT metrics are also model-specific.
Model-specific coexistence metrics
Among the coexistence metrics that can be calculated with cxr
, five of them are model-specific, i.e. have different formulations depending on the underlying population dynamics model from which lambda and alpha values are obtained. These are:
All these have different formulations for different model families. Therefore, if you want to estimate coexistence metrics based on custom models, you should provide a full set of formulations for these metrics. Here we show their formulation for Beverton-Holt models, for reference. The supplementary material of Godoy and Levine (2014) and that of Hart et al. (2018) are good places to explore the mathematical underpinnings of these particularities.
BH_competitive_ability <- function(lambda, pair_matrix){
if(all(pair_matrix >= 0)){
(lambda - 1)/sqrt(pair_matrix[1,1] * pair_matrix[1,2])
}else{
NA_real_
}
}
cxr_er_fit
, which is similar to cxr_pm_fit
(see vignette 1). We include at the end of this vignette the complete model template for a custom effect and response model. The formulation of the Beverton-Holt effect and response model is simplywhere each part potentially depends on neighbour densities and covariates.
Therefore, in order to compute coexistence metrics based on your custom population dynamics model, you should code your own versions of these metrics, save them with appropriate names (i.e. changing the model family acronym at the beginning of the functions), and source them in the global environment, in order for the cxr
interface to be able to find and use them.
Template for population dynamics models
pm_family_alpha_form_lambdacov_form_alphacov_form <- function(par,
fitness,
neigh_intra_matrix = NULL,
neigh_inter_matrix,
covariates,
fixed_parameters){
# retrieve parameters -----------------------------------------------------
# parameters to fit are all in the "par" vector,
# so we need to retrieve them one by one
# order is {lambda,lambda_cov,alpha_intra,alpha_inter,alpha_cov,sigma}
# comment or uncomment sections for the different parameters
# depending on whether your model includes them
# note that the section on alpha_inter includes two
# possibilities, depending on whether a single alpha is
# fitted for all interactions (global) or each pairwise alpha is
# different (pairwise)
# both are commented, you need to uncomment the appropriate one
# likewise for the section on alpha_cov
# --------------------------------------------------------------------------
pos <- 1
# if a parameter is passed within the "par" vector,
# it should be NULL in the "fixed_parameters" list
# lambda
if(is.null(fixed_parameters$lambda)){
lambda <- par[pos]
pos <- pos + 1
}else{
lambda <- fixed_parameters[["lambda"]]
}
# lambda_cov
if(is.null(fixed_parameters$lambda_cov)){
lambda_cov <- par[pos:(pos+ncol(covariates)-1)]
pos <- pos + ncol(covariates)
}else{
lambda_cov <- fixed_parameters[["lambda_cov"]]
}
# alpha_intra
if(!is.null(neigh_intra_matrix)){
# intra
if(is.null(fixed_parameters[["alpha_intra"]])){
alpha_intra <- par[pos]
pos <- pos + 1
}else{
alpha_intra <- fixed_parameters[["alpha_intra"]]
}
}else{
alpha_intra <- NULL
}
# alpha_inter
if(is.null(fixed_parameters[["alpha_inter"]])){
# uncomment for alpha_global
# alpha_inter <- par[pos]
# pos <- pos + 1
# uncomment for alpha_pairwise
# alpha_inter <- par[pos:(pos+ncol(neigh_inter_matrix)-1)]
# pos <- pos + ncol(neigh_inter_matrix)
}else{
alpha_inter <- fixed_parameters[["alpha_inter"]]
}
# alpha_cov
if(is.null(fixed_parameters$alpha_cov)){
# uncomment for alpha_cov_global
# alpha_cov <- par[pos:(pos+ncol(covariates)-1)]
# pos <- pos + ncol(covariates)
# uncomment for alpha_cov_pairwise
# alpha_cov <- par[pos:(pos+(ncol(covariates)*
# (ncol(neigh_inter_matrix)+ncol(neigh_intra_matrix)))-1)]
# pos <- pos + (ncol(covariates)*(ncol(neigh_inter_matrix)+ncol(neigh_intra_matrix)))
}else{
alpha_cov <- fixed_parameters[["alpha_cov"]]
}
# sigma - this is always necessary
sigma <- par[length(par)]
# now, parameters have appropriate values (or NULL)
# next section is where your model is coded
# MODEL CODE HERE ---------------------------------------------------------
# the model should return a "pred" value
# a function of lambda, alpha_intra, alpha_inter, lambda_cov, alpha_cov
# and neigh_intra_matrix, neigh_inter_matrix, and covariates
pred <- 0
# MODEL CODE ENDS HERE ----------------------------------------------------
# the routine returns the sum of log-likelihoods of the data and model:
# DO NOT CHANGE THIS
llik <- dnorm(fitness, mean = (log(pred)), sd = (sigma), log=TRUE)
return(sum(-1*llik))
}
Template for effect and response models
er_family_lambdacov_form_effectcov_form_responsecov_form <- function(par,
fitness,
target,
density,
covariates,
fixed_parameters){
num.sp <- nrow(target)
# parameters to fit are all in the "par" vector,
# so we need to retrieve them one by one
# order is {lambda,lambda_cov,effect,effect_cov,response,response_cov,sigma}
# comment or uncomment sections for the different parameters
# depending on whether your model includes them
# note that effect and response models must always include
# lambda, effect, and response, at least.
pos <- 1
# if a parameter is passed within the "par" vector,
# it should be NULL in the "fixed_parameters" list
# lambda
if(is.null(fixed_parameters[["lambda"]])){
lambda <- par[pos:(pos + num.sp - 1)]
pos <- pos + num.sp
}else{
lambda <- fixed_parameters[["lambda"]]
}
# lambda_cov
if(is.null(fixed_parameters$lambda_cov)){
# the covariate effects are more efficient in a matrix form
# with species in rows (hence byrow = T, because by default
# the vector is sorted first by covariates)
lambda_cov <- matrix(par[pos:(pos+(ncol(covariates)*num.sp)-1)],
nrow = num.sp,
byrow = TRUE)
pos <- pos + ncol(covariates)*num.sp
}else{
lambda_cov <- fixed_parameters[["lambda_cov"]]
}
# effect
if(is.null(fixed_parameters[["effect"]])){
effect <- par[pos:(pos + num.sp - 1)]
pos <- pos + num.sp
}else{
effect <- fixed_parameters[["effect"]]
}
# effect_cov
if(is.null(fixed_parameters$effect_cov)){
effect_cov <- matrix(par[pos:(pos+(ncol(covariates)*num.sp)-1)],
nrow = num.sp,
byrow = TRUE)
pos <- pos + ncol(covariates)*num.sp
}else{
effect_cov <- fixed_parameters[["effect_cov"]]
}
# response
if(is.null(fixed_parameters[["response"]])){
response <- par[pos:(pos + num.sp - 1)]
pos <- pos + num.sp
}else{
response <- fixed_parameters[["response"]]
}
# response_cov
if(is.null(fixed_parameters[["response_cov"]])){
response_cov <- matrix(par[pos:(pos+(ncol(covariates)*num.sp)-1)],
nrow = num.sp,
byrow = TRUE)
pos <- pos + ncol(covariates)*num.sp
}else{
response_cov <- fixed_parameters[["response_cov"]]
}
sigma <- par[length(par)]
# now, parameters have appropriate values (or NULL)
# next section is where your model is coded
# MODEL CODE HERE ---------------------------------------------------------
# the model should return a "pred" value
# a function of lambda, effect, response, lambda_cov, effect_cov, response_cov
pred <- 0
# MODEL CODE ENDS HERE ----------------------------------------------------
# the routine returns the sum of log-likelihoods of the data and model:
# DO NOT CHANGE THIS
llik <- dnorm(fitness, mean = (log(pred)), sd = (sigma), log=TRUE)
return(sum(-1*llik))
}
References
Godoy, O., & Levine, J. M. (2014). Phenology effects on invasion success: insights from coupling field experiments to coexistence theory. Ecology, 95(3), 726-736.
Hart, S. P., Freckleton, R. P., & Levine, J. M. (2018). How to quantify competitive ability. Journal of Ecology, 106(5), 1902-1909.


\begin{array}[pos]{vvvv} column 1 entry &: column 2 entry ... & column n entry \\ ... ... ... \end{array}
The array environment, like the tabular environment, produces a box consisting of a sequence of rows of vertically aligned columns. It can be used only within the math environment.
There is a single mandatory argument describing the number of columns and the alignment within each of them. Each of the v's in the argument specifies a column and may be a l, c, or r indicating that the column should be flush left, centered, or flush right, respectively. For more complex options, see the tabular environment which uses the same format.
The optional pos argument specifies the alignment of the array with its surrounding environment (recall that LaTeX treats boxes as one, albeit large letter). The options are
The default is to align on the center of the array.
Column entries must be separated by an &. Column entries may include other LaTeX commands, even other arrays. Each row of the array must be terminated with the string \\. Note that there is no & after the last item in a row and no \\ after the last row. (An exception is if an \hline is used to place a line at the bottom; it follows a \\.)
Each item in the array is treated as if it were surrounded by braces. Thus, a declaration within an array item is local to that item, i.e., it is ended by an & or \\.
Horizontal and vertical lines in the array are produced with
See also
Back to the Table of Contents


I am a 5 foot 10 27 yr old otherwise healthy nursing student who about a month ago started taking effexor for depression, and also started smoking pot again about a month before taking the effexor.
Two weeks ago at work I had my first seizure right after I had run home to change my shoes and have a few tokes off a joint. I only live three minutes from my job, but any ways I walk in the door of my work say something that makes no sense and drop head first into a mirror and proceed to have 10 minute seizure. I was transported to our local hospital by ambulance where I was treated for a concussion and lacerations. I was given a CT scan and xrays and sent home. I was supposed to stay with my parents for a few days so I could be watched so I drove home to get a few things and preceeded to have a few tokes again before I drove back to my parents house. Within 5 minutes of walking in the door of my parents house I had another seizure this time lasting 11 minutes. I have quit taking effexor.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


Institute of Electrical and Electronics EngineersThe
Institute of Electrical and Electronics Engineers is a professional
association with its corporate office in New York City and its
operations center in Piscataway, New Jersey.
Wikipedia
CEO: José Roberto de Marca
Founded: 1963
Customer service: 00 1<PHONE_NUMBER>
Mission statement
IEEE's core purpose is to foster technological innovation and excellence for the benefit of humanity.
Vision statement
IEEE will be essential to the global technical community and
to technical professionals everywhere, and be universally recognized
for the contributions of technology and of technical professionals in
improving global conditions.


Men found in truck container bound for Rosslare yesterday apply for asylum
by Michael StainesThe men found in the back of a truck on board a ferry making its way to Rosslare from France yesterday have applied for asylum in Ireland.
Gardaí said there were 14 men and two boys found on the ferry.
Investigators believe they are Kurdish from the Middle East region; however, a formal identification process is ongoing.
They are all described as being in ‘good health and good spirits’ after spending up to 12 hours in the truck container before being discovered by a ferry worker.
The ferry was met by Gardaí and immigration officials at Rosslare and the men were transferred to a Dublin reception centre, where they spent the night.
The men, aged between 20 and 40, have all applied for international protection and authorities are now working to find them accommodation while their applications are processed.
The boys are being cared for by Tusla.
Gardaí said they are continuing to carry out a criminal investigation into the discovery.
The Minister of State for Immigration David Stanton told Newstalk that he is relieved there was no repeat of what happened in Essex – where 39 people were found dead in a trailer.
“People smuggling is happening,” he said.
“There are people who are desperate to better their lives. They are paying possibly their life savings – maybe even borrowing money – to try and give their children a better life.
“And they are being victimised and exploited by unscrupulous and ruthless people.
“Unfortunately, we have seen fatalities; we have seen suffering and dying and suffocating in containers and again, we have seen what happened in Rosslare.”
He said it is “extremely sad” that vulnerable people are driven to put their lvies at risk to flee their home countries.
“We have seen already the international situation with millions of people displaced and desperate people trying to improve their lot and their situation,” he said.
“I am glad to see that the people are OK, which is the main thing – and the Gardaí and immigration authorities will deal with this and see where they go from here.”
The truck the men were found in is owned by a Wexford company and has been seized for a forensic examination.
The driver is a man in his 50s who has lived in Ireland for over 25 years and is described as “long-term employee” of the company.
The company and driver are “cooperating fully” with the investigation.


Java™ Execution Time Measurement Library
Runtime performance monitoring made easy
JETM release plan
This is the release plan for JETM. Intermediate releases are available through SVN and snapshots, release dates aren't fixed yet.
[-] planned, [o] in progress, [x] finished
Version 1.3 - Planned July/August 2007
- [-] Improve Swing support
- [o] Improve Java EE integration
- [-] Further framework integrations (JBoss Seam, ...)
- [x] JBoss AOP Framework support
- [-] Improve graphing capabilities
- [o] Consolidate documentation
Planned features
- Switch to event based monitoring (probably 2.0)
- Google GWT Rendering


#include <ir.h>
Definition at line 438 of file ir.h.
constructor
- Parameters
-
| ast | abstract syntax tree for this scope |
| parent | superordinate scope, or NULL if none |
Definition at line 373 of file ir.cpp.
destructor
Definition at line 390 of file ir.cpp.
| CTacLabel * CScope::CreateLabel |
( |
const char * |
hint = NULL | ) |
|
create a new (unique) label
- Parameters
-
| hint | optional descriptive string |
Definition at line 431 of file ir.cpp.
create a new (unique) temporary
- Parameters
-
| type | type of the temporary |
Definition at line 420 of file ir.cpp.
| string CScope::dotID |
( |
void |
| ) |
const |
|
virtual |
return the node ID in (dot) string format
- Return values
-
| string | node ID as a string |
Definition at line 449 of file ir.cpp.
get the (first) code block of this scope
Definition at line 415 of file ir.cpp.
| virtual CSymbol* CScope::GetDeclaration |
( |
void |
| ) |
const |
|
pure virtual |
return the symbol of the scope's declaration
Only set for procedures/functions; a module will return null.
Implemented in CProcedure, and CModule.
| string CScope::GetName |
( |
void |
| ) |
const |
return the scope's name
Definition at line 395 of file ir.cpp.
| CScope * CScope::GetParent |
( |
void |
| ) |
const |
return a reference to the parent scope
Definition at line 400 of file ir.cpp.
| const vector< CScope * > & CScope::GetSubscopes |
( |
void |
| ) |
const |
return a reference to the list of subscopes
Definition at line 405 of file ir.cpp.
| CSymtab * CScope::GetSymbolTable |
( |
void |
| ) |
const |
return a reference to the symbol table
Definition at line 410 of file ir.cpp.
| ostream & CScope::print |
( |
ostream & |
out, |
|
|
int |
indent = 0 |
|
) |
| const |
|
virtual |
print the node to an output stream
- Parameters
-
| out | output stream |
| indent | indentation |
Reimplemented in CProcedure, and CModule.
Definition at line 440 of file ir.cpp.
| void CScope::toDot |
( |
ostream & |
out, |
|
|
int |
indent = 0 |
|
) |
| const |
|
virtual |
return the node's attributes in (dot) string format
- Return values
-
| string | node attributes as a string print the node in dot format to an output stream |
- Parameters
-
| out | output stream |
| indent | indentation |
Definition at line 454 of file ir.cpp.
abstract syntax tree
Definition at line 524 of file ir.h.
list of code blocks
Definition at line 529 of file ir.h.
| vector<CScope*> CScope::_children |
|
protected |
list of functions
Definition at line 528 of file ir.h.
| unsigned int CScope::_label_id |
|
protected |
next id for labels
Definition at line 532 of file ir.h.
name
Definition at line 525 of file ir.h.
superordinate scope
Definition at line 527 of file ir.h.
symbol table
Definition at line 526 of file ir.h.
| unsigned int CScope::_temp_id |
|
protected |
next id for temporaries
Definition at line 531 of file ir.h.
The documentation for this class was generated from the following files:


These error messages are not yet localized
Table H.2. English error messages
| Error code | Error message |
|---|---|
1000
| Tilde processing is not yet supported for QR Barcodes. |
1001
| Inverting the bit pattern is not supported for QR Barcodes. |
1002
| Cannot read data from file %s |
1003
| Cannot open file %s |
1004
| Cannot write QR barcode to file %s |
1005
| Unsupported image format selected. Check your GD installation |
1006
| Cannot set the selected barcode colors. Check your GD installation and spelling of color name |
1007
|
JpGraph Error: HTTP headers have already been sent. Caused by output from file %s at line %d. Explanation: HTTP headers have already been sent back to the browser indicating the data as text before the library got a chance to send it's image HTTP header to this browser. This makes it impossible for the library to send back image data to the browser (since that would be interpreted as text by the browser and show up as junk text). Most likely you have some text in your script before the call to Graph::Stroke(). If this texts gets sent back to the browser the browser will assume that all data is plain text. Look for any text, even spaces and newlines, that might have been sent back to the browser. For example it is a common mistake to leave a blank line before the opening |
1008
| Could not create the barcode image with image format=%s. Check your GD/PHP installation. |
1009
| Cannot open log file %s for writing. |
1010
| Cannot write log info to log file %s. |
1100
| Internal error: Illegal mask pattern selected |
1101
| Internal error: Trying to apply masking to functional pattern. |
1102
| Internal error: applyMaskAndEval(): Found uninitialized module in matrix when applying mask pattern. |
1200
| Internal error: Was expecting %d bits in version %d to be placed in matrix but got %d bits |
1201
| Internal error: Trying to position bit outside the matrix x=%d, y=%d, size=%d, bIdx=%d |
1202
| Internal error: Trying to put data in initialized bit. |
1203
| Internal error: Mask number for format bits is invalid. (maskidx=%d) |
1204
| Internal error: Found an uninitialized bit [val=%d] at (%d,%d) when flattening matrix |
1300
| Internal error: QRCapacity::getFormatBits() Was expecting a format in range [0,31] got %d |
1301
| Internal error: QRCapacity::getVersionBits() Was expecting a version in range [7,40] got %d |
1302
| Internal error: QRCapacity::_chkVerErr() Was expecting version in range [1,40] and error level in range [0,3] got (%d,%d) |
1303
| Internal error: QRCapacity::getAlignmentPositions() Expected %d patterns but found %d patterns (len=%d). |
1304
| Internal error: QRCapacity::%s Was expecting a version in range [1,40] got %d |
1400
| QR Version must be specified as a value in the range [1,40] got %d |
1401
| Input data to barcode can not be empty. |
1402
| Automatic encodation mode was specified but input data looks like specification for manual encodation. |
1403
| Was expecting an array of arrays as input data for manual encoding. |
1404
| Each input data array element must consist of two entries. Element $i has of $nn entries |
1405
| Each input data array element must consist of two entries with first entry being the encodation constant and the second element the data string. Element %d is incorrect in this respect. |
1406
| Was expecting either a string or an array as input data |
1407
| Manual encodation mode was specified but input data looks like specification for automatic encodation. |
1408
| Input data too large to fit into one QR Symbol |
1409
| The selected symbol version %d is too small to fit the specified data and selected error correction level. |
1410
| Trying to read past the last available codeword in block split. |
1411
| Internal error: Expected 1 or 2 as the number of block structures. |
1412
| Internal error: Too many codewords for chosen symbol version. (negative number of pad codewords). |
1413
| Internal error: splitInBytes: Expected an even number of 8-bit blocks. |
1414
| Internal error: getCountBits() illegal version number (=%d). |
1415
| Manually specified encodation schema MODE_NUMERIC has no data that can be encoded using this schema. |
1416
| Manually specified encodation schema MODE_ALPHANUM has no data that can be encoded using this schema. |
1417
| Manually specified encodation schema MODE_BYTE has no data that can be encoded using this schema. |
1418
| Unsupported encodation schema specified (%d) |
1419
| Found character in data stream that cannot be encoded with the selected manual encodation mode. |
1420
| Encodation using KANJI mode not yet supported. |
1421
| Internal error: Unsupported encodation mode doAuto(). |
1422
| Found unknown characters in the data stream that can't be encoded with any available encodation mode. |
1423
| Kanji character set not yet supported. |
1424
| Internal error: DataStorage:: Unsupported character mode (%d) DataStorage::Remaining() |
1425
| Internal error: DataStorage:: Trying to extract slice of len=%d (with type=%d) when there are only %d elements left |
1426
| Internal error: DataStorage:: Trying to read past input data length. |
1427
| Expected either DIGIT, ALNUM or BYTE but found ASCII code=%d |
1428
| Internal error: DataStorage::Peek() Trying to peek past input data length. |


Delight made easy
We make it fast and easy for businesses to delight their customers and employees.
Our fresh approach to business software has enabled over 50,000 companies big and small across the globe to exceed customer and employee expectations. We deliver on the unfulfilled promise of easy-to-use SaaS software, and help our customers drive clear business results.
Exceed the evolving expectations your customers have, with contextual and relevant conversations powered by a 360-degree customer view.
Solutions for customer support Solutions for sales and marketingHelp your employees crush internal NPS ratings with our intuitive, easy-to-use products, so they can spend less time navigating bloated, difficult-to-use legacy software.
Solutions for IT service management Solutions for HR managementFreshworks makes it fast and easy for businesses to delight their customers and employees.
We take a fresh approach to how businesses discover, engage with, and realize value from software throughout their journey.
We are a leading provider of modern SaaS solutions that solve multiple, complex business problems to companies of all sizes. Businesses from more than 120 countries around the world use Freshworks’ products to delight their customers and employees every day.
Join our community of 50,000+ companies of all sizes who use Freshworks’ modern SaaS products to make it fast and easy to delight their customers and employees.


Hello there, awesome person!
This is a link to REI
This is a link to Mozilla
This is a link to W3C Schools
This is a link to CSS Tricks


Video name
Name:
This is a merchant name.
Phone:
028-12345678
Addess:
This is an merchant address.
Video List
test
test
test
test
test
test


[gecode-users] Porting Gecol for Gecode 2.0
Mauricio Toro
mauriciotorob at gmail.com
Fri Jan 4 14:15:06 CET 2008
Hello,
I am interested in porting the Gecode Lisp interface (GECOL)
which currently supports Gecode 1.3.1 to Gecode 2.0.0.
I looked at the changelog, but I was wondering where can I
find more information about the differences between Gecode 1.3.1
and Gecode 2.0.0 which can be helpful for upgrading the Lisp Interface.
Additionally I would like to know about the experiences of
other programers who are working/worked porting their Gecode interfaces
to Gecode 2.0.0 (Java, Oz, Ruby, etc)
Thank you very much
--
Mauricio Toro Bermudez
Estudiante de Ingeniería de Sistemas
Pontificia Universidad Javeriana, Colombia
Stagiare à l'Ircam
1, place Igor-Stravinsky 75004 Paris,
France de 2008 à 2009
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.ps.uni-sb.de/pipermail/users/attachments/20080104/c2643054/attachment.htm>
More information about the gecode-users
mailing list


Links 😇
To Follow Me On Instagram 😄
@iam.vikas04
Click Here
To Follow Me On Twitter 😃
@iamvikas00
Click Here


This specification describes an application of Verifiable Credentials for use as Authorization Capabilities.
This is an experimental specification and is undergoing regular revisions. It is not fit for production deployment.
Please open an issue , if you wish to collaborate on this specification.
You may also reach out via the mailing list<EMAIL_ADDRESS>(subscribe, archives)
Traditional mechanisms for defining, requesting and granting authorization are brittle, outdated, and lack the semantic expressiveness to account for the scope and scale of modern software applications, and the privacy concerns of data subjects and controllers.
This specification describes an application of [[vc-data-model]] for the purpose of granting, invoking and verifying authorization capabilities.
This work is inspired by [[ZCAP-LD]], [[GNAP]] and the challenges.
See [[vc-data-model]].
See [[vc-data-model]].
A Verifiable Credential definining the authorization assigned by an issuer to a subject.
A Verifiable Presentation of one or more AuthorizationCapability Verifiable Credentials.
Define relationship to GNAP / CHAPI.
An authorization capability is created by issuing an AuthorizationCapability Verifiable Credential to one or more subjects.
{ "@context": [ "https://www.w3.org/2018/credentials/v1", "https://www.w3.org/2018/credentials/v2" ], "id": "http://example.com/zcaps/0", "type": [ "VerifiableCredential" ], "issuer": "did:key:zACHcxDJnZZXpzEs2fMkCctJPmgccBHM9rCQVQrkRS5Dkesdz94Xj7EEKs8vJ95prX76ZhFcT73jiYf4r7ynZZciLgAgkfMVUpsZC2Sykdt7GLv3WFbMopmgiJJQEami568r5iBV", "issuanceDate": "2020-03-10T04:24:12.164Z", "name": "Manage Vault Documents", "description": "This capability grants a subject the ability to manage documents in a confidential datastore.", "credentialSubject": { "id": "did:key:zACHcxDJnZZXpzEs2fMkCctJPmgccBHM9rCQVQrkRS5Dkesdz94Xj7EEKs8vJ95prX76ZhFcT73jiYf4r7ynZZciLgAgkfMVUpsZC2Sykdt7GLv3WFbMopmgiJJQEami568r5iBV", "type": "AuthorizationCapability", "authorization": [ { "type": "https://w3id.org/security#capabilityInvocation", "locations": [ "https://example.com/edvs/123" ], "actions": [ "https://w3id.org/security#vault.document.create", "https://w3id.org/security#vault.document.read", "https://w3id.org/security#vault.document.update", "https://w3id.org/security#vault.document.delete" ] } ] }, "proof": { "type": "JsonWebSignature2020", "created": "2020-12-19T22:02:43.521Z", "jws": "eyJhbGciOiJFUzM4NCIsImI2NCI6ZmFsc2UsImNyaXQiOlsiYjY0Il19..ij41tt92XHl_USxr_ICLODJDFAr9-PhWjdP-nj8g1hXyJ-tCH4joR8nAeKQsFZWZXZhiUAakzxGVILjkHc_Xihm1DuQ3fLgxBl8RbkqXodLRjx6qzP3UQsghkk0Pts6n", "proofPurpose": "assertionMethod", "verificationMethod": "did:key:zACHcxDJnZZXpzEs2fMkCctJPmgccBHM9rCQVQrkRS5Dkesdz94Xj7EEKs8vJ95prX76ZhFcT73jiYf4r7ynZZciLgAgkfMVUpsZC2Sykdt7GLv3WFbMopmgiJJQEami568r5iBV#zACHcxDJnZZXpzEs2fMkCctJPmgccBHM9rCQVQrkRS5Dkesdz94Xj7EEKs8vJ95prX76ZhFcT73jiYf4r7ynZZciLgAgkfMVUpsZC2Sykdt7GLv3WFbMopmgiJJQEami568r5iBV" } }
An authorization capability is delegated by issuing an AuthorizationCapability verifiable credential to one or more subjects.
{ "@context": [ "https://www.w3.org/2018/credentials/v1", "https://www.w3.org/2018/credentials/v2" ], "id": "http://example.com/zcaps/1", "type": [ "VerifiableCredential" ], "issuer": "did:key:zACHcxDJnZZXpzEs2fMkCctJPmgccBHM9rCQVQrkRS5Dkesdz94Xj7EEKs8vJ95prX76ZhFcT73jiYf4r7ynZZciLgAgkfMVUpsZC2Sykdt7GLv3WFbMopmgiJJQEami568r5iBV", "issuanceDate": "2020-03-10T04:24:12.164Z", "name": "Read Vault Documents", "description": "This capability grants a subject the ability to read documents in a confidential datastore.", "credentialSubject": { "id": "did:key:zACHdHPDvB6e4as9JB7xNnTydJyhUTNv4qFGfUj8mGRY3ezJh21927ZhNDw47KqeRMjNNFwGGU8uac7QoTmDBXPcXWRXW9J5MWLJxc9GwshoC6CT6ekEX6phS319LVuvPWY4mc39", "type": "AuthorizationCapability", "authorization": [ { "capability": "http://example.com/zcaps/0", "caveat": [ { "actions": [ "https://w3id.org/security#vault.document.read" ] } ] } ] }, "proof": { "type": "JsonWebSignature2020", "created": "2020-12-19T22:14:33.784Z", "jws": "eyJhbGciOiJFUzM4NCIsImI2NCI6ZmFsc2UsImNyaXQiOlsiYjY0Il19..qS5Xg8I2ktyVMmgE8V5pLbnQPpK13n0XwSyF6FERKfIpn9CylWpKyy-vh123Gg8YI31GzFMHkD2AUgd1ZdQGHRIPTvztw3VAx4T6_SOyH_wPKI2f3SiDXGlSejwhXvEy", "proofPurpose": "assertionMethod", "verificationMethod": "did:key:zACHcxDJnZZXpzEs2fMkCctJPmgccBHM9rCQVQrkRS5Dkesdz94Xj7EEKs8vJ95prX76ZhFcT73jiYf4r7ynZZciLgAgkfMVUpsZC2Sykdt7GLv3WFbMopmgiJJQEami568r5iBV#zACHcxDJnZZXpzEs2fMkCctJPmgccBHM9rCQVQrkRS5Dkesdz94Xj7EEKs8vJ95prX76ZhFcT73jiYf4r7ynZZciLgAgkfMVUpsZC2Sykdt7GLv3WFbMopmgiJJQEami568r5iBV" } }
An authorization capability is invoked by presenting an CapabilityInvocation verifiable presentation containing one or more AuthorizationCapability Verifiable Credentials.
{ "@context": [ "https://www.w3.org/2018/credentials/v1", "https://www.w3.org/2018/credentials/v2" ], "type": [ "VerifiablePresentation", "AuthorizationCapabilityInvocation" ], "verifiableCredential": [ { "@context": [ "https://www.w3.org/2018/credentials/v1", "https://www.w3.org/2018/credentials/v2" ], "id": "http://example.com/zcaps/1", "type": [ "VerifiableCredential" ], "issuer": "did:key:zACHcxDJnZZXpzEs2fMkCctJPmgccBHM9rCQVQrkRS5Dkesdz94Xj7EEKs8vJ95prX76ZhFcT73jiYf4r7ynZZciLgAgkfMVUpsZC2Sykdt7GLv3WFbMopmgiJJQEami568r5iBV", "issuanceDate": "2020-03-10T04:24:12.164Z", "name": "Read Vault Documents", "description": "This capability grants a subject the ability to read documents in a confidential datastore.", "credentialSubject": { "id": "did:key:zACHdHPDvB6e4as9JB7xNnTydJyhUTNv4qFGfUj8mGRY3ezJh21927ZhNDw47KqeRMjNNFwGGU8uac7QoTmDBXPcXWRXW9J5MWLJxc9GwshoC6CT6ekEX6phS319LVuvPWY4mc39", "type": "AuthorizationCapability", "authorization": [ { "capability": "http://example.com/zcaps/0", "caveat": [ { "actions": [ "https://w3id.org/security#vault.document.read" ] } ] } ] }, "proof": { "type": "JsonWebSignature2020", "created": "2020-12-19T22:14:33.784Z", "jws": "eyJhbGciOiJFUzM4NCIsImI2NCI6ZmFsc2UsImNyaXQiOlsiYjY0Il19..qS5Xg8I2ktyVMmgE8V5pLbnQPpK13n0XwSyF6FERKfIpn9CylWpKyy-vh123Gg8YI31GzFMHkD2AUgd1ZdQGHRIPTvztw3VAx4T6_SOyH_wPKI2f3SiDXGlSejwhXvEy", "proofPurpose": "assertionMethod", "verificationMethod": "did:key:zACHcxDJnZZXpzEs2fMkCctJPmgccBHM9rCQVQrkRS5Dkesdz94Xj7EEKs8vJ95prX76ZhFcT73jiYf4r7ynZZciLgAgkfMVUpsZC2Sykdt7GLv3WFbMopmgiJJQEami568r5iBV#zACHcxDJnZZXpzEs2fMkCctJPmgccBHM9rCQVQrkRS5Dkesdz94Xj7EEKs8vJ95prX76ZhFcT73jiYf4r7ynZZciLgAgkfMVUpsZC2Sykdt7GLv3WFbMopmgiJJQEami568r5iBV" } } ], "holder": "did:key:zACHdHPDvB6e4as9JB7xNnTydJyhUTNv4qFGfUj8mGRY3ezJh21927ZhNDw47KqeRMjNNFwGGU8uac7QoTmDBXPcXWRXW9J5MWLJxc9GwshoC6CT6ekEX6phS319LVuvPWY4mc39", "proof": { "type": "JsonWebSignature2020", "created": "2020-12-19T22:14:33.893Z", "challenge": "123", "jws": "eyJhbGciOiJFUzM4NCIsImI2NCI6ZmFsc2UsImNyaXQiOlsiYjY0Il19..wB7OKxgt5FW1opChzemnm0YfL7S3B97VdsHrn1ohLSi6er1Fo8-nBzeyORCgEc2BWpo-bKJ1kTa5SMGtA9RRMCAKKG1pejOHMMuomDjTTggBbI3DBpS45LX2sxVpLJV7", "proofPurpose": "authentication", "verificationMethod": "did:key:zACHdHPDvB6e4as9JB7xNnTydJyhUTNv4qFGfUj8mGRY3ezJh21927ZhNDw47KqeRMjNNFwGGU8uac7QoTmDBXPcXWRXW9J5MWLJxc9GwshoC6CT6ekEX6phS319LVuvPWY4mc39#zACHdHPDvB6e4as9JB7xNnTydJyhUTNv4qFGfUj8mGRY3ezJh21927ZhNDw47KqeRMjNNFwGGU8uac7QoTmDBXPcXWRXW9J5MWLJxc9GwshoC6CT6ekEX6phS319LVuvPWY4mc39" } }
Verification of capabilities and invocations mirrors the process of verifiying credentials and presentations, but with some notable exceptions, to support delegation and revocation.
In order to verify a capability invocation, both the inovcation and the associated capability chain must be verified, similar to how a verifiable presentation is only verified when the credentials and the presentation have been verified.
In order to verify a capability, a verifier must traverse backwards from a leaf capability to a root capability.
Each capability can be embedded by value or by reference (uri).
If any capability is not resolvable, or if verification fails, the capability chain verification process must exit immediatly, and the chain MUST be considerd to have failed verification.
In order to verify a capability invocation, the associated capability chain must be verified as a series of linked verifiable credentials.
After the capability chain has been verified, the capability invocation MUST be verified, as a verifiable presentation.
If either the capability chain or the capability invocation verification fails, the invocation MUST be considerd to have failed verification.
This section details the general privacy considerations and specific privacy implications of deploying this specification into production environments.
There are a number of security considerations that implementers should be aware of when processing data described by this specification. Ignoring or not understanding the implications of this section can result in security vulnerabilities.
While this section attempts to highlight a broad set of security considerations, it is not a complete list. Implementers are urged to seek the advice of security and cryptography professionals when implementing mission critical systems using the technology outlined in this specification.
There are a number of accessibility considerations implementers should be aware of when processing data described in this specification. As with any web standards or protocols implementation, ignoring accessibility issues makes this information unusable to a large subset of the population. It is important to follow accessibility guidelines and standards, such as [[WCAG21]], to ensure all people, regardless of ability, can make use of this data. This is especially important when establishing systems utilizing cryptography, which have historically created problems for assistive technologies.
This section details the general accessibility considerations to take into account when utilizing this data model.
There are a number of internationalization considerations implementers should be aware of when publishing data described in this specification. As with any web standards or protocols implementation, ignoring internationalization makes it difficult for data to be produced and consumed across a disparate set of languages and societies, which would limit the applicability of the specification and significantly diminish its value as a standard.
This section outlines general internationalization considerations to take into account when utilizing this data model.


SEVENTEENTH LEGISLATIVE MEETING JOHN A. WILSON BUILDING, COUNCIL CHAMBER TUESDAY, NOVEMBER 5, 2013 10:00 A.M. AGENDA Revised 11/4/13 I. CALL TO ORDER II. MOMENT OF SILENCE III. DETERMINATION OF QUORUM IV. PRESENTATION OF CEREMONIAL RESOLUTIONS 1. Art Enables Organization Ceremonial Recognition Resolution Councilmember Graham of 2013 2. Verizon Ceremonial Recognition Resolution of 2013 Councilmember Bonds 3. District of Columbia Sustainable Energy Utility Ceremonial Councilmember Bonds Recognition Resolution of 2013 4. Abdullah A. Zaki II District of Columbia Public Schools Councilmember Alexander Principal of the Year Recognition Resolution of 2013 V. FILING OF COMMITTEE REPORTS AND SPECIAL REPORTS A. Secretary’s Report VI. INTRODUCTION AND REFERRAL OF PROPOSED LEGISLATION A. Secretary’s Report of Introductions B. Introduction by Members on the Dais VII. CONSENT A. READING AND VOTE ON PROPOSED CEREMONIAL RESOLUTIONS 1. Francis Lewis Cardozo High School Class of 1963 Ceremonial Councilmember Graham Recognition Resolution of 2013 2. Art Enables Organization Ceremonial Recognition Resolution Councilmember Graham of 2013 3. Chauvet and La Fourchette Ceremonial Recognition Resolution Councilmember Graham of 2013 1 4. Carlos Rosario International Public Charter School Sonia Chairman Mendelson Gutierrez Campus Recognition Resolution of 2013 5. Donnell Floyd Recognition Resolution of 2013 Councilmember Evans 6. Community Cat Day Recognition Resolution of 2013 Councilmember Cheh 7. Dewey Gowdy Recognition Resolution of 2013 Chairman Mendelson 8. Robert Griffin III NFL Offensive Rookie of the Year Councilmember Orange, Sr. Ceremonial Recognition Resolution of 2013 9. Floyd Mayweather, Jr. Ceremonial Recognition Resolution of Councilmember Orange, Sr. 2013 10. Therrell C. Smith School of Dance 65th Anniversary Councilmember Evans Recognition Resolution of 2013 11. Priscilla Green Francis Recognition Resolution of 2013 Councilmember Evans 12. Foreball Golf Club 50th Anniversary Recognition Resolution of Councilmember Bowser 2013 13. DC Scandal’s National Championship Recognition Resolution Councilmembers Grosso, of 2013 Wells and Alexander 14. DC Youth Poetry Slam Team Recognition Resolution of 2013 Councilmembers Grosso, McDuffie, Barry, Catania, Wells, Alexander and Cheh 15. Abdullah A. Zaki II District of Columbia Public Schools Councilmember Alexander Principal of the Year Recognition Resolution of 2013 16. Dr. Paul Rao Recognition Resolution of 2013 Chairman Mendelson 17. Maria de Fatima Lima de Veiga Recognition Resolution of Chairman Mendelson 2013 18. Lieutenant Jon Shelton Recognition Resolution of 2013 Chairman Mendelson 19. Dr. Feseha Woldu Recognition Resolution of 2013 Councilmember Alexander 20. Ralph W. Day Veterans Day Recognition Resolution of 2013 Councilmember Alexander B. FINAL READING AND VOTE ON PROPOSED BILLS 1. Trauma Technologists Amendment Act of 2013 Committee on Health (Bill 20-232) Chairperson Alexander 2 2. Cottage Food Amendment Act of 2013 Committee on Health (Bill 20-168) Chairperson Alexander C. FIRST READING AND VOTE ON PROPOSED BILLS 1. Manufacturer Tasting Permit Act of 2013 Committee on Business, (Bill 20-234) Consumer and Regulatory Affairs Chairperson Orange, Sr. 2. District of Columbia Distillery Pub Licensure Act of 2013 Committee on Business, (Bill 20-29) Consumer and Regulatory Affairs Chairperson Orange, Sr. 3. Manufacturers Sunday Sale Act of 2013 Committee on Business, (Bill 20-197) Consumer and Regulatory Affairs Chairperson Orange, Sr. D. READING AND VOTE ON CONGRESSIONAL REVIEW EMERGENCY 1. CCNV Task Force Congressional Review Emergency Councilmember Graham Declaration Resolution of 2013 CCNV Task Force Congressional Review Emergency Act of 2013 2. Washington Metropolitan Area Transit Board of Directors Chairman Mendelson Congressional Review Emergency Declaration Resolution of 2013 Washington Metropolitan Area Transit Board of Directors Congressional Review Emergency Amendment Act of 2013 E. READING AND VOTE ON PROPOSED RESOLUTIONS 1. Contract Appeals Board Monica Parchment Confirmation Committee of the Whole Resolution of 2013 Chairman Mendelson (PR 20-354) 3 F. FINAL READING AND VOTE ON TEMPORARY LEGISLATION 1. Livery Class Regulation and Ride-Sharing Temporary Councilmembers Cheh, Amendment Act of 2013 Grosso and Evans (Bill 20-445) 2. Extension of Time to Dispose of the Strand Theater Temporary Councilmember Alexander Amendment Act of 2013 (Bill 20-499) 3. Transportation Infrastructure Mitigation Temporary Councilmember Cheh at the Amendment Act of 2013 request of the Mayor (Bill 20-430) G. READING AND VOTE ON CONTRACT MODIFICATION LEGISLATION AT THE REQUEST OF THE EXECUTIVE PURSUANT TO COUNCIL RULE 307(b) 1. Change Orders No. FY13-015 through No. FY13-023 to Contract GM-10-S-0707D-FM Approval and Payment Authorization Emergency Declaration Resolution of 2013 (PR 20-503) Change Orders No. FY13-015 through No. FY13-023 to Contract GM-10-S-0707D-FM Approval and Payment Authorization Emergency Act of 2013 (Bill 20-526) (At the request of the Mayor with HRGM Corporation) 2. Change Orders No. FY13-007 through No. FY13-013 to Contract GM-10-S-0707A-FM Approval and Payment Authorization Emergency Declaration Resolution of 2013 (PR 20-504) Change Orders No. FY13-007 through No. FY13-013 to Contract GM-10-S-0707A-FM Approval and Payment Authorization Emergency Act of 2013 (Bill 20-527) (At the request of the Mayor with Keystone Plus Construction Corporation) 4 3. Contract No. GF-2011-C-0030 and Change Order’s No. 8-9 Approval and Payment Authorization Emergency Declaration Resolution of 2013 (PR 20-506) Contract No. GF-2011-C-0030 and Change Order’s No. 8-9 Approval and Payment Authorization Emergency Contract No. GF-2011-C-0030 and Change Order’s No. 8-9 Approval and Payment Authorization Emergency Act of 2013 (Bill 20-533) (At the request of UDC with Parkinson/Forrester JV, LLC) 4. Change Order No. FY13-010 through No. FY13-017 to Contract GM-10-S-0707C-FM Approval and Payment Authorization Emergency Declaration Resolution of 2013 (PR 20-519) Change Order No. FY13-010 through No. FY13-017 to Contract GM-10-S-0707C-FM Approval and Payment Authorization Emergency Act of 2013 (Bill 20-534) (At the request of the Mayor with Broughton Construction Company) VIII. NON-CONSENT AGENDA A. FINAL READING AND FINAL VOTE ON PROPOSED BILLS 1. Drivers Safety Amendment Act of 2013 Committee on (Bill 20-275) w/Amendment in the Nature of a Substitute Transportation and the Environment Chairperson Cheh B. FIRST READING AND VOTE ON PROPOSED BILLS 1. Prescription Drug Monitoring Program Act of 2013 Committee on Health (Bill 20-127) w/Amendment in the Nature of a Substitute Chairperson Alexander 2. Parent and Student Empowerment Act of 2013 Committee on Education (Bill 20-314) Chairperson Catania 3. Focused Student Achievement Act of 2013 Committee on Education (Bill 20-311) w/Amendment in the Nature of a Substitute Chairperson Catania 5 4. Motion to Waive 231 (c) to consider Bill 20-70, Councilmember Evans Historic Music Cultural Institutions Expansion Tax Abatement Act of 2013 Historic Music Cultural Institutions Expansion Tax Abatement Committee on Finance and Act of 2013 Revenue (Bill 20-70) Chairperson Evans 5. Motion to Waive 231 (c) to consider Bill 20-348, Councilmember Evans Tax Clarity Equity Amendment Act of 2013 Tax Clarity Equity Amendment Act of 2013 Committee on Finance and (Bill 20-348) Revenue Chairperson Evans 6. Motion to Waive 231 (c) to consider Bill 20-280, Councilmember Evans YMCA Community Investment Initiative Real Property Tax Exemption Act of 2013 YMCA Community Investment Initiative Real Property Tax Committee on Finance and Exemption Act of 2013 Revenue (Bill 20-280) Chairperson Evans 7. Motion to Waive 231 (c) to consider Bill 20-235, Councilmember McDuffie Funeral and Memorial Service Leave Amendment Act of 2013 Funeral and Memorial Service Leave Amendment Act of 2013 Committee on Government (Bill 20-235) Operations Chairperson McDuffie 8. Motion to Waive 231(c) to consider Bill 20-116, Councilmember McDuffie Board of Ethics and Government Accountability Amendment Act of 2013 Board of Ethics and Government Accountability Amendment Committee on Government Act of 2013 Operations (Bill 20-116) Chairperson McDuffie 9. Motion to Waive 231(c) to consider Bill 20-76, Councilmember McDuffie Campaign Finance Reform and Transparency Amendment Act of 2013 Campaign Finance Reform and Transparency Amendment Act Committee on Government of 2013 (formerly “Campaign Finance Training Amendment Operations Act of 2013”) Chairperson McDuffie (Bill 20-76) 6 10. Motion to Waive 231(c) to consider Bill 20-117, Councilmember McDuffie Prohibition on Government Employee Engagement in Political Activity Amendment Act of 2013 Prohibition on Government Employee Engagement in Political Committee on Government Activity Amendment Act of 2013 Operations (Bill 20-117) Chairperson McDuffie C. READING AND VOTE ON PROPOSED RESOLUTIONS 1. Motion to Waive 231 (c) to consider PR 20-411, Councilmember Evans Fiscal Year 2014 Income Tax Secured Revenue Bond and General Obligation Bond Issuance Approval Resolution of 2013 Fiscal Year 2014 Income Tax Secured Revenue Bond and Committee on Finance and General Obligation Bond Issuance Approval Resolution of 2013 Revenue (PR 20-411) Chairperson Evans 2. (Council Rule 339) Commission on the Arts and Humanities Committee on Finance and Barbara AJ. Jones Confirmation Resolution of 2013 Revenue (PR 20-442) Chairperson Evans 3. (Council Rule 339) Commission on the Arts and Humanities Committee on Finance and Rhona Friedman Confirmation Resolution of 2013 Revenue (PR 20-443) Chairperson Evans 4. Motion to Waive 231(c) to consider PR 20-477, Councilmember Evans Chief Financial Officer of the District of Columbia Jeffrey S. DeWitt Confirmation Resolution of 2013 Chief Financial Officer of the District of Columbia Jeffrey S. Committee on Finance and DeWitt Confirmation Resolution of 2013 Revenue (PR 20-477) Chairperson Evans 5. Sense of the Council to Rename the Washington Football Club Chairman Mendelson and Resolution of 2013 Councilmember Grosso (PR 20-239) w/Amendment in the Nature of a Substitute 6. Motion to Waive 231(c) to consider PR 20-493, Councilmember McDuffie Office of Employee Appeals Vera Abbott Confirmation Resolution of 2013 Office of Employee Appeals Vera Abbott Confirmation Committee on Government Resolution of 2013 Operations (PR 20-493) Chairperson McDuffie D. FINAL READING AND VOTE ON TEMPORARY LEGISLATION 7 E. READING AND VOTE ON EMERGENCY LEGISLATION 1. Taxicab Commission Background Check Authority Emergency Councilmember Cheh Declaration Resolution of 2012 Taxicab Commission Background Check Authority Emergency Amendment Act of 2013 2. Department of Health Grant Making Authority for Clinical Councilmember Alexander Nutritional Home Services Emergency Declaration Resolution of 2013 Department of Health Grant Making Authority for Clinical Nutritional Home Services Emergency Amendment Act of 2013 3. Controlled Substance, Alcohol Testing, Criminal Background Chairman Mendelson Check and Background Investigation Emergency Declaration Resolution of 2013 Controlled Substance, Alcohol Testing, Criminal Background Check and Background Investigation Emergency Amendment Act of 2013 4. Cost of Living Adjustment Personal Income Tax Standard Councilmember Evans Deduction and Exemption Technical Clarification Emergency Declaration Resolution of 2013 Cost of Living Adjustment Personal Income Tax Standard Deduction and Exemption Technical Clarification Emergency Act of 2013 5. Critical Infrastructure Freedom of Information Emergency Councilmember McDuffie Declaration Resolution of 2013 Critical Infrastructure Freedom of Information Emergency Amendment Act of 2013 6. Board of Elections Nominating Petition Circulator Affidavit Councilmember McDuffie Emergency Declaration Resolution of 2013 Board of Elections Nominating Petition Circulator Affidavit Emergency Amendment Act of 2013 7. Party Officer Elections Emergency Declaration Resolution of Councilmember McDuffie 2013 Party Officer Elections Emergency Amendment Act of 2013 8 F. READING AND VOTE ON EMERGENCY LEGISLATION AT THE REQUEST OF THE MAYOR 1. Transportation Infrastructure Improvement GARVEE Bond Councilmember Cheh at the Financing Emergency Declaration Resolution of 2013 request of the Mayor Transportation Infrastructure Improvement GARVEE Bond Financing Emergency Amendment Act of 2013 2. Compensation Collective Bargaining Agreement between the Chairman Mendelson at the District of Columbia Department of General Services and request of the Mayor Teamster Locals 639 and 730, Affiliated with the International Brotherhood of Teamsters Emergency Declaration Resolution of 2013 (PR 20-501) Compensation Collective Bargaining Agreement between the District of Columbia Department of General Services and Teamster Locals 639 and 730, Affiliated with the International Brotherhood of Teamsters Emergency Approval Resolution of 2013 (PR 20-502) 3. Department of Corrections Central Cellblock Management Councilmember Wells at the Clarification Emergency Declaration Resolution of 2013 request of the Mayor Department of Corrections Central Cellblock Management Clarification Emergency Amendment Act of 2013 4. Omnibus Residential Services Human Care Agreements Councilmember Graham at Modifications Approval and Payment Authorization Emergency the request of the Mayor Declaration Resolution of 2013 (PR 20-522) Omnibus Residential Services Human Care Agreements Modifications Approval and Payment Authorization Emergency Act of 2013 (Bill 20-538) (With Ward & Ward Mental Health Services, Inc., Multi- Therapeutic Services, Inc., and Capital Care, Inc.) 5. Contract No. DCHT-2011-C-0001 Approval and Payment Councilmember Alexander Authorization Emergency Declaration Resolution of 2013 at the request of the Mayor (PR 20-474) Contract No. DCHT-2011-C-0001 Approval and Payment Authorization Emergency Act of 2013 (Bill 20-493) (With Policy Studies, International) 9 6. Contract No. DCHT-2013-C-0135 Approval and Payment Councilmember Alexander Authorization Emergency Declaration Resolution of 2013 at the request of the Mayor (PR 20-492) Contract No. DCHT-2013-C-0135 Approval and Payment Authorization Emergency Act of 2013 (Bill 20-522) (With Delmarva) 7. Contract No. CW2336 Emergency Declaration Resolution of Councilmember McDuffie 2013 at the request of the Mayor Contract No. CW2336 Emergency Act of 2013 (With Brad Hall Associates) G. READING AND VOTE ON TEMPORARY LEGISLATION 1. Taxicab Commission Background Check Authority Temporary Councilmember Cheh Amendment Act of 2013 2. Department of Health Grant Making Authority for Clinical Councilmember Alexander Nutritional Home Services Temporary Amendment Act of 2013 3. Controlled Substance, Alcohol Testing, Criminal Background Chairman Mendelson Check and Background Investigation Temporary Amendment Act of 2013 4. Critical Infrastructure Freedom of Information Temporary Councilmember McDuffie Amendment Act of 2013 5. Board of Elections Nominating Petition Circulator Affidavit Councilmember McDuffie Temporary Amendment Act of 2013 6. Party Officer Elections Temporary Amendment Act of 2013 Councilmember McDuffie H. READING AND VOTE ON TEMPORARY AT THE REQUEST OF THE MAYOR 1. Transportation Infrastructure Improvement GARVEE Bond Councilmember Cheh at the Financing Temporary Amendment Act of 2013 request of the Mayor 2. Department of Corrections Central Cellblock Management Councilmember Wells at the Clarification Temporary Amendment Act of 2013 request of the Mayor IX. NEXT LEGISLATIVE MEETING: December 3, 2013 at 10:00 a.m., in the Council Chamber. 10


Vim documentation: scroll
main help file*scroll.txt* For Vim version 7.2. Last change: 2006 Aug 27 VIM REFERENCE MANUAL by Bram Moolenaar Scrolling *scrolling* These commands move the contents of the window. If the cursor position is moved off of the window, the cursor is moved onto the window (with 'scrolloff' screen lines around it). A page is the number of lines in the window minus two. The mnemonics for these commands may be a bit confusing. Remember that the commands refer to moving the window (the part of the buffer that you see) upwards or downwards in the buffer. When the window moves upwards in the buffer, the text in the window moves downwards on your screen. See section |03.7| of the user manual for an introduction. 1. Scrolling downwards |scroll-down| 2. Scrolling upwards |scroll-up| 3. Scrolling relative to cursor |scroll-cursor| 4. Scrolling horizontally |scroll-horizontal| 5. Scrolling synchronously |scroll-binding| 6. Scrolling with a mouse wheel |scroll-mouse-wheel|
1. Scrolling downwards *scroll-down* The following commands move the edit window (the part of the buffer that you see) downwards (this means that more lines downwards in the text buffer can be seen): *CTRL-E* CTRL-E Scroll window [count] lines downwards in the buffer. Mnemonic: Extra lines. *CTRL-D* CTRL-D Scroll window Downwards in the buffer. The number of lines comes from the 'scroll' option (default: half a screen). If [count] given, first set 'scroll' option to [count]. The cursor is moved the same number of lines down in the file (if possible; when lines wrap and when hitting the end of the file there may be a difference). When the cursor is on the last line of the buffer nothing happens and a beep is produced. See also 'startofline' option. {difference from vi: Vim scrolls 'scroll' screen lines, instead of file lines; makes a difference when lines wrap} <S-Down> or *<S-Down>* *<kPageDown>* <PageDown> or *<PageDown>* *CTRL-F* CTRL-F Scroll window [count] pages Forwards (downwards) in the buffer. See also 'startofline' option. When there is only one window the 'window' option might be used. *z+* z+ Without [count]: Redraw with the line just below the window at the top of the window. Put the cursor in that line, at the first non-blank in the line. With [count]: just like "z<CR>".
2. Scrolling upwards *scroll-up* The following commands move the edit window (the part of the buffer that you see) upwards (this means that more lines upwards in the text buffer can be seen): *CTRL-Y* CTRL-Y Scroll window [count] lines upwards in the buffer. Note: When using the MS-Windows key bindings CTRL-Y is remapped to redo. *CTRL-U* CTRL-U Scroll window Upwards in the buffer. The number of lines comes from the 'scroll' option (default: half a screen). If [count] given, first set the 'scroll' option to [count]. The cursor is moved the same number of lines up in the file (if possible; when lines wrap and when hitting the end of the file there may be a difference). When the cursor is on the first line of the buffer nothing happens and a beep is produced. See also 'startofline' option. {difference from vi: Vim scrolls 'scroll' screen lines, instead of file lines; makes a difference when lines wrap} <S-Up> or *<S-Up>* *<kPageUp>* <PageUp> or *<PageUp>* *CTRL-B* CTRL-B Scroll window [count] pages Backwards (upwards) in the buffer. See also 'startofline' option. When there is only one window the 'window' option might be used. *z^* z^ Without [count]: Redraw with the line just above the window at the bottom of the window. Put the cursor in that line, at the first non-blank in the line. With [count]: First scroll the text to put the [count] line at the bottom of the window, then redraw with the line which is now at the top of the window at the bottom of the window. Put the cursor in that line, at the first non-blank in the line.
3. Scrolling relative to cursor *scroll-cursor* The following commands reposition the edit window (the part of the buffer that you see) while keeping the cursor on the same line: *z<CR>* z<CR> Redraw, line [count] at top of window (default cursor line). Put cursor at first non-blank in the line. *zt* zt Like "z<CR>", but leave the cursor in the same column. {not in Vi} *zN<CR>* z{height}<CR> Redraw, make window {height} lines tall. This is useful to make the number of lines small when screen updating is very slow. Cannot make the height more than the physical screen height. *z.* z. Redraw, line [count] at center of window (default cursor line). Put cursor at first non-blank in the line. *zz* zz Like "z.", but leave the cursor in the same column. Careful: If caps-lock is on, this commands becomes "ZZ": write buffer and exit! {not in Vi} *z-* z- Redraw, line [count] at bottom of window (default cursor line). Put cursor at first non-blank in the line. *zb* zb Like "z-", but leave the cursor in the same column. {not in Vi}
4. Scrolling horizontally *scroll-horizontal* For the following four commands the cursor follows the screen. If the character that the cursor is on is moved off the screen, the cursor is moved to the closest character that is on the screen. The value of 'sidescroll' is not used. z<Right> or *zl* *z<Right>* zl Move the view on the text [count] characters to the right, thus scroll the text [count] characters to the left. This only works when 'wrap' is off. {not in Vi} z<Left> or *zh* *z<Left>* zh Move the view on the text [count] characters to the left, thus scroll the text [count] characters to the right. This only works when 'wrap' is off. {not in Vi} *zL* zL Move the view on the text half a screenwidth to the right, thus scroll the text half a screenwidth to the left. This only works when 'wrap' is off. {not in Vi} *zH* zH Move the view on the text half a screenwidth to the left, thus scroll the text half a screenwidth to the right. This only works when 'wrap' is off. {not in Vi} For the following two commands the cursor is not moved in the text, only the text scrolls on the screen. *zs* zs Scroll the text horizontally to position the cursor at the start (left side) of the screen. This only works when 'wrap' is off. {not in Vi} *ze* ze Scroll the text horizontally to position the cursor at the end (right side) of the screen. This only works when 'wrap' is off. {not in Vi}
5. Scrolling synchronously *scroll-binding* Occasionally, it is desirable to bind two or more windows together such that when one window is scrolled, the other windows are scrolled also. In Vim, windows can be given this behavior by setting the (window-specific) 'scrollbind' option. When a window that has 'scrollbind' set is scrolled, all other 'scrollbind' windows are scrolled the same amount, if possible. The behavior of 'scrollbind' can be modified by the 'scrollopt' option. When using the scrollbars, the binding only happens when scrolling the window with focus (where the cursor is). You can use this to avoid scroll-binding for a moment without resetting options. When a window also has the 'diff' option set, the scroll-binding uses the differences between the two buffers to synchronize the position precisely. Otherwise the following method is used. *scrollbind-relative* Each 'scrollbind' window keeps track of its "relative offset," which can be thought of as the difference between the current window's vertical scroll position and the other window's vertical scroll position. When one of the 'scrollbind' windows is asked to vertically scroll past the beginning or end limit of its text, the window no longer scrolls, but remembers how far past the limit it wishes to be. The window keeps this information so that it can maintain the same relative offset, regardless of its being asked to scroll past its buffer's limits. However, if a 'scrollbind' window that has a relative offset that is past its buffer's limits is given the cursor focus, the other 'scrollbind' windows must jump to a location where the current window's relative offset is valid. This behavior can be changed by clearing the 'jump' flag from the 'scrollopt' option. *syncbind* *:syncbind* *:sync* :syncbind Force all 'scrollbind' windows to have the same relative offset. I.e., when any of the 'scrollbind' windows is scrolled to the top of its buffer, all of the 'scrollbind' windows will also be at the top of their buffers. *scrollbind-quickadj* The 'scrollbind' flag is meaningful when using keyboard commands to vertically scroll a window, and also meaningful when using the vertical scrollbar of the window which has the cursor focus. However, when using the vertical scrollbar of a window which doesn't have the cursor focus, 'scrollbind' is ignored. This allows quick adjustment of the relative offset of 'scrollbind' windows.
6. Scrolling with a mouse wheel *scroll-mouse-wheel* When your mouse has a scroll wheel, it should work with Vim in the GUI. How it works depends on your system. It might also work in an xterm |xterm-mouse-wheel|. For the Win32 GUI the scroll action is hard coded. It works just like dragging the scrollbar of the current window. How many lines are scrolled depends on your mouse driver. If the scroll action causes input focus problems, see |intellimouse-wheel-problems|. For the X11 GUIs (Motif, Athena and GTK) scrolling the wheel generates key presses <MouseDown> and <MouseUp>. The default action for these keys are: <MouseDown> scroll three lines down. *<MouseDown>* <S-MouseDown> scroll a full page down. *<S-MouseDown>* <C-MouseDown> scroll a full page down. *<C-MouseDown>* <MouseUp> scroll three lines up. *<MouseUp>* <S-MouseUp> scroll a full page up. *<S-MouseUp>* <C-MouseUp> scroll a full page up. *<C-MouseUp>* This should work in all modes, except when editing the command line. Note that <MouseDown> is used for scrolling the text down, this happens when you turn the mouse wheel up! You can modify this behavior by mapping the keys. For example, to make the scroll wheel move one line or half a page in Normal mode: :map <MouseDown> <C-Y> :map <S-MouseDown> <C-U> :map <MouseUp> <C-E> :map <S-MouseUp> <C-D> You can also use Alt and Ctrl modifiers. This only works when Vim gets the scroll wheel events, of course. You can check if this works with the "xev" program. When using XFree86, the /etc/XF86Config file should have the correct entry for your mouse. For FreeBSD, this entry works for a Logitech scrollmouse: Protocol "MouseMan" Device "/dev/psm0" ZAxisMapping 4 5 See the XFree86 documentation for information. *xterm-mouse-wheel* To use the mouse wheel in a new xterm you only have to make the scroll wheel work in your Xserver, as mentioned above. To use the mouse wheel in an older xterm you must do this: 1. Make it work in your Xserver, as mentioned above. 2. Add translations for the xterm, so that the xterm will pass a scroll event to Vim as an escape sequence. 3. Add mappings in Vim, to interpret the escape sequences as <MouseUp> or <MouseDown> keys. You can do the translations by adding this to your ~.Xdefaults file (or other file where your X resources are kept): XTerm*VT100.Translations: #override \n\ s<Btn4Down>: string("0x9b") string("[64~") \n\ s<Btn5Down>: string("0x9b") string("[65~") \n\ <Btn4Down>: string("0x9b") string("[62~") \n\ <Btn5Down>: string("0x9b") string("[63~") \n\ <Btn4Up>: \n\ <Btn5Up>: Add these mappings to your vimrc file: :map <M-Esc>[62~ <MouseDown> :map! <M-Esc>[62~ <MouseDown> :map <M-Esc>[63~ <MouseUp> :map! <M-Esc>[63~ <MouseUp> :map <M-Esc>[64~ <S-MouseDown> :map! <M-Esc>[64~ <S-MouseDown> :map <M-Esc>[65~ <S-MouseUp> :map! <M-Esc>[65~ <S-MouseUp> top - main help file


Base class for Widget which provides functionality to connect signals based on their name.
More...
#include <TGUI/Signal.hpp>
|
| template<typename Func , typename... Args, typename std::enable_if< std::is_convertible< Func, std::function< void(const Args &...)>>::value >::type * = nullptr> |
| unsigned int | connect (std::string signalName, Func &&handler, const Args &...args) |
| | Connects a signal handler that will be called when this signal is emitted. More...
|
| |
| template<typename Func , typename... BoundArgs, typename std::enable_if< std::is_convertible< Func, std::function< void(const BoundArgs &..., std::shared_ptr< Widget >, const std::string &)>>::value >::type * = nullptr> |
| unsigned int | connect (std::string signalName, Func &&handler, BoundArgs &&...args) |
| | Connects a signal handler that will be called when this signal is emitted. More...
|
| |
| template<typename Func , typename... BoundArgs, typename std::enable_if<!std::is_convertible< Func, std::function< void(const BoundArgs &...)>>::value &&!std::is_convertible< Func, std::function< void(const BoundArgs &..., std::shared_ptr< Widget >, const std::string &)>>::value >::type * = nullptr> |
| unsigned int | connect (std::string signalName, Func &&handler, BoundArgs &&...args) |
| | Connects a signal handler that will be called when this signal is emitted. More...
|
| |
| template<typename Func , typename... BoundArgs> |
| unsigned int | connect (std::initializer_list< std::string > signalNames, Func &&handler, BoundArgs &&...args) |
| | Connect a signal handler to multiple signals. More...
|
| |
| bool | disconnect (unsigned int id) |
| | Disconnects a signal handler. More...
|
| |
| void | disconnectAll (std::string signalName) |
| | Disconnects all signal handler from a certain signal. More...
|
| |
|
void | disconnectAll () |
| | Disconnects all signal handlers from signals.
|
| |
|
|
virtual Signal & | getSignal (std::string signalName)=0 |
| | Retrieves a signal based on its name.
|
| |
Base class for Widget which provides functionality to connect signals based on their name.
template<typename Func , typename... Args, typename std::enable_if< std::is_convertible< Func, std::function< void(const Args &...)>>::value >::type * >
| unsigned int tgui::SignalWidgetBase::connect |
( |
std::string |
signalName, |
|
|
Func && |
handler, |
|
|
const Args &... |
args |
|
) |
| |
Connects a signal handler that will be called when this signal is emitted.
- Parameters
-
| signalName | Name of the signal |
| handler | Callback function that is given the extra arguments provided to this function as arguments |
| args | Optional extra arguments to pass to the signal handler when the signal is emitted |
- Returns
- Unique id of the connection
template<typename Func , typename... BoundArgs, typename std::enable_if<!std::is_convertible< Func, std::function< void(const BoundArgs &...)>>::value &&!std::is_convertible< Func, std::function< void(const BoundArgs &..., std::shared_ptr< Widget >, const std::string &)>>::value >::type * >
| unsigned int tgui::SignalWidgetBase::connect |
( |
std::string |
signalName, |
|
|
Func && |
handler, |
|
|
BoundArgs &&... |
args |
|
) |
| |
Connects a signal handler that will be called when this signal is emitted.
- Parameters
-
| signalName | Name of the signal |
| handler | Callback function that is given a pointer to the widget, the name of the signal and the extra arguments provided to this function as arguments |
| args | Optional extra arguments to pass to the signal handler when the signal is emitted |
- Returns
- Unique id of the connection
template<typename Func , typename... BoundArgs, typename std::enable_if<!std::is_convertible< Func, std::function< void(const BoundArgs &...)>>::value &&!std::is_convertible< Func, std::function< void(const BoundArgs &..., std::shared_ptr< Widget >, const std::string &)>>::value >::type * = nullptr>
| unsigned int tgui::SignalWidgetBase::connect |
( |
std::string |
signalName, |
|
|
Func && |
handler, |
|
|
BoundArgs &&... |
args |
|
) |
| |
Connects a signal handler that will be called when this signal is emitted.
- Parameters
-
| signalName | Name of the signal |
| handler | Callback function |
| args | Optional extra arguments to pass to the signal handler when the signal is emitted |
- Returns
- Unique id of the connection
template<typename Func , typename... BoundArgs>
| unsigned int tgui::SignalWidgetBase::connect |
( |
std::initializer_list< std::string > |
signalNames, |
|
|
Func && |
handler, |
|
|
BoundArgs &&... |
args |
|
) |
| |
Connect a signal handler to multiple signals.
- Parameters
-
| signalNames | List of signal names that will trigger the signal handler |
| handler | Callback function |
| args | Optional extra arguments to pass to the signal handler when the signal is emitted |
- Returns
- Unique id of the last connection. When passing e.g. 2 signal names, the first signal will correspond to id-1.
| bool tgui::SignalWidgetBase::disconnect |
( |
unsigned int |
id | ) |
|
Disconnects a signal handler.
- Parameters
-
- Returns
- True when a connection with this id existed and was removed
| void tgui::SignalWidgetBase::disconnectAll |
( |
std::string |
signalName | ) |
|
Disconnects all signal handler from a certain signal.
- Parameters
-
| signalName | Name of the signal |
The documentation for this class was generated from the following files:
- C:/Program Files (x86)/Jenkins/workspace/TGUI/include/TGUI/Signal.hpp
- C:/Program Files (x86)/Jenkins/workspace/TGUI/include/TGUI/SignalImpl.hpp


--- layout: paper title: Publications --- Programming with a Differentiable Forth Interpreter, , arXiv preprint arXiv:1605.06640 2016 [pdf]
@article{bosnjak2016programming, journal={arXiv preprint arXiv:1605.06640}, month={May}, year={2016}, author={Bosnjak, Matko and Rocktaschel, Tim and Naradowsky, Jason and Riedel, Sebastian}, title={Programming with a Differentiable Forth Interpreter}, }


Jinja Template Example
{# This is how to put comments in Jinja templates #}
{# Rendering a literals/expressions #}
Welcome {{ user }}
Example of using loops and conditions with Jinja
{% for key, value in random_dict.items() %}
{{ key }} : {{ value }}
{% endfor %}