Capacitated Vehicle Routing Problem
Contents:
Notes on algorithm implementation
1. Greedy Solution
2. Local Search (Run on each vehicle individually) (LS)
3. Local Search (LS)
4. Tabu Search (TS)
5. Genetic Algorithm (GA)
6. Simulated Annealing (SA)
7. Hybrid Algorithm (HA)
Library API
Class Hierarchy
File Hierarchy
Full API
Classes and Structs
Struct VectorHash
Class GASolution
Class GreedySolution
Class LocalSearchInterIntraSolution
Class LocalSearchIntraSolution
Class MinimalPublisher
Class Node
Class Problem
Class Route
Class SimulatedAnnealingSolution
Class Solution
Class TabuSearchSolution
Class Vehicle
Functions
Function main
Variables
Variable mpp
Directories
Directory inc
Files
File genetic_algorithm.hpp
File greedy.hpp
File local_search_inter_intra.hpp
File local_search_intra.hpp
File main.hpp
File README.md
File simulated_annealing.hpp
File tabu_search.hpp
File utils.hpp
Capacitated Vehicle Routing Problem
Docs
»
Index
Index
G
|
L
|
M
|
N
|
P
|
R
|
S
|
T
|
V
G
GASolution (C++ class)
GASolution::AddBest (C++ function)
GASolution::best_ (C++ member)
GASolution::CalculateCost (C++ function)
GASolution::CalculateTotalCost (C++ function)
GASolution::checkValidity (C++ function)
GASolution::chromosome_ (C++ member)
GASolution::chromosomes_ (C++ member)
GASolution::costs_ (C++ member)
GASolution::DeleteBadChromosome (C++ function)
GASolution::DeleteRandomChromosome (C++ function)
GASolution::DeleteWorstChromosome (C++ function)
GASolution::GASolution (C++ function)
,
[1]
,
[2]
GASolution::GenerateBestSolution (C++ function)
GASolution::GenerateGreedySolutions (C++ function)
GASolution::GenerateRandomIterSolution (C++ function)
GASolution::GenerateRandomSolution (C++ function)
GASolution::GenerateRandomSolutions (C++ function)
GASolution::generations_ (C++ member)
GASolution::HGreXCrossover (C++ function)
GASolution::InsertionBySimilarity (C++ function)
GASolution::InsertIterDist (C++ function)
GASolution::iterators_ (C++ member)
GASolution::MakeValid (C++ function)
GASolution::Mutate (C++ function)
GASolution::MutateIterLeft (C++ function)
GASolution::MutateIterRight (C++ function)
GASolution::MutateWhithinGene (C++ function)
GASolution::n_chromosomes_ (C++ member)
GASolution::n_nucleotide_pairs_ (C++ member)
GASolution::n_vehicles_ (C++ member)
GASolution::RandomSwap (C++ function)
GASolution::RemoveSimilarSolutions (C++ function)
GASolution::Solve (C++ function)
GASolution::SwapWhithinGene (C++ function)
GASolution::TournamentSelection (C++ function)
GASolution::TournamentSelectionBad (C++ function)
GreedySolution (C++ class)
GreedySolution::GreedySolution (C++ function)
,
[1]
GreedySolution::Solve (C++ function)
L
LocalSearchInterIntraSolution (C++ class)
LocalSearchInterIntraSolution::LocalSearchInterIntraSolution (C++ function)
,
[1]
,
[2]
LocalSearchInterIntraSolution::Solve (C++ function)
LocalSearchIntraSolution (C++ class)
LocalSearchIntraSolution::LocalSearchIntraSolution (C++ function)
,
[1]
,
[2]
LocalSearchIntraSolution::Solve (C++ function)
M
main (C++ function)
,
[1]
MinimalPublisher (C++ class)
MinimalPublisher::MinimalPublisher (C++ function)
MinimalPublisher::publisher_ (C++ member)
MinimalPublisher::publishToRViz (C++ function)
mpp (C++ member)
N
Node (C++ class)
Node::demand_ (C++ member)
Node::id_ (C++ member)
Node::is_routed_ (C++ member)
Node::Node (C++ function)
Node::PrintStatus (C++ function)
Node::x_ (C++ member)
Node::y_ (C++ member)
P
Problem (C++ class)
Problem::capacity_ (C++ member)
Problem::depot_ (C++ member)
Problem::distanceMatrix_ (C++ member)
Problem::nodes_ (C++ member)
Problem::Problem (C++ function)
Problem::vehicles_ (C++ member)
R
Route (C++ class)
Route::CalculateCost (C++ function)
Route::cost_ (C++ member)
Route::nodes_ (C++ member)
Route::PrintRoute (C++ function)
Route::PrintStatus (C++ function)
S
SimulatedAnnealingSolution (C++ class)
SimulatedAnnealingSolution::AllowMove (C++ function)
SimulatedAnnealingSolution::best_cost_ (C++ member)
SimulatedAnnealingSolution::cooling_rate_ (C++ member)
SimulatedAnnealingSolution::current_cost_ (C++ member)
SimulatedAnnealingSolution::max_temp_ (C++ member)
SimulatedAnnealingSolution::n_reheats_ (C++ member)
SimulatedAnnealingSolution::SimulatedAnnealingSolution (C++ function)
,
[1]
,
[2]
SimulatedAnnealingSolution::Solve (C++ function)
SimulatedAnnealingSolution::stag_ (C++ member)
SimulatedAnnealingSolution::stag_limit_ (C++ member)
SimulatedAnnealingSolution::temp_ (C++ member)
Solution (C++ class)
Solution::capacity_ (C++ member)
Solution::CheckSolutionValid (C++ function)
Solution::CreateInitialSolution (C++ function)
Solution::depot_ (C++ member)
Solution::distanceMatrix_ (C++ member)
Solution::find_closest (C++ function)
Solution::nodes_ (C++ member)
Solution::PrintSolution (C++ function)
Solution::Solution (C++ function)
,
[1]
Solution::solution_string_ (C++ member)
Solution::Solve (C++ function)
Solution::vehicles_ (C++ member)
T
TabuSearchSolution (C++ class)
TabuSearchSolution::Aspiration (C++ function)
TabuSearchSolution::best_cost_ (C++ member)
TabuSearchSolution::IsTabu (C++ function)
TabuSearchSolution::n_tabu_ (C++ member)
TabuSearchSolution::new_cost_ (C++ member)
TabuSearchSolution::Solve (C++ function)
TabuSearchSolution::tabu_list_queue_ (C++ member)
TabuSearchSolution::tabu_list_set_ (C++ member)
TabuSearchSolution::TabuSearchSolution (C++ function)
,
[1]
,
[2]
TabuSearchSolution::to_check_ (C++ member)
V
VectorHash (C++ class)
VectorHash::operator() (C++ function)
Vehicle (C++ class)
Vehicle::capacity_ (C++ member)
Vehicle::id_ (C++ member)
Vehicle::load_ (C++ member)
Vehicle::PrintStatus (C++ function)
Vehicle::Vehicle (C++ function)


Demos
Path management
Fish Pond
Sprites on Path
Drag'n'Drop
Text on Path
Accelerometer
Transform anchors
Transform hierarchy
Interactivity
Procedural Grass
Collision detection
Box2D
Scene Transitions
Timers
SpriteImage
Masking


Salmon Cookies Shops
INTRODUCTION
Our SHOPS
Seattle
- Address: Seattle/Down Town
- Hours Open: 7am-7pm
- Contact<EMAIL_ADDRESS>Tokyo
- Address: Tokyo
- Hours Open: 8am-7pm
- Contact<EMAIL_ADDRESS>Dubai
- Address: Dubai
- Hours Open: 8am-7pm
- Contact<EMAIL_ADDRESS>Paris
- Address: Paris
- Hours Open: 8am-7pm
- Contact<EMAIL_ADDRESS>Lima
- Address: Lima
- Hours Open: 8am-8pm
- Contact Info:limashop@gmail.com


Preparation time
30 mins to 1 hour
Cooking time
10 to 30 mins
Serves
Serves 4 (2 adults and 2 children)
Dietary
James Martin proves you're never too old for bananas and ice cream with this two-in-one recipe for adults and kids.
For the charred bananas and ice cream (the kids' dessert), preheat the oven to 200C/180C Fan/Gas 6.
Using a sharp knife, make a small slit in one end of each banana. Stick a sprig of rosemary into each slit.
Heat a griddle pan over a high heat. Add the bananas and cook for 4-5 minutes on each side, or until blackened on all sides and heated through.
To serve, split the bananas lengthways and open out slightly, then place onto serving plates (you can return them to their skins to serve, if desired). Top with a scoop of ice cream and sprinkle with the passion fruit seeds.
For the sesame-toffee bananas (the adults' dessert), heat the oil in a deep-fat fryer to 190C. Alternatively, heat the oil in a deep, heavy-based pan until a breadcrumb sizzles and turns golden-brown when dropped into it. (CAUTION: Hot oil can be dangerous. Do not leave unattended.) Meanwhile, prepare a bowl of iced water.
In a bowl, whisk together the cornflour and sparkling water until smooth and well combined. Add the banana halves and gently mix until coated.
Carefully lower the battered bananas into the hot oil and fry for 2-3 minutes, or until very light golden-brown. Remove from the oil using a slotted spoon and set aside to drain on kitchen paper.
Meanwhile, heat the sugar, without stirring, in a heavy-based frying pan over a high heat. Swirl the pan until the sugar melts to a light golden-brown caramel. Stir in the sesame seeds, then dip the base of the pan into a sinkful of cold water to stop the caramel from cooking any further.
Using a spoon, carefully roll the battered banana halves in the hot caramel, one at a time, until completely coated. (CAUTION: melted sugar is extremely hot.) Transfer to the bowl of iced water until completely cold, then set aside to drain.
For the soufflé, preheat the oven to 230C/210C Fan/Gas 8. Grease two large ramekins with butter, then dust the insides with a coating of sugar.
Whisk the egg whites in a clean bowl until firm peaks form when the whisk is removed.
Fold the custard and passion fruit seeds into the whisked egg whites, then spoon the mixture carefully into the ramekins, smooth the tops using a palette knife and place them on a baking tray.
Bake the soufflés in the oven for 8-10 minutes, until risen and golden-brown.
Dust the soufflés with the icing sugar and serve immediately, with a spoonful of custard, one of the sesame-toffee banana halves and a scoop of ice cream alongside.


Node.js v0.10.7 Manual & Documentation
Table of Contents
- Events
- Class: events.EventEmitter
- emitter.addListener(event, listener)
- emitter.on(event, listener)
- emitter.once(event, listener)
- emitter.removeListener(event, listener)
- emitter.removeAllListeners([event])
- emitter.setMaxListeners(n)
- emitter.listeners(event)
- emitter.emit(event, [arg1], [arg2], [...])
- Class Method: EventEmitter.listenerCount(emitter, event)
- Event: 'newListener'
- Event: 'removeListener'
- Class: events.EventEmitter
Events#
Stability: 4 - API Frozen
Many objects in Node emit events: a net.Server
emits an event each time
a peer connects to it, a fs.readStream
emits an event when the file is
opened. All objects which emit events are instances of events.EventEmitter
.
You can access this module by doing: require("events");
Typically, event names are represented by a camel-cased string, however, there aren't any strict restrictions on that, as any string will be accepted.
Functions can then be attached to objects, to be executed when an event
is emitted. These functions are called listeners. Inside a listener
function, this
refers to the EventEmitter
that the listener was
attached to.
Class: events.EventEmitter#
To access the EventEmitter class, require('events').EventEmitter
.
When an EventEmitter
instance experiences an error, the typical action is
to emit an 'error'
event. Error events are treated as a special case in node.
If there is no listener for it, then the default action is to print a stack
trace and exit the program.
All EventEmitters emit the event 'newListener'
when new listeners are
added and 'removeListener'
when a listener is removed.
emitter.addListener(event, listener)#
emitter.on(event, listener)#
Adds a listener to the end of the listeners array for the specified event.
server.on('connection', function (stream) {
console.log('someone connected!');
});
Returns emitter, so calls can be chained.
emitter.once(event, listener)#
Adds a one time listener for the event. This listener is invoked only the next time the event is fired, after which it is removed.
server.once('connection', function (stream) {
console.log('Ah, we have our first user!');
});
Returns emitter, so calls can be chained.
emitter.removeListener(event, listener)#
Remove a listener from the listener array for the specified event. Caution: changes array indices in the listener array behind the listener.
var callback = function(stream) {
console.log('someone connected!');
};
server.on('connection', callback);
// ...
server.removeListener('connection', callback);
Returns emitter, so calls can be chained.
emitter.removeAllListeners([event])#
Removes all listeners, or those of the specified event.
Returns emitter, so calls can be chained.
emitter.setMaxListeners(n)#
By default EventEmitters will print a warning if more than 10 listeners are added for a particular event. This is a useful default which helps finding memory leaks. Obviously not all Emitters should be limited to 10. This function allows that to be increased. Set to zero for unlimited.
emitter.listeners(event)#
Returns an array of listeners for the specified event.
server.on('connection', function (stream) {
console.log('someone connected!');
});
console.log(util.inspect(server.listeners('connection'))); // [ [Function] ]
emitter.emit(event, [arg1], [arg2], [...])#
Execute each of the listeners in order with the supplied arguments.
Returns true
if event had listeners, false
otherwise.
Class Method: EventEmitter.listenerCount(emitter, event)#
Return the number of listeners for a given event.
Event: 'newListener'#
event
String The event namelistener
Function The event handler function
This event is emitted any time someone adds a new listener.
Event: 'removeListener'#
event
String The event namelistener
Function The event handler function
This event is emitted any time someone removes a listener.


New York Governor Orders Police to Increase Patrols in Times Square Amid Bomb Threat
MOSCOW (Sputnik) - On Sunday, the governor's office received reports of a user in one of the Reddit threads who threatened to detonate a bomb in Times Square, as reported by the New York Times. Moderators reportedly removed the post three hours after it was posted.
New York Governor Andrew Cuomo has ordered police to investigate a bomb threat in Times Square from an anonymous Internet user and step up patrols in the area.
"The bomb threat made against Times Square is a despicable and cowardly act meant to instill fear and panic in our community, and New Yorkers will not tolerate these scare tactics ... I am directing the New York State Police to coordinate with local and federal partners to launch a full-scale investigation into this incident", Cuomo said in a statement on his website on Sunday.
The governor went on claiming that there was "no indication that this threat is credible," but that NY police "will be on the ground working with NYPD and partners to step up patrols in the area during the day."
Shortly after, NYPD Counterterrorism branch said in a Twitter post that the threat was not believed to be credible but warned of an increased police presence at various locations throughout New York City and Times Square "out of an abundance of caution."
Three hours later, they again advised residents not to be alarmed and said that they had increased their counterterrorism deployments in and around Times Square.


View all your goals and habits in one neatly organised progress bars with a unique on-track pace system, streaks, success rates, calendars, line charts and lots more.!
Get your workout routine sorted and check off each achievement every step of the way.
It’s crucial to appreciate how far you’ve come with your goals, so you’ll get congratulated for achieving goals and reaching streaks.
With LifeGPA you can always start a new habit and you will be sure to be more consistent and track your progress daily
Checkin off each achievements is always an inspiration to always do more. With LifeGPA you are always motivated to do more to get your GP up
With the reminder feature on the LifeGPA, it is extremely easy to always be on track on your habits formin
Best tracker I’ve had the pleasure of using. Clean UI, excellent features, and very helpful. Take control of your life. Stop leveling up that character from that other app and start leveling up yourself.
his app lets me organize and track any aspect of my life that I want. Great for fitness, quitting smoking, staying positive, getting 8 hours of sleep, etc. I recommend this to everyone!
Thank you for bringing such an amazing app to the world. I absolutely love it and have achieved important goals with it.
Amazing app! I've lost 80 lbs because of the accountability. I've also meditated 3 times per day, journaled, and exercised daily for the last year... all because of the daily check ins.


An R graphical user interface for microclimate time series, with an emphasis on underground environments. 'KarsTS' provides linear and nonlinear methods, including recurrence analysis (Marwan et al. (2007) <10.1016/j.physrep.2006.11.001>) and filling methods (Moffat et al. (2007) <doi:10.1016/j.agrformet.2007.08.011>), as well as tools to manipulate easily time series and gap sets.
| Version: | 2.2 |
| Depends: | R (≥ 3.4.0) |
| Imports: | circular, BaylorEdPsych, MVN, tcltk, tcltk2, tkrplot, tseriesChaos, stlplus, tseries, forecast, stinepack, missForest, nonlinearTseries, stats, graphics, utils, zoo, grDevices, rgl, mgcv, infotheo, plot3D |
| Published: | 2018-11-04 |
| Author: | Marina Saez [aut, cre], David Benavente [ths], Soledad Cuezva [ths], Concepcion Pla [ctb] |
| Maintainer: | Marina Saez <marinasaez_andreu at hotmail.com> |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| NeedsCompilation: | no |
| CRAN checks: | KarsTS results |
| Reference manual: | KarsTS.pdf |
| Package source: | KarsTS_2.2.tar.gz |
| Windows binaries: | r-devel: KarsTS_2.2.zip, r-release: KarsTS_2.2.zip, r-oldrel: KarsTS_2.2.zip |
| OS X binaries: | r-release: KarsTS_2.2.tgz, r-oldrel: KarsTS_2.2.tgz |
| Old sources: | KarsTS archive |
Please use the canonical form https://CRAN.R-project.org/package=KarsTS to link to this page.


Issue
- The commandline for mounting a backend can be very long
- A specification is already used for code generation, but
- the data is not available in KDB
- the specification cannot be used for mounting, even though the needed information is in the specification
Constraints
- the specification must be simple to use
- there must be a clear mapping between keys and configuration file entries
- there must be a 1:1 mapping of keys used within an application and the specification
Assumptions
- The user will have a variable for each configuration value (e.g. by using a binding) if she cares about access performance
- memory footprint is expected to be low
Considered Alternatives
- modifying kdbGet() and ksLookup() so that we get a logical hierarchy
- having a duplicated in memory hierarchy with the cascaded keysets
Decision
Argument
- The user wants deterministic retrieval of configuration. It must be answerable (w/o study of sourcecode and debugging) which value will be used in the current situation.
Implications
- Introduction of spec/ hierarchy
- kdbGet() for cascading
- kdbSet() for cascading
- modify ksLookup() for cascading
- KDB_O_DEFAULT in ksLookup()
- define necessary meta data
- mounting spec files
Related decisions
Notes


Drop the Net Here
Supported formats: *.ori.json, *.ori
Or Start With Following Nets
Net-Splitter
Export Svg
Export Ori


Tiffany B. Brown, Webinista, Inc.
CSS features and their associated JavaScript APIs that let us apply styles or behaviors when a particular condition is met.
@rules
@media
@supports
@viewport
(not really conditional)@media
: a recapSet styles for a particular media type.
@media print {
body { font-size: 10pt }
}
@media screen, print {
body { line-height: 1.2 }
}
@media
and media queriesApplies styles for particular media features.
| IE | Firefox | Chrome | Safari | Opera | Android | Blackberry |
|---|---|---|---|---|---|---|
| 9+ | 3.5+ | 4.0 | 3.2* | 9.5** | 2.1+ | 7.0 |
*Safari had full support in desktop as of version 4.0.
**Opera gained full support in mobile in version 10. (Source: CanIUse.com)
@media [only | not] <media_type> [and] (expression){
selector{
property: value;
}
}
@media screen and (max-width: 500px){
header{
position:fixed;
}
}
@media only print
@media not (aspect-ratio: 4/3)
@media (min-width:400px) and (device-aspect-ratio: 16/9)
@media screen and (min-width:400px),
print and (max-width: 8.5in)
<link media="(device-width:480px)" rel="stylesheet"… >
<video>
element<video>
<source src="smallmovie.webm" media="(min-width:480px)">
<source src="bigmovie.webm" media="(min-width:1900px)">
<video>
Does not work in Internet Explorer 10.
window.matchMedia()
APImatchMedia()
syntaxArgument must be a valid @media
rule.
matchMedia("screen and (min-width:400px)");
matchMedia("(orientation: landscape)");
Returns a MediaQueryList
object.
media
: returns list of queries or not all
if the argument isn't valid.matches
: returns true
if the state of the rendered document matches the media query, false
otherwiseaddListener()
: Adds a media query listener.removeListener()
: Removes the media query listener.function mqHandler(mq){
if( mq.matches ){
// do something
}
}
var mq = matchMedia("(orientation:landscape)");
mq.addListener( mqHandler );
matchMedia()
browser support| IE | Firefox | Chrome | Safari | Opera | Android | Blackberry |
|---|---|---|---|---|---|---|
| 10+ | 6+ * | 9+ * | 5.1 | 12.1 | 3+ | 10 |
*Available in Chrome for Android as of version 25 and Firefox for Android as of version 19. (Source: CanIUse.com).
@supports
worksand
or or
.not
and
and or
conditions.@supports
syntax@supports [not] ( property: value-to-test ){
/* CSS rules to apply */
}
@supports
syntax example@supports ( transform: rotateX(45deg) ){
#myobj{
transform: rotateX(45deg);
}
}
@supports
example using not
@supports not ( transform: rotateX(45deg) ){
#myobj{
transform: skewX(30deg);
}
}
@supports
using and
& or
@supports (
( transform: scale(1) ) or ( -x-transform: scale(1) )
) and (
( transition: transform 500ms linear )
or ( -x-transition: transform 500ms linear )
)
(Where -x- is a vendor prefix.)
window.CSS.supports()
@supports
window.supportsCSS();
CSS
object attached to the window with a supports()
method.CSS.supports()
syntaxvar hasProp = CSS.supports('property','value');
if( hasProp ){
// do something
}
Returns true
if both property is supported, and the value is valid and supported. Returns false
otherwise.
@supports
& CSS.supports()
browser support| IE | Firefox | Chrome | Safari | Opera | Android | Blackberry |
|---|---|---|---|---|---|---|
| - | 20.0a2+* | - | - | 12.1 | - | - |
* Firefox support is available in version 17+, but behind a flag. Turned on by default in Firefox 20+ (Aurora and Firefox nightly builds). (Source: CanIUse.com).
@supports
support!!window.CSSRule.SUPPORTS_RULE
: tests whether support is available at all'CSS' in window
: tests whether the API is available as the CSS
object.'supportsCSS' in window
: tests whether the API is available using supportsCSS()
instead<meta name="viewport">
Left: no viewport set. Right width=device-width
@viewport
@viewport
syntax@viewport{
descriptor: value;
}
Used inside of a media query to reset the viewport size or zoom level.
@viewport
syntax@media screen and (device-aspect-ratio: 8/5){
@viewport{
zoom: 0.5
}
}
@viewport
descriptorsMostly the same values you use with <meta name="viewport">
.
@viewport
browser support| IE | Firefox | Chrome | Safari | Opera | Android | Blackberry |
|---|---|---|---|---|---|---|
| 10+* | - | - | - | 11+* | - | - |
Sizes relative to the viewport's dimensions.
vw
: 1% of viewport widthvh
: 1% viewport heightvmin
: 1% of viewport’s smaller dimensionvmax
: 1% of viewport’s larger dimension| IE | Firefox | Chrome | Safari | Opera | Android | Blackberry |
|---|---|---|---|---|---|---|
| 9.0+* | 19+ | 20+** | 6+ | -† | - | 10 |
* Partial support in IE9. **Chrome for Android added support in version 25. †Presto-based Opera. Oprium will inherit Chrome's support. Source


D. C. CAB A film review by Andrew Hicks Copyright 1996 Andrew Hicks / Fatboy Productions
(1983) *1/2 (out of four)
If anyone had been able in 1983 to forsee a late-night cable show hosted by Gilbert Gottfried showcasing some of the worst films of the 80's, they'd agree D.C. CAB is the quintessential "USA Up All Nite" movie. It's one of those childish R-rated movies that kids would love but can't see until it's edited for TV. It's also one of those pointless, almost plotless movies with hardly any laughs. And, strike three, it pairs Mr. T with Gary Busey.
I heard Gilbert say D.C. CAB had "an all-star cast," but I'm still hoping there was some degree of facetiousness in that statement. When third-billing goes to a two-minute appearance by famed flashdancer Irene Cara "as herself," you can't say a damn thing about all-star casts. Likewise for token appearances by Marsha "Roz" Warfield, Paul Rodriguez and "Politically Incorrect" host Bill Maher, before he was somebody. Appearing in D.C. CAB pretty much had the opposite effect on everyone else, especially Irene "I'm Gonna Live Forever" Cara.
D.C. CAB is an ensemble comedy from Joel Schumacher (who would go on to direct BATMAN FOREVER) about a bunch of misfits who drive cabs. You get the feeling if the POLICE ACADEMY cadets had made a different career choice, this would be the result, except here you have such interesting characters as the "token white guy" (Busey) who wants to get in tight with the blacks now before they take over the world, the token jive talker named Tyrone (Charlie Barnett) who wears his hair in rollers and uses the word "honkey" as much as possible, the tough guy with the mohawk and gold chains (Mr. T -- a real stretch for him), the aspiring musician waiting for his big break (Maher), the Mexican gigolo (Rodriguez), the woman who actually wants to drive cabs for a living (Warfield) and the guy who wants to own a cab company for a living (Adam Baldwin).
We've all seen dozens of bad comedies from the 80's. Some are fun to watch and some are actually funny. This one is more or less neither. You'd think plenty of comedic sparks would fly from the assemblage of talent (whatever), but D.C. CAB more or less falls flat on a continual basis, culminating in the usual contrived Hollywood finale as Baldwin is kidnapped and the other cabbies have to go to rescue him. It's a shame no one was able to rescue this movie from the depths of stale jokes and unoriginality. D.C. CAB has rightly earned its position on "USA Up All Nite."
--
Visit the Movie Critic at LARGE website at http://www.missouri.edu/~c667778/movies.html
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


WASHINGTON
MICROBREWERIES
Aslan Brewing Co.
Urban Family Brewing Co.
Reuben's Brews
Oppegaard Meadery
"here is a random quote we can find about the awesomeness of microbreweries"
- John Doe
Aslan Brewing Co.
|
Bellingham, WA
Urban Family Brewing Co.
|
Ballard, Seattle, WA
Reuben's Brews
|
Ballard, Seattle, WA
Oppegaard Meadery
|
Tukwila, WA


| Cut-N-Paste JavaScript Home / Writing Date, Time, etc. to Screen
Although we've put up a number of clock and calendar scripts already, they've been directed to forms or other panes on screen. Surprisingly, we've gotten a lot of email requesting simple prints to screen. Obsequiously eager to please, we've cobbled a bunch together for your edification on this page, along with a lot of straight system calls that you may wish to print to your HTML somewhere at your site. If you want an image swapping clock, one that actually ticks as time passes, check out the Verdana Image Swapping Real-Time Clock. |


Class: Aws::APIGateway::Types::Authorizer
| Relationships & Source Files | |
| Super Chains via Extension / Inclusion / Inheritance | |
|
Class Chain:
self,
Struct
|
|
|
Instance Chain:
self,
Struct
|
|
| Inherits: |
Struct
|
| Defined in: | (unknown) |
Overview
Represents an authorization layer for methods. If enabled on a method, API Gateway will activate the authorizer when a client calls the method.
Returned by:
Instance Attribute Summary
-
#auth_type ⇒ String
rw
Optional customer-defined field, used in Swagger imports/exports.
-
#authorizer_credentials ⇒ String
rw
Specifies the credentials required for the authorizer, if any.
-
#authorizer_result_ttl_in_seconds ⇒ Integer
rw
The TTL in seconds of cached authorizer results.
-
#authorizer_uri ⇒ String
rw
[Required] Specifies the authorizer's Uniform Resource Identifier (URI).
-
#id ⇒ String
rw
The identifier for the authorizer resource.
. -
#identity_source ⇒ String
rw
[Required] The source of the identity in an incoming request.
-
#identity_validation_expression ⇒ String
rw
A validation expression for the incoming identity.
-
#name ⇒ String
rw
[Required] The name of the authorizer.
. -
#provider_arns ⇒ Array<String>
rw
A list of the provider ARNs of the authorizer.
-
#type ⇒ String
rw
[Required] The type of the authorizer.
Instance Attribute Details
#auth_type ⇒ String
(rw)
Optional customer-defined field, used in Swagger imports/exports. Has no functional impact.
#authorizer_credentials ⇒ String
(rw)
Specifies the credentials required for the authorizer, if any. Two options are available. To specify an IAM role for Amazon API Gateway to assume, use the role's Amazon Resource Name (ARN). To use resource-based permissions on the Lambda function, specify null.
#authorizer_result_ttl_in_seconds ⇒ Integer
(rw)
The TTL in seconds of cached authorizer results. If greater than 0, API Gateway will cache authorizer responses. If this field is not set, the default value is 300. The maximum value is 3600, or 1 hour.
#authorizer_uri ⇒ String
(rw)
[Required] Specifies the authorizer's Uniform Resource Identifier (URI). For TOKEN
authorizers, this must be a well-formed Lambda function URI, for example, arn:aws:apigateway:us-west-2:lambda:path/2015-03-31/functions/arn:aws:lambda:us-west-2:`{account_id}:function:{lambda_function_name}`/invocations
. In general, the URI has this form arn:aws:apigateway:`{region}:lambda:path/{service_api}`
, where `{region}`
is the same as the region hosting the Lambda function, path
indicates that the remaining substring in the URI should be treated as the path to the resource, including the initial /
. For Lambda functions, this is usually of the form /2015-03-31/functions/[FunctionARN]/invocations.
#id ⇒ String
(rw)
The identifier for the authorizer resource.
#identity_source ⇒ String
(rw)
[Required] The source of the identity in an incoming request. For a TOKEN
authorizer, this value is a mapping expression with the same syntax as integration parameter mappings. The only valid source for tokens is 'header', so the expression should match 'method.request.header.[headerName]'. The value of the header '[headerName]' will be interpreted as the incoming token. For COGNITO_USER_POOLS
authorizers, this property is used.
#identity_validation_expression ⇒ String
(rw)
A validation expression for the incoming identity. For TOKEN
authorizers, this value should be a regular expression. The incoming token from the client is matched against this expression, and will proceed if the token matches. If the token doesn't match, the client receives a 401 Unauthorized response.
#name ⇒ String
(rw)
[Required] The name of the authorizer.
#provider_arns ⇒ Array
<String
> (rw)
A list of the provider ARNs of the authorizer. For an TOKEN
authorizer, this is not defined. For authorizers of the COGNITO_USER_POOLS
type, each element corresponds to a user pool ARN of this format: arn:aws:cognito-idp:`{region}:{account_id}:userpool/{user_pool_id}`
.
#type ⇒ String
(rw)
[Required] The type of the authorizer. Currently, the valid type is TOKEN
for a Lambda function or COGNITO_USER_POOLS
for an Amazon Cognito user pool.
Possible values:
- TOKEN
- COGNITO_USER_POOLS


Interact Segmentation
Add an image
Click and drag your mouse to extract the forground object
Click the "switch" button to switch the forground and background labeling
Click on the "extract" button
Source
Add Image
FG
BG
Clear
Foreground
Contours
Result
Download


Welcome to the Ghanaian birth-name generator.
Frequently, children are given a "day name" which corresponds to the
day in the week when they were born. These day names have further
meanings concerning the soul and character of the person.
This app, we aim to generate your birth name if you were born in
Ghana or from Ghanaian descendant, all you need to input is your
birth day and gender.
Disclaimer: None of the information submitted will be stored...
Ghanaian Birth-name Form
Please enter your birth date and gender in the form below
Your Ghanaian Birth-name will appear here


Founder & CEO
Co-founder & COO
Co-founder & CTO
Business Development Lead
Lead Marketing
“Empowered teams create truly amazing products. Set the north star and let them follow it.”


--- layout: post date: 2013-11-07 20:40:00 +0100 title: "First Debian meetup in Zürich" categories: Artikel tags: - debian ---
Thanks to Axel Beckert (abe@), 12 people interested in Debian met last Tuesday in Zürich and celebrated the start of our monthly Debian meetup.
New faces are always very welcome. If you live in Zürich, or if you’re visiting, please feel free to attend our meetup — no registration necessary.
See the initial announcement, and subscribe to<EMAIL_ADDRESS>for updates.
Thanks to everyone for the nice evening, see you next time!


For '%s', you cannot trace code from the model because there is no traceability information.
'%s' is a virtual block. Code is not generated for virtual blocks.
'%s' is reduced during model compilation. Code is not generated for reduced blocks.
Code for '%s' is from reusable function and cannot be traced.
'%s' is outside of source subsystem and cannot be traced.
'%s' contains illegal character (single quote) that disables model-to-code navigation. Remove single quote from block name and rebuild model.
'%s' is a masked subsystem and cannot be traced at the subsystem block level. Traceability information is available for individual blocks under the mask.


--- layout: default title: Products ---
See Peter's Redbubble for art prints and cards. Originals at Peter's Etsy.
See Brandt Bookshop for hymnbooks - both newly edited and reprints of older treasures.


This repository provides required tools to develop Hyperties and help you testing all your hyperties.


{% extends "base.html" %} {% block title %}404 - Page not found{% endblock %} {% block content %}
This is not the page you're looking for


| I l@ve RuBoard |
Quick! How long will it take to send War and Peace over a 56k modem line? How much disk space will you need for a million names and addresses? How long does a 1,000-byte block take to pass through a router? How many months will it take to deliver your project?
At one level, these are all meaningless questions—they are all missing information. And yet they can all be answered, as long as you are comfortable estimating. And, in the process of producing an estimate, you'll come to understand more about the world your programs inhabit.
By learning to estimate, and by developing this skill to the point where you have an intuitive feel for the magnitudes of things, you will be able to show an apparent magical ability to determine their feasibility. When someone says "we'll send the backup over an ISDN line to the central site," you'll be able to know intuitively whether this is practical. When you're coding, you'll be able to know which subsystems need optimizing and which ones can be left alone.
Tip 18
Estimate to Avoid Surprises
As a bonus, at the end of this section we'll reveal the single correct answer to give whenever anyone asks you for an estimate.
To some extent, all answers are estimates. It's just that some are more accurate than others. So the first question you have to ask yourself when someone asks you for an estimate is the context in which your answer will be taken. Do they need high accuracy, or are they looking for a ballpark figure?
 On the other hand, a diver trapped underwater and running out of air is probably interested in an answer down to the second.
What's the value of p? If you're wondering how much edging to buy to put around a circular flower bed, then "3" is probably good enough.[10] If you're in school, then maybe "22/7" is a good approximation. If you're in NASA, then maybe 12 decimal places will do.
[10] "3" is also apparently good enough if you are a legislator. In 1897, Indiana State Legislature House Bill No. 246 attempted to decree that henceforth p should have the value of "3". The Bill was tabled indefinitely at its second reading when a mathematics professor pointed out that their powers did not quite extend to passing laws of nature.
One of the interesting things about estimating is that the units you use make a difference in the interpretation of the result. If you say that something will take about 130 working days, then people will be expecting it to come in pretty close. However, if you say "Oh, about six months," then they know to look for it any time between five and seven months from now. Both numbers represent the same duration, but "130 days" probably implies a higher degree of accuracy than you feel. We recommend that you scale time estimates as follows:
| Duration | Quote estimate in |
|---|---|
| 1-15 days | days |
| 3-8 weeks | weeks |
| 8-30 weeks | months |
| 30+ weeks | think hard before giving an estimate |
So, if after doing all the necessary work, you decide that a project will take 125 working days (25 weeks), you might want to deliver an estimate of "about six months."
The same concepts apply to estimates of any quantity: choose the units of your answer to reflect the accuracy you intend to convey.
All estimates are based on models of the problem. But before we get too deeply into the techniques of building models, we have to mention a basic estimating trick that always gives good answers: ask someone who's already done it. Before you get too committed to model building, cast around for someone who's been in a similar situation in the past.
See how their problem got solved. It's unlikely you'll ever find an exact match, but you'd be surprised how many times you can successfully draw on other's experiences.
The first part of any estimation exercise is building an understanding of what's being asked. As well as the accuracy issues discussed above, you need to have a grasp of the scope of the domain. Often this is implicit in the question, but you need to make it a habit to think about the scope before starting to guess. Often, the scope you choose will form part of the answer you give: "Assuming there are no traffic accidents and there's gas in the car, I should be there in 20 minutes."
This is the fun part of estimating. From your understanding of the question being asked, build a rough and ready bare-bones mental model. If you're estimating response times, your model may involve a server and some kind of arriving traffic. For a project, the model may be the steps that your organization uses during development, along with a very rough picture of how the system might be implemented.
Model building can be both creative and useful in the long term. Often, the process of building the model leads to discoveries of underlying patterns and processes that weren't apparent on the surface. You may even want to reexamine the original question: "You asked for an estimate to do X. However, it looks like Y, a variant of X, could be done in about half the time, and you lose only one feature."
Building the model introduces inaccuracies into the estimating process. This is inevitable, and also beneficial. You are trading off model simplicity for accuracy. Doubling the effort on the model may give you only a slight increase in accuracy. Your experience will tell you when to stop refining.
Once you have a model, you can decompose it into components. You'll need to discover the mathematical rules that describe how these components interact. Sometimes a component contributes a single value that is added into the result. Some components may supply multiplying factors, while others may be more complicated (such as those that simulate the arrival of traffic at a node).
You'll find that each component will typically have parameters that affect how it contributes to the overall model. At this stage, simply identify each parameter.
Once you have the parameters broken out, you can go through and assign each one a value. You expect to introduce some errors in this step. The trick is to work out which parameters have the most impact on the result, and concentrate on getting them about right. Typically, parameters whose values are added into a result are less significant than those that are multiplied or divided. Doubling a line speed may double the amount of data received in an hour, while adding a 5 ms transit delay will have no noticeable effect.
You should have a justifiable way of calculating these critical parameters. For the queuing example, you might want to measure the actual transaction arrival rate of the existing system, or find a similar system to measure. Similarly, you could measure the current time taken to serve a request, or come up with an estimate using the techniques described in this section. In fact, you'll often find yourself basing an estimate on other subestimates. This is where your largest errors will creep in.
Only in the simplest of cases will an estimate have a single answer. You might be happy to say "I can walk five cross-town blocks in 15 minutes." However, as the systems get more complex, you'll want to hedge your answers. Run multiple calculations, varying the values of the critical parameters, until you work out which ones really drive the model. A spreadsheet can be a big help. Then couch your answer in terms of these parameters. "The response time is roughly three quarters of a second if the system has a SCSI bus and 64MB memory, and one second with 48MB memory." (Notice how "three quarters of a second" conveys a different feeling of accuracy than 750 ms.)
During the calculation phase, you may start getting answers that seem strange. Don't be too quick to dismiss them. If your arithmetic is correct, your understanding of the problem or your model is probably wrong. This is valuable information.
We think it's a great idea to record your estimates so you can see how close you were. If an overall estimate involved calculating subestimates, keep track of these as well. Often you'll find your estimates are pretty good—in fact, after a while, you'll come to expect this.
When an estimate turns out wrong, don't just shrug and walk away. Find out why it differed from your guess. Maybe you chose some parameters that didn't match the reality of the problem. Maybe your model was wrong. Whatever the reason, take some time to uncover what happened. If you do, your next estimate will be better.
The normal rules of estimating can break down in the face of the complexities and vagaries of a sizable application development. We find that often the only way to determine the timetable for a project is by gaining experience on that same project. This needn't be a paradox if you practice incremental development, repeating the following steps.
Check requirements
Analyze risk
Design, implement, integrate
Validate with the users
Initially, you may have only a vague idea of how many iterations will be required, or how long they may be. Some methods require you to nail this down as part of the initial plan, but for all but the most trivial of projects this is a mistake. Unless you are doing an application similar to a previous one, with the same team and the same technology, you'd just be guessing.
So you complete the coding and testing of the initial functionality and mark this as the end of the first increment. Based on that experience, you can refine your initial guess on the number of iterations and what can be included in each. The refinement gets better and better each time, and confidence in the schedule grows along with it.
Tip 19
Iterate the Schedule with the Code
This may not be popular with management, who typically want a single, hard-and-fast number before the project even starts. You'll have to help them understand that the team, their productivity, and the environment will determine the schedule. By formalizing this, and refining the schedule as part of each iteration, you'll be giving them the most accurate scheduling estimates you can.
You say "I'll get back to you."
You almost always get better results if you slow the process down and spend some time going through the steps we describe in this section. Estimates given at the coffee machine will (like the coffee) come back to haunt you.
Start keeping a log of your estimates. For each, track how accurate you turned out to be. If your error was greater than 50%, try to find out where your estimate went wrong.
| 9. | |
| 10. |
| I l@ve RuBoard |


Fight of the Day: Kid Yamamoto vs. Rani Yahya
by Luke Irwin
Date: December 31, 2007
Card: K-1 Premium Dynamite! 2007
Championship(s):
Venue: Kyocera Dome Osaka
Location: Osaka, Japan
Date: December 31, 2007
Card: K-1 Premium Dynamite! 2007
Championship(s):
Venue: Kyocera Dome Osaka
Location: Osaka, Japan


Mercedes explain the reasoning behind Bottas problems in Brazil
by Tom MasonIt was largely a weekend to forget for Valtteri Bottas in Brazil as he failed to finish after starting fifth on the grid. track engineering director Andrew Shovlin has highlighted just where the Finn went wrong.
It was a rare blip for Bottas, who has finished 8th or higher in all but two races this season, to underline just how strong a job he has done this season.
"Before we could see smoke on television we were monitoring the oil level and we could see that we were losing oil at a relatively slow speed and a speed we thought we would reach the end of the race," Shovlin told soymotor.com.
“When you started to see the smoke, the speed at which the oil was being consumed rose and the car turned off. This is a power unit protection mechanism.
"Now, that power unit has returned to Brixworth and they will be checking it today and at night and will make a statement about whether there has been any damage and if we need to penalize with Valtteri in Abu Dhabi."


---
layout: single
title: Forgotten Factories
sidebar:
nav: "art"
permalink: /art/forgotten-factories
header:
overlay_color: "#000"
overlay_filter: "0.5"
overlay_image: /assets/images/art_banner_forgottenfactories.jpg
---
A magical physics platformer, where you play a young mage exploring the ruins of a fallen empire. See the itch.io page for more details or play it here!


Linus Benedict Torvalds (born December 28, 1969) is a Finnish software engineer who is the creator and, for a long time, principal developer, of the Linux kernel; which became the kernel for operating systems such as the Linux operating system, Android, and Chrome OS. He also created the distributed revision control system Git and the diving logging and planning software Subsurface. He was honored, along with Shinya Yamanaka, with the 2012 Millennium Technology Prize by the Technology Academy Finland "in recognition of his creation of a new open source operating system for computers leading to the widely used Linux kernel". He is also the recipient of the 2014 IEEE Computer Society Computer Pioneer Award.


Patient may experience pain in the joints or muscles.
Patient may experience abnormality of taste, loss of taste, or pins and needles.
Patient may experience dental cavities, dryness, or ulcers.
Patient may experience hoarseness or impaired voice.
Patient may experience difficulty swallowing or dryness.
Patient may also experience other common symptoms such as dry cough, dry eyes, dry skin, fatigue, joint stiffness, stiffness, swollen lymph nodes, or vaginal dryness.


Naugh
t
y
or
Nice
fooballs
Santa's List Stats
Nicest
Naughtiest
---
People on the nice list
---
People on the naughty list
Elf-made in Santa's Workshop by
Katie Ball
Follow @mektball


|
processEEG
A highly optimized program for producing the Event Related Spectral Pertubation from EEG signals.
|
The supporting header file for generating the Continuous Wavelet Transform. More...
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <string.h>
#include <math.h>
#include <fftw3.h>
#include <omp.h>
Go to the source code of this file.
Macros | |
| #define | QUAD_ROOT_PI 0.7511255444649425 |
| the quad root of pi ( \( \pi^{-0.25} \)) computed to machine precision | |
| #define | C_SIGMA 1.00000000000187941284040286940 |
| A constant needed to compute the Morlet Wavelet precalculated to machine precision. More... | |
| #define | K_SIGMA 1.52299797447126284361366292335e-08 |
| A constant needed to compute the Morlet Wavelet precalculated to machine eps. More... | |
| #define | W_0 6.0 |
| The fundamental frequency of the Morlet Wavelet. | |
| #define | W_0_2 36.0 |
| The fundamental frequency of the Morlet Wavelet squared. | |
| #define | D_J 0.0625 |
| #define | PAD_FLAG 1 |
| The type of padding specified for the Continuous Wavelet Transform. More... | |
| #define | FS 2048 |
| #define | DT 1.0/FS |
| \( \delta t = \frac{1}{f_s} \) | |
| #define | S0 2.0 * DT |
| the lowest scale that can be used to compute the CWT \( s_0 = 2 \delta t \) | |
| #define | FREQ 16.0 |
| #define | DATA_SIZE 6144 |
| #define | MAX_FREQUENCY 60.0 |
| The maximum frequency that will be analyzed. | |
| #define | MIN_FREQUENCY 2.0 |
| The minimum frequency that will be analyzed. | |
| #define | MAX_DATA_SIZE 10000000 |
| #define | MIN_I FREQ_TO_SCALE(MAX_FREQUENCY) |
| #define | MAX_I FREQ_TO_SCALE(MIN_FREQUENCY) |
| #define | FREQ_TO_SCALE(x) floor( ( log2( (W_0) / (S0 * 2 * M_PI * x) ) )/D_J) |
| Converts a given frequency x to a scale, handy for debugging. Note the scale is divided into sub octaves. | |
| #define | SCALE_TO_FREQ(x) (W_0)/(x * 2 * M_PI) |
| Converts a given scale x to its corrosponding frequency. | |
| #define | MAGNITUDE(x, y) sqrt( (x * x) + (y * y) ) |
| Computes the 2- norm or the x ^ 2 + y ^ 2, of x and y. | |
Functions | |
| void | FillData (double *data) |
| Populates the input data array with a 3 sparse sine waves. More... | |
| void | TestCases (double *data, const int flag) |
| Generates a suite of test case data for wavelet analysis. More... | |
| int | ReadFile (double data[], char filename[]) |
| int | WriteFile (const double *data, const double *frequency, const int x, const int y, const char filename[]) |
| int | WriteGnuplotScript (const char graph_title[], const char filename[]) |
| int | Plot_PNG (double *data, double *periods, int num_x, int num_y, char graph_title[], const char filename[]) |
| Uses PNGWriter to plot the results of the Continuous Wavelet Transform. More... | |
| int | Plot (double *data, double *frequency, int num_x, int num_y, int plot_type, char graph_title[], char filename[]) |
| int | WriteDebug (const double *data, const int length, const int sampling_frequency, const char *filename) |
| A function that writes a 1 - d matrix into a log file. More... | |
| int | ERSP (double *raw_data, double *scales, const int sampling_frequency, const int n, const int J, int const trials, const int padding_type, double *output) |
| double | CompleteFourierMorlet (double w, const double scale) |
| Computes the Morlet Wavelet in the frequency domain. More... | |
| double | CompleteRealMorlet (double x, double scale) |
| double | CompleteComplexMorlet (double x, double scale) |
| double | CWT_Cosine_Real (double time, double scale) |
| double | CWT_Cosine_Complex (double time, double scale) |
| double | CWT_Dirac_Real (double time, double scale) |
| double | CWT_Dirac_Complex (double time, double scale) |
| int | Wavelet (double *raw_data, double *scales, double sampling_frequency, int n, int J, double *result) |
| A function that computes the Continuous Wavelet Transform for the data given in raw_data. More... | |
| void | CleanData (double *data, double n) |
| double * | GenerateScales (const double minimum_frequency, const double maximum_frequency, const double s_0) |
| This function generates the scales that will be used in the Continuous Wavelet Transform. More... | |
| double * | IdentifyFrequencies (double *scales, int count) |
| Compute the corrosponding frequency to scales used. More... | |
| void | Convolute (double *data, double *conWindow, double *complexWindow, int data_size, int conSize, double *realResult, double *complexResult) |
| int | CWT_Convolution (double *data, double *scales, int data_size, int num_of_scales, double *result) |
| int | CalculatePaddingSize (const int array_size, const int pad_flag) |
| Calculates the size that the padded array should be. More... | |
| int | Generate_FFTW_Wisdom (int padded_size) |
| Analyzes the size of the FFTW arrays and generates the optimal plan. More... | |
| double | Max (double *array, int size) |
| A function that finds the Maximum of a given array. More... | |
| double | Min (double *array, int size) |
| A function that finds the minimum of a given array. More... | |
The supporting header file for generating the Continuous Wavelet Transform.
| C_SIGMA 1.00000000000187941284040286940 |
A constant needed to compute the Morlet Wavelet precalculated to machine precision.
\[ C_\sigma = (1 + e^{-\sigma^2} - 2e^{-\frac{3\sigma^2}{4}})^{-\frac{1}{2}} \]
| D_J 0.0625 |
The amount of "sub octaves" or sub scales inbetween the major scales that will be used. The lower the number, the higher the resolution of the result.
| K_SIGMA 1.52299797447126284361366292335e-08 |
A constant needed to compute the Morlet Wavelet precalculated to machine eps.
\[ \kappa_\sigma = e^{-\frac{\sigma^2}{2}} \]
| PAD_FLAG 1 |
The type of padding specified for the Continuous Wavelet Transform.
The Continuous Wavelet Transform uses the Fast Fourier Transform. It is sometimes efficient to add additional values to the edge of the data array to improve the speed of the FFT. This method is commonly called padding the data array. This variable determins the type of padding that will be used to assist the Fast Fourier Transform. THe padding options are:
0 - No Padding
1 - Zero Padding
2 - Ramp Padding
3 - Repetion Padding
If none of these are specified, the array is not padded by default.
| int CalculatePaddingSize | ( | const int | array_size, |
| const int | pad_flag | ||
| ) |
Calculates the size that the padded array should be.
| array_size | The cardinal or size of the signal sample |
| pad_flag | The type of padding required: see PAD_FLAG |
This function computes the size of the padded array depending on the type of padding specified. It takes the size of the data array, and type of pad, and returns how large the padded array should be.
| void CleanData | ( | double * | data, |
| double | n | ||
| ) |
| data | An 1 x n array with the data to be cleaned |
| n | The size of the data array. |
Takes a 1 x n array and preforms the Z-Score Calculation The array data will be rewritten
| double CompleteFourierMorlet | ( | const double | w, |
| const double | scale | ||
| ) |
Computes the Morlet Wavelet in the frequency domain.
| w | |
| scale |
This function generates the Morlet Wavelet in the frequency domain normalized by the scale.
The formula computed is
\[ \hat{\Psi}_\sigma(\omega) = c_\sigma \pi^{-\frac{1}{4}}(e^{-\frac{1}{2}(\sigma - \omega)^2} - \kappa_\sigma e^{-\frac{1}{2} \omega^2}) \]
| int ERSP | ( | double * | raw_data, |
| double * | scales, | ||
| const int | sampling_frequency, | ||
| const int | n, | ||
| const int | J, | ||
| int const | trials, | ||
| const int | padding_type, | ||
| double * | output | ||
| ) |
| raw_data | A trials * n array containing the data to be analyzed |
| scales | A 1 x J array of the scales that the wavelets will be analyzed in |
| sampling_frequency | The frequency that the data was sampled in |
| n | The numer of samples in each data set |
| J | The number of scales to be analyzed |
| trials | The number of trials conducted for the ERSP |
| output | A n x J array with the resultant ERSP from all of the trials. |
This function conducts the Event Related Spectral Pertubation of the given data set raw_data. It follows the method outlined by the paper: "Single-trial normalization for event-related spectral decomposition reduces sensitivity to noisy trials".
This function uses the Continuous Wavelet Transform to generate the multi-resolution analysis of the given data.
This function is multi-threaded.
This function deals a lot with Fast Fourier Transforms, and can be optimized by using the Generate_FFTW_Wisedom() function. If no wisdom is provided, an approximate FFT algorithm will be used.
The variable raw_data must contain all of the data for each trial.
raw_data, scales, and output must be pre-allocated.
| void FillData | ( | double * | data | ) |
Populates the input data array with a 3 sparse sine waves.
| data | A 1 - dimentional block of memory that will be overwritten. |
Similar to TestCases()
Sine Wave Sample
Sine Wave Sample
| int Generate_FFTW_Wisdom | ( | int | padded_size | ) |
Analyzes the size of the FFTW arrays and generates the optimal plan.
| padded_size | The size of the FFT arrays. |
This function can be used to optimize FFTW. This function will try to find the fastest FFT method based on the size of the array, and will store this information as "FFTW_plan.wise".
This function does not need to be used, but it can significantly improve performance if it is.
| double* GenerateScales | ( | const double | minimum_frequency, |
| const double | maximum_frequency, | ||
| const double | s_0 | ||
| ) |
This function generates the scales that will be used in the Continuous Wavelet Transform.
| minimum_frequency | The lowest frequency that must be observed |
| maximum_frequency | The higest frequency that must be observed |
| s_0 | The smallest scale usually it is \( 2 * \delta t \) |
This function computes the dyadic scales to be generated to accurately compute the multi resolution analysis of a signal. Given the minimum frequency and the maximum frequency, the function will generate a 1 x n array with the scales necessary scale factors for the Continuous Wavelet Transform
The Scales array will be allocated in this function, so it is wise to deallocate this array after it is used.
| double* IdentifyFrequencies | ( | double * | scales, |
| int | count | ||
| ) |
Compute the corrosponding frequency to scales used.
| scales | A 1 x count array of the scales used |
| count | The cardinal of the scales array |
This function computes the corrosponding frequency for each scale provided in the scales array.
It allocates memory and returns the allocated array
It is wise to dealloate this array after use with the free() function.
| double Max | ( | double * | array, |
| int | size | ||
| ) |
A function that finds the Maximum of a given array.
| array | The array to be analyzed |
| size | The size of the array |
| double Min | ( | double * | array, |
| int | size | ||
| ) |
A function that finds the minimum of a given array.
| array | The array to be analyzed |
| size | The size of the array |
| int Plot_PNG | ( | double * | data, |
| double * | periods, | ||
| int | num_x, | ||
| int | num_y, | ||
| char | graph_title[], | ||
| const char | filename[] | ||
| ) |
Uses PNGWriter to plot the results of the Continuous Wavelet Transform.
| data | An num_x * num_y size data array that will be plotted |
| periods | A num_y x 1 array of the frequency used to analyze the signal data |
| num_x | The size of the data |
| num_y | The number of frequencies analyzed |
| graph_title | The title of the graph |
| filename | The name of the file that the data will be written to. |
This function plots a two dimentional array into a png using PNGWriter. It utilizes GetRange() and GetColour() to function. In order to reduce the horizontal length of the image, a stride variable was introduced that will skip a certain number of elements in the data array. THe higher this number the slimmer the resultant graph will be.
The lines_size plots the same pixel in a number of vertical columns. THis allows the vertical scaling to be increased and decreased.
| int ReadFile | ( | double | data[], |
| char | filename[] | ||
| ) |
| A | pre allocated 1 dimentional array |
| filename | The name and location of the file to be opened |
This function opens a file, and reads the input assuming that the file is stored with one value at every line.
| void TestCases | ( | double * | data, |
| const int | flag | ||
| ) |
Generates a suite of test case data for wavelet analysis.
| data | The 1 x n data array to be populated |
| flag | The type of test data to be generated |
This function populates the data array with 3 seconds of sample data. The flag parameter specifies the type of test data that will be generated
| Flag Type | Output |
|---|---|
| 1 | Impulse at T = 2 seconds |
| 2 | 2 Sine waves at t = 1.5 seconds at FREQ and 2 * FREQ |
| 3 | 2 sine waves at FREQ and 2 * FREQ from t = 0 to 3 s |
| 4 | Single sine wave at t = 1.0 s |
| 5 | sin(x) from t = 0.0 to 3.0 and 2*sin(x) from t = 1.5 - 2.0 s |
| 6 | sin(x) from t = 0.0 - 3.0 and sin(x - w0) where w0 = 0.005 from t = 1.0 s - 1.5 s |
| 7 | Frequency Sweep from MIN_FREQUENCY to MAX_FREQUENCY |
| data | The 1 x n data array to be populated |
| flag | The type of test data to be generated |
This function populates the data array with 3 seconds of sample data. The flag parameter specifies the type of test data that will be generated
| Flag Type | Output |
|---|---|
| 1 | Impulse at T = 2 seconds |
| 2 | 2 Sine waves at t = 1.5 seconds at FREQ and 2 * FREQ |
| 3 | 2 sine waves at FREQ and 2 * FREQ from t = 0 to 3 s |
| 4 | Single sine wave at t = 1.0 s |
| 5 | sin(x) from t = 0.0 to 3.0 and 2*sin(x) from t = 1.5 - 2.0 s |
| 6 | sin(x) from t = 0.0 - 3.0 and sin(x - w0) where w0 = 0.005 from t = 1.0 s - 1.5 s |
| 7 | Frequency Sweet from MIN_FREQUENCY to MAX_FREQUENCY |
| int Wavelet | ( | double * | raw_data, |
| double * | scales, | ||
| double | sampling_frequency, | ||
| int | n, | ||
| int | J, | ||
| double * | result | ||
| ) |
A function that computes the Continuous Wavelet Transform for the data given in raw_data.
| raw_data | A 1 x n array with the data required |
| scales | A 1 x J array with all of the scales for generating the wavelets |
| sampling_frequency | The sampling frequency of the given data |
| n | The size of the input data |
| J | The number of scales that is provided |
| result | An n x J array of contiguous memory that stores the result |
This function preforms the Continuous Wavelet Transform using Morlet Wavelets on the data given in raw_data. It stores the result in the result array.
This function only modifies the result array. The arrays must be pre allocated for this function to work.
You can provide the function with scales of your choosing, or one can generate dyadic scales with the GenerateScales() function.
This function is optimized using openmp to allow for multi threading.
| int WriteDebug | ( | const double * | data, |
| const int | length, | ||
| const int | sampling_frequency, | ||
| const char * | filename | ||
| ) |
A function that writes a 1 - d matrix into a log file.
| data | A 1 - dimentional data array containing the data to be written |
| length | The size of the data array |
| sampling_frequency | How often the data array was sampled |
| filename | THe name of the file to be written |
This function writes a 1 - dimentional array to the disk, it's useful when trying to quickly get the results from an array.
| int WriteGnuplotScript | ( | const char | graph_title[], |
| const char | filename[] | ||
| ) |
| graph_title | The title that the graph should be in |
| filename | The name of the file that will be graphed |
This function will generate a file called "script.gplot" that will can be used to plot data generated using WriteFile()


Coordinates in the Live chart.
Defines the chart type and its layout. Values include 'lines', 'bar' and 'points'.
The following attributes should be defined within series
Defines the thickness of the line chart.
If set to true displays the chart.
Specifies the colors of the fill. For Line chart this produces area graphs. If more than one color is specified this will produce a gradient.
If set to true fills the chart with colors in the fillColors property. A number between 0 and 1 defines the opacity of the fill.
Default size of shadows in pixels. Set it to 0 to remove shadows.
Live Charts are defined by the flot
directive. The dataset and options attribute define the live chart data and options respectively.
Dataset and Options are defined within the LiveChartCtrl.
Markings used to draw simple lines and rectangular areas in the background of the plot. It can be an array of ranges in the form of { xaxis: { from, to }, yaxis: { from, to } } or a function(above example) that returns this range.
Note: Refer to the Flot Options page for details of chart options.
To support users of assistive technologies, provide a text summary of the chart with an aria-label
or span
hidden with the sr-only
class. For live charts the most appropriate information to convey will vary depending on the chart’s purpose, but may typically be the highest or most recent data point.
Note: This component can be used in an Angular application by importing the HybridModule.


Depay's late strike lifts Lyon with Toulouse win
Memphis Depay's last-gap goal earned a recovering Olympique Lyonnais a 3-2 victory at Toulouse in Ligue 1 on Saturday.
PARIS: Memphis Depay's last-gap goal earned a recovering Olympique Lyonnais a 3-2 victory at Toulouse in Ligue 1 on Saturday.
Lyon twice came from behind, Depay and Moussa Dembele cancelling out Yaya Sanogo's goal and keeper Anthony Lopes's own goal, and Depay got the winning strike five minutes into extra time to lift them to eighth on 16 points from 12 games.
Under new coach Rudi Garcia, OL have picked up seven points in three league games.
Angers got a 1-0 home win against Racing Strasbourg thanks to a penalty from Stephane Bahoken and moved up to second on 20 points, seven behind Paris St Germain who were beaten 2-1 at lowly Dijon on Friday.
Lille missed out on second place when they lost 2-1 at Olympique de Marseille, who went up to fourth on 19 points.
Lille are fifth, one point adrift.
(Reporting by Julien Pretot; Editing by Clare Fallon)


Embedding the Crosswalk Project
The Crosswalk Project embedding API enables you to embed the Crosswalk Project runtime in an Android application. You can then load a web page (or whole web application) into the embedded runtime, similar to how you might with an Android WebView.
Using the embedding API is only recommended for cases where you have a substantial amount of Java code in your application, but want to write the UI (or parts of the UI) using web technologies. If you just need a runtime wrapper for a web application, there are two simpler options for deploying to Android with Crosswalk:
- Use the default Crosswalk packaging tools to generate an Android package for your web application.
- Use Cordova with Crosswalk: that way, you get de facto standard device APIs, as well as advanced web APIs, but can still mostly build your application using web technologies.
To follow the tutorial, you'll need to be familiar with Android development, including Android Studio. The tutorial steps were tested on Linux (Ubuntu 14.04), but should be adaptable to other platforms and operating systems (e.g. Windows). By the end of the tutorial, you will be able to develop Android applications which embed the Crosswalk runtime.
Prerequisites
Set up the host and target
Before using the embedding API, ensure you have set up your host environment for Android development.
You will also need to set up an Android target to deploy the application to, as described on the Android target setup page.
Download the Crosswalk webview bundle
Note that the webview is architecture specific, so you will need to build multiple version for ARM, x86, and 64-bit devices. Beyond that, there is also a shared version which is architecture independent. Please download it If you want to build the app with shared mode or download mode. About each running mode of Crosswalk Project runtime, please refer to this page for more details.
Each webview bundle contains two components:
- A library project for ADT users
- An AAR file for Android Studio users
Create an application project with the embedding API
Create an Android application with ADT
Select File > New > New Project. Fill in the New Project panel as follows:
- Application Name: MyApplication
- Company Domain: xwalk.org
Project location: choose the location you want to place your project
It should look like this:
Click Next.
In the Target Android Devices panel, set the minimum SDK version. Currently the Crosswalk Project runtime supports 4.1 and above.
Click Next.
In the Add an activity to Mobile panel, select Blank Activity:
Click Next.
Fill in the Customize the Activity panel as follows:
- Activity Name: MainActivity
- Layout Name: activity_main
- Title: MainActivity
- Menu Resource Name: menu_main
It should look like this:
Click Finish.
Import the Crosswalk webview project into Android Studio
Select File > Project Structure
Click the + button at the top-left corner.
In the New Module panel, select Import .JAR/.AAR Package
Click Next.
In the Create New Module panel, choose
xwalk_core_library.aar
from the unzipped Crosswalk webview bundle you downloaded. If you use the shared version of the Crosswalk Project runtime, choosexwalk_shared_library.aar
.Click Finish.
A new module named
xwalk_core_library
will appear in the left column of the Project Structure panel.Select the app module in the left column and then select the Dependencies tab in the right.
Click the + button at the top-right corner and select 3 Module dependency.
In the Choose Modules panel, select xwalk_core_library.
Click OK.
The
xwalk_core_library
should appear in the dependency list of current project.Click OK.
The reference to the Crosswalk Project runtime should now be added to your project.
Add code to integrate the Crosswalk webview
Add necessary permissions
Crosswalk requires a few permissions to be enabled on Android. To enable these, modify the AndroidManifest.xml
file, adding permission lines before the <application>
element.
The minimal permissions required for the Crosswalk webview to render pages are:
<uses-permission android:name="android.permission.ACCESS_NETWORK_STATE" />
<uses-permission android:name="android.permission.INTERNET" />
<uses-permission android:name="android.permission.ACCESS_WIFI_STATE" />
If you want to take advantage of download mode, the following permissions is required:
<uses-permission android:name="android.permission.WRITE_INTERNAL_STORAGE" />
<uses-permission android:name="android.permission.DOWNLOAD_WITHOUT_NOTIFICATION" />
Depending on the features of your app, you may need to request additional permissions. It is considered good security practice on Android to request only those permissions that your app actually needs.
Accessing Location Information
<uses-permission android:name="android.permission.ACCESS_FINE_LOCATION" />
Accessing Camera, Video and Microphone:
<uses-permission android:name="android.permission.CAMERA" />
<uses-permission android:name="android.permission.MODIFY_AUDIO_SETTINGS" />
<uses-permission android:name="android.permission.RECORD_AUDIO" />
Writing data to SD Card:
<uses-permission android:name="android.permission.WRITE_EXTERNAL_STORAGE" />
Keeping Screen On:
<uses-permission android:name="android.permission.WAKE_LOCK" />
Edit the layout file
When the application was generated, some default layout resources were added to the project. Add a single XWalkView
(Crosswalk webview) resource to a proper place in the main layout resource file (res/layout/activity_main.xml
) like this:
<org.xwalk.core.XWalkView
android:id="@+id/xwalkview"
android:layout_width="match_parent"
android:layout_height="match_parent" />
Edit the Activity class
There are three running modes of Crosswalk webview: embedded mode, shared mode and download mode. The next sections describe each of these. For more details of each class, please refer to the Embedding API page.
While following the instructions below, the developer who is familiar with Android WebView would notice that the usage of Crosswalk webview has some differences. That is because, unlike Android webview, the Crosswalk Project runtime hasn’t been prepared yet at the moment the activity is created, so there will be an extra process for initializing the Crosswalk environment. Before it is ready, you can’t arbitrarily use the embedding API.
Embedded Mode/Shared Mode
The embedded mode and shared mode can share the same code, the only difference is which AAR file to be imported. There are two types of interfaces:
XWalkActivity
is an all-in-one interface and easily-used,XWalkInitializer/XWalkUpdater
is more professional and gives the developer more control.XWalkActivity
XWalkActivity
helps to execute all procedures to make the Crosswalk runtime workable and displays dialogs to interact with the user if needed. The activities that hold theXWalkView
objects might want to extendXWalkActivity
to obtain this capability. For those activities, there's no need to useXWalkInitializer
andXWalkUpdater
.public class MyActivity extends XWalkActivity { XWalkView mXWalkView; @Override protected void onCreate(Bundle savedInstanceState) { super.onCreate(savedInstanceState); // Until onXWalkReady() is invoked, you should do nothing with the // embedding API except the following: // 1. Instanciate the XWalkView object // 2. Call XWalkPreferences.setValue() // 3. Call XWalkView.setUIClient() // 4. Call XWalkView.setResourceClient() setContentView(R.layout.activity_main); mXWalkView = (XWalkView) findViewById(R.id.xwalkview); } @Override public void onXWalkReady() { // Do anyting with the embedding API mXWalkView.load("http://crosswalk-project.org/", null); } }
XWalkInitializer
XWalkInitializer
is an alternative toXWalkActivity
with the difference that it provides a way to initialize the Crosswalk Project runtime in background silently. Another advantage is that the developer can use their own activity class directly rather than having it extendXWalkActivity
. However,XWalkActivity
is still recommended because it makes the code simpler.If the initialization failed, which means the Crosswalk runtime doesn't exist or doesn't match the app, you can use
XWalkUpdater
to prompt the user to download a suitable Crosswalk Project runtime.public class MyActivity extends Activity implements XWalkInitializer.XWalkInitListener { XWalkView mXWalkView; XWalkInitializer mXWalkInitializer; @Override protected void onCreate(Bundle savedInstanceState) { super.onCreate(savedInstanceState); // Must call initAsync() before anything that involes the embedding // API, including invoking setContentView() with the layout which // holds the XWalkView object. mXWalkInitializer = new XWalkInitializer(this, this); mXWalkInitializer.initAsync(); // Until onXWalkInitCompleted() is invoked, you should do nothing // with the embedding API except the following: // 1. Instanciate the XWalkView object // 2. Call XWalkPreferences.setValue() // 3. Call XWalkView.setUIClient() // 4. Call XWalkView.setResourceClient() setContentView(R.layout.activity_xwalkview); mXWalkView = (XWalkView) findViewById(R.id.xwalkview); } @Override public void onXWalkInitCompleted() { // Do anyting with the embedding API mXWalkView.load("http://crosswalk-project.org/", null); } @Override public void onXWalkInitStarted() { } @Override public void onXWalkInitCancelled() { // Perform error handling here } @Override public void onXWalkInitFailed() { // Perform error handling here, or launch the XWalkUpdater } }
XWalkUpdater
XWalkUpdater
is a follow-up solution forXWalkInitializer
in case the initialization failed. The user ofXWalkActivity
doesn't need to use this class.XWalkUpdater
helps to download the Crosswalk Project runtime and displays dialogs to interact with the user. By default, it will navigate to the location of the Crosswalk Project runtime in the default application store. The user must then take action to download it. If you specify the download URL of the Crosswalk runtime, it will automatically launch the download manager and fetch the APK.
After the proper Crosswalk Project runtime is downloaded and installed, the user will return to the current activity from the application store or the installer. The developer should check this point and invoke XWalkInitializer.initAsync()
again to repeat the initialization process. Please note that from now on, the application will be running in shared mode.
```
public class MyActivity extends Activity implements XWalkInitializer.XWalkInitListener, XWalkUpdater.XWalkUpdateListener { XWalkUpdater mXWalkUpdater;
...
@Override
protected void onResume() {
super.onResume();
// Try to initialize again when the user completed updating and
// returned to current activity. The initAsync() will do nothing if
// the initialization has already been completed successfully.
mXWalkInitializer.initAsync();
}
@Override
public void onXWalkInitFailed() {
if (mXWalkUpdater == null) {
mXWalkUpdater = new mXWalkUpdater(this, this);
}
// The updater won't be launched if previous update dialog is
// showing.
mXWalkUpdater.updateXWalkRuntime();
}
@Override
public void onXWalkUpdateCancelled() {
// Perform error handling here
}
}
```
If you want the end-user to download the Crosswalk Project runtime from a specific URL instead of switching to the application store, add following
<meta-data android:name="xwalk_apk_url"
android:value="http://myhost/XWalkRuntimeLib.apk" />
Download Mode
You need to use the combination of
XWalkInitializer
andXWalkUpdater
to take advantage of download mode. But the usage is slightly different from the instruction above.First, add the following
<meta-data>
element inside the<application>
element:<meta-data android:name="xwalk_apk_url" android:value="http://myhost/XWalkRuntimeLib.apk" /> <meta-data android:name="xwalk_enable_download_mode" android:value="enable"/>
By default, the application will verify the signature of the downloaded Crosswalk Project runtime, which is required to be the same as the application. You can disable this by adding the following meta-data element:
<meta-data android:name="xwalk_verify" android:value="disable"/>
Then edit the
Activity
class like this:public class MyActivity extends Activity implements XWalkInitializer.XWalkInitListener, XWalkUpdater.XWalkBackgroundUpdateListener { XWalkInitializer mXWalkInitializer; XWalkUpdater mXWalkUpdater; XWalkView mXWalkView; @Override protected void onCreate(Bundle savedInstanceState) { super.onCreate(savedInstanceState); mXWalkInitializer = new XWalkInitializer(this, this); mXWalkInitializer.initAsync(); setContentView(R.layout.activity_main); mXWalkView = (XWalkView) findViewById(R.id.xwalkview); } @Override protected void onResume() { super.onResume(); mXWalkInitializer.initAsync(); } @Override public void onXWalkInitStarted() { } @Override public void onXWalkInitCancelled() { finish(); } @Override public void onXWalkInitFailed() { if (mXWalkUpdater == null) mXWalkUpdater = new XWalkUpdater(this, this); mXWalkUpdater.updateXWalkRuntime(); } @Override public void onXWalkInitCompleted() { mXWalkView.load("file:///android_asset/create_window_1.html", null); } @Override public void onXWalkUpdateStarted() { } @Override public void onXWalkUpdateProgress(int percentage) { } @Override public void onXWalkUpdateCancelled() { finish(); } @Override public void onXWalkUpdateFailed() { finish(); } @Override public void onXWalkUpdateCompleted() { mXWalkInitializer.initAsync(); } }
Debugging Crosswalk webview
To enable debugging of the web application running in an embedded Crosswalk webview, modify the Activity
class like this:
public class MyActivity extends XWalkActivity {
XWalkView mXWalkView;
@Override
protected void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
XWalkPreferences.setValue(XWalkPreferences.REMOTE_DEBUGGING, true);
setContentView(R.layout.activity_main);
mXWalkView = (XWalkView) findViewById(R.id.xwalkview);
}
...
}


Find out a bit more about the site and who the top users are.
Filter the metrics to see which users are the most active and on what subjects.
Choose chart size: 400 Pixels 600 Pixels 800 Pixels Choose chart color: Show chart


This document describes the most commonly-used environment variables which control the functionality of the RAP libraries.
NOTE: When a variable may be set to "true" or "false", this is case-insensitive.
DS SERVER SYSTEM LATEST DATA INFO PROCESS MAPPER JUNEAU DATA MAPPER SERVER MAPPER RSL IMAGES MDV GRIDS
The DS server system is the latest server layer for DIDSS (Data ingest and distributed server system).
| DS Server System | |||
|---|---|---|---|
| Variable | Default value | Description | Library |
| RAP_DATA_DIR | undefined | If set, URLs point to locations relative to RAP_DATA_DIR, unless the file part of the URL starts with / or ., in which case the absolute or relative paths are used. | didss dsserver |
| DATA_DIR | undefined | Alternartive to RAP_DATA_DIR. If RAP_DATA_DIR is defined, it is used. If not, DATA_DIR is used if defined. | didss dsserver |
| DATA_MAPPER_ACTIVE | true | Set to 'false' to turn off automatic access from clients to DataMapper. | dsserver |
| DATA_MAPPER_DEBUG | undefined | Set to 'true' to see debug messages from DATA_MAPPER access requests. | dsserver |
| DS_COMM_TIMEOUT_MSECS | 30000 | This is the timeout, in milli-secs, used in communications between clients and servers. The default value of 30 secs (30000 msecs) was chosen so that programs would not block too long and fail to register with procmap, thereby causing them to be restarted. You may need to inccrease the value over slow lines. If you increase the value, you may be wise to run without the restart layer. | dsserver |
| DS_PING_TIMEOUT_MSECS | 10000 | This is the timeout, in milli-secs, used when pinging a server to see if it is alive. It is used by clients to check whether a server is up, before making the data request. If the server is down, the client makes a request to the server manager (DsServerMgr) to start the server. The DsServerMgr starts the server and then uses a ping to make sure it is alive, before returning a successful flag to the client. | dsserver |
| DS_BASE_PORT | 5430 | All ports in the DS server system are calculated relative to this port. If you need to run two server systems on a single host, for eaxmple for two different users, you can override the default. To be safe, pick a number at least 1000 above the default, because the server ports are in the immediate range above the base. | dsserver |
| SPDB_ALLOW_NO_LOCK | undefined | If set to "true", the Spdb library will not require a lock on the data base files for reads. Locks are still required for writes. This may be used if you are reading data across a cross-mount for which file locking is not implemented. However, the better strategy is to contact a server which has local access to the data. | Spdb |
| CLOSE_SOCKET_IN_CHILD | undefined | If set to "true", the servers will close the listening socket in child processes. This should not be necessary, but was for Linux kernels 2.0.x, and possibly earlier kernels. It is not necessary on Solaris or Linux potato or kernels 2.4 and later. Only set this variable if your system is getting too many open files. You can check this with the 'lsof' command. | dsserver |
| MAX_FORECAST_LEAD_DAYS | 10 | When seraching a directory for data stored in forecast file name format (yyyymmdd/g_hhmmss/f_ssssssss.ext) the library needs to know how far back in time to look for forecast data which may be valid at the current time. It looks back a maximum of this number of days. | didss |
| MDV_WRITE_FORMAT | Set the write format for MDV apps |
Options are:
|
Mdv |
| MDV_WRITE_USING_EXTENDED_PATHS | Tells MDV apps to write using extended file paths |
Options are:
yyyymmdd/hhmmss.mdv becomes yyyymmdd/yyyymmdd_hhmmss.mdv |
Mdv |
| MDV_WRITE_ADD_YEAR_SUBDIR | Tells MDV apps to prepend the year to the output path |
Options are:
yyyymmdd/hhmmss.mdv becomes yyyy/yyyymmdd/hhmmss.mdv |
Mdv |
| FCOPY_SERVER_ALLOW_NO_LOCK | Allow DsFCopyServer to not lock files on write. |
Options are:
|
dsserver |
| FCOPY_SERVER_TMP_DIR | Specify tmp dir for DsFCopyServer on write. |
Options are:
|
dsserver |
| USER | Account user name | The Ds Server messaging layer uses this to tag each message with the client's user name. You can spoof the user name by resetting this variable. | dsserver |
The latest data info files are small text files which are written to a data directory to indicate the time of the latest data written to that directory. The default file name is _latest_data_info. There is also a file message queue (FMQ) option which causes the latest info also to be written to an FMQ.
| Latest Data Info files | |||
|---|---|---|---|
| Variable | Default value | Description | Library |
| LDATA_FMQ_ACTIVE | true | By default the FMQ is active. If this is set to "false", the FMQ (file message queue) option will be deactivated. If active, the routines write both a text file and an FMQ containing the latest data info. The FMQ option is useful for cases in which data arrives rapidly and the client may miss data information while polling. Since the FMQ is a queue, the client can read the entries without risk of missing an entry. | didss |
| LDATA_FMQ_NSLOTS | 2500 | The number of slots in the FMQ, if it is active. The queue wraps once this number of entries is reached. Increase if data arrives very rapidly and the clients may need more time to read the queue. | didss |
| LDATA_NO_WRITE | undefined | If set to "true", no _latest_data_info files will be written. This is sometimes useful in archive mode when you do not want to overwrite the realtime files. | toolsa didss dsserver |
The process management layer relies on 'procmap', the process mapper. Programs register a hearbeat with procmap, typically once per minute. Normally one procmap runs per host. The auto_restart script checks the procmap list against an expected list of processes, and restarts those which are not running.
| procmap | |||
|---|---|---|---|
| Variable | Default value | Description | Library |
| PROCMAP_HOST | localhost | The host name on which the process mapper is running. Running programs register with the mapper running on this host. For most systems this will be the local host. There are almost no systems in use which use a central process mapper. | toolsa |
| PROCMAP_HOST2 | undefined | Alternative process mapper host, for redundant systems. If set, running programs register with the mapper running on this host in addition to the main one. For most systems this is not used. | toolsa |
| PROCMAP_DIR | undefined | If defined, it should be a directory path. Each time a process registers with procmap, the status string will be written to a file in this directory. This is useful for debugging if a system crashes badly and procmap no longer runs. It is seldom used. | toolsa |
| PROCMAP_VERBOSE | undefined | If set to "true", verbose debugging messages are printed out during communication with procmap. | toolsa |
| USER | Account user name | When the programs contact procmap, they use this variable to indicate the name of the user running the process. You can spoof the user name by resetting this variable. | toolsa |
The Juneau data management layer relies on 'datamap', the Juneau data mapper. As programs write data, they register with datamap.
| datamap | |||
|---|---|---|---|
| Variable | Default value | Description | Library |
| DATAMAP_HOST | localhost | The host name on which the Juneau data mapper is running. For most systems this will be the local host. | toolsa |
| DATAMAP_HOST2 | undefined | Alternative Juneau data mapper host, for redundant systems. If set, programs register data information with the mapper running on this alternative host in addition to the main one. For most systems this is not used. | toolsa |
| DATAMAP_VERBOSE | undefined | If set to "true", verbose debugging messages are printed out during communication with datamap. | toolsa |
NOTE: The server mapper is part of the old server infrastructure, and is no longer in widespread use.
| servmap | |||
|---|---|---|---|
| Variable | Default value | Description | Library |
| SERVMAP_HOST | localhost | The host name on which the server mapper is running. Servers register with the mapper running on this host. For most systems this will be the local host. | toolsa |
| SERVMAP_HOST2 | undefined | Alternative server mapper host, for redundant systems. If set, servers register with the mapper running on this host in addition to the main one. For most systems this is not used. | toolsa |
| SERVMAP_VERBOSE | undefined | If set to "true", verbose debugging messages are printed out during communication with servmap. | toolsa |
The RSL radar data handling library was written by NASA for the TRMM project.
| rsl library | |||
|---|---|---|---|
| Variable | Default value | Description | Library |
| RSL_COLOR_DIR | undefined | The directory for color tables used in RSL image rendering routines. | trmm_rsl |
| Mdv grid class | |||
|---|---|---|---|
| Variable | Default value | Description | Library |
| MDV_GRID_TOLERANCE | 0.0000001 | Tolerance used when checking whether two grids are equal. | mdv |


ADDRESS
1234 Street NamADDRESS:
Mc Arthur Highway, Sampaloc, Apalit, Pampanga
OFFICE HOURS
MONDAY to FRIDAY – 7:00 A.M. to 5:00 P.M.
Closed every Saturday and Sundaye
City, AA 99999
CONTACTS:
OFFICE OF THE REGISTRAR
<EMAIL_ADDRESS>(045) 436 – 1487
INFORMATION SERVICES
<EMAIL_ADDRESS>HUMAN RESOURCE DEPARTMENT
<EMAIL_ADDRESS>FOLLOW US


|
Tests the status flags in the EFLAGS register and moves the source operand (second operand) to the destination operand (first operand) if the given test condition is true. The condition for each mnemonic is given in the Descriptions column above and in Table 7-4 in the IA-32 Intel Architecture Software Developer's Manual, Volume 1. The source operand is always in the ST(i) register and the destination operand is always ST(0).
The FCMOVcc instructions are useful for optimizing small IF constructions. They also help eliminate branching overhead for IF operations and the possibility of branch mispredictions by the processor.
A processor may not support the FCMOVcc instructions. Software can check if the FCMOVcc instructions are supported by checking the processor's feature information with the CPUID instruction (see "COMISS-Compare Scalar Ordered Single-Precision Floating-Point Values and Set EFLAGS" in this chapter). If both the CMOV and FPU feature bits are set, the FCMOVcc instructions are supported.
|


Tools for modelling populations and demography using matrix projection models, with deterministic and stochastic model implementations. Includes population projection, indices of short- and long-term population size and growth, perturbation analysis, convergence to stability or stationarity, and diagnostic and manipulation tools.
| Version: | 1.3-0 |
| Depends: | R (≥ 3.4.0) |
| Imports: | expm, graphics, methods, MCMCpack, stats |
| Suggests: | knitr, magick |
| Published: | 2018-03-17 |
| Author: | Iain Stott [aut, cre], Dave Hodgson [aut], Stuart Townley [aut], Stephen Ellner [ctb] |
| Maintainer: | Iain Stott <iainmstott at gmail.com> |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| NeedsCompilation: | no |
| Materials: | ChangeLog |
| CRAN checks: | popdemo results |
| Reference manual: | popdemo.pdf |
| Vignettes: |
popdemo: Demographic modelling using projection matrices |
| Package source: | popdemo_1.3-0.tar.gz |
| Windows binaries: | r-devel: popdemo_1.3-0.zip, r-release: popdemo_1.3-0.zip, r-oldrel: popdemo_1.3-0.zip |
| OS X binaries: | r-release: popdemo_1.3-0.tgz, r-oldrel: popdemo_1.3-0.tgz |
| Old sources: | popdemo archive |
Please use the canonical form https://CRAN.R-project.org/package=popdemo to link to this page.


Before Change
def test_average_pool(self):
// TODO: uncomment this in the future
return
shape = [1, 1, 40, 40]
node_def = helper.make_node("AveragePool", ["X"], ["Y"],
kernel_shape=[1,2],
pads=[0, 0], strides=[1,1])
After Change
def test_average_pool(self):
device = "CUDA"
if not supports_device(device):
raise unittest.SkipTest(
"Backend doesn"t support device {}".format(device))
shape = [1, 1, 40, 40]
node_def = helper.make_node("AveragePool", ["X"], ["Y"],
kernel_shape=[1,2],
pads=[0, 0], strides=[1,1])


WinJS.Promise.any(promiseValues): Create a Promise which is fulfilled as soon as one of the input Promises is fulfilled.


This is my heart- to celebrate the adventurous spirit that is rooted in every business and make their passion visible through design.
Learn Moreidentity, branding & more
Building brands.
Creating products.
Transforming business.


{% extends "melange/root.html" %} {% comment %} Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. {% endcomment %} {% block meta %} {{ block.super }} {% endblock meta %} {% block stylesheets %} {% endblock stylesheets %} {% block body %} {% block extra_header %} {% endblock extra_header %}


Privacy Policy
- This app is not intended for any commercial purposes whatsoever, and it will not use your personal information in any way other than to write a post to your wall, if you explicitly choose to do so. Any changes to this (e.g. adding recommendation buttons) will be explicitly stated in the TOS and brought to users' attention.
- No permissions are required to view the cables, permissions will only be requested if you want the app to post to your wall.


Video Production
If a picture is worth a thousand words. What do you think video is worth? What other format allows you to communicate 200 words of text in 60 seconds, yielding proven results? None. 96% of B2B organizations use video in some capacity, of which 73% report positive results to their ROI. Imagine your story. Now imagine your story told 1000 times across multiple channels to 100 of potential prospects who could be potential clients. Video allow you to express yourself and reach a new level of communication that was previously difficult to achieve.
Forget what video is and focus on what video can do for your business.
- You can use video on your website to connect with your audience. Sure, you can add a message and expect every visitor to read the complexities of your offering or the amazing feats you’ve accomplished to get where you are, but why would you? The personal touch of a video allows your visitors to connect and relate.
- SEO (Search Engine Optimization) is hidden engine that elevates your online brand and gives you the power to forge ahead on the worldwide web. Videos contain a great deal of content and Google loves them! Videos show up as individual results in Google and are a great way of directing traffic to your website.
- Professionally executed video that tells your story, makes announcements, answers questions, teaches topics, etc., provides a quality feel to your business and establishes you as a resource of information in a vast sea of resources, extending your reach and strengthening your brand.
So, now that you can see what video can do for you, let Assets team of video professionals help you tell your story.
Option 1: In-House shoot (At Asset)
Come to Asset Marketing’s in-house studio in beautiful San Diego, California. The on-site experience will include the following:
- Full day session for you and your team.
- 1-2 make-up artists.
- Creative director.
- Professional cameraman.
- Sound engineer.
Option 2: Off-Site shoot (Your Location)
If you can’t make it to us, we’ll come to you. The off-site experience will include the following:
- 1/2 day session for you and your team.*
- 1 Make-up artist.**
- Mobile studio lighting.
- Creative director.
- Professional cameraman.
- Sound engineer.


Streetscope is a service to allow people, but especially computer programs, to submit an address like '123 Main St.' and find its lat/lon coordinates and canonical parcel_id in the Lexington, KY Property Value Administrator's set of addresses.
Because LFUCG (Lexington's government) has many datasets that contain addresses that are captured as '449 W. Fourth St.' in one database and '449 W 4th St.' in another. This service lets you look them up and find their precise parcel id, despite spelling variations.
When programming, make a HTTP GET request to http://streetscope.net/geocode?query=449+w+4th.
See full details on Github.
The geoJSON response:
The json result can be previewed through the HTML web page.
Made with love by the 2014 Code for America fellows working with Lexington, KY, with completely indispensable help from Jonathan Hollinger and Shaye Rabold at Lexington-Fayette Urban County Government, David O'Neill, Fayette County Property Valuation Administrator, and Jeremia Kimelman, 2014 Code for America Fellow working with Chattanooga, TN.
Contact the fellows with questions and feedback!


{{audiobook.author}}
{{audiobook.subjects}}
{{audiobook.length}}
{{audiobook.rating}}
{{audiobook.description}}


ExtraRelaTable is a thesis project developed by Václav Brodec at Faculty of Mathematics and Physics of Charles University in Prague, which applies bottom-up approach to assignment of RDF properties to numeric table columns; these properties identify the relations formed between the columns and the subject of the table. The project follows and complements preceding work of Neumaier et al., which uses more general top-down approach to labeling of numeric columns.
The algorithm is exposed through public REST API at http://localhost:8080/extrarelatable/, supposed that the packaged WAR is deployed in a local servlet container on default port. ERT may optionally use available running instance of Odalic STI tool (https://github.com/odalic) to provide additional context, which increases the effectiveness of the algorithm.
Alongside the main application, a small experimental framework is included, implemented as a set of JUnit tests, which allow to thoroughly evaluate the algorithm on various supported data sets.
The project is documented in the accompanying thesis Discovering and Creating Relations among CSV Columns using Linked Data Knowledge Bases. The sources are hosted at https://github.com/brodecva/extrarelatable.


|
sound_variable = any valid sound variable previously created with the LoadSound command.
pan# = floating point number from -1 (left) to 0 (center) to 1 (right) |
| Use this command to pan your sound effect between the left and right speakers (or restore the panning to the center). Use this for cool panning stereo sounds during your game. |
|
; Load sound sample
sndDeath=LoadSound("audiodeath.wav") ; Pan sound effect half to the left SoundPan sndDeath,-.5 ; Play sound PlaySound sndDeath |