text:
← 2 Common infrastructure — Table of Contents — 2.4 URLs →
2.3 Common microsyntaxes
2.3.1 Common parser idioms
2.3.2 Boolean attributes
2.3.3 Keywords and enumerated attributes
2.3.4 Numbers
2.3.4.1 Signed integers
2.3.4.2 Non-negative integers
2.3.4.3 Floating-point numbers
2.3.4.4 Percentages and lengths
2.3.4.5 Non-zero percentages and lengths
2.3.4.6 Lists of floating-point numbers
2.3.4.7 Lists of dimensions
2.3.5 Dates and times
2.3.5.1 Months
2.3.5.2 Dates
2.3.5.3 Yearless dates
2.3.5.4 Times
2.3.5.5 Local dates and times
2.3.5.6 Time zones
2.3.5.7 Global dates and times
2.3.5.8 Weeks
2.3.5.9 Durations
2.3.5.10 Vaguer moments in time
2.3.6 Colors
2.3.7 Space-separated tokens
2.3.8 Comma-separated tokens
2.3.9 References
2.3.10 Media queries
There are various places in HTML that accept particular data types, such as dates or numbers. This section describes what the conformance criteria for content in those formats is, and how to parse them.
Implementors are strongly urged to carefully examine any third-party libraries they might consider using to implement the parsing of syntaxes described below. For example, date libraries are likely to implement error handling behavior that differs from what is required in this specification, since error-handling behavior is often not defined in specifications that describe date syntaxes similar to those used in this specification, and thus implementations tend to vary greatly in how they handle errors.
Some of the micro-parsers described below follow the pattern of having an input variable that holds the string being parsed, and having a position variable pointing at the next character to parse in input.
A number of attributes are boolean attributes. The presence of a boolean attribute on an element represents the true value, and the absence of the attribute represents the false value.
If the attribute is present, its value must either be the empty string or a value that is an ASCII case-insensitive match for the attribute's canonical name, with no leading or trailing whitespace.
The values "true" and "false" are not allowed on boolean attributes. To represent a false value, the attribute has to be omitted altogether.
Here is an example of a checkbox that is checked and disabled. The checked and disabled attributes are the boolean attributes.
<input type=checkbox checked name=cheese disabled> Cheese
This could be equivalently written as this:
<input type=checkbox checked=checked name=cheese disabled=disabled> Cheese
You can also mix styles; the following is still equivalent:
<input type='checkbox' checked name=cheese disabled=""> Cheese
Some attributes are defined as taking one of a finite set of keywords. Such attributes are called enumerated attributes. The keywords are each defined to map to a particular state (several keywords might map to the same state, in which case some of the keywords are synonyms of each other; additionally, some of the keywords can be said to be non-conforming, and are only in the specification for historical reasons). In addition, two default states can be given. The first is the invalid value default, the second is the missing value default.
If an enumerated attribute is specified, the attribute's value must be an ASCII case-insensitive match for one of the given keywords that are not said to be non-conforming, with no leading or trailing whitespace.
When the attribute is specified, if its value is an ASCII case-insensitive match for one of the given keywords then that keyword's state is the state that the attribute represents. If the attribute value matches none of the given keywords, but the attribute has an invalid value default, then the attribute represents that state. Otherwise, there is no default, and invalid values mean that there is no state represented.
When the attribute is not specified, if there is a missing value default state defined, then that is the state represented by the (missing) attribute. Otherwise, the absence of the attribute means that there is no state represented.
The empty string can be a valid keyword.
A string is a valid integer if it consists of one or more ASCII digits, optionally prefixed with a U+002D HYPHEN-MINUS character (-).
A valid integer without a U+002D HYPHEN-MINUS (-) prefix represents the number that is represented in base ten by that string of digits. A valid integer with a U+002D HYPHEN-MINUS (-) prefix represents the number represented in base ten by the string of digits that follows the U+002D HYPHEN-MINUS, subtracted from zero.
The rules for parsing integers are as given in the following algorithm. When invoked, the steps must be followed in the order given, aborting at the first step that returns a value. This algorithm will return either an integer or an error.
Let input be the string being parsed.
Let position be a pointer into input, initially pointing at the start of the string.
Let sign have the value "positive".
Skip ASCII whitespace within input given position.
If position is past the end of input, return an error.
If the character indicated by position (the first character) is a U+002D HYPHEN-MINUS character (-):
Let sign be "negative".
Advance position to the next character.
Otherwise, if the character indicated by position (the first character) is a U+002B PLUS SIGN character (+):
Advance position to the next character. (The "+" is ignored, but it is not conforming.)
If the character indicated by position is not an ASCII digit, then return an error.
Collect a sequence of code points that are ASCII digits from input given position, and interpret the resulting sequence as a base-ten integer. Let value be that integer.
If sign is "positive", return value, otherwise return the result of subtracting value from zero.
A string is a valid non-negative integer if it consists of one or more ASCII digits.
A valid non-negative integer represents the number that is represented in base ten by that string of digits.
The rules for parsing non-negative integers are as given in the following algorithm. When invoked, the steps must be followed in the order given, aborting at the first step that returns a value. This algorithm will return either zero, a positive integer, or an error.
Let value be the result of parsing input using the rules for parsing integers.
If value is an error, return an error.
If value is less than zero, return an error.
A string is a valid floating-point number if it consists of:
Optionally, a U+002D HYPHEN-MINUS character (-).
One or both of the following, in the given order:
A series of one or more ASCII digits.
Both of the following, in the given order:
A single U+002E FULL STOP character (.).
Optionally:
Either a U+0065 LATIN SMALL LETTER E character (e) or a U+0045 LATIN CAPITAL LETTER E character (E).
Optionally, a U+002D HYPHEN-MINUS character (-) or U+002B PLUS SIGN character (+).
A valid floating-point number represents the number obtained by multiplying the significand by ten raised to the power of the exponent, where the significand is the first number, interpreted as base ten (including the decimal point and the number after the decimal point, if any, and interpreting the significand as a negative number if the whole string starts with a U+002D HYPHEN-MINUS character (-) and the number is not zero), and where the exponent is the number after the E, if any (interpreted as a negative number if there is a U+002D HYPHEN-MINUS character (-) between the E and the number and the number is not zero, or else ignoring a U+002B PLUS SIGN character (+) between the E and the number if there is one). If there is no E, then the exponent is treated as zero.
The Infinity and Not-a-Number (NaN) values are not valid floating-point numbers.
The valid floating-point number concept is typically only used to restrict what is allowed for authors, while the user agent requirements use the rules for parsing floating-point number values below (e.g., the max attribute of the progress element). However, in some cases the user agent requirements include checking if a string is a valid floating-point number (e.g., the value sanitization algorithm for the Number state of the input element, or the parse a srcset attribute algorithm).
The best representation of the number n as a floating-point number is the string obtained from running ToString(n). The abstract operation ToString is not uniquely determined. When there are multiple possible strings that could be obtained from ToString for a particular value, the user agent must always return the same string for that value (though it may differ from the value used by other user agents).
The rules for parsing floating-point number values are as given in the following algorithm. This algorithm must be aborted at the first step that returns something. This algorithm will return either a number or an error.
Let value have the value 1.
Let divisor have the value 1.
Let exponent have the value 1.
If the character indicated by position is a U+002D HYPHEN-MINUS character (-):
Change value and divisor to −1.
If the character indicated by position is a U+002E FULL STOP (.), and that is not the last character in input, and the character after the character indicated by position is an ASCII digit, then set value to zero and jump to the step labeled fraction.
Collect a sequence of code points that are ASCII digits from input given position, and interpret the resulting sequence as a base-ten integer. Multiply value by that integer.
If position is past the end of input, jump to the step labeled conversion.
Fraction: If the character indicated by position is a U+002E FULL STOP (.), run these substeps:
If position is past the end of input, or if the character indicated by position is not an ASCII digit, U+0065 LATIN SMALL LETTER E (e), or U+0045 LATIN CAPITAL LETTER E (E), then jump to the step labeled conversion.
If the character indicated by position is a U+0065 LATIN SMALL LETTER E character (e) or a U+0045 LATIN CAPITAL LETTER E character (E), skip the remainder of these substeps.
Fraction loop: Multiply divisor by ten.
Add the value of the character indicated by position, interpreted as a base-ten digit (0..9) and divided by divisor, to value.
If position is past the end of input, then jump to the step labeled conversion.
If the character indicated by position is an ASCII digit, jump back to the step labeled fraction loop in these substeps.
If the character indicated by position is U+0065 (e) or a U+0045 (E), then:
Change exponent to −1.
Otherwise, if the character indicated by position is a U+002B PLUS SIGN character (+):
If the character indicated by position is not an ASCII digit, then jump to the step labeled conversion.
Collect a sequence of code points that are ASCII digits from input given position, and interpret the resulting sequence as a base-ten integer. Multiply exponent by that integer.
Multiply value by ten raised to the exponentth power.
Conversion: Let S be the set of finite IEEE 754 double-precision floating-point values except −0, but with two special values added: 21024 and −21024.
Let rounded-value be the number in S that is closest to value, selecting the number with an even significand if there are two equally close values. (The two special values 21024 and −21024 are considered to have even significands for this purpose.)
If rounded-value is 21024 or −21024, return an error.
Return rounded-value.
The rules for parsing dimension values are as given in the following algorithm. When invoked, the steps must be followed in the order given, aborting at the first step that returns a value. This algorithm will return either a number greater than or equal to 0.0, or failure; if a number is returned, then it is further categorized as either a percentage or a length.
Let position be a position variable for input, initially pointing at the start of input.
If position is past the end of input or the code point at position within input is not an ASCII digit, then return failure.
Collect a sequence of code points that are ASCII digits from input given position, and interpret the resulting sequence as a base-ten integer. Let value be that number.
If position is past the end of input, then return value as a length.
If the code point at position within input is U+002E (.), then:
Advance position by 1.
If position is past the end of input or the code point at position within input is not an ASCII digit, then return the current dimension value with value, input, and position.
Multiply divisor by ten.
Add the value of the code point at position within input, interpreted as a base-ten digit (0..9) and divided by divisor, to value.
If the code point at position within input is not an ASCII digit, then break.
Return the current dimension value with value, input, and position.
The current dimension value, given value, input, and position, is determined as follows:
If the code point at position within input is U+0025 (%), then return value as a percentage.
Return value as a length.
The rules for parsing nonzero dimension values are as given in the following algorithm. When invoked, the steps must be followed in the order given, aborting at the first step that returns a value. This algorithm will return either a number greater than 0.0, or an error; if a number is returned, then it is further categorized as either a percentage or a length.
Let value be the result of parsing input using the rules for parsing dimension values.
If value is zero, return an error.
If value is a percentage, return value as a percentage.
A valid list of floating-point numbers is a number of valid floating-point numbers separated by U+002C COMMA characters, with no other characters (e.g. no ASCII whitespace). In addition, there might be restrictions on the number of floating-point numbers that can be given, or on the range of values allowed.
The rules for parsing a list of floating-point numbers are as follows:
Let numbers be an initially empty list of floating-point numbers. This list will be the result of this algorithm.
Collect a sequence of code points that are ASCII whitespace, U+002C COMMA, or U+003B SEMICOLON characters from input given position. This skips past any leading delimiters.
While position is not past the end of input:
Collect a sequence of code points that are not ASCII whitespace, U+002C COMMA, U+003B SEMICOLON, ASCII digits, U+002E FULL STOP, or U+002D HYPHEN-MINUS characters from input given position. This skips past leading garbage.
Collect a sequence of code points that are not ASCII whitespace, U+002C COMMA, or U+003B SEMICOLON characters from input given position, and let unparsed number be the result.
Let number be the result of parsing unparsed number using the rules for parsing floating-point number values.
If number is an error, set number to zero.
Append number to numbers.
Collect a sequence of code points that are ASCII whitespace, U+002C COMMA, or U+003B SEMICOLON characters from input given position. This skips past the delimiter.
Return numbers.
The rules for parsing a list of dimensions are as follows. These rules return a list of zero or more pairs consisting of a number and a unit, the unit being one of percentage, relative, and absolute.
Let raw input be the string being parsed.
If the last character in raw input is a U+002C COMMA character (,), then remove that character from raw input.
Split the string raw input on commas. Let raw tokens be the resulting list of tokens.
Let result be an empty list of number/unit pairs.
For each token in raw tokens, run the following substeps:
Let input be the token.
Let value be the number 0.
Let unit be absolute.
If position is past the end of input, set unit to relative and jump to the last substep.
If the character at position is an ASCII digit, collect a sequence of code points that are ASCII digits from input given position, interpret the resulting sequence as an integer in base ten, and increment value by that integer.
If the character at position is U+002E (.), then:
Collect a sequence of code points consisting of ASCII whitespace and ASCII digits from input given position. Let s be the resulting sequence.
Remove all ASCII whitespace in s.
If s is not the empty string, then:
Let length be the number of characters in s (after the spaces were removed).
Let fraction be the result of interpreting s as a base-ten integer, and then dividing that number by 10length.
Increment value by fraction.
If the character at position is a U+0025 PERCENT SIGN character (%), then set unit to percentage.
Otherwise, if the character at position is a U+002A ASTERISK character (*), then set unit to relative.
Add an entry to result consisting of the number given by value and the unit given by unit.
Return the list result.
In the algorithms below, the number of days in month month of year year is: 31 if month is 1, 3, 5, 7, 8, 10, or 12; 30 if month is 4, 6, 9, or 11; 29 if month is 2 and year is a number divisible by 400, or if year is a number divisible by 4 but not by 100; and 28 otherwise. This takes into account leap years in the Gregorian calendar. [GREGORIAN]
When ASCII digits are used in the date and time syntaxes defined in this section, they express numbers in base ten.
While the formats described here are intended to be subsets of the corresponding ISO8601 formats, this specification defines parsing rules in much more detail than ISO8601. Implementors are therefore encouraged to carefully examine any date parsing libraries before using them to implement the parsing rules described below; ISO8601 libraries might not parse dates and times in exactly the same manner. [ISO8601]
Where this specification refers to the proleptic Gregorian calendar, it means the modern Gregorian calendar, extrapolated backwards to year 1. A date in the proleptic Gregorian calendar, sometimes explicitly referred to as a proleptic-Gregorian date, is one that is described using that calendar even if that calendar was not in use at the time (or place) in question. [GREGORIAN]
The use of the Gregorian calendar as the wire format in this specification is an arbitrary choice resulting from the cultural biases of those involved in the decision. See also the section discussing date, time, and number formats in forms (for authors), implementation notes regarding localization of form controls, and the time element.
A month consists of a specific proleptic-Gregorian date with no time-zone information and no date information beyond a year and a month. [GREGORIAN]
A string is a valid month string representing a year year and month month if it consists of the following components in the given order:
Four or more ASCII digits, representing year, where year > 0
A U+002D HYPHEN-MINUS character (-)
Two ASCII digits, representing the month month, in the range 1 ≤ month ≤ 12
The rules to parse a month string are as follows. This will return either a year and month, or nothing. If at any point the algorithm says that it "fails", this means that it is aborted at that point and returns nothing.
Parse a month component to obtain year and month. If this returns nothing, then fail.
If position is not beyond the end of input, then fail.
Return year and month.
The rules to parse a month component, given an input string and a position, are as follows. This will return either a year and a month, or nothing. If at any point the algorithm says that it "fails", this means that it is aborted at that point and returns nothing.
Collect a sequence of code points that are ASCII digits from input given position. If the collected sequence is not at least four characters long, then fail. Otherwise, interpret the resulting sequence as a base-ten integer. Let that number be the year.
If year is not a number greater than zero, then fail.
If position is beyond the end of input or if the character at position is not a U+002D HYPHEN-MINUS character, then fail. Otherwise, move position forwards one character.
Collect a sequence of code points that are ASCII digits from input given position. If the collected sequence is not exactly two characters long, then fail. Otherwise, interpret the resulting sequence as a base-ten integer. Let that number be the month.
If month is not a number in the range 1 ≤ month ≤ 12, then fail.
A date consists of a specific proleptic-Gregorian date with no time-zone information, consisting of a year, a month, and a day. [GREGORIAN]
A string is a valid date string representing a year year, month month, and day day if it consists of the following components in the given order:
A valid month string, representing year and month
Two ASCII digits, representing day, in the range 1 ≤ day ≤ maxday where maxday is the number of days in the month month and year year
The rules to parse a date string are as follows. This will return either a date, or nothing. If at any point the algorithm says that it "fails", this means that it is aborted at that point and returns nothing.
Parse a date component to obtain year, month, and day. If this returns nothing, then fail.
Let date be the date with year year, month month, and day day.
Return date.
The rules to parse a date component, given an input string and a position, are as follows. This will return either a year, a month, and a day, or nothing. If at any point the algorithm says that it "fails", this means that it is aborted at that point and returns nothing.
Let maxday be the number of days in month month of year year.
Collect a sequence of code points that are ASCII digits from input given position. If the collected sequence is not exactly two characters long, then fail. Otherwise, interpret the resulting sequence as a base-ten integer. Let that number be the day.
If day is not a number in the range 1 ≤ day ≤ maxday, then fail.
Return year, month, and day.
A yearless date consists of a Gregorian month and a day within that month, but with no associated year. [GREGORIAN]
A string is a valid yearless date string representing a month month and a day day if it consists of the following components in the given order:
Optionally, two U+002D HYPHEN-MINUS characters (-)
Two ASCII digits, representing day, in the range 1 ≤ day ≤ maxday where maxday is the number of days in the month month and any arbitrary leap year (e.g. 4 or 2000)
In other words, if the month is "02", meaning February, then the day can be 29, as if the year was a leap year.
The rules to parse a yearless date string are as follows. This will return either a month and a day, or nothing. If at any point the algorithm says that it "fails", this means that it is aborted at that point and returns nothing.
Parse a yearless date component to obtain month and day. If this returns nothing, then fail.
Return month and day.
The rules to parse a yearless date component, given an input string and a position, are as follows. This will return either a month and a day, or nothing. If at any point the algorithm says that it "fails", this means that it is aborted at that point and returns nothing.
Collect a sequence of code points that are U+002D HYPHEN-MINUS characters (-) from input given position. If the collected sequence is not exactly zero or two characters long, then fail.
Let maxday be the number of days in month month of any arbitrary leap year (e.g. 4 or 2000).
A time consists of a specific time with no time-zone information, consisting of an hour, a minute, a second, and a fraction of a second.
A string is a valid time string representing an hour hour, a minute minute, and a second second if it consists of the following components in the given order:
Two ASCII digits, representing hour, in the range 0 ≤ hour ≤ 23
A U+003A COLON character (:)
Two ASCII digits, representing minute, in the range 0 ≤ minute ≤ 59
If second is nonzero, or optionally if second is zero:
Two ASCII digits, representing the integer part of second, in the range 0 ≤ s ≤ 59
If second is not an integer, or optionally if second is an integer:
A U+002E FULL STOP character (.)
One, two, or three ASCII digits, representing the fractional part of second
The second component cannot be 60 or 61; leap seconds cannot be represented.
The rules to parse a time string are as follows. This will return either a time, or nothing. If at any point the algorithm says that it "fails", this means that it is aborted at that point and returns nothing.
Parse a time component to obtain hour, minute, and second. If this returns nothing, then fail.
Let time be the time with hour hour, minute minute, and second second.
Return time.
The rules to parse a time component, given an input string and a position, are as follows. This will return either an hour, a minute, and a second, or nothing. If at any point the algorithm says that it "fails", this means that it is aborted at that point and returns nothing.
Collect a sequence of code points that are ASCII digits from input given position. If the collected sequence is not exactly two characters long, then fail. Otherwise, interpret the resulting sequence as a base-ten integer. Let that number be the hour.
If hour is not a number in the range 0 ≤ hour ≤ 23, then fail.
If position is beyond the end of input or if the character at position is not a U+003A COLON character, then fail. Otherwise, move position forwards one character.
Collect a sequence of code points that are ASCII digits from input given position. If the collected sequence is not exactly two characters long, then fail. Otherwise, interpret the resulting sequence as a base-ten integer. Let that number be the minute.
If minute is not a number in the range 0 ≤ minute ≤ 59, then fail.
Let second be 0.
If position is not beyond the end of input and the character at position is U+003A (:), then:
Advance position to the next character in input.
If position is beyond the end of input, or at the last character in input, or if the next two characters in input starting at position are not both ASCII digits, then fail.
Collect a sequence of code points that are either ASCII digits or U+002E FULL STOP characters from input given position. If the collected sequence is three characters long, or if it is longer than three characters long and the third character is not a U+002E FULL STOP character, or if it has more than one U+002E FULL STOP character, then fail. Otherwise, interpret the resulting sequence as a base-ten number (possibly with a fractional part). Set second to that number.
If second is not a number in the range 0 ≤ second < 60, then fail.
Return hour, minute, and second.
A local date and time consists of a specific proleptic-Gregorian date, consisting of a year, a month, and a day, and a time, consisting of an hour, a minute, a second, and a fraction of a second, but expressed without a time zone. [GREGORIAN]
A string is a valid local date and time string representing a date and time if it consists of the following components in the given order:
A valid date string representing the date
A U+0054 LATIN CAPITAL LETTER T character (T) or a U+0020 SPACE character
A valid time string representing the time
A string is a valid normalized local date and time string representing a date and time if it consists of the following components in the given order:
A U+0054 LATIN CAPITAL LETTER T character (T)
A valid time string representing the time, expressed as the shortest possible string for the given time (e.g. omitting the seconds component entirely if the given time is zero seconds past the minute)
The rules to parse a local date and time string are as follows. This will return either a date and time, or nothing. If at any point the algorithm says that it "fails", this means that it is aborted at that point and returns nothing.
If position is beyond the end of input or if the character at position is neither a U+0054 LATIN CAPITAL LETTER T character (T) nor a U+0020 SPACE character, then fail. Otherwise, move position forwards one character.
Return date and time.
A time-zone offset consists of a signed number of hours and minutes.
A string is a valid time-zone offset string representing a time-zone offset if it consists of either:
A U+005A LATIN CAPITAL LETTER Z character (Z), allowed only if the time zone is UTC
Or, the following components, in the given order:
Either a U+002B PLUS SIGN character (+) or, if the time-zone offset is not zero, a U+002D HYPHEN-MINUS character (-), representing the sign of the time-zone offset
Two ASCII digits, representing the hours component hour of the time-zone offset, in the range 0 ≤ hour ≤ 23
Optionally, a U+003A COLON character (:)
Two ASCII digits, representing the minutes component minute of the time-zone offset, in the range 0 ≤ minute ≤ 59
This format allows for time-zone offsets from -23:59 to +23:59. Right now, in practice, the range of offsets of actual time zones is -12:00 to +14:00, and the minutes component of offsets of actual time zones is always either 00, 30, or 45. There is no guarantee that this will remain so forever, however, since time zones are used as political footballs and are thus subject to very whimsical policy decisions.
See also the usage notes and examples in the global date and time section below for details on using time-zone offsets with historical times that predate the formation of formal time zones.
The rules to parse a time-zone offset string are as follows. This will return either a time-zone offset, or nothing. If at any point the algorithm says that it "fails", this means that it is aborted at that point and returns nothing.
Parse a time-zone offset component to obtain timezonehours and timezoneminutes. If this returns nothing, then fail.
Return the time-zone offset that is timezonehours hours and timezoneminutes minutes from UTC.
The rules to parse a time-zone offset component, given an input string and a position, are as follows. This will return either time-zone hours and time-zone minutes, or nothing. If at any point the algorithm says that it "fails", this means that it is aborted at that point and returns nothing.
If the character at position is a U+005A LATIN CAPITAL LETTER Z character (Z), then:
Let timezonehours be 0.
Let timezoneminutes be 0.
Otherwise, if the character at position is either a U+002B PLUS SIGN (+) or a U+002D HYPHEN-MINUS (-), then:
If the character at position is a U+002B PLUS SIGN (+), let sign be "positive". Otherwise, it's a U+002D HYPHEN-MINUS (-); let sign be "negative".
Collect a sequence of code points that are ASCII digits from input given position. Let s be the collected sequence.
If s is exactly two characters long, then:
Interpret s as a base-ten integer. Let that number be the timezonehours.
Collect a sequence of code points that are ASCII digits from input given position. If the collected sequence is not exactly two characters long, then fail. Otherwise, interpret the resulting sequence as a base-ten integer. Let that number be the timezoneminutes.
If s is exactly four characters long, then:
Interpret the first two characters of s as a base-ten integer. Let that number be the timezonehours.
Interpret the last two characters of s as a base-ten integer. Let that number be the timezoneminutes.
Otherwise, fail.
If timezonehours is not a number in the range 0 ≤ timezonehours ≤ 23, then fail.
If sign is "negative", then negate timezonehours.
If timezoneminutes is not a number in the range 0 ≤ timezoneminutes ≤ 59, then fail.
If sign is "negative", then negate timezoneminutes.
Return timezonehours and timezoneminutes.
A global date and time consists of a specific proleptic-Gregorian date, consisting of a year, a month, and a day, and a time, consisting of an hour, a minute, a second, and a fraction of a second, expressed with a time-zone offset, consisting of a signed number of hours and minutes. [GREGORIAN]
A string is a valid global date and time string representing a date, time, and a time-zone offset if it consists of the following components in the given order:
A valid time-zone offset string representing the time-zone offset
Times in dates before the formation of UTC in the mid twentieth century must be expressed and interpreted in terms of UT1 (contemporary Earth solar time at the 0° longitude), not UTC (the approximation of UT1 that ticks in SI seconds). Time before the formation of time zones must be expressed and interpreted as UT1 times with explicit time zones that approximate the contemporary difference between the appropriate local time and the time observed at the location of Greenwich, London.
The following are some examples of dates written as valid global date and time strings.
"0037-12-13 00:00Z"
Midnight in areas using London time on the birthday of Nero (the Roman Emperor). See below for further discussion on which date this actually corresponds to.
"1979-10-14T12:00:00.001-04:00"
One millisecond after noon on October 14th 1979, in the time zone in use on the east coast of the USA during daylight saving time.
"8592-01-01T02:09+02:09"
Midnight UTC on the 1st of January, 8592. The time zone associated with that time is two hours and nine minutes ahead of UTC, which is not currently a real time zone, but is nonetheless allowed.
Several things are notable about these dates:
Years with fewer than four digits have to be zero-padded. The date "37-12-13" would not be a valid date.
If the "T" is replaced by a space, it must be a single space character. The string "2001-12-21 12:00Z" (with two spaces between the components) would not be parsed successfully.
To unambiguously identify a moment in time prior to the introduction of the Gregorian calendar (insofar as moments in time before the formation of UTC can be unambiguously identified), the date has to be first converted to the Gregorian calendar from the calendar in use at the time (e.g. from the Julian calendar). The date of Nero's birth is the 15th of December 37, in the Julian Calendar, which is the 13th of December 37 in the proleptic Gregorian calendar.
The time and time-zone offset components are not optional.
Dates before the year one can't be represented as a datetime in this version of HTML.
Times of specific events in ancient times are, at best, approximations, since time was not well coordinated or measured until relatively recent decades.
Time-zone offsets differ based on daylight saving time.
The rules to parse a global date and time string are as follows. This will return either a time in UTC, with associated time-zone offset information for round-tripping or display purposes, or nothing. If at any point the algorithm says that it "fails", this means that it is aborted at that point and returns nothing.
If position is beyond the end of input, then fail.
Let time be the moment in time at year year, month month, day day, hours hour, minute minute, second second, subtracting timezonehours hours and timezoneminutes minutes. That moment in time is a moment in the UTC time zone.
Let timezone be timezonehours hours and timezoneminutes minutes from UTC.
Return time and timezone.
A week consists of a week-year number and a week number representing a seven-day period starting on a Monday. Each week-year in this calendaring system has either 52 or 53 such seven-day periods, as defined below. The seven-day period starting on the Gregorian date Monday December 29th 1969 (1969-12-29) is defined as week number 1 in week-year 1970. Consecutive weeks are numbered sequentially. The week before the number 1 week in a week-year is the last week in the previous week-year, and vice versa. [GREGORIAN]
A week-year with a number year has 53 weeks if it corresponds to either a year year in the proleptic Gregorian calendar that has a Thursday as its first day (January 1st), or a year year in the proleptic Gregorian calendar that has a Wednesday as its first day (January 1st) and where year is a number divisible by 400, or a number divisible by 4 but not by 100. All other week-years have 52 weeks.
The week number of the last day of a week-year with 53 weeks is 53; the week number of the last day of a week-year with 52 weeks is 52.
The week-year number of a particular day can be different than the number of the year that contains that day in the proleptic Gregorian calendar. The first week in a week-year y is the week that contains the first Thursday of the Gregorian year y.
For modern purposes, a week as defined here is equivalent to ISO weeks as defined in ISO 8601. [ISO8601]
A string is a valid week string representing a week-year year and week week if it consists of the following components in the given order:
A U+0057 LATIN CAPITAL LETTER W character (W)
Two ASCII digits, representing the week week, in the range 1 ≤ week ≤ maxweek, where maxweek is the week number of the last day of week-year year
The rules to parse a week string are as follows. This will return either a week-year number and week number, or nothing. If at any point the algorithm says that it "fails", this means that it is aborted at that point and returns nothing.
If position is beyond the end of input or if the character at position is not a U+0057 LATIN CAPITAL LETTER W character (W), then fail. Otherwise, move position forwards one character.
Collect a sequence of code points that are ASCII digits from input given position. If the collected sequence is not exactly two characters long, then fail. Otherwise, interpret the resulting sequence as a base-ten integer. Let that number be the week.
Let maxweek be the week number of the last day of year year.
If week is not a number in the range 1 ≤ week ≤ maxweek, then fail.
Return the week-year number year and the week number week.
A duration consists of a number of seconds.
Since months and seconds are not comparable (a month is not a precise number of seconds, but is instead a period whose exact length depends on the precise day from which it is measured) a duration as defined in this specification cannot include months (or years, which are equivalent to twelve months). Only durations that describe a specific number of seconds can be described.
A string is a valid duration string representing a duration t if it consists of either of the following:
A literal U+0050 LATIN CAPITAL LETTER P character followed by one or more of the following subcomponents, in the order given, where the number of days, hours, minutes, and seconds corresponds to the same number of seconds as in t:
One or more ASCII digits followed by a U+0044 LATIN CAPITAL LETTER D character, representing a number of days.
A U+0054 LATIN CAPITAL LETTER T character followed by one or more of the following subcomponents, in the order given:
One or more ASCII digits followed by a U+0048 LATIN CAPITAL LETTER H character, representing a number of hours.
One or more ASCII digits followed by a U+004D LATIN CAPITAL LETTER M character, representing a number of minutes.
The following components:
One or more ASCII digits, representing a number of seconds.
Optionally, a U+002E FULL STOP character (.) followed by one, two, or three ASCII digits, representing a fraction of a second.
A U+0053 LATIN CAPITAL LETTER S character.
This, as with a number of other date- and time-related microsyntaxes defined in this specification, is based on one of the formats defined in ISO 8601. [ISO8601]
One or more duration time components, each with a different duration time component scale, in any order; the sum of the represented seconds being equal to the number of seconds in t.
A duration time component is a string consisting of the following components:
Zero or more ASCII whitespace.
One or more ASCII digits, representing a number of time units, scaled by the duration time component scale specified (see below) to represent a number of seconds.
If the duration time component scale specified is 1 (i.e. the units are seconds), then, optionally, a U+002E FULL STOP character (.) followed by one, two, or three ASCII digits, representing a fraction of a second.
One of the following characters, representing the duration time component scale of the time unit used in the numeric part of the duration time component:
U+0057 LATIN CAPITAL LETTER W character
U+0077 LATIN SMALL LETTER W character
Weeks. The scale is 604800.
U+0044 LATIN CAPITAL LETTER D character
U+0064 LATIN SMALL LETTER D character
Days. The scale is 86400.
U+0048 LATIN CAPITAL LETTER H character
U+0068 LATIN SMALL LETTER H character
Hours. The scale is 3600.
U+004D LATIN CAPITAL LETTER M character
U+006D LATIN SMALL LETTER M character
Minutes. The scale is 60.
U+0053 LATIN CAPITAL LETTER S character
U+0073 LATIN SMALL LETTER S character
Seconds. The scale is 1.
This is not based on any of the formats in ISO 8601. It is intended to be a more human-readable alternative to the ISO 8601 duration format.
The rules to parse a duration string are as follows. This will return either a duration or nothing. If at any point the algorithm says that it "fails", this means that it is aborted at that point and returns nothing.
Let months, seconds, and component count all be zero.
Let M-disambiguator be minutes.
This flag's other value is months. It is used to disambiguate the "M" unit in ISO8601 durations, which use the same unit for months and minutes. Months are not allowed, but are parsed for future compatibility and to avoid misinterpreting ISO8601 durations that would be valid in other contexts.
If position is past the end of input, then fail.
If the character in input pointed to by position is a U+0050 LATIN CAPITAL LETTER P character, then advance position to the next character, set M-disambiguator to months, and skip ASCII whitespace within input given position.
Let units be undefined. It will be assigned one of the following values: years, months, weeks, days, hours, minutes, and seconds.
Let next character be undefined. It is used to process characters from the input.
If position is past the end of input, then break.
If the character in input pointed to by position is a U+0054 LATIN CAPITAL LETTER T character, then advance position to the next character, set M-disambiguator to minutes, skip ASCII whitespace within input given position, and continue.
Set next character to the character in input pointed to by position.
If next character is a U+002E FULL STOP character (.), then let N equal zero. (Do not advance position. That is taken care of below.)
Otherwise, if next character is an ASCII digit, then collect a sequence of code points that are ASCII digits from input given position, interpret the resulting sequence as a base-ten integer, and let N be that number.
Otherwise next character is not part of a number; fail.
Set next character to the character in input pointed to by position, and this time advance position to the next character. (If next character was a U+002E FULL STOP character (.) before, it will still be that character this time.)
If next character is U+002E (.), then:
Collect a sequence of code points that are ASCII digits from input given position. Let s be the resulting sequence.
If s is the empty string, then fail.
Let length be the number of characters in s.
Increment N by fraction.
Set next character to the character in input pointed to by position, and advance position to the next character.
If next character is neither a U+0053 LATIN CAPITAL LETTER S character nor a U+0073 LATIN SMALL LETTER S character, then fail.
Set units to seconds.
If next character is ASCII whitespace, then skip ASCII whitespace within input given position, set next character to the character in input pointed to by position, and advance position to the next character.
If next character is a U+0059 LATIN CAPITAL LETTER Y character, or a U+0079 LATIN SMALL LETTER Y character, set units to years and set M-disambiguator to months.
If next character is a U+004D LATIN CAPITAL LETTER M character or a U+006D LATIN SMALL LETTER M character, and M-disambiguator is months, then set units to months.
If next character is a U+0057 LATIN CAPITAL LETTER W character or a U+0077 LATIN SMALL LETTER W character, set units to weeks and set M-disambiguator to minutes.
If next character is a U+0044 LATIN CAPITAL LETTER D character or a U+0064 LATIN SMALL LETTER D character, set units to days and set M-disambiguator to minutes.
If next character is a U+0048 LATIN CAPITAL LETTER H character or a U+0068 LATIN SMALL LETTER H character, set units to hours and set M-disambiguator to minutes.
If next character is a U+004D LATIN CAPITAL LETTER M character or a U+006D LATIN SMALL LETTER M character, and M-disambiguator is minutes, then set units to minutes.
If next character is a U+0053 LATIN CAPITAL LETTER S character or a U+0073 LATIN SMALL LETTER S character, set units to seconds and set M-disambiguator to minutes.
Otherwise if next character is none of the above characters, then fail.
Increment component count.
Let multiplier be 1.
If units is years, multiply multiplier by 12 and set units to months.
If units is months, add the product of N and multiplier to months.
If units is weeks, multiply multiplier by 7 and set units to days.
If units is days, multiply multiplier by 24 and set units to hours.
If units is hours, multiply multiplier by 60 and set units to minutes.
If units is minutes, multiply multiplier by 60 and set units to seconds.
Forcibly, units is now seconds. Add the product of N and multiplier to seconds.
If component count is zero, fail.
If months is not zero, fail.
Return the duration consisting of seconds seconds.
A string is a valid date string with optional time if it is also one of the following:
A valid date string
A valid global date and time string
The rules to parse a date or time string are as follows. The algorithm will return either a date, a time, a global date and time, or nothing. If at any point the algorithm says that it "fails", this means that it is aborted at that point and returns nothing.
Set start position to the same position as position.
Set the date present and time present flags to true.
Parse a date component to obtain year, month, and day. If this fails, then set the date present flag to false.
If date present is true, and position is not beyond the end of input, and the character at position is either a U+0054 LATIN CAPITAL LETTER T character (T) or a U+0020 SPACE character, then advance position to the next character in input.
Otherwise, if date present is true, and either position is beyond the end of input or the character at position is neither a U+0054 LATIN CAPITAL LETTER T character (T) nor a U+0020 SPACE character, then set time present to false.
Otherwise, if date present is false, set position back to the same position as start position.
If the time present flag is true, then parse a time component to obtain hour, minute, and second. If this returns nothing, then fail.
If the date present and time present flags are both true, but position is beyond the end of input, then fail.
If the date present and time present flags are both true, parse a time-zone offset component to obtain timezonehours and timezoneminutes. If this returns nothing, then fail.
If the date present flag is true and the time present flag is false, then let date be the date with year year, month month, and day day, and return date.
Otherwise, if the time present flag is true and the date present flag is false, then let time be the time with hour hour, minute minute, and second second, and return time.
Otherwise, let time be the moment in time at year year, month month, day day, hours hour, minute minute, second second, subtracting timezonehours hours and timezoneminutes minutes, that moment in time being a moment in the UTC time zone; let timezone be timezonehours hours and timezoneminutes minutes from UTC; and return time and timezone.
A simple color consists of three 8-bit numbers in the range 0..255, representing the red, green, and blue components of the color respectively, in the sRGB color space. [SRGB]
A string is a valid simple color if it is exactly seven characters long, and the first character is a U+0023 NUMBER SIGN character (#), and the remaining six characters are all ASCII hex digits, with the first two digits representing the red component, the middle two digits representing the green component, and the last two digits representing the blue component, in hexadecimal.
A string is a valid lowercase simple color if it is a valid simple color and doesn't use any characters in the range U+0041 LATIN CAPITAL LETTER A to U+0046 LATIN CAPITAL LETTER F.
The rules for parsing simple color values are as given in the following algorithm. When invoked, the steps must be followed in the order given, aborting at the first step that returns a value. This algorithm will return either a simple color or an error.
If input is not exactly seven characters long, then return an error.
If the first character in input is not a U+0023 NUMBER SIGN character (#), then return an error.
If the last six characters of input are not all ASCII hex digits, then return an error.
Let result be a simple color.
Interpret the second and third characters as a hexadecimal number and let the result be the red component of result.
Interpret the fourth and fifth characters as a hexadecimal number and let the result be the green component of result.
Interpret the sixth and seventh characters as a hexadecimal number and let the result be the blue component of result.
Return result.
The rules for serializing simple color values given a simple color are as given in the following algorithm:
Let result be a string consisting of a single U+0023 NUMBER SIGN character (#).
Convert the red, green, and blue components in turn to two-digit hexadecimal numbers using ASCII lower hex digits, zero-padding if necessary, and append these numbers to result, in the order red, green, blue.
Return result, which will be a valid lowercase simple color.
Some obsolete legacy attributes parse colors in a more complicated manner, using the rules for parsing a legacy color value, which are given in the following algorithm. When invoked, the steps must be followed in the order given, aborting at the first step that returns a value. This algorithm will return either a simple color or an error.
If input is the empty string, then return an error.
Strip leading and trailing ASCII whitespace from input.
If input is an ASCII case-insensitive match for the string "transparent", then return an error.
If input is an ASCII case-insensitive match for one of the named colors, then return the simple color corresponding to that keyword. [CSSCOLOR]
CSS2 System Colors are not recognized.
If input's code point length is four, and the first character in input is U+0023 (#), and the last three characters of input are all ASCII hex digits, then:
Interpret the second character of input as a hexadecimal digit; let the red component of result be the resulting number multiplied by 17.
Interpret the third character of input as a hexadecimal digit; let the green component of result be the resulting number multiplied by 17.
Interpret the fourth character of input as a hexadecimal digit; let the blue component of result be the resulting number multiplied by 17.
Replace any code points greater than U+FFFF in input (i.e., any characters that are not in the basic multilingual plane) with the two-character string "00".
If input's code point length is greater than 128, truncate input, leaving only the first 128 characters.
If the first character in input is a U+0023 NUMBER SIGN character (#), remove it.
Replace any character in input that is not an ASCII hex digit with the character U+0030 DIGIT ZERO (0).
While input's code point length is zero or not a multiple of three, append a U+0030 DIGIT ZERO (0) character to input.
Split input into three strings of equal code point length, to obtain three components. Let length be the code point length that all of those components have (one third the code point length of input).
If length is greater than 8, then remove the leading length-8 characters in each component, and let length be 8.
While length is greater than two and the first character in each component is a U+0030 DIGIT ZERO (0) character, remove that character and reduce length by one.
If length is still greater than two, truncate each component, leaving only the first two characters in each.
Interpret the first component as a hexadecimal number; let the red component of result be the resulting number.
Interpret the second component as a hexadecimal number; let the green component of result be the resulting number.
Interpret the third component as a hexadecimal number; let the blue component of result be the resulting number.
The 2D graphics context has a separate color syntax that also handles opacity.
A set of space-separated tokens is a string containing zero or more words (known as tokens) separated by one or more ASCII whitespace, where words consist of any string of one or more characters, none of which are ASCII whitespace.
A string containing a set of space-separated tokens may have leading or trailing ASCII whitespace.
An unordered set of unique space-separated tokens is a set of space-separated tokens where none of the tokens are duplicated.
An ordered set of unique space-separated tokens is a set of space-separated tokens where none of the tokens are duplicated but where the order of the tokens is meaningful.
Sets of space-separated tokens sometimes have a defined set of allowed values. When a set of allowed values is defined, the tokens must all be from that list of allowed values; other values are non-conforming. If no such set of allowed values is provided, then all values are conforming.
How tokens in a set of space-separated tokens are to be compared (e.g. case-sensitively or not) is defined on a per-set basis.
A set of comma-separated tokens is a string containing zero or more tokens each separated from the next by a single U+002C COMMA character (,), where tokens consist of any string of zero or more characters, neither beginning nor ending with ASCII whitespace, nor containing any U+002C COMMA characters (,), and optionally surrounded by ASCII whitespace.
For instance, the string " a ,b,,d d " consists of four tokens: "a", "b", the empty string, and "d d". Leading and trailing whitespace around each token doesn't count as part of the token, and the empty string can be a token.
Sets of comma-separated tokens sometimes have further restrictions on what consists a valid token. When such restrictions are defined, the tokens must all fit within those restrictions; other values are non-conforming. If no such restrictions are specified, then all values are conforming.
A valid hash-name reference to an element of type type is a string consisting of a U+0023 NUMBER SIGN character (#) followed by a string which exactly matches the value of the name attribute of an element with type type in the same tree.
The rules for parsing a hash-name reference to an element of type type, given a context node scope, are as follows:
If the string being parsed does not contain a U+0023 NUMBER SIGN character, or if the first such character in the string is the last character in the string, then return null.
Let s be the string from the character immediately after the first U+0023 NUMBER SIGN character in the string being parsed up to the end of that string.
Return the first element of type type in scope's tree, in tree order, that has an id or name attribute whose value is s, or null if there is no such element.
Although id attributes are accounted for when parsing, they are not used in determining whether a value is a valid hash-name reference. That is, a hash-name reference that refers to an element based on id is a conformance error (unless that element also has a name attribute with the same value).
A string is a valid media query list if it matches the <media-query-list> production of Media Queries . [MQ]
A string matches the environment of the user if it is the empty string, a string consisting of only ASCII whitespace, or is a media query list that matches the user's environment according to the definitions given in Media Queries . [MQ]


text:
Japan govt updates IR basic policy, new dates confirmed
Dec 18, 2020 Newsdesk Japan, Latest News, Top of the deck
The Japanese national government indicated on Friday it would have a direct role in communicating with "IR-related companies" concerning the country's push to have casino complexes, or integrated resorts (IRs) as they are known in that country, according to information collated by GGRAsia's Japan correspondent.
Such liaison would be done via the central authorities' IR promotion headquarters. Additionally on Friday, the country's government confirmed the national basic policy on IRs, which was mostly the same as a draft made public in October.
A key update was confirmation of the period in which the national government will be accepting IR plans from local governments. It will be between October 1, 2021 and April 28, 2022, i.e., about a nine-month delay from a previously-announced timetable.
The national government assumes the timing of IR openings to be the late 2020s, taking into account the time needed for environmental assessment and construction. Up to three such venues will be permitted in a first phase of liberalisation.
The Japan Tourism Agency created the draft, and its acceptance at a meeting on Friday marks the official start of Japan's IR realisation process. The agency is part of the Ministry of Land, Infrastructure, Transport and Tourism.
A number of international firms that already operate casino resorts in other markets, has in recent months pulled out of the race to build a casino resort in Japan.
They have cited factors including concerns about development costs, the possible scope of restrictive regulation, and delays in local and national decision-making, amid the disruption of the Covid-19 pandemic. The latter has led to a sharp decline in core-market business for many foreign operators.
Banking group Nomura suggested in a recent memo that the mention of casino resort taxation topics in the latest tax reform proposals of Japan's governing coalition, showed its commitment to the casino liberalisation policy in the country. "The tax proposals related to integrated resorts [IRs] are for financial year 2022, not financial year 2021," noted the institution.
Hokkaido governor restates no Japan...
Jan 28 deadline for Nagasaki casino...

redpajama_set_name: RedPajamaCommonCrawl


The Vapourtec Flow Commander™ software features the facility to model the axial dispersion that takes place with tube reactors, so that it is possible to automatically predict, (and correctly time the collection of) the steady state part of the reaction product stream when it emerges from the reactor.
This means it is possible to collect the optimum amount of good product with the minimum waste of reagents, and it is possible to determine exactly how much good product can be made from a limited amount of substrate.
So why would anyone want to trigger collection from a UV or IR sensor ?
The answer is that there are some circumstances (for example with heterogeneous columns) where either the dispersion is hard to accurately model (because the flow characteristics of the column contents simply cannot be known in advance), or else the working volume of the column reactor (the volume of the cavities between the substrate) is not accurately known.
In these cases, it may not be possible to simply "predict" the location or shape of the peak, and so perfect collection timing cannot be assured.
Flow Commander™software has for some time offered the facility to monitor (and record & chart) the output of a UV or FTIR sensor.
Vapourtec has now added the facility for UV Triggered collection. That is to say, operation of the collection valve is based on the output of a UV sensor located after the last reactor.
The user chooses the conditions for triggering.
These might be based on either the level or the gradient or both.
Criteria can be selected per reaction (i.e. a different trigger level can be set for each reaction in a sequence if need be).
Collection will then proceed according to these criteria.
In order to help the user visualise the outcome, Flow Commander™ asks for an expected maximum peak and generates a prediction of the UV or FTIR trace based on the dispersion model.
This allows the software to have a working estimate of the volume of peak that will be collected.
If it is desirable to split the desired output over several vials on a fraction collector, the user specifies a maximum amount per vial (subject to the known maximum for the vial type in question on the selected fraction collector). Based on the volume estimate, a number of vial positions on the fraction collector will be set aside for that peak. If not all these vials turn out to be required (ie if the total volume of the peak is less than expected), the last vial(s) will be left empty.
(The peak of the subsequent reaction will always be captured starting at its originally planned first vial position).


text:
News Release 24-Nov-2020
Hack for NF winning projects announced
New apps and research studies conceptualized to advance research and enhance collaboration between patients and healthcare providers
Children's Tumor Foundation
Hack for NF, a hackathon for neurofibromatosis research hosted by the Children's Tumor Foundation, today announced the winners of the 2020 virtual event that brought together healthcare startups, developers, solutions architects, and hackathon enthusiasts for six weeks to drive scientific and medical innovation and improve the lives of patients living with neurofibromatosis and other rare diseases. Solutions range from new ways to analyze data and identify new drugs and drug targets; to engaging patients via mobile devices; to data visualization apps and analytical tools for the NF portal. Each winning project will receive $7,500 to continue developing their projects.
The winning projects of the 2020 Hack for NF announced today include:
"AVI: A Virtual Pet for Children with NF," a tool that utilizes natural language processing to help engage children in recording their NF symptoms over time to help track their health and collect data for physicians;
"NF Matrix," a comprehensive platform that integrates the needs of NF patients, providers and researchers and is flexible across devices;
"Self-updating causal models to accelerate discovery in NF," a research platform that utilizes text mining and natural language processing to build, update and test causal models of NF to help researchers discover and interpret relevant new findings.
While mobilizing the scientific community across the globe to accelerate research progress for NF, the first NF Incubator was also launched, with additional funding provided by the Children's Tumor Foundation, Neurofibromatosis Therapeutic Acceleration Program (NTAP), the Gilbert Family Foundation (GFF), and Arctoris to qualifying teams who choose to continue working on their projects for 3-6 months.
The projects qualifying for a total of $22.5K in incubation funding included:
"Veometrics" - a prototype based on algorithms used in the videogame industry to develop a volumetric measure of cutaneous NF lesions using 3D graphics modeling.
"Gene network network-based drug discovery in plexiform neurofibromas" - a study that used gene co-expression network modules that correlated with other drug response data from PN cell lines to identify potential new drugs.
"Neurofibromatosis (NF) Recommendations (NF Care App)" - an interactive program to assess a child for NF.
"AVI: A Virtual Pet for Children with NF" - this winning project also received incubation funding based on its strong plan for future development;
"Cutaneous Neurofibromas Drug Discovery - Copper and Zinc as New Candidates" - a proposed study to test copper and zinc complexes to treat cutaneous neurofibromas.
Two additional teams were invited to continue to receive advisory support from the NF Incubator: "NF Knowledge Explorer" and "Deep Learning for NF Tumor Segmentation."
"We were truly amazed at the diversity of projects submitted and the international scope of participants from so many disciplines," said Salvatore La Rosa, Chief Scientific Officer of the Children's Tumor Foundation. "This event has helped us expand awareness and bring new talents to the table to build solutions for the NF community. We are excited to see how these new resources and methodologies will frame the future of NF research."
NF, short for neurofibromatosis, is a genetic disorder that causes tumors to grow on nerves throughout the body. It affects 2.5 million people worldwide and there is currently no cure. There is one approved drug for the treatment of inoperable plexiform neurofibromas, a subset of the NF1 patients. Rare diseases like NF represent a research area with high unmet medical need and an opportunity to make a difference.
More than 400 active participants took part in the Hack for NF from around the world, plus more than 40 mentors.
Josh Meier, Principal Software Architect at Salesforce and an NF parent and spouse, served as a mentor in the Hackathon.
"The idea of bringing together the science, medical, and technical disciplines was so obvious and yet something I had never seen before," said Josh Meier. "It will take time, but I truly believe that the innovative ideas coming from CTF are not only going to result in breakthroughs in the NF space but also potentially change the entire landscape of medical research and patient care."
This is the second hackathon that the Children's Tumor Foundation has hosted. In September 2019, data scientists, artificial intelligence experts, and engineers gathered at the Google Launchpad in San Francisco, California to 'hack' genomic, research, and imaging/clinical data from the NF Data Portal, in order to bring their unique insights and experiences to help accelerate NF medical research.
The 2020 Hack for NF was presented by Graphpad Prism and Salesforce. Additional sponsors and data partners included: NTAP, the Gilbert Family Foundation, AstraZeneca, CereXis, Cydan, Genuity Science, Healx, Wuxi AppTech, Life Science Nation/RESI (Redefining Early Stage Investments) Conference Series, Arctoris, Children's Brain Tumor Tissue Consortium, Dana Farber/Harvard Cancer Center, Elseveir, Sage Bionetworks, DNAnexus, NF Open Science Initiative, NF Data Portal, and the NF Registry.
To learn more about the Hack for NF, click here.
To learn more about the Children's Tumor Foundation, click here.
About the Children's Tumor Foundation
The Children's Tumor Foundation is a 501(c)(3) not-for-profit organization dedicated to finding effective treatments for the millions of people worldwide living with neurofibromatosis (NF), a term for three distinct disorders: NF1, NF2, and schwannomatosis. NF causes tumors to grow on nerves throughout the body and may lead to blindness, deafness, bone abnormalities, disfigurement, learning disabilities,disabling pain, and cancer. NF affects 1 in every 3,000 births across all populations equally. There is one approved drug for the treatment of inoperable plexiform neurofibromas, a subset of NF1 patients.The Children's Tumor Foundation's mission of driving research, expanding knowledge, and advancing care for the NF community fosters our vision of one day ending all manifestations of NF.
Rebecca Harris
rharris@ctf.org
/Scientific community/Research programs/Research on children
/Health and medicine/Diseases and disorders/Genetic disorders/Neurofibromatosis
/Life sciences/Organismal biology/Anatomy/Tissue/Neoplasms/Brain tumors
https://www.ctf.org/news/hack-for-nf-2020-winning-projects


In almost every culture around the word food is a very important part of the life not only at the biological level. Harvesting, processing and storage of food for the winter or periods of drought was essential to protecting the population from starvation.
Today, in places with a high level of development like here in Newcastle Maitland people go to restaurants for recreational purposes. Not only typical tourist destinations have restaurants. For example here in Newcastle Maitland there are plenty of them, where you can try new spiced pork burgers like Kennedy Larsen with family.
You have to remember that improper food or nutrition could be danger to your health. Even the processing of food has a fundamental meaning. For example fairy tale eggplant and spinach flatbreads with tomato, cucumber and farro salad could have 450 kcal in each 100 grams.
Booking table in Steve & Jo's Family Restaurant is not available yet.
Booking table in Maneeya Thai Restaurant is not available yet.
Booking table in Ken's Kitchen is not available yet.
Booking table in Zaffran Indian Restaurant and Takeaway is not available yet.
Booking table in Mustafa's Kebab House & Cafe is not available yet.
Booking table in OZ Thai is not available yet.
Booking table in Marmook & Poom Poom's is not available yet.
Booking table in Chinh's Vietnamese Restaurant is not available yet.
Booking table in Fratelli Roma is not available yet.
Booking table in Mannu's Kitchen Indian Cuisine Maitland is not available yet.
Booking table in Royal Spoon is not available yet.
Booking table in HungRun Chinese Takeaway is not available yet.
Booking table in Place One Restaurant is not available yet.
Booking table in Pines Restaurant is not available yet.
Booking table in Panda House Chinese Take-Away Restaurant is not available yet.
Booking table in Wan Li Chinese Restaurant is not available yet.
Booking table in Billabongs Family Restaurant is not available yet.
Booking table in Best Western Endeavour Motel is not available yet.
Booking table in Pizza Hut Rutherford is not available yet.
Booking table in Mebar Restaurant is not available yet.
Have you eaten in Newcastle Maitland and now are you fed up? - maybe you need some place to sleep ?


text:
@interface GRTextField : NSObject
+ (void)setTextField:(UITextField *)textField placeholder:(NSString *)placeholder;

@end

redpajama_set_name: RedPajamaGithub


text:
We Are UNCW: Madeline Marens
Madeline Marens '12 knew at the age of 5 that she wanted to be a marine biologist – a dream she never outgrew. She majored in marine biology and achieved her goal, landing a job as an aquarist at the N.C. Aquarium at Fort Fisher.
"I really enjoy the aquarium setting and feel like I can be engaged in shark conservation initiatives there," she said. "The aquarium serves as an instrumental public agency to inspire and commit to the conservation of the environment. I enjoy the hands-on aspect of it."
This summer, Marens, a UNCW marine biology graduate student, had the opportunity to extend her conservation efforts. She joined OCEARCH, a recognized global leader in shark research, and other scientists representing 11 institutions in a shark expedition off Wrightsville Beach. Marens gathered biological samples for analysis and conducted ultrasounds from sharks captured during the week-long expedition. Researchers plan to track the sharks to determine their habitats including breeding, gestation and pupping grounds.


text:
Trump national security strategy restores reference to 'jihadist' terror threat
By Judson Berger, | Fox News
President Trump set to unveil national security strategy
Kelly Wright reports from Washington, D.C.
President Trump's national security strategy, set to be unveiled in a major address Monday afternoon, restores references to the "jihadist" terror threat – in a tacit rebuke to the Obama-era decision to avoid such language.
The president is expected to detail his administration's strategy at 2 p.m. ET in Washington, D.C.
Trump is expected to discuss threats he'll deem as "rogue regimes," like North Korea, and "revisionist powers," like Russia and China, who aim to change the status quo.
But notably, the document repeatedly refers to "jihadist" terror groups, in a break from the Obama administration.
"The primary transnational threats Americans face are from jihadist terrorists and transnational criminal organizations," the document states, according to excerpts released ahead of the speech.
Another section calls for strengthened missile defense and homeland security, vowing to "pursue threats to their source, so that jihadist terrorists are stopped before they ever reach our borders."
Sebastian Gorka, a former Trump White House adviser, drew attention to the term in an interview Monday morning with "Fox & Friends."
"The political correctness of the last eight years is gone," he said. "You haven't seen anything like this for 20-25 years."
President Trump's National Security Strategy is restoring references to 'jihadist' terrorists. (Reuters)
Then-President Barack Obama stirred controversy when he first removed terms like "Islamic extremism" in the 2010 security document, effectively scrubbing language used by the George W. Bush administration. The shift came on the heels of Obama's visit to Egypt, where he vowed a "new beginning" in the relationship between the U.S. and the Muslim world.
The administration's 2015 strategy also did not contain the word "jihadist."
Shortly before leaving office last year, Obama explained at a CNN town hall that he avoided using those terms because he did not want to "lump" murderers like Al Qaeda and ISIS members "into the billion Muslims that exist around the world, including in this country, who are peaceful, who are responsible, who, in this country, are fellow troops and police officers and firefighters and teachers and neighbors and friends."
Broadly speaking, according to a senior administration official, Trump's doctrine has four main principles: protecting the homeland and way of life; promoting American prosperity; demonstrating peace through strength; and advancing American influence in an ever-competitive world.
The official said the "principled realism … takes a clear-eyed view of the threats we face."
In another shift for the president who ran on an "America First" platform, Trump's strategy will remove an Obama declaration that climate change is an "urgent and growing threat to our national security."
Fox News' Lukas Mikelionis, Kristin Brown and Jennifer Bowman and The Associated Press contributed to this report.
Critics dunk on Pennsylvania Lt. gov for claiming 'lies' about 2020 election 'not protected speech'
GOP Sen. Lankford apologizes to Black constituents for efforts to contest election
Pence calls Vice President-elect Harris to offer congratulations ahead of inauguration


text:
EFF Joins Over 100 Civil Liberties Organizations and Internet Companies in Demanding a Full-Scale Congressional Investigation Into NSA Surveillance
Announcement by rainey Reitman
Dozens of civil liberties organizations and Internet companies—including the Electronic Privacy Information Center, National Association of Criminal Defense Lawyers, ThoughtWorks, and Americans for Limited Government—today joined a coalition demanding Congress initiate a full-scale investigation into the NSA's surveillance programs. This morning, we sent an updated letter to Congress with 115 organizations and companies demanding public transparency and an end to illegal spying.
The letter comes even as dozens of groups are organizing a nationwide call-in campaign to demand transparency and an end to the NSA's unconstitutional surveillance program via https://call.stopwatching.us
It's been less than two weeks since the first NSA revelations were published in the Guardian, and it's clear the American people want Congress to act. The first step is organizing an independent investigation, similar to the Church Committee in the 1970s, to publicly account for all of the NSA's surveillance capabilities. This type of public process will ensure the American people are informed, once and for all, about government surveillance conducted in their name. Our letter tells Congress:
This type of blanket data collection by the government strikes at bedrock American values of freedom and privacy. This dragnet surveillance violates the First and Fourth Amendments of the U.S. Constitution…
In addition, our stop StopWatching.us global petition has gathered more than 200,000 signatures since it was launched one week ago. The petition calls on Congress and the President to provide public access and scrutiny of the United States' domestic spying capabilities and to bring an end to illegal surveillance. Please support our efforts to rein in the NSA's surveillance program by adding your name now.
The StopWatching.us campaign has called for a number of specific legal reforms in addition to calling for an investigation, including reform to the controversial Section 215 of the USA PATRIOT Act, which was cited in the shockingly broad FISA order that demanded Verizon hand the NSA phone records data on millions of its US customers. The groups also call on Congress to reform the FISA Amendments Act, the unconstitutional law that allows, nearly without restriction, the government to conduct mass surveillance on communications going into and out of the United States. The letter and petition also demand that Congress amend the state secrets privilege, the pernicious legal tool the government has asserted in an attempt to block judges from deciding the constitutionality of the NSA's domestic spying program.
If you haven't yet, please visit StopWatching.us and sign the petition and call your elected officials.
You can read the full coalition letter, with an up-to-date list of the signees, below.
Dear Members of Congress,
We write to express our concern about recent reports published in the Guardian and the Washington Post, and acknowledged by the Obama Administration, which reveal secret spying by the National Security Agency (NSA) on phone records and Internet activity of people in the United States.
The Washington Post and the Guardian recently published reports based on information provided by a intelligence contractor showing how the NSA and the FBI are gaining broad access to data collected by nine of the leading U.S. Internet companies and sharing this information with foreign governments. As reported, the U.S. government is extracting audio, video, photographs, e-mails, documents, and connection logs that enable analysts to track a person's movements and contacts over time. As a result, the contents of communications of people both abroad and in the U.S. can be swept in without any suspicion of crime or association with a terrorist organization.
Leaked reports also published by the Guardian and confirmed by the Administration reveal that the NSA is also abusing a controversial section of the PATRIOT Act to collect the call records of millions of Verizon customers. The data collected by the NSA includes every call made, the time of the call, the duration of the call, and other "identifying information" for millions of Verizon customers, including entirely domestic calls, regardless of whether those customers have ever been suspected of a crime. The Wall Street Journal has reported that other major carriers, including AT&T and Sprint, are subject to similar secret orders.
This type of blanket data collection by the government strikes at bedrock American values of freedom and privacy. This dragnet surveillance violates the First and Fourth Amendments of the U.S. Constitution, which protect citizens' right to speak and associate anonymously, guard against unreasonable searches and seizures, and protect their right to privacy.
We are calling on Congress to take immediate action to halt this surveillance and provide a full public accounting of the NSA's and the FBI's data collection programs. We call on Congress to immediately and publicly:
1. Enact reform this Congress to Section 215 of the USA PATRIOT Act, the state secrets privilege, and the FISA Amendments Act to make clear that blanket surveillance of the Internet activity and phone records of any person residing in the U.S. is prohibited by law and that violations can be reviewed in adversarial proceedings before a public court;
2. Create a special committee to investigate, report, and reveal to the public the extent of this domestic spying. This committee should create specific recommendations for legal and regulatory reform to end unconstitutional surveillance;
3. Hold accountable those public officials who are found to be responsible for this unconstitutional surveillance.
Thank you for your attention to this matter.
Advocacy for Principled Action in Government
American Booksellers Foundation for Free Expression
American Civil Liberties Union of California
Americans for Job Security
Americans for Limited Government
Art is Change
Association of Alternative Newsmedia
Bill of Rights Defense Committee
Bradley Manning Support Network
Breadpig
Calyx Institute
Center for Financial Privacy and Human Rights
Center for Media and Democracy
Center for Media Justice
Constitutional Alliance
Consumer Action
Cyber Privacy Project
Demand Progress
Detroit Digital Justice Coalition
Digital Fourth
Electronic Frontiers Australia, Inc.
Electronic Privacy Information Center
Entertainment Consumers Association
Firstamendment.com
Foundation for Innovation and Internet Freedom
Freedom of the Press Foundation
Friends of Privacy USA
Fund for Constitutional Government
Get FISA Right
Government Accountability Project
Green Party of the United States
Institute of Popular Education of Southern California (IDEPSCA)
isen.com, LLC
Knowledge Ecology International (KEI)
Law Life Culture
Liberty Coalition
Mansfield North Central Ohio Tea Party Association
May First/People Link
Media Alliance
Media Mobilizing Project, Philadelphia
Montgomery County Civil Rights Coalition
MoveOn
National Coalition Against Censorship
National Security Counselors
New Sanctuary Coalition of NYC
New York Civil Liberties Union
Open Technology Institute
OpenMedia.org
OpentheGovernment.org
Participatory Politics Foundation
Patient Privacy Rights
People for the American Way
Personal Democracy Media
PolitiHacks
Popular Resistance
Public Interest Advocacy Centre (Ottawa, Canada)
Project on Government Oversight
Privacy Activism
Privacy Camp
Privacy Journal
Privacy Rights Clearinghouse
Privacy Times
Progressive Librarians Guild
Represent.us
Restore America's Voice
Rights Working Group
Rocky Mountain Civil Liberties Association
RootsAction.org
Samuelson-Glushko Canadian Internet Policy & Public Interest Clinic
Sunlight Foundation
Taxpayers Protection Alliance
TechFreedom
Tenth Amendment Center
The AIDS Policy Project, Philadelphia
TURN-The Utility Reform Network
Urbana-Champaign Independent Media Center
William C. Velasquez Institute (WCVI)
World Wide Web Foundation
NSA Spying
Deeplinks Blog by Matthew Guariglia, Aaron Mackey | August 22, 2022
Victory: Government Finally Releases Secretive Court Rulings Sought By EFF
More than seven years after Congress mandated it and EFF sued to pry them loose, the government released seven heavily-redacted but previously classified rulings from the Foreign Intelligence Surveillance Court that shed new light on how the secret court interprets key provisions of the laws that authorize mass surveillance....
Deeplinks Blog by Cindy Cohn | June 13, 2022
EFF's Flagship Jewel v. NSA Dragnet Spying Case Rejected by the Supreme Court
We all deserve the right to have a private conversation online. That's why EFF has taken on government surveillance for the past 30-plus years. One of our longest-running efforts has been to stop the National Security Agency's (NSA) surveillance that sweeps up tens—if not hundreds—of millions of innocent people in...
Deeplinks Blog by Matthew Guariglia, Andrew Crocker | February 11, 2022
We Need Answers About the CIA's Mass Surveillance
The Central Intelligence Agency has been collecting American's private data without any oversight or even the minimal legal safeguards that apply to the NSA and FBI, an unconstitutional affront to our civil liberties. According to a declassified report released yesterday by the Privacy and Civil Liberties Oversight Board (PCLOB), the...
Deeplinks Blog by David Greene | August 17, 2021
Jewel v. NSA: Americans (Still) Deserve Their Day in Court
With little explanation, the Ninth Circuit today affirmed the district court's decision dismissing our landmark challenge to the US government's mass communications surveillance, Jewel v. NSA. Needless to say, we are extremely disappointed. Today's decision renders government mass surveillance programs essentially unreviewable by U.S. courts, since no individual will be...
Deeplinks Blog by India McKinney, Cindy Cohn | July 28, 2021
Should Congress Close the FBI's Backdoor for Spying on American Communications? Yes.
All of us deserve basic protection against government searches and seizures that the Constitution provides, including requiring law enforcement to get a warrant before it can access our communications. But currently, the FBI has a backdoor into our communications, a loophole, that Congress can and should close.This week, Congress will...
Deeplinks Blog by Root User | December 26, 2020
Snowden: "We Can Fix a Broken System"
Below is a message from whistleblower Edward Snowden. His revelations about secret surveillance programs opened the world's eyes to a new level of government misconduct, and reinvigorated EFF's continuing work in the courts and with lawmakers to end unlawful mass spying.EFF is grateful to Ed for his support in...
Podcast Episode: The Secret Court Approving Secret Surveillance
Episode 001 of EFF's How to Fix the InternetJulian Sanchez joins EFF hosts Cindy Cohn and Danny O'Brien as they delve into the problems with the Foreign Intelligence Surveillance Court, also known as the FISC or the FISA Court. Sanchez explains how the FISA Court signs off on surveillance of...
Deeplinks Blog by Aaron Jue | July 24, 2020
EFF Joins HOPE 2020
EFF staff members will present some of our latest work at 2600 Magazine's biennial Hackers on Planet Earth (HOPE) conference beginning this weekend. HOPE is a diverse hacker event that has drawn thousands of tinkerers, security researchers, activists, artists, and makers since 1994. In a departure from the infamous...
Deeplinks Blog by Danny O'Brien | July 16, 2020
EU Court Again Rules That NSA Spying Makes U.S. Companies Inadequate for Privacy
The European Union's highest court today made clear—once again—that the US government's mass surveillance programs are incompatible with the privacy rights of EU citizens. The judgment was made in the latest case involving Austrian privacy advocate and EFF Pioneer Award winner Max Schrems. It invalidated the "Privacy Shield,"...
Deeplinks Blog by India McKinney, Mark Rumold | May 26, 2020
The House Is Voting on Section 215, Again. The Bill Still Needs More Reform
Later this week, the House of Representatives is once again voting on whether or not to extend the authorities in Section 215 of the PATRIOT Act—a surveillance law with a rich history of government overreach and abuse, along with two other PATRIOT Act provisions, and possibly, an amendment.Congress considered...


There was another threatened stranding of our sea creatures recently in Northland on 8 December, this time dolphins. Right on the heels of 80-90 stranded whales on the Chathams recently, 51 of those did not survive as of 30 November 2018. There were also two other NZ strandings, one on Stewart Island that saw 145 dead, another in Northland which saw a loss of 5. This is all so tragic and with Christmas almost upon us the enormity can tend to fly under the radar. There will be more for sure. We posted a while back on this topic with other strandings, joining dots & making links to causes other than the usual mantra the authorities roll out as they have in this article.
DoC said exactly why whales and dolphins stranded was not fully known but factors could include sickness, navigational error, geographical features, a rapidly falling tide, being chased by a predator, or extreme weather. More than one factor might contribute to a stranding.
Defenders of ocean habitats and marine life are up in arms on Friday as the Trump administration is set to approve new abilities for the fossil fuel industry to conduct widescale and "deafening" underwater seismic in federal waters off the U.S. Atlantic coast.
In that article at the link there is another article referenced … Why whales strand and how to help them. It cites the usual reasons already mentioned; 'whale strandings are natural occurrences'.
Media is predictably quick to eliminate man's interference with the environment as causal regarding any environmental damage. If you're familiar with this site you will know that this denial is not uncommon. Corporations whose primarily focus is profits all vehemently deny that their practices cause damage. They are also well armed with a bevy of well paid lawyers to 'legally' destroy anybody who threatens those profits. People are targeted, assaulted and even lose their lives standing up to corporate profiteering.
That said, it is well to search for and consider the independent information on all events since corporations cannot be trusted to tell you the truth. They tell bold faced lies. If you doubt that watch 'The Corporation' doco found on the Corporations page.
The following short video from oceancare.org explains concisely the threat of noise to marine life saying "underwater noise pollution is a serious threat…" (the phenomenon media doesn't mention).
At 1.45 minutes the effect of sonar from military ships is explained and at 2.22 minutes, the effects of seismic exploration for oil and gas on marine life. As many Kiwis will know our oceans are now replete with activity from the latter, especially since our 'esteemed' and recently departed leader John Key signed away drilling rights to his corporate friends. Key and his corporation (aka known as the NZ Government) have no regard whatsoever for our natural environment. Corporations are about profits not people or environments. See more on Key below.
Join the worldwide campaign: silentoceans.comWhales stranding, shoals of fish collapsing, sea turtles fleeing: extreme noise is harming marine life. Noise caused by military sonar tests, the search for oil and gas, and giant ship propellers. Help us by joining the worldwide campaign SILENT OCEANS.
VIDEO INFORMATION: "Basically, John Key is [was & his legacy continues] killing whales and dolphins, and potentially ruining the seafood (crabs, crayfish etc) industry in the areas where this seismic survey technology is used.
The main environmental concern for marine surveys is the potential of seismic sources to disturb animal life, especially cetaceans such as whales, porpoises, and dolphins. Surveys involve towing an array of 15-45 pneumatic air guns below the ocean surface behind the survey vessel and emit sound pulses of a "predominantly low frequency (10–300 Hz), high intensity (215-250 dB).
Seismic surveying can damage the reproductive processes, auditory functions and other damaging effects to highly lucrative marine species (lobster, crab) and it poses potentially fatal effects to marine mammals.
Seismic testing is not fully responsible for whales running ashore or becoming stranded, but there is evidence that it plays a major role. Studies of seismic effects on several whale species such as Gray, Bowhead, Blue, Humpback and Sperm whales indicated substantial effects in behavior, breathing, feeding and diving patterns.
On November 28, 2004, Reuters reported that during a three day span, 169 whales and dolphins beached themselves in Tasmania, an island off the southern coast of mainland Australia. The cause for these beachings is not known, but Bob Brown, a senator in the Australian parliament, said "sound bombing" or seismic tests of ocean floors to test for oil and gas had been recently carried out near the sites of the Tasmanian beachings.
According to Jim Cummings of the Acoustic Ecology Institute, seismic surveys utilising airguns have been taking place in mineral-rich areas of the world's oceans since 1968. Among the areas that have experienced the most intense survey activity are the North Sea, the Beaufort Sea (off Alaska's North Slope), and the Gulf of Mexico; areas around Australia and South America are also current hotspots of activity.
The impulses created by the release of air from arrays of up to 24 airguns create low frequency sound waves powerful enough to penetrate up to 40km below the seafloor. The "source level" of these sound waves is generally over 200dB (and often 230dB or more), roughly comparable to a sound of at least 140-170dB in air.
According to the Australian Conservation Foundation, these 200dB — 230dB shots from the airguns are fired every 10 seconds or so, from 10 metres below the surface, 24 hours a day, for 2 week periods of time, weather permitting.
These types of tests are known to affect whales and dolphins, whose acute hearing and use of sonar is very sensitive.
On December 24, 2004 there was a magnitude 8.1 earthquake more than 800 kilometres southeast of Tasmania near New Zealand, with a subsequent aftershock 6.1 a little later in the morning that same day.
Then on December 26 the magnitude 9.0 earthquake struck leading to the devastating tsunami that killed more than 300,000 people.
On December 27, 20 whales beached themselves 180 kilometres west of Hobart on the southern island state of Tasmania.
As part of Budget 2009 a total of $20 million over three years will be allocated to the seismic data acquisition programme run by Crown Minerals, which is responsible for the administration and promotion of New Zealand's oil and gas.
LINKS TO THE OTHER THREE VIDEOS IN THIS SERIES can be found by locating the video at Youtube. The other videos will be there on the side bar to the right.
The cruelty of this killing frenzy knows no end it seems. NZ's 'predator free 2050' scheme aims to rid us of ALL introduced, non-native species except farming stock.
They are already coming for your cats. Of course they failed to fill us in on all of this finer detail. That would involve divulging all they signed us up to decades ago. Do read that article at the first link by Jenese James. It is very enlightening on the culling topic. If you keep your eyes open & read between the lines you may have noticed culling is becoming a common word (not to mention either the extinction of species!). One I saw not too long ago was the culling of Canadian Geese off Palmy's Lagoon in Centennial Drive. It shocked onlookers & took place in the school holidays where children could have seen it. This scheme has already been condemned by two academics as being unrealistic. You don't have to even be an academic however to figure it's unrealistic, or cruel. Not rocket science really. It's been said by more than one notable person that a nation can be judged by the way it treats its poor and vulnerable, and its animals. NZ, once a welfare state, is now found seriously wanting on all counts of that one.
Following is information on the Tahr cull from Carol Sawyer.
It has come to my notice, from an extremely reliable source, that at least two helicopters were working for the Department of Conservation last weekend – carrying out the Tahr cull (the one that Eugenie Sage said would not now be carried out until next winter) in the designated Tahr cull area that was organised prior to the fatal Wanaka helicopter accident on 20 October, 2018.
One helicopter flew out of Manapouri and a second involved is allegedly Wanaka-based.
The Dept of Conservation is crying out for more money, and yet the helicopter from Manapouri would have had a three hour return trip, I'm told, at a cost of at least $1,500 per hour plus GST –  just to position it for the Tahr cull. There are several helicopters closer that could have been used instead.
The helicopter from Manapouri was carrying a DoC biodiversity officer to do the shooting.
The Tahr are calving now. I'm informed the babies would probably not have been seen, as they are "planted" for the first two weeks of life, in a similar manner to deer – with Mum coming back to feed them. They will have been left to die of cold and starvation.
I have also heard via a second source, a shocked helicopter owner, that DoC are shooting the nanny Tahr in the guts so they go away and die invisibly in the bush, presumably in severe pain. If they were visible their skeletons would be visible for several years. This way they are hidden from public view. I SO hope this is not true!


The stunning Adare Manor has been featured in The Times' 'Cool Hotel Guide', calling it a 'show-stopper in a beautiful setting'. The story also rates Mike Tweedie as one of Ireland's most talented young chefs.
Read the article on The Times website.
We're incredibly proud to be working with Adare Manor. Avvio's team has created a fully optimised website which reflects the varied offering and beauty of the hotel and its grounds. We are continuing to work closely with Adare Manor's team, and look forward to helping grow their business among new markets.


text:
Under the new data-matching investigations, cancellations and refusals of partner visas expected to rise
There were some seven hundred fifty partner visas that were cancelled in the last 3 years, but it's not going to end there. It is expected that this number will continue to rise with the launch of the data-matching program by the Department of Human Services and the Department of Immigration and Border Protection. These two government departments combined their individual customer databases to assist in uncovering the different types of fraud, and this includes those by couples who have submitted an application or have already been granted partner visas.
What the system is aiming for is to identify those who are taking welfare payments as singles, even if they already have sponsoring overseas partners and will be checking at applications and grants from the years beginning the year 2012. The Australian immigration department granted forty seven thousand seven hundred fifty two partner visas in the program year that ended 2014, and the largest source nations were the following countries: Britain, China, India, the Philippines, and Vietnam.
These grants as well as other applications are now being verified against nearly 7 million unique records that are all stored in the Centrelink database
According to the figures provided by the Herald Sun report, around seven hundred fifty such visas in the last 3 years have already been cancelled for a breach of conditions such as making fake claims, being of bad character, and providing false or incorrect information.
Mr Peter Dutton, the minister for the Department of Immigration and Border Protection, stated that the joint data-matching operation would be able to identify frauds among those who have lodged an application or have already been granted the partner visa.
"Last year, my department identified an increase in the number of allegations relating to the facilitating of contrived marriages," said Mr Dutton. "This data-matching program is part of a whole-of-government approach to fraud detection and prevention."
"People who deliberately take advantage of Australia's welfare and migration system will be caught." he added.
itnews.com.au came out with a report noting that under the data matching rules of the Privacy Commissioner's , DHS and the immigration department need to make public the specifics of their data matching program prior to its kick off. The dataset is going to include each and every one of the applicants for partner visas as well as their sponsors during the years 2012-2013 to 2013-2014.
Source: MigrationAlliance.com.au
New biometric clearance system to be implemented by the DIBP
Australia in short supply of panel beaters and cabinet makers, but dentists lose out