Sub-Document Operations
Sub-document operations can be used to efficiently access parts of documents. Sub-document operations may be quicker and more network-efficient than full-document operations such as upsert, update and get because they only transmit the accessed sections of the document over the network. Sub-document operations are also atomic, allowing safe modifications to documents with built-in concurrency control.
Sub-documents
Starting with Couchbase Server 4.5 you can atomically and efficiently update and retrieve parts of a document. These parts are called sub-documents. While full-document retrievals retrieve the entire document and full document updates require sending the entire document, sub-document retrievals only retrieve relevant parts of a document and sub-document updates only require sending the updated portions of a document. You should use sub-document operations when you are modifying only portions of a document, and full-document operations when the contents of a document is to change significantly.
| The sub-document operations described on this page are for Key-Value requests only: they are not related to sub-document N1QL queries. (Sub-document N1QL queries are explained in the section Querying with N1QL.) |
In order to use sub-document operations you need to specify a path indicating the location of the sub-document. The path follows N1QL syntax (see below, and server:n1ql:n1ql-intro/queriesandresults.adoc). Considering the document:
{
"name": "Douglas Reynholm",
"email"<EMAIL_ADDRESS>"addresses": {
"billing": {
"line1": "123 Any Street",
"line2": "Anytown",
"country": "United Kingdom"
},
"delivery": {
"line1": "123 Any Street",
"line2": "Anytown",
"country": "United Kingdom"
}
},
"purchases": {
"complete": [
339, 976, 442, 666
],
"abandoned": [
157, 42, 999
]
}
}
The paths name
, addresses.billing.country
and purchases.complete[0]
are all valid paths.
Retrieving
The lookup-in operations queries the document for a certain path(s) and returns that/those path(s). You have a choice of actually retrieving the document path using the subdoc-get sub-document operation, or simply querying the existence of the path using the subdoc-exists sub-document operation. The latter saves even more bandwidth by not retrieving the contents of the path if it is not needed.
frag, err := bucket.LookupIn("customer123").Get("addresses.delivery.country").Execute()
var country string
err = frag.Content("addresses.delivery.country", &country)
fmt.Print(country)
// United Kingdom
frag, err := bucket.LookupIn("customer123").Exists("purchases.pending[-1]").Execute()
exists := frag.Exists("purchases.pending[-1]")
fmt.Print(exists)
// false
Multiple operations can be combined as well:
frag, err := bucket.LookupIn("customer123").Get("addresses.delivery.country").Exists("purchases.pending[-1]").Execute()
var country string
err = frag.Content("addresses.delivery.country", &country)
exists := frag.Exists("purchases.pending[-1]")
fmt.Printf("Country: %s, Exists: %t", country, exists)
// Country: United Kingdom, Exists: false
Mutating
Mutation operations modify one or more paths in the document.
The simplest of these operations is subdoc-upsert, which, just like the fulldoc-level upsert, this will either modify the value of an existing path or create it if it does not exist. As well as the document key MutateIn
takes a CAS value and an expiry. The Upsert
operation can, optionally, also create the parent elements of a path, this is done using the third parameter:
bucket.MutateIn("customer123", 0, 0).Upsert("fax", "311-555-0151", true).Execute()
Likewise, the subdoc-insert operation will only add the new value to the path if it does not exist:
frag, err := bucket.MutateIn("customer123", 0, 0).Insert("purchases.complete", []interface{}{42, true, nil}, false).Execute()
fmt.Print(err)
// subdocument mutation 0 failed (given path already exists in the document)
Dictionary values can also be replaced or removed, and you may combine any number of mutation operations within the same general mutate-in API. Here’s an example of one which replaces one path and removes another.
bucket.MutateIn("customer123", 0, 0).Remove("addresses.billing").Replace("email", "dougr96@hotmail.com").Execute()
Array append and prepend
The subdoc-array-prepend and subdoc-array-append operations are true array prepend and append operations. Unlike fulldoc append/prepend operations (which simply concatenate bytes to the existing value), subdoc-array-append and subdoc-array-prepend are JSON-aware:
bucket.MutateIn("customer123", 0, 0).ArrayAppend("purchases.complete", 777, false).Execute()
// purchases.complete is now [339, 976, 442, 666, 777]
bucket.MutateIn("customer123", 0, 0).ArrayPrepend("purchases.abandoned", 18, false).Execute()
// purchases.abandoned is now [18, 157, 49, 999]
If your document only needs to contain an array, you do not have to create a top-level object wrapper to contain it. Simply initialize the document with an empty array and then use the empty path for subsequent sub-document array operations:
bucket.Upsert("my_array", []interface{}{}, 0)
bucket.MutateIn("my_array", 0, 0).ArrayAppend("", "some_element", false).Execute()
// the document my_array is now ["some element"]
If you wish to add multiple values to an array, you may do so by passing multiple values to the array-append-multi, array-prepend-multi, or array-insert-multi operations:
bucket.MutateIn("my_array", 0, 0).
ArrayAppendMulti("", []string{"elem1", "elem2", "elem3"}, false).
Execute()
// the document my_array is now ["some_element", "elem1", "elem2", "elem3"]
bucket.MutateIn("my_array", 0, 0).
ArrayAppendMulti("", []interface{}{[]string{"elem1", "elem2", "elem3"}}, false).
Execute()
// the document my_array is now ["some_element", ["elem1", "elem2", "elem3"]]
Note that passing multiple values to a single array-append-multi operation results in greater performance increase and bandwidth savings than simply specifying a single array-append for each element.
bucket.MutateIn("my_array", 0, 0).
ArrayAppend("", "elem1", false).
ArrayAppend("", "elem2", false).
ArrayAppend("", "elem3", false).
Execute()
If you wish to create an array if it does not exist and also push elements to it within the same operation you may use the createParents parameter:
bucket.MutateIn("some_doc", 0, 0).
ArrayAppendMulti("some.array", []string{"Hello", "World"}, true).
Execute()
Arrays as unique sets
Limited support also exists for treating arrays like unique sets, using the array-add-unique command. This will do a check to determine if the given value exists or not before actually adding the item to the array:
_, err = bucket.MutateIn("customer123", 0, 0).
ArrayAddUnique("purchases.complete", 95, false).
Execute()
// err -> nil
_, err = bucket.MutateIn("customer123", 0, 0).
ArrayAddUnique("purchases.abandoned", 42, false).
Execute()
// err -> subdocument mutation 0 failed (given path already exists in the document)
Note that currently the array-add-unique will fail with a Path Mismatch error if the array contains JSON floats, objects, or arrays. The array-add-unique operation will also fail with Cannot Insert if the value to be added is one of those types as well.
Note that the actual position of the new element is undefined, and that the array is not ordered.
Array insertion
New elements can also be inserted into an array.
While append will place a new item at the end of an array and prepend will place it at the beginning, insert allows an element to be inserted at a specific position.
The position is indicated by the last path component, which should be an array index.
For example, to insert "cruel"
as the second element in the array ["Hello", "world"]
, the code would look like:
bucket.MutateIn("array", 0, 0).ArrayInsert("[1]", "cruel").Execute()
Note that the array must already exist and that the index must be valid (i.e. it must not point to an element which is out of bounds).
Counters and numeric fields
Counter operations allow the manipulation of a numeric value inside a document. These operations are logically similar to the counter operation on an entire document:
bucket.MutateIn("customer123", 0, 0).Counter("logins", 1, false).Execute()
// => 1
The subdoc-counter operation peforms simple arithmetic against a numeric value, either incrementing or decrementing the existing value.
bucket.Upsert("player432", struct {
Gold int `json:"gold"`
}{
Gold: 1000,
}, 0)
frag, _ := bucket.MutateIn("player432", 0, 0).
Counter("gold", -150, false).
Execute()
var gold int
frag.Content("gold", &gold)
fmt.Printf("player432 now has %d gold remaining", gold)
// => player432 now has 850 gold remaining
The existing value for subdoc-counter operations must be within range of a 64 bit signed integer. If the value does not exist, the subdoc-counter operation will create it (and its parents, if create-parents is enabled).
Note that there are several differences between subdoc-counter and the full-document counter operations:
-
Sub-document counters have a range of -9223372036854775807 to<PHONE_NUMBER>854775807 (i.e.
INT64_MIN
andINT64_MAX
), whereas full-document counters have a range of 0 to<PHONE_NUMBER>3709551615 (UINT64_MAX
) -
Sub-document counter operations protect against overflow and underflow, returning an error if the operation would exceed the range. Full-document counters will use normal C semantics for overflow (in which the overflow value is carried over above 0), and will silently fail on underflow, setting the value to 0 instead.
-
Sub-document counter operations can operate on any numeric value within a document, while full-document counter operations require a specially formatted counter document with only the counter value.
Executing multiple operations
Multiple sub-document operations can be executed at once on the same document, allowing you to retrieve or modify several sub-documents at once. When multiple operations are submitted within the context of a single lookup-in or mutate-in command, the server will execute all the operations with the same version of the document.
| Unlike batched operations which is simply a way of sending multiple individual operations efficiently on the network, multiple subdoc operations are formed into a single command packet, which is then executed atomically on the server. You can submit up to 16 operations at a time. |
When submitting multiple mutation operations within a single mutate-in command, those operations are considered to be part of a single transaction: if any of the mutation operations fail, the server will logically roll-back any other mutation operations performed within the mutate-in, even if those commands would have been successful had another command not failed.
When submitting multiple retrieval operations within a single lookup-in command, the status of each command does not affect any other command. This means that it is possible for some retrieval operations to succeed and some others to fail. While their statuses are independent of each other, you should note that operations submitted within a single lookup-in are all executed against the same version of the document.
Creating parents
Sub-document mutation operations such as subdoc-upsert or subdoc-insert will fail if the immediate parent is not present in the document. Consider:
{
"level_0": {
"level_1": {
"level_2": {
"level_3": {
"some_field": "some_value"
}
}
}
}
}
Looking at the some_field
field (which is really level_0.level_1.level_2.level_3.some_field
), its immediate parent is level_3
.
If we were to attempt to insert another field, level_0.level_1.level_2.level_3.another_field
, it would succeed because the immediate parent is present.
However if we were to attempt to subdoc-insert to level_1.level_2.foo.bar
it would fail, because level_1.level_2.foo
(which would be the immediate parent) does not exist.
Attempting to perform such an operation would result in a Path Not Found error.
By default the automatic creation of parents is disabled, as a simple typo in application code can result in a rather confusing document structure. Sometimes it is necessary to have the server create the hierarchy however. In this case, the create-parents or create-intermediates option may be used.
bucket.MutateIn("player432", 0, 0).
Upsert("level_0.level_1.foo.bar.phone",
struct {
Num string `json:"num"`
Ext string `json:"ext"`
}{
Num: "311-555-0101",
Ext: "16",
}, true).
Execute()
CAS Semantics
Subdoc mostly eliminates the need for tracking the CAS value. Subdoc operations are atomic and therefore if two different threads access two different sub-documents then no conflict will arise. For example the following two blocks can execute concurrently without any risk of conflict:
bucket.MutateIn("customer123", 0, 0).
ArrayAppend("purchases.complete", 999, false).
Execute()
bucket.MutateIn("customer123", 0, 0).
ArrayAppend("purchases.abandoned", 998, false).
Execute()
Even when modifying the same part of the document, operations will not necessarily conflict. For example, two concurrent subdoc-array-append operations to the same array will both succeed, never overwriting the other.
While CAS is no longer required to ensure document updates are preserved, it may still be needed to ensure document state remains consistent over multiple invocations of mutate-in: Sometimes it’s important to ensure the entire document didn’t change state since the last operation, such as in the case subdoc-remove operations to ensure that the element being removed was not already replaced by something else.
Error handling
Subdoc operations have their own set of errors. When programming with subdoc, be prepared for any of the full-document errors (such as Document Not Found) as well as special sub-document errors which are received when certain constraints are not satisfied. Some of the errors include:
-
Path does not exist: When retrieving a path, this means the path does not exist in the document. When inserting or upserting a path, this means the immediate parent does not exist.
-
Path already exists: In the context of an insert, it means the given path already exists. In the context of array-add-unique, it means the given value already exists.
-
Path mismatch: This means the path may exist in the document, but that there is a type conflict between the path in the document and the path in the command. Consider the document:
{ "tags": ["reno", "nevada", "west", "sierra"] }
The path
tags.sierra
is a mismatch, sincetags
is actually an array, while the path assumes it is a JSON object (dictionary). -
Document not JSON: This means you are attempting to modify a binary document using sub-document operations.
-
Invalid path: This means the path is invalid for the command. Certain commands such as subdoc-array-insert expect array elements as their final component, while others such as subdoc-upsert and subdoc-insert expect dictionary (object) keys.
Because sub-document operations are executed using either mutate-in or replace-in, if a command fails a top-level error is reported (Multi Command Failure), rather than an individual error code (e.g. Path Not Found). When receiving a top-level error code, you should traverse the results of the command to see which individual code failed.
Path syntax
Path syntax largely follows N1QL conventions: A path is divided into components, with each component referencing a specific level in a document hierarchy.
Components are separated by dots (.
) in the case where the element left of the dot is a dictionary, or by brackets ([n]
) where the element left of the bracket is an array and n
is the index within the array.
As a special extension, you can indicate the last element of an array by using an index of -1
, for example to get the last element of the array in the document
{"some":{"array":[1,2,3,4,5,6,7,8,9,0]}}
Use some.array[-1]
as the path, which will return the element 0
.
Each path component must conform as a JSON string, as if it were surrounded by quotes, and any character in the path which may invalidate it as a JSON string must be escaped by a backslash (\
).
In other words, the path component must match exactly the path inside the document itself.
For example:
{"literal\"quote": {"array": []}}
must be referenced as literal\"quote.array
.
If the path also has special path characters (i.e. a dot or brackets) it may be escaped using N1QL escapes. Considering the document
{"literal[]bracket": {"literal.dot": true}}
A path such as `literal[]bracket`.`literal.dot`. You can use double-backticks (``) to reference a literal backtick.
If you need to combine both JSON and path-syntax literals you can do so by escaping the component from any JSON string characters (e.g.
a quote or backslash) and then encapsulating it in backticks (`path`
).
| Currently, paths cannot exceed 1024 characters, and cannot be more than 32 levels deep. |


Functions | |
| int | ADL_Main_ControlX2_Create (ADL_MAIN_MALLOC_CALLBACK callback, int iEnumConnectedAdapters, ADLThreadingModel threadingModel) |
| Function to initialize the ADL interface. This function should be called first. | |
| int | ADL2_Main_ControlX2_Create (ADL_MAIN_MALLOC_CALLBACK callback, int iEnumConnectedAdapters, ADL_CONTEXT_HANDLE *context, ADLThreadingModel threadingModel) |
| Function to initialize the ADL2 interface and issue client's context handle. | |
| int | ADL_Main_Control_Create (ADL_MAIN_MALLOC_CALLBACK callback, int iEnumConnectedAdapters) |
| Function to initialize the ADL interface. This function should be called first. | |
| int | ADL2_Main_Control_Create (ADL_MAIN_MALLOC_CALLBACK callback, int iEnumConnectedAdapters, ADL_CONTEXT_HANDLE *context) |
| Function to initialize the ADL2 interface and to obtain client's context handle. | |
| int | ADL2_Main_Control_Refresh (ADL_CONTEXT_HANDLE context) |
| Function to refresh adapter information. This function generates an adapter index value for all logical adapters that have ever been present in the system. | |
| int | ADL_Main_Control_Refresh () |
| Function to refresh adapter information.  This function should be called last. | |
| int | ADL2_Main_Control_Destroy (ADL_CONTEXT_HANDLE context) |
| Destroy client's ADL context. | |
| void * | ADL2_Main_Control_GetProcAddress (ADL_CONTEXT_HANDLE context, void *lpModule, char *lpProcName) |
| ADL local interface. Function to determine the validity of and retrieve the function pointer (similar to the GetProcAdress API) for a specified function. | |
| void * | ADL_Main_Control_GetProcAddress (void *lpModule, char *lpProcName) |
| ADL local interface. Function to determine the validity of and retrieve the function pointer (similar to the GetProcAdress API) for a specified function. | |
| int | ADL2_Graphics_Versions_Get (ADL_CONTEXT_HANDLE context, ADLVersionsInfo *lpVersionsInfo) |
| Function to retrieve version information. | |
| int | ADL_Graphics_Versions_Get (ADLVersionsInfo *lpVersionsInfo) |
| Function to retrieve version information. | |
| int | ADL2_Graphics_VersionsX2_Get (ADL_CONTEXT_HANDLE context, ADLVersionsInfoX2 *lpVersionsInfo) |
| Function to retrieve s version information. | |
| int | ADL2_Graphics_Platform_Get (ADL_CONTEXT_HANDLE context, int *lpPlatForm) |
| int | ADL_Graphics_Platform_Get (int *lpPlatForm) |
| int ADL_Main_ControlX2_Create | ( | ADL_MAIN_MALLOC_CALLBACK | callback, | |
| int | iEnumConnectedAdapters, | |||
| ADLThreadingModel | threadingModel | |||
| ) |
Function to initialize the ADL interface. This function should be called first.
This function initializes the ADL library. Allows the client to specify desired threading behavior of ADL APIs. It also initializes global pointers and, at the same time, calls the ADL_Main_Control_Refresh function.
| [in] | callback,: | The memory allocation function for memory buffer allocation. This must be provided by the user. This must be provided by the user. ADL internally uses this callback to allocate memory for the output parameters returned to the user and user is responsible to free the memory once used for these parameters. ADL internal takes care of allocating and de allocating the memory for its local variables. |
| [in] | iEnumConnectedAdapters,: | Specify a value of 0 to retrieve adapter information for all adapters that have ever been present in the system. Specify a value of 1 to retrieve adapter information only for adapters that are physically present and enabled in the system. |
| [in] | threadingModel,: | Specify ADL threading behavior. |
| int ADL2_Main_ControlX2_Create | ( | ADL_MAIN_MALLOC_CALLBACK | callback, | |
| int | iEnumConnectedAdapters, | |||
| ADL_CONTEXT_HANDLE * | context, | |||
| ADLThreadingModel | threadingModel | |||
| ) |
Function to initialize the ADL2 interface and issue client's context handle.
Clients can use ADL2 versions of ADL APIs to assure that there is no interference with other ADL clients that are running in the same process. Such clients have to call ADL2_Main_Control_Create first to obtain ADL_CONTEXT_HANDLE instance that has to be passed to each subsequent ADL2 call and finally destroyed using ADL2_Main_Control_Destroy. ADL2_Main_ControlX2_Create allows the client to specify desired threading behavior of ADL APIs.
| [in] | callback,: | The memory allocation function for memory buffer allocation. This must be provided by the user. This must be provided by the user. ADL internally uses this callback to allocate memory for the output parameters returned to the user and user is responsible to free the memory once used for these parameters. ADL internal takes care of allocating and de allocating the memory for its local variables. |
| [in] | iEnumConnectedAdapters,: | Specify a value of 0 to retrieve adapter information for all adapters that have ever been present in the system. Specify a value of 1 to retrieve adapter information only for adapters that are physically present and enabled in the system. |
| [out] | context,: | ADL_CONTEXT_HANDLE instance that has to be passed to each subsequent ADL2 call and finally destroyed using ADL2_Main_Control_Destroy. |
| [in] | threadingModel,: | Specify ADL threading behavior. |
| int ADL_Main_Control_Create | ( | ADL_MAIN_MALLOC_CALLBACK | callback, | |
| int | iEnumConnectedAdapters | |||
| ) |
Function to initialize the ADL interface. This function should be called first.
This function initializes the ADL library. ADL initialized using ADL_Main_Control_Create will not enforce serialization of ADL API executions by multiple threads. Multiple threads will be allowed to enter to ADL at the same time. Note that ADL library is not guaranteed to be thread-safe. Client that calls ADL_Main_Control_Create have to provide its own mechanism for ADL calls serialization. It also initializes global pointers and, at the same time, calls the ADL_Main_Control_Refresh function.
| [in] | callback,: | The memory allocation function for memory buffer allocation. This must be provided by the user. ADL internally uses this callback to allocate memory for the output parameters returned to the user and user is responsible to free the memory once used for these parameters. ADL internal takes care of allocating and de allocating the memory for its local variables. |
| [in] | iEnumConnectedAdapters,: | Specify a value of 0 to retrieve adapter information for all adapters that have ever been present in the system. Specify a value of 1 to retrieve adapter information only for adapters that are physically present and enabled in the system. |
| int ADL2_Main_Control_Create | ( | ADL_MAIN_MALLOC_CALLBACK | callback, | |
| int | iEnumConnectedAdapters, | |||
| ADL_CONTEXT_HANDLE * | context | |||
| ) |
Function to initialize the ADL2 interface and to obtain client's context handle.
Clients can use ADL2 versions of ADL APIs to assure that there is no interference with other ADL clients that are running in the same process. Such clients have to call ADL2_Main_Control_Create first to obtain ADL_CONTEXT_HANDLE instance that has to be passed to each subsequent ADL2 call and finally destroyed using ADL2_Main_Control_Destroy. ADL initialized using ADL2_Main_Control_Create will not enforce serialization of ADL API executions by multiple threads. Multiple threads will be allowed to enter to ADL at the same time. Note that ADL library is not guaranteed to be thread-safe. Client that calls ADL2_Main_Control_Create have to provide its own mechanism for ADL calls serialization.
| [in] | callback,: | The memory allocation function for memory buffer allocation. This must be provided by the user. ADL internally uses this callback to allocate memory for the output parameters returned to the user and user is responsible to free the memory once used for these parameters. ADL internal takes care of allocating and de allocating the memory for its local variables. |
| [in] | iEnumConnectedAdapters,: | Specify a value of 0 to retrieve adapter information for all adapters that have ever been present in the system. Specify a value of 1 to retrieve adapter information only for adapters that are physically present and enabled in the system. |
| [out] | context,: | ADL_CONTEXT_HANDLE instance that has to be passed to each subsequent ADL2 call and finally destroyed using ADL2_Main_Control_Destroy. |
| int ADL2_Main_Control_Refresh | ( | ADL_CONTEXT_HANDLE | context | ) |
Function to refresh adapter information. This function generates an adapter index value for all logical adapters that have ever been present in the system.
This function updates the adapter information based on the logical adapters currently in the system. The adapter index and UDID mappings remain unchanged for each refresh call.
| [in] | context,: | Client's ADL context handle ADL_CONTEXT_HANDLE obtained from ADL2_Main_Control_Create. |
| int ADL_Main_Control_Refresh | ( | ) |
Function to refresh adapter information. This function generates an adapter index value for all logical adapters that have ever been present in the system.
This function updates the adapter information based on the logical adapters currently in the system. The adapter index and UDID mappings remain unchanged for each refresh call.
| int ADL_Main_Control_Destroy | ( | ) |
Function to destroy ADL global pointers. This function should be called last.
All ADL global buffers and resources are released after this function is called.
| int ADL2_Main_Control_Destroy | ( | ADL_CONTEXT_HANDLE | context | ) |
Destroy client's ADL context.
Clients can use ADL2 versions of ADL APIs to assure that there is no interference with other ADL clients that are running in the same process and to assure that ADL APIs are thread-safe. Such clients have to call ADL2_Main_Control_Create first to obtain ADL_CONTEXT_HANDLE instance that has to be passed to each subsequent ADL2 call and finally destroyed using ADL2_Main_Control_Destroy.
| [in] | context,: | ADL_CONTEXT_HANDLE instance to destroy. |
| void* ADL2_Main_Control_GetProcAddress | ( | ADL_CONTEXT_HANDLE | context, | |
| void * | lpModule, | |||
| char * | lpProcName | |||
| ) |
ADL local interface. Function to determine the validity of and retrieve the function pointer (similar to the GetProcAdress API) for a specified function.
This function returns the function pointer of a specified function if it is valid (defined and exposed in a DLL module). Call this function to ensure that a function is valid before calling it.
| [in] | context,: | Client's ADL context handle ADL_CONTEXT_HANDLE obtained from ADL2_Main_Control_Create. |
| [in] | lpModule | The pointer to the desired handle of the DLL. |
| [in] | lpProcName | The pointer to the desired function name. |
| void* ADL_Main_Control_GetProcAddress | ( | void * | lpModule, | |
| char * | lpProcName | |||
| ) |
ADL local interface. Function to determine the validity of and retrieve the function pointer (similar to the GetProcAdress API) for a specified function.
This function returns the function pointer of a specified function if it is valid (defined and exposed in a DLL module). Call this function to ensure that a function is valid before calling it.
| [in] | lpModule | The pointer to the desired handle of the DLL. |
| [in] | lpProcName | The pointer to the desired function name. |
| int ADL2_Graphics_Versions_Get | ( | ADL_CONTEXT_HANDLE | context, | |
| ADLVersionsInfo * | lpVersionsInfo | |||
| ) |
Function to retrieve version information.
This function retrieves software version information and a web link to an XML file with information about the latest web-posted Catalyst drivers
| [in] | context,: | Client's ADL context handle ADL_CONTEXT_HANDLE obtained from ADL2_Main_Control_Create. |
| [out] | lpVersionsInfo | The pointer to ADLVersionsInfo structure with the retrieved version information. |
| int ADL_Graphics_Versions_Get | ( | ADLVersionsInfo * | lpVersionsInfo | ) |
Function to retrieve version information.
This function retrieves software version information and a web link to an XML file with information about the latest web-posted Catalyst drivers
| [out] | lpVersionsInfo | The pointer to ADLVersionsInfo structure with the retrieved version information. |
| int ADL2_Graphics_VersionsX2_Get | ( | ADL_CONTEXT_HANDLE | context, | |
| ADLVersionsInfoX2 * | lpVersionsInfo | |||
| ) |
Function to retrieve s version information.
This function retrieves software version information and a web link to an XML file with information about the latest web-posted Catalyst drivers
| [in] | context,: | Client's ADL context handle ADL_CONTEXT_HANDLE obtained from ADL2_Main_Control_Create. |
| [out] | lpVersionsInfo | The pointer to ADLVersionsInfoX2 structure with the retrieved version information. |
| int ADL2_Graphics_Platform_Get | ( | ADL_CONTEXT_HANDLE | context, | |
| int * | lpPlatForm | |||
| ) |
Windows (XP, Vista and above); 32bit and 64bit
| [in] | context,: | Client's ADL context handle ADL_CONTEXT_HANDLE obtained from ADL2_Main_Control_Create. |
| int ADL_Graphics_Platform_Get | ( | int * | lpPlatForm | ) |


my hen has a messy vent - Extensions
Chicken Health Questions: The Answers are Right Here Flopsy is a Black Star sex-linked. She turned 2 years old in April. She keeps her tail down, she has has a very dirty vent (clean now).
Is my chicken okay . http://www.raising-chickens.org/chicken-health-questions.html
You can develop your own extensions
using the latest teen girl fashion.
Syntax-Highlighting Addons
The Epsom Salt Cure | HenCam Feb 24, 2011 . What is vent gleet? I have a nervous hen that always has a messy vent and stinky poo(unlike my other girls). And she has very fluffy bloomers! http://hencam.com/henblog/2011/02/the-epsom-salt-cure/
The Chicken Chick: Prolapse vent. Causes & Treatment. *graphic ... Apr 18, 2012 . My plans for today did not include finding a hen with a prolapsed vent. My brother , who was visiting with his daughter, was shoveling his annual . http://www.the-chicken-chick.com/2012/04/prolapse-vent-causes-treatment-graphic.html in one installer (526 kb).
Chicken Bath 101 -- Community Chickens Aug 15, 2012 .  Ha! . The answer to my question was yes, people give chickens bubble baths. http://communitychickens.blogspot.com/2012/08/chicken-bath-101.html
My chicken has a swollen backside , and all of the feathers ... Oct 10, 2011 . Customer Question. My chicken has a swollen "backside" , and all of the feathers are gone from that area. She has had a dirty vent for a long . http://www.justanswer.com/bird-vet/5o5o5-chicken-swollen-backside-feathers.html
An indelicate question: What is going on with our chicken's ... Mar 20, 2009 . Tonight my silver wyandotte hen had a messy behind so I brought her . and that her vent was red and looked fleshy with little white maggots in . http://westphoria.sunset.com/2009/03/20/an-indelicate-q/
A simple JavaScript Formatter (47kb)Chickens Have Messy Bottoms | HenCam Aug 18, 2011 . Sometimes, hens lose the feathers around their vents and what you see is a . I am sure I will need to re-visit it again when one of my girls has . http://hencam.com/henblog/2011/08/chickens-have-messy-bottoms/
chickenpooparticle.html - The City Chicken I learned this the hard way, as I have learned a lot of my chicken poop lessons.  I left the . I was indeed able to coax the prolapsed vent back in. http://thecitychicken.com/chickenpooparticle.html CertMaker for iOS and Android
Chicken Vent Problems are Common in Chickens Brown bloody looking vent: One of my laying hens seem to be missing most of the .  Help please - i am a relative novice as these are my first hens. . Recently though she has a really dirty vent and i guess is having a bit of . http://www.irish-poultry.com/apps/forums/topics/show/8795050-fat-hen-dirty Download
Now (60kb) or
alanis morissette jagged little pill mp3
Traffic Differ
I am Going to get my chickens heathly again! lethargic, some ... Mar 7, 2013 . Hi everyone, I am pretty new to chicken keeping and have 10 Birds. One has been lethargic, some diarrhea/ dirty vent area, she slept on the . http://www.backyardchickens.com/t/751540/i-am-going-to-get-my-chickens-heathly-again-lethargic-some-diarrhea-dirty-vent-area-she-slept-on-the-floor-yesterday-and-was-breathing-through-mouth Download now (47kb).
SAZ Clipboard
How to Raise Backyard Chickens - FAQ for Backyard Chicken Care My eggs have lovely orange yolks, my girls lay and egg about 6 days out of 7, . Our old girl Lottie hasn't laid since April and since has developed a dirty vent. http://www.countryfarm-lifestyles.com/backyard-chickens.html
Gallery
The Gallery extension (50kb) Medical advice - Little Hen Rescue Prolapse. Symptoms. Internal tissue protruding from hens vent. Blood. Faeces dripping from vent. Messy vent and feathers at back end. Quiet hen. Reasons . http://www.littlehenrescue.co.uk/Pages/Medicaladvice.aspx
5 common chicken questions | Small Farm Canada My chicken has a poopy bum. Do I need to worry . According to Dr. Cox, the most common cause of a dirty vent is the Northern Fowl Mite. This is a very tiny . http://smallfarmcanada.ca/2011/5-common-chicken-questions/
AnyWHERE (sample)
The AnyWHERE extension (40kb) Yuck! My Hens Have Messy Bottoms! | HenCam My Hens Have Messy Bottoms! One of the reasons . However, not all hens with messy bums are ill! . This is often a sign of vent gleet, which is a yeast infection. http://hencam.com/faq/Yuck-My-Chickens-Have-Messy-Bottoms/
RulesTab (sample)
How a Hen Lays Her Egg My five commercial hybrids will sometimes lay for a series of 30 days or more. . The vent is now wide open and the ribbed rim has become narrow and far . a hen, stomping around the nest with dirty feet, will get the egg dirty anyway. http://www.afn.org/~poultry/egghen.htm
Privacy Scanner
The Privacy Scanner
(41kb) questions » | All About Chickens Apr 6, 2012 . Why is my chicken's belly bald, inflamed and red? . feather loss may make them look a bit messy, I don't feel you have much to worry about. . Give your birds a thorough inspection, looking around the vent, under the wings . http://www.all-about-chickens.co.uk/category/questions/
Content-Blocking (sample)
The Content Blocker
sample (11kb) Lice on Chickens and Poultry. | External Problems Most chickens will have a few lice on them from time to time and won't be particularly . Often, these can be confused with a slightly 'messy' bottom and it isn't until you take a . The photo below shows an area below the vent which is typical when a hen . My existing flock have a large shed and free range in the surrounding . http://poultrykeeper.com/external-problems/lice-on-chickens-and-poultry
Image-Flipper (sample)
The Image
Flipper sample (6kb) Chicken Keeper My Chicken isn't Laying The term 'point of lay' has probably been around for many years and was used in . You need to locate her vent (bottom) in all the fluffy feathers at the back and . in the nest box, so another answer to 'my chicken isn't laying' is that yes she is, . http://www.chickenkeeper.co.uk/support-and-advice/my-chicken-isnt-laying.php
3rd-Party Extensions
Basic Chicken Keeping Hints & Tips | Chicken Houses & Coops ... Every experienced chicken keeper will have their own way of doing things and dispense their advice . Good ventilation is also important to prevent respiratory diseases. Take a . feed like layers pellets all the time in a feeder (layers mash is another option but can be messy and dusty). . My goodness this is a long page! http://www.flytesofancy.co.uk/chickenhouses/basic_chicken_keeping.html
Omlet Forums View topic - Feather loss Hens usually go through a moult in the Autumn, usually around October . With my own hens, I've found that some of these sprays cause the . Dirty vent feathers , lots of scratching and dustbathing, hunched or withdrawn hens and soft shelled eggs are often indications that your hen has an infestation too. http://club.omlet.co.uk/forum/viewtopic.php?f=41&t=28893
neXpert Performance Report Generator
my hen has been in nest box most of the day... - Farm Life Forum ... Sep 13, 2007 . my hen has been in nest box most of the day... clip this post email this . Any runny poops and are her vent feathers dirty? If she isn't obviously . http://forums.gardenweb.com/forums/load/farmlife/msg0920035012638.html
StresStimulus
Hen with messy vent and bad odor coming from mouth Feb 23, 2013 . I have a hen that is about 3 years old. I have noticed the past few days she has a messy vent when she has never had . I know it was a corn kernel b/c there was some scattered on the groud in the yard ( thanks to my kids). http://www.backyardchickens.com/t/747778/hen-with-messy-vent-and-bad-odor-coming-from-mouth
Watcher - Passive Security Auditor
Bare Butts, Feather Loss and Feather Picking | HenCam But, if your hen has irritated, raw, bald areas, especially near the vent, take a closer look for parasites. . (To learn how to do this, watch my youtube video.) . http://hencam.com/faq/bare-butts-feather-loss-and-feather-picking/
Help wet bottomed chicken (chickens forum at permies) I had thought was perhaps had a minor vent prolapse. . I'm waiting to see how these girls lay, but my advice is that if they don't meet your standards for whatever . I wasn't surprised to note a messy vent runny with diarrhea. http://www.permies.com/t/21900/chickens/wet-bottomed-chicken
Ammonite - Security Scanner
Common Chicken Illnesses and Treatments - For Dummies 1 of 12 in Series: The Essentials of Tending a Sick or Injured Chicken . All the same, it's good to be aware of them in case you ever are wondering, is my chicken sick? . poor laying; white crusty vent area; inflamed vent area; increased appetite . Symptoms: Chicks are inactive, may have white diarrhea with pasted rear . http://www.dummies.com/how-to/content/common-chicken-illnesses-and-treatments.html
el presidente guadalajara suite specials
x5s - Automated XSS Security Testing AssistantChicken Feather Loss - Hobby Farms A chicken losing feathers could be a sign of molting or a more dangerous condition. . If feather loss is flock-wide, and all of your chickens have lost their feathers, . It's usually on the unfeathered portions of the skinface, vent, sometimes where the . I got 6 chicks to go along with my other chickens from Tractor Supply. http://www.hobbyfarms.com/livestock-and-pets/chicken-feather-loss.aspx
- Detecting where safe encodings were not applied to emitted
user-inputs
- Detecting where Unicode character transformations might bypass
security filters
- Detecting where non-shortest UTF-8 encodings might bypass security
filters
human capital community members started ago
intruder21
Untitled1 Two very important factors that should be addressed to ensure that you have a healthy flock of chickens . No security measures to prevent people and animals from entering the chicken house . Diarrhoea (also known as scours or dirty vent) . http://www.nda.agric.za/docs/Infopaks/poultrydisease.htm
red rooster welding and fabrication phoenix
HTML Inspector
Your Poultry: Is my hen laying? If a hen of any age has a pale comb, it's likely she's not laying for some reason, . Use your other hand to feel for the bones on either side of her vent. These are quite prominent bones and are easy to find without getting your hand messy. http://yourpoultrynz.blogspot.com/2011/07/is-my-hen-laying.html
Tilly's Nest: How to Give a Chicken a Bath Jul 8, 2011 . Sometimes, certain hens have more difficulty, for whatever the reason, keeping .  Also, clean the feathers very well around the vent. http://www.tillysnest.com/2011/07/how-to-give-chicken-bath.html
WCF Binary-Encoded Message Inspector
Chicken Help Category - Symptoms of illness - My Pet Chicken 46 results . Q: My hen's egg shells have rough patches, and sometimes little hard pimples on the shell. Should I be concerned? A: If your chicken is young, . http://www.mypetchicken.com/backyard-chickens/chicken-help/Symptoms-of-illness-HC25.aspx
Chad Sowald's Request-To-Code
Are there symptoms I should watch for that mean ... - My Pet Chicken Be certain that her leg scutes (scales) are smooth and clean (dirty, raised scutes can . she is egg bound (unable to pass an egg); View her vent to see if it is in good condition . My chicken has a lump or tumor on her chest--what should I do ? http://www.mypetchicken.com/backyard-chickens/chicken-help/Are-there-symptoms-I-should-watch-for-that-mean-H135.aspx
Eyal's Extensions
- mahindra tractor 2216 backhoe 1710c sale has written two extensions:
Thomas Deml's Export WCAT Script extension
Choosing Healthy Chickens | Keeping Chickens: A Beginners Guide Hens in lay have bright red combs. . Feathers should be relatively clean around the vent (some profusely feathered breeds can get slightly messy around this . http://keeping-chickens.me.uk/chickens/choosing-healthy-chickens
Per-Response Latency Extension
11 Tips on How to Bathe a Chicken - wikiHow Washing a chicken is necessary so that it will look its best when in a show, or just to clean a chicken that's a bit dirty. . If the vent feathers are matted with poo, you may need to soak for a few minutes to dissolve it with light agitation of the water. .  Aug 7, 2010 . if the lining of the vent is hanging out you probably have a prolapse . I have washed my hens bots from time to time if they are very mucky but . http://www.cottagesmallholder.com/forum/chickens/dirty-bottoms/
XML Request InspectorVelvet Sparrow's Chicken Information Page-Hens, Broodies & Chicks I've noticed that my hens have a procedure when laying an egg, and the other hens . I don't know if it is toxic when applied via the vent, but the possibility is there and . It's going to get pooped on and dirty, so use one you don't care about! http://jackshenhouse.com/VSChickHensBroodiesChicks.htm XML DataSet InspectorThe Poultry Forum View topic - Bloated chicken My hens are all very affectionate and love sitting next to you in the . not to have a go at seeing if I could coax the egg out and oil her vent just in . http://poultrykeeperforum.com/viewtopic.php?f=7&t=6701
©2013 Telerik
|


A
passionate
problem solver in the field of computer programming,
striving for a better understanding of
software infrastructure and the
pristinely methodical procedures.


To view this video please enable JavaScript, and consider upgrading to a web browser that supports HTML5 video


Well, yes; but 'social work' is different from 'community relations' (CR), which is what we're engaged in. Social workers have a totally different brand identity. We are volunteers and we do volunteering.
Honestly you don't have to learn how to help people. However, we can guide you by example and we place emphasis on contributing time, skill and care. The people whom you help shouldn't start liking you for the material things you give them. Volunteering for the environment and emergency management involves some learning which people from Company and some of our volunteers can help out with. Just let us know.
If it's about anonymity or you're uncomfortable working in a flamboyant group or if you can't find like-minded people, we can guide you toward NGO's and homes for the disadvantaged, where you can contribute your time and skill wholeheartedly. These people are accustomed to receiving volunteers, so won't have unreasonable expectations from you and you can easily find your comfort level and people whom you can work with.
Plenty of companies and colleges send people to NGO's to do 30 hours of compulsory social service. When the inmates of the NGO find that you're volunteering genuinely and not out of some compulsory rule, they're very welcoming and understanding. They'll give you options of how you can help, and you can choose what you like. You can create a software for them, teach them Excel, C++ or PowerPoint, build them a kitchen-garden, plant saplings, perform a magic show, teach them their subjects in an interesting way, spend time talking to them, have fun painting the walls, bring them for an educational visit to SED or anything that you would enjoy doing for them that can help them. These are only the tip of the iceberg. There's a lot more. Besides, volunteering isn't only done at NGO's.
We thought ten times before including this question here, but it's relevant. Your dear ones do come first, but you know what? Bring your wife with you to volunteer. Believe us, you'll have a lot more fun and spend meaningful time together than if you went to a movie. There's a little something that's special about volunteering. Some wise parents introduce their children to volunteering at an early age. We enthusiastically encourage you to do the same. Family is always welcome!
Putting up posters everywhere and tips sent via all_mumbai mails don't work anymore. We realise that people don't bother, not because they dislike it but because they don't have the time for it. No nonsense, we respect your time. Moreover, we want our message to spread through your words and actions. That's when it gets a life, and that's when it's genuine! p.s: publicising volunteering to the media (T.V, newspaper etc.) is forbidden by Company.
Yes, but when we proved that we could stand on our own feet, we became an independent volunteering unit. We're still part of them and constantly in touch with Company volunteers. We take guidance and help from them while sharing our experience as well.
It's as fast as its fastest volunteer ' you! Volunteering is not about what CR team wants to do. It's about what you want to do. Bring forward your idea and be ready to execute it. We will help out in every possible way we can with our network. It always helps to have like-minded people to help you out too.
The company does not donate through volunteering, but you can donate as an individual. NGO's accept monetary donations and donations in kind (non-monetary things). You can donate rice, pulses, soaps, blankets and anything that helps in running a home for the underprivileged. (If you're also looking for tax benefits, you might want to check what percentage of the donated amount qualifies for the tax benefit)


CSS first steps¶
We use Compass to automatize and produce quality CSS
Quickstart¶
- Go to SASS repository folder
djangodemo/jsConfirm/static_source
- Run
compass watch
Now everytime you make a change at the scss files a compressed version is going to be placed automatically at djangodemo/jsConfirm/static/css/
folder.
Modules¶
The CSS for this project and demo are divided in 3 modules, a reusable base framework, a web module with the specifics for the django demo and a self contained jsConfirm module.
Framework¶
Under /scss/framework
folder there’s a light reusable Foundation 5 compatible css 12 columns grid, written specifically for this test, it contains a responsive grid, position helpers and transitions.
Web module¶
Organized CSS for the django demo
jsConfirm¶
The most important module it’s named jsConfirm and it’s special because it’s self contain, you don’t need the rest of the modules to use it.


This test simulates an automated test running scenario, where the test results emitted by testharness.js may be interpreted after some delay. It is intended to demonstrate that in such cases, any additional tests which are executed during that delay are not included in the dataset.
Although these "late" tests are likely an indication of a mistake in test design, they cannot be detected deterministically, so in the interest of stability, they should be silently tolerated.


What is Android?
The answer is as usual "Android is a mobile operating system." or "Android is a mobile operating system based on a modified version of the Linux kernel and other open source software, designed primarily for touchscreen mobile devices such as smartphones and tablets."
Android is a open source free software, which is developed by an association of developers known as Handset Alliance (OHA), which is sponsered by GOOGLE.
The source code of this project is known as Android Open Source Project (AOSP). This Android devices comes
with some pre-installed
softwares like mobile services, core gapps such as Chrome, Google Playstore and some applications associated
to Google Play Services.
As this is an open source project there are millions of and Android developers around the world including
Android application development.
History of Android
In October 2003 by Andy Rubin, Rich Miner, Nick Sears, and Chris White founded Android lnc. in Palo Alto,
California.
Did You known that Android's first intention was to develope an advanced operating system for Digital Cameras.
Then what made them to switch their aim from Camera OS to OS for Phones.
Lets check out,
At that time (2005) the two mobile OS developers Symbian and Microsoft Windows Phone were catching the
market.
But this OS lack in security of the user, Symbian OS was completely depended on Nokia devices. Nokia the
creator of Symbia OS
which was not an open source software unfortunately had to see their graph going down.
Where as the Windows phones did not get apps support due to fewer apps in Store. OS lacked in responsive and get hanged often. Many of Windows phone device get bricked when you try to update it.
At Google, the team led by Rubin developed a mobile device platform powered by the Linux kernel. Google marketed the platform to handset makers and carriers on the promise of providing a flexible, upgradeable system and also as to it is open source the developers showed their interest. As the Android got support from Google and its services, it started catching up market within a very short span of time.
The First ever device that launched with Android is HTC Dream.
HTC Dream
Hardware
Ok enough of history, lets get to some hardware part of Android.
As this OS is build up on Linux, hardware is one of the important part. The main hardware platform for
Android is ARM (the ARMv7 and ARMv8-A architectures), with x86 and x86-64 architectures also officially
supported in later versions of Android.
Camera a hardware part of a device
Android devices incorporate many optional hardware components, including still or video cameras, GPS, orientation sensors, dedicated gaming controls, accelerometers, gyroscopes, barometers, magnetometers, proximity sensors, pressure sensors, thermometers, and touchscreens.
Did You known why all the Android versions are named after desserts?
Each major release is named in alphabetical order after a dessert or sugary treat, with the first few Android versions being called "Cupcake", "Donut", "Eclair", and "Froyo", in that order. During its announcement of Android KitKat in 2013, Google explained that "Since these devices make our lives so sweet, each Android version is named after a dessert",
Development
Android is developed by Google until the latest changes and updates are ready to be released, at which point the source code is made available to the Android Open Source Project (AOSP), an open source initiative led by Google. The AOSP code can be found without modification on select devices, mainly the Google Nexus and Google Pixel series of devices.
Basically the Stock OS in every device is same, the changes in the UI and hardware differ from device to devices, as per the device manufacturer designs. Let me give you an example of it, suppose you have a device a dual rear cameras and on the other hand your friend has a device with single rear camera, so here there is difference in hardware components but your both devices run on Android 9 Pie.
Device Codenames
Internally, Android identifies each supported device by its device codename, a short string, which may
or may not be similar to the model name used in marketing the device. For example, the device codename of
the Pixel smartphone is sailfish.
Want to know whats your device
codename.
Install adb in your PC and type command "adb pull /system/build.prop".
Recents
Most of the Android Devices are running on Android 10 stable.
Recently the Android has released its beta of the latest Android 11 in the Pixel devices.
For more info go to Android


learning ai through computational neuroscience
Here we'll be covering _Theoretical Neuroscience: Computational and Mathematical MOdeling of Neural Systems_, by Peter Dayan and L. F. Abbott. Chapter 1 Section 1learning ai through computational neuroscience
Here we'll be covering _Theoretical Neuroscience: Computational and Mathematical MOdeling of Neural Systems_, by Peter Dayan and L. F. Abbott. Chapter 1 Section 1


WITNESS LIST
Education
January 31, 2013 8:30 AM
CSCOPE Review
Panel 1:
FOR:
Labay, Wade Director, State CSCOPE (Education Service Center Region 13 and
TESCCC), Austin, TX
Villarreal, Linda P. Executive Director, ESC 2 (Education Service Center, 2), Corpus
Christi, TX
ON:
Smith, Terry Executive Director - ESC-13 (ESC-13 -TESCCC), Austin, TX
Panel 2:
AGAINST:
BOWEN, M.A., MARY TEACHER, Master of Arts in Curriculum & Instruction (also
providing written testimony) (Self), Cedar Creek, TX
Garza, Charlie Principal / Former Member State board of Edu Dist 1 (Self), Dallas, TX
HARTZLER, STAN RETIRED TEACHER (also providing written testimony) (Self),
LULING, TX
McGregor, Ms Mac (Jeanine) Teacher; Education Researcher, Author (also providing
written testimony) (Self), Ballinger, TX
ON:
Venable, Peggy DIRECTOR (also providing written testimony) (AMERICANS FOR
PROSPERITY -TX), AUSTIN, TX
Panel 3:
FOR:
Killian, Doug Superintendent (Hutto ISD, Fast Growth, TACS), Hutto, TX
Williamson, Marc Supt (Fredericksburg ISD), Fredericksburg, TX
ON:
Eaton, Holly Director of Professional Development + Advocacy (also providing written
testimony) (Tx Classroom Teachers Assoc), Austin, TX
Simpson Hull, Dr. Susan Superintendent (also providing written testimony) (Grand
Prairie), Grand Prairie, TX
Panel 4:
ON:
Cargill, Barbara Chair (also providing written testimony) (Chair, State Board of
Education), Woodlands, TX
Hardy, Pat District 11 Tx State Board of Education (Self), FW, TX
Public Testimony:
FOR:
Ash, Audrey Reading Specialist Burkburnett ISD (Burkburnett ISD), Wichita Fallas, TX
Borchardt, Cheri Director of Curriculum & Instruction (Lorena ISD), Lorena, TX
Callahan, CAsey Asst. Superintendent Llano ISD (Llano ISD), Llano, TX
Clore, Paul Superintendent (also providing written testimony) (Gregory-Portland ISD),
Portland, TX
WITNESS LIST
Education
January 31, 2013 8:30 AM
Cox, D'Aun 7th Grade Science Teacher + Department Chair at Lorena Middle Sch
(LORENA ISD), Robinson, TX
DREWS, DR. CELIA PRINCIPAL, LORENA M.S. (LORENA I.S.D.), WOODWAY, TX
Duron, Jodi Superintendent (Elgin ISD), Austin, TX
Holland, Jil teacher (Llano ISD), Mason, TX
KEELE, TODD PRINCIPAL (JR HIGH) (LLANO ISD), LLANO, TX
Lane, Shauna Director of Special Programs (Ralls I.S.D.), Ralls, TX
POST, STEVE Superintendent (Tulia ISD), Tulia, TX
Richardson, Justin Exec. Director Curriculum & P.D. (Canyon ISD), Canyon, TX
Swope, Donna Teacher (Llano ISD), Llano, TX
Willis, Randy Superintendent of Schools (Granger ISD), Granger, TX
AGAINST:
AMES, BILL SELF (also providing written testimony) (SELF), DALLAS, TX
Gerstenschlager, MerryLynn Vice President + Education Liaison (also providing written
testimony) (Texas Eagle Forum and Self), Weatherford, TX
GRIFFING, JOHN Private Citizen / Journalist (Self), Houston, TX
Linahan, Alice Board Member (also providing written testimony) (Women On The Wall),
Argyle, TX
Russell, Calvin (also providing written testimony) (Self), Magnolia, TX
Russell, Ginger Parent + Citizen (also providing written testimony) (Self), Magnolia, TX
VanCleave, Janice Author - Teacher (also providing written testimony) (Tx CSCOPE
REVierers), Riesel, TX
Vera, Colleen N.A. (Self), Houston, TX
Williford, Lisa Teacher - Huntsville HISD Dyslexia Specialist (Self), Huntsville, TX
ON:
Cary, Katherine General Counsel (Office of Attorney General), Austin, TX
Hartman, Eric Director of Government Relations (also providing written testimony) (Texas
AFT), Austin, TX
Hartzler, Sheila ReTired Teacher (Self), Luling, TX
MAYO, FRANKLIN PRESIDENT (also providing written testimony) (TEXANS FOR
BETTER SCIENCE EDUCATION), HOUSTON, TX
Registering, but not testifying:
FOR:
Buckley, Susan Director of Secondary Curriculum & Prof. Dev. (Killeen ISD) (Killeen
ISD), Solado, TX
Davis, Sharon Executive Director, School Leadership (Killeen ISD), Belton, TX
Miller, Diana Assistant Superintendent (Killeen ISD), Harker Heights, TX
Pergande, Vonda Teacher (Lampasas ISD), Kempner, TX
Ramsey, Lori Instructional Technology Coordinator - LISD (Self), Lampasas, TX
Shanley, David Superintendent (Johnson City ISD), Dripping Springs, TX
Yeary, Nancy Asst. Supt. (Lampasas ISD), Lampasas, TX
AGAINST:
Bartlett, Laurie President (On Point Broadcasting / SELF), Austin, TX
WITNESS LIST
Education
January 31, 2013 8:30 AM
Salinas, Celena Board Member (Women on the Wall), Keller, TX
Smith, Michelle Associate State Director for Concerned Women for America (Self and
Concerned Women for America), Rockwall, TX
ON:
Haenisch, Barry Leg. consultant (Texas Assn. of Community Schools), Round Rock, TX
FOR:
Bradford, Kellyn none...Mom...PTA Officer (Texas PTA), Austin, TX
Killian, Doug Superintendent (Hutto ISD, self, Fast Growth & TACS), Hutto, TX
Trevino, Theresa Director (Self + TAMSA - Texans Advocating for Meaningful Student
Assessment), Austin, TX
Wellman, Nola Superintendent (Eanes ISD), Austin, TX
Willis, Randy Superintendent (Granger ISD), Granger, TX
ON:
Hartman, Eric Director of Government Relations (also providing written testimony) (Texas
AFT), Austin, TX
Registering, but not testifying:
FOR:
Brownson, Amanda Associate (Texas School Alliance), Austin, TX
Eaton, Holly Director of Professional Development + Advocacy (Tx Classroom Teachers
Assoc.), Austin, TX
Fasel, Erin R. Curriculum Director (Johnson City ISD), Johnson City, TX
Haenisch, Barry Leg. Consultant (Texas Association of Community Schools), Round Rock,
TX
Rogers, Don Executive Director (Texas Rural Education Assn), Buda, TX
AGAINST:
Storer, Julie High School Principal (LBJ High School - Johnson City), Johnson City, TX
ON:
Griffing, John Private Citizen (Self), Houston, TX


As a counterpart to the access to the source code and rights to copy, modify and redistribute granted by the license, users are provided only with a limited warranty and the software's author, the holder of the economic rights, and the successive licensors have only limited liability.
In this respect, the user's attention is drawn to the risks associated with loading, using, modifying and/or developing or reproducing the software by the user in light of its specific status of free software, that may mean that it is complicated to manipulate, and that also therefore means that it is reserved for developers and experienced professionals having in-depth computer knowledge. Users are therefore encouraged to load and test the software's suitability as regards their requirements in conditions enabling the security of their systems and/or data to be ensured and, more generally, to use and operate it in the same conditions as regards security.
The fact that you are presently reading this means that you have had knowledge of the CeCILL license and that you accept its terms.


--- layout: speaker title: Tim Messerschmidt date: "2013-05-06 02:12:52 +0200" author: ukmadlz version: 1.0.0 name: Tim Messerschmidt image: speaker/tim_messerschmidt.png job: Head of Developer Relations, International company: Braintree_PayPal desc: Head of DevRel @ Paypal github: SeraphimSerapis twitter: SeraAndroid website: http://timmesserschmidt.com/ ---
As a long time mobile and web developer, Tim channels his knowledge and experience as Braintree's Head of Developer Relations. He is passionate about startups and serves as a mentor at multiple incubators and accelerators.
Prior to joining PayPal, Tim worked with Neofonie Mobile and Samsung focusing on several mobile projects. In his spare time, he leads and creates training classes in all sorts of developer-oriented topics, contributes to Open Source projects and is one of the authors of the Mobile Developer’s Guide to the Galaxy. In addition, he authored numerous articles published in print magazines.
Talk contents not yet finalised.


Credits and Licenses:
GLCameraInfo Copyright (c) 2015-2019 Corvidae Software www.corvidae-software.com
Apache License
Timber Copyright 2013 Jake Wharton
Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.


Before Change
inner_prod : array-like, shape=[...]
Inner-product of the two tangent vectors.
aux_prod = tangent_vec_a * tangent_vec_b
metric_mat = self.metric_mat_at_identity
if (Matrices.is_diagonal(metric_mat)
and self.lie_algebra is not None):
aux_prod *= self.reshaped_metric_matrix
inner_prod = gs.sum(aux_prod, axis=(-2, -1))
return inner_prod
def inner_product(self, tangent_vec_a, tangent_vec_b, base_point=None):
Compute inner product of two vectors in tangent space at base point.
After Change
if (Matrices.is_diagonal(metric_mat)
and self.lie_algebra is not None):
tan_b *= self.reshaped_metric_matrix
inner_prod = Matrices.frobenius_product(
tangent_vec_a, tan_b)
return inner_prod
def inner_product(self, tangent_vec_a, tangent_vec_b, base_point=None):
Compute inner product of two vectors in tangent space at base point.


Melbourne Cup 2019: Vow And Declare wins; Frankie Dettori banned as runner-up Master Of Reality demoted
by Frank KeoghVow And Declare won a dramatic Melbourne Cup while Frankie Dettori's runner-up Master Of Reality was demoted to fourth after a stewards' inquiry.
Dettori was given a nine-meeting ban after the victor, trained by Australian Danny O'Brien, won in a tight finish.
Stewards ruled Dettori, riding for Irish trainer Joseph O'Brien, impeded Il Paradiso, who was fourth past the post for Joseph's father Aidan.
Il Paradiso was promoted to third, with British hope Prince Of Arran second.
Dettori looked to have sealed his first victory in the two-mile Flemington race 'that stops a nation' but Craig Williams claimed his maiden Melbourne Cup triumph on Vow And Declare before more drama in the stewards' room.
Italian-born Dettori, 48, was banned for nine racedays in the state of Victoria, up to and including 13 November.
Prince Of Arran's jockey Michael Walker was fined AUS10,000 (£5,400) and suspended for seven race meetings for overuse of the whip.
But there was only elation for Williams, who said of his mount: "It was a privilege to ride him today and great to be associated with such a great horse."
Winning trainer O'Brien was also celebrating a first Melbourne Cup victory, with the four-year-old gelding who was bred in Australia.
"I really can't believe it, I just feel incredibly blessed to have a horse good enough to be in it. The last 100 (metres) he just wouldn't give in," said O'Brien, who is no relation to the Irish father-and-son trainers.
I'm more gutted for Frankie than myself. I'll be back. I don't know if Frankie is ever going to win this race.Joseph O'BrienMaster Of Reality's trainer
Asked where the horse's name came from, owner-breeder Paul Lanskey said he was named after his father.
"Dad would come home from the pub and say to mum: 'I vow and declare I've only had a few beers.'"
Prince Of Arran was awarded second after the inquiry, having finished third last year for British trainer Charlie Fellowes.
"I'm incredibly proud of the horse. To do what he has done two years in a row is a remarkable achievement," said Fellowes.
The build-up to the race had seen animal welfare in the spotlight after recent cruelty scandals in Australia.
Of the 24 runners, 23 horses returned back safely, although Rostropovich was found to be lame and taken to the University of Melbourne Equine Centre for further assessment.
How the drama unfolded
Dettori, who first rode in the Flemington race 26 years ago when Master Of Reality's trainer was just six months old, sensed this could be his chance to finally claim the AUS$8m (£4.3m) race.
The three-time Britrish champion jockey, who has ridden a personal record of 19 top-level Group One winners this year, was always handily placed and pushed his mount clear as the race developed in the final quarter-mile.

Meanwhile, Prince Of Arran came into contention and Il Paradiso finished with a late flourish under Wayne Lordan.
The pair were closing all the time before being checked as Dettori drifted to his left and Vow And Declare just managed to keep on for a narrow victory.
It was another Melbourne Cup to forget for Dettori, who was banned for a month and fined A$20,000 for careless riding on Max Dynamite, runner-up to Prince Of Penzance in 2015.
Joseph O'Brien, who won the 2017 Melbourne Cup with Rekindling, was disappointed Master Of Reality could not give Dettori his first win in the race, with the Italian having also finished second in 1999 on Central Park.
"I'm more gutted for Frankie than I am for myself," the trainer told The Age newspaper.
"I'll be back. I don't know if Frankie is ever going to win this race."
Full Melbourne Cup result
1 Vow And Declare 10-1 2 Prince Of Arran 16-1 3 Il Paridiso 14-1 4 Master Of Reality 25-1
(Master Of Reality demoted from second to fourth, Prince Of Arran promoted to third from second, Il Paradiso up to third)
5 Surprise Baby 6 Mer De Glace 7 Finche 8 Cross Counter 9 Steel Prince
10 Magic Wand 11 Twilight Payment 12 Sound 13 Constantinople 14 Mirage Dancer 15 Hunting Horn 16 Raymond Tusk
17 The Chosen One 18 Latrobe 19 Southern France 20 Youngstar 21 Neufbosc 22 Downdraft 23 Mustajeer 24 Rostroprovich
Analysis
BBC racing correspondent Cornelius Lysaght
A dramatic Cup all-round with a 'ripper' of a close finish, ending with success for the first Australian winner for three years - to the relief for the locals - and then came Dettori's demotion.
Dettori has never had as much luck Down Under as in Europe and elsewhere, but the suspension following clear interference late on that supporters of Il Paradiso insist cost their fancy the race, is not as severe as it might have been - four years ago he received a month off when runner-up.


All kinds of things count as income. Both children and adults can earn income.
Child Income
Child income is paid directly to the child, and includes:
- Salary or wages from a job
- Social Security benefits due to blindness or disability
- Social Security wages from a parent who is disabled, retired, or deceased, which the child receives
- Regular spending money, given to a child by a friend or family member
- Income paid to the child by a private pension fund, annuity, or trust
Adult Income
Adult income is paid directly to an adult, before taxes are taken out, and includes:
- Salary, wages, strike benefits, cash bonuses, or other money from work
- Net income from self-employment
- If you’re in the military: basic pay and cash bonuses, allowances for off-base housing, clothing, and food. Do not include combat pay, FSSA, or privatized housing allowances
- Public assistance, alimony, or child support including:
- Unemployment benefits
- Worker’s compensation
- Supplemental Security Income (SSI)
- Cash assistance from State or local government
- Alimony payments (only if court-ordered)
- Child support payments (only if court-ordered)
- Veteran’s benefits
Don’t include income from any other cash-value public assistance benefits not listed here.
- Pensions/Retirement/All Other Income
- Social Security (including railroad retirement and black lung
benefits)
- Worker’s compensation
- Private Pensions or disability
- Income from trusts or estates
- Investment income
- Annuities
- Earned interest
- Rental income
- Regular cash payments from outside household


Göteborgsvarvet Half Marathon
Göteborg SWE
Website: www.goteborgsvarvet.com
Race Winners
(40 runnings)
1:09:27
1:09:04 1:11:40 1:11:27 17 May
2008
1:01:21 1:10:19 12 May
2007
1:04:03
1:12:38
13 May
2006
1:02:14
1:12:34
21 May
2005
1:03:19
1:12:34
15 May
2004
1:04:03
1:18:06
17 May
2003
1:03:43
1:13:27
25 May
2002
1:03:35
1:13:03
05 May
2001
1:03:00
1:11:07
13 May
2000
1:02:42
1:09:28
08 May
1999
1:02:18
1:11:47
16 May
1998
1:03:28
1:12:31
24 May
1997
1:01:44
1:09:50
11 May
1996
1:03:12
1:14:29
13 May
1995
1:02:39
1:13:18
07 May
1994
1:03:08
1:13:04
15 May
1993
1:03:37
1:13:30
16 May
1992
1:03:24
1:13:26
25 May
1991
1:04:38
1:12:30
12 May
1990
1:01:54
1:12:45
20 May
1989
1:03:35
1:17:16
14 May 1988
1:05:13
1:14:19
16 May 1987
1:03:37
1:13:24
10 May
1986
1:03:41
1:12:11
11 May
1985
1:04:35
1:13:44
12 May 1984
1:03:14
1:10:46
07 May 1983
1:04:40
1:14:54
15 May 1982
1:02:54
1:09:57
16 May 1981
1:05:44
1:17:47
07 Jun
1980
1:06:17
1:15:50
18 May
2019
1:00:38
Shadrack Korir Kimining-2
1:08:18
Tabitha Wambui Gichia (KEN)
19 May
2018
1:01:31
Shadrack Korir Kimining (KEN)
1:09:06
Meseret Belete Tola (ETH)
20 May
2017
1:00:20
Geoffrey Yegon (KEN)
1:07:59
Fancy Chemutai (KEN)
21 May
2016
59:35
Richard Kiprop Mengich-2
1:08:01
Viola Chepchumba (KEN)
23 May
2015
1:00:44
Richard Kiprop Mengich (KEN)
1:08:13
Worknesh Debele Degafa-2
17 May
2014
1:00:36
Ghirmay Ghebreslassie (ERI)
1:10:12
Worknesh Debele Degafa (ETH)
18 May
2013
1:03:13
Jackson Kiprop (UGA)
(nc)
1:11:29
Isabella Ochichi (KEN) (nc)
12 May
2012
1:00:25
Victor Kipchirchir (KEN)
(nc)
Hilda Kibet (NED) (nc)
21 May
2011
1:00:52
Albert Matebor Kiplagat (KEN)
Joyce Chepkirui (KEN)
22 May
2010
1:01:10
Sammy Kiprono Kirui (KEN)
Amane Gobena Gemeda (ETH)
16 May
2009
1:01:55
Nicholas Manza Kamacha (KEN)
(nc)
Ana Dulce Felix (POR)
(nc)
Sylvester
Teimet Kimeli-2
Kirsten Otterbu-2
Sylvester Teimet
Kimeli (KEN)
(nc)
Kirsten Otterbu (NOR)
(nc)
Abdelkader El Mouaziz (MAR)
Helena Javornik (SLO)
Silas Sang
Kipngetich (KEN)
Susan Kurui (KEN)
Mustafa Mohamed-2
Leah Kiprono (KEN)
Benjamin Rotich (KEN)
Miriam Wangari
Kiprugat (KEN)
Mustafa Mohamed (SWE)
Lena Gavelin (SWE)
Pavel Loskutov (EST)
Stine Larsen-2
Faustin Baha (TAN)
Stine Larsen (NOR)
Rachid ben Salem (MAR)
Nadezhda Wijenberg-2
Fred Getenge Ntabo (KEN)
Nadezhda Wijenberg (HOL)
Martin Ojuku Gekaka (KEN)
Joyce Chepchumba
Koech (KEN)
Wilson Musto (KEN)
Aniela Nikiel (POL)
Richard Nerurkar (ENG)
(nc)
Ritva Lemettinen-3
(nc)
Onesmo Ludago-2
Ritva Lemettinen-2
Francis Robert Naali (TAN)
Ritva Lemettinen (FIN)
Onesmo Ludago (TAN)
Susannah Rigg (ENG)
Andrea Nade (TAN)
Ingrid Kristiansen (NOR)
Thomas Robert Naali (TAN)
Midde Hamrin-4
Simon Robert Naali (TAN)
Elizabeth Johannesson (SWE)
Hakan Börjesson (SWE)
Evy Palm-2
Mats Erixon-5
Midde Hamrin-3
Mats Erixon-4
Evy Palm (SWE)
Mats Erixon-3
Jeannette Nordgren-2
Mats Erixon-2
Midde Hamrin-2
Tommy Persson (SWE)
Jeannette Nordgren (SWE)
Mats Erixon (SWE)
Grete Waitz (NOR)
Göran Högberg-2
Evy Palm (SWE)
Göran Högberg (SWE)
Midde Hamrin (SWE)
Notes: In 2006 the men's lead pack was led off course by the lead vehicle and ran
about 80 meters short. However, none of these runners were disqualified and their times and places were allowed
to stand by the race organization. Only net times were reported for the 2014 race.
(nc) => national championship
2013 Mikal Ekvall was the national champion (13th
place, 1:06:08)
2013 Isabella Andersson was the national champion (4th place, 1:15:17)
2012 Adil Bouaffif was the
national champion (17th place, 1:05:01)
2012 Isabella Andersson was the national champion (5th place, 1:10:30)
2009 Erik Petersson was the
national champion (8th place, 1:06:49)
2009 Isabella Andersson was the national champion (2nd place, 1:14:22)
2007 Henrik Ahnstrom was the national champion (7th place, 1:06:13)
2007 Anna Rahm was the national champion (2nd place, 1:13:31)
1995 Ake Eriksson was the national champion (6th place, 1:04:19)
1995 Sara Rome was the national champion (2nd place, 1:13:50)
Most Wins
Men
5
Mats Erixon (SWE)
1982,1984-87
Women
4
Midde Hamrin (SWE)
1980,1984,1987,1990
Prize Money
(ADR qualified runners)
Year Men Women Total 2016 $30,250 $23,960 $54,210 .... 2011 14,155 14,155 28,310 .... 2006 12,030 8,150 20,180 2005 8,765 8,450 17,215 .... 2003 8,510 8,510 17,020 2002 7,780 7,780 15,560 2001 9,500 6,000 15,500 2000 9,000 8,500 17,500 1999 8,000 4,000 12,000 1998 6,000 5,500 11,500 1997 16,000 n/a 16,000 1996 7,000 1,000 8,000 1995 11,000 3,350 14,350 .... 1993 4,000 3,000 7,000 Sums $151,990 $102,355 $254,345
Race Time Bias (sec/km)
Year Men Women 2017 +0.4 +1.0 2016 -2.0 n/c 2015 +2.1 -4.5 2014 -3.6 n/c 2013 +3.3 +7.6 2012 -4.8 -4.5 2011 -1.4 -0.5 2010 +0.1 +3.6 2009 -1.2 n/c 2008 -2.6 n/c .... 2006 +0.1 +0.6 2005 +0.2 -3.3 2004 +2.2 +5.7 2003 -1.6 -0.7 2002 -1.2 -2.6 2001 -2.9 -0.5 2000 -3.1 -3.6 1999 -0.8 n/c 1998 -0.6 -1.4 1997 -3.7 -3.0 1996 -0.1 n/c 1995 +0.7 +0.2 1994 -0.5 +1.4 1993 +4.5 +0.3 1992 +1.0 n/c .... 1990 -2.0 n/c 1989 +0.5 n/c 1988 +3.9 n/c 1987 -0.4 n/c 1986 n/c -4.3 Avgs -0.6 -0.4
Note: The men's 2006 value reflects only those runners that ran the full distance.
Competitive Level
(1990-date)
Year Men Women 2016<PHONE_NUMBER><PHONE_NUMBER><PHONE_NUMBER> 667 n/c 2013<PHONE_NUMBER><PHONE_NUMBER><PHONE_NUMBER><PHONE_NUMBER> 574 n/c 2008<PHONE_NUMBER><PHONE_NUMBER><PHONE_NUMBER><PHONE_NUMBER> 503 n/c 2003<PHONE_NUMBER><PHONE_NUMBER><PHONE_NUMBER><PHONE_NUMBER> 420 n/c 1998<PHONE_NUMBER> 358 390 .... 1995<PHONE_NUMBER> 409 n/c 1993 447 456
Quality Performances through 2019
Men <1:00:00 1 <1:00:30 5 <1:01:00 13 <1:01:30 22 <1:02:00 43 <1:02:30 54 <1:03:00 76 Women <1:08:00 1 <1:09:00 7 <1:10:00 21 <1:11:00 33 <1:12:00 51 <1:13:00 76 <1:14:00 112
Last Updated on 20 May 2019 mp
Contributors: Hans Hultman, David Monti (5)


---
layout: post
status: publish
published: true
title: BizTalk VS.NET Designer wishes
author:
display_name: Tomas Restrepo
login: tomasr
email<EMAIL_ADDRESS>url: http://winterdom.com/
author_login: tomasr
author_email<EMAIL_ADDRESS>author_url: http://winterdom.com/
wordpress_id: 267
wordpress_url: http://winterdom.com/2004/10/biztalkvsnetdesignerwishes
date: '2004-10-14 19:02:10 +0000'
date_gmt: '2004-10-14 19:02:10 +0000'
categories:
- BizTalk
tags: []
comments: []
---
I've been meaning to post this for a while, so here it goes:
The new VS.NET designers in BizTalk 2004 are far better than the old set of tools BizTalk 2002 had, no doubt about it. However, it could still be improved quite a bit; particularly in that it is still a little bit rough on the edges. Here are some suggestions of my own:
- On a BizTalk project, the Add New Item dialog only contains the BizTalk item templates, and doesn't include the usual "common" items, like a new XML file, a new XSLT, etc. You can still have items like this in your BizTalk project by creating them outside and then including them; you just can't create them directly in it, which is very annoying.
- The Schema designer doesn't use encoding marks (a BOM, I imagine), or something like that. I've trashed more than one schema because I opened it up temporarily on the regular VS.NET schema designer and after saving it and reopening it in the BizTalk designer it turns into unreadable garbage.
- It would be great if you could directly modify an Schema's XSD in the BizTalk Schema designer, instead of having to close the file, and use Open With to open it up in one of the regular designers.
- It would be nice if one could create many-to-many (*-*) transformations, and not only from an orchestration, even if it meant having to do a little bit of handy work...
- Several improvements to what you can put into the properties window in the schema designer (i.e: put direct character encodings, like �D; and such, supporting escape characters for common control characters like \r\n instead of having to put the hex values and so on)


I am passionate about changing the world to a better place through software development.I believe design is earned.
An idea, a concept, a masterpiece is only as powerful as the message it is able to carry.
Never stop to dare, to try or to dream.
I want to be able to leave behind an infrastructure and a road map that people can follow.
Leave your details below I will get back to you as soon as I can.
You can follow me in the following media


As you saw in my home page, I am Kai Cheung, graduating class of 2019 and I am from Hong Kong. I don't have a profession to put here, so let's talk sports. I am an avid fan in football (or as Americans call if "soccer") and hockey. I was a fan of Manchester United since I was six years old, and I recently started supporting the Toronto Maple Leafs after learning about the sport in school. I also love to game, only Playstation 4 and PC games. Hit me up on Steam, it is linked below.


Linda uses the MIAPPE model to structure the information. The figure below represents the MIAPPE diagram with each of the elements composing it. Each component of the MIAPPE model contains several fields helping to describe your whole investigation
Investigation
Investigations are research programmes with defined aims.They can exist at various scales (for example, they could encompass a grant-funded programme of work, the various components comprising a peer-reviewed publication, or a single experiment). 1 per MIAPPE submission
Investigation unique ID
Identifier comprising the unique name of the institution/database hosting the submission of the investigation data, and the accession number of the investigation in that institution.
- ex: EBI:12345678
- type: Unique identifier
- cardinality: 0-1
Investigation title
Human-readable string summarising the investigation. Adaptation of Maize to Temperate Climates: Mid-Density Genome-Wide Association Genetics and Diversity Patterns Reveal Key Genomic Regions, with a Major Contribution of the Vgt2 (ZCN8) Locus. Free text (short) 1
Investigation description
Human-readable text describing the investigation in more detail. The migration of maize from tropical to temperate climates was accompanied by a dramatic evolution in flowering time. To gain insight into the genetic architecture of this adaptive trait, we conducted a 50K SNP-based genome-wide association and diversity investigation on a panel of tropical and temperate American and European representatives. Free text 0-1
Submission date
Date of submission of the dataset presently being described to a host repository. 2012-12-17 Date/Time (ISO 8601, optional time zone) 0-1
Public release date
Date of first public release of the dataset presently being described. 2013-02-25 Date/Time (ISO 8601, optional time zone) 0-1
License
License for the reuse of the data associated with this investigation. The Creative Commons licenses cover most use cases and are recommended. CC BY-SA 4.0, Unreported Unique identifier 0-1
MIAPPE version
The version of MIAPPE used. 1.1 Version number 1
Associated publication
An identifier for a literature publication where the investigation is described. Use of DOIs is recommended. doi:10.1371/journal.pone.0071377 DOI 0


@blackjok3r yea you fucked up a test I was doing a couple days ago
by mining it
blackjok3r26-Aug-19 03:47 PM
sorry
Alright26-Aug-19 03:47 PM
well not you specifically, but don't need to name names
blackjok3r26-Aug-19 03:48 PM
I had it mining... but I dont have any blocks it says.. but my balance is HUGE
Alright26-Aug-19 03:48 PM
yea, about to start testing again, @ComputerGenie 👴👴👴 is convinced of something, and I plan to prove him wrong
those maths really are a problem for him
ComputerGenie 👴👴👴26-Aug-19 03:49 PM
and I plan to prove him wrong
because you've done that how many times when it comes to mining?
 He thinks if one miner is mining with 90ksol and another is mining with 10ksol, the 90ksol miner will get all of the blocks
ComputerGenie 👴👴👴26-Aug-19 03:54 PM
mine ZEC with a GPU and let me know how that works out for you
Alright26-Aug-19 03:58 PM
don't understand
obviously you won't get blocks, but why is that any different with apow?
ComputerGenie 👴👴👴26-Aug-19 04:00 PM
because that's the situation that apow creates
the diff is "artificially" inflated and before if can get into the range that a smaller miner is likely to find, the larger miner can find a string of blocks and yoyo it back up(edited)
Alright26-Aug-19 04:01 PM
yes but at that high diff, the likelihood of finding a block is no different
with 90% of hashrate, you should have 90% chance
with 10%, 10%
ComputerGenie 👴👴👴26-Aug-19 04:02 PM
with 90% of hashrate, you should have 90% chance
until you add something to the diff algo that manipulates away from a smooth diff transition
Alright26-Aug-19 04:02 PM
ok...
ComputerGenie 👴👴👴26-Aug-19 04:03 PM
imagine BTC diff is the same as ZEC diff and 3 seconds later it's the same as BTC diff currently is
Alright26-Aug-19 04:03 PM
let's say you and I forked ZEC and were competing to find the next block. You have 9sols, I have 1sols. How are you not exactly 9x more likely to find a block first?
you're saying you would be infinitely more likely to find a block first, which I do not understand
ComputerGenie 👴👴👴26-Aug-19 04:04 PM
How are you not exactly 9x more likely to find a block first?
because the diff "magically" jumps 200x outside of your general find range(edited)
Alright26-Aug-19 04:04 PM
man what
we're both solving for the same min diff
ComputerGenie 👴👴👴26-Aug-19 04:06 PM
I'll explain hashrate, diff1/target (for the<PHONE_NUMBER>000th time) and "expected" finds to you after lunch
Alright26-Aug-19 04:06 PM
vague bullshit
you'll argue whatever the first thing you decide is(edited)
jl777c26-Aug-19 04:12 PM
regardless of the diff, 9x the hashrate is expected to get 9x the blocks
ComputerGenie 👴👴👴26-Aug-19 04:14 PM
you'll argue whatever the first thing you decide is
unless proven wrong, yes
..... and when you figure out how to get 75% of binance's new "staking" reward away from its users, I change my position on the last one too
noticed same before sleep, fixed and mustve happened again for some reason. not sure why, will monitor. had it setup to respawn after 5 min if detected down
Bar_F1sh_Rel27-Aug-19 03:36 PM
@blackjok3r - Network routes re-configured. still not ideal, but should allow incoming connections.
1
1
blackjok3r27-Aug-19 03:37 PM
See how it goes I guess... the nodes in working state are grouping quite well... apart from CFEKAPOW.... thats all over the place.
blackjok3r27-Aug-19 04:03 PM
@gcharang@webworker01@Alright@Exile13
Your nodes are down.
1
Alright27-Aug-19 04:08 PM
not sure what happened, iguana and daemons were running
just stopped and started
blackjok3r27-Aug-19 04:08 PM
just stop it
restart VPS if needed(edited)
if that doesnt wqork. reclone supernet and komodo
make sure port 8222 is open. That seems to destroy your chances if its closed(edited)
Exile1327-Aug-19 06:02 PM
stopped, rebooted, added ufw allow 8222, starting
Exile1327-Aug-19 06:14 PM
labs and kmd are synched but im not nota
recloning supernet and kmd
blackjok3r27-Aug-19 06:15 PM
are you on many_iguana branch of StakedNotary @Exile13
Exile1327-Aug-19 06:20 PM
whats the command to check(edited)
git show-branch ?
returns
[master] Remove CFEK cluster for testing iguana changes.
still i see CHMEX and me almost constantly at the top
so there is still a degree of competitiveness
blackjok3r27-Aug-19 09:37 PM
yes most definatly.
Alright27-Aug-19 10:16 PM
have been slacking lately as I'll start debugging something then forget to put the NN back into a normal state when I'm done
done it like 10x now
smk762 - dracocanis ominator28-Aug-19 03:56 AM
I've reduced graph history from 24 to 12hrs to make it load a bit faster. Will implement better caching later when time is spare (at the moment, every load reads the oracle(s)).


Barcode Scanner 4.5.2
The official Android app of the open source ZXing project:
http://github.com/zxing/zxing
Barcode Scanner uses the camera on your phone to read barcodes and look up product information such as prices and reviews.
It also reads 2D barcodes such as QR Codes and Data Matrix. These can contain links to web sites, contact information such as phone numbers and email addresses, and more.


|
BitShares-Core
6.1.0
BitShares blockchain implementation and command-line interface software
|
Used to forward declare value types. More...
#include <fwd.hpp>
Public Member Functions | |
| template<typename U > | |
| fwd (U &&u) | |
| template<typename U , typename V > | |
| fwd (U &&u, V &&v) | |
| template<typename U , typename V , typename X , typename Y > | |
| fwd (U &&u, V &&v, X &&, Y &&) | |
| fwd () | |
| fwd (const fwd &f) | |
| fwd (fwd &&f) | |
| operator const T & () const | |
| operator T & () | |
| T & | operator* () |
| const T & | operator* () const |
| const T * | operator-> () const |
| T * | operator-> () |
| bool | operator! () const |
| template<typename U > | |
| T & | operator= (U &&u) |
| T & | operator= (fwd &&u) |
| T & | operator= (const fwd &u) |
| ~fwd () | |
| template<typename T , unsigned int S, typename A > | |
| fwd (const fwd< T, S, A > &f) | |
| template<typename T , unsigned int S, typename A > | |
| fwd (fwd< T, S, A > &&f) | |
Used to forward declare value types.
| fc::fwd< T, S, A >::fwd | ( | U && | u | ) |
Definition at line 64 of file fwd_impl.hpp.
| fc::fwd< T, S, A >::fwd | ( | U && | u, |
| V && | v | ||
| ) |
Definition at line 71 of file fwd_impl.hpp.
| fc::fwd< T, S, A >::fwd | ( | U && | u, |
| V && | v, | ||
| X && | x, | ||
| Y && | y | ||
| ) |
Definition at line 77 of file fwd_impl.hpp.
Definition at line 84 of file fwd_impl.hpp.
| fc::fwd< T, S, Align >::fwd | ( | const fwd< T, S, Align > & | f | ) |
| fc::fwd< T, S, Align >::fwd | ( | fwd< T, S, Align > && | f | ) |
Definition at line 118 of file fwd_impl.hpp.
| fc::fwd< T, S, Align >::fwd | ( | const fwd< T, S, A > & | f | ) |
Definition at line 89 of file fwd_impl.hpp.
| fc::fwd< T, S, Align >::fwd | ( | fwd< T, S, A > && | f | ) |
Definition at line 94 of file fwd_impl.hpp.
| fc::fwd< T, S, A >::operator const T & | ( | ) | const |
Definition at line 104 of file fwd_impl.hpp.
| fc::fwd< T, S, Align >::operator T& | ( | ) |
| bool fc::fwd< T, S, A >::operator! | ( | ) | const |
Definition at line 56 of file fwd_impl.hpp.
| T & fc::fwd< T, S, A >::operator* | ( | ) |
Definition at line 107 of file fwd_impl.hpp.
| const T & fc::fwd< T, S, A >::operator* | ( | ) | const |
Definition at line 109 of file fwd_impl.hpp.
| const T * fc::fwd< T, S, A >::operator-> | ( | ) | const |
Definition at line 111 of file fwd_impl.hpp.
| T * fc::fwd< T, S, A >::operator-> | ( | ) |
Definition at line 114 of file fwd_impl.hpp.
| T & fc::fwd< T, S, A >::operator= | ( | U && | u | ) |
Definition at line 123 of file fwd_impl.hpp.
| T& fc::fwd< T, S, Align >::operator= | ( | fwd< T, S, Align > && | u | ) |
| T& fc::fwd< T, S, Align >::operator= | ( | const fwd< T, S, Align > & | u | ) |


{% extends "template.html" %} {% block content %}
Welcome back,
You have successfully authenticated against your Okta org, and have been redirected back to this application.
Visit My Profile in this application to view your secure personal profile.
This example combines the power of Okta's world class identity and access management technology with the convenience of machine learning driven facial recognition.
Your face will be automatically detected and recognised when you sign in. Machine learning facial recognition algorithms identify your face and automatically inserts your user ID into the login screen.
It's ok if you are not recognised by the system. You'll be given the choice of either entering your user ID or signing up for a new account.
You have the choice to upload your photo when you sign up or you can come back later and upload your photo when it's convenient.
So remember to smile when you sign in to our new customer portal.
{% endif %} {% endblock content %}


Find a bus near Lane Tech
Search
View Routes
Add Route
Western (Northbound)
Western (Southbound)
Addison (Eastbound)
Addison (Westbound)
Find Busses
View Current Routes
Add Stop


Wikipedia states that responsive web design is an approach aimed at crafting sites to provide an optimal viewing and interaction experience across a wide range of devices (from desktop computer monitors to mobile phones). Basically put, a website that works on any size screen.
Responsive websites are important given the range of mobile devices these days and people opting to use them for browsing the web.
Mobile first design is where you initially design the site to fit a mobile device such as a smart phone. Then @media queries are added so that we can adjust content of a page based on the screen size.
Through practice it's easy to see why we do mobile first design as it gets more complicated to manipulate a page from a desktop design down to a mobile sized site. It also helps you make important decisions about structuring your content.
Frameworks in this context is a set structure of files and folders of standardised code that can be used as a foundation to start buildind a site.
Frameworks save alot of time as we don't have to start from scratch. It also takes care of cross-browser functionality so we don't have to worry about browser specific bugs. It gives you clean code so that you can easily identify elements and layouts. Most of off, frameworks are free to use.
However there are some restrictions with frameworks. You're restiction to that set of grids and code and it limits what you can design. If you really need to customise something then you can change it but it requires extra effort and time. During this process you will often discover that code that you don't need and it can take up alot of time.
A wireframe illustrates the skeleton of a website. It is also known as a screen blueprint that guides the development and design of a webpage.
Below are the boxified wireframes I developed to start the redesign of my website. As I started the redesign I found some aspects to be unncessary and/or didn't look right, and a feature or two I needed to better describe the content. Overall, I accomplished the majority of what I wanted to achieve.
max-width
and width
for the containter but I realised that too far down the track. If I had of followed that boxified wireframe I would have been able to solve this problem earlier
.row.column
- Through practice I now realise the true value of boxifying especially for the layout of the sire. The grid makes it easier to understand and apply however I was stumped at times because there were options to use the 12 grid base or thirds, even halves. I switched between them and am not sure how this affects the site. Seems to be fine.
Blog links


As we all know by now, loops are arguably one of the most useful tools we have at our disposal for creating functions.  For example, both have a method called "while" that continues the loop as long as a condition is still true. Here we have Ruby on the left, and JavaScript on the right. As you can see, both have pretty similar logic, but the syntax is slightly different.
Now let's move on to "for" loops. This is where we start to see a difference between Ruby and JavaScript. In JavaScript, our "for" loops are really limited to the same sort of counter logic, where we have a variable set to a certain integer, and we either add or remove from that integer to continue the loop. However, JavaScript gives us a convenient single-line syntax to do this with. In Ruby, we can do a similar logic, but using a range of numbers from x..y. As you can see, both languages again have similar logic, with slightly different syntax. However, Ruby allows for a bit more flexibility in "for" loops. We can tell it to loop through each item in the array simply by defining what we're looking for.
In addition to this flexibility, Ruby also gives us an extra method called "until" that works similarly to while, but instead of operating the loop so long as the condition is true, it will continue the loop so long as the condition is false. Hopefully now you can see the similarities and differences between Ruby loops and JavaScript loops. Try them out!


RT @HipsterMermaid: Asking how to link your Google+ to Facebook is like asking how to link your iPhone to the paper cups and string you ...
8/1/2011, 4:26:55 PM
Favs: 0
Retweets: 0
link--- layout: tweet ---
RT @HipsterMermaid: Asking how to link your Google+ to Facebook is like asking how to link your iPhone to the paper cups and string you ...
8/1/2011, 4:26:55 PM
Favs: 0
Retweets: 0
link


NobleScene
An abstract scene class.
Do not copy this file as a template for your scenes. Instead, your scenes will extend this class.
See templates/SceneTemplate.lua for a blank scene that you can copy and modify for your own scenes.
If you are using NobleEngine-ProjectTemplate,
see scenes/ExampleScene.lua
for an implementation example.
Usage
YourSceneName = {} class("YourSceneName").extends(NobleScene)
Properties
- NobleScene.name
-
The name of this scene. Optional.
If you do not set this value, it will take on the scene's
className
. - NobleScene.backgroundColor
- This is the background color of this scene.
Tables
- NobleScene.inputHandler
-
All scenes have a default inputHandler which is made active when the scene starts.
If you do not define your scene's inputHandler, it is
nil
and input is disabled when this scene starts.See
Usage
YourSceneName.inputHandler = { AButtonDown = function() end, -- Fires once when button is pressed down. AButtonHold = function() end, -- Fires each frame while a button is held (Noble Engine implementation). AButtonHeld = function() end, -- Fires once after button is held for 1 second (available for A and B). AButtonUp = function() end, -- Fires once when button is released.  } -- OR... -- Use a non-scene-specific inputHandler, defined elsewhere. YourSceneName.inputHandler = somePreviouslyDefinedInputHandler -- OR... -- Reuse another scene's inputHandler. YourSceneName.inputHandler = SomeOtherSceneName.inputHandler
- NobleScene.sprites
-
When you add a sprite to your scene, it is put in this table so the scene can keep track of it.
This is intended as
read-only
. You should not modify this table directly.See
Methods
- NobleScene:addSprite(__sprite)
-
Use this to add sprites to your scene instead of
playdate.graphics.sprite:add()
Sprites not manually removed before transitioning to another scene are automatically removed in finish.Parameters
- __sprite
playdate.graphics.sprite
The sprite to add to the scene.
- __sprite
playdate.graphics.sprite
- NobleScene:removeSprite(__sprite)
-
Use this to remove sprites from your scene instead of
playdate.graphics.sprite:remove()
Sprites not manually removed before transitioning to another scene are automatically removed in finish.Parameters
- __sprite
playdate.graphics.sprite
The sprite to add to the scene.
- __sprite
playdate.graphics.sprite
Callbacks
- NobleScene:init()
-
Implement this in your scene if you have code to run when your scene's object is created.
Usage
function YourSceneName:init() YourSceneName.super.init(self) --[Your code here]-- end
- NobleScene:enter()
-
Implement if you want to run code as the transition to this scene begins, such as UI animation, triggers, etc.
Usage
function YourSceneName:enter() YourSceneName.super.enter(self) --[Your code here]-- end
- NobleScene:start()
-
Implement if you have code to run once the transition to this scene is complete. This method signifies the full activation of a scene. If this scene's inputHandler is defined, it is enabled now.
See
Usage
function YourSceneName:start() YourSceneName.super.start(self) --[Your code here]-- end
- NobleScene:update()
-
Implement to run scene-specific code on every frame while this scene is active.
NOTE: you may use coroutine.yield() here, because it only runs inside of playdate.update(), which is a coroutine.
Usage
function YourSceneName:update() YourSceneName.super.update(self) --[Your code here]-- end
- NobleScene:drawBackground()
-
Implement this function to draw background visual elements in your scene. This runs every frame.
Usage
function YourSceneName:drawBackground() YourSceneName.super.drawBackground(self) --[Your code here]-- end
- NobleScene:exit()
-
Implement this in your scene if you have "goodbye" code to run when a transition to another scene
begins, such as UI animation, saving to disk, etc.
Usage
function YourSceneName:exit() YourSceneName.super.exit(self) --[Your code here]-- end
- NobleScene:finish()
-
Implement this in your scene if you have code to run when a transition to another scene
is complete, such as resetting variables.
Usage
function YourSceneName:finish() YourSceneName.super.finish(self) --[Your code here]-- end
- NobleScene:pause()
-
pause()
/resume()
Implement one or both of these in your scene if you want something to happen when the game is paused/unpaused by the system. The Playdate SDK does not require you to write pause logic, but these are useful if you want a custom menu image (see Playdate SDK for more details), want to obscure game elements to prevent players from cheating in a time-sensitive game, want to count the number of times the player pauses the game, etc.
Usage
function YourSceneName:pause() YourSceneName.super.pause(self) --[Your code here]-- end
- NobleScene:resume()
-
Usage
function YourSceneName:resume() YourSceneName.super.resume(self) --[Your code here]-- end


You must save the details on this page or risk losing funds sent or allocated to this wallet address.
I understand, I will save the details on this page!
Cancel
Please read about wallet basics!
Please read our wallet basics documentation before proceeding to create your wallet.
When you've done this, come back and re-create your QRL wallet.
Okay
Whoa there buddy!!
Security Notice
You have opted to save an insecure wallet file. This means your Mnemonic Phrase and Hexseed will be saved in plain text. If anyone ever gets this file, they will have full access to all Quanta and Tokens associated with this wallet. It is strongly recommended to save a secure wallet file unless you are absolutely sure you know what you're doing.
I understand the risks, save the insecure file!
Cancel
Your new wallet details
Security Notice
The details shown below are private, and should never be shared with anyone! You should write these details down, and store them in a secure location to ensure no losses are incurred.
QRL Address
{{# if bech32}}{{newAddress.addressB32}}{{else}}{{newAddress.address}}{{/if}}