Wavelets¶
In order to build a wavelet filter bank, one starts from a single bandpass filter \(\psi(t)\) named the mother wavelet. Then, one has to contract \(\psi(\omega)\) in the Fourier domain by scaling factors \(2^{\gamma}\geq1\) to derive a bank of band pass filters \(\widehat{\psi_{\gamma}}(\omega)\) for different values of \(\gamma\):
In the time domain, the above is equivalent to
In this section, we review three posssible shapes for the mother wavelet \(\psi\):
- the Morlet wavelet
morlet_1d
, - the Gammatone wavelet
gammatone_1d
and - the RLC wavelet (causal with exponential decay)
RLC_1d
.
The default specifications are: Gammatone when transforming over time, Morlet when transforming along chromas, RLC when transforming along octaves.
Morlet wavelet¶
The ubiquitous Morlet wavelet, also named Gabor wavelet, is proved to have optimal time-frequency Heisenberg uncertainty (see Mallat’s wavelet tour [Mal08], Theorem 2.6). It is defined as the product of a Gaussian bell curve of variance \(\sigma\) by a sine wave of frequency \(\xi\).
The function \(\varepsilon(t)\) is a low-frequency corrective term to ensure that the wavelet \(\psi(t)\) has zero mean. Remarkably, the Morlet wavelet also has a Gaussian profile in the frequency domain.
Since the Gaussian bell curve is symmetric, the Morlet wavelet transform modulus not sensitive to reversal of the \(t\) axis. Yet, our perception of time is strongly asymmetric : therefore, for second-order auditory scattering along time, one should prefer the asymmetric Gammatone wavelet (see below) instead of the Morlet wavelet. The Morlet wavelet is well suited to transforms along log-scales \(\gamma\).
When performing a joint time-frequency transform or spiral transform, the Morlet wavelet handle morlet_1d is the default for the transform along log-scales \(\gamma\). In many cases, it is sensible to use it for transforms along time as well. Aside from the quality factor, it does not have any specific parameter.
Gammatone wavelet¶
Because of their temporal asymmetry and near-optimal uncertainty properties, Gammatone filters are widely used in auditory models. They are defined as the product of a monomial of degree \(N\), an exponential decay of attenuation \(\alpha\), and a sine wave of frequency \(\xi\).
We define a Gammatone wavelet by taking the first derivative of the Gammatone function, and replacing the \(\sin(2\pi \xi t)\) by \(\exp(2\mathrm{i} \pi \xi t)\). By doing this, we ensure that the resulting function has zero mean and is analytic (see Venkitaraman et al. [VAS14]). The expression of the Gammatone wavelet in the time domain is:
In the Fourier domain:
Observe that, by this definition, the wavelet modulus \(\vert\psi(t)\vert\) reaches its maximum after \(t=0\). In practice, we translate the resulting function in time in order to match the peak at exactly \(t=0\). We also add a phase term such that the real part also reaches its maximum at exactly \(t=0\).
The integer \(N\), called gammatone_order
in the specifications, is equal to \(4\) by default. The bigger the \(N\), the more symmetric (hence “Morlet-like”) the wavelet will be. The attenuation parameter \(\alpha\) is automatically inferred from the required quality factor, through a tedious closed-form equation.
RLC wavelet¶
A RLC circuit consists of a resistor R, an inductor L and a capacitor C. In an underdamped regime, the response of this circuit is a sine wave with an exponentially decaying profile. By setting the phase shift \(\varphi\) to zero and taking the analytic part, we derive an analytic “RLC wavelet” of attenuation \(\alpha\) and center frequency \(\xi\).
This wavelet is rigorously causal (it is zero for \(t<0\)) and has a very fast decay in time, at the cost of an imprecise localization in frequency. These properties makes it adapted to wavelet transform across octaves, in the case of spiral scattering.
As much as the Gammatone wavelet is the product of a Gamma probability density function by a sine wave, the RLC wavelet is the product of a Poisson density function by a sine wave. Consequently, the RLC wavelet could alternatively be named “Poisson wavelet”. The attenuation parameter \(\alpha\) is automatically inferred from the required quality factor, through the simple equation
RLC wavelets are the default when transforming across octaves in a spiral scattering transform. Aside from the quality factor, it does not have any specific parameter.
| [Mal08] | Mallat, S. A Wavelet Tour of Signal Processing, Third Edition: The Sparse Way. 832 (Academic Press, 2008). |
| [VAS14] | Venkitaraman, A., Adiga, A. & Seelamantula, C. S. Auditory-motivated Gammatone wavelet transform. Signal Processing 94, 608–619 (2014). |


N supplement to DataMat Toolbox
Matlab Data Structures element D of class NeuroTool
based on DataWaveDataStructures version 2.1
fields added by N Toolbox in green
fields modified by N Toolbox in yellow
fields removed by N Toolbox in red
(all fields new to N toolbox)
|
Method Name |
Description |
|
calcpsthbins |
calculates bins based on psthbinsize and stores in UnitData |
|
|
|
|
Variable Name |
Variable Description |
Variable Type |
|
D |
description in following tables |
|
|
psthbinsize |
bin size in seconds for D.UnitData.psthbins |
double |
|
|
|
|
|
Variable Name |
Variable Description |
Variable Type |
|
psthbinsize |
default binsize |
double |
|
psthbsexpected |
expected binsize range(warn happens outside range) |
[low, high] double |
|
|
|
|
|
Method Name |
Description |
|
N.defaults |
returns all defaults stored in file NTdefaults.mat |
|
N.defaults(var) |
returns default for field, ‘var’ |
|
N.defaults(var, val) |
assigns new value, ‘val’ to field ‘var’ and saves in NTdefaults.mat |
|
Variable Name |
Variable Description |
Variable Type |
|
AmplitudeL |
L pk-pk amplitude (V) |
[Nreps x 1 double] |
|
AmplitudeR |
R pk-pk amplitude (V) |
[Nreps x 1 double] |
|
AttenuationL |
L attenuation (dB) |
[Nreps x 1 double] |
|
AttenuationR |
R attenuation (dB) |
[Nreps x 1 double] |
|
BBNlowerFreqL |
L noise lower frequency limit (Hz) |
[Nreps x 1 double] |
|
BBNlowerFreqR |
R noise lower frequency limit (Hz) |
[Nreps x 1 double] |
|
BBNupperFreqL |
L noise upper frequency limit (Hz) |
[Nreps x 1 double] |
|
BBNupperFreqR |
R noise upper frequency limit (Hz) |
[Nreps x 1 double] |
|
Channel |
Output channel (‘L’, ‘R’, ‘BOTH’} |
char |
|
FirstTimestamp |
Time of first instance for this stimulus (sec) |
double |
|
FixedDelayL |
L delay time for all signals (sec) |
[Nreps x 1 double] |
|
FixedDelayR |
R delay time for all signals (sec) |
[Nreps x 1 double] |
|
HoldTimeL |
L duration between onset/offset ramps (sec) |
[Nreps x 1 double] |
|
HoldTimeR |
R duration between onset/offset ramps (sec) |
[Nreps x 1 double] |
|
Indices |
Location(s) of stimulus presentation |
[Nreps x 1 double] |
|
LAttenIndices |
Locations(s) for each of the LAttenVals |
{} |
|
LAttenVals |
Unique L attenuation values, sorted (dB) |
[] |
|
Nreps |
# of repetitions of this stimulus |
double |
|
OutputFilename |
Path to which original raw data were written |
[char] |
|
OutputTimeWithDelayL |
L time of signal onset + delay (sec) |
[Nreps x 1 double] |
|
OutputTimeWithDelayR |
R time of signal onset + delay (sec) |
[Nreps x 1 double] |
|
OutputTimestampL |
L time of signal onset (stim. timestamp) (sec) |
[Nreps x 1 double] |
|
OutputTimestampR |
R time of signal onset (stim. timestamp) (sec) |
[Nreps x 1 double] |
|
PA5idL |
Id # for L PA5 attenuator |
[Nreps x 1 double] |
|
PA5idR |
Id # for R PA5 attenuator |
[Nreps x 1 double] |
|
PhaseDegL |
L tone phase (degrees) |
[Nreps x 1 double] |
|
PhaseDegR |
R tone phase (degrees) |
[Nreps x 1 double] |
|
RAttenIndices |
Locations for each of the RAttenVals |
{[Nreps x 1 double]} |
|
RAttenVals |
Unique R attenuation values, sorted (dB) |
[Natt vals X 1 dbl] |
|
RampDownL |
L signal offset time (sec) |
[Nreps x 1 double] |
|
RampDownR |
R signal offset time (sec) |
[Nreps x 1 double] |
|
RampUpL |
L signal onset time (sec) |
[Nreps x 1 double] |
|
RampUpR |
R signal onset time (sec) |
[Nreps x 1 double] |
|
Spiketimes |
Spiketimes for all cells, all sweeps (sec) |
{Nunits x Nreps cell} |
|
Spiketimes_PostStim |
Spiketimes for next stimulus (sec) |
{Nunits x Nreps cell} |
|
Spiketimes_PreStim |
Spiketimes for prior stimulus (sec) |
{Nunits x Nreps cell} |
|
psthbins |
Spike count per psthbinsize (from Spiketimes) |
{Nunits x Nreps cell} |
|
psthwindows |
Windows calculated with width |
{Nunits x Nreps cell} |
|
Sweepend |
Time for end of sweep (sec) |
[Nreps x 1 double] |
|
Sweepstart |
Time for start of sweep (sec) |
[Nreps x 1 double] |
|
Tagstring |
Text tags for the marker for this stimulus type |
[char] |
|
TimeShiftL |
Stimulus-specific delay for L channel (sec) |
[Nreps x 1 double] |
|
TimeShiftR |
Stimulus-specific delay for R channel (sec) |
[Nreps x 1 double] |
|
Timestamp |
Vector of timestamps for stimulus sweeps (sec) |
[Nreps X 1 double] |
|
ToneFreqL |
L channel tone frequency (tone stim only) (Hz) |
[Nreps x 1 double] |
|
ToneFreqR |
R channel tone frequency (Tone stim only) (Hz) |
[Nreps x 1 double] |
|
Type |
'NOISE' 'WAVFILE' 'TONE' ‘NO_SOUND' 'BACKGROUND' 'UNKNOWN' |
{char} |
|
Var |
Var structure |
[1x2 struct] |
|
WavFilenameL |
.wav file played from L channel (wav stim only) |
[char] |
|
WavFilenameR |
.wav file played from R channel (wav stim only) |
[char] |
|
id |
DataWave ID code (?) |
[Nreps x 1 double] |
|
psthbinsum |
spike count per time increment of size psthbinsize |
[1 x # nonempty bins double] |
|
psthbins |
left bound timestamp for nonempty bins |
[1 x # nonempty bins double] |
|
Variable Name |
Variable Description |
Variable Type |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Variable Name |
Variable Description |
Variable Type |
|
Info |
Info structure |
Struct |
|
Marker |
Marker structure |
Struct |
|
MarkerTimes |
Vector of Marker timestamps (sec) |
[1 X Nmarkers double] |
|
Probe |
Struct array of Probe structure for spikes |
[1 X Nprobes struct] |
|
UnitData |
Struct array of UnitData structures. Contains information about sorted (or unsorted) units |
[1 X Nunits struct] |
|
Variable Name |
Variable Description |
Variable Type |
|
MarkerCols |
# of marker text columns in DataWave .txt file |
1 |
|
MarkerTags |
Marker tags from DataWave file |
{NmarkerCols x 1} |
|
NMarkerCols |
# of marker columns |
33 |
|
NSpikeCols |
# of spike columns |
4 |
|
NUnitCols |
# of unit columns |
4 |
|
Ncols |
# of columns in DataWave .txt file |
45 |
|
Ndatalines |
# of lines with data in .txt file |
21800 |
|
Nlines |
Total # of lines in .txt file |
21801 |
|
Nunits |
Total # of units (includes junk, garbage, etc.) |
11 |
|
SpikeCols |
Columns in data file that contain spike data |
[NSpikeCols X 1] |
|
UnitCols |
Columns that contain unit data |
[NUnitCols X 1] |
|
data1 |
Parsed text array of 1st line of data |
{NCols x 1 char} |
|
file |
DataWave .txt file name |
[char] |
|
filename |
DataWave .txt file path and name |
[char] |
|
header |
Header structure |
struct |
|
path |
path to DataWave .txt file |
[char] |
|
Variable Name |
Variable Description |
Variable Type |
|
line |
text of DataWave .txt file header line |
{char} |
|
fields |
Field headers from DataWave .txt file |
{nfields x 1 char} |
|
nfields |
# of header fields |
double |
This is a master list of the marker “tags” that are read in from the DataWave .txt output file.
|
Variable Name |
Variable Description |
Variable Type |
|
AmplitudeL |
L channel output signal peak-peak amplitude (mV) |
[Nmarkers x 1 double] |
|
AmplitudeR |
R channel output signal peak-peak amplitude (mV) |
[Nmarkers x 1 double] |
|
AttenuationL |
L PA5 attenuation (dB) |
[Nmarkers x 1 double] |
|
AttenuationR |
R PA5 attenuation (dB) |
[Nmarkers x 1 double] |
|
BBNlowerFreqL |
Broadband Noise, lower freq limit (Hz) |
[Nmarkers x 1 double] |
|
BBNlowerFreqR |
Broadband Noise, lower freq limit (Hz) |
[Nmarkers x 1 double] |
|
BBNupperFreqL |
Broadband Noise, upper freq limit (Hz) |
[Nmarkers x 1 double] |
|
BBNupperFreqR |
Broadband Noise, upper freq limit (Hz) |
[Nmarkers x 1 double] |
|
FixedDelayL |
delay time for all signals, all channels (sec) |
[Nmarkers x 1 double] |
|
FixedDelayR |
delay time for all signals, all channels (sec) |
[Nmarkers x 1 double] |
|
HoldTimeL |
duration of signal between ramps (sec) |
[Nmarkers x 1 double] |
|
HoldTimeR |
duration of signal between ramps (sec) |
[Nmarkers x 1 double] |
|
M |
raw marker data (text) |
[1 x Nmarkers struct] |
|
Nmarkers |
Total number of markers (# stimuli + 1) |
double |
|
OutputFilename |
DataWave .ddf filename |
{Nmarkers x 1 cell} |
|
OutputTimeWithDelayL |
Time of signal + delay (sec) |
[Nmarkers x 1 double] |
|
OutputTimeWithDelayR |
Time of signal + delay (sec) |
[Nmarkers x 1 double] |
|
OutputTimestampL |
Time of signal start (sec) |
[Nmarkers x 1 double] |
|
OutputTimestampR |
Time of signal start (sec) |
[Nmarkers x 1 double] |
|
PA5idL |
id # for PA5 attenuator (0 = Right 1 = Left) |
[Nmarkers x 1 double] |
|
PA5idR |
id # for PA5 attenuator (0 = Right 1 = Left) |
[Nmarkers x 1 double] |
|
PhaseDegL |
L Tone phase (Degrees) |
[Nmarkers x 1 double] |
|
PhaseDegR |
R Tone phase (Degrees) |
[Nmarkers x 1 double] |
|
RampDownL |
L signal offset ramp time (sec) |
[Nmarkers x 1 double] |
|
RampDownR |
R signal offset ramp time (sec) |
[Nmarkers x 1 double] |
|
RampUpL |
L signal onset ramp time (sec) |
[Nmarkers x 1 double] |
|
RampUpR |
R signal onset ramp time (sec) |
[Nmarkers x 1 double] |
|
StimulusTypeL |
|
{Nmarkers x 1 cell} |
|
StimulusTypeR |
|
{Nmarkers x 1 cell} |
|
TimeShiftL |
L Stimulus-specific delay for stimulus (sec) |
[Nmarkers x 1 double] |
|
TimeShiftR |
R Stimulus-specific delay for stimulus (sec) |
[Nmarkers x 1 double] |
|
Timestamp |
|
{Nmarkers x 1 cell} |
|
ToneFreqL |
L Tone frequency (Hz) |
[Nmarkers x 1 double] |
|
ToneFreqR |
R Tone frequency (Hz) |
[Nmarkers x 1 double] |
|
WavFilenameL |
L output .wav file name (with drive:\path) |
{Nmarkers x 1 cell} |
|
WavFilenameR |
R output .wav file name (with drive:\path) |
{Nmarkers x 1 cell} |
|
id |
??? |
[Nmarkers x 1 double] |
|
string |
'NOISE' 'WAVFILE' 'TONE' ‘NO_SOUND' 'BACKGROUND' 'UNKNOWN' |
[Nmarkers x 1 cell} |
|
wavFilesL |
unique L output .wav file names |
[# x 1 struct] |
|
wavFilesR |
unique R output .wav file names |
[# x 1 struct] |
|
Variable Name |
Variable Description |
Variable Type |
|
t |
timestamp (sec) |
double |
|
string |
text values of Marker information |
{# marker fields x 1} |
|
Variable Name |
Variable Description |
Variable Type |
|
uniqueNames |
unique .wav file name |
[1 X N double] |
|
uniqueIndices |
indices (in master, Marker indices) of the unique stimuli |
double |
|
Nunique |
# unique filenames |
double |
|
Variable Name |
Variable Description |
Variable Type |
|
cluster |
cluster ID values (id number 0-nclusters, 0 corresponds to “junk” category) |
[1 X N double] |
|
nclusters |
# of clusters for this probe (from Plexon) |
double |
|
t |
timestamps for each spike (sec) |
[1 X N double] |
[1 X Nmarkers] array of marker timestamps (in microseconds)
[1 X # of units] struct array, containing information about spike timestamps, organized
by unit # (units from probe 1 are first, then probe 2, etc.)
|
Variable Name |
Variable Description |
Variable Type |
|
indices |
indices into Probe structure arrays |
[1 x # spikes double] |
|
probe |
electrode/tetrode number |
double |
|
sorted |
0 if unsorted, 1 if sorted |
double |
|
timestamp |
vector of timestamps for each spike |
[1 x # spikes double] |
|
unit |
unit id value (0 = unsorted/junk, 1…n) |
double |
|
psthbinsum |
spike count per time increment of size psthbinsize |
[1 x # nonempty bins double] |
|
psthbins |
left bound timestamp for nonempty bins |
[1 x # nonempty bins double] |


About Folder Security Settings
The Digital Asset Management module enables authorized users to manage access to one or more folders by setting Folder Security Settings.
Here's a description of the different permissions that can be set:
- Open Files in Folder: Grant this permission to enable users to view the files within this folder when they are displayed on the site or linked to from the site. All Users are granted this permission by default.
- Browse Files in Folder: Grant this permission to enable users to browse and select the files within this folder. Users are granted this permission to their personal folder by default which enables them to manage their profile image, etc.
- Write to Folder: Enables authorized users to perform all file management tasks for files within this folder.
-
See "Adding a SubFolder"
-
See "Modifying Folder Permissions"


The main navigation bar makes it easy to add styled navigation menus to your application with highlights, collapsible sections, and separators. These items navigate between different panels in your application, but can also navigate between different HTML pages.
The navigation menu also supports the back button when navigating between JavaScript panels in the same page. This makes it possible to support the back button, forward button, and browser history while maintaining the JavaScript state of your application and keeping very fast page loading.
The menus use CSS layout for flexibility. See the examples on the .


ChunkHandle LMemAlloc( MemHandle mh, /* Handle of block containing heap */ word chunkSize); /* Size of new chunk in bytes */
This routine allocates a new chunk in the LMem heap. The heap must be locked or fixed. It allocates a chunk, expanding the chunk table if enccessary, and returns the chunk's handle. The chunk is not zero-initialized. If the chunk could not be allocated, it returns a null handle. Chunks are dword-aligned, so the chunk's actual size may be slightly larger than you request.
Include: lmem.h
Be Sure To: Lock the block on the global heap (unless the block is fixed).
Warnings: The heap may be compacted; thus, all pointers to chunks are invalidated. If LMF_NO_EXPAND is not set, the heap may be resized (and thus moved), thus invalidating all pointers to that block. Even fixed blocks can be resized and moved.
See Also: LMemDeref()
,
LMemReAlloc()
.
void LMemContract( MemHandle mh); /* Handle of LMem heap */
This routine contracts an LMem heap; that is, it deletes all the free chunks, moves all the used chunks to the beginning of the heap (right after the chunk handle table), and resizes the block to free the unused space at the end. It's a good idea to call this routine if you have just freed a lot of chunks, since that will free up some of the global heap. The LMem heap is guaranteed not to move; however, all pointers to chunks will be invalidated.
Be Sure To: Lock the block on the global heap (if it isn't fixed).
Include: lmem.h
void LMemDeleteAt( optr chunk, /* Chunk to resize */ word deleteOffset, /* Offset within chunk of first * byte to be deleted */
word deleteCount); /* # of bytes to delete */
This routine deletes a specified number of bytes from inside a chunk. It is guaranteed not to cause the heap to be resized or compacted; thus, pointers to other chunks remain valid.
Be Sure To: Lock the block on the global heap (unless it is fixed).
Warnings: The bytes you delete must all be in the chunk. If
deleteOffset
and
deleteCount
indicate bytes that are not in the chunk, results are undefined.
Include: lmem.h
See Also: LMemReAlloc()
,
LMemInsertAt()
,
LMemDeleteAtHandles()
.
void LMemDeleteAtHandles( MemHandle mh, /* Handle of LMem heap */ ChunkHandle ch, /* Handle of chunk to resize */ word deleteOffset, /* Offset within chunk of first * byte to be deleted */
word deleteCount); /* # of bytes to delete */
This routine is exactly like
LMemDeleteAt()
above, except that the chunk is specified by its global and chunk handles.
Be Sure To: Lock the block on the global heap (unless it is fixed).
Warnings: The bytes you delete must all be in the chunk. If
deleteOffset
and
deleteCount
indicate bytes that are not in the chunk, results are undefined.
Include: lmem.h
void * LMemDeref( optr chunk); /* optr to chunk to dereference */
This routine translates an optr into the address of the chunk. The LMem heap must be locked or fixed on the global heap. Chunk addresses can be invalidated by many LMem routines, forcing you to dereference the optr again.
Be Sure To: Lock the block on the global heap (unless it is fixed).
Include: lmem.h
See Also: LMemDerefHandles()
.
void * LMemDerefHandles( MemHandle mh, /* Handle of LMem heap's block */ ChunkHandle chunk); /* Handle of chunk to dereference */
This routine is exactly like
LMemDeref()
above, except that the chunk is specified by its global and chunk handles.
Be Sure To: Lock the block on the global heap (unless it is fixed).
Include: lmem.h
See Also: LMemDeref()
.
void LMemFree( optr chunk); /*optr of chunk to free */
This routine frees a chunk from an LMem heap. The chunk is added to the heap's free list. The routine is guaranteed not to compact or resize the heap; thus, all pointers within the block remain valid (except for pointers to data in the freed chunk, of course).
Be Sure To: Lock the block on the global heap (unless it is fixed).
Include: lmem.h
See Also: LMemFreeHandles()
.
void LMemFreeHandles( MemHandle mh, /* Handle of LMem heap */ ChunkHandle chunk); /* Handle of chunk to free */
This routine is just like
LMemFree()
above, except that the chunk is specified by its global and chunk handles (instead of by an optr).
Be Sure To: Lock the block on the global heap (unless it is fixed).
Include: lmem.h


Example Web App for Edge Fileserver Volume App
Test App that read a config file from a Docker volume named edge-fileserver-storage. This file use also
link function from the mounted volume
path to /opt/app/config folder for demonstrating file path compatibility.
The config file in the edge-fileserver-storage volume with path
/fileserver/2021/my-app/config/my-config.json
is linked to a shadow copy file with path
/opt/app/config/config.json
before starting this NodeJS app by using the command
ln -s /fileserver/2021/my-app/config/my-config.json /opt/app/config/config.json && node /usr/src/app/main.js
in the docker-compose file of this application.
Loaded Config file content:


{# This is specific to datasets' owner_org field and won't work #} {# if used with other fields #} {% macro organization_option_tag(organization, selected_org) %} {% block organization_option scoped %} {{ organization.display_name }} {% endblock %} {% endmacro %}


--- layout: post status: publish published: true title: Debugging Multi-Threaded Code 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: 1031 wordpress_url: http://winterdom.com/2007/05/debuggingmultithreadedcode date: '2007-05-16 19:13:11 +0000' date_gmt: '2007-05-16 19:13:11 +0000' categories: - ".NET" - Development tags: [] comments: - id: 726 author: Scott Allen author_email<EMAIL_ADDRESS>author_url: http://www.OdeToCode.com/blogs/scot/ date: '2007-05-17 16:58:12 +0000' date_gmt: '2007-05-17 16:58:12 +0000' content: | I have felt your pain! ---
I just spent several (as in > 8) hours between last night and tonight diagnosing what appeared to be a threading issue in a fairly large and complex code base, and it just reminded me just how hard diagnosing race conditions in multi-threading code can be.
While the code has some unit tests (not as many as I'd like; working on that), the problem only became apparent in a larger, very specific scenario involving long execution times and a big load (in fact running the whole scenario uses 100% CPU time for more than 10 minutes). The entire test scenario actually moves some 40.000 messages or so.
Directly diagnosing these things in the debugger is usually impossible. Either the debugger gets in the way (as it affects how multi-threaded code runs) or you can only see the results of the problem (i.e. catch an unexpected exception as it is thrown, which may be too late to see what the problem actually was). Unfortunately this may mean resorting to good old Debug.WriteLine().
One thing that made this problem a lot harder to diagnose than I expected was that trying putting a simple Debug.WriteLine() statement is some significant points of the code base, cause the problem to simply go away. Not cool. This mean I couldn't output too much data and instead had to infer a few things from what little trace information I could get.
I eventually was able to get to the source of the problem (at least I think I did). Turned out to be, indeed, a nasty race condition: A buffer was compacted and reused while some upper layers of the stack were still holding on to "views" of sections of the buffer without actually having consumed them yet (think something like sliced ByteBuffers in Java). Right now, I have the local scenario running with no errors, though I still have some cleanup to do after messing around a lot to get to the bottom of the problem :)


{{- $teams := .Site.Data.members.teams -}} {{- $members := .Site.Data.members.members -}} {{- $emeriti := .Site.Data.members.emeriti -}}
In addition, the following individuals are emeritus members of the XMPP Standards Foundation:


{% extends 'base.html' %} {% block content %}
{{ product.description }}
Get Details
No products found


In the U.S. legislative system, bills can "die in committee". This occurs when a bill is either voted down in a committee or it simply never receives a vote. While the former is easy to track, the latter is not publicized as much. That, coupled with other means of bill deaths such as a pocket veto or it simply being lost in the process, means that solid legislation with large support can be lost. This project is an attempt to keep track of these bills, as well as the various "levels of death" that they're at.
There are four different levels of death, as described below.
Mostly Dead (Low): This represents a bill that is dead, but only a bit. This occurs when a bill is inactive for a year, but has previously been approved by a chamber or committee. That means that it has support, but it simply got lost along the way.
Flatlining (Moderate): This represents a slightly more significant bill death, but it's similar to the 'Mostly Dead' level. It occurs when a bill has been inactive for at least a year and was referred back to a committee. This is the traditional death in committee, in which a bill dies simply because it's not voted on in committee.
Clinical (High): This level is a more significant level of death, representing a veto by the governor. Vetoes in any legislative system can take two forms: direct or pocket vetoes. If a directly vetoed bill remains inactive for a year after being vetoed, it gains this rating. If a bill is sent to a governor, but stays inactive for at least thirty days, it's considered pocket vetoed and is given this rating as well.
Six Feet Under (Severe): This is the highest level of death, and represents a likely poor fate for the bill. For a bill to receive this rating, it must meet all of the conditions of the flatlining (moderate) level, or the traditional death in committee (it must have been referred back to a committee and been inactive for four months). However, it must all additionally have lost its original supporters. When cosponsors of a bill leave office, their support is lost for certain bills. When a majority of cosponsors of a bill leave office and the bill is inactive for a year, it gains this rating so long as it meets the moderate conditions. If all of the bill's cosponsors have left office, the requirement of a year of inactivity is lost.
In doing some research on New York State legislation, I came across NYS Senate bill S1452. This bill, regarding the custody rights of sex offenders, seemed to make perfect sense to me. But it was lost after its proposal in 2013 when it was referred to a House committee and almost all of its cosponsors subseqently left office. That's when it occurred to me how many of these stories must exist. So I decided to go looking and found a significant number of bills.
A separate program was written to crawl through APIs of legislative bodies (originally the NYS Senate OpenLegislation API). These are then stored to JSON files. Then, these JSON files are imported into a Google Firebase Realtime Database, which allows for quick searching while handling most of the backend itself.


About
This Application helps a user decide which plants are best for their location (zip code) and condition (soil
type, shade, direction of sun, water frequency). They will be able to choose if they want drought tperant plants
or native plants or plants that flower during different seasons. This application will take advantage of data
from the USDA and the Trefle API for plants to return results based on plain english questions to the user about
what kind of garden they would like to have.
Definitions
Drought Tolerant
Drought tolerance is the ability to which a plant maintains its biomass production during arid or drought
conditions. Some plants are naturally adapted to dry conditions, surviving with protection mechanisms such as
desiccation tolerance, detoxification, or repair of xylem embolism.
Native Plants
Native plants are plants indigenous to a given area in geologic time. This includes plants that have developed,
occur naturally, or existed for many years in an area.
Attracting
Most plants depend on pplinators to move the pollen from one flower to the next, while others rely on wind or
water to move pollen. Plants produce nectar to attract pollinators. As the pollinator moves from flower to
flower collecting nectar, they are also moving pllen from flower to flower.
Frost Resistant Plants
Frost plants are tperant of light freezes and can usually withstand such temperatures without serious physical
injury. Non-hardy plants and frost can damage tender green tissues or even kill the root system.
Fruit Bearing Plants
Fruit-bearing plants are the glory of the garden. Not only do they add beauty to the landscape, but they also
produce edible fruits. Fruits, by definition, are edible crops containing seeds, and they include berries,
grapes, tree fruits, melons and even some crops usually thought of as vegetables.
Shade Tolerant
In ecology, shade tolerance refers to a plant's ability to tolerate low light levels. The term is also used in
horticulture and landscaping, although in this context its use is sometimes imprecise, especially in labeling of
plants for sale in commercial nurseries.


Welcome to Chad's CS90 final project.
This application was deployed using AWS CodeDeploy and is updated via a github webhook from CodePipeline.
We've made some changes. Congratulations, we did it!!!


Default Token
Selected Token
Read Only Token
Compact Token
Tokenizer
Tokenizer is a container for tokens, often placed inside multi-input components. The Cozy tokenizer is for small and
medium sized screens. The user can review the tokens by swiping them to the left or right. The tokenizer is not
meant to be used as a standalone component but instead as part of the multi-input.
Compact Tokenizer
The compact tokenizer is for large screens. The user can review tokens by pressing the right or left arrows on the
keyboard.


| One time Registration Fee | {{ appConstants.one_time_reg_fee }} |
| One time Security deposit | {{ appConstants.one_time_security_deposit }} |
| Reading fee for {{ readingCalculation['months'] }} month(s) | {{ readingCalculation['readingFee'] }} |
| Membership plan type | {{ membershipType[readingCalculation['books']] }} |
| Net amount payable | {{ readingCalculation['totalAmount'] }} |
| Membership Id | {{ membership['_id'] }} |
| Membership Type | {{ membership['membership_type']}} |
| Status: | {{(membership['status']) ? 'Active': 'In Active' }} |
| Account Balance | Rs. {{ membership['amount']['account_balance'] }} |
| Plan Balance | Rs. {{ membership['amount']['plan_balance'] }} |
| Plan Expiration | {{ membership['plan_expiry'] | date: 'dd-MMM-yyyy' }} |
| No.of Months | {{ membership['no_of_months']}} month(s) |
| Books you can order at a time | {{ membership['books_at_a_time'] }} book(s) |


water OpenUrl photosynthesis light evolution CrossRef Science Web grasses Fig. C<;sub>;<;/sub>; cmax max nitrogen advantage evolutionary plants black environmental low MPa; allocation intensity model saturated assimilation conditions different higher carbon kPa, leaf line: ppm stomatal reallocation selective high limitation pathway plant conductance hydraulic <;em>;J<;/em>;<;sub>;max<;/sub>;/<;em>;V<;/em>;<;sub>;cmax<;/sub>;=. Plant cmax=. max/ reactions Osborne greater limited selection temperatures dark grass increase initial models photons photorespiration pressures primary temperature use Edwards Miocene RuBP availability change expansion gain species Biol CCM conditions. evolved photosynthetic potential rate results total CO<;sub>;<;/sub>; Ecol New Oecologia condition distribution eudicots leaf/fine-root leaves led lower modeling new optimal plants. ppm) ppm, radiation resistance used (e.g. Bot MPa. Sage Sci VPD= VPD=.kPa, Water climate concentration crossover current dashed difference examine grasslands increased stress μmol ;<;div Christin Download Ehleringer MYA Open Pleistocene VPD atmospheric concentrations consider cost data-hide-link-title=""> data-icon-position="" decreases early figure function given global grassland increases increasing large leading likely line) mechanism mid-Oligocene optimality pressure rates role select similar tab trajectory various (a, (b, (solid ATP Abstract Berry Cell Effects Exp Finally, Photosynthetic Phytol Proc S=- Solid VPD=kPa VPD=kPa, [[#xA]]<;sub>;S<;/sub>;= [[#xA]]<;sub>;S<;/sub>;=- [[#xBC]]mol assume balance bundle carboxylation changes clear costs decrease does drivers ecological evidence extant greatest grey intensities kPa late lead light, line), lineages little loss million n(C order parameters physiological previous ratio regeneration response soil suggest terrestrial time traits transition


need services, provide services, two roles whatever you want to be at any time!
Postalong will integrate into our life, make happy world!
Scan the code, download postalong app
Fill information and post the order
Carriersare waiting to help , make an appointment to pick up
Seamless connection, tracking
anytime and communicate along the way
need services, provide services, two roles whatever you want to be at any time!
Postalong will integrate into our life, make happy world!
Scan the code and download the app
Fill in personal information and wait it approved
Become a carrier, then can take tasks
Resource sharing , while helping others, help yourself


apollo.gui
Class ApolloJalviewEventBridge
java.lang.Object
apollo.gui.ApolloJalviewEventBridge
- All Implemented Interfaces:
- DataLoadListener, AnnotationChangeListener, ResultChangeListener, BaseFocusListener, FeatureSelectionListener, NamedFeatureSelectionListener, jalview.gui.event.AlignViewportListener, jalview.gui.event.ColumnSelectionListener, jalview.gui.event.SequenceSelectionListener, java.util.EventListener
public class ApolloJalviewEventBridge
- extends java.lang.Object
- implements BaseFocusListener, AnnotationChangeListener, FeatureSelectionListener, NamedFeatureSelectionListener, DataLoadListener, ResultChangeListener, jalview.gui.event.ColumnSelectionListener, jalview.gui.event.AlignViewportListener, jalview.gui.event.SequenceSelectionListener
Converts events from apollo to jalview and vice versa
|
Field Summary |
protected static org.apache.log4j.Logger |
logger
|
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
logger
protected static final org.apache.log4j.Logger logger
ApolloJalviewEventBridge
public ApolloJalviewEventBridge(Controller apolloController,
jalview.gui.Controller jalviewController,
jalview.gui.AlignFrame alignFrame)
getJalviewController
public jalview.gui.Controller getJalviewController()
getAlignFrame
public javax.swing.JFrame getAlignFrame()
handleAnnotationChangeEvent
public boolean handleAnnotationChangeEvent(AnnotationChangeEvent evt)
- Specified by:
handleAnnotationChangeEvent
in interface AnnotationChangeListener
handleNamedFeatureSelectionEvent
public boolean handleNamedFeatureSelectionEvent(NamedFeatureSelectionEvent evt)
- Specified by:
handleNamedFeatureSelectionEvent
in interface NamedFeatureSelectionListener
handleFeatureSelectionEvent
public boolean handleFeatureSelectionEvent(FeatureSelectionEvent evt)
- Specified by:
handleFeatureSelectionEvent
in interface FeatureSelectionListener
handleDataLoadEvent
public boolean handleDataLoadEvent(DataLoadEvent evt)
- Specified by:
handleDataLoadEvent
in interface DataLoadListener
handleResultChangeEvent
public boolean handleResultChangeEvent(ResultChangeEvent evt)
- Specified by:
handleResultChangeEvent
in interface ResultChangeListener
handleBaseFocusEvent
public boolean handleBaseFocusEvent(BaseFocusEvent evt)
- Specified by:
handleBaseFocusEvent
in interface BaseFocusListener
handleSequenceSelectionEvent
public boolean handleSequenceSelectionEvent(jalview.gui.event.SequenceSelectionEvent evt)
- Specified by:
handleSequenceSelectionEvent
in interface jalview.gui.event.SequenceSelectionListener
handleColumnSelectionEvent
public boolean handleColumnSelectionEvent(jalview.gui.event.ColumnSelectionEvent evt)
- Specified by:
handleColumnSelectionEvent
in interface jalview.gui.event.ColumnSelectionListener
handleAlignViewportEvent
public boolean handleAlignViewportEvent(jalview.gui.event.AlignViewportEvent evt)
- Specified by:
handleAlignViewportEvent
in interface jalview.gui.event.AlignViewportListener


Small in numbers, Thai Catholics preserve centuries-old traditions
BANGKOK, Nov 20 — The last time Vararunee Khonchanath was in the presence of a pope was before she was born just over 35 years ago, but when Pope Francis visits Bangkok later this week to bless Thailand’s tiny Catholic minority she will be singing in the choir.
A sixth-generation Catholic of Portuguese-Thai ancestry, Vararunee lives in a 250-year-old community that is as old as the Thai capital itself. During the previous papal visit, back in 1984, Vararunee’s pregnant mother was among the congregation.
“I was in my mum’s tummy as she attended the mass when His Holiness John Paul II visited Thailand the last time,” Vararunee said, adding how honoured she felt to be in the choir this time, when Pope Francis offers mass at the National Stadium.
During his visit from November 20-23, Pope Francis will also celebrate mass at Assumption Cathedral in central Bangkok.
In overwhelmingly Buddhist Thailand, Catholics number just a little more than 380,000 in a country of more than 65 million.
Missionaries, traders
Historians say more than 70 per cent of Catholics in Thailand, like Vararunee, have foreign ancestry.
Catholicism first arrived in Siam, the old name for Thailand, in the mid 1500s with Portuguese missionaries and traders.
The Vatican formally established its “Mission de Siam” 350 years ago during the reign of King Narai, an anniversary that coincides with the visit of Pope Francis that begins on Wednesday.
While missionaries failed to achieve mass conversions, they were largely tolerated by the Buddhist majority and particularly the royal court.
“In the past, many Catholics from places like Japan and Vietnam, migrated to this land to escape religious persecution,” said Puttipong Puttansri, a historian at the Archdiocese of Bangkok Historical Archive.
Catholics have over the years built schools and hospitals, some of which are still well known and respected today.
“For many Thais, Catholicism is synonymous with schools,” Puttipong said.
Martyrdom
There were also spells of religious persecutions. In the late 1600s, Catholic priests were arrested and some killed out of suspicion they were working with France to colonise the country.
Similar hostility stirred in the 1940s when a nationalistic Thai government was at war with France in Indochina.
The tension resulted in the closing down of schools, confiscation of properties and the arrest of some clergy.
In 1940, seven Catholics, including three teenage girls, were killed by Thai police in the northeastern province of Nakhon Phanom. Pope John Paul II later declared them martyrs.
Peace and pastries
In the modern era, Thailand remains largely tolerant to Catholics.
Catholics in Bangkok’s historic Kudi Chin community along the Chao Praya River have mostly lived peacefully while maintaining their unique traditions and beliefs.
The district is known locally not only for Santa Cruz Church, that is the focal point for its Catholic community, but for the traditional Portuguese-influenced cupcake that is still baked there.
For the faithful such as Vararunee, the papal visit casts a light on their community and faith.
“I am very proud that we manage to hold on to our roots,” Vararunee said. — Reuters


| Modifier and Type | Method and Description |
|---|---|
SelectedTag |
FPGrowth.getMetricType()
Get the metric type to use.
|
SelectedTag |
Apriori.getMetricType()
Get the metric type
|
| Modifier and Type | Method and Description |
|---|---|
void |
FPGrowth.setMetricType(SelectedTag d)
Set the metric type to use.
|
void |
Apriori.setMetricType(SelectedTag d)
Set the metric type for ranking rules
|
| Modifier and Type | Method and Description |
|---|---|
SelectedTag |
BestFirst.getDirection()
Get the search direction
|
SelectedTag |
WrapperSubsetEval.getEvaluationMeasure()
Gets the currently set performance evaluation measure used for selecting
attributes for the decision table
|
SelectedTag |
ClassifierSubsetEval.getEvaluationMeasure()
Gets the currently set performance evaluation measure used for selecting
attributes for the decision table
|
SelectedTag |
ClassifierAttributeEval.getEvaluationMeasure()
Gets the currently set performance evaluation measure used for selecting
attributes for the decision table
|
| Modifier and Type | Method and Description |
|---|---|
void |
BestFirst.setDirection(SelectedTag d)
Set the search direction
|
void |
WrapperSubsetEval.setEvaluationMeasure(SelectedTag newMethod)
Sets the performance evaluation measure to use for selecting attributes for
the decision table
|
void |
ClassifierSubsetEval.setEvaluationMeasure(SelectedTag newMethod)
Sets the performance evaluation measure to use for selecting attributes for
the decision table
|
void |
ClassifierAttributeEval.setEvaluationMeasure(SelectedTag newMethod)
Sets the performance evaluation measure to use for selecting attributes for
the decision table
|
| Modifier and Type | Method and Description |
|---|---|
SelectedTag |
GlobalScoreSearchAlgorithm.getCVType()
get cross validation strategy to be used in searching for networks.
|
| Modifier and Type | Method and Description |
|---|---|
void |
GlobalScoreSearchAlgorithm.setCVType(SelectedTag newCVType)
set cross validation strategy to be used in searching for networks.
|
| Modifier and Type | Method and Description |
|---|---|
SelectedTag |
LocalScoreSearchAlgorithm.getScoreType()
get quality measure to be used in searching for networks.
|
| Modifier and Type | Method and Description |
|---|---|
void |
LocalScoreSearchAlgorithm.setScoreType(SelectedTag newScoreType)
set quality measure to be used in searching for networks.
|
| Modifier and Type | Method and Description |
|---|---|
SelectedTag |
LinearRegression.getAttributeSelectionMethod()
Gets the method used to select attributes for use in the linear regression.
|
SelectedTag |
SMO.getFilterType()
Gets how the training data will be transformed.
|
SelectedTag |
SMOreg.getFilterType()
Gets how the training data will be transformed.
|
SelectedTag |
GaussianProcesses.getFilterType()
Gets how the training data will be transformed.
|
SelectedTag |
SGDText.getLossFunction()
Get the current loss function.
|
SelectedTag |
SGD.getLossFunction()
Get the current loss function.
|
| Modifier and Type | Method and Description |
|---|---|
void |
LinearRegression.setAttributeSelectionMethod(SelectedTag method)
Sets the method used to select attributes for use in the linear regression.
|
void |
SMO.setFilterType(SelectedTag newType)
Sets how the training data will be transformed.
|
void |
SMOreg.setFilterType(SelectedTag newType)
Sets how the training data will be transformed.
|
void |
GaussianProcesses.setFilterType(SelectedTag newType)
Sets how the training data will be transformed.
|
void |
SGDText.setLossFunction(SelectedTag function)
Set the loss function to use.
|
void |
SGD.setLossFunction(SelectedTag function)
Set the loss function to use.
|
| Modifier and Type | Method and Description |
|---|---|
SelectedTag |
StringKernel.getPruningMethod()
Gets the method used for pruning.
|
| Modifier and Type | Method and Description |
|---|---|
void |
StringKernel.setPruningMethod(SelectedTag value)
Sets the method used to for pruning.
|
| Modifier and Type | Method and Description |
|---|---|
SelectedTag |
IBk.getDistanceWeighting()
Gets the distance weighting method used.
|
SelectedTag |
KStar.getMissingMode()
Gets the method to use for handling missing values.
|
| Modifier and Type | Method and Description |
|---|---|
void |
IBk.setDistanceWeighting(SelectedTag newMethod)
Sets the distance weighting method used.
|
void |
KStar.setMissingMode(SelectedTag newMode)
Sets the method to use for handling missing values.
|
| Modifier and Type | Method and Description |
|---|---|
SelectedTag |
Vote.getCombinationRule()
Gets the combination rule used
|
SelectedTag |
CostSensitiveClassifier.getCostMatrixSource()
Gets the source location method of the cost matrix.
|
SelectedTag |
IterativeClassifierOptimizer.getEvaluationMetric()
Get the evaluation metric to use
|
SelectedTag |
MultiClassClassifier.getMethod()
Gets the method used.
|
| Modifier and Type | Method and Description |
|---|---|
void |
Vote.setCombinationRule(SelectedTag newRule)
Sets the combination rule to use.
|
void |
CostSensitiveClassifier.setCostMatrixSource(SelectedTag newMethod)
Sets the source location of the cost matrix.
|
void |
IterativeClassifierOptimizer.setEvaluationMetric(SelectedTag metric)
Set the evaluation metric to use
|
void |
MultiClassClassifier.setMethod(SelectedTag newMethod)
Sets the method used.
|
| Modifier and Type | Method and Description |
|---|---|
SelectedTag |
DecisionTable.getEvaluationMeasure()
Gets the currently set performance evaluation measure used for selecting
attributes for the decision table
|
| Modifier and Type | Method and Description |
|---|---|
void |
DecisionTable.setEvaluationMeasure(SelectedTag newMethod)
Sets the performance evaluation measure to use for selecting attributes for
the decision table
|
| Modifier and Type | Method and Description |
|---|---|
SelectedTag |
HoeffdingTree.getLeafPredictionStrategy()
Get the leaf prediction strategy to use (majority class, naive Bayes or
naive Bayes adaptive)
|
SelectedTag |
HoeffdingTree.getSplitCriterion()
Get the split criterion to use (either Gini or info gain).
|
| Modifier and Type | Method and Description |
|---|---|
void |
HoeffdingTree.setLeafPredictionStrategy(SelectedTag strat)
Set the leaf prediction strategy to use (majority class, naive Bayes or
naive Bayes adaptive)
|
void |
HoeffdingTree.setSplitCriterion(SelectedTag crit)
Set the split criterion to use (either Gini or info gain).
|
| Modifier and Type | Method and Description |
|---|---|
SelectedTag |
SimpleKMeans.getInitializationMethod()
Get the initialization method to use
|
SelectedTag |
HierarchicalClusterer.getLinkType() |
| Modifier and Type | Method and Description |
|---|---|
void |
SimpleKMeans.setInitializationMethod(SelectedTag method)
Set the initialization method to use
|
void |
HierarchicalClusterer.setLinkType(SelectedTag newLinkType) |
| Modifier and Type | Method and Description |
|---|---|
SelectedTag |
Agrawal.getFunction()
Gets the function for generating the data.
|
| Modifier and Type | Method and Description |
|---|---|
void |
Agrawal.setFunction(SelectedTag value)
Sets the function for generating the data.
|
| Modifier and Type | Method and Description |
|---|---|
SelectedTag |
SubspaceClusterDefinition.getClusterSubType()
Gets the cluster sub type.
|
SelectedTag |
SubspaceClusterDefinition.getClusterType()
Gets the cluster type.
|
SelectedTag |
BIRCHCluster.getInputOrder()
Gets the input order.
|
SelectedTag |
BIRCHCluster.getPattern()
Gets the pattern type.
|
| Modifier and Type | Method and Description |
|---|---|
void |
SubspaceClusterDefinition.setClusterSubType(SelectedTag value)
Sets the cluster sub type.
|
void |
SubspaceClusterDefinition.setClusterType(SelectedTag value)
Sets the cluster type.
|
void |
BIRCHCluster.setInputOrder(SelectedTag value)
Sets the input order.
|
void |
BIRCHCluster.setPattern(SelectedTag value)
Sets the pattern type.
|
| Modifier and Type | Method and Description |
|---|---|
SelectedTag |
RemoveType.getAttributeType()
Gets the attribute type to be deleted by the filter.
|
SelectedTag |
Add.getAttributeType()
Gets the type of attribute to generate.
|
SelectedTag |
RandomProjection.getDistribution()
Returns the current distribution that'll be used for calculating the random
matrix
|
SelectedTag |
StringToWordVector.getNormalizeDocLength()
Gets whether if the word frequencies for a document (instance) should be
normalized or not.
|
SelectedTag |
SortLabels.getSortType()
Gets the sort type to be used.
|
| Modifier and Type | Method and Description |
|---|---|
void |
RemoveType.setAttributeType(SelectedTag type)
Sets the attribute type to be deleted by the filter.
|
void |
Add.setAttributeType(SelectedTag value)
Sets the type of attribute to generate.
|
void |
RandomProjection.setDistribution(SelectedTag newDstr)
Sets the distribution to use for calculating the random matrix
|
void |
StringToWordVector.setNormalizeDocLength(SelectedTag newType)
Sets whether if the word frequencies for a document (instance) should be
normalized or not.
|
void |
SortLabels.setSortType(SelectedTag type)
Sets the sort type to be used.
|
| Modifier and Type | Method and Description |
|---|---|
SelectedTag |
Main.getGUIType()
Gets the currently set type of GUI to display.
|
| Modifier and Type | Method and Description |
|---|---|
void |
Main.setGUIType(SelectedTag value)
Sets the type of GUI to use.
|
Copyright © 2018 University of Waikato, Hamilton, NZ. All Rights Reserved.


| dbQuoteString {DBI} | R Documentation |
Call this method to generate a string that is suitable for use in a query as a string literal, to make sure that you generate valid SQL and protect against SQL injection attacks.
dbQuoteString(conn, x, ...)
conn |
A DBIConnection object, as returned by
|
x |
A character vector to quote as string. |
... |
Other arguments passed on to methods. |
dbQuoteString()
returns an object that can be coerced to character,
of the same length as the input.
For an empty character vector this function returns a length-0 object.
When passing the returned object again to dbQuoteString()
as x
argument, it is returned unchanged.
Passing objects of class SQL should also return them unchanged.
(For backends it may be most convenient to return SQL objects
to achieve this behavior, but this is not required.)
The returned expression can be used in a SELECT ...
query,
and for any scalar character x
the value of
dbGetQuery(paste0("SELECT ", dbQuoteString(x)))[[1]]
must be identical to x
,
even if x
contains
spaces,
tabs,
quotes (single
or double),
backticks,
or newlines
(in any combination)
or is itself the result of a dbQuoteString()
call coerced back to
character (even repeatedly).
If x
is NA
, the result must merely satisfy is.na()
.
The strings "NA"
or "NULL"
are not treated specially.
NA
should be translated to an unquoted SQL NULL
,
so that the query SELECT * FROM (SELECT 1) a WHERE ... IS NULL
returns one row.
Passing a numeric,
integer,
logical,
or raw vector,
or a list
for the x
argument raises an error.
Other DBIResult generics:
DBIResult-class
,
dbBind()
,
dbClearResult()
,
dbColumnInfo()
,
dbFetch()
,
dbGetInfo()
,
dbGetRowCount()
,
dbGetRowsAffected()
,
dbGetStatement()
,
dbHasCompleted()
,
dbIsReadOnly()
,
dbIsValid()
,
dbQuoteIdentifier()
,
dbQuoteLiteral()
,
dbUnquoteIdentifier()
# Quoting ensures that arbitrary input is safe for use in a query name <- "Robert'); DROP TABLE Students;--" dbQuoteString(ANSI(), name) # NAs become NULL dbQuoteString(ANSI(), c("x", NA)) # SQL vectors are always passed through as is var_name <- SQL("select") var_name dbQuoteString(ANSI(), var_name) # This mechanism is used to prevent double escaping dbQuoteString(ANSI(), dbQuoteString(ANSI(), name))


Answer:
CSS Frameworks are the preplanned libraries which make easy and more standard compliant web page
styling.
CSS frameworks offer different modules and tools:
- reset style-sheet
- grid especially for responsive web design
- web typography
- set of icons in sprites or icon fonts
- styling for tooltips,buttons,elements of forms
- parts of graphical user interface like acordion,tabs,slideshow or modal windows
- equaliser to create equal height content
- often used CSS helper classes(left,hide)
The frequently used CSS frameworks are:
- Bootstrap
- Foundation
- Semantic UI
- Gumby
- Ulkit


The actuator rods are what change the states of the bits. They are analogous to the logic rods of the Digi-Comp I. There are two actuator rods per control stage.
The actuator rods shown are for a single bit knex-i-comp. Additional segments are inserted in the middle for each additional bit.
The picture shows two actuator rods as they would be attatched to the bit frame and bit frame top. The blue strut, blue connectors and white struts which serve as hinge pins are parts of the bit frame and bit frame top.
The red (arity 3) connectors and white struts provide sufficient stiffness so that the actuator rod doesn't flex during operation.
The gray (arity one) connectors on the left combine with white struts vertically mounted on the bit frame to form hinges on which the actuator rod can swing.
The blue struts, in addition to providing structure, will engage with yellow struts mounted on the programming hardware to alter the state of a bit assembly during phase 4 of operation.
The light gray (arity 2) connector near the bottom of the assembly engages with the actuator driver during phase 4 of operation.
The yellow strut at the bottom engages against the actuator back-block to hold the actuator rod off-normal during phases 2 and 3 of the operation cycle.


This is a simple hero unit, a simple jumbotron-style component for calling extra attention to featured content or information.
It uses utility classes for typography and spacing to space content out within the larger container.
 Well hello world How you been Good to see you, my old friend Sometimes I feel, cold as steel Broken like I'm never gonna heal I see a light, little hope In a little girl.
Life is beautiful when you wear a smile.
Life is beautiful when you wear a smile.
Life is beautiful when you wear a smile.
Life is beautiful when you wear a smile.


Welcome to my blog.
March 10, 2016
Overview
On this blog I will track different issues I am facing in the pursuit of distributed systems, including direct implementation aspects and issues with replikativ. Additionally I will write about different machine learning topics I am involved in. I hope you find it useful, feedback is appreciated!


Classes in Ruby act like templates. These templates can have many individual instances, but they share traits or behaviors. For example, let's say we want to create Ruby objects in our program that represent 3 different animals. Each of these animals will have a number of legs, a sound they make, and a favorite type of food. We could create each of these animal objects individually, but since this is Ruby, we can create a CLASS that all 3 of these animals will "inherit" from. Just as plant and animal species are separated and catalogued by their common traits, classes are a way of thinking about individual instances of a collection of traits and behaviors.
There are several built-in classes in Ruby, Strings, Arrays, Fixnum are all examples. These big built-in classes actually inherit from other "superclasses", the "superclassiest" being OBJECT. So we know that if we are creating a new class, we're actually creating a new object.
Here's where it might get a little confusing. A class is an object. But so is every INSTANCE of that class. Let's demonstrate this using a couple examples from the plant kingdom. First, let's adapt an example from Chris Pine's book Learn to Program, and make ourselves a tree.
class Tree
Well that was easy, but we're not done yet. Next we need to use our instance method initialize to create an instance of our tree class. That is to say, we've made a class, now we're going to make a tree, and tell Ruby what exactly a "tree" is. When we initialize a class, we are telling Ruby to assign certain variables to every object of that class type.
If you were a farmer with an apple orchard, for example, you might want a handy way of keeping track of the number of healthy apple trees you had on your property, the heights that they grow to, and the amount of fruit they produce.
class Tree
def initialize
@height = 0
@fruit_yeild = 0
@alive = true
So now we have instance variables that will tell us about the height of the individual tree in class tree, the amount of fruit it yields, and it's health (in this case we're not being too detailed). We want to create our class so that it keeps an accurate count of the apples we have picked (from the live trees only. You can't pick fruit from a dead tree!)
class Tree
def initialize
@height = 0
@fruit_yield = 0
@alive = true
def @fruit_yield
if @alive
@fruit_yield
else"The tree is dead and is not producing fruit."
end
def pick_apple
if @alive
if @fruit_yield > 1
@fruit_yield = @fruit_yield -1
"You have picked one apple."
else
"You have no more apples on this tree."
end
else
"The tree is dead and there is nothing to pick."
end
end
end


Come see us at one of these events
Come check us out on the parking lot of Big Lots in Desoto, Tx. Bring the family and enjoy our delicious plates of smoked goodness


What is need to configure entity manager: - persistance unit name - data source - persistance provider - packages to scan - properties are optional


Acquire data from REST APIs. Combine, Transform, and aggregate
Build real-time visualizations and dashboards in minutes
Share responsive dashboards
Create new types of visualizations in the developer playground


interface CurrencyHolidays
An object that can determine whether the given date is a currency holiday of the given currency.
isHoliday |
abstract fun isHoliday(ccy: String, date: LocalDate): Boolean |
InMemoryCurrencyHolidays |
An object that can determine whether the given date is a currency holiday of the given currency. InMemoryCurrencyHolidays does not persist any data when the calling application ends. class InMemoryCurrencyHolidays : CurrencyHolidays |


A: Southern Australia    B: Luzon and Visayas    C: Southern and Southwestern United States    D: Northern and Northwestern United States
2. Which of the following styles is NOT a source of inspiration for country music?
A: electric    B: blues   C: American folk    D: Cowboy western
3. Which of the following is something that country music is NOT known for?
A: Simple forms
B: Very modern instruments
C: Extensively used blues modes
D: Folk lyrics
4. Which of the following is an instrument often used in country music?


Hi, Saranya
You've got 5 tasks on your list
My To Do List
Water the plants
Organize the wardrobe
Complete college assignment
Buy Grocery
Return the library book
Add New Task
Add


--- layout: page title: About header-img: "img/about-bg.png" ---
Stacey worked in technology for over 10 years, holding roles such as Program Manager, Project Manager, and Analyst. The field of technology was an intentional choice for her, one that would draw her closer to her love of problem solving and programming. Through all the years, Stacey's career always held her in positions of overseeing development but not actually knowing how to develop. Through Flatiron, Stacey plans to change this and move her career into that of a developer and eventual Tech Lead.


| Method | Structure | Example |
|---|---|---|
| .slice | slice(index) => obj or nil slice(start, length) => new_ary or nil slice(range) => new_ary or nil |
a = [ "a", "b", "c", "d", "e" ] Index a[2] + a[0] + a[1] #=> "cab" Start, length a[0, 2] #=> [ "a", b", "c" ] Range a[1..3] #=> [ "b", "c", "d" ] |
| .group_by | group_by { |obj| block } => a_hash |
Number Example array = [0..15]group_by {|num| num % 3} # => 0 => [0, 3, 6, 9, 12, 15] 1 => [1, 4, 7, , 10, 13] 2 => [2, 5, 8, 11, 14] String Example bellas = ["Beca", "Aubrey", "Chloe", "Fat Amy", "Cynthia-Rose", "Lilly"] bellas.group_by { |singer| singer.length} # => {4=>["Beca"], 6=>["Aubrey"], 5=>["Chloe", "Lilly"], 7=>["Fat Amy"], 12=>["Cynthia-Rose"]} |
| .each | array.each do |arg| # Do something to each element, referenced as arg end #or array.each { |arg| # Do something to each element, referenced as arg } |
["Ryan", "Zach"].each do |person| "#{person} is such a great guy!" end Ryan is such a great guy! Zach is such a great guy! |
.each_with_index |
This handy little method allows you to iterate through an array while also keeping track of which element you’re on. |
my_array.each_with_index do |a, index| puts "#{a} is located at index #{index}" end |
|
.map |
.map{ |obj| block } => array Returns a new array with the results of running block once for every element in enum. |
names = ['danil', 'edmund'] # here we map one array to another, convert each element by some rule names.map! {|name| name.capitalize } # now names contains ['Danil', 'Edmund'] names.each { |name| puts name + ' is a programmer' } # here we just do something with each element |


The APP integration software does not offer integrated backup and recovery mechanisms. Use the standard file system, application server, and database mechanisms instead.
Backup
It is recommended that you create a regular backup of the following data according to the general guidelines of your organization:
- Database (bssapp). The frequency of database backups depends on the amount of changes and the availability of time slots with low load. PostgreSQL supports database backups without previous shutdown. For details, refer to the PostgreSQL documentation.
Make sure to also make a backup of the file containing the key required for encryption and decryption of service parameters with data type PWD and custom attributes marked for encryption. By default, this file is named key and located in:
<GLASSFISH_HOME>/glassfish/domains/app-domain/config
The location of this file can be changed using the APP_KEY_PATH configuration setting.
- Certificates contained in the truststore of the app-domain domain (cacerts.jks file).
- Configuration files.
Note: When preparing for an update installation of the current APP installation, always create a backup of the data mentioned above.
Recovery
If you need to recover your APP installation, the recommended procedure is as follows:
- Restore the bssapp database from the backup using the relevant PostgreSQL commands.
- Make sure that the file containing the key required for encryption and decryption of service parameters with data type PWD and custom attributes marked for encryption exists in the location specified in the APP_KEY_PATH configuration setting. By default, this file is to be named key and located in:
<GLASSFISH_HOME>/glassfish/domains/app-domain/config
If the file is missing, copy it from your backup to the correct location.
- Stop the app-domain domain of the application server.
- Restore the certificate truststore of the app-domain domain (cacerts.jks file) from the backup.
- Start the app-domain domain.


Activists storm into Malta PM's office to demand his resignation
Activists force their way into the 16th-century building asking Muscat to quit over the 2017 killing of a journalist.
Activists have barged into the building that houses the office of Malta's Prime Minister Joseph Muscat to demand his immediate resignation amid an investigation into the 2017 killing of journalist Daphne Caruana Galizia.
Muscat is not directly implicated in the investigation but has said he will resign on January 12 after an election for a new leader of his ruling Labour Party.
Testimony by the self-confessed middleman in the murder plan has linked people in the prime minister's inner circle to attempts at a cover-up.
More:
About 40 activists surprised policemen and soldiers early on Monday as they forced their way into the 16th-century building in capital Valletta from a side entrance, armed with drums, whistles, flags and loud hailers.
They sat down and blocked the entrance, chanting for Muscat to quit. He was not in the building at the time.
Caruana Galizia, described by supporters as a "one-woman WikiLeaks", highlighted corruption in Malta, including among politicians, before she was killed by a car bomb in October 2017.
'Political murder'
The political stability of the Mediterranean island has been rocked by the case in recent weeks.
Muscat's chief of staff Keith Schembri was named among those involved or aware of the plot. Schembri has resigned and is under investigation. He has denied any wrongdoing.
"Malta has reached rock bottom. This is not just about corruption, but about political murder," the activists said over a loud hailer during their protest.
They said Muscat's position was untenable and demanded a comprehensive investigation of all the people named, "not a cover-up".
Police and soldiers watched over the activists who made no attempt to go upstairs, where the administrative offices are located.


The HFControllerPropertyBits bitmask is used to inform the HFRepresenters of a change in the current state that they may need to react to. A bitmask of the changed properties is passed to representerChangedProperties:. It is common for multiple properties to be included in such a bitmask.
| Enumerator |
|---|
| HFControllerContentValue | Indicates that the contents of the ByteArray has changed within the document. There is no indication as to what the change is. If redisplaying everything is expensive, Representers should cache their displayed data and compute any changes manually.
|
| HFControllerContentLength | Indicates that the length of the ByteArray has changed.
|
| HFControllerDisplayedLineRange | Indicates that the displayedLineRange property of the document has changed (e.g. the user scrolled).
|
| HFControllerSelectedRanges | Indicates that the selectedContentsRanges property of the document has changed (e.g. the user selected some other range).
|
| HFControllerSelectionPulseAmount | Indicates that the amount of "pulse" to show in the Find pulse indicator has changed.
|
| HFControllerBytesPerLine | Indicates that the number of bytes to show per line has changed.
|
| HFControllerBytesPerColumn | Indicates that the number of bytes per column (byte grouping) has changed.
|
| HFControllerEditable | Indicates that the document has become (or is no longer) editable.
|
| HFControllerFont | Indicates that the font property has changed.
|
| HFControllerAntialias | Indicates that the shouldAntialias property has changed.
|
| HFControllerLineHeight | Indicates that the lineHeight property has changed.
|
| HFControllerViewSizeRatios | Indicates that the optimum size for each view may have changed; used by HFLayoutController after font changes.
|
| HFControllerByteRangeAttributes | Indicates that some attributes of the ByteArray has changed within the document. There is no indication as to what the change is.
|
| HFControllerByteGranularity | Indicates that the byte granularity has changed. For example, when moving from ASCII to UTF-16, the byte granularity increases from 1 to 2.
|
| HFControllerBookmarks | Indicates that a bookmark has been added or removed.
|
| HFControllerColorBytes | Indicates that the shouldColorBytes property has changed.
|
| HFControllerShowCallouts | Indicates that the shouldShowCallouts property has changed.
|
| HFControllerHideNullBytes | Indicates that the shouldHideNullBytes property has changed.
|


Welcome to my site!
This website will contain projects completed for the Web Design part of Computer Science 1 at CMIS.
Lists and Links
This assignment was to learn to use lists and links. We had to use the lists part of html to create a list of instructions and directions. We also had to use the links elements to link to other webpages, but also to other pages on our own websites.
- Create a new folder called "listsandlinks" in your repository folder.
- Inside listsandlinks create a file called "index.html" and a file called "main.css"
- In index.html create an ordered list of step by step instructions to create a new webpage on the production server.
- Also create an unordered list of 5 or more links to websites with useful webdesign related information.
- In the nav section, create an unordered list of links with a link back to your main index page.
- In your main index.html file in public_html, add an unordered list of links to the nav section with a link to "listsandlinks".
- In your old index.html, add an article with a heading and a paragraph description of this assignment. Also add an unordered list that contains this list of requirements.
- Turn in your work.
Tables
In this section, we needed to create tables. We used many different aspects of tables including, thead, tbody and tfoot. We also used the rowspan and colspan attribute.
- Create a new folder in your repository called "tables"
- In the "tables" folder, create a new file called from your template "index.html"
- Be sure to use thead, tbody, and tfoot elements in your tables.
- Add html code to recreate the webpage below.
- second table will require the use of the colspan attribute.
- third table will require the use of the rowspan attribute.
- In your repository index.html file, add an article with a heading, paragraph description and this list of requirements. Also add a link to the tables/index.html file.
- Add a link from lists and links to this assignment as well
- Validate your code.
- Turn it in.


{{ bash_script }}
Each value represents the number of links between the nodes.
Expot to CSV
Projects are exported as JSON files.
Export Project Import Project


My Team
Brian
Manager
ID: 10
Email:
<EMAIL_ADDRESS>Office Number: 110
Robert
Engineer
ID: 25
Email:
<EMAIL_ADDRESS>GitHub Username:
robert1234
Stacy
Engineer
ID: 26
Email:
<EMAIL_ADDRESS>GitHub Username:
stacy1234
Rebecca
Engineer
ID: 27
Email:
<EMAIL_ADDRESS>GitHub Username:
rebecca1234
Dylan
Intern
ID: 41
Email:
<EMAIL_ADDRESS>School: University of Denver


You just added {{alertBox}} to your events
Click to view all events Close
No Events
{{event.place}} Remove Me