vignettes/edgarWebR.Rmd
edgarWebR.Rmd
There are plenty of packages for R that allow for fetching and manipulation of companies’ financial data, often fetching that direct from public filings with the SEC. All of these packages have the goal of getting to the XBRL data, containing financial statements, typically in annual (10-K) or quarterly (10-Q) filings.
SEC filings however contain far more information. edgarWebR is the first step in accessing that data by providing an interface to the SEC EDGAR search tools and the metadata they provide.
Using information about filings, we can use edgarWebR to see how long after the close of a financial period it takes for a company to make a filing. We can also see how that time has changed.
First, we’ll fetch a bunch of 10-K and 10-Q filings for our given company using company_filings()
. To make sure we’re going far enough back we’ll take a peak at the tail of our results
ticker <- "EA"
filings <- company_filings(ticker, type = "10-", count = 100)
initial_count <- nrow(filings)
# Specifying the type provides all forms that start with 10-, so we need to
# manually filter.
filings <- filings[filings$type == "10-K" | filings$type == "10-Q", ]
Note that explicitly filtering caused us to go from 98 to 94 rows.
filings$md_href <- paste0("[Link](", filings$href, ")")
knitr::kable(tail(filings)[, c("type", "filing_date", "accession_number", "size",
"md_href")],
col.names = c("Type", "Filing Date", "Accession No.", "Size", "Link"),
digits = 2,
format.args = list(big.mark = ","))
| Type | Filing Date | Accession No. | Size | Link | |
|---|---|---|---|---|---|
| 92 | 10-Q | 1996-08-14 |<PHONE_NUMBER>-96-000615 | 72 KB | Link |
| 93 | 10-K | 1996-07-01 |<PHONE_NUMBER>-96-013563 | 197 KB | Link |
| 94 | 10-Q | 1996-02-14 |<PHONE_NUMBER>-96-002551 | 85 KB | Link |
| 95 | 10-Q | 1995-11-14 |<PHONE_NUMBER>-95-009843 | 83 KB | Link |
| 96 | 10-Q | 1995-08-10 |<PHONE_NUMBER>-95-006218 | 142 KB | Link |
| 98 | 10-Q | 1995-02-13 |<PHONE_NUMBER>-95-000644 | 83 KB | Link |
We’ve received filings dating back to 1995 which seems good enough for our purposes, so next we’ll get the filing information for each filing.
So far we’ve done everything in base R, but now we’ll use some useful functions from dplyr and purrr to make things a bit easier.
# this can take a while - we're fetching ~100 html files!
filing_infos <- map_df(filings$href, filing_information)
filings <- bind_cols(filings, filing_infos)
filings$filing_delay <- filings$filing_date - filings$period_date
# Take a peak at the data
knitr::kable(head(filings) %>% select(type, filing_date, period_date,
filing_delay, documents, bytes) %>%
mutate(filing_delay = as.numeric(filing_delay)),
col.names = c("Type", "Filing Date", "Period Date", "Delay",
"Documents", "Size (B)"),
digits = 2,
format.args = list(big.mark = ","))
| Type | Filing Date | Period Date | Delay | Documents | Size (B) |
|---|---|---|---|---|---|
| 10-Q | 2018-08-08 | 2018-06-30 | 39.00 | 102 | 12,517,185 |
| 10-K | 2018-05-23 | 2018-03-31 | 53.00 | 129 | 15,691,834 |
| 10-Q | 2018-02-06 | 2017-12-31 | 37.00 | 94 | 11,486,015 |
| 10-Q | 2017-11-07 | 2017-09-30 | 38.04 | 88 | 9,961,835 |
| 10-Q | 2017-08-08 | 2017-06-30 | 39.00 | 87 | 8,947,076 |
| 10-K | 2017-05-24 | 2017-03-31 | 54.00 | 127 | 14,944,223 |
Now our data is arranged, we can run some summary statistics and plot using ggplot2.
knitr::kable(filings %>%
group_by(type) %>% summarize(
n = n(),
avg_delay = as.numeric(mean(filing_delay)),
median_delay = as.numeric(median(filing_delay)),
avg_size = mean(bytes / 1024),
avg_docs = mean(documents)
),
col.names = c("Type", "Count", "Avg. Delay", "Median Delay",
"Avg. Size", "Avg. Docs"),
digits = 2,
format.args = list(big.mark = ","))
| Type | Count | Avg. Delay | Median Delay | Avg. Size | Avg. Docs |
|---|---|---|---|---|---|
| 10-K | 23 | 67.33 | 60.00 | 7,217.39 | 26.83 |
| 10-Q | 71 | 39.94 | 39.04 | 4,702.52 | 17.61 |
No surprise, yearly filings (10-K’s) are larger and take more time than quarterly filings (10-K’s). Lets see how the times are distributed:
ggplot(filings, aes(x = factor(type), y = filing_delay)) +
geom_violin() + geom_jitter(height = 0, width = 0.1) +
labs(x = "Filing Date", y = "Filing delay (days)")
#> Don't know how to automatically pick scale for object of type difftime. Defaulting to continuous.
We can also examine how the filing delay has changed over time:
ggplot(filings, aes(x = filing_date, y = filing_delay, group = type, color = type)) +
geom_point() + geom_line() +
labs(x = "Filing Type", y = "Filing delay (days)")
#> Don't know how to automatically pick scale for object of type difftime. Defaulting to continuous.
Whether because of some internal change or change to SEC rules, the time between the end of the fiscal year and the 10-K has dropped quite a bit, though there is still a bit of variation.
An interesting extension would be to compare the filing delays to the company’s stock price, overall market performance and other companies to see if there are particular drivers to the pattern.
ggplot(filings, aes(x = filing_date, y = bytes / 1024, group = type, color = type)) +
geom_point() + geom_line() +
labs(x = "Filing Type", y = "Filing Size (KB)")
The jump in size ~2010 is the requirement for inclusion of financial datafiles starting, but there is still interesting variations.
The SEC contains a wealth of information and we’re only scratching the surface. edgarWebR itself has a lot more functionality than what we’ve explored here and there is more coming.
edgarWebR is available from CRAN, so can be simply installed via
install.packages("edgarWebR")
If you want the latest and greatest, you can get a copy of the development version from github by using devtools:
# install.packages("devtools")
devtools::install_github("mwaldstein/edgarWebR")


ZIM Frame Tag mode (without dimensions)
This template shows how to place a DIMENSIONLESS Canvas in an HTML element with a specified tag ID (holder in this case). ZIM Frame will make the Canvas with an id the same as the holder tag but with the word Canvas added to the end. The stage size will be set to the holder tag dimensions - the content is not scaled so you need to size / scale items with code (like in Full mode).
Frame uses appendChild() to add the canvas tag to the specified element. offsetWidth and offsetHeight are used to measure the element and values are updated in the resize event. CSS overflow:hidden is used to show the canvas only in the element.


Home
About This Website
About The Developer
Contact The Developer
{{#list_info}}
Best Selling Books in {{list_name}} this week
{{/list_info}}
Rank
Title
Author
Weeks On List
Link
{{#books}}
{{rank}}
{{title}}
{{author}}
{{weeks_on_list}}
Amazon
{{/books}}
Go back


Interested in Contributing?
- Check out available resources.
- Create an account and start submitting your own systems.
Scored Systems
| System | Submitter | System Notes | Constraint | Run Notes | BLEU | BLEU (11b) | BLEU-cased | BLEU-cased (11b) | TER | z BLEU-cased-norm | zz BEER 2.0 | zzz CharactTER |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| RWTH-Jane2-HPBT-constrained (Details) | mhuck RWTH Aachen University |
RWTH Aachen University English-to-French Jane 2 hierarchical phrase-based system (constrained, with LDC Gigaword) | no | Constrained, with French Gigaword Second Edition |
29.6 |
29.6 |
28.6 |
28.6 |
0.609 |
|||
| KIT Phrase-Based SMT System (Details) | niehues KIT |
no | Primary Submission with Gigaword and GigaCorpus |
29.6 |
29.6 |
28.5 |
28.5 |
0.601 |
||||
| jhu-hiero (Details) | jhu2012 Johns Hopkins University |
no |
26.8 |
26.8 |
24.7 |
24.7 |
0.639 |
|||||
| uk-dan-moses (Details) | zeman Charles University in Prague, ┌FAL |
no | secondary; not for manual evaluation; normalized; constrained; s.evaluator.4d4a0aeb.20120311-1959; A:en-lemma-fr-lemma C:news-europarl-v7.fr-en DEV:wmt10v6b LM:news-commentary-v7.fr+europarl-v7.fr+news.ALL.fr LMO:6 S:en T:fr TST:wmt12v6b; 0.2897 [0.2834,0.2965] |
26.3 |
26.3 |
25.1 |
25.1 |
0.642 |
||||
| uk-dan-moses (Details) | zeman Charles University in Prague, ┌FAL |
no | secondary; not for manual evaluation; normalized; constrained; s.evaluator.86f2b388.20120303-2201; SRCAUG=en+stc,TGTAUG=fr+stc,PARA=news-europarl-v7.fr-en,MONO=news-commentary-v7.fr+europarl-v7.fr+news.2011.fr; better detokenization; 0.2863 [0.2803,0.2929] |
26.0 |
26.0 |
24.8 |
24.8 |
0.647 |
||||
| uk-dan-moses (Details) | zeman Charles University in Prague, ┌FAL |
no | primary; unnormalized; constrained; s.evaluator.4d4a0aeb.20120311-1959; A:en-lemma-fr-lemma C:news-europarl-v7.fr-en DEV:wmt10v6b LM:news-commentary-v7.fr+europarl-v7.fr+news.ALL.fr LMO:6 S:en T:fr TST:wmt12v6b; 0.2897 [0.2834,0.2965] |
24.5 |
24.5 |
23.4 |
23.4 |
0.648 |
||||
| uk-dan-moses (Details) | zeman Charles University in Prague, ┌FAL |
no | primary; unnormalized; constrained; s.evaluator.86f2b388.20120303-2201; SRCAUG=en+stc,TGTAUG=fr+stc,PARA=news-europarl-v7.fr-en,MONO=news-commentary-v7.fr+europarl-v7.fr+news.2011.fr; better detokenization; 0.2863 [0.2803,0.2929] |
24.2 |
24.2 |
23.2 |
23.2 |
0.653 |
||||
| uk-dan-moses (Details) | zeman Charles University in Prague, ┌FAL |
no | secondary; not for manual evaluation; normalized; constrained; s.evaluator.ad2c48a2.20120302-1929 DONE 0.2857 28.57▒0.64 A:SRCAUG=en+stc,TGTAUG=fr+stc,PARA=news-europarl-v7.fr-en,MONO=news.2011.fr DECt0-0 news-commentary-v7.fr-en+europarl-v7.fr-en/en+lemma news-commentary-v7.fr-en+europarl-v7.fr-en/fr+lemma news-europarl-v7.fr-en.en-lemma-fr-lemma news.2011.fr+fr+stc.6 news.2011.fr/fr+stc |
22.0 |
22.0 |
21.1 |
21.1 |
0.732 |
||||
| Its-LATL (Details) | LATLGeneva LATL - University of Geneva |
Rule-based MT system | no | Primary Run. |
21.8 |
21.8 |
20.9 |
20.9 |
0.684 |
|||
| uk-dan-moses (Details) | zeman Charles University in Prague, ┌FAL |
no | primary; unnormalized; constrained; s.evaluator.ad2c48a2.20120302-1929 DONE 0.2857 28.57▒0.64 A:SRCAUG=en+stc,TGTAUG=fr+stc,PARA=news-europarl-v7.fr-en,MONO=news.2011.fr DECt0-0 news-commentary-v7.fr-en+europarl-v7.fr-en/en+lemma news-commentary-v7.fr-en+europarl-v7.fr-en/fr+lemma news-europarl-v7.fr-en.en-lemma-fr-lemma news.2011.fr+fr+stc.6 news.2011.fr/fr+stc |
20.9 |
20.9 |
20.0 |
20.0 |
0.732 |
||||
| LIMSI-Ncode-Contrast-withoutSOUL (Details) | allauzen LIMSI-CNRS |
Baseline system based on N-code only | no |
failed |
28.9 |
failed |
27.8 |
0.615 |
||||
| LIMSI-Ncode-Constrained-Primary (Details) | allauzen LIMSI-CNRS |
an open source statistical machine translation system based on bilingual n-grams. | no | Primary submission: N-best rescoring with SOUL Translation Model and target LM. |
failed |
29.9 |
failed |
28.8 |
0.605 |
|||
| LIMSI-Ncode-Contrast-SoulLM-only (Details) | allauzen LIMSI-CNRS |
an open source statistical machine translation system based on bilingual n-grams. | no | Constrast: N-best rescoring with SOUL target LM only. |
failed |
29.8 |
failed |
28.7 |
0.608 |
|||
| LIUM EN-FR '12 (Details) | LIUM LIUM, University of Le Mans |
Available bitexts filtered based on cross-entropy (Moore and Lewis), plus synthetic bitexts, phrase-based Moses system | no | Baseline system with CSLM rescoring |
failed |
29.1 |
failed |
28.1 |
0.617 |
|||
| PROMT DeepHybrid (Details) | Alexander Molchanov PROMT LLC |
PROMT DeepHybrid is the first version of PROMT hybrid system. The system is based on PROMT RBMT-engine combined with LM-selection and statistical post-editing. | no | hybrid; automatically extracted dictionary from Ep+NC+UN; post-editing trained on Ep+NC+UN; |
failed |
24.8 |
failed |
23.8 |
0.640 |
|||
| LIMSI-Ncode-Contrast-SoulTM-only (Details) | allauzen LIMSI-CNRS |
an open source statistical machine translation system based on bilingual n-grams. | no | N-best rescoring with SOUL Translation Model only. |
failed |
29.9 |
failed |
28.8 |
0.606 |
|||
| LIMSI-OnTheFly (Details) | allauzen LIMSI-CNRS |
no |
failed |
28.6 |
failed |
27.6 |
0.616 |
|||||
| uedin-wmt12-en-fr (Details) | Edinburgh University of Edinburgh |
no | 1191-1 Moses system. Trained on europarl, news-commentary and 20% of combined UN and giga, selected with modified Moore-Lewis. LM on all WMT data, trained on each corpus and interpolated. Tuned with mert bagging on news2008-10. |
failed |
29.1 |
failed |
28.0 |
0.614 |


Model Class
In EmberData a Model
is a class defining the attributes and relationships
of a specific resource type
(model name). In this sense it represents a static "schema".
Data for individual resources fetched from your API is presented
to the UI via instances of the Model
s you define.
An instantiated Model
is refered to as a record
.
When we refer to the ModelClass
we are referring to the class definition
and the static schema methods present on it.
When we refer to a record
we refer to a specific class instance presenting
the resource data for a given type
and id
.
Defining a Model
import Model, { attr, belongsTo, hasMany } from '@ember-data/model';
export default Model.extend({
name: attr(),
dog: belongsTo('pet', { inverse: 'owners', async: false }),
friends: hasMany('person', { inverse: 'friends', async: true }),
});
modelName convention
By convention, the name of a given model (its type
) matches the name
of the file in the app/models
folder and should be lowercase, singular
and dasherized.
Item Index
Methods
- _debugInfo
- _notifyProperties
- belongsTo
- changedAttributes
- create static
- deleteRecord
- destroyRecord
- eachAttribute static
- eachRelatedType static
- eachRelationship static
- eachRelationship
- eachTransformedAttribute static
- hasMany
- inverseFor static
- reload
- rollbackAttributes
- save
- send
- serialize
- toJSON
- toString static
- transitionTo
- trigger
- typeForRelationship static
- unloadRecord
Properties
- _internalModel
- adapterError
- attributes static
- currentState
- data deprecated
- dirtyType
- errors
- fields static
- hasDirtyAttributes
- id
- isDeleted
- isEmpty
- isError
- isLoaded
- isLoading
- isNew
- isReloading
- isSaving
- isValid
- modelName static
- recordData
- relatedTypes static
- relationshipNames static
- relationships static
- relationshipsByName static
- store
- transformedAttributes static
Methods
_debugInfo
()
private
Provides info about the model for debugging purposes by grouping the properties into more semantic groups.
Meant to be used by debugging tools such as the Chrome Ember Extension.
- Groups all attributes in "Attributes" group.
- Groups all belongsTo relationships in "Belongs To" group.
- Groups all hasMany relationships in "Has Many" group.
- Groups all flags in "Flags" group.
- Flags relationship CPs as expensive properties.
_notifyProperties
()
private
belongsTo
-
name
Get the reference for the specified belongsTo relationship.
Example
import Model, { belongsTo } from '@ember-data/model';
export default Model.extend({
user: belongsTo({ async: true })
});
let blog = store.push({
data: {
type: 'blog',
id: 1,
relationships: {
user: {
data: { type: 'user', id: 1 }
}
}
}
});
let userRef = blog.belongsTo('user');
// check if the user relationship is loaded
let isLoaded = userRef.value() !== null;
// get the record of the reference (null if not yet available)
let user = userRef.value();
// get the identifier of the reference
if (userRef.remoteType() === "id") {
let id = userRef.id();
} else if (userRef.remoteType() === "link") {
let link = userRef.link();
}
// load user (via store.findRecord or store.findBelongsTo)
userRef.load().then(...)
// or trigger a reload
userRef.reload().then(...)
// provide data for reference
userRef.push({
type: 'user',
id: 1,
attributes: {
username: "@user"
}
}).then(function(user) {
userRef.value() === user;
});
Parameters:
-
name
Stringof the relationship
Returns:
reference for this relationship
changedAttributes
()
Object
Returns an object, whose keys are changed properties, and value is an [oldProp, newProp] array.
The array represents the diff of the canonical state with the local state of the model. Note: if the model is created locally, the canonical state is empty since the adapter hasn't acknowledged the attributes yet:
Example
import Model, { attr } from '@ember-data/model';
export default Model.extend({
name: attr('string'),
isAdmin: attr('boolean', {
defaultValue: false
})
});
let mascot = store.createRecord('mascot');
mascot.changedAttributes(); // {}
mascot.set('name', 'Tomster');
mascot.changedAttributes(); // { name: [undefined, 'Tomster'] }
mascot.set('isAdmin', true);
mascot.changedAttributes(); // { isAdmin: [undefined, true], name: [undefined, 'Tomster'] }
mascot.save().then(function() {
mascot.changedAttributes(); // {}
mascot.set('isAdmin', false);
mascot.changedAttributes(); // { isAdmin: [true, false] }
});
Returns:
an object, whose keys are changed properties, and value is an [oldProp, newProp] array.
create
()
private
static
Create should only ever be called by the store. To create an instance of a
Model
in a dirty state use store.createRecord
.
To create instances of Model
in a clean state, use store.push
deleteRecord
()
Marks the record as deleted but does not save it. You must call
save
afterwards if you want to persist it. You might use this
method if you want to allow the user to still rollbackAttributes()
after a delete was made.
Example
import Route from '@ember/routing/route';
export default Route.extend({
actions: {
softDelete() {
this.get('controller.model').deleteRecord();
},
confirm() {
this.get('controller.model').save();
},
undo() {
this.get('controller.model').rollbackAttributes();
}
}
});
destroyRecord
-
options
Same as deleteRecord
, but saves the record immediately.
Example
import Route from '@ember/routing/route';
export default Route.extend({
actions: {
delete() {
this.get('controller.model').destroyRecord().then(function() {
controller.transitionToRoute('model.index');
});
}
}
});
If you pass an object on the adapterOptions
property of the options
argument it will be passed to your adapter via the snapshot
record.destroyRecord({ adapterOptions: { subscribe: false } });
import MyCustomAdapter from './custom-adapter';
export default MyCustomAdapter.extend({
deleteRecord(store, type, snapshot) {
if (snapshot.adapterOptions.subscribe) {
// ...
}
// ...
}
});
Parameters:
-
options
Object
Returns:
a promise that will be resolved when the adapter returns successfully or rejected if the adapter returns with an error.
eachAttribute
-
callback
-
[binding]
Iterates through the attributes of the model, calling the passed function on each attribute.
The callback method you provide should have the following signature (all parameters are optional):
function(name, meta);
name
the name of the current property in the iterationmeta
the meta object for the attribute property in the iteration
Note that in addition to a callback, you can also pass an optional target
object that will be set as this
on the context.
Example
import Model, { attr } from '@ember-data/model';
let Person = Model.extend({
firstName: attr('string'),
lastName: attr('string'),
birthday: attr('date')
});
Person.eachAttribute(function(name, meta) {
console.log(name, meta);
});
// prints:
// firstName {type: "string", isAttribute: true, options: Object, parentType: function, name: "firstName"}
// lastName {type: "string", isAttribute: true, options: Object, parentType: function, name: "lastName"}
// birthday {type: "date", isAttribute: true, options: Object, parentType: function, name: "birthday"}
Parameters:
-
callback
FunctionThe callback to execute
-
[binding]
Object optionalthe value to which the callback's
this
should be bound
eachRelatedType
-
callback
-
binding
Given a callback, iterates over each of the types related to a model, invoking the callback with the related type's class. Each type will be returned just once, regardless of how many different relationships it has with a model.
Parameters:
-
callback
Functionthe callback to invoke
-
binding
Anythe value to which the callback's
this
should be bound
eachRelationship
-
callback
-
binding
Given a callback, iterates over each of the relationships in the model, invoking the callback with the name of each relationship and its relationship descriptor.
Parameters:
-
callback
Functionthe callback to invoke
-
binding
Anythe value to which the callback's
this
should be bound
eachRelationship
-
callback
-
binding
Given a callback, iterates over each of the relationships in the model, invoking the callback with the name of each relationship and its relationship descriptor.
The callback method you provide should have the following signature (all parameters are optional):
function(name, descriptor);
name
the name of the current property in the iterationdescriptor
the meta object that describes this relationship
The relationship descriptor argument is an object with the following properties.
- key String the name of this relationship on the Model
- kind String "hasMany" or "belongsTo"
- options Object the original options hash passed when the relationship was declared
- parentType Model the type of the Model that owns this relationship
- type String the type name of the related Model
Note that in addition to a callback, you can also pass an optional target
object that will be set as this
on the context.
Example
import JSONSerializer from '@ember-data/serializer/json';
export default JSONSerializer.extend({
serialize: function(record, options) {
let json = {};
record.eachRelationship(function(name, descriptor) {
if (descriptor.kind === 'hasMany') {
let serializedHasManyName = name.toUpperCase() + '_IDS';
json[serializedHasManyName] = record.get(name).mapBy('id');
}
});
return json;
}
});
Parameters:
-
callback
Functionthe callback to invoke
-
binding
Anythe value to which the callback's
this
should be bound
eachTransformedAttribute
-
callback
-
[binding]
Iterates through the transformedAttributes of the model, calling the passed function on each attribute. Note the callback will not be called for any attributes that do not have an transformation type.
The callback method you provide should have the following signature (all parameters are optional):
function(name, type);
name
the name of the current property in the iterationtype
a string containing the name of the type of transformed applied to the attribute
Note that in addition to a callback, you can also pass an optional target
object that will be set as this
on the context.
Example
import Model, { attr } from '@ember-data/model';
let Person = Model.extend({
firstName: attr(),
lastName: attr('string'),
birthday: attr('date')
});
Person.eachTransformedAttribute(function(name, type) {
console.log(name, type);
});
// prints:
// lastName string
// birthday date
Parameters:
-
callback
FunctionThe callback to execute
-
[binding]
Object optionalthe value to which the callback's
this
should be bound
hasMany
-
name
Get the reference for the specified hasMany relationship.
Example
import Model, { hasMany } from '@ember-data/model';
export default Model.extend({
comments: hasMany({ async: true })
});
let blog = store.push({
data: {
type: 'blog',
id: 1,
relationships: {
comments: {
data: [
{ type: 'comment', id: 1 },
{ type: 'comment', id: 2 }
]
}
}
}
});
let commentsRef = blog.hasMany('comments');
// check if the comments are loaded already
let isLoaded = commentsRef.value() !== null;
// get the records of the reference (null if not yet available)
let comments = commentsRef.value();
// get the identifier of the reference
if (commentsRef.remoteType() === "ids") {
let ids = commentsRef.ids();
} else if (commentsRef.remoteType() === "link") {
let link = commentsRef.link();
}
// load comments (via store.findMany or store.findHasMany)
commentsRef.load().then(...)
// or trigger a reload
commentsRef.reload().then(...)
// provide data for reference
commentsRef.push([{ type: 'comment', id: 1 }, { type: 'comment', id: 2 }]).then(function(comments) {
commentsRef.value() === comments;
});
Parameters:
-
name
Stringof the relationship
Returns:
reference for this relationship
inverseFor
-
name
-
store
Find the relationship which is the inverse of the one asked for.
For example, if you define models like this:
import Model, { hasMany } from '@ember-data/model';
export default Model.extend({
comments: hasMany('message')
});
store.modelFor('post').inverseFor('comments', store) // { type: App.Message, name: 'owner', kind: 'belongsTo' }
store.modelFor('message').inverseFor('owner', store) // { type: App.Post, name: 'comments', kind: 'hasMany' }
Returns:
the inverse relationship, or null
reload
-
options
Reload the record from the adapter.
This will only work if the record has already finished loading.
Example
import Route from '@ember/routing/route';
export default Route.extend({
actions: {
reload() {
this.controller.get('model').reload().then(function(model) {
// do something with the reloaded model
});
}
}
});
Parameters:
-
options
Objectoptional, may include
adapterOptions
hash which will be passed to adapter request
Returns:
a promise that will be resolved with the record when the adapter returns successfully or rejected if the adapter returns with an error.
rollbackAttributes
()
If the model hasDirtyAttributes
this function will discard any unsaved
changes. If the model isNew
it will be removed from the store.
Example
record.get('name'); // 'Untitled Document'
record.set('name', 'Doc 1');
record.get('name'); // 'Doc 1'
record.rollbackAttributes();
record.get('name'); // 'Untitled Document'
save
-
options
Save the record and persist any changes to the record to an external source via the adapter.
Example
record.set('name', 'Tomster');
record.save().then(function() {
// Success callback
}, function() {
// Error callback
});
If you pass an object using the adapterOptions
property of the options
argument it will be passed to your adapter via the snapshot.
record.save({ adapterOptions: { subscribe: false } });
import MyCustomAdapter from './custom-adapter';
export default MyCustomAdapter.extend({
updateRecord(store, type, snapshot) {
if (snapshot.adapterOptions.subscribe) {
// ...
}
// ...
}
});
Parameters:
-
options
Object
Returns:
a promise that will be resolved when the adapter returns successfully or rejected if the adapter returns with an error.
serialize
-
options
Create a JSON representation of the record, using the serialization strategy of the store's adapter.
serialize
takes an optional hash as a parameter, currently
supported options are:
includeId
:true
if the record's ID should be included in the JSON representation.
Parameters:
-
options
Object
Returns:
an object whose values are primitive JSON values only
toJSON
-
options
Use JSONSerializer to get the JSON representation of a record.
toJSON
takes an optional hash as a parameter, currently
supported options are:
includeId
:true
if the record's ID should be included in the JSON representation.
Parameters:
-
options
Object
Returns:
A JSON representation of the object.
toString
()
static
Returns the name of the model class.
trigger
-
name
Override the default event firing from Ember.Evented to also call methods with the given name.
Parameters:
-
name
String
typeForRelationship
-
name
-
store
For a given relationship name, returns the model type of the relationship.
For example, if you define a model like this:
import Model, { hasMany } from '@ember-data/model';
export default Model.extend({
comments: hasMany('comment')
});
Calling store.modelFor('post').typeForRelationship('comments', store)
will return Comment
.
Returns:
the type of the relationship, or undefined
unloadRecord
()
Unloads the record from the store. This will not send a delete request to your server, it just unloads the record from memory.
Properties
_internalModel
Object
private
adapterError
AdapterError
This property holds the AdapterError
object with which
last adapter operation was rejected.
attributes
Map
static
A map whose keys are the attributes of the model (properties described by attr) and whose values are the meta object for the property.
Example
import Model, { attr } from '@ember-data/model';
export default Model.extend({
firstName: attr('string'),
lastName: attr('string'),
birthday: attr('date')
});
import Ember from 'ember';
import Person from 'app/models/person';
let attributes = Ember.get(Person, 'attributes')
attributes.forEach(function(meta, name) {
console.log(name, meta);
});
// prints:
// firstName {type: "string", isAttribute: true, options: Object, parentType: function, name: "firstName"}
// lastName {type: "string", isAttribute: true, options: Object, parentType: function, name: "lastName"}
// birthday {type: "date", isAttribute: true, options: Object, parentType: function, name: "birthday"}
currentState
Object
private
data
Object
deprecated
private
dirtyType
String
If the record is in the dirty state this property will report what kind of change has caused it to move into the dirty state. Possible values are:
created
The record has been created by the client and not yet saved to the adapter.updated
The record has been updated by the client and not yet saved to the adapter.deleted
The record has been deleted by the client and not yet saved to the adapter.
Example
let record = store.createRecord('model');
record.get('dirtyType'); // 'created'
errors
Errors
When the record is in the invalid
state this object will contain
any errors returned by the adapter. When present the errors hash
contains keys corresponding to the invalid property names
and values which are arrays of Javascript objects with two keys:
message
A string containing the error message from the backendattribute
The name of the property associated with this error message
record.get('errors.length'); // 0
record.set('foo', 'invalid value');
record.save().catch(function() {
record.get('errors').get('foo');
// [{message: 'foo should be a number.', attribute: 'foo'}]
});
The errors
property us useful for displaying error messages to
the user.
Username: {{input value=username}}
{{#each model.errors.username as |error|}}

{{error.message}}

{{/each}}
Email: {{input value=email}}
{{#each model.errors.email as |error|}}

{{error.message}}

{{/each}}
You can also access the special messages
property on the error
object to get an array of all the error strings.
{{#each model.errors.messages as |message|}}

{{message}}

{{/each}}
fields
Map
static
A map whose keys are the fields of the model and whose values are strings describing the kind of the field. A model's fields are the union of all of its attributes and relationships.
For example:
import Model, { attr, belongsTo, hasMany } from '@ember-data/model';
export default Model.extend({
users: hasMany('user'),
owner: belongsTo('user'),
posts: hasMany('post'),
title: attr('string')
});
import Ember from 'ember';
import Blog from 'app/models/blog';
let fields = Ember.get(Blog, 'fields');
fields.forEach(function(kind, field) {
console.log(field, kind);
});
// prints:
// users, hasMany
// owner, belongsTo
// posts, hasMany
// title, attribute
hasDirtyAttributes
Boolean
If this property is true
the record is in the dirty
state. The
record has local changes that have not yet been saved by the
adapter. This includes records that have been created (but not yet
saved) or deleted.
Example
let record = store.createRecord('model');
record.get('hasDirtyAttributes'); // true
store.findRecord('model', 1).then(function(model) {
model.get('hasDirtyAttributes'); // false
model.set('foo', 'some value');
model.get('hasDirtyAttributes'); // true
});
id
String
All ember models have an id property. This is an identifier managed by an external source. These are always coerced to be strings before being used internally. Note when declaring the attributes for a model it is an error to declare an id attribute.
let record = store.createRecord('model');
record.get('id'); // null
store.findRecord('model', 1).then(function(model) {
model.get('id'); // '1'
});
isDeleted
Boolean
If this property is true
the record is in the deleted
state
and has been marked for deletion. When isDeleted
is true and
hasDirtyAttributes
is true, the record is deleted locally but the deletion
was not yet persisted. When isSaving
is true, the change is
in-flight. When both hasDirtyAttributes
and isSaving
are false, the
change has persisted.
Example
let record = store.createRecord('model');
record.get('isDeleted'); // false
record.deleteRecord();
// Locally deleted
record.get('isDeleted'); // true
record.get('hasDirtyAttributes'); // true
record.get('isSaving'); // false
// Persisting the deletion
let promise = record.save();
record.get('isDeleted'); // true
record.get('isSaving'); // true
// Deletion Persisted
promise.then(function() {
record.get('isDeleted'); // true
record.get('isSaving'); // false
record.get('hasDirtyAttributes'); // false
});
isEmpty
Boolean
If this property is true
the record is in the empty
state. Empty is the first state all records enter after they have
been created. Most records created by the store will quickly
transition to the loading
state if data needs to be fetched from
the server or the created
state if the record is created on the
client. A record can also enter the empty state if the adapter is
unable to locate the record.
isError
Boolean
If true
the adapter reported that it was unable to save local
changes to the backend for any reason other than a server-side
validation error.
Example
record.get('isError'); // false
record.set('foo', 'valid value');
record.save().then(null, function() {
record.get('isError'); // true
});
isLoaded
Boolean
If this property is true
the record is in the loaded
state. A
record enters this state when its data is populated. Most of a
record's lifecycle is spent inside substates of the loaded
state.
Example
let record = store.createRecord('model');
record.get('isLoaded'); // true
store.findRecord('model', 1).then(function(model) {
model.get('isLoaded'); // true
});
isLoading
Boolean
If this property is true
the record is in the loading
state. A
record enters this state when the store asks the adapter for its
data. It remains in this state until the adapter provides the
requested data.
isNew
Boolean
If this property is true
the record is in the new
state. A
record will be in the new
state when it has been created on the
client and the adapter has not yet report that it was successfully
saved.
Example
let record = store.createRecord('model');
record.get('isNew'); // true
record.save().then(function(model) {
model.get('isNew'); // false
});
isReloading
Boolean
If true
the store is attempting to reload the record from the adapter.
Example
record.get('isReloading'); // false
record.reload();
record.get('isReloading'); // true
isSaving
Boolean
If this property is true
the record is in the saving
state. A
record enters the saving state when save
is called, but the
adapter has not yet acknowledged that the changes have been
persisted to the backend.
Example
let record = store.createRecord('model');
record.get('isSaving'); // false
let promise = record.save();
record.get('isSaving'); // true
promise.then(function() {
record.get('isSaving'); // false
});
isValid
Boolean
If this property is true
the record is in the valid
state.
A record will be in the valid
state when the adapter did not report any
server-side validation failures.
modelName
String
static
Represents the model's class name as a string. This can be used to look up the model's class name through
Store
's modelFor method.
modelName
is generated for you by Ember Data. It will be a lowercased, dasherized string.
For example:
store.modelFor('post').modelName; // 'post'
store.modelFor('blog-post').modelName; // 'blog-post'
The most common place you'll want to access modelName
is in your serializer's payloadKeyFromModelName
method. For example, to change payload
keys to underscore (instead of dasherized), you might use the following code:
import RESTSerializer from '@ember-data/serializer/rest';
import { underscore } from '@ember/string';
export default const PostSerializer = RESTSerializer.extend({
payloadKeyFromModelName(modelName) {
return underscore(modelName);
}
});
recordData
Undefined (reserved)
private
relationshipNames
Object
static
A hash containing lists of the model's relationships, grouped by the relationship kind. For example, given a model with this definition:
import Model, { belongsTo, hasMany } from '@ember-data/model';
export default Model.extend({
users: hasMany('user'),
owner: belongsTo('user'),
posts: hasMany('post')
});
This property would contain the following:
import Ember from 'ember';
import Blog from 'app/models/blog';
let relationshipNames = Ember.get(Blog, 'relationshipNames');
relationshipNames.hasMany;
//=> ['users', 'posts']
relationshipNames.belongsTo;
//=> ['owner']
relationships
Map
static
The model's relationships as a map, keyed on the type of the relationship. The value of each entry is an array containing a descriptor for each relationship with that type, describing the name of the relationship as well as the type.
For example, given the following model definition:
import Model, { belongsTo, hasMany } from '@ember-data/model';
export default Model.extend({
users: hasMany('user'),
owner: belongsTo('user'),
posts: hasMany('post')
});
This computed property would return a map describing these relationships, like this:
import Ember from 'ember';
import Blog from 'app/models/blog';
import User from 'app/models/user';
import Post from 'app/models/post';
let relationships = Ember.get(Blog, 'relationships');
relationships.get('user');
//=> [ { name: 'users', kind: 'hasMany' },
// { name: 'owner', kind: 'belongsTo' } ]
relationships.get('post');
//=> [ { name: 'posts', kind: 'hasMany' } ]
relationshipsByName
Map
static
A map whose keys are the relationships of a model and whose values are relationship descriptors.
For example, given a model with this definition:
import Model, { belongsTo, hasMany } from '@ember-data/model';
export default Model.extend({
users: hasMany('user'),
owner: belongsTo('user'),
posts: hasMany('post')
});
This property would contain the following:
import Ember from 'ember';
import Blog from 'app/models/blog';
let relationshipsByName = Ember.get(Blog, 'relationshipsByName');
relationshipsByName.get('users');
//=> { key: 'users', kind: 'hasMany', type: 'user', options: Object, isRelationship: true }
relationshipsByName.get('owner');
//=> { key: 'owner', kind: 'belongsTo', type: 'user', options: Object, isRelationship: true }
store
Unknown
transformedAttributes
Map
static
A map whose keys are the attributes of the model (properties described by attr) and whose values are type of transformation applied to each attribute. This map does not include any attributes that do not have an transformation type.
Example
import Model, { attr } from '@ember-data/model';
export default Model.extend({
firstName: attr(),
lastName: attr('string'),
birthday: attr('date')
});
import Ember from 'ember';
import Person from 'app/models/person';
let transformedAttributes = Ember.get(Person, 'transformedAttributes')
transformedAttributes.forEach(function(field, type) {
console.log(field, type);
});
// prints:
// lastName string
// birthday date
Events
becameError
Fired when the record enters the error state.
becameInvalid
Fired when the record becomes invalid.
didCreate
Fired when a new record is commited to the server.
didDelete
Fired when the record is deleted.
didLoad
Fired when the record is loaded from the server.
didUpdate
Fired when the record is updated.
ready
Fired when the record is ready to be interacted with, that is either loaded from the server or created locally.
rolledBack
Fired when the record is rolled back.


Delete track
Parameters:
Time
{{route.time}}
Distance
{{route.distance}}
Average Speed
{{route.avg_speed}} min/Km
RANKING
User
Time
{{$index+1}}
{{rank.username}}
{{rank.time}}


DfE enquiries
Central newsdesk 020 7783 8300
General enquiries 0370 000 2288
Press release
The government announces a new accountability system that will help ensure all children are literate and numerate.
An ambitious new accountability system will raise standards across the board because of its high expectations and its focus on the progress made by every child from age 4 to 19, the government announced today.
Schools Minister David Laws said it was right that schools and colleges would be held accountable for ensuring every child is able to read and write well, and has good maths skills. This will mean all young people leave education with the skills needed to compete for apprenticeships, places at leading universities and good jobs, helping to build a stronger economy and a fairer society.
He added that the new system of measuring performance was much fairer on schools and colleges, would expose both underperforming and coasting schools, and would mean all pupils received the attention they deserved to achieve to their full potential.
Across primary and secondary schools, and into post-16 education, the higher standards will be underpinned by more rigorous tests and qualifications, a high quality of teaching for all pupils, and a strong focus on the key subjects of English and maths.
The new system will help:
All schools and colleges will also have to publish the essential information about their performance - giving parents an at-a-glance overview of the progress a school’s pupils make, and the grades they achieve.
Primary schools will show pupils’ progress from age 4 to 11 (compared to others with similar starting points in reception); what proportion reach the demanding new standard at age 11; how well pupils do on average at age 11; and what proportion of their pupils are rated ‘high achieving’.
Secondary schools will show pupils’ progress from age 11 to 16 (compared to others with the same results at age 11); what their pupils’ average grade is across 8 subjects; what proportion of their pupils achieve at least a C in English and maths; and what proportion of their pupils achieve the EBacc .
Colleges and school sixth forms will show students’ progress from GCSE to age 18 (compared to others with the same GCSE results) in academic subjects or Tech Levels (the new gold-standard technical qualifications that finally place vocational education on a par with A levels); what students’ average grade is in each category; the progress made by students who joined them without a C in English and/or maths; what proportion of their students drop out; and what proportion of their students go on to further study, a job or training at the end of their courses (when the data is robust enough).
The highly respected OECD is clear that the best education systems in the world are characterised by autonomy for schools and by strong accountability systems which highlight the performance of all providers and which give clear information to parents and young people.
Schools Minister David Laws said:
The new system will mean higher standards, no hiding place for under-performing schools and coasting schools, and real credit being given to schools and colleges which may have challenging intakes but which improve their pupils’ performance.
In primary schools, we are raising the bar to improve standards and introducing a proper measure of progress from when children start school to age 11. I want to see all children leaving primary school with a good standard of reading, writing and maths so that they can thrive at secondary school. A better start at secondary school is a better start in life.
We are also asking much more of secondary schools - they will need to ensure they teach a broad range of subjects, with a special focus on English and maths.
Colleges and school sixth forms will, for the first time, have to meet a range of demanding measures and show that they are getting their students into good jobs, further study or apprenticeships.
We must set high aspirations for all schools and their pupils - and I am confident that our brilliant heads and teachers will continue to meet the challenge we are setting them.
Russell Hobby, general secretary of the NAHT , said:
We are pleased that the government has engaged with the profession on this critical reform. We welcome the emphasis on progress as the defining measure of school performance and the recognition that there is more to primary education than preparing for secondary education; and, indeed, more to preparing for secondary school than tests in English and maths.
We welcome the retention of teaching assessment in writing and that test results for spelling, punctuation and grammar tests will be used to inform teaching rather than to hold schools to account. I believe the profession should take seriously the proposal to baseline performance in reception. The first 3 years of education are arguably the most important and they are currently ignored in the accountability framework, punishing those schools who serve the most challenging communities.
Brian Lightman, general secretary of ASCL , said:
ASCL welcomes the Department for Education’s intention to develop new accountability measures that are fair and comparable across different types of providers of post-16 education and training.
New measures that are consistent and similar across different types of provider will give students and parents a much better basis for making an informed choice, and can help us move towards a level playing field for inspection and holding institutions to account.
ASCL values the opportunity to offer views about the development of accountability measures, for 2016 and beyond.
Tim Sherriff, headteacher of Westfield Community Primary School, in Wigan, which has been rated outstanding in its last 2 Ofsted inspections and where more than 4 in 10 pupils are eligible for free school meals, one of the highest proportions in the country, said:
At Westfield we have extremely high expectations for all pupils regardless of their starting point as evidenced by the number of pupils we enter into the higher level assessments. The new bar is challenging for those schools whose intake is significantly below that of their peers nationally but the focus on progress means the value that a school adds to its pupils’ achievement is taken into account. I feel it is fair to assess the progress of pupils in comparison with others who had a similar starting point.
Helen Tyler, headteacher of St Joseph’s RC Primary School in Holborn, central London, which earlier this month was rated by Ofsted as outstanding, said:
It is my belief that the bar should be raised so that children are ready for and have a greater chance of success at secondary school, and improved life chances. Schools should be aiming for all children to make the necessary progress to attain highly. No child should be left behind.
I also agree that schools should publish their results on their website. Parents are entitled to know how well their child’s school is doing and how it compares to other schools.
Lubna Khan, headteacher of the outstanding-rated Berrymede Junior School in Ealing, west London, said:
An assessment at age 4 will give really important information to schools about the starting points of children. Schools will find this an extremely valuable element of the wider assessment they will continue to make of their reception class pupils to enable each child to develop.
It is very important that we, as a junior school, have very close links and a good dialogue with our feeder infants’ schools so we are fully aware of the children’s abilities when they join us at age 7, and that assessment practices are consistent across phases, not based on test results alone but supported by a wider range of evidence.
Judging schools on the progress their pupils make is fair. I also support higher expectations being set for 11-year-olds - it will help ensure that all children leave primary school ready for high school, and all schools should want to achieve that. With high-quality, excellent teaching, the support of parents and high ambitions, there should be no ceiling.
Chris Paterson, associate director of CentreForum, said:
Putting progress at the heart of each stage of the accountability system is a major step forward. By capturing the distance schools and colleges enable their pupils to travel, progress measures allow for fair and meaningful comparisons. Importantly, they also drive attention towards the performance of every pupil, which will particularly benefit disadvantaged pupils and promote social mobility.
At primary, a progress measure poses a challenge in that it requires an initial assessment. If this can be introduced in a positive and sensitive way however, it will allow the distinct advantages of a progress measure to benefit pupils. Accountability reform may not seem like the most exciting education reform of the coalition government, but it has the potential to be the most significant.
Professor Alison Wolf, of King’s College London, said:
I welcome the provision of a wide range of easy-to-understand indicators. The information will make it significantly easier for parents and students to identify the best post-16 provider for them.
Central newsdesk 020 7783 8300
General enquiries 0370 000 2288
Published: 27 March 2014


While watching Art-Attack's big picture ever wondered that you could get a chance to make the same??..This event is for all the artists out there who want to try something new, something they have never tried before, so pack your bags with everyday items like bed sheets, towels etc. and hit floor with all you have got
In this event, every team would be given a picture to imitate on the ground with the help of everyday things. The best they match the more the chance to win.
| Some samples of what and how to imitate | |
|---|---|
| Something like this but not this hard. |
"Survivors are not always the strongest;sometimes they're the smartest,but more often simply the luckiest." But how will you know that you are fortuitous enough???? Brace yourselves because you might need to put aside your moral,virtues & ego and jump into the arena. So wait with baited breath for the spectacle is about to unfold.This IMPRESSIONS'18 beg your luck,borrow your courage and steal the fame.
You have to register in a team. Maximum 3 members will be allowed in a team. During and after the avent, only the team leader will be the mediator between the team and organisers.


|
mlpack
1.0.12
|
Public Member Functions | |
| CosineTree (const arma::mat &dataset) | |
| CosineTree constructor for the root node of the tree. More... | |
| CosineTree (CosineTree &parentNode, const std::vector< size_t > &subIndices) | |
| CosineTree constructor for nodes other than the root node of the tree. More... | |
| CosineTree (const arma::mat &dataset, const double epsilon, const double delta) | |
| Construct the CosineTree and the basis for the given matrix, and passed 'epsilon' and 'delta' parameters. More... | |
| ~CosineTree () | |
| Destroy the cosine tree and all of its children (take care of the memory allocations too). More... | |
| void | BasisVector (arma::vec &bVector) |
| Set the basis vector of the node. More... | |
| arma::vec & | BasisVector () |
| Get the basis vector of the node. More... | |
| size_t | BinarySearch (arma::vec &cDistribution, double value, size_t start, size_t end) |
| Sample a column based on the cumulative Length-Squared distribution of the cosine node, and a randomly generated value in the range [0, 1]. More... | |
| void | CalculateCentroid () |
| Calculate centroid of the columns present in the node. More... | |
| void | CalculateCosines (arma::vec &cosines) |
| Calculate cosines of the columns present in the node, with respect to the sampled splitting point. More... | |
| arma::vec & | Centroid () |
| Get pointer to the centroid vector. More... | |
| size_t | ColumnSampleLS () |
| Sample a point from the Length-Squared distribution of the cosine node. More... | |
| void | ColumnSamplesLS (std::vector< size_t > &sampledIndices, arma::vec &probabilities, size_t numSamples) |
| Sample 'numSamples' points from the Length-Squared distribution of the cosine node. More... | |
| void | ConstructBasis (CosineNodeQueue &treeQueue) |
| Constructs the final basis matrix, after the cosine tree construction. More... | |
| void | CosineNodeSplit () |
| This function splits the cosine node into two children based on the cosines of the columns contained in the node, with respect to the sampled splitting point. More... | |
| double | FrobNormSquared () const |
| Get the Frobenius norm squared of columns in the node. More... | |
| const arma::mat & | GetDataset () const |
| Get pointer to the dataset matrix. More... | |
| void | GetFinalBasis (arma::mat &finalBasis) |
| Returns the basis of the constructed subspace. More... | |
| void | L2Error (const double error) |
| Set the Monte Carlo error. More... | |
| double | L2Error () const |
| Get the Monte Carlo error. More... | |
| CosineTree * | Left () |
| Get pointer to the left child of the node. More... | |
| void | ModifiedGramSchmidt (CosineNodeQueue &treeQueue, arma::vec ¢roid, arma::vec &newBasisVector, arma::vec *addBasisVector=NULL) |
| Calculates the orthonormalization of the passed centroid, with respect to the current vector subspace. More... | |
| double | MonteCarloError (CosineTree *node, CosineNodeQueue &treeQueue, arma::vec *addBasisVector1=NULL, arma::vec *addBasisVector2=NULL) |
| Estimates the squared error of the projection of the input node's matrix onto the current vector subspace. More... | |
| size_t | NumColumns () const |
| Get number of columns of input matrix in the node. More... | |
| CosineTree * | Right () |
| Get pointer to the right child of the node. More... | |
| size_t | SplitPointIndex () const |
| Get the column index of split point of the node. More... | |
| std::vector< size_t > & | VectorIndices () |
| Get the indices of columns in the node. More... | |
Private Attributes | |
| arma::mat | basis |
| Subspace basis of the input dataset. More... | |
| arma::vec | basisVector |
| Orthonormalized basis vector of the node. More... | |
| arma::vec | centroid |
| Centroid of columns of input matrix in the node. More... | |
| const arma::mat & | dataset |
| Matrix for which cosine tree is constructed. More... | |
| double | delta |
| Cumulative probability for Monte Carlo error lower bound. More... | |
| double | epsilon |
| Error tolerance fraction for calculated subspace. More... | |
| double | frobNormSquared |
| Frobenius norm squared of columns in the node. More... | |
| std::vector< size_t > | indices |
| Indices of columns of input matrix in the node. More... | |
| double | l2Error |
| Monte Carlo error for this node. More... | |
| arma::vec | l2NormsSquared |
| L2-norm squared of columns in the node. More... | |
| CosineTree * | left |
| Left child of the node. More... | |
| size_t | numColumns |
| Number of columns of input matrix in the node. More... | |
| CosineTree * | parent |
| Parent of the node. More... | |
| CosineTree * | right |
| Right child of the node. More... | |
| size_t | splitPointIndex |
| Index of split point of cosine node. More... | |
Definition at line 32 of file cosine_tree.hpp.
| mlpack::tree::CosineTree::CosineTree | ( | const arma::mat & | dataset | ) |
CosineTree constructor for the root node of the tree.
It initializes the necessary variables required for splitting of the node, and building the tree further. It takes a pointer to the input matrix and calculates the relevant variables using it.
| dataset | Matrix for which cosine tree is constructed. |
| mlpack::tree::CosineTree::CosineTree | ( | CosineTree & | parentNode, |
| const std::vector< size_t > & | subIndices | ||
| ) |
CosineTree constructor for nodes other than the root node of the tree.
It takes in a pointer to the parent node and a list of column indices which mentions the columns to be included in the node. The function calculate the relevant variables just like the constructor above.
| parentNode | Pointer to the parent cosine node. |
| subIndices | Pointer to vector of column indices to be included. |
| mlpack::tree::CosineTree::CosineTree | ( | const arma::mat & | dataset, |
| const double | epsilon, | ||
| const double | delta | ||
| ) |
Construct the CosineTree and the basis for the given matrix, and passed 'epsilon' and 'delta' parameters.
The CosineTree is constructed by splitting nodes in the direction of maximum error, stored using a priority queue. Basis vectors are added from the left and right children of the split node. The basis vector from a node is the orthonormalized centroid of its columns. The splitting continues till the Monte Carlo estimate of the input matrix's projection on the obtained subspace is less than a fraction of the norm of the input matrix.
| dataset | Matrix for which the CosineTree is constructed. |
| epsilon | Error tolerance fraction for calculated subspace. |
| delta | Cumulative probability for Monte Carlo error lower bound. |
| mlpack::tree::CosineTree::~CosineTree | ( | ) |
Destroy the cosine tree and all of its children (take care of the memory allocations too).
|
inline |
Set the basis vector of the node.
Definition at line 192 of file cosine_tree.hpp.
References basisVector.
|
inline |
Get the basis vector of the node.
Definition at line 195 of file cosine_tree.hpp.
References basisVector.
| size_t mlpack::tree::CosineTree::BinarySearch | ( | arma::vec & | cDistribution, |
| double | value, | ||
| size_t | start, | ||
| size_t | end | ||
| ) |
Sample a column based on the cumulative Length-Squared distribution of the cosine node, and a randomly generated value in the range [0, 1].
Binary search is more efficient than searching linearly for the same. This leads a significant speedup when there are large number of columns to choose from and when a number of samples are to be drawn from the distribution.
| cDistribution | Cumulative LS distibution of columns in the node. |
| value | Randomly generated value in the range [0, 1]. |
| start | Starting index of the distribution interval to search in. |
| end | Ending index of the distribution interval to search in. |
| void mlpack::tree::CosineTree::CalculateCentroid | ( | ) |
Calculate centroid of the columns present in the node.
The calculated centroid is used as a basis vector for the cosine tree being constructed.
| void mlpack::tree::CosineTree::CalculateCosines | ( | arma::vec & | cosines | ) |
Calculate cosines of the columns present in the node, with respect to the sampled splitting point.
The calculated cosine values are useful for splitting the node into its children.
| cosines | Vector to store the cosine values in. |
|
inline |
Get pointer to the centroid vector.
Definition at line 189 of file cosine_tree.hpp.
References centroid.
| size_t mlpack::tree::CosineTree::ColumnSampleLS | ( | ) |
Sample a point from the Length-Squared distribution of the cosine node.
The function uses 'l2NormsSquared' to calculate the cumulative probability distribution of the column vectors. The sampling is based on a randomly generated value in the range [0, 1].
| void mlpack::tree::CosineTree::ColumnSamplesLS | ( | std::vector< size_t > & | sampledIndices, |
| arma::vec & | probabilities, | ||
| size_t | numSamples | ||
| ) |
Sample 'numSamples' points from the Length-Squared distribution of the cosine node.
The function uses 'l2NormsSquared' to calculate the cumulative probability distribution of the column vectors. The sampling is based on a randomly generated values in the range [0, 1].
| void mlpack::tree::CosineTree::ConstructBasis | ( | CosineNodeQueue & | treeQueue | ) |
Constructs the final basis matrix, after the cosine tree construction.
| treeQueue | Priority queue of cosine nodes. |
| void mlpack::tree::CosineTree::CosineNodeSplit | ( | ) |
This function splits the cosine node into two children based on the cosines of the columns contained in the node, with respect to the sampled splitting point.
The function also calls the CosineTree constructor for the children.
|
inline |
Get the Frobenius norm squared of columns in the node.
Definition at line 207 of file cosine_tree.hpp.
References frobNormSquared.
|
inline |
Get pointer to the dataset matrix.
Definition at line 177 of file cosine_tree.hpp.
References dataset.
|
inline |
Returns the basis of the constructed subspace.
Definition at line 174 of file cosine_tree.hpp.
References basis.
|
inline |
Set the Monte Carlo error.
Definition at line 183 of file cosine_tree.hpp.
References l2Error.
Referenced by mlpack::tree::CompareCosineNode::operator()().
|
inline |
|
inline |
Get pointer to the left child of the node.
Definition at line 198 of file cosine_tree.hpp.
References left.
| void mlpack::tree::CosineTree::ModifiedGramSchmidt | ( | CosineNodeQueue & | treeQueue, |
| arma::vec & | centroid, | ||
| arma::vec & | newBasisVector, | ||
| arma::vec * | addBasisVector = NULL |
||
| ) |
Calculates the orthonormalization of the passed centroid, with respect to the current vector subspace.
| treeQueue | Priority queue of cosine nodes. |
| centroid | Centroid of the node being added to the basis. |
| newBasisVector | Orthonormalized centroid of the node. |
| addBasisVector | Address to additional basis vector. |
| double mlpack::tree::CosineTree::MonteCarloError | ( | CosineTree * | node, |
| CosineNodeQueue & | treeQueue, | ||
| arma::vec * | addBasisVector1 = NULL , |
||
| arma::vec * | addBasisVector2 = NULL |
||
| ) |
Estimates the squared error of the projection of the input node's matrix onto the current vector subspace.
A normal distribution is fit using weighted norms of projections of samples drawn from the input node's matrix columns. The error is calculated as the difference between the Frobenius norm of the input node's matrix and lower bound of the normal distribution.
| node | Node for which Monte Carlo estimate is calculated. |
| treeQueue | Priority queue of cosine nodes. |
| addBasisVector1 | Address to first additional basis vector. |
| addBasisVector2 | Address to second additional basis vector. |
|
inline |
Get number of columns of input matrix in the node.
Definition at line 204 of file cosine_tree.hpp.
References numColumns.
|
inline |
Get pointer to the right child of the node.
Definition at line 201 of file cosine_tree.hpp.
References right.
|
inline |
Get the column index of split point of the node.
Definition at line 210 of file cosine_tree.hpp.
References indices, and splitPointIndex.
|
inline |
Get the indices of columns in the node.
Definition at line 180 of file cosine_tree.hpp.
References indices.
|
private |
Subspace basis of the input dataset.
Definition at line 220 of file cosine_tree.hpp.
Referenced by GetFinalBasis().
|
private |
Orthonormalized basis vector of the node.
Definition at line 234 of file cosine_tree.hpp.
Referenced by BasisVector().
|
private |
Centroid of columns of input matrix in the node.
Definition at line 232 of file cosine_tree.hpp.
Referenced by Centroid().
|
private |
Matrix for which cosine tree is constructed.
Definition at line 214 of file cosine_tree.hpp.
Referenced by GetDataset().
|
private |
Cumulative probability for Monte Carlo error lower bound.
Definition at line 218 of file cosine_tree.hpp.
|
private |
Error tolerance fraction for calculated subspace.
Definition at line 216 of file cosine_tree.hpp.
|
private |
Frobenius norm squared of columns in the node.
Definition at line 242 of file cosine_tree.hpp.
Referenced by FrobNormSquared().
|
private |
Indices of columns of input matrix in the node.
Definition at line 228 of file cosine_tree.hpp.
Referenced by SplitPointIndex(), and VectorIndices().
|
private |
Monte Carlo error for this node.
Definition at line 240 of file cosine_tree.hpp.
Referenced by L2Error().
|
private |
L2-norm squared of columns in the node.
Definition at line 230 of file cosine_tree.hpp.
|
private |
|
private |
Number of columns of input matrix in the node.
Definition at line 238 of file cosine_tree.hpp.
Referenced by NumColumns().
|
private |
Parent of the node.
Definition at line 222 of file cosine_tree.hpp.
|
private |
|
private |
Index of split point of cosine node.
Definition at line 236 of file cosine_tree.hpp.
Referenced by SplitPointIndex().


Tom Brunner
Verona - Tom Brunner, age 48, of Verona, passed away on November 19, 2019.
He was born on April 5, 1971, in Madison, Wis.
Tom graduated from Memorial High School in 1989 and graduated from the University of Wisconsin-Madison School of Business with a degree in Marketing. He thoroughly enjoyed playing football and hockey and was good at both.
Tom worked at several jobs and was especially proud of his success in transforming the Copper Grid into the Grid Iron bar entertaining Badger fans, family and friends - he loved hosting parties both during and after college. He worked for 10 years as a tax consultant and office manager for H&R Block in Madison and most recently was successfully self-employed in construction. He was happiest when he was fishing and hunting and being with his friends. He thoroughly enjoyed his dogs Candy and Cody and missed them greatly when they were gone. Tom was outgoing and friendly with a great sense of humor. He loved his family and will be deeply missed.
Tom is survived by his parents, Neal (Joann) Brunner of Madison, Wis., and Elizabeth Brunner of Madison, Wis., his sister, Cathy (Bob, Jr.) Uecker and their daughter, Tom's niece, Emily Uecker, all of Milwaukee, Wis., his aunt, Bonnie Ackerman, of Madison, Wis., and many more aunts, uncles and cousins.
In lieu of flowers, if you wish, consider a donation to a charity of your choice.
Visitation will be held at CRESS FUNERAL HOME, 3610 Speedway Road, Madison, on Monday, November 25, 2019, from 5:00 p.m. to 7:00 p.m.
Burial will take place in Mankato, Minnesota at a later date.
Cress Funeral & Cremation Services
3610 Speedway Road
(608) 238-3434


Subject This month in KISS (#4)!
From Dylan Araps<EMAIL_ADDRESS>Date Mon, 3 Aug 2020 06:06:06 +0100
Welcome to month 4!
KISS is an independent Linux(R) distribution with a focus on simplicity and the
concept of less is more. See https://k1sslinux.org for more information.
[0.0] Index
________________________________________________________________________________
- c package manager [1.0]
- https://git.k1ss.org [2.0]
- libelf [3.0]
- libudev-zero [4.0]
- removal of .la files [5.0]
- package manager changes [6.0]
- neofetch 7.1.0 [7.0]
- gkiss [8.0]
- paleta [9.0]
[1.0] c package manager
________________________________________________________________________________
The C package manager is on hold and I will be revisiting it soon. The vision I
have for it has changed and I'd like to explore something slightly different.
Will have more to share about this later.
[2.0] https://git.k1ss.org
________________________________________________________________________________
KISS now has its own mirror of the repositories which live on GitHub. This
currently serves as backup for when GitHub goes down (or vice versa) which has
seemingly happened more and more since its acquisition.
As a user, feel free to set your git remotes here. Those wanting to avoid GitHub
in its entirety can send in patches via email if they like.
[3.0] libelf
________________________________________________________________________________
We have swapped libelf implementations from elftoolchain to elfutils.
In the past year we have swapped our libelf implementation twice, the most
recent swap occurring two days ago. This was just in time for Linux 5.8 as this
version cannot be built with elftoolchain libelf.
libelf is a library which lets you read, modify or create ELF files in an
architecture independent way. There are a few different implementations of this
library (some in development, others not).
The Linux kernel (from 4.14.12) makes use of this library when
CONFIG_UNWINDER_ORC or CONFIG_STACK_VALIDATION are enabled. The former requires
the latter so in any case, the latter controls this.
E5ten tracked the build failure to a difference in behavior between elftoolchain
and elfutils in the gelf_getsymshndx() function. elfutils allows the second
parameter to be NULL whereas elftoolchain does not.
The kernel build process happens to trigger this which causes build failure when
using elftoolchain's libelf.
Bug filed here: https://sourceforge.net/p/elftoolchain/tickets/593/
[4.0] libudev-zero
________________________________________________________________________________
libudev-zero is a daemonless, drop-in replacement for libudev written in C99.
This library enables the user to run the device manager of their choosing
without needing to worry about the udev dependency at all.
Development started just a month ago by illiliti, also known for
$/illiliti/tinyramfs and $/illiliti/kiss-encryption
[5.0] removal of .la files
________________________________________________________________________________
Packages will no longer install libtool's .la files.
These files contain descriptions of libraries for use by libtool and they
really aren't needed. Arch Linux got rid of them in 2005!
https://bbs.archlinux.org/viewtopic.php?id=14936
[6.0] package manager changes
________________________________________________________________________________
Here are the highlights, more in the commit log.
* Git sources now also pull down their submodules (if any exist).
* Arguments to 'kiss install' can now be relative.
* Added '$KISS_STRIP' to globally control binary stripping.
* Removed last Linux-specific pieces of code.
* Build files now modifiable in pre-build hooks.
* Fixed output bugs with post-install log.
[7.0] neofetch 7.1.0
________________________________________________________________________________
Today I released neofetch 7.1.0.
* Neofetch will now detect Ubuntu flavours (Xubuntu, etc) and show their logo.
* The latest macOS is now supported.
* Memory output unit can now be changed (KiB, MiB, GiB).
* Added es-shell support.
* Show -current or -release when using OpenBSD.
* Desktop environment output now shows version.
* ... see commits.
Thanks to everyone involved.
$/dylanaraps/neofetch/releases/tag/7.1.0
[8.0] gkiss
________________________________________________________________________________
GKISS (GNU KISS Linux) is an alternative rootfs and set of repositories for KISS
providing glibc instead of musl.
This is a great option for those needing glibc (and it can be run in a chroot
under musl too!).
https://depsterr.com/gkiss/
[9.0] paleta
________________________________________________________________________________
paleta is a tool I recently wrote in C which enables on-the-fly terminal
palette modification, independent of terminal emulator. This covers foreground,
background, cursor and colors 0-255.
A list of hex colors is passed via stdin to paleta, the input is morphed into
a set of escape sequences and sent to every running terminal in the
system + stdout. Every terminal's colorscheme is updated in realtime!
$/dylanaraps/paleta
________________________________________________________________________________
Dylan Araps (C) 2019-2020
kiss-community (C) 2020-2021
Dilyn Corner (C) 2021
Linux(R) is the registered trademark of Linus Torvalds in the U.S. and
other countries.


Weather Dashboard
Enter a city name to get today and this week's weather forecast!
Search
What's the weather like in.....?
5 Day Forecast:


--- layout: default ---
Chicago's weekly event to build, share & learn about civic tech
{{ post.description }}
{% endif %}
{{ post.date | date: "%b %-d, %Y" }} by
{{post.author}}
{% if post.author2 %}
, {{post.author2}}
{% endif %}
{{ post.description | markdownify }} Read more »
Join us every Tuesday from 6-10pm on the 8th floor of the Merchandise Mart to hear from amazing speakers, learn from each other and work on civic projects. Everyone is welcome!
We are a group of thousands of designers, academic researchers, data journalists, activists, policy wonks, web developers and curious citizens who want to make our city more just, equitable, transparent and delightful to live in through data, design and technology. More about us »
Chi Hack Night is a central hub for Chicago's civic tech community. Here's the three best ways to get involved:
1. Go to Chi Hack Night. We meet every Tuesday at 6pm
2. Subscribe to updates on upcoming speakers and events
3. Browse our weekly breakouts to find your group
Chi Hack Night is organized by Derek Eder, Emily Drevets, Katie O'Shea and members of our Leadership Council, hosted at Braintree and supported by our amazing sponsors. DataMade is the fiscal sponsor.
Is your organization interested in becoming a Chi Hack Night sponsor? Drop us a line!


| rigz.math: | Functions | Modinfo | Source |
| AngleDifference | Get the difference between 2 angles. |
| GetDirection | get the direction from 1 point to another. |
| GetDistance | The distance between 1 point and another. |
| GetNearestPowerOf2 | Round up to the nearest power of 2. |
| GetTexSize | Gets the texture size needed for an animation with a given size and number of frames. |
| Round | rounds a number to the nearest int. |
| TweenValues | Interpolate between 2 values. |
| Function AngleDifference:Float(Angle1:Float, Angle2:Float) | |
| Description | Get the difference between 2 angles. |
| Function GetDirection:Float(fromx:Float, fromy:Float, tox:Float, toy:Float) | |
| Returns | Angle of difference. |
| Description | get the direction from 1 point to another. |
| Information | Thanks to "Snarkbait" for this little code snippit. |
| Function GetDistance:Float(fromx:Float, fromy:Float, tox:Float, toy:Float, fast:Int = False) | |
| Returns | The distance between the 2 points. |
| Description | The distance between 1 point and another. |
| Function GetNearestPowerOf2:Int(n:Int) | |
| Description | Round up to the nearest power of 2. |
| Function GetTexSize(w:Int, h:Int, frames:Int, powersof2:Int = True, texwidth:Int Var, texheight:Int Var, Cols:Int Var, rows:Int Var) | |
| Returns | the texture width and height, along with the number of columns and rows of animation frames. |
| Description | Gets the texture size needed for an animation with a given size and number of frames. |
| Information | this function will ensure that the texture width and height remain in powers of 2. |
| Function Round:Int(v:Double) | |
| Returns | Rounded Int. |
| Description | rounds a number to the nearest int. |
| Function TweenValues:Float(oldValue:Float, value:Float, tween:Float) | |
| Description | Interpolate between 2 values. |
| Information | This is the function used to achieve render tweening by taking the old and new values and interpolating between the 2. |
| Author | Peter J. Rigby |
|---|---|
| Copyright | Peter J. Rigby 2009 |
| Purpose | A General Math Module |
| Version | v1 |


Slow down: Dutch cut max speed limit to rein in pollution
by The Associated Press, StaffTHE HAGUE, Netherlands -- The Dutch government is lowering the top speed limit on highways in a bid to put the brakes on emissions of the pollutant nitrogen oxide.
Prime Minister Mark Rutte announced Wednesday that the maximum speed limit will be cut from 130 kilometres per hour to 100 km/h (81-62 miles per hour) on many of the country's highways.
It was a climbdown for Rutte, whose conservative party is known as the "vroom vroom" party because of its support of motorists.
Rutte says he is "unbelievably unhappy that the 130 is disappearing."
The measure follows a Dutch Supreme Court decision in May that said the government's rules for granting permits to projects that emit nitrogen oxide breach European Union environmental law.
That led to a freeze on permits for many construction projects.


psychopy.SpatialSuppressMotion-v0¶
-
class
neurogym.envs.psychopy.spatialsuppressmotion.
SpatialSuppressMotion
(dt=8.3, win_kwargs={'size': (100, 100)}, timing={'stimulus': 300}, rewards=None)[source]¶ Spatial suppression motion task. This task is useful to study center-surround interaction in monkey MT and human psychophysical performance in motion perception.
Tha task is derived from (Tadin et al. Nature, 2003). In this task, there is no fixation or decision stage. We only present a stimulus and a subject needs to perform a 4-AFC motion direction judgement. The ground-truth is the probabilities for choosing the four directions at a given time point. The probabilities depend on stimulus contrast and size and the probabilities are derived from emprically measured human psychophysical performance.
- Parameters
<dt> – millisecs per image frame, default: 8.3 (given 120HZ monitor)
<win_size> – size per image frame
<timing> – millisecs, stimulus duration, default: 8.3 * 36 frames ~ 300 ms. This is the longest duration we need (i.e., probability reach ceilling)
Note that please input default seq_len = 36 frames when creating dataset object.
- Reference paper
Perceptual consequences of centre–surround antagonism in visual motion processing
- Tags
perceptual, tag-plaid, tag-motion, tag-center-surround
- Sample run
-
static
envelope
(time_sigma, frame_rate=120, cut_off=True, amplitude=128)[source]¶ envelope(time_sigma, frame_rate=120, cut_off=True):
Create a temporal profile and mv_length to motion stimulus in the spatial suppression task. This function is modified fron Duje Tadin’s code.
Not critical, we can use a square temporal profile
- Arg:
<time_sigma>: in secs, sigma of temporal envelope <frame_rate>: int, hz, monitor frame rate <cut_off>: default: True. Whether to cut <amplitude>: int, 128.
We return the tempora modulation <profile> and an int indicating <mv_length>.
This function is adoped from Duje Tadin. Some variables here are not clear.
-
getgroundtruth
(trial)[source]¶ The utility function to obtain ground truth probabilities for four direction
Input trial is a dict, contains fields <duration>, <contrast>, <diameter>, and <direction>.
We output a (4,) tuple indicate the probabilities to perceive left/right/up/down direction. This label comes from emprically measured human performance


{% extends "base.html" %} {% block heading %} Help {% endblock %} {% block subheading %} Frequently Asked Questions {% endblock %} {% block content %}
This is a group membership and permission management platform. In other words, we are an authorization service you can use to answer such questions as: who's in what groups, and what permissions do they have?
There haven't been many frequently asked questions yet, so this hasn't been filled out yet! Please see the admins of this site for help and links to any documentation that they might have already filled out.
{% endblock %}


Hi, I'm Benji.
I am a senior Computer Science student at Rensselaer Polytechnic Institute.
As someone that strongly believes in the power of technology and the
good that it can bring to society, I strive to consistently improve and
create software that can solve any problem I encounter.


Sweet Free Stuff
///////////////////////////////////////////
Free LOreal Age Perfect Hydra-Nutrition Sample
Posted: 11 Apr 2016 10:52 AM PDT
http://feedproxy.google.com/&edburner&utm_medium=email
Free L’Oreal Age Perfect Hydra-Nutrition Sample
The post Free L’Oreal Age Perfect Hydra-Nutrition Sample appeared first on
SweetFreeStuff.com.
///////////////////////////////////////////
Free Cheese Fondue at The Melting Pot
Posted: 11 Apr 2016 04:57 AM PDT
http://feedproxy.google.com/&edburner&utm_medium=email
First 25,000 to sign up will receive a free cheese fondue voucher valid
April 18 June 30, 2016. Free Cheese Fondue at The Melting Pot
The post Free Cheese Fondue at The Melting Pot appeared first on
SweetFreeStuff.com.
CommentsThank you Melting Pot. by DebI hope to win, so can try the melting
pot by Beth ClarkI love cheese . by Elnora Williams
///////////////////////////////////////////
Free Subscription to Family Fun Magazine
Posted: 11 Apr 2016 01:07 AM PDT
http://feedproxy.google.com/&edburner&utm_medium=email
The post Free Subscription to Family Fun Magazine appeared first on
SweetFreeStuff.com.
CommentsBoy do i need more ideas, lol. Would just love to have this. by
minkieWould like to try! by Sandra Nettles
///////////////////////////////////////////
Free Jumbo Honey Bun at Stripes Stores
Posted: 11 Apr 2016 12:00 AM PDT
http://feedproxy.google.com/&edburner&utm_medium=email
Free Jumbo Honey Bun at Stripes Stores Good through 4/12 Located in Texas,
Oklahoma, and New Mexico.
The post Free Jumbo Honey Bun at Stripes Stores appeared first on
SweetFreeStuff.com.
///////////////////////////////////////////
Free Sample of Zing Zero Calorie Stevia Sweetener
Posted: 10 Apr 2016 11:25 PM PDT
http://feedproxy.google.com/&edburner&utm_medium=email
Free Sample of Zing Zero Calorie Stevia Sweetener Link
Zing Zero Calorie Stevia Sweetener Link #2
The post Free Sample of Zing Zero Calorie Stevia Sweetener appeared first
on SweetFreeStuff.com.
CommentsGot my samples and used them in coffee. Pretty good. by
coolTHISwould love to try by faith robinsonPlease l would like to get free
sample of each item to try the … by Ruby
///////////////////////////////////////////
Free Nivea Lotion Samples
Posted: 10 Apr 2016 10:05 PM PDT
http://feedproxy.google.com/&edburner&utm_medium=email
Free Samples of Nivea Cocoa Butter and Nourishing In-Shower Body Lotion.
Free Nivea Lotion Samples
The post Free Nivea Lotion Samples appeared first on SweetFreeStuff.com.
Commentsbeen really wanting to try by jenniferLove theire line of producte
by Darlene KingWanting to try this by NikkiYes ready to try this by Beth
ClarkI have been wanting to try this. by PuntPlus 4 more…


|
|
@@ -503,6 +503,88 @@ public struct ${Self}<Element> |
|
%end
|
|
%end
|
|
}
|
|
}
|
|
|
|
|
|
|
|
+ @warn_unused_result
|
|
|
|
+ public func index(after i: Int) -> Int {
|
|
|
|
+ // NOTE: this is a manual specialization of index movement for a Strideable
|
|
|
|
+ // index that is required for Array performance. The optimizer is not
|
|
|
|
+ // capable of creating partial specializations yet.
|
|
|
|
+ // NOTE: Range checks are not performed here, because it is done later by
|
|
|
|
+ // the subscript function.
|
|
|
|
+ return i + 1
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ public func formIndex(after i: inout Int) {
|
|
|
|
+ // NOTE: this is a manual specialization of index movement for a Strideable
|
|
|
|
+ // index that is required for Array performance. The optimizer is not
|
|
|
|
+ // capable of creating partial specializations yet.
|
|
|
|
+ // NOTE: Range checks are not performed here, because it is done later by
|
|
|
|
+ // the subscript function.
|
|
|
|
+ i += 1
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ @warn_unused_result
|
|
|
|
+ public func index(before i: Int) -> Int {
|
|
|
|
+ // NOTE: this is a manual specialization of index movement for a Strideable
|
|
|
|
+ // index that is required for Array performance. The optimizer is not
|
|
|
|
+ // capable of creating partial specializations yet.
|
|
|
|
+ // NOTE: Range checks are not performed here, because it is done later by
|
|
|
|
+ // the subscript function.
|
|
|
|
+ return i - 1
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ public func formIndex(before i: inout Int) {
|
|
|
|
+ // NOTE: this is a manual specialization of index movement for a Strideable
|
|
|
|
+ // index that is required for Array performance. The optimizer is not
|
|
|
|
+ // capable of creating partial specializations yet.
|
|
|
|
+ // NOTE: Range checks are not performed here, because it is done later by
|
|
|
|
+ // the subscript function.
|
|
|
|
+ i -= 1
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ @warn_unused_result
|
|
|
|
+ public func index(_ i: Int, offsetBy n: Int) -> Int {
|
|
|
|
+ // NOTE: this is a manual specialization of index movement for a Strideable
|
|
|
|
+ // index that is required for Array performance. The optimizer is not
|
|
|
|
+ // capable of creating partial specializations yet.
|
|
|
|
+ // NOTE: Range checks are not performed here, because it is done later by
|
|
|
|
+ // the subscript function.
|
|
|
|
+ return i + n
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ @warn_unused_result
|
|
|
|
+ public func index(
|
|
|
|
+ _ i: Int, offsetBy n: Int, limitedBy limit: Int
|
|
|
|
+ ) -> Int? {
|
|
|
|
+ // NOTE: this is a manual specialization of index movement for a Strideable
|
|
|
|
+ // index that is required for Array performance. The optimizer is not
|
|
|
|
+ // capable of creating partial specializations yet.
|
|
|
|
+ // NOTE: Range checks are not performed here, because it is done later by
|
|
|
|
+ // the subscript function.
|
|
|
|
+ let l = limit - i
|
|
|
|
+ if n > 0 ? l >= 0 && l < n : l <= 0 && n < l {
|
|
|
|
+ return nil
|
|
|
|
+ }
|
|
|
|
+ return i + n
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ @warn_unused_result
|
|
|
|
+ public func distance(from start: Int, to end: Int) -> Int {
|
|
|
|
+ // NOTE: this is a manual specialization of index movement for a Strideable
|
|
|
|
+ // index that is required for Array performance. The optimizer is not
|
|
|
|
+ // capable of creating partial specializations yet.
|
|
|
|
+ // NOTE: Range checks are not performed here, because it is done later by
|
|
|
|
+ // the subscript function.
|
|
|
|
+ return end - start
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ public func _failEarlyRangeCheck(_ index: Int, bounds: Range<Int>) {
|
|
|
|
+ // NOTE: This method is a no-op for performance reasons.
|
|
|
|
+ }
|
|
|
|
+
|
|
|
|
+ public func _failEarlyRangeCheck(_ range: Range<Int>, bounds: Range<Int>) {
|
|
|
|
+ // NOTE: This method is a no-op for performance reasons.
|
|
|
|
+ }
|
|
|
|
+
|
|
public typealias Indices = CountableRange<Int>
|
|
public typealias Indices = CountableRange<Int>
|
|
|
|
|
|
%{
|
|
%{
|
|
|
|


{% extends "base.html" %} {% block title %}Starter Template{% endblock %} {% block body %}
Use this document as a way to quickly start any new project. All you get is this text and a mostly barebones HTML document.


Warehouse Chief Natools:
Yes... Peace can be achieved through both centralized authority and the harmony of diversity...
However, history shows that words like "order" and "peace" can be used to justify tyranny.
On the other hand, words like "harmony" and "diversity" may only be ideals impossible to achieve in reality...
"I will make my decision now."


We don't use server redirects as we use Struts request forwarding. One place the issue is happening in a JSP that uses JSTL's c:import tag to import an absolute URL to a HTML page perfectly accessible on the server (via iis) and also on browser request. Like I say, a Tomcat restart fixes these problems for a short while. Allistair. -----Original Message----- From: Ben Souther [mailto:[EMAIL PROTECTED] Sent: Mon 22/11/2004 18:38 To: Tomcat Users List Cc: Subject: RE: Server redirected too many times (20)
And you've verified that there are no circular references caused by response.sendRedirect calls? On Mon, 2004-11-22 at 13:34, Allistair Crossley wrote: > Hi Yoav, > > We run on Windows 2000, the concept of sym links aren't there. It's right across our HTML content (which is loaded from file system via IIS for security) blah.. so I do not think it will be this. Further, a Tomcat restart fixes it for a short while. > > Cheers, Allistair > > -----Original Message----- > From: Shapira, Yoav [mailto:[EMAIL PROTECTED] > Sent: Mon 22/11/2004 18:20 > To: Tomcat Users List > Cc: > Subject: RE: Server redirected too many times (20) > > > > > Hi, > Are you sure it's not a recursive symbolic link issue? Check to make > sure that in recent days no one modified symbolic links throughout your > installation such that they redirect to each other. > > Yoav Shapira http://www.yoavshapira.com > > > >-----Original Message----- > >From: Allistair Crossley [mailto:[EMAIL PROTECTED] > >Sent: Monday, November 22, 2004 1:14 PM > >To: Tomcat Users List; Tomcat Users List; Dakota Jack > >Subject: Server redirected too many times (20) > > > >Hi All, > > > >We upgraded to Java 5 and Tomcat 5.5.4 last week having tested it out > on > >our test server without any apparent problems. > > > >However, we are noticing an awful lots of errors of the following > nature, > >and I wanted to know if it is likely that something in Tomcat 5.5.4 > could > >be involved, as our 5.0.28 installation was used for some months > without > >issue. > > > >java.net.ProtocolException: Server redirected too many times (20) > > > >Although people across the web cite authentication problems, I would be > >happier if we had always had this problem rather than after a > Java/Tomcat > >upgrade. > > > >The issue occurs when making connections to the server for webpages > >containing images, and a couple of other connection based areas. If you > >access the URL the code is trying to through a browser, there is no > problem > >or security prompt. This is an internal corporate intranet application. > > > >Thanks in advance, Allistair. > > > > > > > > > >------------------------------------------------------- > >QAS Ltd. > >Developers of QuickAddress Software > >www.qas.com > >Registered in England: No 2582055 > >Registered in Australia: No 082 851 474 > >------------------------------------------------------- > > > > > > > This e-mail, including any attachments, is a confidential business communication, and may contain information that is confidential, proprietary and/or privileged. This e-mail is intended only for the individual(s) to whom it is addressed, and may not be saved, copied, printed, disclosed or used by anyone else. If you are not the(an) intended recipient, please immediately delete this e-mail from your computer system and notify the sender. Thank you. > > > --------------------------------------------------------------------- > To unsubscribe, e-mail: [EMAIL PROTECTED] > For additional commands, e-mail: [EMAIL PROTECTED] > > > > > >  > ------------------------------------------------------- > QAS Ltd. > Developers of QuickAddress Software > www.qas.com > Registered in England: No 2582055 > Registered in Australia: No 082 851 474 > ------------------------------------------------------- >  > --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]


isambard.external_programs.profit module¶
This module provides an interface to the program ProFit.
-
run_profit
(pdb1, pdb2, path1=False, path2=False, path_to_cmd_file=None, return_pdb_string=False, align_type=None)[source]¶ Takes 2 PDB strings, carries out rmsd superposition using ProFit.
Parameters: - pdb1 (str) – PDB as string or path
- pdb2 (str) – PDB as string or path
- path1 (bool, optional) – Whether pdb1 is a string or filepath
- path2 (bool, optional) – Whether pdb2 is a string or filepath
- path_to_cmd_file (None, optional) – Optional custom command file for ProFit. Do not use if you want to use return_pdb_string=True
- return_pdb_string (bool, optional) – Returns fitted pdb structure as a string
- align_type (None, optional) – Used in conjunction with return_pdb_string=True and should be set to one of ‘all’, ‘bb’, or ‘ca to specify alignment of all atoms, backbone atoms or just c-alpha atoms respectively
Returns: - rmsds ([]) – list of ca, bb and all-atom rmsds from superposition
- output_pdb (str) – (Optional) PDB string of overlaid, fitted structure (i.e., pdb2 superposed onto pdb1)
Raises: ValueError
– Raised if ProFit is ran with both a custom command file and an output PDB string. Raised if align method invalid.


Answer a few basic questions, then find the friend with the greatest compatibility!
API Friends List | Github Repo


This is a small utility app. You can register, login and you can create form. By a form we mean a piece of text that includes blank fields. Each form will have a link. You can give the link to other users who can fill the blanks and turn the form into a complete PDF form.


Cape Coast pitch invader, Awal Suleman fined GH2,400 by court
by Adu SarpeahConfirmed information reaching ghbase.com has it that Awal Suleman, the Cape Coast Pitch invader has been fined GH2,400 by a court in Cape Coast.
It could be recalled that Awal Suleman jumped on to the pitch when Ghana played South Africa in the AFCON 2021 qualifier at the Cape Coast stadium.
The accused was granted bail on Saturday but appeared before court on Thursday, November 21, 2019, and pleaded guilty for disturbing the peace and resisting arrest. The charges according to Lawyer Asuama Yeboah were to serve as a deterrent to others.
Lawyer Asuama Yeboah Junior in an interview with the press right after court hearing explained that, “The court took a lot of factors into consideration. He is a first-time offender so he was charged with disturbing the peace and resisting arrest.
TRENDING:– 6 facts about the young man who invaded the pitch during Ghana – South Africa match
“Looking at the factors the court didn’t want to give him a non-custodian sentence but rather send a signal out there to deter others. So, he was given a fine of 200 penalty unites for the second charge which is the resisting arrest and for the first charge to sign a bond of good behaviour and in default three months in prison”.
He further said, Awal’s remorse after the incident and pleas from the Black Stars players and coach also factored in the verdict.


Delaney out as Dortmund host bottom side Paderborn
by Agency ReportBorussia Dortmund will be without injured midfielder Thomas Delaney until at least January as they look to bounce back from their Bayern Munich drubbing at home to Bundesliga strugglers Paderborn on Friday.
The burly Danish midfielder is out for the rest of 2019 after tearing ankle ligaments early in Monday’s 1-1 draw against the Republic of Ireland which put Denmark through to the Euro 2020 finals.
Dortmund expects Delaney to return after the January winter break.
There is also a question mark as to whether club captain Marco Reus will recover in time from an ankle injury.
Dortmund crashed 4-0 to Bayern at the Allianz Arena ten days ago, but Lucien Favre’s team can redeem themselves by beating bottom side Paderborn to close the six-point gap behind leaders Moenchengladbach.
They also need to boost confidence before playing Barcelona away next Wednesday with the Spanish top of their Champions League group by just a point from Dortmund.
Favre said the Bayern defeat was “hard to digest” as his team created just two shots on goal to the hosts’ 18 as Munich striker Robert Lewandowski scored twice against his former club.
“There are a lot of things we have to do better and I don’t want to talk about it (the Bayern defeat) anymore,” said Favre in Wednesday’s press conference.
“The post-match analysis was hard, but now we’re looking forward.
“We must have respect for them, but against Paderborn, we know what we have to do.”
Paderborn has just four points from 11 league games after a 2-0 win at home to Fortuna Duesseldorf last month and a draw at Wolfsburg in August.
(AFP)


ILXS focuses on development of user friendly and customer centeric solutions for modern documentation.
| IETM | CBT | Documentation |
|---|---|---|
| IETM is categorised into two types viz. Type 1 and Type 2.
Type 1 is further categorised into class 1, 2 and 3 and Type 2 is further categorised into class 4 and 5. Our IETM Comply to: |
In today’s fast-paced world, in order to stay competitive and work more efficiently, it is imperative that all workers learn to incorporate a variety of new skills into their repertoire. Computer based training can help you to effectively increase your knowledge and practical abilities, allowing you to find greater success in the world of work. | User documentation plays an important role in maintenance and operation activities. It is vital that the information provided in the documentation is clear, concise and easy to understand. Our team of expert documentation engineers provide the best quality documents. |


--- title: Web-based IRC layout: page navbar-index: 10 ads: true redirect_from: - /webirc.html --- {{ site.title }} offers an easy to use web-based IRC client, The Lounge. Your browser doesn't support iframes. Use the "New window" link below. Fullscreen New window


Mauricio Pochettino told to pick Arsenal job over Man Utd
The Argentinean left Tottenham after five-and-a-half years at the club earlier this week, and has been urged to make the short move to their north London rivals
by Irishmirror.ieMauricio Pochettino would be much better suited to the Arsenal manager's job than Manchester United's, according to former Scotland forward Ally McCoist.
Tottenham sacked Pochettino earlier this week and replaced him with Jose Mourinho, appointing the ex-Chelsea and Man Utd manager on a three-and-a-half year deal to the surprise of many.
Even when he was in his position at Tottenham, Pochettino has long been linked with replacing Ole Gunnar Solskjaer in the Old Trafford hotseat.
But with pressure mounting on Gunners boss Unai Emery ahead of this weekend's meeting with Southampton , McCoist thinks the former Saints boss could do a better job with Spurs' hated rivals, even if the switch would be deeply unpopular with fans.
When pressed if Arsenal would be the better move for him on Sky Sports' The Debate , McCoist - who played for and managed Rangers - said: "Yeah, I think so.
"I definitely think [a young team is better for him]. If you’re asking me, I think he’d suit Arsenal ’s squad more than he’d suit Manchester United ’s squad.
"There are a group of players at Arsenal he could work with immediately.
"Manchester United is a far bigger job, by that I mean longer term, more of a rebuild.
"I think there are, at this moment in time, probably more players to work with at Arsenal. Manchester United fans might not agree with that.
"I do think Emery is vulnerable. I think he’s probably the most vulnerable."
Pochettino has also been linked with moves to Bayern Munich and Real Madrid , although many are expecting him to take a break from the game following his axe from Spurs.
Mourinho will take charge of his first Spurs game in a London derby at West Ham on Saturday lunchtime.


See: Description
| Class | Description |
|---|---|
| CreateCompressedMail |
a simple example that creates a single compressed mail message.
|
| CreateEncryptedMail |
a simple example that creates a single encrypted mail message.
|
| CreateLargeCompressedMail |
a simple example that creates a single compressed mail message using the large
file model.
|
| CreateLargeEncryptedMail |
a simple example that creates a single encrypted mail message.
|
| CreateLargeSignedMail |
a simple example that creates a single signed mail message.
|
| CreateSignedMail |
a simple example that creates a single signed mail message.
|
| CreateSignedMultipartMail |
a simple example that creates a single signed multipart mail message.
|
| ExampleUtils | |
| ReadCompressedMail |
a simple example that reads a compressed email.
|
| ReadEncryptedMail |
a simple example that reads an encrypted email.
|
| ReadLargeCompressedMail |
a simple example that reads an oversize compressed email and writes data contained
in the compressed part into a file.
|
| ReadLargeEncryptedMail |
a simple example that reads an encrypted email using the large file model.
|
| ReadLargeSignedMail |
a simple example that reads a basic SMIME signed mail file.
|
| ReadSignedMail |
a simple example that reads a basic SMIME signed mail file.
|
| SendSignedAndEncryptedMail |
Example that sends a signed and encrypted mail message.
|
| ValidateSignedMail |
An Example that reads a signed mail and validates its signature.
|


{% extends "base.html" %} {% block content %}
There's nothing on this page. Go home, maybe? {% endblock %}