| dm:node-name(A9) | = | xs:QName("", "label") |
| dm:string-value(A9) | = | "Staind : Its Been A While" |
| dm:typed-value(A9) | = | xs:token("Staind : Its Been A While") |
| dm:type-name(A9) | = | xs:token |
| dm:is-id(A9) | = | false |
| dm:is-idrefs(A9) | = | false |
| dm:parent(A9) | = | ([E7]) |
| // Attribute node A10 | ||
| dm:node-kind(A10) | = | "attribute" |
| dm:node-name(A10) | = | xs:QName("", "formats") |
| dm:string-value(A10) | = | "CD" |
| dm:typed-value(A10) | = | cat:formatType("CD") |
| dm:type-name(A10) | = | cat:formatType |
| dm:is-id(A10) | = | false |
| dm:is-idrefs(A10) | = | false |
| dm:parent(A10) | = | ([E7]) |
| // Element node E8 | ||
| dm:base-uri(E8) | = | xs:anyURI("http://www.example.com/catalog.xml") |
| dm:node-kind(E8) | = | "element" |
| dm:node-name(E8) | = | xs:QName("http://www.example.com/catalog", "title") |
| dm:string-value(E8) | = | "It's Been A While" |
| dm:typed-value(E8) | = | xs:token("It's Been A While") |
| dm:type-name(E8) | = | xs:token |
| dm:is-id(E8) | = | false |
| dm:is-idrefs(E8) | = | false |
| dm:parent(E8) | = | ([E7]) |
| dm:children(E8) | = | ([T4]) |
| dm:attributes(E8) | = | () |
| dm:namespace-nodes(E8) | = | ([N1], [N2], [N3], [N4], [N5]) |
| dm:namespace-bindings(E8) | = | ("xml", "http://www.w3.org/XML/1998/namespace", "html", "http://www.w3.org/1999/xhtml", "", "http://www.example.com/catalog", "xlink", "http://www.w3.org/1999/xlink", "xsi", "http://www.w3.org/2001/XMLSchema-instance") |
| // Text node T4 | ||
| dm:base-uri(T4) | = | xs:anyURI("http://www.example.com/catalog.xml") |
| dm:node-kind(T4) | = | "text" |
| dm:string-value(T4) | = | "It's Been A While" |
| dm:typed-value(T4) | = | xs:untypedAtomic("It's Been A While") |
| dm:type-name(T4) | = | xs:untypedAtomic |
| dm:parent(T4) | = | ([E8]) |
| // Element node E9 | ||
| dm:base-uri(E9) | = | xs:anyURI("http://www.example.com/catalog.xml") |
| dm:node-kind(E9) | = | "element" |
| dm:node-name(E9) | = | xs:QName("http://www.example.com/catalog", "description") |
| dm:string-value(E9) | = | "" |
| // xsi:nil is true so the typed value is the empty sequence | ||
| dm:typed-value(E9) | = | () |
| dm:type-name(E9) | = | cat:description |
| dm:is-id(E9) | = | false |
| dm:is-idrefs(E9) | = | false |
| dm:parent(E9) | = | ([E7]) |
| dm:children(E9) | = | () |
| dm:attributes(E9) | = | ([A11]) |
| dm:namespace-nodes(E9) | = | ([N1], [N2], [N3], [N4], [N5]) |
| dm:namespace-bindings(E9) | = | ("xml", "http://www.w3.org/XML/1998/namespace", "html", "http://www.w3.org/1999/xhtml", "", "http://www.example.com/catalog", "xlink", "http://www.w3.org/1999/xlink", "xsi", "http://www.w3.org/2001/XMLSchema-instance") |
| // Attribute node A11 | ||
| dm:node-kind(A11) | = | "attribute" |
| dm:node-name(A11) | = | xs:QName("http://www.w3.org/2001/XMLSchema-instance", "xsi:nil") |
| dm:string-value(A11) | = | "true" |
| dm:typed-value(A11) | = | xs:boolean("true") |
| dm:type-name(A11) | = | xs:boolean |
| dm:is-id(A11) | = | false |
| dm:is-idrefs(A11) | = | false |
| dm:parent(A11) | = | ([E9]) |
| // Element node E10 | ||
| dm:base-uri(E10) | = | xs:anyURI("http://www.example.com/catalog.xml") |
| dm:node-kind(E10) | = | "element" |
| dm:node-name(E10) | = | xs:QName("http://www.example.com/catalog", "price") |
| dm:string-value(E10) | = | "10.99" |
| dm:typed-value(E10) | = | cat:monetaryAmount(10.99) |
| dm:type-name(E10) | = | cat:price |
| dm:is-id(E10) | = | false |
| dm:is-idrefs(E10) | = | false |
| dm:parent(E10) | = | ([E7]) |
| dm:children(E10) | = | ([T5]) |
| dm:attributes(E10) | = | ([A12]) |
| dm:namespace-nodes(E10) | = | ([N1], [N2], [N3], [N4], [N5]) |
| dm:namespace-bindings(E10) | = | ("xml", "http://www.w3.org/XML/1998/namespace", "html", "http://www.w3.org/1999/xhtml", "", "http://www.example.com/catalog", "xlink", "http://www.w3.org/1999/xlink", "xsi", "http://www.w3.org/2001/XMLSchema-instance") |
| // Attribute node A12 | ||
| dm:node-kind(A12) | = | "attribute" |
| dm:node-name(A12) | = | xs:QName("", "currency") |
| dm:string-value(A12) | = | "USD" |
| dm:typed-value(A12) | = | cat:currencyType("USD") |
| dm:type-name(A12) | = | cat:currencyType |
| dm:is-id(A12) | = | false |
| dm:is-idrefs(A12) | = | false |
| dm:parent(A12) | = | ([E10]) |
| // Text node T5 | ||
| dm:base-uri(T5) | = | xs:anyURI("http://www.example.com/catalog.xml") |
| dm:node-kind(T5) | = | "text" |
| dm:string-value(T5) | = | "10.99" |
| dm:typed-value(T5) | = | xs:untypedAtomic("10.99") |
| dm:type-name(T5) | = | xs:untypedAtomic |
| dm:parent(T5) | = | ([E10]) |
| // Element node E11 | ||
| dm:base-uri(E11) | = | xs:anyURI("http://www.example.com/catalog.xml") |
| dm:node-kind(E11) | = | "element" |
| dm:node-name(E11) | = | xs:QName("http://www.example.com/catalog", "artist") |
| dm:string-value(E11) | = | " Staind " |
| dm:typed-value(E11) | = | " Staind " |
| dm:type-name(E11) | = | xs:string |
| dm:is-id(E11) | = | false |
| dm:is-idrefs(E11) | = | false |
| dm:parent(E11) | = | ([E7]) |
| dm:children(E11) | = | ([T6]) |
| dm:attributes(E11) | = | () |
| dm:namespace-nodes(E11) | = | ([N1], [N2], [N3], [N4], [N5]) |
| dm:namespace-bindings(E11) | = | ("xml", "http://www.w3.org/XML/1998/namespace", "html", "http://www.w3.org/1999/xhtml", "", "http://www.example.com/catalog", "xlink", "http://www.w3.org/1999/xlink", "xsi", "http://www.w3.org/2001/XMLSchema-instance") |
| // Text node T6 | ||
| dm:base-uri(T6) | = | xs:anyURI("http://www.example.com/catalog.xml") |
| dm:node-kind(T6) | = | "text" |
| dm:string-value(T6) | = | " Staind " |
| dm:typed-value(T6) | = | xs:untypedAtomic(" Staind ") |
| dm:type-name(T6) | = | xs:untypedAtomic |
| dm:parent(T6) | = | ([E11]) |
A graphical representation of the data model for the preceding example is shown below. Document order in this representation can be found by following the traditional left-to-right, depth-first traversal; however, because the image has been rotated for easier presentation, this appears to be bottom-to-top, depth-first order.
| Graphic representation of the data model. [large view, SVG] |
The following items are implementation-defined.
xs:string
to an
xs:float
or xs:double
, it is
implementation-defined whether the lexical value “-0” (and similar
forms such as “-0.0”) convert to negative zero or to positive zero
in the value space. (See 2.7.7 Negative
Zero)The following items are implementation-dependent.
The following changes have been made to this document since the Recommendation of 23 January 2007.
The W3C Schema 1.1 dateTimeStamp datatype has been added.
The function item datatype has been added to support Higher Order Functions.
Function items have been renamed "functions", and have had their internal 'structure' modified slightly.
This section summarizes the return values of each accessor by node type.
Returns the empty sequence
Returns the value of the attributes property. The order of Attribute Nodes is stable but implementation dependent.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the value of the base-uri property.
Returns the value of the base-uri property.
If the attribute has a parent, returns the value of the dm:base-uri of its parent; otherwise it returns the empty sequence.
Returns the empty sequence.
Returns the value of the base-uri property.
If the comment has a parent, returns the value of the dm:base-uri of its parent; otherwise, returns the empty sequence.
If the Text Node has a parent, returns the value of the dm:base-uri of its parent; otherwise, returns the empty sequence.
Returns the value of the children property.
Returns the value of the children property.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the absolute URI of the resource from which the Document Node was constructed, or the empty sequence if no such absolute URI is available.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the value of the is-id property.
Returns the value of the is-id property.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the value of the is-idrefs property.
Returns the value of the is-idrefs property.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence
Returns the value of the namespaces property as a sequence of Namespace Nodes. The order of Namespace Nodes is stable but implementation dependent.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence
Returns the value of the nilled property.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns “document
”.
Returns “element
”.
Returns “attribute
”.
Returns “namespace
”.
Returns “processing-instruction
”.
Returns “comment
”.
Returns “text
”.
Returns the empty sequence.
Returns the value of the node-name property.
Returns the value of the node-name property.
If the prefix is not empty, returns
an xs:QName
with the value of the prefix property in the local-name and an empty
namespace name, otherwise returns the empty sequence.
Returns an xs:QName
with the value of the target property in the local-name and an empty
namespace URI and empty prefix.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence
Returns the value of the parent property.
Returns the value of the parent property.
Returns the value of the parent property.
Returns the value of the parent property.
Returns the value of the parent property.
Returns the value of the parent property.
Returns the value of the string-value property.
Returns the value of the string-value property.
Returns the value of the string-value property.
Returns the value of the uri property.
Returns the value of the content property.
Returns the value of the content property.
Returns the value of the content property.
Returns the empty sequence.
Returns the value of the schema-type property.
Returns the value of the schema-type property.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns xs:untypedAtomic
.
Returns the value of the typed-value property.
Returns the value of the typed-value property.
Returns the value of the typed-value property.
Returns the value of the uri
property as an xs:string
.
Returns the value of the content
property as a xs:string
.
Returns the value of the content
property as a xs:string
.
Returns the value of the content
property as an xs:untypedAtomic
.
Returns the public identifier of the specified unparsed entity or the empty sequence if no such entity exists.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the system identifier of the specified unparsed entity or the empty sequence if no such entity exists.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
Returns the empty sequence.
This section summarizes data model construction from an Infoset for each kind of information item. General notes occur elsewhere.
The document information item is required. A Document Node is constructed for each document information item.
The following infoset properties are required: [children] and [base URI].
The following infoset properties are optional: [unparsed entities].
Document Node properties are derived from the infoset as follows:
The value of the [base URI] property, if available. Note that the base URI property, if available, is always an absolute URI (if an absolute URI can be computed) though it may contain Unicode characters that are not allowed in URIs. These characters, if they occur, are present in the base-uri property and will have to be encoded and escaped by the application to obtain a URI suitable for retrieval, if retrieval is required.
In practice a [base URI] is not always known. In this case the value of the base-uri property of the document node will be the empty sequence. This is not intrinsically an error, though it may cause some operations that depend on the base URI to fail.
The sequence of nodes constructed from the information items found in the [children] property.
For each element, processing instruction, and comment found in the [children] property, a corresponding Element, Processing Instruction, or Comment Node is constructed and that sequence of nodes is used as the value of the children property.
If present among the [children], the document type declaration information item is ignored.
If the [unparsed entities] property is present and is not the empty set, the values of the unparsed entity information items must be used to support the dm:unparsed-entity-system-id and dm:unparsed-entity-public-id accessors.
The internal structure of the values of the unparsed-entities property is implementation defined.
The concatenation of the string-values of all its Text Node descendants in document order. If the document has no such descendants, the zero-length string.
The dm:string-value of the node as an
xs:untypedAtomic
value.
The document-uri property holds the absolute URI for the resource from which the document node was constructed, if one is available and can be made absolute. For example, if a collection of documents is returned by the fn:collection function, the document-uri property may serve to distinguish between them even though each has the same base-uri property.
If the document-uri is not the empty
sequence, then the following constraint must hold: the node
returned by evaluating fn:doc()
with the document-uri as its argument must return the
document node that provided the value of the document-uri property.
In other words, for any Document Node $arg
, either
fn:document-uri($arg)
must return the empty sequence
or fn:doc(fn:document-uri($arg))
must return
$arg
.
The element information items are required. An Element Node is constructed for each element information item.
The following infoset properties are required: [namespace name], [local name], [children], [attributes], [in-scope namespaces], [base URI], and [parent].
Element Node properties are derived from the infoset as follows:
The value of the [base URI] property, if available. Note that the base URI property, if available, is always an absolute URI (if an absolute URI can be computed) though it may contain Unicode characters that are not allowed in URIs. These characters, if they occur, are present in the base-uri property and will have to be encoded and escaped by the application to obtain a URI suitable for retrieval, if retrieval is required.
In practice a [base URI] is not always known. In this case the value of the base-uri property of the document node will be the empty sequence. This is not intrinsically an error, though it may cause some operations that depend on the base URI to fail.
An xs:QName
constructed from the [prefix], [local
name], and [namespace name]
properties.
The node that corresponds to the value of the [parent] property or the empty sequence if there is no parent.
All Element Nodes constructed from an infoset have the type
xs:untyped
.
The sequence of nodes constructed from the information items found in the [children] property.
For each element, processing instruction, comment, and maximal sequence of adjacent character information items found in the [children] property, a corresponding Element, Processing Instruction, Comment, or Text Node is constructed and that sequence of nodes is used as the value of the children property.
Because the data model requires that all general entities be expanded, there will never be unexpanded entity reference information item children.
A set of Attribute Nodes constructed from the attribute information items appearing in the
[attributes] property. This
includes all of the "special" attributes (xml:lang
,
xml:space
, xsi:type
, etc.) but does not
include namespace declarations (because they are not
attributes).
Default and fixed attributes provided by the DTD are added to the [attributes] and are therefore included in the data model attributes of an element.
A set of Namespace Nodes constructed from the namespace information items appearing in the [in-scope namespaces] property. Implementations that do not support Namespace Nodes may simply preserve the relevant bindings in this property.
Implementations may ignore namespace information items for namespaces which are not known to be used. A namespace is known to be used if:
It appears in the expanded QName of the node-name of the element.
It appears in the expanded QName of the node-name of any of the element's attributes.
Note: applications may rely on namespaces that are not known to
be used, for example when QNames are used in content and that
content does not have a type of xs:QName
Such
applications may have difficulty processing data models where some
namespaces have been ignored.
All Element Nodes constructed from an infoset have a nilled property of " false ".
The string-value is constructed from the character information item [children] of the element and all its descendants. The precise rules for selecting significant character information items and constructing characters from them is described in 6.7.3 Construction from an Infoset of 6.7 Text Nodes.
This process is equivalent to concatenating the dm:string-values of all of the Text Node descendants of the resulting Element Node.
If the element has no such descendants, the string-value is the empty string.
The string-value as an
xs:untypedAtomic
.
All Element Nodes constructed from an infoset have a is-id property of " false ".
All Element Nodes constructed from an infoset have a is-idrefs property of " false ".
The attribute information items are required. An Attribute Node is constructed for each attribute information item.
The following infoset properties are required: [namespace name], [local name], [normalized value], [attribute type], and [owner element].
Attribute Node properties are derived from the infoset as follows:
An xs:QName
constructed from the [prefix], [local
name], and [namespace name]
properties.
The Element Node that corresponds to the value of the [owner element] property or the empty sequence if there is no owner.
The value xs:untypedAtomic
.
The [normalized value] of the attribute.
The attribute’s typed-value is its dm:string-value as an
xs:untypedAtomic
.
If the attribute is named xml:id
and its [attribute type] property does not have the
value ID
, then [xml:id]
processing is performed. This will assure that the value does have
the type ID
and that it is properly normalized. If an
error is encountered during xml:id processing, an implementation
may raise a dynamic error. The is-id property is always true
for
attributes named xml:id
.
If the [attribute type] property
has the value ID
, true
, otherwise
false
.
If the [attribute type] property
has the value IDREF
or IDREFS
,
true
, otherwise false
.
The namespace information items are required.
The following infoset properties are required: [prefix], [namespace name].
Namespace Node properties are derived from the infoset as follows:
The [prefix] property.
The [namespace name] property.
The element in whose [in-scope namespaces] property the namespace information item appears, if the implementation exposes any mechanism for accessing the dm:parent accessor of Namespace Nodes.
A Processing Instruction Node is constructed for each processing instruction information item that is not ignored.
The following infoset properties are required: [target], [content], [base URI], and [parent].
Processing Instruction Node properties are derived from the infoset as follows:
The value of the [target] property.
The value of the [content] property.
The value of the [base URI] property, if available. Note that the base URI property, if available, is always an absolute URI (if an absolute URI can be computed) though it may contain Unicode characters that are not allowed in URIs. These characters, if they occur, are present in the base-uri property and will have to be encoded and escaped by the application to obtain a URI suitable for retrieval, if retrieval is required.
In practice a [base URI] is not always known. In this case the value of the base-uri property of the document node will be the empty sequence. This is not intrinsically an error, though it may cause some operations that depend on the base URI to fail.
The node corresponding to the value of the [parent] property.
There are no Processing Instruction Nodes for processing instructions that are children of a document type declaration information item.
The comment information items are optional.
A Comment Node is constructed for each comment information item.
The following infoset properties are required: [content] and [parent].
Comment Node properties are derived from the infoset as follows:
The value of the [content] property.
The node corresponding to the value of the [parent] property.
There are no Comment Nodes for comments that are children of a document type declaration information item.
The character information items are required. A Text Node is constructed for each maximal sequence of character information items in document order.
The following infoset properties are required: [character code] and [parent].
The following infoset properties are optional: [element content whitespace].
A sequence of character information items is maximal if it satisfies the following constraints:
All of the information items in the sequence have the same parent.
The sequence consists of adjacent character information items uninterrupted by other types of information item.
No other such sequence exists that contains any of the same character information items and is longer.
Text Node properties are derived from the infoset as follows:
A string comprised of characters that correspond to the [character code] properties of each of the character information items.
If the resulting Text Node consists entirely of whitespace and
the [element content whitespace]
property of the character information
items used to construct this node are true
, the
content of the Text Node is the
zero-length string. Text Nodes are only allowed to be empty if they
have no parents; an empty Text Node will be discarded when its
parent is constructed, if it has a parent.
The content of the Text Node is not necessarily normalized as described in the [Character Model]. It is the responsibility of data producers to provide normalized text, and the responsibility of applications to make sure that operations do not de-normalize text.
The node corresponding to the value of the [parent] property.
This section summarizes data model construction from a PSVI for each kind of information item. General notes occur elsewhere.
Construction from a PSVI is identical to construction from the Infoset.
The following Element Node properties are affected by PSVI properties.
The schema-type is determined as described in <IP_ADDRESS> Element and Attribute Node Types.
The sequence of nodes constructed from the information items found in the [children] property.
For each element, processing instruction, comment, and maximal sequence of adjacent character information items found in the [children] property, a corresponding Element, Processing Instruction, Comment, or Text Node is constructed and that sequence of nodes is used as the value of the children property.
For elements with schema simple types, or complex types with simple content, if the [schema normalized value] PSVI property exists, the processor may use a sequence of nodes containing the Processing Instruction and Comment Nodes corresponding to the processing instruction and comment information items found in the [children] property, plus an optional single Text Node whose string value is the [schema normalized value] for the children property. If the [schema normalized value] is the empty string, the Text Node must not be present, otherwise it must be present.
The relative order of Processing Instruction and Comment Nodes must be preserved, but the position of the Text Node, if it is present, among them is implementation defined.
The effect of the above rules is that where a fixed or default value for an element is defined in the schema, and the element takes this default value, a text node will be created to contain the value, even though there are no character information items representing the value in the PSVI. The position of this text node relative to any comment or processing instruction children is implementation-dependent.
[Schema Part 1] also permits an element with mixed content to take a default or fixed value (which will always be a simple value), but at the time of this writing it is unclear how such a defaulted value is represented in the PSVI. Implementations therefore may represent such a default value by creating a text node, but are not required to do so.
Because the data model requires that all general entities be expanded, there will never be unexpanded entity reference information item children.
A set of Attribute Nodes constructed from the attribute information items appearing in the
[attributes] property. This
includes all of the "special" attributes (xml:lang
,
xml:space
, xsi:type
, etc.) but does not
include namespace declarations (because they are not
attributes).
Default and fixed attributes provided by XML Schema processing are added to the [attributes] and are therefore included in the data model attributes of an element.
A set of Namespace Nodes constructed from the namespace information items appearing in the [in-scope namespaces] property. Implementations that do not support Namespace Nodes may simply preserve the relevant bindings in this property.
Implementations may ignore namespace information items for namespaces which are not known to be used. A namespace is known to be used if:
It appears in the expanded QName of the node-name of the element.
It appears in the expanded QName of the node-name of any of the element's attributes.
It appears in the expanded QName of any values of type
xs:QName
that appear among the element's children or
the typed values of its attributes.
Note: applications may rely on namespaces that are not known to
be used, for example when QNames are used in content and that
content does not have a type of xs:QName
Such
applications may have difficulty processing data models where some
namespaces have been ignored.
If the [validity] property exists on an information item and is " valid " then if the [nil] property exists and is true, then the nilled property is " true ". In all other cases, including all cases where schema validity assessment was not attempted or did not succeed, the nilled property is " false ".
The string-value is calculated as follows:
If the element is empty: its string value is the zero length string.
If the element has a type of xs:untyped
, a complex
type with element-only content, or a complex type with mixed
content: its string-value is the concatenation of the string-values of all its Text Node descendants
in document order.
If the element has a simple type or a complex type with simple content: its string-value is the [schema normalized value] of the node.
If an implementation stores only the typed value of an element, it may use any valid lexical representation of the typed value for the string-value property.
The typed-value is calculated as follows:
If the element is of type xs:untyped
, its
typed-value is its dm:string-value as an
xs:untypedAtomic
.
If the element has a complex type with empty content, its typed-value is the empty sequence.
If the element has a simple type or a complex type with simple content: its typed value is computed as described in <IP_ADDRESS> Typed Value Determination. The result is a sequence of zero or more atomic values. The relationship between the type-name, typed-value, and string-value of an element node is consistent with XML Schema validation.
Note that in the case of dates and times, the timezone is
preserved as described in 3.3.2 Dates
and Times, and in the case of xs:QName
s and
xs:NOTATION
s, the prefix is preserved as described in
3.3.3 QNames and
NOTATIONS.
If the element has a complex type with mixed content (including
xs:anyType
), its typed-value is its dm:string-value as an
xs:untypedAtomic
.
Otherwise, the element must be a complex type with element-only content. The typed-value of such an element is absent. Attempting to access this property with the dm:typed-value accessor always raises an error.
If the element has a complex type with element-only content, the
is-id property is false
.
Otherwise, if the typed-value of the element consists of exactly
one atomic value and that value is of type xs:ID
, or a
type derived from xs:ID
, the is-id property is true
, otherwise
it is false
.
Note:
This means that in the case of a type constructed by list from
xs:ID
, the ID is recognized provided that the list is
of length one. A type constructed as a union involving
xs:ID
is recognized provided the actual value is of
type xs:ID
.
Note:
The element that is marked with the is-id property, and which will therefore be
retrieved by the fn:id function, is the node whose typed value
contains the xs:ID
value. This node is a child of the
element node that, according to XML Schema, is uniquely identified
by this ID.
If the element has a complex type with element-only content, the
is-idrefs property is
false
. Otherwise, if any of the atomic values in the
typed-value of the element is of type xs:IDREF
or
xs:IDREFS
, or a type derived from one of those types,
the is-idrefs property is
true
, otherwise it is false
.
All other properties have values that are consistent with construction from an infoset.
The following Attribute Node properties are affected by PSVI properties.
The [schema normalized value] PSVI property if that exists.
Otherwise, the [normalized value] property.
If an implementation stores only the typed value of an attribute, it may use any valid lexical representation of the typed value for the string-value property.
The schema-type is determined as described in <IP_ADDRESS> Element and Attribute Node Types.
The typed-value is calculated as follows:
If the attribute is of type xs:untypedAtomic
: its
typed-value is its dm:string-value as an
xs:untypedAtomic
.
Otherwise, a sequence of zero or more atomic values as described in <IP_ADDRESS> Typed Value Determination. The relationship between the type-name, typed-value, and string-value of an attribute node is consistent with XML Schema validation.
If the attribute is named xml:id
and its [attribute type] property does not have the
value xs:ID
or a type derived from xs:ID
,
then [xml:id] processing is performed. This
will assure that the value does have the type xs:ID
and that it is properly normalized. If an error is encountered
during xml:id processing, an implementation may
raise a dynamic error. The is-id
property is always true for attributes named
xml:id
.
Otherwise, if the typed-value of the attribute consists of
exactly one atomic value and that value is of type
xs:ID
, or a type derived from xs:ID
, the
is-id property is true
,
otherwise it is false
.
Note:
This means that in the case of a type constructed by list from
xs:ID
, the ID is recognized provided that the list is
of length one. A type constructed as a union involving
xs:ID
is recognized provided the actual value is of
type xs:ID
.
If any of the atomic values in the typed-value of the attribute
is of type xs:IDREF
or xs:IDREFS
, or a
type derived from one of those types, the is-idrefs property is true
,
otherwise it is false
.
Note:
This rule means that a type constructed by list with an item
type of xs:IDREF
(or a type derived from
xs:IDREF
) has the is-idrefs property, whether or not the list type
is named xs:IDREFS
or is derived from
xs:IDREFS
. Because union types are allowed, it also
means that an element or attribute with the is-idrefs property can contain atomic values of
type xs:IDREF
alongside values of other types.
All other properties have values that are consistent with construction from an infoset.
Note: attributes from the XML Schema instance namespace, "
http://www.w3.org/2001/XMLSchema-instance
",
(xsi:schemaLocation
, xsi:type
, etc.)
appear as ordinary attributes in the data model.
Construction from a PSVI is identical to construction from the Infoset.
Construction from a PSVI is identical to construction from the Infoset.
Construction from a PSVI is identical to construction from the Infoset.
For Text Nodes constructed from the [schema normalized value] of elements, content contains the value of the [schema normalized value].
Otherwise, construction from a PSVI is the same as construction
from the Infoset except for the content
property. When constructing the content
property, [element content
whitespace] is not used to test if whitespace is collapsed.
Instead, if the resulting Text Node consists entirely of whitespace
and the character information items used
to construct this node have a parent and that parent is an element
and its {content type} is not “mixed
”, then the
content of the Text Node is the
zero-length string.
Text Nodes are only allowed to be empty if they have no parents; an empty Text Node will be discarded when its parent is constructed, if it has a parent.
This section summarizes the infoset mapping for each kind of node. General notes occur elsewhere.
A Document Node maps to a document information item. The mapping fails and produces no value if the Document Node contains Text Node children that do not consist entirely of white space or if the Document Node contains more than one Element Node child.
The following properties are specified by this mapping:
A list of information items obtained by processing each of the dm:children in order and mapping each to the appropriate information item(s).
The element information item that is among the [children].
An unordered set of unparsed entity information items constructed from the unparsed-entities.
Each unparsed entity maps to an unparsed entity information item. The following properties are specified by this mapping:
The name of the entity.
The system identifier of the entity.
The public identifier of the entity.
Implementation defined. In many cases, the document-uri is the correct answer and implementations must use this value if they have no better information. Implementations that keep track of the original [declaration base URI] for entities should use that value.
The following properties of the unparsed entity information item have no value: [notation name], [notation].
The following properties of the document information item have no value: [notations] [character encoding scheme] [standalone] [version] [all declarations processed].
An Element Node maps to an element information item.
The following properties are specified by this mapping:
The namespace name of the value of dm:node-name.
The local part of the value of dm:node-name.
The prefix associated with the value of dm:node-name.
A list of information items obtained by processing each of the dm:children in order and mapping each to the appropriate information item(s).
An unordered set of information items obtained by processing each of the dm:attributes and mapping each to the appropriate information item(s).
An unordered set of namespace information items constructed from the namespaces.
Each in-scope namespace maps to a namespace information item. The following properties are specified by this mapping:
The prefix associated with the namespace.
The URI associated with the namespace.
The value of dm:base-uri.
If this node is the root of the infoset mapping operation, unknown.
If this node has a parent, the information item that corresponds to the node returned by dm:parent.
Otherwise no value.
The following property has no value: [namespace attributes].
An Attribute Node maps to an attribute information item.
The following properties are specified by this mapping:
The namespace name of the value of dm:node-name.
The local part of the value of dm:node-name.
The prefix associated with the value of dm:node-name.
The value of dm:string-value.
If this node has a parent, the information item that corresponds to the node returned by dm:parent.
Otherwise no value.
The following properties have no value: [specified] [attribute type] [references].
A Namespace Node maps to a namespace information item.
The following properties are specified by this mapping:
The prefix associated with the namespace.
The value of dm:string-value.
An Processing Instruction Node maps to a processing instruction information item.
The following properties are specified by this mapping:
The local part of the value of dm:node-name.
The value of dm:string-value.
The value of dm:base-uri.
If this node is the root of the infoset mapping operation, unknown.
If this node has a parent, the information item that corresponds to the node returned by dm:parent.
Otherwise no value.
no value.
A Comment Node maps to a comment information item.
The following properties are specified by this mapping:
The value of the dm:string-value.
If this node is the root of the infoset mapping operation, unknown.
If this node has a parent, the information item that corresponds to the node returned by dm:parent.
Otherwise no value.
A Text Node maps to a sequence of character information items.
Each character of the dm:string-value of the node is converted into a character information item as specified by this mapping:
The Unicode code point value of the character.
If this node is the root of the infoset mapping operation, unknown.
If this node has a parent, the information item that corresponds to the node returned by dm:parent.
Otherwise no value.
Unknown.
This sequence of characters constitutes the infoset mapping.


| Looking for an idyllic view for your dinner with that special "someone"? Come Shoot the Breeze with us! Offering a full line of fresh seafood with a great view of the ocean, we have what you want! You will enjoy the ultimate fine-dining experience while also breathing the sweet sea air and viewing the mountain-rimmed beach. |


Hi, welcome to explore HK with me
Here are some useful links :)
香港旅遊發展局
Explore
Lonely Planet HK
Explore
馬蜂窩-香港攻略
Explore
Timeable HK
View Details
Please click on the button to get my personal HK fun list.
Get Ariel's HK Fun list
Map View


C#er
This is WeylandCorp’s update to ASTRO’s base code for CSC 404.
fvcproductions.github.io/WeylandCorp
to start experiencing C#er.$ bower install
To get started…
https://github.com/fvcproductions/WeylandCorp
. 🍴| FVCproductions | Brandon Richards |
|---|---|
| Coder | Coder |
| Jordan Quick | Charles Cephas | Justin Havens |
|---|---|---|
| Writer | Writer | Writer |
Please refer to the documentation.


This is a paragraph. Group your CSS attributes of p, h1 and h2 to change the backround color and text color
I am a different class of p.


Spaceflights cannot be stopped. This is not the work of any one man or even a group of men. It is a historical process which mankind is carrying out in accordance with the natural laws of human
development. Curious that we spend more time congratulating people who have succeeded than encouraging people who have not. Here men from the planet Earth first set foot upon the Moon. July 1969 AD. We came in peace for all mankind.
-Fulanita de tal, Hermosillo, Sonora
To be the first to enter the cosmos, to engage, single-handed, in an unprecedented duel with nature—could one dream of anything more? Across the sea of space, the stars are other suns. Many say
exploration is part of our destiny, but it’s actually our duty to future generations and their quest to ensure the survival of the human species.
-Fulanita de tal, Hermosillo, Sonora


This is a HTML 5 Canvas and JavaScript implementation of the A* path finding algorithm. It makes use of the JavaScript libraries jQuery and RequireJS.
Source code can be found online at GitHub and more information on my blog.
You can select a predetermined board layout below and click in an empty square to move the player piece.
Your browser does not support running A*. Please upgrade to a more recent version that supports HTML 5 canvas.


--- layout: post title: Pomodoro Technique to get work done date: 2014-02-13 17:12:24.000000000 -06:00 type: post published: true status: publish categories: - Life - Web Development tags: - pomodoro - work meta: _edit_last: '51126004' _publicize_pending: '1' _oembed_e4e93c98b080b96dfa9dc448b3beb62a: '{{unknown}}' _oembed_99727c2440b13b508584a427f4e8942e: '{{unknown}}' author: Nathan Ahlstrom ---
The Pomodoro Technique is very beneficial to my workplace productivity!
I'm tempted to be lazy, surf the internet, do the "easy" jobs, but this time and work management technique has been a very helpful way to tackle the important goals first!
Basic Synopsis of Pomodoro:
I learned of Pomodoro from John Sonmez, the author of the Simple Programmer several months ago. http://simpleprogrammer.com/2013/11/04/want-quit-job/
Taking John's advice I read through the Pomodoro Technique Illustrated, found it to be extremely valuable and an easy read, very helpful for me in this season of life!
Currently the Pomodoro Technique Illustrated is on sale until tomorrow, details below.
Pomodoro Technique Illustrated: save 40% before end of day February 14, use coupon code Valentine2014 http://t.co/BNNvBLgNJA
— Staffan Nöteberg (@staffannoteberg) February 12, 2014
So...how do you get focused and work done?


Ensure you have Java version 1.8.0_60
or later installed in your computer.
Having any Java 8 version is not enough.
This app will not work with earlier versions of Java 8.
DearJim.jar
from the releases tab.Double-click the file to start the app. The GUI should appear in a few seconds.
Figure 1: GUI of DearJim
help
and pressing Enter will open the help window.list
: lists all tasks. This is the default view.add
Learn how to use DearJim
:delete
1
: deletes the first task shown in the current list.exit
: exits the app.Command Format
- Format:
<command word> <parameters>
- Words in
UPPER_CASE
are the parameters.- Fields in
[]
are optional.- The order of parameters is fixed.
help
Opens a help window that contains a cheat sheet of all the commands of DearJim.
You can leave the help window open while using DearJim if you need to refer to the cheat sheet.
Format: help
While the help window is selected, you may close it by simply pressing any key on your keyboard!
Figure 2: Help Command
Use the Up and Down arrow keys to navigate your input history.
This gives you quick access to your previous and next inputs.
add
Adds a task into DearJim.
Format: [add] NAME [start DATE_TIME] [end DATE_TIME] [repeat every RECURRING_INTERVAL] [-PRIORITY]
You may also substitute
start
withfrom
/at
,end
withto
/by
.
By default, if no valid command is specified, the input will be treated as an add
command. This means typing in add
is optional.
If you would like to add a task with a name that begins with other command words, just include the add
to override the other command words.
Example:
| Input | Interpreted Command | Result | |
|---|---|---|---|
help my mum to buy cooking ingredients |
help |
Execute help command |
|
add help my mum to buy cooking ingredients |
add |
add a task with name help my mum to buy cooking ingredients |
Adding a task
Format: NAME
The simplest form of a task. Type away!
Example:
help my mum to buy cooking ingredients
Specifying task priority
You can assign a PRIORITY
of low
, medium
or high
to your task.
Tasks have medium
PRIORITY
by default.
Keyword: -PRIORITY
To specify the priority for a task, input a -
followed by the PRIORITY
.
PRIORITY
also accepts variations of low
, medium
and high
.
PRIORITY |
Variations |
|---|---|
low |
l , low |
medium |
m , med , medium |
high |
h , high |
Examples:
Watch drama -l
Buy coffee powder -med
Buy washing powder -high
Adding a task with deadline
Nobody likes deadlines. What's worse is missing them.
Add deadlines to your task so you will know when you need to complete them!
Format: NAME end DATE_TIME [repeat every RECURRING_INTERVAL] [-PRIORITY]
end
denotes a deadline.
end
can also be substituted withby
orto
.
DATE_TIME
is flexible!
DATE
is specified, DATE
will be assumed to be today.TIME
is specified, TIME
will be assumed to be 11:59pm.Valid Dates & Times
| Date | Format | Interpreted Date |
|---|---|---|
| MM/DD/YYYY | 12/12/2016 |
12 December 2016 |
| MM/DD/YY | 12/12/16 |
12 December 2016 |
| MM/DD | 12/12 |
12 December, Current Year |
| Calendar | 12 December 2016 , 12th December 2016 12 December 16 |
12 December 2016 |
| Calendar (Date and Month) | 12 December |
12 December, Current Year |
| Calendar (Month) | may , May dec , Dec , December |
1 May, Current Year 1 December, Current Year |
| Day | monday , Mon |
Nearest upcoming Monday |
| Relative Date | today , tonight tmr , tommorow next Tues 5 days later |
Today Tomorrow Next Tuesday 5 days later |
| Time | Format | Interpreted Time |
|---|---|---|
| 24Hr | 20.50 , 20:50 |
8.50pm |
| AM/PM | 8.50pm , 8:50pm , 0850pm |
8.50pm |
| Preset | midnight noon |
12am 12pm |
DearJim does not support the following 24hr format:
2050
, as this input can be misinterpreted as the value of year.
Examples:
Do project proposal by 5pm tmr
eat lunch by 1pm today -high
Buy coffee for boss by 7:00
finish CS2101 assignment by 13th Sep
NAME
with numbers from 0000 to 2359 may be wrongly interpreted as time. If you need to add a NAME
with these numbers, you can enclose the NAME
with double inverted commas to denote the NAME
explicitly.
Example:
| Input | Interpreted Command | Interpreted Task Name | Interpreted Deadline | Result |
|---|---|---|---|---|
Lower word count by 1500 |
add |
Lower word count |
by 1500 |
add a task with name Lower word count and deadline 1500 |
"Lower word count by 1500" |
add |
Lower word count by 1500 |
NONE | add a task with name Lower word count by 1500 |
Adding a task with time interval
Having a company meeting? Planning to have lunch with a friend next week?
Add a task with a time interval so you will know what time your task starts and ends!
If you are unsure about the end time for the task, you can leave it blank.
Format:
NAME start DATE_TIME [end DATE_TIME] [repeat every RECURRING_INTERVAL] [-PRIORITY]
Note: You may use
from
orat
to indicate the start time, andto
orby
to indicate the end time.
Example:
Company meeting tonight at 7pm to 9pm
Family dinner at noon
Meet Akshay from 1pm -h
Specifying repeated tasks
Have one of those pesky tasks you need to do every now and then?
DearJim also allows you to specify tasks that need to be repeated at a specific RECURRING_INTERVAL
. Never forget them again!
Keyword: repeat every RECURRING_INTERVAL
Note: You may only specify a
RECCURING_INTERVAL
for tasks that are timed.
RECURRING_INTERVAL
can be specified in a few formats, with some examples listed below.
| Recurring Interval | Format |
|---|---|
| Hour | hour , 3 hours |
| Day | day , 3 days , monday , mon |
| Week | week , 5 weeks |
| Month | month , 2 months |
| Year | year , 6 years |
Examples:
Run at track at 7am repeat every 3 days
Visit mum repeat every sun
edit
Just in case you need to change any details, or add in missing ones into your task, simply edit them in DearJim.
Format: edit INDEX [NAME] [start DATE_TIME] [end DATE_TIME] [repeat every RECURRING_INTERVAL] [-PRIORITY]
INDEX
refers to the task number in the current displayed list.
Note:edit
has a very similar format toadd
.
Examples:
Company meeting tonight at 7pm to 9pm
edit 2 Company meeting tomorrow morning at 7am to 9am -high
Buy coffee for boss by 8am repeat every day
edit 3 Buy coffee for boss by 7am repeat every 2 days
Editing out details in a task
You can also remove parameters that are no longer relevant.
Format: edit INDEX [-reset parameter] [repeat] [start] [end]
-reset parameter |
Result |
|---|---|
-reset repeat |
Removes recurring interval from task |
-reset start |
Removes start time from task |
-reset end |
Removes end time from task |
Examples:
Buy coffee for boss, by 8am repeat every day
edit 1 -reset repeat start
edit 2 -reset end
Note:
-reset
will override anyedit
of the same field that comes before it in your input.
delete
Deletes an existing task in DearJim. This will remove it from the storage.
Format: delete INDEX
You can
delete
multiple tasks using a single command by entering the indexes of the tasks you want to delete, separating each index with a space.
Example:
delete 2
delete 3 5 9
clear
Deletes all tasks in DearJim.
Format: clear
done
Marks a task as done and archives it in DearJim.
Format: done INDEX
You can
done
multiple tasks using a single command by entering the indexes of the tasks you have completed, separating each index with a space.
Example:
done 3
done 1 5
undo
Reverses the effects of the previous undoable command.
Helps you to undo any accidental mistakes that you have made!
Format: undo
Commands that you can undo
(Undoable commands):
add
edit
delete
clear
done
redo
Reverses a previous undo
command.
Not satisfied with your last undo
? redo
will reverse the undo
for you!
Format: redo
Note:
redo
can only reverse your lastundo
if no undoable commands have been entered after thatundo
.
list
Listing all undone tasks
Switches the task list view to the undone list view, to show all undone tasks in DearJim.
Format: list
Listing all undone tasks of a specific day
Switches the task list view to the undone list view, to show all tasks on the day specified.
Format: list DAY
Example:
list today
list tmr
list monday
Listing all done tasks
Switches the task list view to the done list view, to show all done tasks in DearJim.
Format: list done
add
andedit
commands do not work in done list view. As such, you are not able to directly add tasks into the done list, or edit the details of done tasks.
find
Forgot about the details of a task that you have added earlier? You can find an existing task by its name.
Format: find NAME
find
is case-insensitive -find AKSHAY
will matchfind akshay
If no NAME is provided, all uncompleted tasks will be displayed
Examples:
find Akshay
find company meeting
find
store
Need to look at your task on the move? Simply store the data at another location and bring it along with you.
In addition to changing the storage file location, store
handles your existing data in two different ways, depending if the filepath you specify is an existing storage file.
If the storage file specified is not present, DearJim will create this new file and store your current data in it.
If the storage file specified is present, data will be loaded from this storage file into DearJim.
Format: store FILEPATH
DearJim data is stored in XML file format. There is no need to specify the file extension
.xml
, it will be appended to your target file name automatically.store
supports both relative and absolute file paths.
Examples:
store data/onthemove
store /Users/jim/Dropbox/filename
exit
Closes the application.
Format: exit
If you have forgotten about the command formats, simply type any word and DearJim will provide you hints on the command format that you might want to use!
Examples:
Typing add
in the command input generates the format for add
in the result display
Figure 3: Hints for add command
Typing delete
in the command input generates the format for delete
in the result display
Figure 4: Hints for delete command
add
and edit
task previewDearJim features an instant add
and edit
command task preview, allowing you to preview the task details as your type your input!
Now you can be sure of how your input will be interpreted!
Examples:
add do my homework from 3pm to 4pm repeat every day -high
generates an instant add
preview
Figure 5: Instant preview for add command
edit 1 by 10pm -low -reset repeat
generates an instant edit
preview
Figure 6: Instant preview for edit command
Data in DearJim is automatically saved on the hard disk after any command that changes the data is executed.
There is no need to save manually.
You will never have to worry about forgetting to save your data while using DearJim! Hurray!
Q: How do I transfer my data to another computer?
A: Install the app on the other computer. Upon starting DearJim, an empty data file is created. Overwrite the contents of the data file with the data file in your previous DearJim folder.
Q: How do I install the program?
A: Double-click the DearJim.jar file.
| Command | Format |
|---|---|
| Help | help |
| Add | [add] NAME [start DATE_TIME] [end DATE_TIME] [repeat every RECURRING_INTERVAL] [-PRIORITY] |
| Edit | edit INDEX [NAME] [start DATE_TIME] [end DATE_TIME] [repeat every RECURRING_INTERVAL] [-PRIORITY] [-reset parameter] |
| Delete | delete INDEX |
| Clear | clear |
| Done | done INDEX |
| Undo | undo |
| Redo | redo |
| List | list [done] |
| Find | find NAME |
| Store | store FILEPATH |
| Exit | exit |


Hi, {{ username }}
Client Server {{ client_name }} wants to have access to your profile.
Do You Authorize it?


| Respository name | Purpose | |
| OasisLMF | oasislmf Python package, with the core oasis business logic, MDK command line tools and the Oasis API client. | docs |
| OasisPlatform | Flask application that provides the OasisApi and the Celery worker for running a model. | docs |
| OasisKeysServer | Base Flask application for keys services. | docs |
| Ktools | Model execution kernel. | docs |
| OasisUI | Shiny application, Flask app and database for the Flamingo application. | docs |
| Cookiecutter-OasisModel | Repository template for a model implementation. | docs |
| OasisPiWind | Example model implementation. | docs |


Progress - report the progress of a time consuming program.
use Progress;
if ($ARGV[0] eq 'percent') {
$obj = Progress->new( {'OUT'=>*STDERR{IO},'Format'=>'percent'} );
} else {
$obj = Progress->new( {'OUT'=>*STDOUT{IO},'Format'=>'line'} );
}
$TotalLine = 100; # or $TotalLine = &getTotal();
for($line=1; $line <= 100; $line++) {
$percent = $obj->ShowProgress($line/$TotalLine, $percent);
}
$percent = $obj->ShowProgress($line/$TotalLine, $percent);
Given a ratio of completing some work, show the percentage before completion.
Author:
Yuen-Hsien Tseng. All rights reserved.
Date:
2003/06/13
$obj = $class->new( {'OUT'=>*STDERR{IO},'Format'=>'percent'} );
The attributes in the object can be set by an INI file (through attribute
'INI') or directly given in the constructor's argumnets in a
key=>value format. To know the attribute names, consult class.ini.
Attributes in an object in Perl is often saved in a referece to a hash.
A reference to a no-name hash is donated as '{ }', as shown in
$class->new( { {'OUT'=>*STDERR{IO},'Format'=>'percent'} );
'OUT'=>*STDERR{IO} : output progress message to standard error.
'OUT'=>*STDout{IO} : output progress message to standard output.
'Format'=>'percent' : output progress message in percentage.
'Format'=>'line' : output progress message in '.' and '+'.
$p->ShowProgress($CurrentPercent, $PreviousPercent)
Show $CurrentPercent if $CurrentPercent > $PreviousPercent.
The attribute 'Format' will affect the progress message.
if Format=>'percent', then percentage will be shown;
if format=>'line', then '.' and '+' will be shown;
$p->ShowProgressPercent($CurrentPercent, $PreviousPercent)
Show $CurrentPercent in percentage if $CurrentPercent > $PreviousPercent.
$p->ShowProgressLine($CurrentPercent, $PreviousPercent)
Show $CurrentPercent in '.' or '+' if $CurrentPercent > $PreviousPercent.


Map
Sections
Select All
Clear
Article Weight
Back
Locations
Back
Articles
Back
Locations
Other Entities


| # | Item Name | Quantity | Threshold | Modified By |
|---|---|---|---|---|
| (Add New Item) | ||||
| 1 | Blankets | 2 | 10 | Josh Liu |
| 2 | Bandages (20ct., 1") | 27 | 25 | Brian Lai |
| 3 | Tylenol | 7 | 5 | Ryan Chavez |
| 4 | Syringes | 125 | 50 | Ryan Chavez |
| 5 | Water (0.5L x24) | 10 | 8 | Brian Lai |
| 6 | Latex Gloves | 69 | 69 | Ryan Chavez |
| 7 | Morphine (1 dose) | 4 | 10 | Josh Liu |
| 8 | Kitten | 1 | 1 | Josh Liu |


Parameter (Technical)
The Parameter
object is used internally by NeuralNet
. Parameter
encapsulates the weight matrices and the bias vectors that correspond to each layer.
Mathematical Operations
Through supporting basic mathematical operations, such as addition, scalar multiplication and component-wise operations, Parameter
can be treated like a single vector in calculations. This makes it easy to implement custom gradient descent algorithms.
Example: Gradient Descent in NeuralNet
Here is an overview of how Parameter
is used in NeuralNet
to minimise cost through gradient descent.
The parameter object param
stores the weights and biases used in the NeuralNet. These are used to calculate the layers.
In each gradient descent step, gradient
stores the cost gradients of the corresponding entries in param
. More explicitly, the i
th entry in gradient
is the cost gradient of the i
th weight/bias entry in param
.
step
is then added to param
to adjust the weights/biases and minimise cost.
The gradient descent algorithm is contained in gradientDescender
. For instance, gradientDescender.GradientDescentStep(...)
could use stochasic gradient descent, adam gradient descent, or any other gradient descent algorithm. To find out more, read Gradient Descender.
public class NeuralNet
{
private Parameter param = ... ; // holds the weights and biases
private GradientDescender gradientDescender = ... ;
...
public void Fit(...)
{
Parameter gradient = ... ; // holds the cost gradients of the corresponding entries in `param`
Parameter step = gradientDescender.GradientDescentStep(gradient);
param += step;
}
}
The way Parameter
s are used here abstracts away weight matrices and bias vectors. Their syntax reads like single vectors, making the algorithm clearer.
Example: Stochastic Gradient Descent
Here is an overview of a possible definition of GradientDescender.GradientDescentStep(...)
.
This example uses the stochastic gradient descent algorithm. Following this algorithm, the cost gradient is simply multiplied by a scalar learning rate.
public class StochasticGradientDescender : GradientDescender
{
...
private double _learningRate = 0.001;
...
public Parameter GradientDescentStep(Parameter gradient)
{
Parameter step = -_learningRate * gradient;
return step;
}
}
(Some implementation details have been omitted: to see these, read Gradient Descender.)
Again, the usage of Parameter
objects abstracts away the weight matrices and bias vectors that they contain.
See the Parameter API for a list of mathematical operations, and Gradient Descender for examples on this usage.


The public C API¶
The public C-API comprises functions defined in all C header files in the py/
directory. Most of the important core runtime C APIs are exposed in runtime.h
and
obj.h
.
The following is an example of public API functions from obj.h
:
mp_obj_t mp_obj_new_list(size_t n, mp_obj_t *items);
mp_obj_t mp_obj_list_append(mp_obj_t self_in, mp_obj_t arg);
mp_obj_t mp_obj_list_remove(mp_obj_t self_in, mp_obj_t value);
void mp_obj_list_get(mp_obj_t self_in, size_t *len, mp_obj_t **items);
At its core, any functions and macros in header files make up the public API and can be used to access very low-level details of MicroPython. Static inline functions in header files are fine too, such functions will be inlined in the code when used.
Header files in the ports
directory are only exposed to the functionality
specific to a given port.


FOR BRANDS
CartPerk helps brand owners understand and build in-depth shopper profiles.
In addition, brand owners can offer personalized rewards & perks to consumers through CartPerk and close the redemption loop without any retailer intervention, at large scale using the mobile channel.
Start using CartPerk in conjunction with your Facebook Brand pages understand your social media fans better and monetize social media. CartPerk helps you understand your social media fans better and monetize social media.
Rewards and offers are a key driver of Facebook Fan activity
Do you have a lot of fans on your Facebook page?
Do you know that most of them expect a reward, coupon or an offer?
Do you know if they actually purchase your products?
Do you have a seamless way of rewarding those consumers?
If your answer is yes to the above questions, CartPerk is your solution. Our technology platform extracts each shopper’s purchase receipt data from the receipt images and maps it to real products.
The shopper profile mapped to purchase information is the foundation of CartPerk’s solutions.
Reward LoyaltyIdentify consumers who have bought your products regularly and construct a direct reward program for them. Instead of running a discount at a retailer and attracting deal seekers, send out rewards to your consumers based on what they bought in the past.
Incentivize ConsumptionIdentify consumers who have bought a small pack and offer them a reward for upsizing. Instead of waiting for a few months to change a package or get the retail shelf communication materials done, launch a promotion through a click of a button. Send out rewards to those consumers who have bought your products or in your category.
Promotion Efficacy AnalyticsTest the efficacy of your promotions before a nationwide roll-out. Run an A/B test to understand the efficacy of your different promotions. The results of such a test can be used for a larger scale promotion that could be run through a retailer.
Run Shopper SurveysInteract directly in real-time with consumers who have bought your products and understand their purchase decisions better
Shopper AnalyticsAccess rich real-time data of shopper purchase habits across different retailers
With our solution, you pay only after a product is sold -- pay for performance


Preparation time
less than 30 mins
Cooking time
less than 10 mins
Serves
Serves 2
Homemade fish fingers are easy to make and cook in no time. Plus you know exactly what's in them! Try them in a pitta sandwich with spicy mayo.
In a shallow bowl whisk the egg. In another bowl combine the breadcrumbs and paprika, season with salt and pepper.
Dip the fish fingers into the egg, making sure they are completely coated and shaking off any excess. Then carefully dip the fish fingers in the breadcrumb mixture to coat them all over.
Heat the oil in a large frying pan over a medium-high heat. Fry the fish fingers for 2-3 minutes on each side until golden-brown and cooked through. Remove from the pan and drain on kitchen paper.
While the fish is cooking combine the mayonnaise, curry powder and lemon juice in a small bowl and set aside.
Serve the fish fingers in wholemeal pittas with the mayonnaise and lettuce.


Arch Linux is cool, but I need to ship software
Arch Linux is a very powerful and amazing linux distribution. You get full control on everything. It has bleeding edge software and it’s surprisingly stable if you know what you’re doing. However, sometimes, things can go wrong.
You want a really neat linux distribution with a rock solid package manager that lets you install whatever you want? You’re a linux power user tired of installing so many PPAs to get what you want (Ubuntu)? Arch Linux is what you’re looking for! It has a powerful package manager (pacman or you can also install aura), top notch documentation and it’s really fun to use. It may not be as easy as you’d think, but I’m sure you can get it to work. In this presentation, I talked about my journey with one of the most amazing Linux distro I ever used. <3
Enjoy the slides
Links you need to visit
Anthergos will make your setup easier (as shown by the step by step in the slides). The only sad thing about Anthergos is that the Arch community may bitch you for not using raw commands to setup your distro. I personally think it’s ok to use it. It’s cool to do everything by your own, but sometimes it’s easier with a UI. Way better than using windows anyway IMHO ;)
Oh and btw, you can use Arch Linux as a server, but I think it’s more clever to use a distro where all your coworkers are comfortable with.
Spoiler alert #1: I moved to Fedora
One thing I really liked about Fedora is its Problem Reporting application that comes with it.
My laptop was kind of easy to break. Bad Nvidia support, multi display glitches, CPU temperature above threshold, random crashes whatever reason, etc.
If you move to Fedora, you may like to use this cool software: Fedy.
Fedy lets you install multimedia codecs and additional software that Fedora doesn’t want to ship, such as MP3 support, Adobe Flash, Oracle Java, and much more, with just a few clicks. To install Fedy in Fedora, open a Terminal and run the following command:
Note: don’t install things from the internet before reading it, so read it first
Also, most of the internet will tell you to disable SELinux. Don’t do this. You’ll lose time with it and you won’t figure out it’s that piece of software that blocked your docker volumes (StackOverflow question), but you should really stop disabling selinux.
Spoiler alert #2: I returned to MacOS
Sometimes, your job gives you a laptop with an apple logo to ship ios apps. If that’s also your case, have a look to this amazing MacOS awesome list. Sounds like I’ll prepare a presentation about productivity tools on MacOS but in the meantime, have a look to Things I share to programmers.


Farm-Easy
🌡 33C
💨 15 Kmph
🌩 3% Chance
🔄 Seasons
⚠ No Alerts
Mumbai-xyz
Crop Suggestions
| Serial No. | Crop Name | Market Price (per kgs) |
Crop Type | Soil |
|---|---|---|---|---|
| 1. | Wheat | 100 | Rabi | Loamy Soil |
| 2. | Rice | 80 | Kharif | Clay soil |
| 3. | Jowar | 90 | Kharif | sandy loam |
| 4. | Pulses | 100 | Kharif | friable loam with porous sub-soil |
| 5. | Maize | 70 | Rabi(high yield) | sandy Clay |
| 6. | Bajra | 80 | Kharif | sandy soils, Black, Red |


--- layout: post title: Stack Overflow Developer Survey 2018 date: '2019-12-11T21:04:00.000+05:30' author: Sahil Rajput tags: modified_time: '2019-12-11T21:05:07.097+05:30' blogger_id: tag:blogger.com,1999:blog-5250005448924290719.post-549143388845920574 blogger_orig_url: https://www.jaadujinn.ml/2019/12/stack-overflow-developer-survey-2018.html ---


Money play. How should Red play 62?
pips Red=128 White=99
(CorrectAnswer= 0/0, ErrorScore= 0)
Red wants to do three thigs: cover the blot on his ace-point; escape a rear checker (with his three rear checkers on one point he could get into difficulty with something like 55) and provide outer board coverage in case White escapes.
Take one of the spare checkers on White’s 5-pt and put it on his 3-pt, giving him a four-point home board, and Red must play 9/1.
However, the blot on White’s 3-pt gives Red tactical possibilities. He can fulfil two of his objectives with 21/13 and that is the correct play by a long way. Now 9/1 is nearly a double blunder.
Take one of the spare checkers on White’s 5-pt and put it on his 3-pt, giving him a four-point home board, and Red must play 9/1.
However, the blot on White’s 3-pt gives Red tactical possibilities. He can fulfil two of his objectives with 21/13 and that is the correct play by a long way. Now 9/1 is nearly a double blunder.
1. Cubeful 2-ply 21/13 Eq.: -0.011 0.512 0.110 0.005 - 0.488 0.142 0.004 2. Cubeful 2-ply 9/1 Eq.: -0.064 (-0.054) 0.483 0.083 0.002 - 0.517 0.074 0.002 3. Cubeful 2-ply 21/15 9/7 Eq.: -0.082 (-0.071) 0.493 0.112 0.005 - 0.507 0.165 0.005 4. Cubeful 0-ply 21/15 5/3 Eq.: -0.207 (-0.196) 0.449 0.089 0.003 - 0.551 0.152 0.006 5. Cubeful 0-ply 21/15 3/1 Eq.: -0.250 (-0.239) 0.437 0.090 0.003 - 0.563 0.162 0.007


I’m a PhD candidate advised by Yulia Tsvetkov at Language Technologies Institute at Carnegie Mellon University. I’m currently at University of Washington as a visiting PhD student. Broadly, my research interests are in the area of natural language processing and computational social science. I am a recipient of KFAS Fellowship and was a research intern at Meta AI and Adobe Research.
Before joining CMU, I received my bachelor’s and master’s degrees from Yonsei University, South Korea.
For more information, please check my CV.
Research Interests
My research specifically centers on the importance of sociocultural knowledge within the context of NLP, investigating the ways in which language use differs based on people’s cultural and social background. I aim to enhance the sociocultural awareness of language technologies to improve their effectiveness, fairness, and adaptability to diverse populations. Additionally, I’m interested in making the latest language technologies more accessible and practical for other disciplines, such as social science, political science, and communication studies.
- NLP: community aware langauge models, domain adaptation, hate speech detection, affect analysis
- Computational Social Science: information campaigns, social norms
- AI Ethics: societal biases in data & models
News
Publications
2023
-
Chan Young Park*, Lucille Njoo*, Octavia Stappart, Marvin Thielk, Yi Chu, Yulia Tsvetkov
Preprint, 2023.
-
Jihyung Moon, Dong-Ho Lee, Hyundong Cho, Woojeong Jin, Chan Young Park, Minwoo Kim, Jonathan May, Jay Pujara, Sungjoon Park
Preprint, 2023.
-
Shangbin Feng, Chan Young Park, Yuhan Liu, Yulia Tsvetkov.
Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics, 2023.
2022
-
Chan Young Park*, Julia Mendelsohn*, Anjalie Field*, Yulia Tsvetkov
Findings of the Association for Computational Linguistics: EMNLP 2022.
-
Chan Young Park*, Anjalie Field*, Antonio Theophilo*, Jamelle Watson-Daniels, Yulia Tsvetkov
Proceedings of the National Academy of Sciences, 2022.
-
Anjalie Field, Chan Young Park, Kevin Z. Lin, Yulia Tsvetkov
Proceedings of the ACM Web Conference, 2022.
2021
-
Chan Young Park, Julia Mendelsohn, Karthik Radhakrishnan, Jain, Tushar Kanakagiri, David Jurgens, Yulia Tsvetkov
Findings of the Association for Computational Linguistics: EMNLP 2021.
-
Chan Young Park*, Xinru Yan*, Anjalie Field*, Yulia Tsvetkov
Proceedings of the International AAAI Conference on Web and Social Media, 2021.
-
Chan Young Park*, Jimin Sun*, Hwijeen Ahn*, Yulia Tsvetkov, David R Mortensen
Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume, 2021.
~2020
-
Chan Young Park*, Hwijeen Ahn*, Jimin Sun*, Jungyun Seo
Proceedings of the Fourteenth Workshop on Semantic Evaluation, 2020.
-
Chan Young Park, Yulia Tsvetkov.
Proceedings of the 3rd Workshop on Neural Generation and Translation, 2019.


Please enter a justification for your travel. This justification is needed for the proper payment of your travel. The justification should be very specific and even mention individual work packages of the project.
The info is not covered by the xml file. Please provide it here.


{% extends "smallhead.html" %} {% block title %}Simon Willison’s Weblog: Series of posts{% endblock %} {% block primary %}
{{ series.summary }}


Before Change
if "language" not in term:
return term.get("site", "")
lang = term["language"]
language_obj = Language.get(lang)
full_name = language_obj.language_name(description_language)
autonym = language_obj.autonym()
if full_name == autonym or autonym == lang:
return full_name
After Change
def full_language_name(term, description_language="en"):
if description_language != "en":
raise NotImplementedError(
"We don"t support non-English interface text yet."
)
if "language" not in term:
return term.get("site", "")
lang = term["language"]


Does Picnik use cookies?
Yes, Picnik sets a cookie to simply streamline the login process. But we do not use cookies to track your web surfing.
Are the images I upload to Picnik public?
Nope, not unless we've expressly given you an opportunity to make them public while saving a Picnik Show.
Can anyone use my image?
No. You own your images! The copyright for the image remains with you even after you use Picnik.
Even after you Picnik your image we will never use it without your direct consent.
If, for example, we want to feature you for our blog we'll contact you before ever publishing your work.
And even then, we only view Picniked photos that our users post to public sites.
Does Picnik save email addresses?
Picnik will only save your personal email so we can keep you up to date. We do not store email addresses of anyone you email photos to.
Will any of my personal information be shared with 3rd parties?
No. If it were up to us, spammers would be tarred and feathered. Also, if Picnik becomes involved in a merger, acquisition, or any form of sale of some or all of its assets, we will provide notice before personal information is transferred and becomes subject to a different privacy policy.
Does Picnik store my Flickr password?
No, your Flickr password is never revealed to Picnik. You can also revoke Picnik's access to Flickr at any time through your Flickr account settings.
Will this privacy policy change?
As Picnik evolves, this privacy policy is likely to evolve with it. We will not reduce your rights under this Policy without your explicit consent. Regardless, we will post any Policy changes on this page and, if the changes are significant, we will provide a more prominent notice (including, for certain services, email notification of Policy changes). Each version of this Policy will be identified at the top of the page by its effective date, and we will also keep prior versions of our privacy policy in an archive for your review. We will continue to always keep our users apprised of updates.
We also adhere to the US Safe Harbor Privacy Principles. For more information about the U.S. Department of Commerce’s Safe harbor principles, see the Department of Commerce's web site.
If you've got any questions or concerns, please feel free to contact us or write to us at ‘Privacy Matters’, Google, 1932 First Ave, Suite 716, Seattle WA, 98101.


Java Servlets
- Java objects that are intended to play the role of server components in client-server communications.
- handles client request by generating responses to such requests.
- part of the Java EE specification (see Java Servlet API for more details).
- hosted in a 'servlet container' that provides the environment in which the servlet runs, as well as controls the 'servlet lifecycle'.
Servlet Lifecycle
- instantiation => constructor call
- creates an instance of the servlet to service client requests.
- invoked implicity by the servlet container when the servlet is called upon to service a client request and no instance currently exists.
- initialization => init() method
- invoked only once and is intended for any startup initialization code for the servlet.
- request handling => service() method
- invoked for each client request.
- servlet performs whatever logic necessary in order to serve the request and generate a response.
- multiple client requests are typically handled by a single, multi threaded servlet instance; thus, care must be exercised to ensure that the code being run by the servlet is 'thread-safe'.
- destruction => destroy() method
- invoked before the servlet instance is 'unloaded', and is intended for any 'housekeeping' code that the servlet may need to run.
HTTPServlet
- Java servlet used to handle HTTP requests and generate HTTP responses.
- hosted in a 'Web container', which is a component in a Java 'application server' (e.g., Apache Tomcat, Red Har JBoss/WildFly, Oracle GlassFish, IBM WebSphere, etc.).
- the service() method call is routed to a doXXX() call, depending on the HTTP request method, e.g., doGet(), doPost(), doHead(), doPut(), doDelete(), etc.
- the doXXX() methods are passed two arguments:
- HTTPServletRequest
- object representation of the HTTP request sent by the client and received by the servlet.
- HttpServletResponse
- object representation of the HTTP reponse generated by the servlet and sent back to the requesting client.
- used to set information in the response message (e.g., HTTP response status code, message headers, message payload, etc.).
- * the web container facilitates the conversion to and from the HTTP request/response message to HTTPServletRequest/HTTPServletResponse.


For Project 1, we need to create a very deliberate visual language that attempts to communicate something about myself and the world I live in.
Things that we are sharing in our world is the celebration of the various festival. In those festivals, we are sharing the same culture and emotions. Since we do not know whom we communicate with, my idea is to display the distinct elements in those festivals. I use the clock to represent Months since they all have 12 parts and all represent time.
1.1 New Year's Day
2.14 Valtine's Day
3.8 International Women's Day
4.23 World Book Day
5.1 International Worker's Day
6.1 International Children's Day
7.20 Human Moon Day
8.23 International Left Handers Day
9.21 International Day of Peace
10.31 Halloween
11.20 Transgender Day of Remembrance
12.25 Christmas


If the CSS properties to customize the macro-carousel navigation buttons are not enough for your needs, you can always use any custom UI and call the previous() and next() functions.
macro-carousel
previous()
next()


I graduated from California State University, Long Beach Fall 2018 with a BS in Computer Science.
I am currently looking for entry-level software development positions.
I find programming as a nice mental exercise for my brain.
 It is one of the mediums that defined who I am today. I play a variety of different games on my consoles, my pc, and my smartphone.
I watch a variety of different shows and media in my day to day life.!
BS in Computer Science GPA: 3.936
Here are some of the classes I took, the languages I became familiar with, and the skills I learned.


I am a self-taught Web Developer, currently focusing on Front-End Development and aspiring to be a Full-Stack Developer by the end of the year. What lead me down these path is my deep love for coding. My passion for Web development started in my previous role at the Co-op, when my manager gave me a website project to have a look at, to see what needed updating and how to go about making the new changes. This was how I got a taste for developing and I realized I wanted to learn more, so much more.
I ended up doing some aspect of Front-End Web development for a year, website (Internet and Intranet) content updating and creating via Episerver CMS (The Co-op's content management system). I learned on the job, but only the aspects that I needed to get the job done.
I am currently also learning Android Development via Udacity thanks to a Google Scholarship I received at the start of the year in January. I completed the first 3 months in April and I have already created 3 Android projects. I was picked for the second part of the scholarship based on my projects and other requirements. A successful completion of the course in July will entitle me to a Nanodegree in Android Development.
I am proficient in HTML, CSS, XML and Java. I have just recently learned Sass, Javascript, Jquery, Python and Reactjs. I think what makes me competent at this languages and frameworks is that I am able to look up documentations and I utilize Test-driven Development(TDD), a programming technique. My projects can be found in my portfolio.
I am a versatile programmer with knowledge and interest to learn and code, and in the past 5 months, I have been enriching my knowledge on all things digital. I have completed a course on how to use the command line using Linux server, Version control using Git and Github, Material design, Java, Javascript, Python, and a variety of frameworks.
I have been studying via Udacity and a variety of online schools and resources, including W3Schools, FreeCodeCamp and CodeAcademy. My CodeAcademy profile is linked in my resume, which shows a list of skills I have completed.
I also attended my first live coding event in May at CodeUp Manchester, a once a month mentoring program for adults who would like to learn how to code. It was great to meet like-minded people, who are all on different levels and are all actively learning. It was definitely a change from coding alone in my flat every day.
I am also someone that likes to get involved, for example in year 10, I was elected the school council representative for my form. It was an experience I really enjoyed so I continued on in my year 11 and university too. I am self-aware and know how to play to my strengths.
So far in my career journey, I like to think that have been incredibly lucky in working for organizations that genuinely care and shared similar values and principles to mine and would also help enrich them. Hence what attracted me to the Co-op, my previous employer. The Co-op was a perfect fit for me because I also have a genuine commitment to social impact and the Co-op values, which is evident by my involvement in fundraising and being involved in my local community.
I am also someone that eager to learn and develop new skills to achieve the highest standards. While at the Co-op I took part in Agile training to improve and introduce a more Agile way of working, which I think has improved my ability to respond far more quickly to change and provide a way to implement high-priority initiatives. It has also been very useful for learning, as it allows me to organize my time well and prioritize. I am also highly motivated and career driven, hence why I joined Aspire (Co-op Women Career Network) while at the Co-op because I am someone who is proactive and take ownership of my own personal development and career progression.
I have always loved writing and have recently just started sharing my work. My stories can be found on Medium and in the stories section. I am an avid biker since getting a bike through the cycle to work scheme in July 2016, and according to my bike computer, I have completed 245.10 miles so far.
I am a very outdoorsy active person. I love hiking, canoeing, rock climbing and swimming is an all time favorite of mine. I love listening to music, art and craft, reading, and spending time with my friends and family, especially my two nephews. Cooking and baking is also something I like to do in my spare time as it is a very creative activity and it helps me relax.
I love to travel and experience different cultures. I just came back from an astonishing breathtaking travel to Tokyo and Kyoto in January. I am still tempted to pack up and move to Tokyo. I also visited Cyprus and the Troodos Mountain in March. Pictures can be found in the travel section and if you will like to read more, check out the stories section of my website.


Incredible picture shows lion cub letting out its first roar
by Chris CiacciaIn the jungle, the mighty jungle, the lion ... roars tonight.
A wildlife photographer has captured the moment a lion cub bellowed its first roar, reminiscent of a famous scene in the Disney movie "The Lion King."
Paul Mahagi snapped the incredible image while hiding in the bushes at Serengeti National Park, news agency SWNS reports.
HILARIOUS VIDEO SHOWS LION CUB SPOOKING HER MOM
"The cub is just a few days old — it was his first big roar," Mahagi said of the miniature, albeit mighty mammal. "I posted the picture online and everyone said it looks like Simba from the Lion King. I was in the bushes when I took it. I'm always hunting for the best photos."
Mahagi, 38, added that he was a little more than 300 feet (about 100 meters) away when he took the photo and that the mother lion was close to him.
"I work as a driver and guide so photography is a part of my job," Mahagi said, adding that he first learned photography in 2006.
CLICK HERE TO GET THE FOX NEWS APP


Against The Grain is an up and coming brewery and pubhouse. They are known for their unique beer artwork. Located right next to the Riverbats stadium the brewpub is an excellent way to end a night at the ball game.
Apocalypse Brew Works opened up in 2012 and specializes in small-batch fresh craft beer. Since then they have slowly been making more and more appearances in local Louisville bars with no signs of slowing down.
BBC is the oldest Microbrewery/Prewpub in Louisville. It has three different locations in Louisville. The Bourbon Barrel Stout is incredibly popular and sought after even outside of Louisville.
Falls City opened originally in 1905 and was a Louisville staple for years before going under in 1978. Over 30 years later in 2010 the brand was revived. It's signature Falls City Pale Ale is a classic but they aren't stuck in the past with new beers coming out constantly.
Goodwood is a production brewery in downtown Louisville. It is dedicated to making beer that has been touched by wood. They use reclaimed oak casks once used to house bourbon, red wine, and brandy or seasoned on oak, poplar or ash.


Welcome to my webpage!
My Social Media Platforms:
• - conducting analysis of metadata - conducting target analysis and research - identifying target communications within a global network - performing global network analysis and mapping - using knowledge of customer requirements to analyze and process intelligence information - performing exploitation on operations on target networks
• Performed the optimization, validation and analysis of large data for top fashion companies such as Banana Republic, Ralph Lauren, GAP, J. Crew, Ann Taylor, Calvin Klein, Club Monaco and more. Built a "Price Index Database" which can store can store all types of different client and agent information using back end mySQL and front end JDBC. Developed a program that retrieves unique client information and data from a CSV file and populates the database. Built a company website using HTML and CSS.
• Manage staff of 6 employees during any given shift; assigning everyone to a different specific role to maximize productivity and profitability. Balance till nightly in order to ensure accurate drops and bank deposits.
• For a summer I was sales manager for “Pier Surf”, a surf store on the Hermosa Beach pier. Organized and counted incoming inventory using excel spreadsheets, addressed all customer inquiries, and worked at the cash register when needed.
GPA: 3.7/4
GPA: 3.9/4


@page.video.youtubeId.map { youtubeId =>
}.getOrElse {
}
Sorry, your browser is unable to play this video.
Please upgrade to a modern browser and try again.
@for(source <- page.video.sources) {
Please upgrade to a modern browser and try again.
@Html(page.standfirst)
@hostedExplainer(onAmp = true)


Configure and run standalone or coupled earth surface dynamics models and tools from your web browser.


Match play. Red leads 2-0 to 7. Should Red double? If doubled, should White take?
pips Red=169 White=164
(CorrectAnswer= 0/0, ErrorScore= 0)
Red has the rack but only eight checkers in the attack zone. The race is equal. At 0-0 or 1-0 the threats would make this a good double but an easy take.
At 2-0 Red is better to wait, although it is close.
At 2-0 Red is better to wait, although it is close.
Cube analysis 2-ply cubeless equity +0.556 (Money: +0.568) 0.666 0.287 0.023 - 0.334 0.071 0.003 Cubeful equities: 1. No double +0.716 2. Double, pass +1.000 (+0.284) 3. Double, take +0.709 (-0.008) Proper cube action: No double, take (2.6%)


Anakin
Skywalker
Obi-Wan
Kenobi
Han
Solo
Luke
Skywalker
Darth
Vader
Select Player
Status
Health:
Attack:
Select Enemy
Status
Health:
Defense:
ATTACK
RESET


Chapter - Year 2017
SIBLING & SPOUSE GET TOGETHER – JUNE 17, 2017
It was our turn to host my siblings/spouse get together which we have every three months. Kim & Jeanenne are on their mission to South Africa, so of course, they were not here, but the rest of us were – Bryce & Deanna, Terry & Angela, Georgia & Rick and Ken & I. I made twice cooked potatoes, mixed vegetables, fruit salad, tossed salad, my delicious cake/Danish desert/strawberry desert, and I bought & warmed up the rolls. Ken grilled big trout, chicken breasts and steaks. We enjoyed visiting as we ate, and we sat at the table quite a while and kept visiting, then us ladies went into the living room where we continued to visit and the guys went out on our patio and played games on the patio table & chairs as it was cooler out there. Then we all got together and played Mormon Bridge and Catch Phase. It was an enjoyable day.


Welcome to the histogram section of the R graph gallery. If you want to know more about this kind of chart, visit data-to-viz.com. If you're looking for a simple way to implement it in R, pick an example below.
Histograms can be built with ggplot2
thanks to the geom_histogram()
function. It requires only 1 numeric variable as input. This function automatically cut the variable in bins and count the number of data point per bin. Remember to try different bin size using the binwidth
argument.
Of course it is possible to build high quality histograms without ggplot2
or the tidyverse
. Here are a few examples illustrating how to proceed.


Go to the source code of this file.
|
| Program to claculate Bearing Capacity clc clear Initialisation[PRE-PROCESSING] Following are the main variables used No explanation is given as names are self explanatory load input mat load dataFile mat Variable initialisation | Global_stiffness_matrix (Number_of_nodes, Number_of_nodes)=0 |
| |
| Program to claculate Bearing Capacity clc clear Initialisation [PRE-PROCESSING] Following are the main variables used No explanation is given as names are self explanatory load input mat load dataFile mat Variable initialisation Global_stiffness_matrix |
( |
Number_of_nodes |
, |
|
|
Number_of_nodes |
|
|
) |
| |
|
pure virtual |
Initial value:= interp1(Bearing_capacity_factors(:,1), ...
Bearing_capacity_factors(:,2),
phiPrime)
Definition at line 20 of file main.m.
Initial value:= interp1(Bearing_capacity_factors(:,1), ...
Bearing_capacity_factors(:,4),
phiPrime)
Definition at line 24 of file main.m.
Initial value:= interp1(Bearing_capacity_factors(:,1), ...
Bearing_capacity_factors(:,3),
phiPrime)
Definition at line 22 of file main.m.
| phiPrime = atand(0.67 * tand(phi)) |


In recent years, Deep Neural Networks have become an essential tool for many machine learning tasks, especially image classification. However, this has given rise to the study of adversarial samples - carefully crafted inputs for a neural network that result in an incorrect classification.
In the spirit of the TensorFlow Playground, we present the Adversarial Text Playground: a web-based visualization tool to assist users in understanding the differences between common adversarial machine learning techniques. This application is based off of a previous project from the QData group: Andrew Norton's Adversarial Playground, however this application focuses on adversarial attacks on text. Adversarial Text Playground makes a number of additions and improvements to help better educate and interact with users about how adversarial examples work. This project adds three new goals of user-friendliness, visual aid, and extendibility to Norton’s original goals for Adversarial-Playground to be educational, modular, interactive.
About the Attacks
DeepWordBug Algorithm
The core idea of this algorithm is to generate efficient adversarial samples on text input. The algorithm can attack text sequence inputs in a fast, black-box manner. DeepWordBug presents novel scoring strategies, outlined below, to identify critical tokens in a text sequence input that, if modified, can cause classifiers to incorrectly classify inputs with a high probability. Simple character-level transformations are applied to those highest-ranked critical tokens to minimize the differences, also known as the edit distance, between the original input and the generated adversarial example. For most effective usage, please input a text sequence of at least 5 words.
All outputs will be displayed in lowercase
Notable features of the DeepWordBug are the model, power, transformer algorithm, and scoring algorithm.
- Model:
This describes the underlying dataset being used in the DeepWordBug algorithm.
(0) AG News: Inputs are classified into typical news category.
(1) Amazon Review (Full): Full means that a full rating system between 1 and 5 stars is used.
(2) Amazon Review (Polarity): Polarity is more simplistic than the Full system since it only classifies inputs as Negative or Positive
(3) DBPedia: Inputs are classified into the encyclopedia topic category that fits the input the best.
(5) Yahoo Answers: Inputs are classified into the category they would be placed in if a question were asked on Yahoo Answers.
(6) Yelp Review (Full): 1-5 Stars
(7) Yelp Review (Polarity): Negative or positive
* Dataset 4 was omitted, because it is for Chinese Pinyin.
- Power:
The number of words per sequence that will be modified. If this number is higher than the length of the text sequence, then all the words in the sequence will be modified.
- Scoring Algorithm:
(1) Combined: Combination of the next two options Combined_score(x) = THS(x) + λ(TTS(x))
(2) Temporal: aka Temporal Head Score (THS) is the difference between the model’s prediction score as it reads up to the ith token and the model’s prediction score as it reads up to the (i-1)th token.
(3) Tail: aka Temporal Tail Score (TTS) is the complement of the THS. TTS computes the difference between two trailing parts of an input sequence where one contains the token and the other does not.
(4) Replaceone: Score of the sequence with and without the token.
(5) Random (baseline): This scoring function randomly selects tokens as targets. In other words, it has no method to determine which tokens to attack.
(6) Gradient (baseline): Contrary to random selection which uses no knowledge of the model, we also compare to full knowledge of the model, where gradients are used to find the most important tokens.
- Transformer Algorithm:
(1) Homoglyph: Replace character with a similar-looking, yet different character. This is the best performing transformer.
(2) Swap: Swap two adjacent letters in the word.
(3) Substitution: Substitute a letter in the word with a random letter.
(4) Deletion: Delete a random letter from the word. The deletion is displayed with a red _ underscore character.
(5) Insertion: Insert a random letter in the word.


"I am a student at the field of marketing, however I am interested in web development and design. In my free time I make posters, flyers and Facebook event covers for non-profit and youth organisations. My passion is learning and creating new things that are useful for people or make the world a better place. I enjoy contributing to exciting projects related to art, culture or charity issues, even if I work as a volunteer."