Classes | |
| struct | axutil_allocator |
| Axis2 memory allocator. More... | |
Defines | |
| #define | AXIS2_MALLOC(allocator, size) ((allocator)->malloc_fn(allocator, size)) |
| #define | AXIS2_REALLOC(allocator, ptr, size) ((allocator)->realloc(allocator, ptr, size)) |
| #define | AXIS2_FREE(allocator, ptr) ((allocator)->free_fn(allocator, ptr)) |
Typedefs | |
| typedef struct axutil_allocator | axutil_allocator_t |
| Axis2 memory allocator. | |
Functions | |
| AXIS2_EXTERN axutil_allocator_t * | axutil_allocator_init (axutil_allocator_t *allocator) |
| AXIS2_EXTERN void | axutil_allocator_free (axutil_allocator_t *allocator) |
| AXIS2_EXTERN void | axutil_allocator_switch_to_global_pool (axutil_allocator_t *allocator) |
| AXIS2_EXTERN void | axutil_allocator_switch_to_local_pool (axutil_allocator_t *allocator) |
| typedef struct axutil_allocator axutil_allocator_t |
Axis2 memory allocator.
Encapsulator for memory allocating routines
| AXIS2_EXTERN void axutil_allocator_free | ( | axutil_allocator_t * | allocator | ) |
This function should be used to deallocate memory if the default allocator was provided by the axutil_allocator_init() call.
| allocator | allocator struct to be freed |
| AXIS2_EXTERN axutil_allocator_t* axutil_allocator_init | ( | axutil_allocator_t * | allocator | ) |
Initializes (creates) a memory allocator.
| allocator | user defined allocator. If NULL, a default allocator will be returned. |
| AXIS2_EXTERN void axutil_allocator_switch_to_global_pool | ( | axutil_allocator_t * | allocator | ) |
Swaps the local_pool and global_pool and makes the global pool the current pool. In case of using pools, local_pool is supposed to hold the pool out of which local values are allocated. In case of values that live beyond a request global pool should be used, hence this method has to be called to switch to global pool for allocation.
| allocator | allocator whose memory pools are to be switched |
| AXIS2_EXTERN void axutil_allocator_switch_to_local_pool | ( | axutil_allocator_t * | allocator | ) |
Swaps the local_pool and global_pool and makes the local pool the current pool. In case of using pools, local_pool is supposed to hold the pool out of which local values are allocated. In case of values that live beyond a request global pool should be used. This method can be used to inverse the switching done by axutil_allocator_switch_to_global_pool, to start using the local pool again.
| allocator | allocator whose memory pools are to be switched |


|
OPAE C API
-..
FPGA API
|
#include </root/samples/hssi/hssi_cmd.h>
Public Member Functions | |
| hssi_cmd () | |
| uint64_t | mac_bits_for (std::string addr) const |
| void | run_process (const std::string &proc) |
| void | show_eth_stats (const std::string ð) |
| void | enable_eth_loopback (const std::string ð, bool enable) |
| template<typename X > | |
| std::string | int_to_hex (X x) const |
| void | stop () |
Protected Attributes | |
| bool | running_ |
Definition at line 38 of file hssi_cmd.h.
|
inline |
Definition at line 41 of file hssi_cmd.h.
|
inline |
Definition at line 45 of file hssi_cmd.h.
References INVALID_MAC.
Referenced by hssi_100g_cmd::run(), and hssi_10g_cmd::run().
|
inline |
Definition at line 58 of file hssi_cmd.h.
Referenced by enable_eth_loopback(), and show_eth_stats().
|
inline |
Definition at line 70 of file hssi_cmd.h.
References run_process().
Referenced by hssi_100g_cmd::run(), and hssi_10g_cmd::run().
|
inline |
Definition at line 76 of file hssi_cmd.h.
References run_process(), and usleep().
Referenced by hssi_100g_cmd::run(), and hssi_10g_cmd::run().
|
inline |
Definition at line 88 of file hssi_cmd.h.
Referenced by hssi_100g_cmd::print_registers(), and hssi_10g_cmd::print_registers().
|
inline |
Definition at line 98 of file hssi_cmd.h.
References running_.
|
protected |
Definition at line 104 of file hssi_cmd.h.
Referenced by hssi_10g_cmd::run(), and stop().


WITNESS LIST
Higher Education Formula Funding, Interim
February 27, 2018 8:00 AM
Higher Education Funding
Registering, but not testifying:
ON:
Keyton, Sarah (Legislative Budget Board), Austin, TX
Higher Education Non-Formula Funding
ON:
Duncan, Robert (also providing written testimony) (Texas Tech University System),
Lubbock, TX
Higher Education/Non-Formula Items
ON:
McCall, Brian Chancellor (Texas State University System), Austin, TX
Non-Formula Funding
ON:
Shipley, Suzanne (also providing written testimony) (Midwestern State University),
Wichita Falls, TX
Non-Formula Higher Education Funding
ON:
Sharp, John (also providing written testimony) (Texas A&M University System), College
Station, TX
Non-Formula Items
ON:
Khator, Renu (also providing written testimony) (University of Houston System),
Houston, TX
Non-Formula Support
ON:
Lane, Austin A. (also providing written testimony) (Texas Southern University), Houston,
TX
McRaven, William H. (also providing written testimony) (The University of Texas
System), Austin, TX
Roe, Lesa (also providing written testimony) (University of North Texas System), Dallas,
TX
Registering, but not testifying:
ON:
Brown, Bob (University of North Texas System), Dallas, TX
Non-Formula Support Items
ON:
Pattillo, Dr. Baker (also providing written testimony) (Stephen F. Austin State University),
Nacogdoches, TX
Overview
ON:
Hernandez, Demetrio (also providing written testimony) (LBB), Austin, TX
WITNESS LIST
Higher Education Formula Funding, Interim
February 27, 2018 8:00 AM
Texas Woman's University
ON:
Feyton, Carine (also providing written testimony) (Texas Woman's University), Denton,
TX


{% extends 'main/base.html' %} {% load static %} {% block content %}
{{name}}
Please give a description of what your notebook does, which data sources it uses etc. You can format this text using Markdown.
Tags make your notebook more discoverable as people can search & screen for them.
Please specify the data sources your notebook uses. This makes it easier for people to find notebooks relevant for them.


9-year-old on track to graduate from university in December
EINDHOVEN, Netherlands -- A child prodigy from Belgium is on course to gain a bachelor's degree at 9 years old.
VTM reports Laurent Simons is studying electrical engineering at the Eindhoven University of Technology, a tough course even for students of an average graduate age.
Simons plans to embark on a PhD program in electrical engineering, while also studying for a medical degree when he graduates in December.
REALTED:
Ameerah Jackson, 11-year-old music prodigy from Missouri City, releases first song online
4-year-old cheerleading prodigy stuns millions online
11-year-old student started classes this week at Southern University


lala(1f) - interpret matrix expressions using a shell-like interface
lala [expression(s)] | [ --help| --version]
lala(1) is an interactive computer program that serves as a convenient
"laboratory" for computations involving matrices. It provides easy
access to matrix software developed by the LINPACK and EISPACK
projects. The capabilities range from standard tasks such as solving
simultaneous linear equations and inverting matrices, through symmetric
and nonsymmetric eigenvalue problems, to fairly sophisticated matrix
tools such as the singular value decomposition.
--help display this help and exit
--version output version information and exit
expression(s) if expressions are supplied they are evaluated and the
program terminates.
This is heavily based on a program from the Department of Computer
Science, University of New Mexico, by Cleve Moler.
Sample commands
# Example 1: introductory usage:
lala
a=<1 2 3;5 4 6;7 8 9>
b=<5;6;7>
a*b
b*a
det(a)
quit
An explanation of Example 1:
// For this session the <> character is the LALA prompt.
<> A=<1 2 3;5 4 6;7 8 9> <--- you enter this
A = <--- LALA response
1. 2. 3.
5. 4. 6.
7. 8. 9.
<> b=<5;6;7>
b =
5.
6.
7.
<> A*b <--- you enter "multiply A and b"
ANS = <--- LALA response
38.
91.
146.
<> b*A <---you enter "multiply b and A"
/--ERROR <--- LALA response
INCOMPATIBLE FOR MULTIPLICATION
<> det(A) <--- Take the determinant of A
ANS = <---LALA response
18.
<> quit <--- you quit LALA
total flops 34
ADIOS
// --------------------------------------
Example 2: Simple looping and conditionals are also available
lala
//Eigenvalue sensitivity example. See section 8 of the Users' Guide.
B = <3 0 7; 0 2 0; 0 0 1>
L = <1 0 0; 2 1 0; -3 4 1>, M = L\L'
A = M*B/M
A = round(A)
<X,D> = eig(A)
long, diag(D), short
cond(X)
X = X/diag(X(3,:)), cond(X)
Y = inv(X'), Y'*A*X
for j = 1:3, c(j) = norm(Y(:,j))*norm(X(:,j));
C
E = -1.e-6*Y(:,1)*X(:,1)'
eig(A + .4*E), eig(A + .5*E)
r = .4; s = .5;
while s-r > 1.e-14, t = (r+s)/2; d = eig(A+t*E); ...
if imag(d(1))=0, r = t; else, s = t;
long, t = r
A+t*e, eig(A+t*E)
<X,D> = eig(A+t*E); X = X/diag(X(3,:))
short, cond(X)
// --------------------------------------
Use the HELP command for further information.
For example, to enter HELP on the entire manual,
display directions for using HELP and
place a User manual in the file "lala.userguide.txt",
enter
lala
<>help manual
continue ...
h // show directions for using "help"
w lala.userguide.txt
continue ...
q
quit
subroutine setup()
help_text=[ CHARACTER(LEN=128) :: &
'NAME',&
' lala(1f) - interpret matrix expressions using a shell-like interface',&
'',&
'SYNOPSIS',&
' lala [expression(s)] | [ --help| --version]',&
'',&
'DESCRIPTION',&
' lala(1) is an interactive computer program that serves as a convenient',&
' "laboratory" for computations involving matrices. It provides easy',&
' access to matrix software developed by the LINPACK and EISPACK',&
' projects. The capabilities range from standard tasks such as solving',&
' simultaneous linear equations and inverting matrices, through symmetric',&
' and nonsymmetric eigenvalue problems, to fairly sophisticated matrix',&
' tools such as the singular value decomposition.',&
'',&
'OPTIONS',&
' --help display this help and exit',&
' --version output version information and exit',&
' expression(s) if expressions are supplied they are evaluated and the',&
' program terminates.',&
'',&
'AUTHOR',&
' This is heavily based on a program from the Department of Computer',&
' Science, University of New Mexico, by Cleve Moler.',&
'',&
'EXAMPLES',&
' Sample commands',&
'',&
' # Example 1: introductory usage:',&
' lala',&
' a=<1 2 3;5 4 6;7 8 9>',&
' b=<5;6;7>',&
' a*b',&
' b*a',&
' det(a)',&
' quit',&
'',&
' An explanation of Example 1:',&
'',&
' // For this session the <> character is the LALA prompt.',&
' <> A=<1 2 3;5 4 6;7 8 9> <--- you enter this',&
' A = <--- LALA response',&
' 1. 2. 3.',&
' 5. 4. 6.',&
' 7. 8. 9.',&
' <> b=<5;6;7>',&
' b =',&
' 5.',&
' 6.',&
' 7.',&
'',&
' <> A*b <--- you enter "multiply A and b"',&
'',&
' ANS = <--- LALA response',&
' 38.',&
' 91.',&
' 146.',&
'',&
' <> b*A <---you enter "multiply b and A"',&
' /--ERROR <--- LALA response',&
' INCOMPATIBLE FOR MULTIPLICATION',&
'',&
' <> det(A) <--- Take the determinant of A',&
'',&
' ANS = <---LALA response',&
'',&
' 18.',&
'',&
' <> quit <--- you quit LALA',&
'',&
' total flops 34',&
' ADIOS',&
' // --------------------------------------',&
'',&
' Example 2: Simple looping and conditionals are also available',&
'',&
' lala',&
' //Eigenvalue sensitivity example. See section 8 of the Users'' Guide.',&
' B = <3 0 7; 0 2 0; 0 0 1>',&
' L = <1 0 0; 2 1 0; -3 4 1>, M = L\L''',&
' A = M*B/M',&
' A = round(A)',&
' <X,D> = eig(A)',&
' long, diag(D), short',&
' cond(X)',&
' X = X/diag(X(3,:)), cond(X)',&
' Y = inv(X''), Y''*A*X',&
' for j = 1:3, c(j) = norm(Y(:,j))*norm(X(:,j));',&
' C',&
' E = -1.e-6*Y(:,1)*X(:,1)''',&
' eig(A + .4*E), eig(A + .5*E)',&
' r = .4; s = .5;',&
' while s-r > 1.e-14, t = (r+s)/2; d = eig(A+t*E); ...',&
' if imag(d(1))=0, r = t; else, s = t;',&
' long, t = r',&
' A+t*e, eig(A+t*E)',&
' <X,D> = eig(A+t*E); X = X/diag(X(3,:))',&
' short, cond(X)',&
' // --------------------------------------',&
'',&
' Use the HELP command for further information.',&
' For example, to enter HELP on the entire manual,',&
' display directions for using HELP and',&
' place a User manual in the file "lala.userguide.txt",',&
' enter',&
'',&
' lala',&
' <>help manual',&
' continue ...',&
' h // show directions for using "help"',&
' w lala.userguide.txt',&
' continue ...',&
' q',&
' quit',&
'']
!>
!!##NAME
!! lala(1f) - interpret matrix expressions using a shell-like interface
!!
!!##SYNOPSIS
!!
!! lala [expression(s)] | [ --help| --version]
!!
!!##DESCRIPTION
!! lala(1) is an interactive computer program that serves as a convenient
!! "laboratory" for computations involving matrices. It provides easy
!! access to matrix software developed by the LINPACK and EISPACK
!! projects. OPTIONS
!! --help display this help and exit
!! --version output version information and exit
!! expression(s) if expressions are supplied they are evaluated and the
!! program terminates.
!!
!!##AUTHOR
!! This is heavily based on a program from the Department of Computer
!! Science, University of New Mexico, by Cleve Moler.
!!
!!##EXAMPLES
!!
!! Sample commands
!!
!!  An explanation of Example 1:
!!
!! // For this session the <> character is the LALA prompt.
!! <> A=<1 2 3;5 4 6;7 8 9> <--- you enter this
!! A = <--- LALA response
!! 1. 2. 3.
!! 5. 4. 6.
!! 7. 8. 9.
 5.
!! 6.
!! 7.
 ANS = <--- LALA response
!! 38.
!! 91.
 /--ERROR <--- LALA response
!!  ANS = <---LALA response
!!
!! 18.
 ADIOS
!! // --------------------------------------
!!
!! Example 2: Simple looping and conditionals are also available
!!
!! lala
!! //Eigenvalue sensitivity example. See section 8 of the Users' Guide.
!! B = <3 0 7; 0 2 0; 0 0 1>
!! L = <1 0 0; 2 1 0; -3 4 1>, M = L\L'
!! A = M*B/M
!!  X = X/diag(X(3,:)), cond(X)
!! Y = inv(X'), Y'*A*X
!! for j = 1:3, c(j) = norm(Y(:,j))*norm(X(:,j));
!! C
!!  A+t*e, eig(A+t*E)
!! <X,D> = eig(A+t*E); X = X/diag(X(3,:))
!! short, cond(X)
!! // --------------------------------------
!!
!! Use the HELP command for further information.
!!


No longer actively maintained. I am not interested to maintain jQuery plugins anymore. If you have some fixes, feel free to make PR.
Responsive, lightweight, fast, synchronized with CSS animations, fully customizable modal window plugin with declarative configuration and hash tracking.
lt-ie9
class to the html
element, as modernizr does.Download the latest version from GitHub or via package managers:
npm install remodal
bower install remodal
Include the CSS files from the dist folder in the head section:
<link rel="stylesheet" href="../dist/remodal.css">
<link rel="stylesheet" href="../dist/remodal-default-theme.css">
Include the JS file from the dist folder before the
:

You can define the background container for the modal(for effects like a blur). It can be any simple content wrapper:

...Page content...

And now create the modal dialog:

<button data-remodal-action="close" class="remodal-close"></button>

Remodal

Responsive, lightweight, fast, synchronized with CSS animations, fully customizable modal window plugin with declarative configuration and hash tracking.

<button data-remodal-action="cancel" class="remodal-cancel">Cancel</button>
<button data-remodal-action="confirm" class="remodal-confirm">OK</button>

Don't use the id
attribute, if you want to avoid the anchor jump, use data-remodal-id
.
So, now you can call it with the hash:
Call the modal with data-remodal-id="modal"
Or:
Call the modal with data-remodal-id="modal"
You can pass additional options with the data-remodal-options
attribute.

<button data-remodal-action="close" class="remodal-close"></button>

Remodal

Responsive, lightweight, fast, synchronized with CSS animations, fully customizable modal window plugin with declarative configuration and hash tracking.

<button data-remodal-action="cancel" class="remodal-cancel">Cancel</button>
<button data-remodal-action="confirm" class="remodal-confirm">OK</button>

Default: true
To open the modal without the hash, use the data-remodal-target
attribute.
Call the modal with data-remodal-id="modal"
Default: true
If true, closes the modal window after clicking the confirm button.
Default: true
If true, closes the modal window after clicking the cancel button.
Default: true
If true, closes the modal window after pressing the ESC key.
Default: true
If true, closes the modal window by clicking anywhere on the page.
Default: ''
Modifier CSS classes for the modal that is added to the overlay, modal, background and wrapper (see CSS).
Default: document.body

Base HTML class for your modals. CSS theme should be updated to reflect this.
Extends the default settings.
Do not set the 'remodal' class, if you prefer a JS initialization.

<button data-remodal-action="close" class="remodal-close"></button>

Remodal

Responsive, lightweight, fast, synchronized with CSS animations, fully customizable modal window plugin with declarative configuration and hash tracking.

Get the instance of the modal and call a method:
var inst = $('[data-remodal-id=modal]').remodal();
/**
* Opens the modal window
*/
inst.open();
/**
* Closes the modal window
*/
inst.close();
/**
* Returns a current state of the modal
* @returns {'closed'|'closing'|'opened'|'opening'}
*/
inst.getState();
/**
* Destroys the modal window
*/
inst.destroy();
$(document).on('opening', '.remodal', function () {
console.log('Modal is opening');
});
$(document).on('opened', '.remodal', function () {
console.log('Modal is opened');
});
$(document).on('closing', '.remodal', function (e) {
// Reason: 'confirmation', 'cancellation'
console.log('Modal is closing' + (e.reason ? ', reason: ' + e.reason : ''));
});
$(document).on('closed', '.remodal', function (e) {
// Reason: 'confirmation', 'cancellation'
console.log('Modal is closed' + (e.reason ? ', reason: ' + e.reason : ''));
});
$(document).on('confirmation', '.remodal', function () {
console.log('Confirmation button is clicked');
});
$(document).on('cancellation', '.remodal', function () {
console.log('Cancel button is clicked');
});
.remodal
– the default class of modal dialogs.
.remodal-wrapper
– the additional wrapper for the .remodal
, it is not the overlay and used for the alignment.
.remodal-overlay
– the overlay of modal dialogs, it is under the wrapper.
.remodal-bg
– the background of modal dialogs, it is under the overlay and usually it is the wrapper of your content. You should add it on your own.
The remodal
prefix can be changed in the global settings. See the NAMESPACE
option.
States are added to the .remodal
, .remodal-overlay
, .remodal-bg
, .remodal-wrapper
classes.
List:
.remodal-is-opening
.remodal-is-opened
.remodal-is-closing
.remodal-is-closed
A modifier that is specified in the options is added to the .remodal
, .remodal-overlay
, .remodal-bg
, .remodal-wrapper
classes.
Remodal has wrappers that make it easy to use with other javascript libraries:
The MIT License (MIT)
Copyright (c) 2015 Ilya Makarov
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
 IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.


This function takes a latitude/longitude coordinate pair alongside a desired
distance to map and retrieves USGS (and optionally ESRI) map data, converts
said data into matrices, and runs the data through rayshader
using
sensible defaults in order to return a 2D shaded map relief. It requires a
functioning internet connection in order to retrieve data.
automap( lat = NULL, lng = NULL, distance = 10, method = c("2d", "3d"), img.width = 600, img.height = 600, overlay = NULL, z = 9, overlay.alpha = 0.75, colorscale = "imhof4", color.intensity = 1, max.darken = 0.5, sun.angle = 315, sun.altitude = 45, water.cutoff = 0.999, water.min.area = length(heightmap)/400, water.max.height = NULL, solid = TRUE, shadow = TRUE, water = FALSE, waterdepth = 0, theta = 45, phi = 45, fov = 0, zoom = 1, save.file = c(FALSE, "tif", "png", TRUE), from.file = c(FALSE, "tif", "png", TRUE), tif.filename = NULL, png.filename = NULL, dist.unit = c("km", "miles", "m", "ft"), coord.unit = c("degrees", "radians"), sr_bbox = 4326, sr_image = 4326, print.map = TRUE )
| lat | The latitude for the map's centroid, in decimal degrees or radians. |
|---|---|
| lng | The longitude for the map's centroid, in decimal degrees or radians. |
| distance | The distance between the centroid and any corner of the (square) output map to include. |
| method | Should a 2d or 3d plot be produced? |
| img.width | Image width, in pixels |
| img.height | Image height, in pixels |
| overlay | ESRI overlay map to include, if any -- see
|
| z | zscale, passed to various rayshader functions. Defined as the ratio between the x and y spacing (which are assumed to be equal) and the z axis. For contiguous United States, USGS data is generally available at a ~9 meter spacing, with elevation provided in meter increments, resulting in a z value of 9 returning roughly representative maps; decrease this value to exaggerate elevation features. |
| overlay.alpha | Alpha value for the optional overlay layer. |
| colorscale | Color scale for land and water elements. If a vector of length 1, the same color scale will be applied for both land and water. If greater than length 1, values named "water" or "watercolor" will be used for water coloring, while "land" or "landcolor" will be used for land. |
| color.intensity | Intensity of color mapping -- higher values result in more intense colors. |
| max.darken | Passed to |
| sun.angle | Angle around the matrix from which lights originate. Values line up with compass directions -- so 0 is directly North, while the default 315 places the sun in the Northwest. |
| sun.altitude | Angle in degrees from horizon from which light originates. Bounded [0, 90]. |
| water.cutoff | Passed to |
| water.min.area | Passed to |
| water.max.height | Passed to |
| solid | Logical -- should the output be rendered as a solid
( |
| shadow | Logical -- should shadows be rendered? |
| water | Logical -- should water be rendered? |
| waterdepth | Water level. |
| theta | Rotation around z axis. |
| phi | Azimuth angle. |
| fov | Field of view angle. |
| zoom | Zoom factor. |
| save.file | Should the heightmap ( |
| from.file | Should the map be built from local |
| tif.filename | If |
| png.filename | If |
| dist.unit | Units for the distance argument. All units are converted to kilometers, with some errors in the transition due to floating point arithmetic -- so if high accuracy is needed, convert units to kilometers beforehand. |
| coord.unit | Units for latitude and longitude, in either decimal degrees or radians. |
| sr_bbox | Spatial reference code (ISO 19111) for bounding box |
| sr_image | Spatial reference code (ISO 19111) for image |
| print.map | Logical -- should the output map be printed? |
A rayshader map object, by default printed and returned invisibly.
Archuleta, C.M., Constance, E.W., Arundel, S.T., Lowe, A.J., Mantey, K.S., and Phillips, L.A., 2017, The National Map seamless digital elevation model specifications: U.S. Geological Survey Techniques and Methods, book 11, chap. B9, 39 p., https://doi.org/10.3133/tm11B9
if (FALSE) { automap(44.121268, -73.903734) automap(44.121268, -73.903734, overlay = "World_Imagery") automap(44.121268, -73.903734, overlay = "World_Imagery", method = "3d") }


Sticky Mode
Syntax
var exp = new ApgExp(pattern, "g");
The pattern match attempt is made at the index, exp.lastIndex. The user can set exp.lastIndex to any value prior to the match attempt. If a match is not found exp.lastIndex the attempt fails and returns null. In sticky mode if a match is found, exp.lastIndex is incremented by the length of the matched pattern, or one if the length is zero. (Some patterns allow matches to empty strings. In this case exp.lastIndex is incremented by one to prevent infinite loops and to allow the sticky search to continue.) This allows for an iteration over all consecutive matched patterns in the input string. When the match fails, exp.lastIndex is then reset to zero.
Example 1
var pattern, str, exp, result; pattern = 'pattern = "abc"\n'; exp = new ApgExp(pattern, "y"); str = "---abc---ABC---"; while(result = exp.exec(str)){ console.log("found: " + result[0] + " :at: " + result.index); } console.log("result: null"); /* returns */ result: null
Example 2
var pattern, str, exp, result; pattern = 'pattern = "abc"\n'; exp = new ApgExp(pattern, "y"); exp.lastIndex = 3; str = "---abc---ABC---"; while(result = exp.exec(str)){ console.log("found: " + result[0] + " :at: " + result.index); } console.log("result: null"); /* returns */ found: abc :at: 3 result: null
Example 3
var pattern, str, exp, result; pattern = 'pattern = "abc"\n'; exp = new ApgExp(pattern, "y"); str = "abcABCabc"; while(result = exp.exec(str)){ console.log("found: " + result[0] + " :at: " + result.index); } console.log("result: null"); /* returns */ found: abc :at: 0 found: ABC :at: 3 found: abc :at: 6 result: null


--- layout: page ---
{{ site.resume_header_contact_info }}
{{ job.summary }}
{{ education.summary }}
{{ association.summary }}
{{ publication.venue }} ({{ publication.year }})
Below is the list of programming languages that I enjoy and have used in certain non-trivial projects. Those that I am at hello-world level or feel painful when using will not make it here.
{% for skill in site.data.skills %}{{ award.summary }}
{% endif %}


The biscuit is there! You lunge at it and go through a shop window. Glass shatters everywhere. The biscuit was a mirage! Thine fate awaits in jail. You lose.


Amaranthine JSON Quest Editor
This editor can be used to write quests in the correct format so they can be added to the game.
The specifications come from http://amar.bornofsnails.net/quest_editor.html
General notes
- The JSON output field on the bottom gets updated automatically when the form changes.
It can also be used to update the form (with the update form button).
- In the editor it's also possible to update the JSON directly with the JSON button.
- With the properties button unrequired fields can be removed or added.
On default all possible fields are visible.
The required fields have a * after the field name and can't be removed.
Quest specifications
- To start a new line in a dialog, use
. Don't actually start a new line
or that will be translated as \n in the JSON which won't be interpreted as a new line, but shown in the text!
- To put text in bold in the journal, use bold.
- A quest flag is 'null' when not started yet and should end up at 100 for a successful ending.
Use a bigger number (e.g. 200) for a failed ending.
- All journal entries should be removed at the end with the 'remove journal' event.
- When done with a dialog the 'clear entry' event should be used to update the location's list of quest entries.
- Be careful with comparisons. If you require a skill to be = 10, it won't work if they are not exactly level 10...


A high-throughput, low-latency replicated log service, offering durability, replication and strong consistency as essentials for building reliable real-time applications.
High Performance
DL is able to provide milliseconds latency on durable writes with a large number of concurrent logs, and handle high volume reads and writes per second from thousands of clients.
Durable and Consistent
Messages are persisted on disk and replicated to store multiple copies to prevent data loss. They are guaranteed to be consistent among writers and readers in terms of strict ordering.
Efficient Fan-in and Fan-out
DL provides an efficient service layer that is optimized for running in a multi- tenant datacenter environment such as Mesos or Yarn. The service layer is able to support large scale writes (fan-in) and reads (fan-out).
Various Workloads
DL supports various workloads from latency-sensitive online transaction processing (OLTP) applications (e.g. WAL for distributed database and in-memory replicated state machines), real-time stream ingestion and computing, to analytical processing.
Multi Tenant
To support a large number of logs for multi-tenants, DL is designed for I/O isolation in real-world workloads.
Layered Architecture
DL has a modern layered architecture design, which separates the stateless service tier from the stateful storage tier. To support large scale writes (fan- in) and reads (fan-out), DL allows scaling storage independent of scaling CPU and memory.
Blog
Apache DistributedLog is available under Apache License, version 2.0.


Home
About
Contact
Sign In
Join Now
My Profile
Account
My Bookings
Billing
My Reviews
Notifications
Sign out
Settings
Edit Information
First Name
Last Name
Address
City
State
Zip Code
Phone
Birthday Month
Birthday Year
Email
Username
Password
Save Changes
Be in the know on all travel deals and news
Sign Up


{% load static %}
We use cookies so that our themes work for you. By using our website, you agree to our use of cookies.


Query JavaScript objects with JSONPath expressions. Robust / safe JSONPath engine for Node.js.
import { JSONPath } from '@astronautlabs/jsonpath';
let cities = [
{ name: "London", "population": 8615246 },
{ name: "Berlin", "population": 3517424 },
{ name: "Madrid", "population": 3165235 },
{ name: "Rome", "population": 2870528 }
];
let names = JSONPath.query(cities, '$..name');
// [ "London", "Berlin", "Madrid", "Rome" ]
Install from npm:
$ npm install @astronautlabs/jsonpath
Here are syntax and examples adapted from Stefan Goessner's original post introducing JSONPath in 2007.
| JSONPath | Description |
|---|---|
$ |
The root object/element |
@ |
The current object/element |
. |
Child member operator |
.. |
Recursive descendant operator; JSONPath borrows this syntax from E4X |
* |
Wildcard matching all objects/elements regardless their names |
[] |
Subscript operator |
[,] |
Union operator for alternate names or array indices as a set |
[start:end:step] |
Array slice operator borrowed from ES4 / Python |
?() |
Applies a filter (script) expression via static evaluation |
() |
Script expression via static evaluation |
Given this sample data set, see example expressions below:
{
"store": {
"book": [
{
"category": "reference",
"author": "Nigel Rees",
"title": "Sayings of the Century",
"price": 8.95
}, {
"category": "fiction",
"author": "Evelyn Waugh",
"title": "Sword of Honour",
"price": 12.99
}, {
"category": "fiction",
"author": "Herman Melville",
"title": "Moby Dick",
"isbn": "0-553-21311-3",
"price": 8.99
}, {
"category": "fiction",
"author": "J. R. R. Tolkien",
"title": "The Lord of the Rings",
"isbn": "0-395-19395-8",
"price": 22.99
}
],
"bicycle": {
"color": "red",
"price": 19.95
}
}
}
Example JSONPath expressions:
| JSONPath | Description |
|---|---|
$.store.book[*].author |
The authors of all books in the store |
$..author |
All authors |
$.store.* |
All things in store, which are some books and a red bicycle |
$.store..price |
The price of everything in the store |
$..book[2] |
The third book |
$..book[(@.length-1)] |
The last book via script subscript |
$..book[-1:] |
The last book via slice |
$..book[0,1] |
The first two books via subscript union |
$..book[:2] |
The first two books via subscript array slice |
$..book[?(@.isbn)] |
Filter all books with isbn number |
$..book[?(@.price<10)] |
Filter all books cheaper than 10 |
$..book[?(@.price==8.95)] |
Filter all books that cost 8.95 |
<EMAIL_ADDRESS>&& @.category=="fiction")] |
Filter all fiction books cheaper than 30 |
$..* |
All members of JSON structure |
Find elements in obj
matching pathExpression
. Returns an array of elements that satisfy the provided JSONPath expression, or an empty array if none were matched. Returns only first count
elements if specified.
let authors = jp.query(data, '$..author');
// [ 'Nigel Rees', 'Evelyn Waugh', 'Herman Melville', 'J. R. R. Tolkien' ]
Find paths to elements in obj
matching pathExpression
. Returns an array of element paths that satisfy the provided JSONPath expression. Each path is itself an array of keys representing the location within obj
of the matching element. Returns only first count
paths if specified.
let paths = jp.paths(data, '$..author');
// [
// ['$', 'store', 'book', 0, 'author'] },
// ['$', 'store', 'book', 1, 'author'] },
// ['$', 'store', 'book', 2, 'author'] },
// ['$', 'store', 'book', 3, 'author'] }
// ]
Find elements and their corresponding paths in obj
matching pathExpression
. Returns an array of node objects where each node has a path
containing an array of keys representing the location within obj
, and a value
pointing to the matched element. Returns only first count
nodes if specified.
let nodes = jp.nodes(data, '$..author');
// [
// { path: ['$', 'store', 'book', 0, 'author'], value: 'Nigel Rees' },
// { path: ['$', 'store', 'book', 1, 'author'], value: 'Evelyn Waugh' },
// { path: ['$', 'store', 'book', 2, 'author'], value: 'Herman Melville' },
// { path: ['$', 'store', 'book', 3, 'author'], value: 'J. R. R. Tolkien' }
// ]
Returns the value of the first element matching pathExpression
. If newValue
is provided, sets the value of the first matching element and returns the new value.
Returns the parent of the first matching element.
Runs the supplied function fn
on each matching element, and replaces each matching element with the return value from the function. The function accepts the value of the matching element as its only parameter. Returns matching nodes with their updated values.
let nodes = jp.apply(data, '$..author', function(value) { return value.toUpperCase() });
// [
// { path: ['$', 'store', 'book', 0, 'author'], value: 'NIGEL REES' },
// { path: ['$', 'store', 'book', 1, 'author'], value: 'EVELYN WAUGH' },
// { path: ['$', 'store', 'book', 2, 'author'], value: 'HERMAN MELVILLE' },
// { path: ['$', 'store', 'book', 3, 'author'], value: 'J. R. R. TOLKIEN' }
// ]
Parse the provided JSONPath expression into path components and their associated operations.
let path = jp.parse('$..author');
// [
// { expression: { type: 'root', value: '$' } },
// { expression: { type: 'identifier', value: 'author' }, operation: 'member', scope: 'descendant' }
// ]
Returns a path expression in string form, given a path. The supplied path may either be a flat array of keys, as returned by jp.nodes
for example, or may alternatively be a fully parsed path expression in the form of an array of path components as returned by jp.parse
.
let pathExpression = jp.stringify(['$', 'store', 'book', 0, 'author']);
// "$.store.book[0].author"
This implementation aims to be compatible with Stefan Goessner's original implementation with a few notable exceptions described below.
Script expressions (i.e, (...)
and ?(...)
) are statically evaluated via static-eval rather than using the underlying script engine directly. That means both that the scope is limited to the instance variable (@
), and only simple expressions (with no side effects) will be valid. So for example, ?(@.length>10)
will be just fine to match arrays with more than ten elements, but ?(process.exit())
will not get evaluated since process
would yield a ReferenceError
. This method is even safer than vm.runInNewContext
, since the script engine itself is more limited and entirely distinct from the one running the application code. See more details in the implementation of the evaluator.
This project uses a formal BNF grammar to parse JSONPath expressions, an attempt at reverse-engineering the intent of the original implementation, which parses via a series of creative regular expressions. The original regex approach can sometimes be forgiving for better or for worse (e.g., $['store]
=> $['store']
), and in other cases, can be just plain wrong (e.g. [
=> $
).
As a result of using a real parser and static evaluation, there are some arguable bugs in the original library that have not been carried through here:
step
arguments in slice operators may now be negative.
and @
characters not referring to instance variables$['$']
instead of $.$
)Generated using TypeDoc


fitAlgs.fitAlg module¶
- Author
Dominic Hunt
-
class
fitAlgs.fitAlg.
FitAlg
(fit_sim=None, fit_measure='-loge', fit_measure_args=None, extra_fit_measures=None, bounds=None, boundary_excess_cost=None, boundary_excess_cost_properties=None, bound_ratio=1e-06, calculate_covariance=False, **kwargs)[source]¶ Bases:
object
The abstract class for fitting data
- Parameters
fit_sim (fitAlgs.fitSims.FitSim instance, optional) – An instance of one of the fitting simulation methods. Default
fitAlgs.fitSims.FitSim
fit_measure (string, optional) – The name of the function used to calculate the quality of the fit. The value it returns provides the fitter with its fitting guide. Default
-loge
fit_measure_args (dict, optional) – The parameters used to initialise fit_measure and extra_fit_measures. Default
None
extra_fit_measures (list of strings, optional) – List of fit measures not used to fit the model, but to provide more information. Any arguments needed for these measures should be placed in fit_measure_args. Default
None
bounds (dictionary of tuples of length two with floats, optional) – The boundaries for methods that use bounds. If unbounded methods are specified then the bounds will be ignored. Default is
None
, which translates to boundaries of (0, np.inf) for each parameter.boundary_excess_cost (str or callable returning a function, optional) – The function is used to calculate the penalty for exceeding the boundaries. Default is
boundFunc.scalarBound()
boundary_excess_cost_properties (dict, optional) – The parameters for the boundary_excess_cost function. Default {}
calculate_covariance (bool, optional) – Is the covariance calculated. Default
False
-
Name
¶ The name of the fitting method
- Type
string
See also
fitAlgs.fitSims.fitSim
The general fitting class
-
extra_measures
(*model_parameter_values)[source]¶ - Parameters
*model_parameter_values (array of floats) – The parameters proposed by the fitting algorithm
- Returns
fit_quality – The fit quality value calculated using the fit quality functions described in extraMeasures
- Return type
dict of float
-
fit
(simulator, model_parameter_names, model_initial_parameters)[source]¶ Runs the model through the fitting algorithms and starting parameters and returns the best one. This is the abstract version that always returns
(0,0)
- Parameters
simulator (function) – The function used by a fitting algorithm to generate a fit for given model parameters. One example is
fitAlgs.fitAlg.fitness
model_parameter_names (list of strings) – The list of initial parameter names
model_initial_parameters (list of floats) – The list of the initial parameters
- Returns
best_fit_parameters (list of floats) – The best fitting parameters
fit_quality (float) – The quality of the fit as defined by the quality function chosen.
tested_parameters (tuple of two lists) – The two lists are a list containing the parameter values tested, in the order they were tested, and the fit qualities of these parameters.
See also
fitAlgs.fitAlg.fitness()
-
fitness
(*params)[source]¶ Generates a fit quality value used by the fitting function. This is the function passed to the fitting function.
- Parameters
*params (array of floats) – The parameters proposed by the fitting algorithm
- Returns
fit_quality – The fit quality value calculated using the fitQualFunc function
- Return type
See also
fitAlgs.qualityFunc()
the module of fitQualFunc functions
fitAlg.invalidParams()
Checks if the parameters are valid and if not returns
inf
fitAlgs.fitSims.fitSim.fitness()
Runs the model simulation and returns the values used to calculate the fit quality
-
info
()[source]¶ The information relating to the fitting method used
Includes information on the fitting algorithm used
See also
fitAlg.fitSims.fitSim.info()
-
invalid_parameters
(*params)[source]¶ Identifies if the parameters passed are within the bounds provided
If they are not returns
inf
- Parameters
params (list of floats) – Parameters to be passed to the sim
- Returns
validity – If the parameters are valid or not
- Return type
Bool
Notes
No note
Examples
>>> a = FitAlg(bounds={1:(0,5), 2:(0,2), 3:(-1,1)}) >>> a.set_bounds([3, 1]) >>> a.invalid_parameters(0, 0) False >>> a.invalid_parameters(2, 0) True >>> a.invalid_parameters(0, -1) True >>> a.invalid_parameters(6, 6) True
-
participant
(model, model_parameters, model_properties, participant_data)[source]¶ Fit participant data to a model for a given task
- Parameters
- Returns
model (model.modelTemplate.Model inherited class instance) – The model with the best fit parameters
fit_quality (float) – Specifies the fit quality for this participant to the model
fitting_data (tuple of OrderedDict and list) – They are an ordered dictionary containing the parameter values tested, in the order they were tested, and the fit qualities of these parameters.
-
set_bounds
(model_parameter_names)[source]¶ Checks if the bounds have changed
- Parameters
model_parameter_names (list of strings) – An ordered list of the names of the parameters to be fitted
Examples
>>> a = FitAlg(bounds={1: (0, 5), 2: (0, 2), 3: (-1, 1)}) >>> a.boundaries {1: (0, 5), 2: (0, 2), 3: (-1, 1)} >>> a.set_bounds([]) >>> a.boundaries {1: (0, 5), 2: (0, 2), 3: (-1, 1)} >>> a.boundary_names [] >>> a.set_bounds([3,1]) >>> a.boundary_values [(-1, 1), (0, 5)] >>> a.set_bounds([2,1]) >>> a.boundary_values [(0, 2), (0, 5)]
-
classmethod
startParams
(initial_parameters, bounds=None, number_starting_points=3)[source]¶ Defines a list of different starting parameters to run the minimization over
- Parameters
initial_parameters (list of floats) – The initial starting values proposed
bounds (list of tuples of length two with floats, optional) – The boundaries for methods that use bounds. If unbounded methods are specified then the bounds will be ignored. Default is
None
, which translates to boundaries of (0,float(‘Inf’)) for each parameter.number_starting_points (int) – The number of starting parameter values to be calculated around each initial point
- Returns
startParamSet – The generated starting parameter combinations
- Return type
list of list of floats
See also
FitAlg.start_parameter_values()
Used in this function
Examples
>>> FitAlg.startParams([0.5,0.5], number_starting_points=2) array([[0.33333333, 0.33333333], [0.66666667, 0.33333333], [0.33333333, 0.66666667], [0.66666667, 0.66666667]])
-
static
start_parameter_values
(initial, boundary_min=-inf, boundary_max=inf, number_starting_points=3)[source]¶ Provides a set of starting points
- Parameters
initial (float) – The initial starting value proposed
boundary_min (float, optional) – The minimum value of the parameter. Default is
float('-Inf')
boundary_max (float, optional) – The maximum value of the parameter. Default is
float('Inf')
number_starting_points (int) – The number of starting parameter values to be calculated around the inital point
- Returns
startParams – The generated starting parameters
- Return type
list of floats
Notes
For each starting parameter provided a set of numStartPoints starting points will be chosen, surrounding the starting point provided. If the starting point provided is less than one but greater than zero it will be assumed that the values cannot leave those bounds, otherwise, unless otherwise told, it will be assumed that they can take any positive value and will be chosen to be eavenly spaced around the provided value.
Examples
>>> FitAlg.start_parameter_values(0.5) array([0.25, 0.5 , 0.75]) >>> FitAlg.start_parameter_values(5) array([2.5, 5. , 7.5]) >>> FitAlg.start_parameter_values(-5) array([2.5, 5. , 7.5]) >>> FitAlg.start_parameter_values(5, boundary_min = 0, boundary_max = 7) array([4., 5., 6.]) >>> FitAlg.start_parameter_values(5, boundary_min = -3, boundary_max = 30) array([1., 5., 9.]) >>> FitAlg.start_parameter_values(5, boundary_min = 0, boundary_max = 30) array([2.5, 5. , 7.5]) >>> FitAlg.start_parameter_values(5, boundary_min = 3, boundary_max = 30, number_starting_points = 7) array([3.5, 4. , 4.5, 5. , 5.5, 6. , 6.5])
-
fitAlgs.fitAlg.
covariance
(jac)[source]¶ Calculates the covariance based on the estimated jacobian
Inspired by how this is calculated in scipy.optimise.curve_fit, as found at https://github.com/scipy/scipy/blob/2526df72e5d4ca8bad6e2f4b3cbdfbc33e805865/scipy/optimize/minpack.py#L739


message_critical(
self.tr("Could not load Orange Scheme file"),
title=self.tr("Error"),
informative_text=self.tr("An unexpected error occurred"),
exc_info=True,
parent=self)
return None
message_warning(
self.tr("Errors occured while loading the scheme."),
title=self.tr("Problem"),
informative_text=self.tr(
"There were problems loading some "
"of the widgets/links in the "
"scheme."
),
details="\n".join(map(repr, errors))
)
return new_scheme


WITNESS LIST Civil Practices Committee March 25, 1997-4:00P HB 23 For: Corte, Jr., Frank (author of bill) Against: Hampton, Hartley (TTLA) Registering, but not testifying: For: Allen, George (Tx. Apartment Assn.) Douglas, Barbara (self & Lumberman's Assn) Erben, Andrew (Tx. Assn. of Builders) Erben, Randy (Nat'l Fed. of Ind. Busn) Grace, James (self) Krueger, John (Nat'l Fed. of Ind. Busn) Pinkus, David (Sm. Busn. United of TX) Stinson, Bill (Tx. Assn. of Realtors) HB 886 For: Brimer, Kim (author of bill) Eads, John (self & Tx. Soc.of CPAs) Owen, Robert (self & Tx. Soc.of CPAs) Against: Heasley, John (Tx. Bankers Assoc.) McEldowney, John (self) Neely, Karen (Ind. Bankers Assoc.-Tx) Odom, F.A. (self) On: Sedberry, Tom (Tx. Soc. of CPAs) Registering, but not testifying: For: Wayne, Ralph (Tx. Civil Just. League) White, Michael (Gr. Dallas Chamber) White, Michael (Gr. Houston Partnership) Against: Slack, Mike (TTLA) HB 1202 For: Bittick, Sheryl (self & Weingarten Rlty.) Boyd, Jack (Simon DeBartolo Group) Bradley, A.L. (self) Ehrhardt, Harryette (self) Grace, Jim (self and TLR) Graham, Michael (self and TLR) Lohrke, Gary (Minyard Food Stores) Rowling, Robert (self & Omni Hotels) Trabulsi, Richard (self&Richard's Liquors) Tyner, Charlie (self & Kroger Foods) Uher, Tom (author of bill) Walters, Dale (self) Against: Bailey, Ken (Tx Assn of Fire Fighter) Bowen, J. Donald (self and TTLA) Dillon, Lana (self) Goodnight, Vicki (self) Hampton, Hartley (TTLA) Lambe, Dan (Tx. Citizen Action) Matteck, C.W. (self) Riddering, Hannah (self & TX NOW) Suraci, Barbara (self& Will Not Forget) Wheat, Sarah Jane (self & Campus C.O.P.S.) Registering, but not testifying: For: Allen, George B. (Tx. Apartment Assn.) Allen, Sr., Joshua (self) Bennett, Richard A. (Tx Cnl. of For. Pd.Mn.) Blumberg, Gary (self & DMC Mngement Co.) Childress, Marilyn (Tx. Comm. Assns. Inst.) Daly, Richard (Tx. Catholic Conference) Douglas, Barbara (self/Lmbrmns Assn of Tx) Ellmer, Rich (Tx. Mini-Storage Assn.) Erben, Andrew (Tx. Assn of Builders) Erben, Randy (Nat'l Fed. of Ind. Bus.) Fisher, Scott (TPMCSA) Fritz, Randy (TLR) Garey, Glen (Tx. Restaurant Assn.) Harms, Dianna (Dinerstein Comp. & self) Hunt, Stacy (self & Tx. Aptment Assn) Hutcheson, Mark (South Tx. Col. of Law) Kamm, Robert (Tx. Assn. of Bus. & CC) Krueger, John (NFIB) McDonald, Carol (Ind. Col. & Univ. of_Tx) McDougal, Mike (self) Myers, Tim L. (self) Neely, Karen (Ind. Bankers Assn of Tx) Peairson, Mitchell T. (BOMA) Pinkus, David (Sm. Busn United of TX) Ross, James T. (Int'l Cnl. of Shp. Cnt.) Ross, Marc (self) Stinson, Bill (Tx. Assn. of Realtors) Teas, Andrew (Hou. Aptment Assn. Inc.) Tryon, Bill (Tx. Civ. Justice League) Wayne, Ralph (Tx. Civ. Justice League) Weekly, Richard (self) Welsh, Dinah (Tx. Hospital Assn.) White, Michael (Gr Houston Partnership) White, Michael (Gr. Dallas Chamber) Wood, Karen (Baylor University) Against: Aaron, Ron (self & Rape Crisis Ctr.) Donahue, Sterlene (self) Flores, Maria_Luisa (Tx. Women's Pol. Caucus) Gillaspie, Tommy W. (self) Higgins, Mike (Tx Assn of Fire Fighter) James, Reggie (Consumer's Union) Jones, Gregory G. (self) Levy, Rick (TX AFL-CIO) McNeil, Jr., Carvel (Hou. Pol. Patrl. Union) Parker, Brad (self) Pearcy, Zella A. (self) Porter, Matthew (Transport Workers Union) Slack, Mike (TTLA) Smith, Tom (Public Citizen) Sweeney, Paula (self) HB 2118 For: Bosse, Fred (author of bill) Weisman, John (self) Registering, but not testifying: On: Templeton, Bobbie (TxDOT) HB 2737 For: Peters, Roger (self & Dick Corp.) Uher, Tom (author of bill) Registering, but not testifying: For: Curlee, Durward (Tx. Assoc. Gen'l Contrs) Kamm, Robert (TABCC) Sargent, Frederic (self) On: Smith, Carey (Attorney General's Ofc.) Templeton, Bobbie (TxDOT) HB 3352 For: Peters, Roger (self & Dick Corp.) Place, Allen (author of bill) Sargent, Frederic (Self) Registering, but not testifying: For: Curlee, Durward (Assoc. of Gen'l Contrs.) On: Reynolds, Carl (Tx. Bd. of Crim. Just.) SB 275 For: Brimer, Kim (sponsor of bill) Eads, John (self & Tx. Soc. of CPAs) Owen, Robert (self & Tx. Soc.of CPAs) On: Sedberry, Tom (Tx. Soc. of CPAs) Registering, but not testifying: For: Fritz, Randy (self and TLR) Kamm, Robert (TABCC) Trabulsi, Richard (self) Tryon, Bill (Tx. Civil Just. League) Wayne, Ralph (Tx. Civil Just. League) Weekley, Richard (self and TLR) White, Michael (Gr. Dallas Chamber) White, Michael (Gr. Houston Partnership) Against: Heasley, John (Tx. Bankers Assoc.) McEldowney, John (self) Neeley, Karen (Ind. Bankers. Assoc.-TX) Odom, F.A. (self) Slack, Mike (self and TTLA)


Using the controllerAs syntax over the classic controller with $scope syntax.

 { { settings.name } }

/* recommended - but see next section */ function CustomerController() { this.name = {}; this.sendMessage = function() { }; }
This application takes a name and compares the last name input with the next. It accepts strings and rejects integers. We are also using Angular's $watch function to watch for changes to the last element in the array.
vm.original = ['']; vm.save = function() { if (!isNaN(vm.name)) { throw alert('Sorry, not a valid name. Please try again.'); } else { vm.original.push(vm.name); if (vm.original.length > 2) { vm.original.shift(); } } vm.previous = vm.original[0]; vm.current = vm.original[1]; }
If you look in the console, you will see that we are watching the changes to the names array using Angular's $watch function. Open your console and go ahead and add Names to the array.
John recommends that you place bindable members at the top of the controller, alphabetized, and not spread throughout the controller code.
Why?: Placing bindable members at the top makes it easy to read and helps you instantly identify which members of the controller can be bound and used in the View.
Why?: Setting anonymous functions in-line can be easy, but when those functions are more than 1 line of code they can reduce the readability. Defining the functions below the bindable members (the functions will be hoisted) moves the implementation details down, keeps the bindable members up top, and makes it easier to read.
I have created three functions that illustate what John means by this.
Sessions: {{ options.gotoSession }}Now take a look at the code used:
/* 4.4 Bindable Members Up Top */ vm.gotoSession = gotoSession; vm.refresh = refresh; vm.search = search; vm.sessions = []; function gotoSession() { $log.info('Executed gotoSession()'); } function refresh() { $log.info('Executed refresh()'); } function search() { $log.info('Executed search()'); }
Notice that in the console, you will see these functions being executed every time a button is clicked.
{{ sessions.sessions }}
John Papa recommends that we add the important stuff at the top of the code stack. If you look a the code below, I add vm.activate and vm.title at the top because this is easier to read and understand not only for yourself but for the next developer who reads your code.
function AvengersController( avengersService, $log) { var vm = this; vm.avengers = []; vm.activate = activate; //Good practice vm.title = 'Get the Avengers and log the retrieval'; //Good practice function activate() { retrieveAvengers(); $log.info('Avengers retrieval successful!'); } function retrieveAvengers() { vm.avengers = avengersService.getAvengers(); //activate(); } }
Now I just put the code into action. The activate function up binded to the button below which in turn retrieves the Avengers and creates a log in the console.
.factory('avengersService', function ($log) { return { refresh: function () { $log.info('Executed refresh()'); }, getAvengers: function() { $log.info('getting data...'); return [ { Name: 'Iron Man', RealName: 'Anthony "Tony" Edward Stark', MemberSince: '1963', Notes: 'Founder of original roster. Joined West Coast Branch in West Coast Avengers vol. 2 #1 (1984). Expelled for Armor War (1987). Current member of the main Avengers team.' }, { Name: 'Thor', RealName: 'Thor Odinson (a.k.a. Dr. Donald Blake, Sigurd Jarlson, Jake Olsen, Odinson)', MemberSince: '1963', Notes: 'Former member of the main Avengers team.', }, { Name: 'Ant-Man', RealName: 'Dr. Henry Jonathan "Hank" Pym', MemberSince: '1963', Notes: 'Became Giant-Man in Avengers #2 (1963), Goliath in Avengers #28 (1966), and Yellowjacket in Avengers #59 (1969). Expelled as Yellowjacket in Avengers #213 (1981). Joined West Coast Branch as Doctor Pym in West Coast Avengers #21 (1988). Became The Wasp in Mighty Avengers #21 (March 2009). He is one of only two members, the other being Kelsey Leigh (Captain Britain), who have Avengers status in both their civilian and superhero guises. Formerly the head of the Avengers Academy, former member of the Secret Avengers and formerly the leader of the Avengers A.I. Squad. Currently merged with Ultron.', } ] } } })
When the button below is clicked, we retrieve the list of Avengers from the data object array and return them in an unordered list. A log is registered everytime the button is clicked (see the console).
John recommends to defer logic by delegating to services and factories. Reasons for this:
Here is the code:
/* avoid */ function OrderController($http, $q, config, userInfo) { var vm = this; vm.checkCredit = checkCredit; vm.isCreditOk; vm.total = 0; function checkCredit() { var settings = {}; // Get the credit service base URL from config // Set credit service required headers // Prepare URL query string or data object with request data // Add user-identifying info so service gets the right credit limit for this user. // Use JSONP for this browser if it doesn't support CORS return $http.get(settings) .then(function(data) { // Unpack JSON data in the response object // to find maxRemainingAmount vm.isCreditOk = vm.total <= maxRemainingAmount }) .catch(function(error) { // Interpret error // Cope w/ timeout? retry? try alternate service? // Re-reject with appropriate error for a user to see }); }; } /* recommended - John Papa's version */ function OrderController(creditService) { var vm = this; vm.checkCredit = checkCredit; vm.isCreditOk; vm.total = 0; function checkCredit() { return creditService.isOrderTotalOk(vm.total) .then(function(isOk) { vm.isCreditOk = isOk; }) .catch(showError); }; } /* recommended - My version */ function OrderController(creditService) { var vm = this; vm.checkCredit = checkCredit; vm.isCreditOk; vm.total = 10; function checkCredit() { vm.returnBalance = creditService.isOrderTotalOk(vm.total); }; } /* And here is the factory function I made */ .factory('creditService', function ($log) { return { isOrderTotalOk: function(total) { if (total <= 0) { return 'Sorry, not enough balance'; } else { return 'Your balance is ' + total + ' . Now that was fun wasn\'t it?'; } } } })
Well it's not exactly the same code, but the idea is there. Now let's see the recommended code in action:
Credit: {{ orderControl.returnBalance }}
So it's not that exicting but the whole point of this chapter is as John says to defer login in a controller by delegating to services and fatories. By looking to my code, you can see I did just that.
Define a controller for a view, and try not to reuse the controller for other views. Instead, move reusable logic to factories and keep the controller simple and focused on its view.
Why?: Reusing controllers with several views is brittle and good end-to-end (e2e) test coverage is required to ensure stability across large applications.
My explanation: One controller per view is logically correct. It is easier to maintain and above all, more comprehensive for the next developer to pick up where you left.
When I created my controllers, I made sure I had one for each view. Take a look at the last two I made:
This is the controller that takes care of the avengers application.
function AvengersController(avengersService, $log) { var vm = this; vm.avengers = []; vm.activate = activate; vm.title = 'Get the Avengers and log the retrieval'; function activate() { retrieveAvengers(); $log.info('Avengers retrieval successful!'); } function retrieveAvengers() { vm.avengers = avengersService.getAvengers(); //activate(); } }
This is how it's binded in the view.

; /* Arguments here */

This is the controller that takes care of the credit service application.
function OrderController(creditService) { var vm = this; vm.checkCredit = checkCredit; vm.isCreditOk; vm.total = 10; function checkCredit() { vm.returnBalance = creditService.isOrderTotalOk(vm.total); }; }
And similarly binded in a view of its own

 /* Arguments here */

When a controller must be paired with a view and either component may be re-used by other controllers or views, define controllers along with their routes.
Note: If a View is loaded via another means besides a route, then use the ng-controller="Avengers as vm" syntax.
Why?: Pairing the controller in the route allows different routes to invoke different pairs of controllers and views. When controllers are assigned in the view using ng-controller, that view is always associated with the same controller.
John doesn't recommend to do it like this:
// route-config.js angular .module('app') .config(config); function config($routeProvider) { $routeProvider .when('/avengers', { templateUrl: 'avengers.html' }); } //In the view

John does recommend to do it like this:
// route-config.js angular .module('app') .config(config); function config($routeProvider) { $routeProvider .when('/avengers', { templateUrl: 'avengers.html', controller: 'Avengers', controllerAs: 'vm' }); } //In the view

So what does that piece of code do in raelity? It takes care of the routing service. I've gone and applied the syntax to my entire routing service. If you click on a menu item, you will notice that the routing serice is in use.
As far as I am concerned, all other syntax forms are unacceptable. Go ahead and take a look at the app.config.js file to see this syntax applied.


Convert the molecule to an uniform volume in which sites occupied by atoms are
are represented as spheres of points. Each point has value corresponding to the charge atom value.
| Sphere radius |
numeric field |
The radius of the spheres used to represent atoms (it is equal for every atom). |
| Box resolution |
numeric field |
The side of each cell of the resulting volume. |
| use manual limits |
toggle |
For the resulting volume use the limits entered below. If not set the volume limits are computed by the module and show
in the fields below. |
| X, Y, Z min |
numeric fields |
Lower coordinates values for the volume. |
| X, Y, Z max |
numeric fields |
Upper coordinates values for the volume. |


--- layout: post title: Nez Percé retreat date: '2015-11-27T18:30:40+01:00' categories: - Sketchbooks - Sketches picture_url: https://film-Storyboards.tumblr.com/post/134089604064 ---
Chief Joseph and his tribe at Bear Paw Battle.


Automatic Design of Communication-based Behaviors for Robot Swarms
Hello. i'm going to present my work abt communication in robot sw
Design Methods
Manual design
Design done by hand by an expert.
Automatic design
Design automatically done by an optimization algorithm
in order to design such system, there are 2 main approaches ... the problem
in manual, trial an error, guided by experience, no general methodology .... automatic design promising approach to overcome those diffi,
Automatic Design
Evolutionary methods
Modular methods
the prob is cast in an optimization problem, design choices define search space and is explored by opti. most work done via Evolutionary rob, tradionaly control soft neural network and opti algo Evolutionary alg. one other way is modular design, where modules and you assemble them with opti
AutoMoDe: Automatic Modular Design Francesca et al, SI (2014)
Control achitecture : Probabilistic Finite State Machine
Optimization algorithm : any
we will study autmode, a modular approach first introduced in 2014, pfsm max 4 states 4 outgoing, IT has NO communication capabilities, robot can sense neighbors but not send any messages.
Our research question and objective
It is possible to automatically design a swarm of communicating robots using AutoMoDe ?
Do robots perform better with communication capabilities than without ?
is it possible for the opti alg to assign a semantic to a message?
Hypothesis
The automatic design process assigns a specific, task dependent
semantic to a message.
Idea
Robots may send one message.
The automatic design method defines a task-specific semantic: it associates a cause/effect to the message.
We demonstrate this idea on three tasks that require messages with different semantic.
we have our hyp, now the idea for exps, we choose to allow rob to send 1 message, so 1 bit of information, we will see if the opti alg will be able to asign a semantic, that is to say associate causes and effects to message in different situations
Semantic ?
EvoCom
We introduce EvoCom as a yardstick for our system.
A modification of Evostick (Francesca et al, SI vol. 8667 (2014))
No hidden layers.
30 input nodes for sensors (25) and messaging (5).
3 output nodes for wheels (2) and message broadcasting (1).
We introduce EvoCom, a modification of Evstick, Evostick is an rather standard method that we already used prev to compare methods ,Evolutionary method, that uses signe layer feed forward neural network with no hiden layer, we use it to compare
Robot: E-puck
Sensors
Proximity
Light
Ground
Range and bearing
Actuators
Wheels
Range and bearing
Behavioral Modules of Gianduja
Behaviors
Conditions
Exploration
Black floor
Stop
Gray floor
Phototaxis
White floor
Anti-phototaxis
Neighbor count
Attraction
Inverted neighbor count
Repulsion
Fixed probability
Additonal ones:
Attraction to message
Message count
Repulsion to message
Inverted message count
One new parameter on existing behaviors for message broadcasting. Two new conditions and two new behaviors.
Tasks
Aggregation
Stop
Decision
Evalutation and experimental protocol
Assessment with a swarm of 20 e-puck robots:
For each mission and each method: 15 runs → 15 instances of control software.
Each run with 200 000 simulations.
Each instance is evaluated once in simulation and once in reality
Results aggregation
All robots should aggregate on the white spot.
the higher the better, explain results?? TODO
Results stop
All robots should stop when the white spot is found by any robot.
Results decision
All robots should go either to the right or to the left side of arena based on center color.
Aggregated results
Conclusions
Meaningful semantics can be automatically defined per-mission by the design process.
Gianduja performs better than EvoCom.
Gianduja performs better than Chocolate in 2 out of 3 considered tasks


Strawberries in cream forever.Imagine a warm summer morning and a fresh bowl of juicy, sun-ripened strawberries topped with rich, dairy cream. Now imagine all of that warmth and rich flavor in a bowl of Quaker Oats. Our Strawberries & Cream Flavored Instant Oatmeal offers you a hint of summer any time of year.


Tell us about your cancer
so we can refine our results.
Stage:
Histology:
Previous treatment:
{% for post in posts %}
{{ post.topics }}
{{ post.url }}
{{ post.insights }}
{{ post.cohort }}
{% endfor %}
Breast Cancer
Side effects : Heart disease
{% for text, value in pair %}
{{ text }}
{% endfor %}


--- layout: default title: Internship ---
{{ internship.content | strip_html | truncate: 350 }} Read more {{ internship.date | date_to_string }} - {% include read-time.html %}


- McDonalds
-
McDonald's Corporation is an American fast food company, founded in
1940 as a restaurant operated by Richard and Maurice McDonald, in
San Bernardino, California, United States.
- Pizza Hut
-
Pizza Hut is an American multinational restaurant chain and
international franchise founded in 1958 in Wichita, Kansas by Dan
and Frank Carney. It provides pizza and other Italian-American
dishes, including pasta, side dishes and desserts
- Dominos Pizza
-
Domino's Pizza, Inc., branded as Domino's, is an American
multinational pizza restaurant chain founded in 1960. The
corporation is Delaware domiciled and headquartered at the Domino's
Farms Office Park in Ann Arbor, Michigan.
- KFC
-
KFC is an American fast food restaurant chain headquartered in
Louisville, Kentucky that specializes in fried chicken. It is the
world's second-largest restaurant chain after McDonald's, with
22,621 locations globally in 150 countries as of December 2019
- Subway
-
Subway is an American fast food restaurant franchise that primarily
sells submarine sandwiches, salads and beverages. It was founded by
the 17 year old Fred DeLuca and financed by Peter Buck in 1965 as
Pete's Super Submarines in Bridgeport, Connecticut.
- Starbucks
-
Starbucks Corporation is an American multinational chain of
coffeehouses and roastery reserves headquartered in Seattle,
Washington. As the world's largest coffeehouse chain, Starbucks is
seen to be the main representation of the United States' second wave
of coffee culture.


| 1 |
Strohl_2017 |
Current progress in innovative engineered antibodies |
Strohl, William R. |
2017 |
2017-08-18 |
COMM-USE |
N |
PMC5777977 |
28822103.0 |
10.1007/s13238-017-0457-8 |
la9svzml |
0.555735 |
Dove_2004 |
|
| 2 |
Rajeshkumar_2020 |
Fatal toxicity of chloroquine or hydroxychloroquine with metformin in mice |
N.V Rajeshkumar; Shinichi Yabuuchi; Shweta G. Pai; Anirban Maitra; Manuel Hidalgo; Chi V. Dang |
2020 |
2020-04-04 |
BioRxiv |
Y |
|
|
10.1101/2<IP_ADDRESS>556 |
zghh0zbd |
0.553316 |
Ekins_2015, Pastuch-Gawołek_2019, van_Boven_2008 |
Rolain_2007 |
| 3 |
Aslesh_2018 |
Skipping Multiple Exons to Treat DMD—Promises and Challenges |
Aslesh, Tejal; Maruyama, Rika; Yokota, Toshifumi |
2018 |
2018-01-02 |
COMM-USE |
N |
PMC5874658 |
29301272.0 |
10.3390/biomedicines6010001 |
mtmfh3uy |
0.461885 |
|
|
| 4 |
Brouillet_2010 |
Co-lethality studied as an asset against viral drug escape: the HIV protease case |
Brouillet, Sophie; Valere, Thomas; Ollivier, Emmanuelle; Marsan, Laurent; Vanet, Anne |
2010 |
2010-06-17 |
COMM-USE |
N |
PMC2898770 |
20565756.0 |
10.1186/1745-6150-5-40 |
s30p3a23 |
0.458305 |
|
Zhu_X_2015 |
| 5 |
Reichert_2006 |
Anti-infective monoclonal antibodies: perils and promise of development |
Reichert, Janice M.; Dewitz, Matthew C. |
2006 |
2006-01-01 |
PMC |
N |
PMC7097328 |
16518372.0 |
10.1038/nrd1987 |
cyjz29ot |
0.421188 |
Dove_2004 |
|
| 6 |
Thomas_2010 |
Receptor mimicry as novel therapeutic treatment for biothreat agents |
Thomas, Richard J |
2010 |
2010-01-01 |
None |
N |
PMC3035151 |
21327124.0 |
10.4161/bbug.1.1.10049 |
c7av3xql |
0.420714 |
|
Lee_C_2019, Opsenica_2011 |
| 7 |
Riaño-Umbarila_2019 |
Generation of a Broadly Cross-Neutralizing Antibody Fragment against Several Mexican Scorpion Venoms |
Riaño-Umbarila, Lidia; Gómez-Ramírez, Ilse V.; Ledezma-Candanoza, Luis M.; Olamendi-Portugal, Timoteo; Rodríguez-Rodríguez, Everardo Remi; Fernández-Taboada, Guillermo; Possani, Lourival D.; Becerril, Baltazar |
2019 |
2019-01-10 |
COMM-USE |
N |
PMC6356842 |
30634620.0 |
10.3390/toxins11010032 |
vk7dsy4r |
0.418238 |
|
|
| 8 |
Dove_2004 |
Making prevention pay |
Dove, Alan |
2004 |
2004-01-01 |
PMC |
N |
PMC7097210 |
15060549.0 |
10.1038/nbt0404-387 |
s6x0igia |
0.411178 |
|
|
| 9 |
Kramer_2015 |
Antilipidemic Drug Therapy Today and in the Future |
Kramer, Werner |
2015 |
2015-04-24 |
PMC |
N |
PMC7122375 |
26330256.0 |
10.1007/164_2015_15 |
7r35ow4y |
0.401856 |
Bumcrot_2006 |
|
| 10 |
Mathew_2015 |
Computational Docking Study of p7 Ion Channel from HCV Genotype 3 and Genotype 4 and Its Interaction with Natural Compounds |
Mathew, Shilu; Fatima, Kaneez; Fatmi, M. Qaiser; Archunan, Govindaraju; Ilyas, Muhammad; Begum, Nargis; Azhar, Esam; Damanhouri, Ghazi; Qadri, Ishtiaq |
2015 |
2015-06-01 |
COMM-USE |
N |
PMC4451521 |
26030803.0 |
10.1371/journal.pone.0126510 |
cxxk09t2 |
0.385385 |
|
Zhu_X_2015, Gao_M_2010 |
| 11 |
Gerold_2013 |
Opportunities and Risks of Host-targeting Antiviral Strategies for Hepatitis C |
Gerold, Gisa; Pietschmann, Thomas |
2013 |
2013-10-04 |
PMC |
N |
PMC7089091 |
|
10.1007/s11901-013-0187-1 |
lgae22f8 |
0.365659 |
Jerome_2005, Wisskirchen_2014 |
Lin_K_2013 |
| 12 |
Pawlotsky_2014 |
What are the pros and cons of the use of host-targeted agents against hepatitis C? |
Pawlotsky, Jean-Michel |
2014 |
2014-05-31 |
PMC |
N |
|
24583032.0 |
10.1016/j.antiviral.2014.02.008 |
px1xaszl |
0.363768 |
Shaw_2011 |
|
| 13 |
Prabakaran_2009 |
Combination Therapy Using Chimeric Monoclonal Antibodies Protects Mice from Lethal H5N1 Infection and Prevents Formation of Escape Mutants |
Prabakaran, Mookkan; Prabhu, Nayana; He, Fang; Hongliang, Qian; Ho, Hui-Ting; Qiang, Jia; TaoMeng,; Goutama, Michael; Kwang, Jimmy |
2009 |
2009-05-22 |
COMM-USE |
N |
PMC2682562 |
19478856.0 |
10.1371/journal.pone.0005672 |
cdm39qt9 |
0.354864 |
|
|
| 14 |
Saylor_2009 |
Monoclonal antibody-based therapies for microbial diseases |
Saylor, Carolyn; Dadachova, Ekaterina; Casadevall, Arturo |
2009 |
2009-12-30 |
None |
N |
PMC2810317 |
20006139.0 |
10.1016/j.vaccine.2009.09.105 |
40tq0fa7 |
0.350002 |
Dove_2004 |
Flego_2013 |
| 15 |
Van_Norman_2018 |
Expanding Patient Access to Investigational New Drugs: Overview of Intermediate and Widespread Treatment Investigational New Drugs, and Emergency Authorization in Public Health Emergencies |
Van Norman, Gail A. |
2018 |
2018-06-25 |
None |
N |
PMC6058931 |
30062226.0 |
10.1016/j.jacbts.2018.02.001 |
58ta20fg |
0.344437 |
Dove_2004 |
|
| 16 |
Hansson_2015 |
Bioengineering and semisynthesis of an optimized cyclophilin inhibitor for treatment of chronic viral infection |
Hansson, Magnus Joakim; Moss, Steven James; Bobardt, Michael; Chatterji, Udayan; Coates, Nigel; Garcia-Rivera, Jose A; Elmér, Eskil; Kendrew, Steve; Leyssen, Pieter; Neyts, Johan; Nur-E-Alam, Mohammad; Warneck, Tony; Wilkinson, Barrie; Gallay, Philippe; Gregory, Matthew Alan |
2015 |
2015-01-22 |
None |
N |
PMC4336584 |
25619934.0 |
10.1016/j.chembiol.2014.10.023 |
n9ptifg8 |
0.339165 |
|
Zhu_X_2015, Lee_C_2019 |
| 17 |
Adriouch_2011 |
Improved Immunological Tolerance Following Combination Therapy with CTLA-4/Ig and AAV-Mediated PD-L1/2 Muscle Gene Transfer |
Adriouch, Sahil; Franck, Emilie; Drouot, Laurent; Bonneau, Carole; Jolinon, Nelly; Salvetti, Anna; Boyer, Olivier |
2011 |
2011-09-29 |
PMC |
N |
PMC3202221 |
22046170.0 |
10.3389/fmicb.2011.00199 |
psaf2vls |
0.331378 |
|
|
| 18 |
Bolken_2008 |
Discovery and development of antiviral drugs for biodefense: Experience of a small biotechnology company |
Bolken, Tove C.; Hruby, Dennis E. |
2008 |
2008-01-31 |
None |
N |
PMC2972676 |
17765333.0 |
10.1016/j.antiviral.2007.07.003 |
12kihnp7 |
0.317043 |
Dove_2004 |
Zhu_X_2015 |
| 19 |
Padberg_2015 |
2.6 Anti-infective Agents |
Padberg, Stephanie |
2015 |
2015-12-31 |
PMC |
N |
PMC7150338 |
|
10.1016/b978-0-12-408078-2.00007-x |
rtqkvf63 |
0.301302 |
|
|


| public nothrow | Thread() |
| public nothrow | Thread(Thread&& that) |
| suppress | Thread(const Thread&) |
| private nothrow | Thread(int id_) |
| public inline nothrow int | Id() const | |
| public void | Join() | Waits a thread to end. If the thread is not joinable, throws a ThreadingException . |
| public static Thread | StartFunction(ParameterizedThreadStartFunction function, void* param) | |
| public static Thread | StartFunction(ThreadStartFunction function) | |
| public static Thread | StartMethod(ParameterizedThreadStartMethod method, void* param) | |
| public static Thread | StartMethod(ThreadStartMethod method) | |
| public default nothrow void | operator=(Thread&&) | |
| suppress void | operator=(const Thread&) |
| private int | id |
Waits a thread to end. If the thread is not joinable, throws a ThreadingException .


Menu and actions for Click to Create Menus.
Click to Create Vision
Click to Create MVP
Element Menu
This is a screen element for user interactions
Screen elmeent


#include <editors.h>
Inheritance diagram for TEditWindow::
Public Methods | |
| TEditWindow (const TRect &bounds, const char *fileName, int aNumber) | |
| virtual void | close () |
| virtual const char* | getTitle (short) |
| virtual void | handleEvent (TEvent &event) |
| virtual void | sizeLimits (TPoint &min, TPoint &max) |
Static Public Methods | |
| TStreamable* | build () |
Public Attributes | |
| TFileEditor* | editor |
Static Public Attributes | |
| const char* const | name |
Protected Methods | |
| TEditWindow (StreamableInit) | |
| virtual void | write (opstream &) |
| virtual void* | read (ipstream &) |
It will change its title to display the file name being edited and will initialize scroll bars and an indicator for the editor.
Definition at line 1366 of file editors.h.
|
|
Creates a TEditWindow object that will edit the given file name with window number `aNumber'. Initializes a framed, tileable window with scroll bars and an indicator. If `fileName' is 0, it is assumed to be an untitled file. Note: if editor data member is equal to TEditor::clipboard static data member, the editor is assumed to be the clipboard. |
|
|
Each streamable class needs a "builder" to allocate the correct memory for its objects together with the initialized virtual table pointers. This is achieved by calling this constructor with an argument of type StreamableInit. |
|
|
Called to create an object in certain stream-reading situations. Reimplemented from TWindow. |
|
|
Overrides TWindow::close() to hide rather than close the window if the editor is a clipboard. Reimplemented from TWindow. |
|
|
Returns the name of the file being edited, or "Clipboard" if the editor is the clipboard. Reimplemented from TWindow. |
|
|
Handles cmUpdateTitle to redraw the frame of the window. Used in TFileEditor::saveAs() to change the title of the window if the file being edited changes names. Reimplemented from TWindow. |
|
|
Reads from the input stream `is'. Reimplemented from TWindow. |
|
|
Undocumented. Reimplemented from TWindow. |
|
|
Writes to the output stream `os'. Reimplemented from TWindow. |
|
|
Pointer to the editor associated with this window. |
|
|
Undocumented. Reimplemented from TWindow. |


Welcome to Race
The RACE Society is a new concept for the VIPS. It's a student society which aims to create a school-wide, multi-cultural community which strives for excellence. And we believe that if we work together, we can achieve excellence!
Throughout the academic year, we will host numerous events, workshops and lecture which will help us become better students. However, we will also host many social events such as parties, meetups and other activities.
Another important aspect of RACE Society is that we also offer support to students. We aim to help you with university and personal matters; especially since studying can be hard, and living away from your family can be even harder; so don't hesitate to contact us!
Whilst we work towards improving the student experience at VIPS, RACE Society also communicates with the university's administrative team on a regular basis so that we can work towards creating a better university for you.


{% extends "base.html" %} {% block body %} {% if session.client_id %}
| Device Name | Device ARN | |
|---|---|---|
| {{ device.name }} | {{ device.arn | miniarn }} |
Hello! Welcome to NotiCast - a broadcasting system for sending notifications. Below, we'll list some ways you can interact with the devices.
<EMAIL_ADDRESS>NotiCast is a system that enables seamless text-to-speech notifications with no human interaction required. It can be useful for ongoing notifications without the hassle of having to communicate with the device.
With NotiCast, you can make interaction with notifications seamless. There's no need to tap a notification to see the content, it just shows you it.
When you receive your NotiCast device, it should already have the software installed. If not, download a prepared raspberry pi image from here and flash it to an SD card using any SD flasher software (we recommend Balena Etcher as it's open-source and free).
If the device provider has not already provided you with a flash drive containing your authentication credentials, or if you lose said flash drive, you will need to set up a new drive. Assuming you have requested and received credentials from the provider, you can follow the steps below to set up a new flash drive.


Optimization Order¶
This link lists the optimizations run by Clang on the -O3 setting( https://lists.llvm.org/pipermail/llvm-dev/2016-May/099440.html ). This may give us some insight into what order the optimizations need to be done in to be effective. Analysis (a), utility (u) and transformation (t) passes havve been marked. Passes which we are not considering have been removed. It is useful to note that the number of times that a pass is run may be significant. Multiple runs of a pass might imply that passes after it require it.
The passes are listed in order starting from the first one run.
(a) -basicaa (u) -verify (t) -simplifycfg (a) -domtree (t) -sroa (a) -basicaa (t) -ipsccp (t) -globalopt (t) -deadargelim (a) -domtree (t) -instcombine (t) -simplifycfg (a) -basiccg (t) -prune-eh (t) -inline (t) -functionattrs (t) -argpromotion (a) -domtree (t) -sroa (a) -lazy-value-info (t) -jump-threading (t) -simplifycfg (a) -domtree (t) -instcombine (t) -tailcallelim (t) -simplifycfg (t) -reassociate (a) -domtree (a) -loops (t) -loop-simplify (t) -lcssa (t) -loop-rotate (t) -licm (t) -loop-unswitch (t) -instcombine (a) -scalar-evolution (t) -loop-simplify (t) -lcssa (t) -indvars (t) -loop-deletion (t) -loop-unroll (a) -domtree (a) -memdep (t) -gvn (a) -memdep (t) -memcpyopt (t) -sccp (a) -domtree (t) -instcombine (a) -lazy-value-info (t) -jump-threading (a) -domtree (a) -memdep (t) -dse (a) -loops (t) -loop-simplify (t) -lcssa (t) -licm (t) -adce (t) -simplifycfg (a) -domtree (t) -instcombine (a) -domtree (a) -loops (t) -loop-simplify (t) -lcssa (t) -loop-rotate (a) -scalar-evolution (t) -instcombine (a) -scalar-evolution (t) -simplifycfg (a) -domtree (t) -instcombine (a) -loops (t) -loop-simplify (t) -lcssa (a) -scalar-evolution (t) -loop-unroll (t) -instcombine (t) -loop-simplify (t) -lcssa (t) -licm (a) -scalar-evolution (t) -strip-dead-prototypes (t) -globaldce (t) -constmerge (u) -verify


Shameless commuter brushes teeth waiting for Tube and 'spits it out on platform'
The brazen commuter was then seen appearing to spit his toothpaste onto the busy platform in front of fellow passengers at Euston station in central London earlier today
by Neil MurphyLondon's transport is stressful enough without the occasionally inconsiderate behaviour from commuters on the city's tubes, trains and buses.
One unfortunate commuter shared a particularly harrowing episode seen on a Tube platform at Euston station on Wednesday morning.
Pictures show the apparently rushed commuter brushing his teeth in front of other astonished Tube riders, reports MyLondon .
To make matters worse, the man appeared to spit the toothpaste out on the busy platform instead of over the edge.
The eyewitness tweeted about her traumatic experience earlier this morning.
She said: "Disgusting behaviour at Euston station this morning.
"Packed platform and this man starts brushing his teeth and spits repeatedly on the platform."
This person may have been able to avoid this unusual scenario if they had decided to get up five minutes earlier.
In 2017, it was found London Underground has become a 'breeding ground' for anti-resistant superbugs .
Infectious anti-resistant bugs were found on the seats and handles on all Tube lines with 22 different bacteria species identified on the Victoria line - the worst performing in the capital.
It comes after researchers from London Metropolitan University and taxi insurers Staveley Head analysed swabs from trains, buses and taxis to examine the cleanliness of London's transport network
In total, 121 different bacteria was found with nine of those identified as among the world's most dangerous anti-resistant superbugs.


SetFTPDirectory()
语法
Result = SetFTPDirectory(#Ftp, Directory$)概要
Changes the current #Ftp directory, relative to the current directory.
参数
#Ftp The connection to use. Directory$ The directory to change to. This parameter must refer to a directory inside the current FTP directory. Nested paths are not allowed. Use the value ".." to return to the parent directory of the current directory.
返回值
Returns nonzero if the operation was successful and zero if it failed.
备注
To get the current FTP directory, use the GetFTPDirectory() function.
示例
InitNetwork() If OpenFTP(0, "ftp.free.fr", "anonymous", "") Debug "Successfully connected" If SetFTPDirectory(0, "pub") If SetFTPDirectory(0, "Linux") Debug "Cool, changed to '/pub/Linux'" Debug GetFTPDirectory(0) Else Debug "Can't change to '/pub/Linux'" EndIf Else Debug "Can't change to 'pub'" EndIf Else Debug "Can't connect to ftp.free.fr" EndIf
参阅
GetFTPDirectory(), ExamineFTPDirectory(), SendFTPFile(), ReceiveFTPFile()
已支持操作系统
所有


Course List for Master's Degree of Computer Science (GPA: 3.9)
Autumn Quarter, 2014
CSC 421 - Applied Algorithms and Structures (A-)
Fundamental algorithms including: Sorting(Bubble, Merge, Quick...), Dynamic Programming, NP, etc.
CSC 447 - Concepts of Programming Languages (A)
Java, Scala
Spring Quarter, 2014
SE 450 - Object-Oriented Software Development (A)
OO Concept, Design Pattern, Multi-Threading, Java, Elevator System
CSC 453 - Database Technologies (A)
SQL Query
Summer Quarter, 2014
CSC 555 - Mining Big Data (A)
Map Reduce, Hadoop, Hive, Pig
CSC 471 - Mobile Applications Development for iOS (A)
iOS, Swift
Autumn Quarter, 2015
CSC 435 - Distributed Systems I (A)
Socket, Http, Web
CSC 472 - Mobile Applications Development for Android (A)
Android, Java
Winter Quarter, 2015
SE 526 - Software Security Assessment (A)
Static Analysis, Dynamic Analyis, Windows PE, Ubuntu
CSC 575 - Intelligent Information Retrieval (A-)
IR, Similarity, Page Rank
Spring Quarter, 2015
SE 452 - Object-Oriented Enterprise Computing
Java, Servlet, JSP, Tomcat, JDBC, MySQL
CSC 452- Database Programming
PL/SQL, Query, Anonymous Block, Stored Procedure, Function
ECT 583 - Advanced Scripting Technologies
C#, ASP.NET MVC, Web API, Caching, Redis, WebService, EntityFramework


nips nips2009 nips2009-94 nips2009-94-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Ingo Steinwart, Andreas Christmann
Abstract: We prove an oracle inequality for generic regularized empirical risk minimization algorithms learning from α-mixing processes. To illustrate this oracle inequality, we use it to derive learning rates for some learning methods including least squares SVMs. Since the proof of the oracle inequality uses recent localization ideas developed for independent and identically distributed (i.i.d.) processes, it turns out that these learning rates are close to the optimal rates known in the i.i.d. case. 1
[1] P. L. Bartlett, O. Bousquet, and S. Mendelson. Local Rademacher complexities. Ann. Statist., 33:1497–1537, 2005.
[2] G. Blanchard, G. Lugosi, and N. Vayatis. On the rate of convergence of regularized boosting classiﬁers. J. Mach. Learn. Res., 4:861–894, 2003. 8
[3] R. C. Bradley. Introduction to Strong Mixing Conditions. Vol. 1-3. Kendrick Press, Heber City, UT, 2007.
[4] J. Fan and Q. Yao. Nonlinear Time Series. Springer, New York, 2003.
[5] A. Irle. On consistency in nonparametric estimation under mixing conditions. J. Multivariate Anal., 60:123–147, 1997.
[6] W. S. Lee, P. L. Bartlett, and R. C. Williamson. The importance of convexity in learning with squared loss. IEEE Trans. Inform. Theory, 44:1974–1980, 1998.
[7] A. Lozano, S. Kulkarni, and R. Schapire. Convergence and consistency of regularized boosting algorithms with stationary β-mixing observations. In Y. Weiss, B. Sch¨ lkopf, and J. Platt, o editors, Advances in Neural Information Processing Systems 18, pages 819–826. MIT Press, Cambridge, MA, 2006.
[8] R. Meir. Nonparametric time series prediction through adaptive model selection. Mach. Learn., 39:5–34, 2000.
[9] D. S. Modha and E. Masry. Minimum complexity regression estimation with weakly dependent observations. IEEE Trans. Inform. Theory, 42:2133–2145, 1996.
[10] M. Mohri and A. Rostamizadeh. Stability bounds for non-i.i.d. processes. In J.C. Platt, D. Koller, Y. Singer, and S. Roweis, editors, Advances in Neural Information Processing Systems 20, pages 1025–1032. MIT Press, Cambridge, MA, 2008.
[11] M. Mohri and A. Rostamizadeh. Rademacher complexity bounds for non-i.i.d. processes. In D. Koller, D. Schuurmans, Y. Bengio, and L. Bottou, editors, Advances in Neural Information Processing Systems 21, pages 1097–1104. 2009.
[12] I. Steinwart. Two oracle inequalities for regularized boosting classiers. Statistics and Its Interface, 2:271284, 2009.
[13] I. Steinwart and A. Christmann. Support Vector Machines. Springer, New York, 2008.
[14] I. Steinwart and A. Christmann. Estimating conditional quantiles with the help of the pinball loss. Bernoulli, accepted with minor revision.
[15] I. Steinwart, D. Hush, and C. Scovel. Learning from dependent observations. J. Multivariate Anal., 100:175–194, 2009.
[16] I. Steinwart, D. Hush, and C. Scovel. Optimal rates for regularized least squares regression. In S. Dasgupta and A. Klivans, editors, Proceedings of the 22nd Annual Conference on Learning Theory, pages 79–93. 2009.
[17] H. Sun and Q. Wu. Regularized least square regression with dependent samples. Adv. Comput. Math., to appear.
[18] M. Vidyasagar. A Theory of Learning and Generalization: With Applications to Neural Networks and Control Systems. Springer, London, 2nd edition, 2003.
[19] Y.-L. Xu and D.-R. Chen. Learning rates of regularized regression for exponentially strongly mixing sequence. J. Statist. Plann. Inference, 138:2180–2189, 2008.
[20] B. Yu. Rates of convergence for empirical processes of stationary mixing sequences. Ann. Probab., 22:94–116, 1994.
[21] B. Zou and L. Li. The performance bounds of learning machines based on exponentially strongly mixing sequences. Comput. Math. Appl., 53:1050–1058, 2007. 9