Glossary
MNE-Python core terminology and general concepts
- annotations
- An annotation is defined by an onset, a duration, and a string
description. It can contain information about the experiments, but
also details on signals marked by a human: bad data segments,
sleep scores, sleep events (spindles, K-complex) etc.
An
Annotations
object is a container of multiple annotations.
See Annotations
page for the API of the corresponding
object class and The events and Annotations data structures
for a tutorial on how to manipulate such objects.
- channels
- Channels refer to MEG sensors, EEG electrodes or any extra electrode
or sensor such as EOG, ECG or sEEG, ECoG etc. Channels have typically
a type, such as gradiometer, and a unit, such as Tesla/Meter that
is used in the code base, e.g. for plotting.
- epochs
- Epochs are chunks of data extracted from raw continuous data. Typically,
they correspond to the trials of an experimental design.
See
Epochs
for the API of the corresponding
object class, and The Epochs data structure: epoched data for a
narrative overview.
- evoked
- Evoked data are obtained by averaging epochs. Typically, an evoked object
is constructed for each subject and each condition, but it can also be
obtained by averaging a list of evoked over different subjects.
See
EvokedArray
for the API of the corresponding
object class, and The Evoked data structure: evoked/averaged data
for a narrative overview.
- events
- Events correspond to specific time points in raw data; e.g.,
triggers, experimental condition events, etc. MNE represents events with
integers that are stored in numpy arrays of shape (n_events, 3). Such arrays
are classically obtained from a trigger channel, also referred to as
stim channel.
- first_samp
- The attribute of raw objects called first_samp is an integer that
refers to the number of time samples passed between the onset of the
acquisition system and the time when data started to be written
on disk. This is a specificity of the Vectorview MEG systems (fif files)
but for consistency it is available for all file formats in MNE.
One benefit of this system is that croppping data only boils
down to a change of the first_samp attribute to know when cropped data
was acquired.
- info
- Also called measurements info, it is a collection of metadata regarding
a Raw, Epochs or Evoked object; e.g.,
channel locations and types, sampling frequency,
preprocessing history such as filters …
See The Info data structure for a narrative
overview.
- label
- A
Label
refers to a region in the cortex, also often called
a region of interest (ROI) in the literature.
- montage
- EEG channel names and the relative positions of the sensor w.r.t. the scalp.
See
Montage
for the API of the corresponding object
class.
- morphing
- Morphing refers to the operation of transferring source estimates from
one anatomy to another. It is commonly referred as realignment in fMRI
literature. This operation is necessary for group studies.
See Morphing source estimates: Moving data from one brain to another for more details.
- pick
- An integer that is the index of a channel in the measurement info.
It allows to obtain the information on a channel in the list of channels
available in info[‘chs’].
- projector, (abbr. proj)
- A projector, also referred to a Signal Suspace Projection (SSP), defines
a linear operation applied spatially to EEG or MEG data. You can see
this as a matrix multiplication that reduces the rank of the data by
projecting it to a lower dimensional subspace. Such a projection
operator is applied to both the data and the forward operator for
source localization. Note that EEG average referencing can be done
using such a projection operator. It is stored in the measurement
info in info[‘projs’].
- raw
- It corresponds to continuous data (preprocessed or not). One typically
manipulates raw data when reading recordings in a file on disk.
See
RawArray
for the API of the corresponding
object class, and The Raw data structure: continuous data for a
narrative overview.
- source space (abbr. src)
- A source space specifies where in the brain one wants to estimate the
source amplitudes. It corresponds to locations of a set of
candidate equivalent current dipoles (ECD). MNE mostly works
with source spaces defined on the cortical surfaces estimated
by FreeSurfer from a T1-weighted MRI image. See
Head model and forward computation to read on
how to compute a forward operator on a source space.
See
SourceSpaces
for the API of the corresponding
object class.
- source estimates (abbr. stc)
- Source estimates, commonly referred to as STC (Source Time Courses),
are obtained from source localization methods,
such as dSPM, sLORETA, LCMV or MxNE.
It contains the amplitudes of the sources over time.
An STC object only stores the amplitudes of activations but
not the locations of the sources. To get access to the locations
you need to have the source space used to compute the forward
operator.
See
SourceEstimate
, VolSourceEstimate
VectorSourceEstimate
, MixedSourceEstimate
,
for the API of the corresponding object classes.
- selection (abbr. sel)
- A set of picks. E.g., all sensors included in a Region of Interest.
- stim channel
- A stim channel, a.k.a. trigger channel, is a channel that encodes events
during the recording. It is typically a channel that is always zero and that
takes positive values when something happens such as the onset of a stimulus.
Classical names for stim channels is STI 014 or STI 101.
So-called events arrays are obtained from stim channels.
- trans
- A coordinate frame affine transformation, usually between the Neuromag head
coordinate frame and the MRI Surface RAS coordinate frame used by Freesurfer.


Add new advertisements to analyze
List of Urls:
Enter a location, zip code to scrape
Test out the scraper
Add some data


QUALIFICATION
GLA University
Bachelor of Computer Application
Percentage:
%
Holy Public School
Intermediate
Percentage:
65%
University Modal School
High School
Percentage:
66%
TECHNICAL SKILLS
74%
HTML
68%
CSS
68%
C++
68%
Java
"
Technical
skill is mastery of
complexity
, while
creativity
is mastery of
simplicity
."
-------------------PAGE FIVETH--------------


Create a RHElement
Prerequisites
Before you begin, make sure you’ve followed the Prerequisites in Getting Started.
Step 1: Scaffold an Element
Use the RHElement generator to start the scaffolding process.
yo rhelement
The generator will ask a series of questions to help you get everything set up.
- Your element name:
- Your element name should be lowercase and contain at least one hyphen in it. For the exact rules to naming a custom element, refer to the W3C Custom Elements Working Draft.
- We’ve been prefixing elements with
rh-
if they are meant to be used by Red Hat andcp-
if the element will be specific to the Customer Portal. But you can prefix your element with whatever makes most sense for you.
- Author name:
- Add your name
- NOTE: we’re going to update the generator in the future so it will do a better job with the author object to include an email address and GitHub profile.
- Do you want to use Sass with this element? (Yes or No)
- If yes to question #3, Do you want to use existing Sass dependencies? (cp-sass or No thanks. I’ll provide my own later)
- cp-sass will include the cp-sass node module with all of the Customer Portal mixins and variables.
After you’ve answered the questions, you should see something like this.
Once that completes, change directories into the name of the element you just created. In this case will go into the rh-tabs directory.
cd rh-tabs
Open up your code editor and view the structure of the element. The important things to note are the /src
, /demo
and /test
directories and the rh-tabs.js and rh-tabs.compiled.js files. You’ll do all your development in the /src
directory and write your tests in /test
directory. We’ll use the /demo
directory to preview the element locally and the rh-tabs.js and rh-tabs.compiled.js files we’ll be used for the demo.
Step 2: Develop
Run the start command in the package.json file to open up the demo page and have the rh-tabs.js and rh-tabs.compiled.js files update when you make changes to the files in the /src
directory.
npm start
Let’s take a look at the rh-tabs.js file in the /src
directory to see what we have.
import Rhelement from '../rhelement/rhelement.js';
/*
* DO NOT EDIT. This will be autopopulated with the
* html from rh-tabs.html and css from
* rh-tabs.scss
*/
const template = document.createElement('template');
template.innerHTML = ``;
/* end DO NOT EDIT */
class RhTabs extends Rhelement {
constructor() {
super('rh-tabs', template);
}
}
window.customElements.define('rh-tabs', RhTabs);
First, you’ll notice that we are using ES6 module imports and we import the Rhelement base element.
import Rhelement from '../rhelement/rhelement.js';
Second, you’ll see where we set up the template and just like the comments say, DO NOT EDIT this section.
/*
* DO NOT EDIT. This will be autopopulated with the
* html from rh-tabs.html and css from
* rh-tabs.scss
*/
const template = document.createElement('template');
template.innerHTML = ``;
/* end DO NOT EDIT */
The gulp merge task in gulpfile.js will fill this section of our compiled and transpiled files when you edit a file in the /src
directory.
Third, you’ll see where we define the RhTabs
class that extends the Rhelement base element. In the constructor, we call super
and pass a string that will be the tag we use on a page and the template.
class RhTabs extends Rhelement {
constructor() {
super('rh-tabs', template);
}
}
The Rhelement base element will create a shadow root for us and handle the ShadyCSS work we’ll need for browsers that don’t support shadow DOM.
Finally, we register the element.
window.customElements.define('rh-tabs', RhTabs);
If you have any questions about how Custom Elements work and need to learn more about the basics of shadow DOM, checkout Eric Bidelman’s post: Custom Elements v1: Reusable Web Components.


{% extends "templates/structure.html" %} {% block header-content %}
{% endblock %} {% block footer-content %}Content released under a Creative Commons Attribution-ShareAlike 4.0 International License..
Copyright © Duncan McGreggor, 2003-2019
Design adapted from the Bootswatch Darkly theme.


{{extend 'layout.html'}}
Description: {{=dish.description}}
Price: {{=dish.price}}
Ingredients:
Vegetarian: {{=dish.vegetarian}}
Vegan: {{=dish.vegan}}
Gluten Free: {{=dish.gluten_free}}


Venezuela Dream
Menu
Sign In
Donation
Contact
Sign Up
First Name
Last Name
Email
Password
Repeat Password
I agree to the
Terms of User
Sign Up
Sign in
Copyright © Your Website 2018
0
×
Message


| Total net profit | -53.03 | Gross profit | 39.58 | Gross loss | -92.61 |
| Profit factor | 0.43 | Expected payoff | -0.44 | ||
| Absolute drawdown | -54.77 | Maximal drawdown (%) | 56.17 (4012.14%) | ||
| Total trades | 120 | Profit trades (% of total) | 51 (42.5%) | Loss trades (% of total) | 69 (57.5%) |
| Long positions (won %) | 57 (49.12%) | Short positions (won %) | 63 (36.51%) | ||
| Largest | profit trade | 2.64 | loss trade | -3.46 | |
| Average | profit trade | 0.78 | loss trade | -1.34 | |
| Minimum | profit trade | 0.05 | loss trade | -0.02 | |
| Maximum | take profit in pips | 35.7 | stop loss in pips | -62.1 | |
| Average | take profit in pips | 10.8 | stop loss in pips | -21.4 | |
| Minimum | take profit in pips | -11.6 | stop loss in pips | -5.4 | |
| Maximum | Reward-Risk | 3.2 | Duration in minutes | 3087 | |
| Average | Reward-Risk | 0.6 | Duration in minutes | 205.8 | |
| Minimum | Reward-Risk | 0.0 | Duration in minutes | 0 | |
| Maximum | consecutive wins (profit in money) | 4.0 (3.68) | consecutive losses (loss in money) | 9.0 (-8.53) | |
| Average | consecutive wins | 1.0 | consecutive losses | 2.0 |
| Total net profit | -27.65 | Gross profit | 18.48 | Gross loss | -46.13 |
| Profit factor | 0.4 | Expected payoff | -0.49 | ||
| Absolute drawdown | -28.34 | Maximal drawdown (%) | 28.39 (56780.0%) | ||
| Total trades | 57 | Profit trades (% of total) | 28 (49.12%) | Loss trades (% of total) | 29 (50.88%) |
| Largest | profit trade | 2.64 | loss trade | -3.46 | |
| Average | profit trade | 0.66 | loss trade | -1.59 | |
| Minimum | profit trade | 0.05 | loss trade | -0.02 | |
| Maximum | take profit in pips | 35.7 | stop loss in pips | -46.4 | |
| Average | take profit in pips | 9.1 | stop loss in pips | -24.5 | |
| Minimum | take profit in pips | -11.6 | stop loss in pips | -10.6 | |
| Maximum | Reward-Risk | 2.0 | Duration in minutes | 3087.0 | |
| Average | Reward-Risk | 0.4 | Duration in minutes | 298.2 | |
| Minimum | Reward-Risk | 0.0 | Duration in minutes | 2.0 | |
| Maximum | consecutive wins (profit in money) | 4.0 (2.38) | consecutive losses (loss in money) | 5.0 (-6.82) | |
| Average | consecutive wins | 1.0 | consecutive losses | 1.0 |
| Total net profit | -25.38 | Gross profit | 21.1 | Gross loss | -46.48 |
| Profit factor | 0.45 | Expected payoff | -0.4 | ||
| Absolute drawdown | -27.5 | Maximal drawdown (%) | 28.85 (2137.04%) | ||
| Total trades | 63 | Profit trades (% of total) | 23 (36.51%) | Loss trades (% of total) | 40 (63.49%) |
| Largest | profit trade | 2.24 | loss trade | -3.15 | |
| Average | profit trade | 0.92 | loss trade | -1.16 | |
| Minimum | profit trade | 0.27 | loss trade | -0.05 | |
| Maximum | take profit in pips | 33.3 | stop loss in pips | -62.1 | |
| Average | take profit in pips | 12.3 | stop loss in pips | -18.6 | |
| Minimum | take profit in pips | -0.6 | stop loss in pips | -5.4 | |
| Maximum | Reward-Risk | 3.2 | Duration in minutes | 1723.0 | |
| Average | Reward-Risk | 0.8 | Duration in minutes | 122.2 | |
| Minimum | Reward-Risk | Duration in minutes | 0.0 | ||
| Maximum | consecutive wins (profit in money) | 3.0 (2.24) | consecutive losses (loss in money) | 8.0 (-7.17) | |
| Average | consecutive wins | 1.0 | consecutive losses | 2.0 |


mozilla.org (no target set)
mozilla.org (target is _top)
mozilla.org (target is named_window)
./index.html (leads nowhere but is local)
mozilla.com (target is _blank)


Ralph Cake with Equitable Savings and Loan (left), Head Oregon Football Coach Len Casanova, Oregon Assistant Athletic Director Norv Ritchey and Oregon Athletic Director Leo Harris look over a model of the proposed Autzen Stadium in 1967. (University of Oregon Special Collections & Archives)
Thomas J. Autzen in a 1930 photo, for who Autzen Stadium was named. (Chris Pietsch/The Register-Guard)
Autzen Stadium under construction in 1967. (1968 Oregana)
Autzen Stadium under construction in 1967. (1968 Oregana)
Autzen Stadium under construction in 1967. (1968 Oregana)
Autzen Stadium under construction in 1967.(Chris Pietsch/The Register-Guard)
Autzen Stadium under construction in 1967.(Chris Pietsch/The Register-Guard)
UO cheerleaders at the first game in Autzen Stadium, Sept. 23, 1967. (University of Oregon Special Collections & Archives)
The crowd and Colorado band at first game in Autzen Stadium, Sept. 23, 1967. (University of Oregon Special Collections & Archives)
University of Oregon football coach Jerry Frei, coaching a game at Autzen Stadium in September 1970. (Wayne Eastburn/The Register-Guard, 1970)


Sunit Sivasankaran
<EMAIL_ADDRESS>Supervisors : Emmanuel Vincent, Inria, France Dominique Fohr, Loria, France
| Single Speaker |
Single Speaker + noise |
2 speakers + noise |
| 12.5 | 25.5 | 66.5 |
| True DOA (Proposed) |
Est DOA (with GCC-PHAT) |
Deflation (Proposed) |
Conv-Tasnet |
| 35.0 | 54.5 | 44.2 | 53.2 |


|
Panda3D
|
This is a common base class for both DynamicTextFont and PNMTextMaker. More...
Public Types | |
| enum | WindingOrder { WO_default = 0, WO_left = 1, WO_right = 2, WO_invalid = 3 } |
Public Member Functions | |
| int | getFontPixelSize () |
| This is used to report whether the requested pixel size is being only approximated by a fixed-pixel-size font. More... | |
| float | getLineHeight () |
| Returns the number of units high each line of text is. More... | |
| bool | getNativeAntialias () |
| Returns whether Freetype's built-in antialias mode is enabled. More... | |
| float | getPixelSize () |
| Returns the size of the font in pixels, as it appears in the texture. More... | |
| float | getPixelsPerUnit () |
| Returns the resolution of the texture map. More... | |
| float | getPointSize () |
| Returns the point size of the font. More... | |
| float | getScaleFactor () |
| Returns the antialiasing scale factor. More... | |
| float | getSpaceAdvance () |
| Returns the number of units wide a space is. More... | |
| FreetypeFont::WindingOrder | getWindingOrder () |
| Returns the winding order set via set_winding_order(). More... | |
| setNativeAntialias (bool native_antialias) | |
| Sets whether the Freetype library's built-in antialias mode is enabled. More... | |
| bool | setPixelSize (float pixel_size) |
| Computes the appropriate pixels_per_unit value to set the size of the font in the texture to the indicated number of pixels. More... | |
| bool | setPixelsPerUnit (float pixels_per_unit) |
| Set the resolution of the texture map, and hence the clarity of the resulting font. More... | |
| bool | setPointSize (float point_size) |
| Sets the point size of the font. More... | |
| bool | setScaleFactor (float scale_factor) |
| Sets the factor by which the font is rendered larger by the FreeType library before being filtered down to its actual size in the texture as specified by set_pixels_per_unit(). More... | |
| setWindingOrder (FreetypeFont::WindingOrder winding_order) | |
| Specifies an explicitly winding order on this particular font. More... | |
| Public Member Functions inherited from Namable | |
| __init__ (const Namable) | |
| __init__ (str initial_name) | |
| clearName () | |
| Resets the Namable's name to empty. More... | |
| str | getName () |
| bool | hasName () |
| Returns true if the Namable has a nonempty name set, false if the name is empty. More... | |
| output (Ostream out) | |
| Outputs the Namable. More... | |
| setName (str name) | |
Static Public Member Functions | |
| static float | getPointsPerInch () |
| Returns the number of points in one inch. More... | |
| static float | getPointsPerUnit () |
| Returns the point size of the font that is one Panda unit high. More... | |
| Static Public Member Functions inherited from Namable | |
| static TypeHandle | getClassType () |
Public Attributes | |
| FreetypeFont::WindingOrder | winding_order |
| Returns the winding order set via set_winding_order(). More... | |
| Public Attributes inherited from Namable | |
| const String | name |
This is a common base class for both DynamicTextFont and PNMTextMaker.
Both of these are utility classes that use the FreeType library to generate glyphs from fonts; this class abstracts out that common wrapper around FreeType.
| enum WindingOrder |
| int getFontPixelSize | ( | ) |
This is used to report whether the requested pixel size is being only approximated by a fixed-pixel-size font.
This returns 0 in the normal case, in which a scalable font is used, or the fixed-pixel-size font has exactly the requested pixel size.
If this returns non-zero, it is the pixel size of the font that we are using to approximate our desired size.
| float getLineHeight | ( | ) |
Returns the number of units high each line of text is.
| bool getNativeAntialias | ( | ) |
Returns whether Freetype's built-in antialias mode is enabled.
See set_native_antialias().
| float getPixelSize | ( | ) |
Returns the size of the font in pixels, as it appears in the texture.
| float getPixelsPerUnit | ( | ) |
Returns the resolution of the texture map.
See set_pixels_per_unit().
| float getPointSize | ( | ) |
Returns the point size of the font.
|
static |
Returns the number of points in one inch.
This is a universal typographic convention.
|
static |
Returns the point size of the font that is one Panda unit high.
This is an arbitrary Panda convention for text, and is set to 10.0.
| float getScaleFactor | ( | ) |
Returns the antialiasing scale factor.
See set_scale_factor().
| float getSpaceAdvance | ( | ) |
Returns the number of units wide a space is.
| FreetypeFont::WindingOrder getWindingOrder | ( | ) |
Returns the winding order set via set_winding_order().
| setNativeAntialias | ( | bool | native_antialias | ) |
Sets whether the Freetype library's built-in antialias mode is enabled.
There are two unrelated ways to achieve antialiasing: with Freetype's native antialias mode, and with the use of a scale_factor greater than one. By default, both modes are enabled.
At low resolutions, some fonts may do better with one mode or the other. In general, Freetype's native antialiasing will produce less blurry results, but may introduce more artifacts.
| bool setPixelSize | ( | float | pixel_size | ) |
Computes the appropriate pixels_per_unit value to set the size of the font in the texture to the indicated number of pixels.
This is just another way to specify pixels_per_unit().
| bool setPixelsPerUnit | ( | float | pixels_per_unit | ) |
Set the resolution of the texture map, and hence the clarity of the resulting font.
This sets the number of pixels in the texture map that are used for each onscreen unit.
Setting this number larger results in an easier to read font, but at the cost of more texture memory.
This should only be called before any characters have been requested out of the font, or immediately after calling clear().
| bool setPointSize | ( | float | point_size | ) |
Sets the point size of the font.
This controls the apparent size of the font onscreen. By convention, a 10 point font is about 1 screen unit high.
This should only be called before any characters have been requested out of the font, or immediately after calling clear().
| bool setScaleFactor | ( | float | scale_factor | ) |
Sets the factor by which the font is rendered larger by the FreeType library before being filtered down to its actual size in the texture as specified by set_pixels_per_unit().
This may be set to a number larger than 1.0 to improve the font's antialiasing (since FreeType doesn't really do a swell job of antialiasing by itself). There is some performance implication for setting this different than 1.0.
This should only be called before any characters have been requested out of the font, or immediately after calling clear().
| setWindingOrder | ( | FreetypeFont::WindingOrder | winding_order | ) |
Specifies an explicitly winding order on this particular font.
This is only necessary if the render_mode is RM_polygon or RM_solid, and only if FreeType appears to guess wrong on this font. Normally, you should leave this at WO_default.
| FreetypeFont::WindingOrder winding_order |
Returns the winding order set via set_winding_order().


SyncReplicasOptimizer
Class to synchronize, aggregate gradients and pass them to the optimizer.
Inherits From: Optimizer
This class is deprecated. For synchrononous training, please use Distribution Strategies.
In a typical asynchronous training environment, it's common to have some stale gradients. For example, with a N-replica asynchronous training, gradients will be applied to the variables N times independently. Depending on each replica's training speed, some gradients might be calculated from copies of the variable from several steps back (N-1 steps on average). This optimizer avoids stale gradients by collecting gradients from all replicas, averaging them, then applying them to the variables in one shot, after which replicas can fetch the new variables and continue.
The following accumulators/queue are created:
gradient accumulators
, one per variable to train. Gradients are pushed
to them and the chief worker will wait until enough gradients are collected
and then average them before applying to variables. The accumulator will
drop all stale gradients (more details in the accumulator op).token
queue where the optimizer pushes the new global_step value after
all variables are updated.The following local variable is created:
* sync_rep_local_step
, one per replica. Compared against the global_step in
each accumulator to check for staleness of the gradients.
The optimizer adds nodes to the graph to collect gradients and pause the trainers until variables are updated. For the Parameter Server job:
global_step
in the token_queue
, once for
each worker replica. The workers can now fetch the global step, use it to
update its local_step variable and start the next batch. Please note that
some workers can consume multiple minibatches, while some may not consume
even one. This is because each worker fetches minibatches as long as
a token exists. If one worker is stuck for some reason and does not
consume a token, another worker can use it.# Create any optimizer to update the variables, say a simple SGD: opt = GradientDescentOptimizer(learning_rate=0.1) # Wrap the optimizer with sync_replicas_optimizer with 50 replicas: at each # step the optimizer collects 50 gradients before applying to variables. # Note that if you want to have 2 backup replicas, you can change # total_num_replicas=52 and make sure this number matches how many physical # replicas you started in your job. opt = tf.compat.v1.train.SyncReplicasOptimizer(opt, replicas_to_aggregate=50, total_num_replicas=50) # Some models have startup_delays to help stabilize the model but when using # sync_replicas training, set it to 0. # Now you can call `minimize()` or `compute_gradients()` and # `apply_gradients()` normally training_op = opt.minimize(total_loss, global_step=self.global_step) # You can create the hook which handles initialization and queues. sync_replicas_hook = opt.make_session_run_hook(is_chief)
In the training program, every worker will run the train_op as if not synchronized.
with training.MonitoredTrainingSession( master=workers[worker_id].target, is_chief=is_chief, hooks=[sync_replicas_hook]) as mon_sess: while not mon_sess.should_stop(): mon_sess.run(training_op)
To use SyncReplicasOptimizer with an Estimator
, you need to send
sync_replicas_hook while calling the fit.
my_estimator = DNNClassifier(..., optimizer=opt) my_estimator.fit(..., hooks=[sync_replicas_hook])
__init__
__init__( opt, replicas_to_aggregate, total_num_replicas=None, variable_averages=None, variables_to_average=None, use_locking=False, name='sync_replicas' )
Construct a sync_replicas optimizer. (deprecated)
Warning: THIS FUNCTION IS DEPRECATED. It will be removed in a future version.
Instructions for updating:
The SyncReplicaOptimizer
class is deprecated. For synchrononous training, please use Distribution Strategies.
opt
: The actual optimizer that will be used to compute and apply the
gradients. Must be one of the Optimizer classes.replicas_to_aggregate
: number of replicas to aggregate for each variable
update.total_num_replicas
: Total number of tasks/workers/replicas, could be
different from replicas_to_aggregate.
If total_num_replicas > replicas_to_aggregate: it is backup_replicas +
replicas_to_aggregate.
If total_num_replicas < replicas_to_aggregate: Replicas compute
multiple batches per update to variables.variable_averages
: Optional ExponentialMovingAverage
object, used to
maintain moving averages for the variables passed in
variables_to_average
.variables_to_average
: a list of variables that need to be averaged. Only
needed if variable_averages is passed in.use_locking
: If True use locks for update operation.name
: string. Optional name of the returned operation.apply_gradients
apply_gradients( grads_and_vars, global_step=None, name=None )
Apply gradients to variables.
This contains most of the synchronization implementation and also wraps the apply_gradients() from the real optimizer.
grads_and_vars
: List of (gradient, variable) pairs as returned by
compute_gradients().global_step
: Optional Variable to increment by one after the
variables have been updated.name
: Optional name for the returned operation. Default to the
name passed to the Optimizer constructor.train_op
: The op to dequeue a token so the replicas can exit this batch
and start the next one. This is executed by each replica.ValueError
: If the grads_and_vars is empty.ValueError
: If global step is not provided, the staleness cannot be
checked.compute_gradients
compute_gradients( *args, **kwargs )
Compute gradients of "loss" for the variables in "var_list".
This simply wraps the compute_gradients() from the real optimizer. The gradients will be aggregated in the apply_gradients() so that user can modify the gradients like clipping with per replica global norm if needed. The global norm with aggregated gradients can be bad as one replica's huge gradients can hurt the gradients from other replicas.
*args
: Arguments for compute_gradients().**kwargs
: Keyword arguments for compute_gradients().A list of (gradient, variable) pairs.
get_chief_queue_runner
get_chief_queue_runner()
Returns the QueueRunner for the chief to execute.
This includes the operations to synchronize replicas: aggregate gradients, apply to variables, increment global step, insert tokens to token queue.
Note that this can only be called after calling apply_gradients() which actually generates this queuerunner.
A QueueRunner
for chief to execute.
ValueError
: If this is called before apply_gradients().get_init_tokens_op
get_init_tokens_op(num_tokens=-1)
Returns the op to fill the sync_token_queue with the tokens.
This is supposed to be executed in the beginning of the chief/sync thread
so that even if the total_num_replicas is less than replicas_to_aggregate,
the model can still proceed as the replicas can compute multiple steps per
variable update. Make sure:
num_tokens >= replicas_to_aggregate - total_num_replicas
.
num_tokens
: Number of tokens to add to the queue.An op for the chief/sync replica to fill the token queue.
ValueError
: If this is called before apply_gradients().ValueError
: If num_tokens are smaller than replicas_to_aggregate -
total_num_replicas.get_name
get_name()
get_slot
get_slot( *args, **kwargs )
Return a slot named "name" created for "var" by the Optimizer.
This simply wraps the get_slot() from the actual optimizer.
*args
: Arguments for get_slot().**kwargs
: Keyword arguments for get_slot().The Variable
for the slot if it was created, None
otherwise.
get_slot_names
get_slot_names( *args, **kwargs )
Return a list of the names of slots created by the Optimizer
.
This simply wraps the get_slot_names() from the actual optimizer.
*args
: Arguments for get_slot().**kwargs
: Keyword arguments for get_slot().A list of strings.
make_session_run_hook
make_session_run_hook( is_chief, num_tokens=-1 )
Creates a hook to handle SyncReplicasHook ops such as initialization.
minimize
minimize( loss, global_step=None, var_list=None, gate_gradients=GATE_OP, aggregation_method=None, colocate_gradients_with_ops=False, name=None, grad_loss=None )
Add operations to minimize loss
by updating var_list
.
This method simply combines calls compute_gradients()
and
apply_gradients()
. If you want to process the gradient before applying
them call compute_gradients()
and apply_gradients()
explicitly instead
of using this function.
loss
: A Tensor
containing the value to minimize.global_step
: Optional Variable
to increment by one after the
variables have been updated.var_list
: Optional list or tuple of Variable
objects to update to
minimize loss
. Defaults to the list of variables collected in
the graph under the key GraphKeys.TRAINABLE_VARIABLES
.gate_gradients
: How to gate the computation of gradients. Can be
GATE_NONE
, GATE_OP
, or GATE_GRAPH
.aggregation_method
: Specifies the method used to combine gradient terms.
Valid values are defined in the class AggregationMethod
.colocate_gradients_with_ops
: If True, try colocating gradients with
the corresponding op.name
: Optional name for the returned operation.grad_loss
: Optional. A Tensor
holding the gradient computed for loss
.An Operation that updates the variables in var_list
. If global_step
was not None
, that operation also increments global_step
.
ValueError
: If some of the variables are not Variable
objects.When eager execution is enabled, loss
should be a Python function that
takes no arguments and computes the value to be minimized. Minimization (and
gradient computation) is done with respect to the elements of var_list
if
not None, else with respect to any trainable variables created during the
execution of the loss
function. gate_gradients
, aggregation_method
,
colocate_gradients_with_ops
and grad_loss
are ignored when eager
execution is enabled.
variables
variables()
Fetches a list of optimizer variables in the default graph.
This wraps variables()
from the actual optimizer. It does not include
the SyncReplicasOptimizer
's local step.
A list of variables.


By Chen Hui Jing / @hj_chen
>60% from images
Blurry image on HD 5K display?
5mb pixel-dense image on 3.8inch Nokia phone?
| WURFL.js | Requires additional development effort for it to place nice in your project |
| Adaptive image | Server-side solution; Dependent on PHP; May need to mess around with server configuration |
| Using cookies | Mostly experimental; Not advisable for production sites |
| Hack  | Not scalable for image heavy sites; Fails validation; Not semantic |
Responsive image solution native to the browser.
Refer to latest specification for all the details.
🎮 🏀 🚲 💻 👟
My name is Chen Hui Jing.
Self taught designer and developer.
Work at Nurun Singapore.
Write blog posts from time to time.
Declare comma-separated list of image sources, which browsers will serve according to certain conditions we specify using descriptors.
x descriptors indicate the pixel-density of an image
w descriptors indicate the width of an image
Specify the intended display size of the image
Must be present if w descriptors are used
Syntax: <media-condition> <CSS length>
You can't use percentages for the second condition.
The only relative CSS lengths you can use are viewport units.
sizes="(max-width: 400px) 100vw,
(max-width: 960px) 75vw,
640px"

A wrapper for the image and its sources.
Will not work without an  element.
<picture>
<source media="(min-width: 40rem)"
srcset="full-large.jpg 1024w,
full-medium.jpg 640w,
full-small.jpg 320w"
sizes="33.3vw" />
<source srcset="cropped-large.jpg 2x,
cropped-small.jpg 1x" />

</picture>
Allows us to declare multiple sets of image sources.
Syntax: <media attribute>|<type attribute> <srcset attribute>
<source media="(min-width: 1280px)" srcset="wide-large.jpg 1280w, wide-medium.jpg 960w, wide-small.jpg 640w" sizes="33.3vw">
<source media="(min-width: 960px)" srcset="cropped-large.jpg 960w, cropped-medium.jpg 720w, cropped-small.jpg 480w" sizes="50vw">
<source srcset="narrow-large.jpg 2x, narrow-small.jpg 1x">
<picture>
<source media="(min-width: 960px)" srcset="ticker-tape-large.jpg">
<source media="(min-width: 575px)" srcset="ticker-tape-medium.jpg">

</picture>
Order of source matters.
Falls back to original  element.
<picture>
<source type="image/vnd.ms-photo" src="wwc2015.jxr">
<source type="image/jp2" src="wwc2015.jp2">
<source type="image/webp" src="wwc2015.webp">

</picture>
The go-to polyfill for responsive images is Picturefill by Scott Jehl.
Native Responsive Images by Yoav Weiss
Responsive images get real with Mat Marquis
The anatomy of responsive images by Jake Archibald
Join the Responsive Images Community Group.
Sign up for their newsletter.
Follow the RICG on Twitter.


A collaborative initiative to grasp cancer in a new way
(05/11/15 - 05/05/16)
An innovative approach to the epidemiology of cancer in an open science framework
8.2M
people died of cancer
+70%
in the next decade :
increase in incidence of cancer
*Source: WHO - World Health Organization
big data
open community dynamics
By providing “the means of innovative research", "sustaining health democracy" and “supporting public policy on data sharing "
1 Understanding cancer distribution in time and space
2 Risks and protective factors in cancer
3 Meta - epidemiology : " Understanding Cancer from the medical literature "
4 Environmental changes and cancer
An open community of highly motivated people that has worked relentlessly with a common goal: developing an innovative approach to epidemiology of cancer by exploiting the potential of data science and big data
Source: Meetup statistics
1000+
attendees to events
3500+
human exchanges during events (weighted in time)
OCT
06
Meetup "Ethique et Data de santé"
36
OCT
15
Meetup "Le Traitement des données de santé, enjeux et réalités"
60
NOV
5
Soirée de lancement du Challenge4Cancer
200
NOV
12
Meetup "Les modèles d’épidémies sur base de données mobiles"
72
NOV
24
Meetup "Prédire la survie des cancers du poumon de stade précoce"
38
DEC
12
Meetup "Open data en cancérologie : un cas pratique"
63
JAN
14
Bocal #2 "Développer, faire progresser, documenter vos projets"
17
JAN
21
Meetup "Open data en santé : enjeux et débat"
44
FEV
4
Meetup Que se cache-t-il derrière cette ère de l'Open (Big Data, Science etc.) ?
87
FEV
13
RAMP : Rapid Analytics and Model Prototyping
31
FEV
18
Meetup Analyse des résultats de la RAMP
38
FEV
25
Bocal Oncologie et épidémiologie
17
MAR
1
Meetup "Un Google 3.0 du cancer : est-ce possible ?"
156
MAR
17
Meetup "À la découverte de la data science" + étude de cas oncologie
76
MAR
7
Meet-up "Premières réalisations de la communauté Epidemium"
22
AVR
14
Meetup "Méthodes de travail collaboratif 3.0"
36
AVR
30
RAMP 2 (Rapid Analytics and Model Prototyping)
24
MAY
19
Meetup & Workshop in writing collaborative scientific articles - with Authorea
19
114
Wiki accounts *
3600+
Wiki contributions **
* source epidemium wiki provided by mediawiki
** source epidemium wiki provided by mediawiki as changes on a page
That created a knowledge and a team-work methodology whose impact goes well beyond the proposed projects
“As a player in health innovation, Roche’s ambition with Epidemium is to reinvent a new form of cancer epidemiology to turn it into a genuine tool for therapeutic decision-making”
“As an open community laboratory, La Paillasse is convinced that collective intelligence can bring innovative solutions to the great scientific issues of the 21st century”
“The challenge will be to let innovative projects in cancer epidemiology emerge without anticipating their outcomes. This unprecedented level of openness - participants in a project will regularly publish their work on a wiki, freely reusable by anyone, at any time - is what makes Epidemium a unique experience of collective intelligence”
“The alliance of big data and medical concerns is extremely powerful but it must also be rigorously framed by the principles that, for a long time, have prevailed in the practice of medicine. I found it important to be able to take part to this beautiful program with an independent, scientific look, very careful of the various ethical issues”
An open community of volunteers whose efforts and engagement has brought about concrete results
678
Community members
459
Active members*
330
Registered participants**
75
Project team members
63
Finalists
8
finalists projects
Source : Meetup statistics and Epidemium.cc
Full list of projects here
1 WebApp
Project Venn : Linking cancer and air pollution through metadata
http://venn-epidemium.github.io
1 Serious Game
ELSE: Evolutive Life Selection Experience
http://conix.fr/epidemium/else.html
2 Data Visualization websites
Quantmetry Health: visualizing open health data
http://viz4cancer.epidemium.cc
Cancer Viz
http://cancerviz.weareopensource.me
Open community means a lot different actors working together driven by a common goal, sharing the same values, and ready to work relentlessly on a voluntary base.
The Epidemium team along with La Paillasse and Roche wish to thank all who have contributed to making Challenge4Cancer a success! First of all, we would like to thank members of the Independent Ethics Committee and the Scientific Committee who did not spare any effort in guiding the Epidemium team in designing, implementing and realizing the Challenge. Our community has particularly appreciated having the committees support in tackling ethical and methodological issues. We would especially like to thank our technical partners for providing resources to our community. Challenge4Cancer would not have succeeded in achieving tangible results without them. Challenge4Cancer is a community, and we therefore wish to acknowledge the values of all the members that shared their projects and demonstrated their engagement and motivation, working relentlessly and voluntarily to improve their projects and to attract new talents. Over a period of six months, we had the opportunity to meet and collaborate with amazing people, who accepted to participate in this ambitious challenge: organizing and animating our events, and presenting their projects. We thank you for your dedication and making this a community-wide success. In short, thank you to all the Epidemium Community and Supporters that took up the challenge of Open Science!


Practical, hands-on and interactive sessions to grow your skills and build your career. Learn stuff you can use at work and in your side projects.
Being a developer means learning and growing your skills. At Code Camp, you'll catch talks by seasoned developers on web, mobile, native, and cloud development.
Code Camp is where you can connect with peers, leaders, and dev companies in the Minnesota tech community.


I was looking for a reliable source of downers to come down from coke on. While searching, i found an online pharmacy that doesn't sell REALLY good stuff (like Oxy), but it does carry Codeine Phosphate ... WITHOUT Acetaminophen ... less than $1 a pill. Whee! I don't have to process it.
It gives me a nice mellow buzz, no paranoia like weed does, no loss of motor control like alcohol. The first time was a work night, so I only took one 50-mg pill, since I wasn't sure how it would affect me. It took about 30 minutes to hit, and it was light - kind of like how (legal) Demoral made me feel after surgery ... a little relaxed and happy, and very slightly buzzed.
Have to take more to get a real trip going, but only do that on weekends, 'cause you'll lose all motivation to accomplish anything. Still, it's a great buzz, and since I don't have to bother trying to extract the Acetaminophen, I'm going to keep trippin.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


--- layout: default date: 16/06/2019 ---
Covers races from 26th April — 14th June.
Last updated: {{ page.date | date: "%A, %B %e" }}
{% include standings.html riders=site.data.2019.series_3.ages teams=site.data.2019.series_3.agesteam %} {% include datetime.html %}


ONCE upon a time there was a woman, and she baked five pies. And when they came out of the oven, they were that overbaked the crusts were too hard to eat. So she says to her daughter:
'Darter,' says she, 'put you them there pies on the shelf, and leave 'em there a little, and they'll come again.'
But the girl, she says to herself: 'Well, if they'll come again, I'll eat 'em now.' And she set to work and ate 'em all, first and last.
Well, come supper-time the woman said: 'Go you, and get one o' them there pies. I dare say they've come again now.'
The girl went and she looked, and there was nothing but the dishes. So back she came and says she: 'Noo, they ain't come again.'
'Not one of 'em?' says the mother.
'Not one of' 'em,' says she.
'Well, come again, or not come again,' said the woman, 'I'll have one for supper.'
'But you can't, if they ain't come,' said the girl.
'But I can,' says she. 'Go you, and bring the best of 'em.'
'Best or worst,' says the girl, 'I've ate 'em all, and you can't have one till that's come again.'
Well, the woman she was done, and she took her spinning to the door to spin, and as she span she sang:
'My darter ha' ate five, five pies today.
My darter ha' ate five, five pies today.'
The king was coming down the street, and he heard her sing, but what she sang he couldn't hear, so he stopped and said:
'What was that you were singing, my good woman?'
The woman was ashamed to let him hear what her daughter had been doing, so she sang, instead of that:
'My darter ha' spun five, five skeins today.
My darter ha' spun five, five skeins today.'
'Stars o' mine!' said the king, 'I never heard tell of anyone that could do that.' Then he said: 'Look you here, I want a wife, and I'll marry your daughter. But look you here,' says he, 'eleven months out of the year she shall have all she likes to eat, and all the gowns she likes to get, and all the company she likes to keep; but the last month of the year she'll have to spin five skeins every day, and if she don't I shall kill her.'
'All right,' says the woman; for she thought what a grand marriage that was. And as for the five skeins, when the time came, there'd be plenty of ways of getting out of it, and likeliest, he'd have forgotten all about it.
Well, so they were married. And for eleven months the girl had all she liked to eat, and all the gowns she liked to get, and all the company she liked to keep.
But when the time was getting over, she began to think about the skeins and to wonder if he had 'em in mind. But not one word did he say about 'em, and she thought he'd wholly forgotten 'em.
However, the last day of the last month he takes her to a room she'd never set eyes on before. There was nothing in it but a spinning-wheel and a stool.
And away he went about his business.
Well, she was that frightened, she'd always been such a gatless girl, that she didn't so much as know how to spin, and what was she to do tomorrow with no one to come nigh her to help her? She sate down on a stool in the kitchen, and law! how she did cry!
However, all of a sudden she heard a sort of a knocking low down on the door. She upped and oped it, and what should she see but a small little black thing with a long tail. That looked up at her right curious, and that said:
'What are you a-crying for?'
'What's that to you?' says she.
'Never you mind,' that said, 'but tell me what you're a-crying for.'
'That won't do me no good if I do,' says she.
'You don't know that,' that said, and twirled that's tail round.
'Well,' says she, 'that won't do no harm, if that don't do no good,' and she upped and told about the pies, and the skeins, and everything.
'This is what I'll do,' says the little black thing.
That looked out of the corner of that's eyes, and that said:
'I'll give you three guesses every night to guess my name, and if you haven't guessed it before the month's up you shall be mine.'
Well, she thought, she'd be sure to guess that's name before the month was up. 'All right,' says she, 'I agree.'
'All right,' that says, and law! how that twirled that's tail.
Well, the next day, her husband took her into the room, and there was the flax and the day's food.
 And then he went out and locked the door.
He'd hardly gone, when there was a knocking against the window.
She upped and she oped it, and there sure enough was the little old thing sitting on the ledge.
'Where's the flax?' says he.
'Here it be,' says she. And she gave it to him.
Well, come the evening a knocking came again to the window. She upped and she oped it, and there was the little old thing with five skeins of flax on his arm.
'Here it be,' says he, and he gave it to her.
'Now, what's my name?' says he.
'What, is that Bill?' says she.
'Noo, that ain't,' says he, and he twirled his tail. 'Is that Ned?' says she.
'Noo, that ain't,' says he, and he twirled his tail. 'Well, is that Mark?' says she.
'Noo, that ain't,' says he, and he twirled his tail harder, and away he flew.
Well, when her husband came in, there were the five skeins ready for him.
Well, every day the flax and the food were brought, and every day that there little black impet used to come mornings and evenings. And all the day the girl sate trying to think of names to say to it when it came at night. But she never hit on the right one. And as it got towards the end of the month, the impet began to look so maliceful, and that twirled that's tail faster and faster each time she gave a guess.
At last it came to the last day but one. The impet came at night along with the five skeins, and that said:
'What, ain't you got my name yet?'
'Is that Nicodemus?' says she.
'Noo, 't ain't,' that says.
'Is that Sammle?' says she.
'Noo, 't ain't,' that says.
'A-well, is that Methusalem?' says she.
'Noo, 't ain't that neither,' that says.
Then that looks at her with that's eyes like a coal of fire, and that says: 'Woman, there's only tomorrow night, and then you'll be mine!' And away it flew.
Well, she felt that horrid. However, she heard the king coming along the passage. In he came, and when he sees the five skeins, he says, says he:
'Well, my dear,' says he.  So they brought supper, and another stool for him, and down the two sate.
Well, he hadn't eaten but a mouthful or so, when he stops and begins to laugh.
'What is it?' says she.
'A-why,' says he, 'I was out a-hunting today, and I got away to a place in the wood I'd never seen before. And there was an old chalk-pit. And I heard a kind of a sort of humming. So I got off my hobby, and I went right quiet to the pit, and I looked down. Well, what should there be but the funniest little black thing you ever set eyes on. And what was that doing, but that had a little spinning-wheel, and that was spinning wonderful fast, and twirling that's tail. And as that span that sang:
'Nimmy nimmy not
My name's Tom Tit Tot.'
Well, when the girl heard this, she felt as if she could have jumped out of her skin for joy, but she didn't say a word.
Next day that there little thing looked so maliceful when he came for the flax. And when night came she heard that knocking against the window panes. She oped the window, and that come right in on the ledge. That was grinning from ear to ear, and Oo! that's tail was twirling round so fast.
'What's my name?' that says, as that gave her the skeins.
'Is that Solomon?' she says, pretending to be afeard.
'Noo, 'tain't,' that says, and that came further into the room.
'Well, is that Zebedee?' says she again.
'Noo, 'tain't,' says the impet. And then that laughed and twirled that's tail till you couldn't hardly see it.
'Take time, woman,' that says; 'next guess, and you're mine.' And that stretched out that's black hands at her.
Well, she backed a step or two, and she looked at it, and then she laughed out, and says she, pointing her finger at it:
'Nimmy nimmy not
Your name's Tom Tit Tot.'
Well, when that heard her, that gave an awful shriek and away that flew into the dark, and she never saw it any more.


ErrorFile()
语法
Result$ = ErrorFile()概要
Returns the filename of the source code or includefile where the current error occurred. This command only returns a meaningful value if there was an error handled by OnErrorCall() or OnErrorGoto().
The tracking of line numbers needs to be enabled on compilation for this command to return the actual file name. To enable this feature, enable the "Enable OnError lines support" checkbox in the compiler options or specify the /LINENUMBERING (Windows) or --linenumbering (Linux, Mac OSX) command-line switch when compiling from the command-line.
参数
无.
返回值
The filename of the error, or "OnError line support disabled" if the OnError lines support is disabled. (A simple way to check if the OnError lines support is enabled is to check if the result of ErrorLine() is not -1.)
已支持操作系统
所有


ID of the record.
Integer, default = null
If you defined a form that has .recid and .url
properties defined, the form data will be loaded from the remote data source into the .record object.
You can defined it during object creation:
Or you can change this property during run-time


I am a nurse in Los Angeles and I work on a very busy medical surgical unit. I work the night shift from 7p.m. to 7a.m..
I got off work on a beautiful July morning in 2005. I got home and did my usual routine of taking my beautiful little Pekingese, Kong on a short walk in the park across from my home on Sunset. I got home from the walk and took my multivitamin and an Ambien 10mg.I had been taking Ambien for approximately 7 years without incident until that day. I then took a warm shower and put on my pajama pants and tee shirt and down on the couch to watch some TV before crashing. I was already feeling the wonderful relaxing effects of the Ambien. I learned over the years of taking Ambien that if I fought going to sleep, I could have a wonderful little 'Ambien trip'. I would feel this warm sensation in my chest and feel my whole body relax and my mind would totally disconnect from reality. This was always an enjoyable side effect of Ambien until this day.
The doorbell rang and it was my neighbor and I invited him in and I asked if he would like some coffee. I made a pot of coffee on Ambien and did a pretty good job of it. I remember sitting there while my neighbor rambled on about his love life with a girl that was just using him. A really boring story. I took a second Ambien because I thought the effects of the first Ambien were diminishing. Anyways my neighbor left about half an hour after he arrived. At this point I can only remeber parts of what happened next. I remember taking two more Ambien and calling a friend of mine who was at work and laughing and falling on the floor and I remember my friend asked me to please get in the bed and to not smoke in my house and he would come by and check on me at lunch.
[Erowid Note: Driving while intoxicated or tripping is dangerous and irresponsible because it endangers other people. Don't do it!]
I remember thinking lunch sounded really good, so I got my keys and my Pekingese, Kong and drove to the local hamburger joint and pulling up to the drivethru and pulling to close and backing up and pulling forward and scraping the side of my car against the building. Well there was an LAPD cruiser behind me with two officers witnessing all of this maddness. I was asked to pull over for questioning. I submitted to a breathilizer test blew a 0.00. I then submitted to a field sobriety test and failed it miserably. I remember being really embarrassed and scared at the same time. I was then promptly arrested for DUI and went to jail for the day. I bonded out about nine hours later and my friend picked me up. I remember I took an hour long shower when I got home and I also remember feeling depressed and horrified of what took place that day.
The next night I was so depressed and scared, I drank a couple of beers and took two Ambiens and I attempted to drive to my friends house because I was so scared and depressed and now I was totally drugged out of my mind from the Ambien and the beer. I was driving down the wrong side of the road and hit a palm tree. I was sent to the hospital that I worked at and was treated for minor injuries and was re-arrested for another DUI.  I lost my nursing license and had to pay an attorney $14,000.00 to defend me. I had to pay another $30,000.00 in rehab treatment fees and counseling fees. I am now free from Ambien, but still miss it, but I know that I can never take another one or there is not telling what would happen next.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


© 2019
| chrysacanthion chrysacanthia | occurring with golden spines | |||
| chrysos | chrys | noun/m | χρυσοϛ gold | |
| acantha | acanth | noun/f | ακανϑα thorn, thistle | |
| ion | i | noun/n | -ιον substantive suffix for nouns: an occurrence of a noun | |
| chrysellus chrysella chrysellum | golden | |||
| chrysos | chrys | noun/m | χρυσοϛ gold | |
| ellus | ell | adj | adjective suffix for adjective: diminutive | |
| Acacia chrysella | ||||
| chryseus chrysea chryseum | golden | |||
| chryseus | chryse | adj | χρυσεοϛ gold colored | |
| Holmgrenia chrysea (Schwaegr. in Schultes) Lindb. Orthothecium chryseum (Schwaegr. in Schultes) Schimp. in B.S.G. | ||||
| chrysitis chrysites | golden | |||
| chrysos | chrys | noun/m | χρυσοϛ gold | |
| itis | it | noun/m | ites -ιταϛ ? substantive suffix for nouns: connection to a noun | |
| chrysocarpus chrysocarpa chrysocarpum | golden fruited | |||
| chrysos | chrys | noun/m | χρυσοϛ gold | |
| o | o | cnct | connective vowel in botanical Latin, usually for Greek words but in some cases, such as color tingeing, for Latin words | |
| carpos | carp | noun/m | καρποϛ fruit | |
| us | adj | Latinizing suffix | ||
| Crataegus chrysocarpa Ashe Rumex chrysocarpus Moris | ||||
| chrysocephalus chrysocephala chrysocephalum | golden head | |||
| chrysos | chrys | noun/m | χρυσοϛ gold | |
| o | o | cnct | connective vowel in botanical Latin, usually for Greek words but in some cases, such as color tingeing, for Latin words | |
| cephale | cephal | noun/f | κεφαλη head; front; end, point; source, top; chief person | |
| us | adj | Latinizing suffix | ||
| Chaenotheca chrysocephala (Turner ex Ach.) Th. Fr. Eriogonum chrysocephalum Gray | ||||
| chrysocomus chrysocoma chrysocomum | with golden hair | |||
| chrysos | chrys | noun/m | χρυσοϛ gold | |
| o | o | cnct | connective vowel in botanical Latin, usually for Greek words but in some cases, such as color tingeing, for Latin words | |
| come | com | noun/f | κομη hair hair, foliage | |
| us | adj | Latinizing suffix | ||
| Achillea chrysocoma Frivald Andropogon chrysocomus Nash | ||||
| chrysocraspedus chrysocraspeda chrysocraspedum | golden fringed | |||
| chrysos | chrys | noun/m | χρυσοϛ gold | |
| o | o | cnct | connective vowel in botanical Latin, usually for Greek words but in some cases, such as color tingeing, for Latin words | |
| craspedon | crasped | noun/n | κρασπεδον edge, border, fringe | |
| us | adj | Latinizing suffix | ||
| chrysocyathus chrysocyatha chrysocyathum | golden cup | |||
| chrysos | chrys | noun/m | χρυσοϛ gold | |
| o | o | cnct | connective vowel in botanical Latin, usually for Greek words but in some cases, such as color tingeing, for Latin words | |
| cyathos | cyath | noun/m | κυαϑοϛ cup, dipper | |
| us | adj | Latinizing suffix | ||
| Adonis chrysocyathus Hook. f. & Thomson | ||||
| chrysogonus chrysogona chrysogonum | golden start | |||
| chrysos | chrys | noun/m | χρυσοϛ gold | |
| o | o | cnct | connective vowel in botanical Latin, usually for Greek words but in some cases, such as color tingeing, for Latin words | |
| gone | gon | noun/f | γονη origin, birth; conception | |
| us | adj | Latinizing suffix | ||
| chrysolepis chrysolepides | golden scaled | |||
| chrysos | chrys | noun/m | χρυσοϛ gold | |
| o | o | cnct | connective vowel in botanical Latin, usually for Greek words but in some cases, such as color tingeing, for Latin words | |
| lepis | lepid | noun/f | λεπιϛ scale, shell | |
| Quercus chrysolepis Liebm. | ||||
| chrysoleucus chrysoleuca chrysoleucum | gold and white | |||
| chrysos | chrys | noun/m | χρυσοϛ gold | |
| o | o | cnct | connective vowel in botanical Latin, usually for Greek words but in some cases, such as color tingeing, for Latin words | |
| leucos | leuc | adj | λευκοϛ bright, brilliant, clear; white, pale | |
| us | adj | Latinizing suffix | ||
| Lecanora chrysoleuca (Sm.) Ach. Anemopaegma chrysoleucum (Kunth) Sandwith | ||||
| chrysolobus chrysoloba chrysolobum | golden lobed | |||
| chrysos | chrys | noun/m | χρυσοϛ gold | |
| o | o | cnct | connective vowel in botanical Latin, usually for Greek words but in some cases, such as color tingeing, for Latin words | |
| lobus | lob | noun/m | λοβοϛ Late L Greek: lobe of the ear; late Latin: husk, pod | |
| us | adj | Latinizing suffix | ||
| chrysophyllus chrysophylla chrysophyllum | golden leaved | |||
| chrysos | chrys | noun/m | χρυσοϛ gold | |
| o | o | cnct | connective vowel in botanical Latin, usually for Greek words but in some cases, such as color tingeing, for Latin words | |
| phyllon | phyll | noun/n | φυλλον leaf; foliage | |
| us | adj | Latinizing suffix | ||
| Iris chrysophylla T.J.Howell Campylium chrysophyllum (Brid.) J. Lange Rubus chrysophyllus Reinw. ex Miq. | ||||
| chrysostoma chrysostomata | golden mouth | |||
| chrysos | chrys | noun/m | χρυσοϛ gold | |
| o | o | cnct | connective vowel in botanical Latin, usually for Greek words but in some cases, such as color tingeing, for Latin words | |
| stoma | stomat | noun/n | στομα, ατοσ the mouth | |
| Lasthenia chrysostoma (Fisch. & C.A.Mey.) Greene | ||||
| cibarius cibaria cibarium | of food | |||
| cibarius | cibari | adj | of or pertaining to food | |
| Crataegus cibaria Beadle Astragalus cibarius Sheldon | ||||
| cicatricatus cicatricata cicatricatum | scarred | |||
| cicatrix | cicatric | noun/f | a scar | |
| atus | at | adj | adjectival suffix for nouns: possessive of or likeness of something (with, shaped, made)/ for verb participles: a completed action, -ed | |
| cicatricosus cicatricosa cicatricosum | covered with scars | |||
| cicatrix | cicatric | noun/f | a scar | |
| osus | os | adj | adjective suffix for nouns: plenitude or notable development | |
| Glyphis cicatricosa Ach. | ||||
| ciconius ciconia ciconium | like a stork | |||
| ciconia | ciconi | noun/f | a stork | |
| us | adj | Latinizing suffix | ||
| Erodium ciconium (L.) L'Her. ex Ait. | ||||
| cicutarius cicutaria cicutarium | pertaining to hemlock | |||
| cicuta | cicut | noun/f | hemlock, poison from the hemlock | |
| arius | ari | adj | adjective suffix for nouns or numbers: connected to or possessed by | |
| Anemia cicutaria Kunze ex Spreng. Erodium cicutarium (L.) L'Her. ex Ait. | ||||
| ciliaris ciliaris ciliare | fringed with hair | |||
| cilium | cili | noun/n | eyelash & eyelid together | |
| aris | ar | adj | alis adjective suffix for nouns: of or pertaining to | |
| Desmodium ciliare (Muhl. ex Willd.) DC. Platanthera ciliaris (L.) Lindl. | ||||
| ciliatissimus ciliatissima ciliatissimum | fringed with the most hairs | |||
| cilium | cili | noun/n | eyelash & eyelid together | |
| superlative of at | at | pre | ad to, towards, near | |
| issimus | issim | adj | superlative suffix; most so, to the greatest degree; most-, -est (e.g. largest, prettiest, whitest) | |
| Brachiaria ciliatissima (Buckl.) Chase | ||||
| ciliatus ciliata ciliatum | fringed with hairs | |||
| cilium | cili | noun/n | eyelash & eyelid together | |
| atus | at | adj | adjectival suffix for nouns: possessive of or likeness of something (with, shaped, made)/ for verb participles: a completed action, -ed | |
| Amsonia ciliata Walt. Geum ciliatum Pursh Acrobolbus ciliatus (Mitt.) Schiffn. | ||||
| cilicius cilicia cilicium | Cilicia, Turkey | |||
| cilicius | cilici | adj | Cilicius Κιλικιοϛ of or pertaining to Cilicia: a province in southern Asia Minor | |
| Colutea cilicia Allium cilicium Boiss. | ||||
| ciliicalyx ciliicalyces | calyx with cilia | |||
| cilium | cili | noun/n | eyelash & eyelid together | |
| i | i | cnct | connective vowel used by botanical Latin | |
| calyx | calyc | noun/f | καλυξ, υκοϛ husk, covering, calyx | |
| Menziesia ciliicalyx Maxim. | ||||
| ciliolatus ciliolata ciliolatum | with little cilia | |||
| cilium | cili | noun/n | eyelash & eyelid together | |
| olum | ol | noun/n | olus substantive suffix for 1st & 2nd declention nouns: diminutive | |
| atus | at | adj | adjectival suffix for nouns: possessive of or likeness of something (with, shaped, made)/ for verb participles: a completed action, -ed | |
| Monnina ciliolata DC. Brachionidium ciliolatum Garay Aster ciliolatus Lindl. | ||||
| ciliosus ciliosa ciliosum | lots of cilia | |||
| cilium | cili | noun/n | eyelash & eyelid together | |
| osus | os | adj | adjective suffix for nouns: plenitude or notable development | |
| Lonicera ciliosa (Pursh) Poir. ex DC. Sedum ciliosum T.J. Howell |


Forum: CleanupIssue: EVALHOOK-STEP-CONFUSION
References: CLtL p 321, 323, 441
Issue STEP-ENVIRONMENT (passed)
Issue APPLYHOOK-ENVIRONMENT (passed)
Category: CHANGE/CLARIFICATION
Edit History: V1, 9 Oct 1989, Sandra Loosemore
V2, 2 Nov 1989, Sandra Loosemore (update discussion)
V3, 4 Dec 1990, Pitman (amendment per X3J13)
Problem Description:
Common Lisp permits the evaluator to be implemented by compiling the
form before executing it, but notes that this techniques "renders the
EVALHOOK mechanism relatively useless" (CLtL p. 321).
CLtL also requires the STEP utility to be implemented in terms of
EVALHOOK (p. 323). The restriction against implementing STEP using
some other technique (such as annotations on code lexically within the
body of the STEP) that make more sense in a compiled-only
implementation is pointless. It is probably not even desirable for
STEP to be implemented with *EVALHOOK*, since this effectively causes
the stepper to break on user programs that also use *EVALHOOK*.
Proposal (EVALHOOK-STEP-CONFUSION:X3J13-NOV-89):
(a) Remove the requirement that STEP be implemented using *EVALHOOK*.
Make it explicitly vague whether the scope of the code that is affected
by STEP is lexical or dynamic.
(b) Delete *EVALHOOK*, *APPLYHOOK*, EVALHOOK, and APPLYHOOK.
Proposal (EVALHOOK-STEP-CONFUSION:FIX):
(1) Clarify that there is no guarantee that the functions that are the
values of *EVALHOOK* and *APPLYHOOK* will ever be invoked during
evaluation.
(2) Remove the requirement that STEP be implemented using *EVALHOOK*.
Make it explicitly vague whether the scope of the code that is affected
by STEP is lexical or dynamic.
(3) Deprecate *EVALHOOK*, *APPLYHOOK*, EVALHOOK, and APPLYHOOK.
Rationale:
Point by point:
(1) This is merely an explicit statement of the status quo.
(2) This permits compiled-only implementations to support a STEP
utility that does something useful.
(3) The eval hook mechanism is a relic of a particular interpreter
implementation technique and really has no place in a language
standard, especially since one of the stated goals of the language is
consistency between compiled and interpreted code. Since there is no
guarantee that these functions will ever be invoked, portable programs
should not rely on them.
Current Practice:
According to Kent Pitman:
I'm told by the guys who did the Cloe implementation that indeed
neither evalhook nor step do much of anything useful. If I understood
them correctly, *evalhook* just never gets called, and step works by a
different mechanism that may work at a granularity different than what
people expect.
Loosemore has been implementing an evaluator for Utah Common Lisp that
uses a preprocessor to partially compile programs. The interpreter
for the processed code does support the use of an *evalhook*-like
special variable, but the information it is passed is in a different
format than that which *evalhook* requires. In particular, the object
representing the lexical environment contains only bindings and not
syntactic information such as macro definitions. It also supports a
variety of annotation-based program debugging hooks that are specified
by declarations. We are in the process of integrating the
preprocessor into the UCL compiler so that most of these debugging
hooks will also work in compiled code.
Cost to implementors:
None.
Cost to users:
None.
Benefits:
Users will not be misled into thinking *evalhook* is more portable
than it actually is.
Compiled-only implementations can make STEP do something reasonable.
Discussion:
There is an article by Parker in Lisp Pointers, Vol 1 #4 which
describes one approach for annotation-based debugging. Loosemore's
PhD dissertation (soon to be available as a UofU Tech Report) also
discusses alternate approaches for implementing program steppers.
Scott Fahlman says:
I am staying out of most of these discussions, but thought I'd throw in my
two cents' worth on this one: I would very much like to see evalhook and
applyhook removed from the standard. They have been a constant source of
confusion, and there are so many different interpretations of what these
hooks do that facilities built on top of them are not really very portable
in practice. I'm now convinced that a really good stepping package cannot
easily be written using these hooks, but must be integrated into the
interpreter of a given implementation.
David Moon says:
Seems okay, except that if we are going to deprecate these things,
I would much rather just remove them. You would surely argue that
no significant program could possibly be depending on EVALHOOK,
since it has no semantics, so there can't be a compatibility issue.
If we agree that something is a bad idea, I would rather remove it
entirely unless there is a compelling compatibility reason to only
deprecate it. In fact even if some programs used EVALHOOK, I would
still want to remove it, as I long ago ceased to believe in any
fantasy of seamless compatibility between CLtL and ANSI CL. But
others might not agree with me there.
Plus if we remove them, Symbolics doesn't have to fix the bug that
EVALHOOK and APPLYHOOK accidentally got declared SPECIAL. I mention
this only as an example of the costs of deprecating things instead
of removing them. They have to be maintained. Not only do they have
to be documented, but in addition to documenting them we have to tell
people not to use them.
Loosemore says:
I'd rather get rid of these things entirely too, but I have previously
noted some resistance to the idea from others. Maybe they've changed
their minds by now. Anyway, if we can't agree to delete them now,
deprecation is better than the current situation.
-------


Case Study - Social Media Competition
A social media service is hosting a weeklong competition, awarding a limited number of prizes to participating users. To participate a user must post an amusing image, video, or story that matches a specific theme to the competition page. At the end of the week the software used to administer the competition anonymizes all posts, then forwards each to a human judge to evaluate and score. Once scored the software ranks each user’s post. Posts with the same scores are put in groups and are further ranked first in lexical order based on their last name (earlier names are ranked higher, for example a user with a last name of Doe would rank higher than a user with a last name of Smith), then by the timestamp of their application (the earlier application ranked higher than the later application and so on).
The software then starts from the top of the ranked listing, automatically awarding prizes to each user from top down until all prizes have been awarded.
Consider the possible ethical implications or dilemmas and answer the questions below.
What ethical principle could possibly be violated by the competition software ranking scored posts by last name, then by timestamp, instead of by timestamp then last name?
Choose the ACM Ethical Principle which BEST applies.
The software is biased towards last names that are ranked higher (or earlier in alphabetical order). This could result in situations where an applicant could have posted first, received the same score as another, yet not be awarded if their last names rank lower.


You can follow these steps to troubleshoot your problem.
*Diagnosis
*To place the volume icon in the system tray in the lower right of the desktop:
*Place the mouse arrow on the Start button in the lower left corner.
*Left mouse-click on Settings.
*Left mouse-click on the Control Panel
*Place the mouse arrow on the Multimedia icon.
(In Windows XP, look for the Sounds and Audio Devices icon .)
*Double-left mouse click.
*Left mouse-click on the Audio file tab.
*Towards the bottom look for the check box that reads "Show volume control on taskbar."
*Make sure the box is checked to activate the icon.
Go Home
Not helping? Try Querying.


During my short period in Moringa School I have managed to do several projects that have contributed a lot in my ability to improve on my coding skills. Moreover, they have given me the confidence and boost to continue pursing software development. The blockers I've gotten have made me realize more that nothing is impossible in life. Below are some of the projects:
This project is about a description of my pet dog. I've incopotated HTML and CSS languages. More of the projects is here.
This is a webpage that illustrates how to make chocolate chip cookies. More of the project is here.


Toggle navigation
Home
|
Sous Chef
What would You Like to Get Today?
Order Name:
Submit Order
See What the Chef Sees


Cellular Automaton Sandbox
What is a cellular automata?
CA Configurator
"On" Color
"Off" Color
Rule
Cell Size (pixels)
Width
Generation Count
Initial Conditions
Delay
Pattern
New State


@(headline: String = "Time to Play!")(content: Html)(implicit request: RequestHeader, messages: Messages)


Welcome
imadethem.org is the industry's leading cheat provider. Supporting a diverse range of games, our packages have been able to consistently meet our ever-changing customers' needs for decades.
Supported Games
What makes us different
Unlike other providers, which brand their cheats to the point where you may as well be playing free Android games, we do not brand our cheats at all.
All of our cheats are fully customizable. This applies to visual aid (ESP), menus, and every other visual aspect of your cheat. The only limitation is your imagination!

Not convinced? You'll also receive a copy of your cheat's full source-code mailed to you both physically and digitally. You have ALL the evidence to prove them you're using your own cheat.
News
IMADETHEM v3.14 Released
Posted by BigBadWilly on July 15 2015
The team here at IMADETHEM are proud to announce that today we will be releasing our brand-new manufactured-from-scratch version of IMADETHEM. This new revision features the latest and greatest of technologies.
Our new physical pixel washing system ensures that your cheats remain hidden.  This is achieved via the intellisense instruction-set that modern CPUs are shipped with. Utilising this, we are able to ensure that your monitor's pixels will only emit certain frequencies of light in certain directions - such as your face.
By abusing multiple government-tier computational code generators, we are able to provide unique copies of IMADETHEM like never before. Each purchase of IMADETHEM is passed through our arbitrary-code-execution-algorithm multiple times, ensuring you receive an entirely unique cheat. Not a single line of code between purchases of IMADETHEM will match.
We are also excited to inform you all of the rollout of our experimental lexical-sifter, which will automatically format the source files provided to you based on personality data generated from your movements in-game. This will be the nail-in-the-coffin to the naysayers that claim that you didn't make your own cheat. Please contact us if your source code matrix is not changing automatically. Now, more than ever, your cheat can truely be yours.
Among our new technologies lies another beast: byte masking. This technique allows IMADETHEM to trick all kinds of anti-cheat methods, deceiving them in to believing your game has not been modified. Quite simply put: We make bytes look like other bytes™.
Happy Hacking! - Team IMT


-
-
Special Service Area 27
Special Service Area (SSA) 27 works to make Lakeview a neighborhood where people wish to live, linger and long to return. SSAs are a funding mechanism to raise money for services to a designated mixed-use area through a property tax levy in order to supplement City services. The Lakeview Chamber of Commerce is the Sole Service Provider for SSA 27, which was established in December 2003. It manages SSA-funded programs under the oversight of the SSA 27 Board of Commissioners. For more information about SSAs, please visit the City of Chicago's website.
Vision:
We envision Lakeview as Chicago's most sought after neighborhood.
Mission:
Our mission is to support a vibrant local economy and high quality of life for the benefit of Lakeview businesses and residents by improving and enhancing public streets and spaces, creating memorable experiences, encouraging spending locally and promoting the neighborhood.
Services:
- Maintaining clean and attractive sidewalks
- Landscaping, tree planting and tree care
- Enhancing the neighborhood's public spaces with streetscape elements (public art, bike racks, benches, litter receptacles, wayfinding kiosks, etc.) and creating new public spaces
- Lakeview Gift Card and holiday rebate program to support shopping locally
- Security Rebate Program to improve security in Lakeview (download guidelines and application here)
- Business recruitment and vacancy tracking
- Neighborhood and tourism marketing
- Holiday decorations
- Community events and programming
-
Board of Commissioners
SSAs are governed locally by a publicly-appointed Board of Commissioners consisting of local SSA taxpayers (property owners, business representatives and residents) who serve in a volunteer capacity. Our Commissioners include:
Chairperson - Terese McDonald, Candyality
Treasurer - Matt Lederer, Mahogany Builders
Jason Aragon, Whole Foods Market
Darian Campise, Campise Properties
Paul Leamon, Beermiscuous
Amy Novotny, Arthur Murray Lakeview
Luis Monje, resident
Erin Schwartz, resident
Chuck Stewart, Lakeview Insurance Agency
TJ Walczak, Walczak Hernandez, P.C.
Doug Zylstra, Bazar Chicago
Are you interested in becoming a Commissioner? Please contact the Lakeview Chamber of Commerce at<PHONE_NUMBER> or email<EMAIL_ADDRESS>-
Committees
Low-Line Committee
The Low-Line Committee provides vision and direction for the Low-Line, a one-of-a-kind project that would connect Southport Ave. and Paulina St. with a contiguous, half-mile long walkway and garden beneath the CTA ‘L’ tracks, focusing its efforts on new plazas at Southport, Ashland and Paulina.
Next Meeting: To be announced
Streetscape Committee
The Streetscape Committee advances SSA 27’s mission of improving and enhancing public spaces and creating memorable experiences within the service area.
Next Meeting: June 27, 2019, 8:30 am - Agenda
Community Events & Placemaking Grant Program Task Force
The Community Events & Placemaking Grant Program Task Force is responsible for reviewing applications submitted by organizations or individuals who are interested in planning events and public programming within the SSA, and determining whether to fund or provide technical support for projects that meet the SSA’s goals to create memorable experiences and promote the neighborhood.
Next Meeting: To be announced
Unless otherwise stated, all committee meetings take place at the Lakeview Chamber of Commerce, 1409 W. Addison St. in Chicago. All meetings are open to the public.
-
Boundaries
Belmont (Ravenswood to Racine)
Lincoln (Addison to Diversey)
Ashland (Addison to Diversey)
Southport (Belmont to Byron)
-
Vendors
Accountant - A.C.T. Group
Decorative Banners - Bannerville USA
General Contractor - Blake Residential & Commercial Development Co.
Gift Card - EML Payments
Graphic Design - Fisheye Graphic Services and Z Factory
Holiday Decorations - Southport Construction
Landscaping - BrightView Landscapes LLC
Litter Abatement - Cleanstreet
Public Relations - Ripson Communications
Website (Belmont Theater District) - Underground Professional
-
2019 Meetings
Unless otherwise specified, SSA 27 Commission meetings are held at Sheil Park, 3505 N. Southport Ave. in Chicago. All meetings are open to the public.
Jan. 17, 2019, 8:30 am (rescheduled from Jan. 10)
Jul. 11, 2019, 8:30 am,
Annual MeetingAug. 8, 2019, 8:30 am
Sept. 12, 2019, 8:30 am
Oct. 10, 2019, 8:30 am
Nov. 14, 2019, 8:30 am
Dec. 12, 2019, 8:30 am
-
Low-Line Vision
The Low-Line re-envisions the half-mile space beneath the CTA ‘L’ tracks between Southport and Lincoln avenues as an exciting Chicago art destination and a fun and dynamic path connecting Lakeview.
-
Minutes
May 30, 2019
(Lakeview Gift Card Task Force)April 25, 2019
(Streetscape Committee)April 23, 2019
(Lakeview Gift Card Task Force)March 19, 2019
(Lakeview Gift Card Task Force)February 28, 2019
(Streetscape Committee)January 24, 2019
(Streetscape Committee)December 20, 2018
(Streetscape Committee)December 6, 2018
(Neighborhood PR Task Force)November 29, 2018
(Events & Placemaking Task Force)November 15, 2018
(Streetscape Committee)September 27, 2018
(Streetscape Committee)August 23, 2018
(Streetscape Committee)July 26, 2018
(Streetscape Committee)June 21, 2018
(Streetscape Committee)May 24, 2018
(Streetscape Committee)


MULAN A film review by Steve Rhodes Copyright 1998 Steve Rhodes
RATING (0 TO ****): ***
MULAN, which we saw being developed in Disney's Florida studios, is the first Disney animated movie produced on the East Coast. The animators we talked with said that they relished the creative freedom that being so far removed from corporate headquarters afforded them. And, as in any skunkworks, the workers used their independence to build the product they most wanted - forget those suits back at headquarters. The impressive result, although not as spectacular as some of Disney's recent offerings, bodes well for this isolated, creative team.
Filmed in medium blues with warm rose accents, the animation is handsome albeit not up to standards of THE LION KING. Best in the crowd sequences, the movie has a most awe-inspiring visual of an attacking horde of Huns, with hundreds of bluish-gray men charging over a snow-covered landscape. Although the film's images are sumptuous, its songs are all eminently forgettable.
 (Mulan is voiced by Ming-Na Wen, last seen as the take-charge, sexy wife in ONE NIGHT STAND.) Mulan fails miserably even with a cheat sheet of the right answers written on her arm. She finds her calling in life when she goes undercover in a male warrior suit to take the place of her injured father in the Emperor's campaign against the Hun invasion. Huns, we find, look strikingly similar to Klingon warriors.
For help, Mulan's ghostly and bickering ancestors unwittingly send along a smart-mouthed, tiny dragon, which Mulan calls a little lizard. Eddie Murphy, who mumbles too many of his lines, plays the dragon, Mushu. A non-speaking, good-luck cricket, Cri-Kee, is Mushu's sidekick. The energetic Murphy tries to be Robin Williams, but Murphy's lines aren't anywhere near ALADDIN quality.
 The recruits try to out macho each other with lines like, "I'm going to hit you so hard it will make your ancestors dizzy." She tries without much success to be a masculine toughie by spitting and doing other guy stuff.
Mushu is not impressed with her initial progress. "Oh, I think my bunny slippers just ran for cover," he mocks her after her first attempts at fighting like a soldier. With shades of G. I. JANE, Mulan soon goes from being a walking disaster to being the star pupil.
Mulan doesn't reject her feminine side. "Just because I look like a man doesn't mean I have to smell like one," she says before skinny-dipping in the closest stream. To her consternation, her fellow troops decide to join her in a scene both funny and sexual, even if not exactly the shower scene from STARSHIP TROOPERS.
The film's message is easily seen in the big Hun battle. When faced with overwhelming odds, the Emperor's men plan on dying with honor. Mulan, on the other hand, devises a winning strategy that allows the other side to perish in glory instead.
MULAN runs 1:38. It is rated G and would be fine for all ages.
My son Jeffrey, age 9, gave the film ***. His favorite line was the father's "the greatest gift and honor is having you as a daughter." He thought the dragon was really funny and the film's ending especially good. His buddy, Nickolas, age 9, gave the picture ** ½. He liked the way Mulan always thought of new ideas, but he thought parts of the story dragged.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Outgoings
Date
Description
Payment method
{{ outgoing.date }}
{{ outgoing.description }}
{{ outgoing.payment_method }}
Add
Description
Payment Method
Add!