Master's thesis in fulfillment of the requirements for the degree of Master of Science
1
Introduction
$G= \langle Q_1,Q_2,E,w,q_0,T\rangle$
Each edge has integral weights. Initial energy level is always $0$ (Note that, this is no loss of generality).
$P1$ has to reach $T$ starting from $q_0$ maintaining energy level within some given bound(s).
2
Different Games
3
Related Works
Mean Payoff Games: Zwick $\& $ Paterson '96
Discounted Games: Anderson '06
L, LU $\& $ LW -infinite games: Bouyer, Fahrenberg, Larsen, Markey $ \& $ Srba '08
Multidimensional mean payoff $\& $ energy with parity: Chatterjee,Randour $\&$ Raskin '14
Quantitative games with interval objectives: Hunter, Raskin '14
Fixed-dimensional energy games are in pseudo-poly: Jurdziński, Lazić $ \& $ Schmitz '15
Total, Discounted $\&$ Energy Payoff with Reachability: Chatterjee,Doyen $ \& $ Henzinger '17
4
Single Bound Games
$P1$ has to reach $T$ from $q_0$ in a path maintaining energy level at all the prefixes $\geq 0$ given 0 initial credit.
Infinite Game $\Longleftrightarrow$ Reachability Game [In the thesis]
1-player L-infinite games are in P and 2-player are in $NP \cap coNP$.
With reachability: Same complexity
5
Strong Dual Bound Games
INPUT: A game graph, initial vertex $q_0$, target vertex $T$, lower bound $l$, upper bound $U$ QUESTION: Does $P1$ have a winning strategy to reach $T$ starting with 0 from $q_0$ maintaining the energy level $l \leq e \leq U$?
One player game: PSPACE-complete (reduction from Reachability of bounded one counter automaton )
Two player game: EXPTIME-complete (reduction from Countdown Games )
With strong bounds, reachability and Infinite Games are interreducible!!
6
Weak Dual Bound Games
We now relax the upper bound, by making it weak.
Formally,
INPUT: A game graph, initial vertex $q_0$, target vertex $T$, lower bound $L$, upper bound $W$(weak bound) QUESTION: Does $P1$ have a winning strategy to reach $T$ starting with 0 from $q_0$ maintaining the energy level $e \geq L$ such that if at any point $e$
hits $U$, it does not go above $U$?
7
Motivation
Let us look at some motivation:
This can be formulated as a two player finite state game. [Hélouët, Marchand $\&$ Mullins '18]
Now, an intruder should not be able to play a large number of normal moves, higher his reward arbitarily and then try to access the security system staying above the strong lower bound. Hence, upper bound should be weak.
8
Infinite vs Reachability in Weak Dual Bound
9
Memory for P2
10
1 Player Game
Consider a winning strategy $\sigma$ of $P1$.
Intuitively, any outcome of $\sigma$ will not have any zero cycle or negative cycle.
Now, $P1$ has two options:
► win in an acyclic path
► choose a positive cycle-iterate-increase energy to certain level-continue
11
Technical Observations
Same cycle can be positive or negative cycle depending on the initial energy level.
Let $W=4$. In this example, if $x=4$, it is a negative cycle, but if $x=1$, it is a positive cycle.
Any feasible positive cycle can be iterated and after a certain time output energy stabilizes.
Why?
12
Positive Cycle
#Iterations can be bounded by W-L.
13
Winning Path
14
Universal Cycle
Universal cycle on $q$: cycle can be taken with initial energy $L$.
Winning path: $\beta_1 \cdot \upsilon_1 \cdots \beta_k\cdot \upsilon_k$, where $\upsilon 's$ are special transitions. Path size $ \leq (|Q+1|)^2$.
Check paths of length less than or equal to $(|Q| + 1)^2$; inductively compute the maximal energy level: similar to DAG construction.
PTIME!
Corollary: Two player LW-reachability is in coNP.
18
APNA Games
(Relaxed Upper Bound)
We define different violation measures later.
19
Motivation
Let us look at the same banking system scenario:
Clearly, L=0. But, consider a normal user accidentally used some malicious actions, APNA Games come into play.
20
Notations
Violation measures for a path $\rho$ with violations:= $V(\rho) = \{i \in [0;|\rho|]\mid \tilde\rho_i>U\}$:
Total violations:= $\sharp V(\rho)= |V(\rho)|$
Maximal number of consecutive violations:= $\overline{\sharp}V(\rho) = \max\{i-j \mid \forall k\in[i,j].\ k\in V(\rho)\}$
Sum of the overloads:= $\Sigma V(\rho)= \sum_{i \in V(\rho)} (\tilde\rho_i-U)$
Given the notations, $APNA^{\sharp}$, $APNA^{\overline{\sharp}}$, $APNA^{\Sigma}$- infinite or reachability games are intuitive:
INPUT: A game graph, lower bound $l$, relaxed upper bound $U$ and a bound $V$ QUESTION: Does $P1$ have a strategy to win infinite or reachability objectives maintaining energy level $\geq L$ and for $RU$, corresponding violation measure $\leq V$?
21
Solving APNA Games
Lets go through the idea of solving APNA Games:
22
Natural Questions
Bound existence: Given $V$, decide if there exists a value $H$ such that $P1$ wins the APNA$^{*}$ games with bound $V$?
Minimization: Given $V_{max}$, find the value $H$ such that $P1$ wins the APNA$^{*}$ games with the smallest possible value for $V$.
Existence can be solved using the similar idea of $G_{APNA}$ and check reachability problems.
Minimization can be solved using binary search method within $[U, U+V_{max} \cdot w_{max}]$.
They are also PSPACE-complete for 1-player and EXPTIME-complete for two players.[Reduction from LU Games]
23
Conclusion
We have seen two kinds of games:
games with upper and lower bound constraints, combined with reachability or infinite runs objectives
games with strong lower bound and an upper bound that can be temporarily exceeded, reachability or infinite run objectives, and constraints on violations of upper bound
Future work:
consider energy games with mean payoff function
discounted total payoff for the energy level and for the violation constraints, and the associated minimization and existence problems


MY PLANTS
Information:
Indirect sunlight. Water so that soil is moist but dries inbetween watering. Recomended watering once a day. Good for beginners


public final class LargeBooleanArray
extends java.lang.Object
implements java.lang.Cloneable
This class enables arrays of booleans up to 64-bits in size (for the exact
maximum size, please see MAX_SIZE
). As a single array is limited to
32-bits in Java, this is done by having an array of arrays. We use a
long
to index this array of arrays, and use bitwise operators
to extract the two indices for the array of arrays. The largest index is
extracted using getSegment(long)
while the smallest index is extracted
using getOffset(long)
, where the actual value is located in
values[segment][offset]
.
In addition, this class enables a dynamic array, and can be dynamically
enlarged or shrunken. The total capacity is indicated by capacity()
,
while the actual number of elements is indicated by size()
. When
constructing new arrays, typically the size is set equal to the capacity,
with the restriction that we always at least reserve a minimum capacity
(indicated by MINIMUM_INITIAL_CAPACITY
). This dynamic array then
also supports push(boolean)
and pop()
operations.
| Modifier and Type | Field and Description |
|---|---|
static byte |
ARRAY_BIT_SIZE
The number of bits to use for each individual array.
|
static long |
MAX_SIZE
The maximum size of the array in total.
|
static int |
MAX_SIZE_ARRAY
The maximum size of each individual array.
|
static long |
MINIMUM_INITIAL_CAPACITY
Minimum initial capacity of the array.
|
static double |
RELATIVE_CAPACITY_INCREASE
The relative increase in the capacity when increasing the capacity.
|
| Constructor and Description |
|---|
LargeBooleanArray(boolean[] values)
Constructs a new array copying the values of the supplied array.
|
LargeBooleanArray(long size)
Constructs a new empty array of specified size.
|
LargeBooleanArray(long size,
boolean constant)
Constructs a new array of indicated size with all elements set to a
constant value.
|
| Modifier and Type | Method and Description |
|---|---|
void |
append(boolean value)
Appends a specified value to the end of the array.
|
long |
capacity()
Gets capacity of array.
|
void |
clear()
Removes all elements from the array.
|
LargeBooleanArray |
clone()
Clones the array.
|
LargeBooleanArray |
copyOfRange(long from,
long to)
Copies the specified range to a new array.
|
void |
ensureCapacity(long minCapacity)
Increases the capacity to ensure that the array has at least the minimum
capacity.
|
void |
fill(boolean constant)
Fills entire array with constant.
|
void |
fill(long from,
long to,
boolean constant)
Fills indicated range with constant.
|
boolean |
get(int segment,
int offset)
Gets value element based on segment and offset.
|
boolean |
get(long index)
Gets value element based on long index.
|
static int |
getOffset(long index)
Gets the offset within a particular segment of the index.
|
static int |
getSegment(long index)
Gets the segment of the index.
|
int |
length(int segment)
Gets the length of the indicated segment.
|
void |
mergeSort()
Sorts elements in ascending order using merge sort.
|
int |
nSegments()
Gets the number of segments.
|
boolean |
pop()
Pops last value off the end of the array.
|
void |
push(boolean value)
Appends a specified value to the end of the array.
|
void |
quickSort()
Sorts elements in ascending order using quick sort.
|
void |
resize(long size)
Resizes array.
|
void |
set(int segment,
int offset,
boolean value)
Sets element to value for indicated segment and offset.
|
void |
set(long index,
boolean value)
Sets element to value for indicated index.
|
void |
shrink()
Shrinks capacity to fit actual size.
|
long |
size()
Gets size of array.
|
void |
sort()
Sorts elements in ascending order using merge sort.
|
void |
sort(it.unimi.dsi.fastutil.longs.LongComparator comparator)
Sorts elements in a specified order using merge sort.
|
void |
swap(long indexA,
long indexB)
Swaps two elements.
|
boolean[] |
toArray()
Copies the values to an ordinary array.
|
boolean[] |
toArray(long from,
long to)
Copies indicated range to an ordinary array.
|
void |
updateFrom(LargeBooleanArray array)
Updates this array from the provided array.
|
void |
updateFrom(LargeBooleanArray array,
long from,
long to,
long insertionPoint)
Updates this array from the provided array.
|
public static final byte ARRAY_BIT_SIZE
public static final int MAX_SIZE_ARRAY
public static final long MINIMUM_INITIAL_CAPACITY
public static final double RELATIVE_CAPACITY_INCREASE
public static final long MAX_SIZE
public LargeBooleanArray(long size)
Both the capacity and the size is being set to size
, with
all elements initialised to their default value. If instead, you prefer
an empty array, but reserve capacity, pass 0
size
here and use ensureCapacity(long)
.
size
- Size of the arraypublic LargeBooleanArray(long size, boolean constant)
size
- Size of the arrayconstant
- Constant value to setpublic LargeBooleanArray(boolean[] values)
values
- Array to copy frompublic static int getSegment(long index)
index
- Indexpublic static int getOffset(long index)
index
- Indexpublic int nSegments()
public int length(int segment)
segment
- Segmentpublic boolean get(long index)
index
- Index of elementpublic boolean get(int segment, int offset)
segment
- Segment of elementoffset
- Offset of elementpublic void set(long index, boolean value)
index
- Index of elementvalue
- Valuepublic void set(int segment, int offset, boolean value)
segment
- Segment of elementoffset
- Offset of elementvalue
- Valuepublic void fill(boolean constant)
constant
- Constantpublic void fill(long from, long to, boolean constant)
from
- From index, inclusiveto
- To index, exclusiveconstant
- Constantpublic void append(boolean value)
value
- Valuepush(boolean)
,
pop()
public void push(boolean value)
value
- Valueappend(boolean)
,
pop()
public boolean pop()
public void clear()
public void ensureCapacity(long minCapacity)
The capacity is increased with a percentage indicated by RELATIVE_CAPACITY_INCREASE
, unless the indicated minimum capacity
exceeds this.
minCapacity
- Minimum capacitypublic void resize(long size)
size
- New sizepublic void shrink()
public long size()
This is always less than or equal to the capacity.
public long capacity()
This is always greater than or equal to the size.
public void swap(long indexA, long indexB)
indexA
- First element to swapindexB
- Second element to swappublic void mergeSort()
public void quickSort()
public void sort()
public void sort(it.unimi.dsi.fastutil.longs.LongComparator comparator)
comparator
- Comparator indicating the desired orderingpublic void updateFrom(LargeBooleanArray array)
array
- Array to update frompublic void updateFrom(LargeBooleanArray array, long from, long to, long insertionPoint)
Values from other array starting at from
until
to
(exclusive) will be copied to this array, starting
from the insertionPoint
onwards.
array
- Array to update fromfrom
- Index in array
from where to update,
inclusiveto
- Index in array
until where to update,
exclusiveinsertionPoint
- Starting index in this array to updatepublic LargeBooleanArray copyOfRange(long from, long to)
from
- From index, inclusiveto
- To index, exclusivepublic boolean[] toArray()
Not all elements of this array may fit in an ordinary array.
public boolean[] toArray(long from, long to)
from
- From index, inclusiveto
- To index, exclusivepublic LargeBooleanArray clone()
clone
in class java.lang.Object


This page was generated
November 7, 2011
1:37 PM
|
XQuery Function Reference
|
Module: SpreadsheetML Support
|
|
The SpreadsheetML function module is installed as the following
file:
install_dir/Modules/MarkLogic/openxml/spreadsheet-ml-support.xqy
where install_dir is the directory in which
MarkLogic Server is installed.
To use the spreadsheet-ml-support.xqy module in your own
XQuery modules,
include the following line in your XQuery prolog:
import module namespace excel="http://marklogic.com/openxml/excel"
at "/MarkLogic/MarkLogic/openxml/spreadsheet-ml-support.xqy"
The SpreadsheetML functions are used to manipulate Microsoft Office
Open XML documents.
Pieces required for creating a .xlsx
Below are functions for manipulating the XML files from Excel 2007 documents which have been extracted from their .xlsx package. Also provided are functions for the dynamic generation of complete workbooks (a .xlsx package) and their requisite related parts. Some details on standard and enhanced .xlsx packages follows.
The required files for a standard minimum .xlsx, a workbook, with just worksheets, and no tables (tables manifest as NamedRanges/AutoFiltering/Styles in Excel), requires the pieces detailed in Table1 below. In Table2 on the right are details for the pieces required when adding Excel tables to the .xlsx. In the right column of each table we've noted which functions can assist in generating these parts.
|
Note: Each worksheet will have its own file, sheet1.xml, sheet2.xml to sheetN.xml. The number of sheets and their relationships must be accounted for in [Content_Types].xml, workbook.xml, and workbook.xml.rels. When adding tables, each table has its own file as well: table1.xml, table2.xml, to tableN.xml. Each table is mapped to a sheet#.xml.rels, where each sheet has its own single relationships file for relating the tables to the sheet. If no table is related to the sheet, sheet#.xml.rels file is Not required for that sheet.
|
|
Function Summary
|
|
excel:a1-column
|
This function returns the column letter from A1 notation cell reference.
|
|
excel:a1-row
|
This function returns the row number from A1 notation cell reference.
|
|
excel:a1-to-r1c1
|
This function converts the cell coordinate in A1 notation to R1C1 notation (row/column notation).
|
|
excel:cell
|
This function creates a cell.
|
|
excel:cell-string-value
|
This function returns the text values for the cells, mapping their values from the sharedStrings table.
|
|
excel:column-width
|
This function creates the ms:cols element, which can be added to a worksheet to define custom column widths.
|
|
excel:content-types
|
This function creates a content types element for the .xlsx package ([Content_Types].xml).
|
|
excel:create-row
|
This function creates a row populated with cells, the values of which are passed in with the parameter sequence.
|
|
excel:create-row
|
This function creates a row populated with cells, the values of which are passed in with the map parameter.
|
|
excel:create-simple-xlsx
|
This function creates a .zip file that is a .xlsx package containing the minimum parts required to be a valid package.
|
|
excel:create-xlsx-from-xml-table
|
This function will attempt to generate an Excel workbook from an XML table.
|
|
excel:directory-to-filename
|
This function converts the directory name, to the name of the .xlsx package.
|
|
excel:directory-uris
|
This function returns the URIs for files extracted from .xlsx package using Open XML Extract pipeline.
|
|
excel:get-mimetype
|
This function returns the mimetype for the given URI.
|
|
excel:gregorian-to-julian
|
This function converts a gregorian date to an Excel julian day.
|
|
excel:julian-to-gregorian
|
This function converts and Excel julian day number to a gregorian date.
|
|
excel:map-shared-strings
|
This function dereferences cell text values so text is stored within
the worksheet, instead of just a reference sharedStrings table. |
|
excel:package-rels
|
This function creates a package relationships element for the .xlsx package (_rels/.rels).
|
|
excel:r1c1-to-a1
|
This function converts the row and column numbers from R1C1 notation (row/column notation) to the preferred A1
notation. |
|
excel:row
|
This function creates a worksheet row.
|
|
excel:set-cells
|
This function sets the cells within the provided worksheet.
|
|
excel:sharedstring-uri
|
This function returns the URI for the sharedString table, extracted from .xlsx using Open XML Extract pipeline.
|
|
excel:sheet-uris
|
This function returns only the worksheet URIs for files extracted from .xlsx package using Open XML Extract pipeline.
|
|
excel:table
|
This function creates a table element for a .xlsx package (xl/tables/table#.xml).
|
|
excel:workbook
|
This function creates a workbook element for the .xlsx package (xl/workbook.xml) .
|
|
excel:workbook-rels
|
This function creates a workbook relationships element for the .xlsx package (xl/_rels/workbook.xml.rels).
|
|
excel:workbook-sheet-names
|
This function returns the iworksheet names for the workbook.
|
|
excel:worksheet
|
This function creates a worksheet for the .xlsx package (xl/worksheets/sheet#.xml).
|
|
excel:worksheet-rels
|
This function createts a worksheet relationships element for a .xlsx package (xl/worksheets/_rels/sheet#.xml.rels).
|
|
excel:xlsx-package
|
This function creates a .zip file that is the .xlsx package containing the parts passed in as parameters.
|
|
excel:xlsx-manifest
|
This function constructs a manifest for the given URIs in the directory.
|
|
|
|
Function Detail
|
|
|
excel:cell(
|
|
$a1-ref as xs:string,
|
|
$value as xs:anyAtomicType?,
|
|
[$formula as xs:string?],
|
|
[$date-id as xs:integer?]
|
| ) as element(ms:c) |
|
|
|
Summary:
This function creates a cell.
|
Parameters:
|
$a1-ref
:
The row and column number for the cell provided in A1 notation.
|
|
$value
:
The cell value, either a number or a string.
|
|
$formula
(optional):
The formula for the cell.
|
|
$date-id
(optional):
The date style for the cell.
|
|
Example:
xquery version "1.0-ml";
import module namespace excel= "http://marklogic.com/openxml/excel"
at "/MarkLogic/openxml/spreadsheet-ml-support.xqy";
excel:cell("A1",123)
=>
<ms:c r="A1" xmlns:ms="http://schemas.openxmlformats.org/spreadsheetml/2006/main">
<ms:v>123</ms:v>
</ms:c>
|
Example:
xquery version "1.0-ml";
import module namespace excel= "http://marklogic.com/openxml/excel"
at "/MarkLogic/openxml/spreadsheet-ml-support.xqy";
excel:cell("A3",(),"SUM(A1:A2)")
=>
<ms:c r="A3" xmlns:ms="http://schemas.openxmlformats.org/spreadsheetml/2006/main">
<ms:f>SUM(A1:A2)</ms:f>
</ms:c>
Note:
Above we pass the empty sequence for the value, so only the formula is populated for the cell.
This way, when the cell is opened within Excel, the value will be generated by the formula and
populated within the cell. It is possible to create a cell with a value and a formula, where
the value the formula calculates and the value are not equal. Excel will not automatically correct this disparity
upon consuming the cell.
|
Example:
xquery version "1.0-ml";
import module namespace excel= "http://marklogic.com/openxml/excel"
at "/MarkLogic/openxml/spreadsheet-ml-support.xqy";
excel:cell("A3",32999,(),0)
=>
<ms:c r="A3" s="0" xmlns:ms="http://schemas.openxmlformats.org/spreadsheetml/2006/main">
<ms:v>32999</ms:v>
</ms:c>
Note:
Formula and date style assignment only applies to cells containing numeric values.
Formula and date style assignment will be ignored in the case that $value is of type xs:string.
|
|
|
|
excel:create-row(
|
|
$map as map:map,
|
|
$keys as xs:string*
|
| ) as element(ms:row) |
|
|
|
Summary:
This function creates a row populated with cells, the values of which are passed in with the map parameter. The cell's values
are either a number or of type string. This function creates a simple row, with simple cells; there
is no way to set row number explicitly, and there is no way to set cell
row/column position. It is assumed that the cells are populated in the
row in the order that they are passed to the function within the map.
Keys are passed separately as you may have more keys than are contained
within the map, this is done for sparsely populated tables. If the key
doesn't exist within the map, the cell will be created but will not
contain any value.
|
Parameters:
|
$map
:
Map containing values to be used for cell values within row.
|
|
$keys
:
Keys to be used for column values. If key doesn't exist within map, an empty cell will be created.
|
|
Example:
xquery version "1.0-ml";
import module namespace excel= "http://marklogic.com/openxml/excel"
at "/MarkLogic/openxml/spreadsheet-ml-support.xqy";
let $map := map:map()
let $put := (map:put($map, "RequestID",45683),
map:put($map, "Customer","Pete"))
let $keys := ("Customer","Address","RequestID")
return excel:create-row($map,$keys)
=>
<ms:row xmlns:ms="http://schemas.openxmlformats.org/spreadsheetml/2006/main">
<ms:c t="inlineStr"><ms:is><ms:t>Pete</ms:t></ms:is></ms:c>
<ms:c t="inlineStr"><ms:is><ms:t/></ms:is></ms:c>
<ms:c><ms:v>45683</ms:v></ms:c>
</ms:row>
|
|
|
|
excel:create-xlsx-from-xml-table(
|
|
$original-xml as node(),
|
|
[$col-cust-width as xs:integer?],
|
|
[$auto-filter as xs:boolean?]
|
|
[$tbl-style as xs:boolean?]
|
| ) as binary()? |
|
|
|
Summary:
This function will attempt to generate an Excel workbook from an XML
table. An XML table here is defined as a single wrapper element, with a
single repeating child element. The children elements of this repeating
element may vary in name and number. The list of distinct names of all the children elements will be
used as headers for columns, and their values will populate rows. It is
possible for the children to have different element names, so its
possible to generate a sparsely populated table. If the xlsx is not able to be created, and empty sequence is returned.
|
Parameters:
|
$original-xml
:
The XML to be converted.
|
|
$col-cust-width
:
A custom width for the columns in the worksheet.
|
|
$auto-filter
:
If true, columns will have auto-filter enabled.
|
|
$tbl-style
:
If true, then the table will have style TableStyleMedium10 applied.
|
|
Example:
xquery version "1.0-ml";
import module namespace excel= "http://marklogic.com/openxml/excel"
at "/MarkLogic/openxml/spreadsheet-ml-support.xqy";
let $xml := <catalog>
<item>
<product>beach ball</product>
<sku>123123</sku>
</item>
<item>
<product>swim fins</product>
<sku>444444</sku>
</item>
<item>
<product>scuba glasses</product>
<sku>888</sku>
</item>
</catalog>
let $package := excel:create-xlsx-from-xml-table($xml,"15",fn:true())
return xdmp:zip-manifest($package)
=>
<parts xmlns="xdmp:zip">
<part uncompressed-size="627" compressed-size="232" encrypted="false">[Content_Types].xml</part>
<part uncompressed-size="229" compressed-size="146" encrypted="false">xl/workbook.xml</part>
<part uncompressed-size="241" compressed-size="140" encrypted="false">_rels/.rels</part>
<part uncompressed-size="242" compressed-size="144" encrypted="false">xl/_rels/workbook.xml.rels</part>
<part uncompressed-size="1034" compressed-size="297" encrypted="false">xl/worksheets/sheet1.xml</part>
<part uncompressed-size="237" compressed-size="141" encrypted="false">xl/worksheets/_rels/sheet1.xml.rels</part>
<part uncompressed-size="410" compressed-size="229" encrypted="false">xl/tables/table1.xml</part>
</parts>
|
Example:
xquery version "1.0-ml";
import module namespace excel= "http://marklogic.com/openxml/excel"
at "/MarkLogic/openxml/spreadsheet-ml-support.xqy";
let $xml := <catalog>
<item>
<product>beach ball</product>
<sku>123123</sku>
</item>
<item>
<product>swim fins</product>
<sku>444444</sku>
</item>
<item>
<product>scuba glasses</product>
<sku>888</sku>
</item>
</catalog>
let $package := excel:create-xlsx-from-xml-table($xml,"15",xs:boolean("true"))
let $doc := xdmp:zip-get($package,"xl/worksheets/sheet1.xml")
return $doc
=>
<worksheet xmlns="http://schemas.openxmlformats.org/spreadsheetml/2006/main">
<cols xmlns:ms="http://schemas.openxmlformats.org/spreadsheetml/2006/main">
<col min="1" max="1" width="15" customWidth="1"/>
<col min="2" max="2" width="15" customWidth="1"/>
</cols>
<sheetData>
<row xmlns:ms="http://schemas.openxmlformats.org/spreadsheetml/2006/main">
<c t="inlineStr"><is><t>product</t></is></c>
<c t="inlineStr"><is><t>sku</t></is></c>
</row>
<row xmlns:ms="http://schemas.openxmlformats.org/spreadsheetml/2006/main">
<c t="inlineStr"><is><t>beach ball</t></is></c>
<c><v>123123</v></c>
</row>
<row xmlns:ms="http://schemas.openxmlformats.org/spreadsheetml/2006/main">
<c t="inlineStr"><is><t>swim fins</t></is></c>
<c><v>444444</v></c>
</row>
<row xmlns:ms="http://schemas.openxmlformats.org/spreadsheetml/2006/main">
<c t="inlineStr"><is><t>scuba glasses</t></is></c>
<c><v>888</v></c>
</row>
</sheetData>
<tableParts count="1">
<tablePart r:id="rId1" xmlns:r="http://schemas.openxmlformats.org/officeDocument/2006/relationships"/>
</tableParts>
</worksheet>
|
|
|
|
excel:set-cells(
|
|
$worksheet as element(ms:worksheet),
|
|
$cells as element(ms:c)*
|
| ) as element(ms:worksheet) |
|
|
|
Summary:
This function sets the cells within the provided worksheet. If the cell
exists in the worksheet, it will be replaced. If the cell doesn't
exist, it will be set in the proper order within the proper row. If the
row doesn't exist, the row will be created and populated with the cell.
|
Parameters:
|
$worksheet
:
The worksheet where to set the cells.
|
|
$cells
:
The cells to be set within $worksheet.
|
|
Example:
xquery version "1.0-ml";
import module namespace excel= "http://marklogic.com/openxml/excel"
at "/MarkLogic/openxml/spreadsheet-ml-support.xqy";
declare namespace ms="http://schemas.openxmlformats.org/spreadsheetml/2006/main";
let $cell1 := excel:cell("A1","foo")
let $cell2 := excel:cell("B3",123)
let $cell3 := excel:cell("A5",456)
let $worksheet :=
<ms:worksheet>
<ms:sheetData>
<ms:row r="1">
<ms:c r="A1"><ms:v>1</ms:v></ms:c>
</ms:row>
<ms:row r="5">
<ms:c r="C5"><ms:v>1</ms:v></ms:c>
</ms:row>
</ms:sheetData>
</ms:worksheet>
return excel:set-cells($worksheet, ($cell1,$cell2,$cell3))
=>
<ms:worksheet xmlns:ms="http://schemas.openxmlformats.org/spreadsheetml/2006/main">
<ms:sheetData>
<ms:row r="1">
<ms:c r="A1" t="inlineStr"><ms:is><ms:t>foo</ms:t></ms:is></ms:c>
</ms:row>
<ms:row r="3">
<ms:c r="B3"><ms:v>123</ms:v></ms:c>
</ms:row>
<ms:row r="5">
<ms:c r="A5"><ms:v>456</ms:v></ms:c>
<ms:c r="C5"><ms:v>1</ms:v></ms:c>
</ms:row>
</ms:sheetData>
</ms:worksheet>
|
Example:
xquery version "1.0-ml";
import module namespace excel= "http://marklogic.com/openxml/excel"
at "/MarkLogic/openxml/spreadsheet-ml-support.xqy";
declare namespace ms="http://schemas.openxmlformats.org/spreadsheetml/2006/main";
let $cel1 := excel:cell("G23","bar")
let $worksheet :=
<ms:worksheet>
<ms:sheetData>
</ms:sheetData>
</ms:worksheet>
return excel:set-cells($worksheet, ($cel1))
=>
<ms:worksheet xmlns:ms="http://schemas.openxmlformats.org/spreadsheetml/2006/main">
<ms:sheetData>
<ms:row r="23">
<ms:c r="G23" t="inlineStr"><ms:is><ms:t>bar</ms:t></ms:is></ms:c>
</ms:row>
</ms:sheetData>
</ms:worksheet>
|
|
|
|
excel:table(
|
|
$table-number as xs:integer,
|
|
$tablerange as xs:string,
|
|
$column-names as xs:string+,
|
|
[$auto-filter as xs:boolean],
|
|
[$style as xs:boolean]
|
| ) as element(ms:table) |
|
|
|
Summary:
This function creates a table element for a .xlsx package (xl/tables/table#.xml). Tables in SpreadsheetML, manifest themselves as Named Ranges in an Excel worksheet. With these tables you can apply auto-formatting for columns, as well as styling.
|
Parameters:
|
$table-number
:
The number of the table.
|
|
$tablerange
:
The ranger of the table in Excel notation A1-colon notation. ("A1:C3")
|
|
$column-names
:
The names of the columns. These are the values from the first row in the cells found in $tablerange.
|
|
$auto-filter
(optional):
If true, columns will have autofilter enabled. Default true.
|
|
$style
(optional):
If true, simple style of TableStyleMedium10 is applied to table. Default none.
|
|
Example:
xquery version "1.0-ml";
import module namespace excel= "http://marklogic.com/openxml/excel"
at "/MarkLogic/openxml/spreadsheet-ml-support.xqy";
excel:table(1,"A1:C3",("Heading1","Heading2","Heading3"))
=>

<autoFilter ref="A1:C3"/>
<tableColumns count="3">
<tableColumn id="1" name="Heading1"/>
<tableColumn id="2" name="Heading2"/>
<tableColumn id="3" name="Heading3"/>
</tableColumns>

|
Example:
xquery version "1.0-ml";
import module namespace excel= "http://marklogic.com/openxml/excel"
at "/MarkLogic/openxml/spreadsheet-ml-support.xqy";
excel:table(1,"A1:C3",("Heading1","Heading2","Heading3"),xs:boolean("false"),xs:boolean("true"))
=>

<tableColumns count="3">
<tableColumn id="1" name="Heading1"/>
<tableColumn id="2" name="Heading2"/>
<tableColumn id="3" name="Heading3"/></tableColumns>
<tableStyleInfo name="TableStyleMedium10" showFirstColumn="0" showLastColumn="0" showRowStripes="1" showColumnStripes="0"/>

|
|
|
|
excel:worksheet(
|
|
$rows as element(ms:row)*,
|
|
[$colwidths as element(ms:cols)?],
|
|
[$tbl-count as xs:integer]
|
| ) as element(ms:worksheet) |
|
|
|
Summary:
This function creates a worksheet for the .xlsx package (xl/worksheets/sheet#.xml)
|
Parameters:
|
$rows
:
The rows for the worksheet.
|
|
$colwidths
(optional):
The custom column widths for the worksheet.
|
|
$tbl-count
(optional):
The number of tables associated with the worksheet.
|
|
Example:
xquery version "1.0-ml";
import module namespace excel= "http://marklogic.com/openxml/excel"
at "/MarkLogic/openxml/spreadsheet-ml-support.xqy";
let $cells := ((excel:cell("A1",1),
excel:cell("B1",2),
excel:cell("C1",3)))
let $row := excel:row($cells)
return excel:worksheet($row)
=>
<worksheet xmlns="http://schemas.openxmlformats.org/spreadsheetml/2006/main">
<sheetData>
<row r="1" xmlns:ms="http://schemas.openxmlformats.org/spreadsheetml/2006/main">
<c r="A1"><v>1</v></c>
<c r="B1"><v>2</v></c>
<c r="C1"><v>3</v></c>
</row>
</sheetData>
</worksheet>
|
Example:
xquery version "1.0-ml";
import module namespace excel= "http://marklogic.com/openxml/excel"
at "/MarkLogic/openxml/spreadsheet-ml-support.xqy";
let $cells := ((excel:cell("A1",1),
excel:cell("B1",2),
excel:cell("C1",3)))
let $row := excel:row($cells)
let $colwidths := excel:column-width((25,25,25))
return excel:worksheet($row,$colwidths)
=>
<worksheet xmlns="http://schemas.openxmlformats.org/spreadsheetml/2006/main">
<sheetData>
<cols>
<col min="1" max="1" width="25" customWidth="1"/>
<col min="2" max="2" width="25" customWidth="1"/>
<col min="3" max="3" width="25" customWidth="1"/>
</cols>
<row r="1" xmlns:ms="http://schemas.openxmlformats.org/spreadsheetml/2006/main">
<c r="A1"><v>1</v></c>
<c r="B1"><v>2</v></c>
<c r="C1"><v>3</v></c>
</row>
</sheetData>
</worksheet>
|
Example:
xquery version "1.0-ml";
import module namespace excel= "http://marklogic.com/openxml/excel"
at "/MarkLogic/openxml/spreadsheet-ml-support.xqy";
let $cells := ((excel:cell("A1",1),
excel:cell("B1",2),
excel:cell("C1",3)))
let $row := excel:row($cells)
let $colwidths := excel:column-width((25,25,25))
return excel:worksheet($row,$colwidths,2)
=>
<worksheet xmlns="http://schemas.openxmlformats.org/spreadsheetml/2006/main">
<cols>
<col min="1" max="1" width="25" customWidth="1"/>
<col min="2" max="2" width="25" customWidth="1"/>
<col min="3" max="3" width="25" customWidth="1"/>
</cols>
<sheetData>
<row r="1" xmlns:ms="http://schemas.openxmlformats.org/spreadsheetml/2006/main">
<c r="A1"><v>1</v></c>
<c r="B1"><v>2</v></c>
<c r="C1"><v>3</v></c>
</row>
</sheetData>
<tableParts count="2">
<tablePart r:id="rId1"/>
<tablePart r:id="rId2"/>
</tableParts>
</worksheet>
|
|
|
|
excel:xlsx-package(
|
|
$content-types as element(types:Types),
|
|
$workbook as element(ms:workbook),
|
|
$rels as element(pr:Relationships),
|
|
$workbookrels as element(pr:Relationships),
|
|
$sheets as element(ms:worksheet)*,
|
|
[$worksheetrels as element(pr:Relationships)*],
|
|
[$table as element(ms:table)*]
|
| ) as binary() |
|
|
|
Summary:
This function creates a .zip file that is the .xlsx package containing
the parts passed in as parameters. It is assumed the parts are properly
mapped to one another. Just using the constructors provided, and setting the number of worksheets, its possible to generate workbooks dynamically. It's also quite simple to add a named range to a single worksheet. It can get a little tricker when adding multiple tables to multiple worksheets, but we've aimed to simplify workbook construction for you with the constructors provided.
Some things to remember: Worksheets will appear in the Workbook in the order they are added within their sequence. Tables must have unique names, and unique relationship ids. (the constructor accounts for this by letting you add tables by number, as that's how they'll be saved within the .xlsx package natively.) Every table must also have a worksheet relationship defined. Each worksheet has its own worksheet relationships filed saved within the .xlsx package.
|
Parameters:
|
$content-types
:
The [Content_Types].xml part.
|
|
$workbook
:
The workbook.xml part.
|
|
$rels
:
The package Relationships part.
|
|
$workbookrels
:
The workbook Relationships part.
|
|
$sheets
:
The worksheet (sheetN.xml) parts.
|
|
$worksheetrels
(optional):
The sheetN.xml Relationships parts. (Required when mapping tables to sheets.)
|
|
$table
(optional):
The table.xml parts. (Used for named ranges, auto-filtering columns, styling, etc.)
|
|
Example:
xquery version "1.0-ml";
import module namespace excel= "http://marklogic.com/openxml/excel"
at "/MarkLogic/openxml/spreadsheet-ml-support.xqy";
declare namespace ms = "http://schemas.openxmlformats.org/spreadsheetml/2006/main";
let $worksheets:= (<ms:worksheet>
<ms:sheetData>
<ms:row>
<ms:c>
<ms:v>1</ms:v>
</ms:c>
</ms:row>
</ms:sheetData>
</ms:worksheet>)
let $ws-count := fn:count($worksheets)
let $content-types := excel:content-types($ws-count,0)
let $workbook := excel:workbook($ws-count)
let $rels := excel:package-rels()
let $workbookrels := excel:workbook-rels($ws-count)
let $package := excel:xlsx-package($content-types, $workbook, $rels, $workbookrels, $worksheets)
return xdmp:zip-manifest($package)
=>
<parts xmlns="xdmp:zip">
<part uncompressed-size="499" compressed-size="218" encrypted="false">[Content_Types].xml</part>
<part uncompressed-size="229" compressed-size="146" encrypted="false">xl/workbook.xml</part>
<part uncompressed-size="241" compressed-size="140" encrypted="false">_rels/.rels</part>
<part uncompressed-size="242" compressed-size="144" encrypted="false">xl/_rels/workbook.xml.rels</part>
<part uncompressed-size="172" compressed-size="115" encrypted="false">xl/worksheets/sheet1.xml</part>
</parts>
|
|
|
|
|
|


Member Updates
6/28/2016
The juniors are off to a fantastic start to the season after racing at the Head of the Christina this weekend. This upcoming weekend they will take off before racing at the Navy Day regatta the following weekend.
* Cassie Waters/Laura McDaniel: Women's Youth 2X: FIRST PLACE
* Morgan Doak: Women's Youth 1X: FIRST PLACE
* Amaris Hinton: Women's Youth 1X: 2ND PLACE
* Doug Barrett/Wilson Moorer/Jake lamason/Andrew Flynn: Men's Youth JV4X: 2ND PLACE
6/28/2016
Fall Registration will open on the 28th.
Please visit Regatta Central. Fall Registration.
10/6/2016
Women's Henley Regatta: June 17th - 19th (Race time tbd)
Click here to see the live stream.
Participants:
Women's 18 and under 4x - Morgan Doak, Samantha Petrelli, Cassie Waters, Shane Devine
Women's 16 and under 4x - Zulaika Brown, Myca Hinton, Laura McDaniel, Amaris Hinton
After a hard fought race with the best boats in the country at Junior Nationals with Josh Quinn, Paul Leung, Samantha Petrelli, and Amaris Hinton, the Henley 8 girls have landed in London and are preparing for their journey to compete and represent BRC and the United States at the Women's Henley Regatta.
 You earn your seat by demonstrating strength, aerobic fitness, flexibility, superior technical skill, erg score times, boat-moving abilities (not the same as erg scores) and a coachable attitude that matches well with the many combinations of potential athletes. When you are able to put this together, and train over a period of time together it makes for fast outcomes. Coaches use these and other criteria to rank and boat athletes. Rowing is not, however, always fair. Tall, strong, flexible, smart athletes sometimes come by their traits naturally. Others must work to overcome limitations through additional training, determination, superior technique, and study. High level finishes at the high school, collegiate and Olympic levels come through single minded dedication.
Gear
Rowing gear for practices/regattas includes spandex shorts, tech shirt/tank top, long sleeve shirt, close-fitting windbreaker, sneakers, flipflops (for the boat), socks, sunscreen, sunglasses, baseball cap, change of clothing, and a personally labeled water bottle.
Rower Policies
- Swimming competence is required: 4 minutes treading water and putting on a life jacket while still in the water.
- Attendance at all practices and regattas is required. Any absence must be reported by text or cell phone to the coaches ahead of time. Email may be used but no later than noon each day.
- Excused absences are for illness, family emergency or religious holidays. Academic issues should be discussed with the coaches separately because we expect good time management in order to balance both school and rowing.
- Three (3) unexcused absences are grounds for dismissal from the team. An unexcused absence is an unreported absence or one that falls outside the excused guidelines. Athletes are responsible for making up workouts, coaches’ discretion.
- Absences of any kind exceeding 10% of the season may make an athlete ineligible to race.
- Drinking, smoking, or use of illegal drugs will not be allowed. Any instance of doing so or heavy suspicion will result in you being asked to leave immediately. Using of any illegal substances will also lead to suspension or expultion from the program. Medical conditions related to the matter must be reported upfront before the start of the season.
- Rowers must satisfactorily complete erg tests, including 2Ks and 5/6Ks (along with any other metric for gauging fitness) in order to be boated for racing.
- Practice starts promptly at 4:30 pm Mondays, Tuesdays, Thursdays, and Fridays 10:00 am – noon Saturdays, until regattas begin. Rowers should be ready ahead of time in rowing gear, noted on website, in order to start practice on time or risk doing a land workout. Excessive tardiness may be grounds for dismissal from the team.
- School holidays (spring break, fall break, etc.) are not holidays for BRC. Rowers are expected to come to practice even when their school is not in session.
- PARENTS: Please schedule doctor/dentist appointments around rowing practices and the race schedule. Do NOT risk your child’s position on the team by having them run errands, pick up younger siblings or engage in other jobs for you during the rowing season.
- Respect is a hallmark of a rowing community. We expect respectful behavior and language toward teammates, coaches, club members, parents, city employees, visitors – in short, toward everyone at home and while traveling. We also expect respectful care and handling of all equipment.
- You may not leave practice until dismissed by your coach. If you do not check out you will be in charge on making sure all equipment is properly stored and put away for the next week. This includes properly putting away oars, coxboxes, and any other item specified on the end of day check list.
- Registration payment is due by the end of the first week of the season unless otherwise specified with the director. After the first week, rowers may not attend practice until registration and payments, including outstanding previous season fees, are complete.


On Tap: Burnaby’s Dageraad releases four new brews
by Rob Mangelsdorf - The GrowlerBurnaby’s Dageraad Brewing has been busy this past week, releasing four beers and ensuring this holiday season will indeed be merry. Here’s a look at where our money’s going this week.
Anno 2019 by Dageraad Brewing
Golden strong ale • 8.5% ABV • 750 mL bottles
Dageraad’s annual celebratory year-end beer is a golden strong ale brewed with Okanagan pears and Indian coriander. The beer is bottle conditioned with Brettanomyces claussenii, a strain of wild yeast that adds funky, fruity flavours and slowly develops over time in the bottle, preserving freshness and adding layers of complexity as the beer ages. You’re going to want to buy at least two bottles, so you can try one now and the other in a year or two. If you can wait that long.
Entropy No. 11 by Dageraad Brewing
Barrel-aged lemon saison • 7.0% ABV • 750 mL bottles
The latest in Dageraad’s barrel-aged Entropy series is inspired by the whiskey sour cocktail with bright, tart lemon and saison esters on a foundation of deep, rich bourbon, with notes of vanilla and oak.
Irresolution by Dageraad Brewing
Dry-hopped Belgian-style pale ale • 5.5% ABV • 473 mL tall cans
Dageraad continues its annual tradition of making a beer with all of its leftover hops. According to the brewery, “Irresolution is different every year, but it’s always designed to brighten the holidays and make you second-guess any rash declarations or promises made in the thrill of the moment on the 31st, or in the stinging morning light on the 1st.”
8˚ by (you guessed it) Dageraad Brewing
Dark sour ale • 8.9% ABV • 650 mL bottles
This kettle-soured Belgian-style dubbel is smooth with a hint of caramel and molasses with notes of dark fruit and plum and a lightly tart, dry finish, “that practically begs for another sip,” according to the brewery. At 8.9% ABV, though, you’d better be careful with this one.


{% extends 'base.html' %} {% import 'macros.html' as macro %} {% block styles%} {{ super() }} {% endblock %} {%block content%}
{{ quote.quote }}
In this Blog page you can share
your thoughts with other people or ideas.
you can also see random quotes
that can help you get
that inspiration or insight
to spark
that thought you have.


--- layout: default ---
This newsletter goes out twice a month (or so). Sent via Mailchimp, this newsletter provides a link to the weekly Contrafabulists podcast episode, as well as updates on what Kin Lane and Audrey Watters are up to as writers, speakers, and travelers. Sign up here.
We will not sell or share this mailing list with anyone.
Image credits: Bryan Mathers


Alliance Of Commerce And Economics is a club at Delhi Public School,Dwarka. Our aim is to remove the myth that commerce is a backup option rather it's an equally challenging and hence rewarding option.
It gives me the immense pleasure to see that the ACE club has ameliorated in the past few years. I wish them best of luck for the future.
Mrs.Sushma Anthwal
<EMAIL_ADDRESS>+9111-25074472-75
Sector-3,Dwarka,New Delhi


Imad Abbas is a second-year B.Sc EEE student at the University Of Khartoum, Sudan. He is passionate about serving the society through the creation of new technologies. He is the founder of Enlighten. Enlighten is a startup company working to ensure an equitable quality education opportunity for the visually impaired by making digital content accessible. Imad has a keen interest in machine learning and the development and design of mobile applications. Imad won two regional awards for “Electrical and Electronics Engineering Exhibition, ” from University of Khartoum, "Program Your Idea" competition from UAE Innovation week. And most recently an international fellowship at the DMZ at Ryerson University in Toronto Canada.
A digital education platform for visually impaird.
Building a mobile app on production scale, end to end and with lastest technology. Experienced in Android development and Flutter.
CGPA: 8.23
GPA: 3.99


Quick searches can be performed with the Find Tool on the Edit Bar. The Find Dialog provides similar facilities but more options. Searches are done with the Boyer-Moore algorithm which, apart from being very fast, has the peculiarity that the longer the string of (unique) characters you are searching for the faster the search, although the limiting factor is likely to be the speed of your disk or network.
Find Tool
The Find Tool on the Edit Bar allows you to search for bytes by either entering them as hex digits, or as a string. String searches can be case-sensitive or case-insensitive, and use EBCDIC rather than ASCII characters if you are currently viewing characters using the EBCDIC character set. You can also quickly start a case-insensitive, case-sensitive or hex search using the F4, F5 or F6 key.
The Find Tool also retains a history of the most recent searches performed. This history list is retained between invocations of HexEdit and is shared with the pages of the Find dialog (see below).
Find Dialog
The Find dialog provides a few more options than the Find Tool. For example, you can use wildcards, and search for whole words, perform a search and replace operation etc. The only disadvantage of the Find Dialog is that it takes up more screen space than the Find Tool, but it does automatically get out of the way of the cursor if it can.
The find dialog is divided into several pages. Every page has the same direction (up/down) and scope controls. The scope is typically "to end of file" (or "to start of file" if the direction is up) but you can search the whole file and even all open files. After a successful whole file search is done, the scope automatically switches to "to end of file" mode so that a subsequent search does not find exactly the same thing. The "to mark" scope is useful if you just want to search through part of a large file.
The "Basic" page allows you to quickly specify a search item as a string or in hex. If the characters you enter look like hex bytes (ie contain only an even number of hex digits, with optional spaces) then a hex search is done, else the characters are treated as a string to search for. A string search has the option of being whole word only and case-insensitive. The string search is done in EBCDIC if the active file is in EBCDIC display mode else ASCII is used.
The "Hex" search page is useful if you want to ensure you perform a hex (not text) search. It also allows you to specify a bit mask to remove certain bits from the search. There is also an option to specify the alignment so you could for example only search for a number when it occurs on a word boundary. As you enter the bytes in hex the corresponding characters are filled in in the text page (see below) in the selected character set, which allows you to check ASCII and EBCDIC values and even convert between character sets.
The "Text" search page is useful if you want to ensure you perform a text (not hex) search. You can also specify a wildcard character that matches any character. As well as the whole word and case-insensitive search option you can also explicitly specify an ASCII (actually ANSI), EBCDIC or Unicode character set search. As you enter text the corresponding hex values are entered in the hex page (using the current character set). Hence you can flip between page to combine options, eg, if you wanted to perform a text search but with alignment restrictions.
The "Number" page allows you to search for number in a variety of integer and floating points formats and sizes, and in both big- and little-endian byte order. Like the hex page there is also an option to specify the alignment of the number found.
The "Replace" page allows you to perform a search and replace operation. Like the simple page you can use a text or a hex search and replace -- hex is only used if both the search and replace items appear to be hex. The "Replace" button allows you to interactively find and replace items one at a time, whereas the "Replace All" button allows you to replace all occurrences within the current scope.
Other Find Commands
Other “find” commands allow you to repeat a search, using the current search bytes, in either direction. Like many Windows programs (like NotePad) the find next command is mapped to F3 (in the default keymap) and find backwards is mapped to Shift+F3.
The “Find Selection” command allows you to search for the next occurrence of the currently selected bytes. This is mapped (as in Visual Studio and other programs) to Ctrl+F3.
For further information see:
Find Tool to find out how to do quick searches
Find command to invoke the Find dialog
Find backward command to find out how to repeat a search towards the start of file
Find forward command to find out how to repeat a search towards the end of file
Find selection command to search for the next occurrence of the selected bytes
Char Set EBCDIC to perform searches using the EBCDIC character set
.


Using our API is really easy. Just post a file to our store-page: (max size: 200mb)
<form action="/store" enctype="multipart/form-data" method="post"> <input type="file" name="file" /> <input type="submit" /> </form>
size: bytes, type: , url:


16 June 2005
WHO is aware of media reports that six additional patients infected with H5N1 avian influenza are undergoing treatment in a Hanoi hospital and that a health care worker at the same hospital may also be infected. While these reports have not yet been officially confirmed by national authorities, they appear to be accurate.
WHO is seeking confirmation and further information from the Ministry of Health.


Test Game. Still not sure what to call this game.  You have to get inside the house through the walkway to win! Enjoy!


BioWare is reportedly overhauling Anthem and developing a new Mass Effect
Source: Anthem press kit
What you need to know
- Anthem, the latest game from BioWare, has had some problems since release.
- These problems include technical issues, poorly-received gameplay mechanics and more.
- According to Kotaku, BioWare is planning a full overhaul of the game.
- Kotaku also reports that a new Mass Effect game has entered early development at BioWare Edmonton.
Anthem, BioWare's latest game, has had a rough go of things since release, with its roadmap repeatedly delayed, the major Cataclysm event releasing long after originally intended, gameplay problems, mechanics that were broken and more. BioWare has also been dealing with a series of departures from the studio, including Ben Irving, the lead producer.
Still, fans of Anthem shouldn't lose all hope just yet. According to a new report from Jason Schreier at Kotaku, BioWare is currently planning a major overhaul of the game to improve gameplay mechanics, the loot system, progression, quests and much more. Tentatively titled Anthem Next, it's currently unclear exactly how these improvements will come, whether as a series of updates, a revised version of the game or something else.
Another interesting part of the report was the news that a new Mass Effect game has entered development at BioWare Edmonton, under director Mike Gamble. That game would be extremely early in development however and fans probably shouldn't expect news for some time. Coming sooner than the new Mass Effect would be Dragon Age 4, which was teased at the Game Awards 2018 with #theDreadWolfRises.
Special edition
Anthem: Legion of Dawn Edition
Join the Legion
Anthem is BioWare's new IP, allowing players to pilot powerful Javelin armor suits that come in four different varieties and can be tweaked and customized endlessly.

- Best keyboards for PlayStation 4 in 2019
- Best PlayStation 4 Games
We may earn a commission for purchases using our links. Learn more.


Charles Peden
a website for the shewing of divers skills and virtues
A contrarian product of semi-rural southern Oregon, Charles likes to consider himself a dispassionate craftsman interested in the quality of both process and product.
With an eclectic educational history including studies of Literature, Chinese Language and History, Garment Patternmaking and, soon, Web Development, he has hitherto pursued an equally eclectic career in that most rewarding of professional fields, the arts.
What follows is a list of links to the exciting programming projects Charles has thus far produced.


LOGIN
SIGNUP
HOME
ARTWORKS
ARTISTS
EXHIBITIONS
SHOPS
ABOUT
Paintings
Photos
Sculptures
SCULPTURES
The diskobolos
Venus De-Milo
Sotheby's
MR.DOB
Man who bears the cross
The cube
17P
Square No


Must be overridden. Takes a SupportedSubjectTypes and any initial option
BehaviorSubject
ReplaySubject
subject type to use
intial option to pass the subject on construction
this instance
Native JavaScript map that holds the key-values
Size of the map
Get (or create) subject for a specified key
key's subject to return
Will call .complete()
on all subjects and
clear the map
Will call .complete()
on key's subject and
remove the key from the map.
key to remove
Emit an error on the key's observable. This
will call .error(error)
which ends the observable
stream.
It then removes the key-value from the map since the observable has ended.
key to emit error on
error to emit
Get the map's entries as key-observable
Will call the function for each observable-key value in the map.
function to execute on the maps key-value
Get the observable for the specified key.
key to retrieve
Check if a key exists on the map
to check for
check if the key exists
Get the map's keys
Set a key-value pair. This will create a SupportedSubjectTypes
(or reuse if key already existed) for the key specified.
It will call .next(value)
on that subject.
key to index value
value to store
Get the map's ovservable values
Generated using TypeDoc
BaseMap class used to provide shared functionality for implementing classes.


A cookie recipe website page.
Uses HTML.
A single page using an introduction of attaching style sheets in CSS and images elements.
Uses HTML, CSS.
A website created to practice git branching.
Uses HTML, CSS, Git.
A website for Tiki Island.
Uses HTML, CSS.
A website for Cupcake Baker.
Uses HTML, CSS.
Initial page for a resume.
Uses HTML, CSS.
A fan website for Primus.
Uses HTML, CSS.
A website for Two Drunk Fans utilizing the DIV tag of HTML.
Uses HTML, CSS.
Created a website using columns in HTML.
Uses HTML, CSS.
Created a website for an animal shelter. Utilized class descriptions on DIV tags.
Uses HTML, CSS.
Website incorporating Bootstrap styles.
Uses HTML, CSS, Bootstrap.
Website for Walley World.
Uses HTML, CSS, Bootstrap.
Excerise using Bootstrap to rebuild the Wikipedia front page.
Uses HTML, CSS, Bootstrap.
Create and maintain websites, gallery books and shows, interactive online catalogs.
Hired designers and photogrsphers, did editorial layout and initial mock ups of ad placement.
Managed ad placement and inclusion, editorial deadlines, and went to press checks weekly.
Coding has become an integral part of many design jobs.


This website is designed to provide additional information to individuals who have been contacted to participate in an important University of Pittsburgh study of environmental risk factors for ALS.
What are we studying?
We are studying a disease called ALS (Amyotrophic lateral sclerosis), also known as Lou Gehrig’s disease. It is the most common motor neuron disease in adults with over 17,000 people in the U.S. currently living with the disease. ALS attacks and kills nerve cells in the brain and spinal cord resulting in muscle wasting and death. It affects the ability to talk, swallow and breathe. There is no known cause and currently no treatment.
Who are we?
We are researchers from the University of Pittsburgh Graduate School of Public Health who study the role of the environment in the development and risk of diseases. Visit our About Us to learn more.
Why is this research being done?
The purpose of this research study is to look at possible risk factors for ALS, using information from the CDC National ALS Registry of individuals with ALS (cases) compared to a group of people without ALS (controls). A risk factor is an exposure or characteristic that puts you at greater risk for disease, (e.g., cigarette smoking is a risk factor for lung cancer.)
There are environmental, occupational, and personal risk factors which may be associated with an increased risk for ALS. We are exploring these risk factors in the hopes of identifying more about what causes this disease.
Who is being contacted for this study?
We are recruiting a control group—that is people without ALS—to compare to participants with ALS throughout the country. Potential controls are being recruited to participate in the study based on where they live and specific characteristics such as gender and age.
What will we ask participants to do?
Participants will be asked to complete a 30 minute telephone interview or online survey and to provide a one-time small blood sample either at home or work place. Participants will receive $60 for completing the interview and for donating this blood sample.
What the research hopes to show:
We want to determine if there are specific environmental or occupational exposures related to the risk for this disease. The blood sample from control participants will be used to compare with the sample from the ALS cases and will be tested for chemicals that persist in the body over a long period of time (such as pesticides).
Confidentiality
Any information provided for this research study will be kept strictly confidential and information will be aggregated with no individual identification.
Who is paying for this study?
The study, Identification and Characterization of Potential Environmental Risk Factors for ALS Using the ATSDR ALS Registry Cases and a Control Population, is funded by the National Center for Environmental Health/Agency for Toxic Substances and Disease Registry (ATSDR), Centers for Disease Control and Prevention (CDC) National ALS Registry, Atlanta, GA.


Comprehensive Psychological Assessments
Sakrei Psychological Services provides comprehensive evaluations for ADD; ADHD; various learning disabilities; and executive, behavioral, and emotional functioning.
Dr. Sakhai Kreinik has over 20 years of experience in conducting in-depth cognitive assesments for these conditions. She earned her Ph.D. in Clinical and School Psychology from Hofstra University. Dr. Sakhai Kreinik has extensive expertise in uncovering factors that hinder learning and retention.


Acknowledgements
- 1. Mars.png[Image] (July 26, 2018). Retrieved from: https://www.nasa.gov/image-feature/goddard/2018/mars-opposition-2018
- 2. Mars5.png[Image] (April 16, 2019). Retrieved from: https://marsprogram.jpl.nasa.gov/resources/22413/impact-induced-dust-avalanches/
- 3. PIA23138_modest.jpg[Image] (2019-04-23) Retrieved from: https://photojournal.jpl.nasa.gov/catalog/PIA23177
- 4. PIA23138_modest.jpg[Image] (2019-04-11) Retrieved from: https://photojournal.jpl.nasa.gov/catalog/PIA23138
- 5. Mars-overview-1.jpg[Image] (Nov. 30, 2018) Retrieved from: https://www.nasa.gov/feature/jpl/farewell-to-mars
- 6. Francesco Ungaro picture. stars.jpg[Image] (n.d.). Retrieved from: https://www.pexels.com/photo/starry-sky-998641/
- 7. Kai Pilger picture. stars5.jpg[Image] (n.d.). Retrieved from: https://www.pexels.com/photo/cluster-of-stars-1341279/
- 8. AndyWeir.jpg[Image] (n.d.). Retrieved from: https://en.wikipedia.org/wiki/Andy_Weir
- 9. bus.jpg[Image] (n.d.). Retrieved from: https://all-free-download.com/free-vector/download/bus-icon-colored-3d-design_275695.html
- 10. Mars6.jpg[Image] (n.d.). Retrieved from: https://hackaday.com/2017/06/30/hacking-on-mars-in-the-martian/
- 11. bookcover.jpeg[Image] (n.d.). Retrieved from: https://www.target.com/p/the-martian-reprint-paperback-by-andy-weir/-/A-16356092
- 12. writing.jpg[Image] (n.d.). Retrieved from: http://www.inforoads.com/refresh/creative-writing-can-be-the-perfect-antidote-to-stress
- 13. leaving-Mars.jpg[Image] (n.d.). Retrieved from: https://www.vox.com/science-and-health/2016/9/30/13099898/mars-death-risk-illustrated
- 14. Paul Blow picture. planting.jpg[Image] (n.d.). Retrieved from: https://www.popsci.com/can-you-fertilize-martian-crops-with-human-poop
- 15. growing-potatoes-2.png[Image] (n.d.). Retrieved from: http://topicsimple.com/blog/new-topic-simple-video-how-to-grow-potatoes-in-a-bucket/
- 16. growing-potatoes.gif[Image] (n.d.). Retrieved from: https://pngimage.net/potato-plant-png-3/
- 17. growing-potatoes-3.jpg[Image] (n.d.). Retrieved from: https://www.pinterest.com.au/rainbowsoverme/how-does-your-garden-grow/
- 18. growing-potatoes-4.jpg[Image] (n.d.). Retrieved from: http://fernandogarciadory.com/76413/como-cultivar-patatas-en-un-barril/plantar-patatas-barriles/
- 19. satellite.png[Image] (n.d.). Retrieved from: https://www.clipartmax.com/middle/m2i8m2m2d3K9i8G6_satellite-imagery-space-cartoon-satellite-in-space/
- 20. Mars-rover.png[Image] (n.d.). Retrieved from: https://pixabay.com/ro/photos/marte-transparente-luna-vehicul-3438484/
- 21. DOUG HALL. (Jun 8, 2018). 7 Ways to Grow Potatoes in Every Kind of Yard. Retrieved from: https://www.goodhousekeeping.com/home/gardening/a20706122/how-to-grow-potatoes/
- 22. Google Mars. (n.d.). Retrieved from: https://www.google.com/mars/
- 23. Mars-Wikipedia. (n.d.). Retrieved from: https://en.wikipedia.org/wiki/Mars
- 24. Newton's Third Law-The physics classroom. (n.d.). Retrieved from: https://www.physicsclassroom.com/class/newtlaws/Lesson-4/Newton-s-Third-Law
- 25. Newton's laws of motion-Wikipedia. (n.d.). Retrieved from: https://en.wikipedia.org/wiki/Newton%27s_laws_of_motion


SCG
Research
Teaching
Publications
Staff
Contact
Wiki
SCG
→
petit petri
→
examples
Petit Petri — Petri Net Examples
Last changed by oscar on 26 April 2009


--- layout: post title: Clouds date: '2011-02-15T08:05:00.002-06:00' author: Jabell tags: - Photography modified_time: '2011-02-15T16:00:02.723-06:00' thumbnail: http://farm5.static.flickr.com/4153/5442642999_edabb642e5_t.jpg blogger_id: tag:blogger.com,1999:blog-19739956.post-8997259953631557483 blogger_orig_url: http://theabellsix.blogspot.com/2011/02/clouds.html ---
Can I say again how much I love my wife? Not just because I think she takes great pictures, but because she is great. I am so thankful for her.


Football rumours from the media: United targeting Wilfried Zaha?
 The Crystal Palace forward has been linked with a £70million-plus return to Old Trafford in January. He previously played for the club between 2013 and 2015 but failed to make an impression. However, United’s need for creativity may see the 27-year-old leave Selhurst Park after he put in a transfer request in August.
Tottenham are interested in signing Memphis Depay from Ligue 1 side Lyon, the Daily Mirror reports. The Dutch striker flopped at Manchester United but has improved markedly since arriving in France in January 2017. Spurs have scouted the 25-year-old twice during recent Champions League games between Lyon and Benfica.
Teenager Matty Longstaff will sign a new deal at Newcastle in the coming weeks, according to The Daily Telegraph. However, older brother Sean has been told he needs to do more if he wants to secure a bumper new deal. Manager Steve Bruce is said to be delighted with Matty, who scored the winner on his debut against Manchester United last month. But Bruce wants to see 22-year-old Sean hit the same heights as last season after a knee injury has plagued him this season.
Bayern Munich are reportedly keen to replace Manuel Neuer with Arsenal goalkeeper Bernd Leno. The German shot-stopper, 27, has been scouted as a replacement for Neuer, whose form has dipped of late, according to The Sun.
Social media round-up
Players to watch
Habib Diallo: The 24-year-old Senegal and Metz striker is being targeted by Chelsea, Tottenham, Norwich and Watford for a transfer out of Ligue 1 in January, Teamtalk reports.
Chem Campbell: The Welsh 16-year-old is in advanced talks to stay with Wolves, even though there has been significant interest in the striker from Borussia Dortmund, RB Leipzig and Schalke, according to Football Insider.


APOLLO 13 A film review by Eric Grossman Copyright 1995 LOS ANGELES INDEPENDENT
APOLLO 13 is a movie that tries very hard. It strives with great fervor to remind us of the grandeur of the space program and of the patriotism that accompanied it. It tries desperately to make us sweat and bite our nails as we wait to see what happens to its heroic characters. But for all of its good intentions, APOLLO 13 is much like the mission it depicts, it is a successful failure. Director Ron Howard (PARENTHOOD, BACKDRAFT) and his ensemble cast lead by Tom Hanks but which also includes Kevin Bacon, Bill Paxton, Gary Sinise and Ed Harris, have made a number of both good and bad choices and the result is a film that reaches for greatness but must settle for just being good.
Based on the book LOST MOON by Apollo 13 mission commander Jim Lovell and co-writer Jeffrey Kluger, APOLLO 13 tells the story of NASA's near tragic mission to the moon. A malfunction that occurred enroute left Lovell and his fellow crew members Fred Haise (Bill Paxton) and Jack Swigert (Kevin Bacon) with very little chance of survival. The astronauts and the mission control staff headed by Gene Kranz (Ed Harris) had to overcome one horrific event after another in the face of overwhelming odds.
The story of APOLLO 13 is so miraculous that perhaps no movie can do it justice, although Howard and his crew look like they gave it their best shot. They even went through the trouble of building sets and shooting scenes in NASA's KC-135, an aircraft that flies in a parabolic trajectory to create weightlessness for up to 25 seconds. The lunar and command module sets as well as the mission control room created by Michael Corenblith look like the real things and Dean Cundey's cinematography combined with Howard's direction gives the audience a real sense of being trapped inside with the astronauts.
Hanks plays his part with a lot of enthusiasm and we like his character because of his persona; we want to see him live. However, Hanks, like his co-stars Paxton and Bacon, never seems convincing as an astronaut. People in the military, especially pilots have a particular bearing that none of these capable actors seemed to have hit upon. Only Gary Sinise, who plays Ken Mattingly, the mission pilot who was supposed to go with Lovell and Haise but was replaced at the last minute because of a possible case of the measles, is able to find that particular presence.
Ed Harris does a fine job portraying Gene Kranz but seeing him begs a comparison to the THE RIGHT STUFF, (Ed Harris played John Glenn perfectly) a film that is everything APOLLO 13 wants to be and a whole lot more. Kathleen Quinlan overacts in her role as Marilyn Lovell. Her character is a person you heart has to go out to but it doesn't help when screenwriters William Broyles, Jr. and Al Reinert give her lines such as when she says in a quivering voice, "you can discuss that with my husband when he comes back on Friday."
Other problems with the film include Digital Domain's computer generated shots of the spaceship zooming through space like it was something out of STAR WARS and James Horner's music, where he once again cannibalizes parts of his old scores almost verbatim and tries to pass it off as something new.
While it may not have been all that it could of, APOLLO 13 still manages to gives us some of the wonder of one of mankind's greatest achievements. Howard and Hanks felt strongly about the story they were telling and that passion is what saves APOLLO 13 from near disaster.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Not Connected
This app charts accelerometer data from the Texas Instruments SensorTag CC2650. Note that you must run this app in the Evothings Client app, or build a Cordova app with the plugin com.evothings.ble. A device with support for Bluetooth 4.0 and Android 4.3+ or iOS 7+ is required.
Activate the SensorTag and tap the Connect button. If everything works the tag is discovered and accelerometer data is plotted to the canvas. Shake your SensorTag to see the plot change.
On Android, there are sometimes problems with that BLE stops working when switching between apps or doing multiple reloads. In this case restart the Evothings Client app. Additionally, you can use the Evothings Workbench Tools to see any error messages that may help in your investigation.


[gecode-users] problem using IntVarArgs
Kish Shen
kisshen at cisco.com
Thu Jun 11 17:59:25 CEST 2009
Hi,
I am running into a seg fault with posting simple constraints with a
IntVarArgs. I am using GeCode 3.0.2.
What I want to do is to set a variable in IntVarArgs to a value. I tird
the following two ways:
dom(*solver, alldiff[i], i)
and
rel(*solver, alldiff[i], IRT_EQ, i)
where alldiff is a IntVarArgs
Both seem to cause a seg fault.
I haven't used Gecode much, so I assume I am making some basic mistake
-- can someone please let me know what I am doing wrong?
[For the context of what I am doing, I am trying to implement the
distinct constraint, which takes a IntVarArgs. However, some of these
variables may already be set to an integer value -- this is what I am
trying to do here -- the distinct constraint have not been posted at
this point]
Thanks in advance for any help!
Kish
--
This e-mail may contain confidential and privileged material for the
sole use of the intended recipient. Any review, use, distribution or
disclosure by others is strictly prohibited. If you are not the intended
recipient (or authorized to receive for the recipient), please contact
the sender by reply e-mail and delete all copies of this message.
Cisco Systems Limited (Company Number: 02558939), is registered in
England and Wales with its registered office at 1 Callaghan Square,
Cardiff, South Glamorgan CF10 5BT.
More information about the gecode-users
mailing list


{PHOTO_TITLE}
{PHOTO_DATE}
{PHOTO_DESCRIPTION}
Album:
{ALBUM_TITLE}
View on Flickr
Location
Coordinates:
{PHOTO_LOCATION}
Admin
Admin Home
Add Photo
Edit Photo
arrow_back
arrow_forward
Photo ID:
{PHOTO_ID}
PhotoWall ID:
{PHOTOWALL_ID}
Flickr ID:
{FLICKR_ID}
Location:
{PHOTO_LOCATION}
Is Wallpaper
Is Highlight
Is Photoframe
Update
Re-fetch info from Flickr
Regenerate Thumbnail
Reimport from Flickr
Delete resized
Type: DELETE to enable button
DELETE
Meta Files
{META_FILE_NAME}
Add to Wall [{NEXT_PHOTOWALL_ID}]
arrow_downward
More Info about this Photo


Murder charge after toddlers found dead in car
A woman has been charged with murder over the death of two toddlers who were allegedly left for hours in a car at Logan, south of Brisbane.
Paramedics were called to a home at Waterford West in Logan about 1.35pm on Saturday (local time) but were unable to revive the girls, aged one and two.
Police say it appeared the sisters had died of exposure to extreme heat and they were attempting to establish how long they had been in a black station wagon parked in the front of the property.
A 27-year-old Waterford West woman known to the girls was charged late on Saturday with two counts of murder, police said. She will appear at Brisbane Magistrates Court on Monday.
The Courier-Mail reports the woman is the children's mother.
"The two children exhibited signs of being exposed to extreme heat and that is forming the direction of our investigation," Detective Inspector Mark White said on Saturday.
"We are speaking the parents of those children. It's a very tragic incident which has occurred."
Police said they were offering support to officers who attended the scene which was described as "tragic".
"We are putting a lot of emphasis on supporting our people," Detective Inspector White said.
"One of our priorities in addition to conducting the investigation is the wellbeing of our staff and our other emergency service colleagues."


|
|
def | __init__ |
| |
|
def | status |
| |
|
def | set_status |
| |
|
def | clear_status |
| |
|
def | has_status |
| |
|
def | description |
| |
|
def | set_description |
| |
|
def | clear_description |
| |
|
def | has_description |
| |
|
def | MergeFrom |
| |
|
def | Equals |
| |
|
def | IsInitialized |
| |
|
def | ByteSize |
| |
|
def | ByteSizePartial |
| |
|
def | Clear |
| |
|
def | OutputUnchecked |
| |
|
def | OutputPartial |
| |
|
def | TryMerge |
| |
|
def | __str__ |
| |
|
|
| has_status_ |
| |
|
| status_ |
| |
|
| has_description_ |
| |
|
| description_ |
| |
|
|
int | has_status_ = 0 |
| |
|
int | status_ = 0 |
| |
|
int | has_description_ = 0 |
| |
|
string | description_ = "" |
| |
|
int | kstatus = 1 |
| |
|
int | kdescription = 2 |
| |
The documentation for this class was generated from the following file:
- code/googleappengine-read-only/python/google/appengine/api/files/file_service_pb.py


A page with anchor fragment targets.
What's this? A reference fragment?
And another!
Last one, I promise.


{% extends "./base.html" %} {% comment %} Software developed by Pieter W.G. Bots for the PrESTO project Code repository: https://github.com/pwgbots/presto Project wiki: http://presto.tudelft.nl/wiki Copyright (c) 2022 Delft University of Technology Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.  IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. {% endcomment %} {% block user_role %}
{% endblock user_role %} {% block user_menu %}{% endblock user_menu %} {% block page_content %} {% if pin %}Your participant indentification number (PIN) is: {{ pin }}
Please write this down somewhere, as you will need it to sign on again!
OK, I got it!Please enter your participant identification number.
To participate in a demonstration relay, please enter a valid five-character demonstration code below, and your name (or alias).


Judge orders Union Pacific to rehire engineer who defecated on train
by Louis CasianoA federal judge has ordered Union Pacific to reinstate an engineer who defecated on the exterior of a train car, according to media reports.
The ruling by U.S. District Court Judge Brian Buescher upholds an arbitration board's decision that Matthew Lebsack should be rehired following the 2016 incident, the Lincoln Journal Star reported.
The Omaha-based railroad giant did not indicate whether it would appeal the ruling.
A TRAIN TICKET THAT TAKES A CENTURY AND A HALF TO GET
"Union Pacific is reviewing the court’s decision and in the process of determining our next steps," the company said in a statement. "The behavior in question does not align with our values and should not be tolerated."
Lebsack admitted to defecating on a portion of the train connecting a locomotive and boxcar during a Nov. 20, 2016 stop. He also admitted to throwing soiled tissues out a window and raising his middle finger at a security camera abord the train.
The lawsuit also said he told his manager he left a "present" for his co-workers. The lawsuit didn't specify where the incident occurred.
Lebsack later blamed the incident on physical and mental issues. The company terminated him, citing a rule prohibiting conduct that is "negligent, insubordinate, dishonest, immoral, quarrelsome or discourteous."
In December, the arbitration board ruled the termination was excessive and said the railroad giant should require Lebsack to undergo a medical and psychological evaluation with the option to discipline him if he's found to not be fit for duty, according to the newspaper.
Union Pacific filed a lawsuit defending its right to fire him.
CLICK HERE TO GET THE FOX NEWS APP
Buescher actually disagreed with the board, according to the newspaper, but said he wasn't allowed to consider the merits of the decision.
He said Union Pacific failed to prove the arbitration decision was not within the board's discretion.


Open your console with the webaudio graph extension and check if the graph react correctly
Merge
Split
Muteleft
UnMuteleft
MuteRigth
UnMuteRigth


A valid MPI implementation guarantees certain general properties of point-to-point communication, which are described in this section.
Order Messages are non-overtaking: If a sender sends two messages in succession to the same destination, and both match the same receive, then this operation cannot receive the second message if the first one is still pending. If a receiver posts two receives in succession, and both match the same message, then the second receive operation cannot be satisfied by this message, if the first one is still pending. This requirement facilitates matching of sends to receives. It guarantees that message-passing code is deterministic, if processes are single-threaded and the wildcard MPI_ANY_SOURCE is not used in receives. (Some of the calls described later, such as MPI_CANCEL or MPI_WAITANY, are additional sources of nondeterminism.)
If a process has a single thread of execution, then any two communications executed by this process are ordered. On the other hand, if the process is multi-threaded, then the semantics of thread execution may not define a relative order between two send operations executed by two distinct threads. The operations are logically concurrent, even if one physically precedes the other. In such a case, the two messages sent can be received in any order. Similarly, if two receive operations that are logically concurrent receive two successively sent messages, then the two messages can match the two receives in either order.
Example
An example of non-overtaking messages.
CALL MPI_COMM_RANK(comm, rank, ierr) IF (rank.EQ.0) THEN CALL MPI_BSEND(buf1, count, MPI_REAL, 1, tag, comm, ierr) CALL MPI_BSEND(buf2, count, MPI_REAL, 1, tag, comm, ierr) ELSE IF (rank.EQ.1) THEN CALL MPI_RECV(buf1, count, MPI_REAL, 0, MPI_ANY_TAG, comm, status, ierr) CALL MPI_RECV(buf2, count, MPI_REAL, 0, tag, comm, status, ierr) END IFThe message sent by the first send must be received by the first receive, and the message sent by the second send must be received by the second receive.
Progress If a pair of matching send and receives have been initiated on two processes, then at least one of these two operations will complete, independently of other actions in the system: the send operation will complete, unless the receive is satisfied by another message, and completes; the receive operation will complete, unless the message sent is consumed by another matching receive that was posted at the same destination process.
Example
An example of two, intertwined matching pairs.
CALL MPI_COMM_RANK(comm, rank, ierr) IF (rank.EQ.0) THEN CALL MPI_BSEND(buf1, count, MPI_REAL, 1, tag1, comm, ierr) CALL MPI_SSEND(buf2, count, MPI_REAL, 1, tag2, comm, ierr) ELSE IF (rank.EQ.1) THEN CALL MPI_RECV(buf1, count, MPI_REAL, 0, tag2, comm, status, ierr) CALL MPI_RECV(buf2, count, MPI_REAL, 0, tag1, comm, status, ierr) END IFBoth processes invoke their first communication call. Since the first send of process zero uses the buffered mode, it must complete, irrespective of the state of process one. Since no matching receive is posted, the message will be copied into buffer space. (If insufficient buffer space is available, then the program will fail.) The second send is then invoked. At that point, a matching pair of send and receive operation is enabled, and both operations must complete. Process one next invokes its second receive call, which will be satisfied by the buffered message. Note that process one received the messages in the reverse order they were sent.
Fairness MPI makes no guarantee of fairness in the handling of communication. Suppose that a send is posted. Then it is possible that the destination process repeatedly posts a receive that matches this send, yet the message is never received, because it is each time overtaken by another message, sent from another source. Similarly, suppose that a receive was posted by a multi-threaded process. Then it is possible that messages that match this receive are repeatedly received, yet the receive is never satisfied, because it is overtaken by other receives posted at this node (by other executing threads). It is the programmer's responsibility to prevent starvation in such situations.
Resource limitations Any pending communication operation consumes system resources that are limited. Errors may occur when lack of resources prevent the execution of an MPI call. A quality implementation will use a (small) fixed amount of resources for each pending send in the ready or synchronous mode and for each pending receive. However, buffer space may be consumed to store messages sent in standard mode, and must be consumed to store messages sent in buffered mode, when no matching receive is available. The amount of space available for buffering will be much smaller than program data memory on many systems. Then, it will be easy to write programs that overrun available buffer space.
MPI allows the user to provide buffer memory for messages sent in the buffered mode. Furthermore, MPI specifies a detailed operational model for the use of this buffer. An MPI implementation is required to do no worse than implied by this model. This allows users to avoid buffer overflows when they use buffered sends. Buffer allocation and use is described in Section Buffer Allocation and Usage .
A buffered send operation that cannot complete because of a lack of buffer space is erroneous. When such a situation is detected, an error is signalled that may cause the program to terminate abnormally. On the other hand, a standard send operation that cannot complete because of lack of buffer space will merely block, waiting for buffer space to become available or for a matching receive to be posted. This behavior is preferable in many situations. Consider a situation where a producer repeatedly produces new values and sends them to a consumer. Assume that the producer produces new values faster than the consumer can consume them. If buffered sends are used, then a buffer overflow will result. Additional synchronization has to be added to the program so as to prevent this from occurring. If standard sends are used, then the producer will be automatically throttled, as its send operations will block when buffer space is unavailable.
In some situations, a lack of buffer space leads to deadlock situations. This is illustrated by the examples below.
Example
An exchange of messages.
CALL MPI_COMM_RANK(comm, rank, ierr) IF (rank.EQ.0) THEN CALL MPI_SEND(sendbuf, count, MPI_REAL, 1, tag, comm, ierr) CALL MPI_RECV(recvbuf, count, MPI_REAL, 1, tag, comm, status, ierr) ELSE IF (rank.EQ.1) THEN CALL MPI_RECV(recvbuf, count, MPI_REAL, 0, tag, comm, status, ierr) CALL MPI_SEND(sendbuf, count, MPI_REAL, 0, tag, comm, ierr) END IFThis program will succeed even if no buffer space for data is available. The standard send operation can be replaced, in this example, with a synchronous send.
Example
An
errant
attempt to exchange messages.
CALL MPI_COMM_RANK(comm, rank, ierr) IF (rank.EQ.0) THEN CALL MPI_RECV(recvbuf, count, MPI_REAL, 1, tag, comm, status, ierr) CALL MPI_SEND(sendbuf, count, MPI_REAL, 1, tag, comm, ierr) ELSE IF (rank.EQ.1) THEN CALL MPI_RECV(recvbuf, count, MPI_REAL, 0, tag, comm, status, ierr) CALL MPI_SEND(sendbuf, count, MPI_REAL, 0, tag, comm, ierr) END IFThe receive operation of the first process must complete before its send, and can complete only if the matching send of the second processor is executed. The receive operation of the second process must complete before its send and can complete only if the matching send of the first process is executed. This program will always deadlock. The same holds for any other send mode.
Example
An exchange that relies on buffering.
CALL MPI_COMM_RANK(comm, rank, ierr) IF (rank.EQ.0) THEN CALL MPI_SEND(sendbuf, count, MPI_REAL, 1, tag, comm, ierr) CALL MPI_RECV(recvbuf, count, MPI_REAL, 1, tag, comm, status, ierr) ELSE IF (rank.EQ.1) THEN CALL MPI_SEND(sendbuf, count, MPI_REAL, 0, tag, comm, ierr) CALL MPI_RECV(recvbuf, count, MPI_REAL, 0, tag, comm, status, ierr) END IFThe message sent by each process has to be copied out before the send operation returns and the receive operation starts. For the program to complete, it is necessary that at least one of the two messages sent be buffered. Thus, this program can succeed only if the communication system can buffer at least count words of data.
Advice to users.
When standard send operations are used, then a deadlock situation may occur where both processes are blocked because buffer space is not available. The same will certainly happen, if the synchronous mode is used. If the buffered mode is used, and not enough buffer space is available, then the program will not complete either. However, rather than a deadlock situation, we shall have a buffer overflow error.
A program is ``safe'' if no message buffering is required for the program to complete. One can replace all sends in such program with synchronous sends, and the program will still run correctly. This conservative programming style provides the best portability, since program completion does not depend on the amount of buffer space available or on the communication protocol used.
Many programmers prefer to have more leeway and opt to use the ``unsafe'' programming style shown in example Semantics of Point-to-Point Communication . In such cases, the use of standard sends is likely to provide the best compromise between performance and robustness: quality implementations will provide sufficient buffering so that ``common practice'' programs will not deadlock. The buffered send mode can be used for programs that require more buffering, or in situations where the programmer wants more control. This mode might also be used for debugging purposes, as buffer overflow conditions are easier to diagnose than deadlock conditions.
Nonblocking message-passing operations, as described in
Section Nonblocking Communication
, can be used to avoid the need for buffering
outgoing messages. This prevents deadlocks due to lack of buffer space, and
improves performance, by allowing overlap of computation and communication,
and avoiding the overheads of allocating buffers and copying messages into
buffers.
( End of advice to users.)


---
layout: default
title: Page Not Found
permalink: /404.html
overview: true
---
PARDON ME.
The page you are looking for may not exist, or we may be experiencing an error. We're terribly sorry, but please visit our homepage at
wildark.photo to see what's new.
This endangered Bioko drill was photographed by National Geographic Photographer Joel Sartore on Bioko Island, Equatorial Guinea, in his ambitious project to document every species in captivity—inspiring people not just to care, but also to help protect these animals for future generations. Before drills disappear, like this webpage has, learn how you can help at nationalgeographic.org/projects/photo-ark/.
PHOTO BY Joel Sartore, National Geographic Photo Ark


The Hardest Problem Ever
问题描述 :
Julius Caesar lived in a time of danger and intrigue. The hardest situation Caesar ever faced was keeping himself alive. In order for him to survive, he decided to create one of the first ciphers. This cipher was so incredibly sound, that no one could figure it out without knowing how it worked.
 It is your job to decipher the messages sent by Caesar and provide to your general. The code is simple. For each letter in a plaintext message, you shift it five places to the right to create the secure message (i.e., if the letter is ‘A’, the cipher text would be ‘F’).  It is your job to decipher the messages sent by Caesar and provide to your general. The code is simple. For each letter in a plaintext message, you shift it five places to the right to create the secure message (i.e., if the letter is ‘A’, the cipher text would be ‘F’).  Any non-alphabetical character should remain the same, and all alphabetical characters will be upper case.
输入:
Input to this problem will consist of a (non-empty) series of up to 100 data sets. Each data set will be formatted according to the following description, and there will be no blank lines separating data sets. All characters will be uppercase.
A single data set has 3 components:
Start line – A single line, "START"
Cipher message – A single line containing from one to two hundred characters, inclusive, comprising a single message from Caesar
End line – A single line, "END"
Following the final data set will be a single line, "ENDOFINPUT".
输出:
For each data set, there will be exactly one line of output. This is the original message by Caesar.
样例输入:
START NS BFW, JAJSYX TK NRUTWYFSHJ FWJ YMJ WJXZQY TK YWNANFQ HFZXJX END START N BTZQI WFYMJW GJ KNWXY NS F QNYYQJ NGJWNFS ANQQFLJ YMFS XJHTSI NS WTRJ END START IFSLJW PSTBX KZQQ BJQQ YMFY HFJXFW NX RTWJ IFSLJWTZX YMFS MJ END ENDOFINPUT
样例输出:
IN WAR, EVENTS OF IMPORTANCE ARE THE RESULT OF TRIVIAL CAUSES I WOULD RATHER BE FIRST IN A LITTLE IBERIAN VILLAGE THAN SECOND IN ROME DANGER KNOWS FULL WELL THAT CAESAR IS MORE DANGEROUS THAN HE
#include <iostream> #include <algorithm> #include <map> using namespace std; struct strCmp { bool operator()(const char s1 ,const char s2) const { return s1 < s2; } }; int main() { // freopen("in.txt","r",stdin); string start; string end; string mess; map< char , char> rule; rule['A'] = 'V'; rule['B'] = 'W'; rule['C'] = 'X'; rule['D'] = 'Y'; rule['E'] = 'Z'; rule['F'] = 'A'; rule['G'] = 'B'; rule['H'] = 'C'; rule['I'] = 'D'; rule['J'] = 'E'; rule['K'] = 'F'; rule['L'] = 'G'; rule['M'] = 'H'; rule['N'] = 'I'; rule['O'] = 'J'; rule['P'] = 'K'; rule['Q'] = 'L'; rule['R'] = 'M'; rule['S'] = 'N'; rule['T'] = 'O'; rule['U'] = 'P'; rule['V'] = 'Q'; rule['W'] = 'R'; rule['X'] = 'S'; rule['Y'] = 'T'; rule['Z'] = 'U'; while(cin >> start) { if(start == "ENDOFINPUT" ) break; while(1) { getline(cin,mess); if(mess.length() != 0) break; } for(int i=0 ;i<mess.length() ;i++) if(mess[i] >= 'A' && mess[i] <= 'Z') cout << rule[mess[i]]; else cout << mess[i]; cout << endl; cin >> end; } }
(adsbygoogle = window.adsbygoogle || []).push({});
#include <cstdio>
#include <cstring>
const int MAXSIZE=256;
//char store[MAXSIZE];
char str1[MAXSIZE];
/*
void init(char *store) {
int i;
store['A']=’V', store['B']=’W',store['C']=’X',store['D']=’Y',store['E']=’Z';
for(i=’F';i<=’Z';++i) store =i-5;
}
*/
int main() {
//freopen("input.txt","r",stdin);
//init(store);
char *p;
while(fgets(str1,MAXSIZE,stdin) && strcmp(str1,"STARTn")==0) {
if(p=fgets(str1,MAXSIZE,stdin)) {
for(;*p;++p) {
//*p=store[*p]
if(*p<’A’ || *p>’Z') continue;
if(*p>’E') *p=*p-5;
else *p=*p+21;
}
printf("%s",str1);
}
fgets(str1,MAXSIZE,stdin);
}
return 0;
}
map[nodes .index][nodes .index] == 0 就是判断不相邻的。这个是可以证明的。
很好的思路，可以借鉴
#!/usr/bin/env python def cou(n): arr = [1]
这张页面太松散拉，重新编辑一下，弄紧凑一点。
#!/usr/bin/env python def cou(n): arr = [1]
感觉我好像很多都不会做。。。。
This write-up presents the gentle in which we can notice the fact. this is extremely wonderful one and gives in depth info.
这个还不错
第一题还是比较考验智商~
great!
居然看懂了
不考虑最后将结果排序的话，快排的时间复杂度是O(N) ，而堆排的是O(N*logK),这样比较看，快排快
多谢支持！


Post selected text
Status
Posting the selected text.
Receieved the response shown below.
Please set the URL in the extension options.
An error occurred:
Selected text
Server response


Download file when clicking on the link (instead of navigating to the file):
The download
attribute specifies that the target will be downloaded when a user clicks on the hyperlink.
This attribute is only used if the href
attribute is set.
filename
: Optional. Specifies the new filename for the downloaded file


Maharashtra Government formation: Manohar Lal Khattar congratulates Devendra Fadnavis and Ajit Pawar for taking oath
Khattar congratulated Fadnavis on taking oath as the Maharashtra chief minister for the second term. He also congratulated Nationalist Congress Party's (NCP) Ajit Pawar for being sworn-in as the deputy chief minister of the state.
by PTIHaryana Chief Minister Manohar Lal Khattar congratulated Devendra Fadnavis and Ajit Pawar for taking oath as the chief minister and deputy chief minister of Maharashtra respectively on November 23 and said the state will touch new heights of development under their leadership.
Khattar congratulated Fadnavis on taking oath as the Maharashtra chief minister for the second term. He also congratulated Nationalist Congress Party's (NCP) Ajit Pawar for being sworn-in as the deputy chief minister of the state.
"I firmly believe that under your leadership Maharashtra will touch new heights of development," he said in a tweet.
The month-long political impasse in Maharashtra ended dramatically with Fadnavis returning as the chief minister again, backed by the Sharad Pawar-led NCP.


This command-line application allows you to view, add, update, and delete, from a database that stores Employee data.
RepoThis project is a simple betting site. The site has several roles: users: all users start with 100 amount of tokens, must provide discord authentication. betters: can add bets and join bets. witness: has the ability to oversee and determine the result of the match. Paid tokens worth 10% of the winning pool. It also has a Slot Machine game that allows you to generate more tokens.
Site Repo


Spencer's NFL Roster
Choose Favorite Team
Arizona Cardinals
Atlanta Falcons
Baltimore Ravens
Buffalo Bills
Menu
Arizona Cardinals
Atlanta Falcons
Baltimore Ravens
Buffalo Bills
Player Name
Player Position
Player Number
Reggie Bush
WR
94
Remove
Name:
Position:
Number:
Add Custom Player
Player Name:
Player Position:
Player Number:
Add Player
Add Current NFL Player
Player Name:
Player Position
Player Number
Add Player
Choose Team To Add Player From
Action
Another action
Something else here
Separated link


spatial distribution stock stocks hake fishing area predictor Atlantic pressure used cod flounder temperature data yellowtail spring {border-style changes fish relative Northwest analysis px;} survey #ffffff;} Sea important Fish importance mean climate depth study Southern Supporting groundfish occupancy silver southern Sci. Table fall indices series shift Fig Northeast northern population red shifts Biomass GOM Nye analyses assessment indicators inertia marine variables North Relative SNEMA Science cod, gravity model ranked stratified Bank Mar NEFSC effect review trawl Aquat Fisheries Georges Northern Sciences United Writing biomass hake, index objective px; species spring, strata time {font-family Center Conceptualization Gulf New Silver States change consistent editing effects exhibited font-size location movement previous seasons. shifted trends Atlantic. Bez England-Mid ICES Maine Spatial Stock Time additional associated catch center considered double; east-west fall, fall. given majority number range shown terms ./f- Akaike Analysis Fishing Gadus Information). Red Temperature Yellowtail abundance addition based border-color border-width calculated contrast, differences distribution, eastward estimates future indicator inertia. latitude longitude management mortality northeastward northward present previously relationships reported results shelf significant solid; spatiotemporal units using work years {font-style {font-weight (i.e., ./journal.pone..t Available Bering Click Data Doc Earth Ecol Hare Information. LINK Rivoirard Sci Similarly, Spring Thorson Unit Urophycis YCG analysis: bold boundaries cases climate, component continental courier; course deeper dispersion em; established file. information known linear minimum modeled omitted package particular positive pressure, provided pt;} referenced role selection shows size, spring. studies studies. tow update warming weighted weights white year