Publications
Overview
For an overview of citations of my papers, please view my Google Scholar profile.
Conference Proceedings
-
R. Sanya and E. Mwebaze. (2018): Using socio-economic wellbeing to predict geospatial epidemic intensity in a developing country setting. In 21st AGILE Conference on Geospatial Technologies, Lund, Sweden June 12th – 15th, 2018. link
-
R. Sanya & M. Mubangizi. (2016): Using mobile phone data to study dynamics of rural-urban mobility. In IEEE International Conference on Data Science & Engineering, Kochi, India, 2016. Link
Workshop Presentations
-
R. Sanya and E. Mwebaze (2018): Mapping spatial housing patterns using Deep Neural Networks and remote sensing data. NeurIPS 2018 Machine Learning for the Developing World Workshop, 32nd Conference on Neural Information Processing Systems (NeurIPS) , Montreal, Canada, December 8th, 2018. Link
-
R. Sanya. (2017): Using spatial features of human settlement to predict epidemic properties. In Data Science Africa Workshop 2017 , Arusha Tanzania. [slides]
-
R. Sanya. (2017) Privacy and information security awareness among users of personal mobile devices in higher education in Uganda. UMU 8th Annual Research Conference. January 25th, 2017, Uganda Martyrs University, Nkozi, Uganda [slides].
-
R. Sanya. (2019) A Convolutional Neural Network model for predicting epidemic spatial pattern.[poster]


This table contains all the entries for GFP and
related proteins in the UniProt database, with links to view the original
protein entries. If you click on any of
the pictures of the organisms, you will get an enlarged view. The variations in the chromophore sequence
between the proteins are shown. The
proteins used to construct the signatures are given with links to the relevant
databases.
UniProt
|
Protein name
|
Organism
|
|
Chromophore
|
InterPro domain
Architecture
|
InterPro Graphical Match
|
|
P42212
|
Green Fluorescent protein
|
Aequorea victoria
Jellyfish
|
|
SYG
|
|
|
|
Q17105
|
Green fluorescent protein
(Fragment)
|
Aequorea victoria
Jellyfish
|
|
SYG
|
|
|
|
Q17106
|
Green fluorescent protein
(Fragment)
|
Aequorea victoria
Jellyfish
|
|
SYG
|
|
|
|
Q93125
|
Green fluorescent protein
mutant 3
|
Aequorea victoria
Jellyfish
|
|
GYG
|
|
|
|
Q8WP95
|
Green fluorescent protein
|
Aequorea macrodactyla
Jellyfish
|
|
SYG
|
|
|
|
Q8WTC4
|
Green fluorescent protein
|
Aequorea macrodactyla
Jellyfish
|
|
GYG
|
|
|
|
Q8WTC5
|
Orange fluorescent protein
|
Aequorea macrodactyla
Jellyfish
|
|
GYG
|
|
|
|
Q8WTC6
|
Green fluorescent protein
|
Aequorea macrodactyla
Jellyfish
|
|
SYG
|
|
|
|
Q8WTC7
|
Green fluorescent protein
|
Aequorea macrodactyla
Jellyfish
|
|
SYG
|
|
|
|
Q8WTC8
|
Green fluorescent protein
|
Aequorea macrodactyla
Jellyfish
|
|
GYG
|
|
|
|
Q8WTC9
|
Green fluorescent protein
|
Aequorea macrodactyla
Jellyfish
|
|
GYG
|
|
|
|
Q8WTD0
|
Green fluorescent protein
|
Aequorea macrodactyla
Jellyfish
|
|
GYG
|
|
|
|
Q8MMA1
|
Green fluorescent protein-like protein
|
Agaricia agaricites
Lettuce coral
|
|
MYG
|
|
|
|
Q8MMA2
|
Green fluorescent protein-like
protein
|
Agaricia fragilis
Fragile saucer
coral
|
|
MYG
|
|
|
|
Q9U6Y6
|
Fluorescent protein FP486
|
Anemonia majano
Rock anemone
|
|
KYG
|
|
|
|
Q9GPI5
|
Nonfluorescent red protein asCP562
|
Anemonia sulcata
Snake-locks sea anemone
|
|
MYG
|
|
|
|
Q9GPI6
|
Green fluorescent protein asFP499
|
Anemonia sulcata
Snake-locks sea anemone
|
|
QYG
|
|
|
|
Q9GZ28
|
GFP-like chromoprotein FP595
|
Anemonia sulcata
Snake-locks sea anemone
|
|
MYG
|
|
|
|
Q9U6Y3
|
Fluorescent protein FP484
|
Clavularia sp.
Tree fern corals
|
|
QYG
|
|
|
|
Q8T5E7
|
CgigFP-g
|
Condylactis gigantea
Giant sea anemone
|
|
QYG
|
|
|
|
Q95W86
|
GFP-like non‑fluorescent
chromoprotein
|
Condylactis gigantea
Giant sea anemone
|
|
AYG
|
|
|
|
Q8MU45
|
Green fluorescent protein-like protein
|
Condylactis gigantea
Giant sea anemone
|
|
AYG
|
|
|
|
Q95W11
|
GFP-like chromoprotein
|
Condylactis passiflora
Pink-tipped anemone
|
|
AYG
|
|
|
|
Q8T6U0
|
Green fluorescent protein
|
Dendronephthya sp. SSAL-2002
Carnation corals
|
|
HYG
|
|
|
|
Q9U6Y8
|
Fluorescent protein FP583
|
Discosoma sp.
Soft mushroom corals
|
|
QYG
|
|
|
|
Q9GTJ7
|
Red fluorescent protein
|
Discosoma sp. SSAL-2000
Soft mushroom corals
|
|
QYG
|
|
|
|
Q8T6T8
|
Green fluorescent protein
|
Discosoma sp. SSAL-2002
Soft mushroom corals
|
|
QYG
|
|
|
|
Q9U6Y7
|
Fluorescent protein FP483
|
Discosoma striata
Soft mushroom coral
|
|
QYG
|
|
|
|
Q95P04
|
GFP-like chromoprotein
|
Goniopora tenuidens
Flowerpot coral
|
|
QYG
|
|
|
|
Q8MU48
|
Green fluorescent protein-like protein
|
Montastraea annularis
Boulder star coral
|
|
DYG
|
|
|
|
Q8MU47
|
Green fluorescent protein-like
protein
|
Montastraea cavernosa
Great star coral
|
|
DYG
|
|
|
|
Q8T5F1
|
McavFP_7.5
|
Montastraea cavernosa
Great
star coral
|
|
HYG
|
|
|
|
Q8T5F2
|
McavFP_6
|
Montastraea cavernosa
Great star coral
|
|
DYG
|
|
|
|
Q95UA7
|
Cyan fluorescent protein
(fragment)
|
Montastrae
cavernosa
Great star coral
|
|
QYG
|
|
|
|
Q95VT0
|
Green fluorescent protein
|
Montastraea cavernosa
Great star coral
|
|
DYG
|
|
|
|
Q963F5
|
Green fluorescent protein
|
Montastraea cavernosa
Great star coral
|
|
QYG
|
|
|
|
Q962P9
|
Green fluorescent protein
|
Montastraea faveolata
Mountainous star coral
|
|
DYG
|
|
|
|
Q8ISF8
|
Red fluorescent protein FP611
|
Parasicyonis actinostoloides
Sea anemone
|
|
MYG
|
|
|
|
Q9BLZ0
|
Green fluorescent protein
|
Ptilosarcus sp. CSG-2001
Sea pen
|
|
QYG
|
|
|
|
Q8T6T9
|
Green fluorescent protein
|
Radianthus macrodactylus
Leathery sea anemone
|
|
RYG
|
|
|
|
Q95W85
|
GFP-like chromoprotein
|
Radianthus macrodactylus
Leathery sea anemone
|
|
EYG
|
|
|
|
Q9BLY9
|
Green fluorescent protein
|
Renilla muelleri
Sea pansy
|
|
QYG
|
|
|
|
Q963I9
|
Green fluorescent protein
|
Renilla reniformis
Sea pansy
|
|
SYG
|
|
|
|
Q8MU46
|
Green fluorescent protein-like
protein
|
Ricordea florida
Florida mushroom coral
|
|
QYG
|
|
|
|
Q8T5E8
|
RfloFP_1.2
|
Ricordea
florida
Florida mushroom coral
|
|
HYG
|
|
|
|
Q8T5E9
|
Green fluorescent protein-like
protein
|
Ricordea florida
Florida mushroom coral
|
|
QYG
|
|
|
|
Q8T5F0
|
ScubFP_4.4
|
Scolymia cubensis
Artichoke coral
|
|
QYG
|
|
|
|
Q8T5F3
|
ScubFP_3.3
|
Scolymia cubensis
Artichoke coral
|
|
QYG
|
|
|
|
Q8I6J8
|
Kaede
|
Trachyphyllia geoffroyi
Stony 'green open brain' coral
|
|
HYG
|
|
|
|
Q9U6Y4
|
Fluorescent protein FP538
|
Zoanthus sp.
Soft coral, Sea mats, Moon polyps,
Button polyps
|
|
KYG
|
|
|
|
Q9U6Y5
|
Fluorescent protein FP506
|
Zoanthus sp.
Soft coral, Sea mats, Moon polyps,
Button polyps
|
|
NYG
|
|
|
|
Q8T4U4
|
Red fluorescent protein zoanRFP
|
Zoanthus sp. SAL-2001
Soft coral, Sea mats, Moon polyps,
Button polyps
|
|
DYG
|
|
|
|
Q8GHE4
|
Green fluorescence protein
|
Azomonas agilis
Diazotrophic bacteria
|
|
SYG
|
|
|
|
Q8GHE2
|
Green fluorescence protein
|
Azotobacter vinelandii
Diazotrophic bacteria
|
|
SYG
|
|
|
|
Q8GHE3
|
Green fluorescence protein
|
Azotobacter vinelandii
Diazotrophic bacteria
|
|
SYG
|
|
|


Home
Calls
Chats
Calendar
Homework
Notes
User Profile
Toggle navigation
Dashboard
Log out
One-to-One calls
Have conversations with other individuals!
Individual Calls
Group calls
Talk with multiple people on the same call!
Group calls
Test Name
Test status
Start a Private Call
Start a Group Call
Test Name
Test status
Start a Private Call
Start a Group Call
Test Name
Test status
Start a Private Call
Start a Group Call
Select a person to call
Accept Call
New Call
Share Screen
End Call
Select a person to call
Accept Call
Start a Group Call
New Call
End Call
Share Screen


Contact “One of the most important things you can do on this earth is to let people know they are not alone.” ― Shannon L. Alder


(This post is part of the {{post['series']}} series.)
{{post['title']}}
Pardon the interruption! I'm currently looking for a full-time or part-time development position. View my resume
Pardon the interruption! I'm currently looking for a full-time or part-time development position. View my resume
(This post is part of the {{post['series']}} series.)
If this article helped you solve your problem, consider hiring me for a full-time or part-time position so I can help you solve more problems! View my resume


Friend Finder helps you discover the people you are most compatible with. Simply answer a few basic questions to reveal the friends with your greatest compatibility!
Find My Friend!
API Friends List


Implementation of a likelihood ratio test of differential onset of senescence between two groups. Given two groups with measures of age and of an individual trait likely to be subjected to senescence (e.g. body mass), 'OnAge' provides an asymptotic p-value for the null hypothesis that senescence starts at the same age in both groups. The package implements the procedure used in Douhard et al. (2017) <doi:10.1111/oik.04421>.
| Version: | 1.0.1 |
| Depends: | R (≥ 3.0.0) |
| Imports: | stats |
| Suggests: | lme4 |
| Published: | 2017-10-20 |
| Author: | Laurent Jacob, Frédéric Douhard, Jean-François Lemaître, Jean-Michel Gaillard, Aurélie Siberchicot |
| Maintainer: | Aurélie Siberchicot <aurelie.siberchicot at univ-lyon1.fr> |
| License: | GPL-3 |
| URL: | https://lbbe.univ-lyon1.fr/OnAge.html |
| NeedsCompilation: | no |
| Citation: | OnAge citation info |
| Materials: | NEWS |
| CRAN checks: | OnAge results |
| Reference manual: | OnAge.pdf |
| Vignettes: |
Using OnAge |
| Package source: | OnAge_1.0.1.tar.gz |
| Windows binaries: | r-devel: OnAge_1.0.1.zip, r-release: OnAge_1.0.1.zip, r-oldrel: OnAge_1.0.1.zip |
| OS X binaries: | r-release: OnAge_1.0.1.tgz, r-oldrel: OnAge_1.0.1.tgz |
Please use the canonical form https://CRAN.R-project.org/package=OnAge to link to this page.


Toggle navigation
{{currentTeam.teamName}}
Dashboard
Settings
Profile
Help
Channels ({{channels.length}})
# {{channel.name}}
Hello World - all messages go here


_Urban_Legends:_Final_Cut_ (R) * 1/2 (out of ****)
The original _Urban_Legend_ grossed only $38 million at U.S. theatres in the fall of 1998, but given how cheaply (in _every_ conceivable meaning of the word) that horror flick was produced, a profit was inevitable--and, of course, a sequel. However, _Urban_Legends:_Final_Cut_ is less sequel than very loose spinoff--a good thing, considering how abysmally ludicrous the original was. But to say that the new film is a step above its predecessor isn't saying much at all, for _Final_Cut_ simply takes a more tolerable approach to the same sort of slasher silliness.
_UL2_ (as the title initially appears onscreen) marks the feature directorial debut of film virtuoso John Ottman, who has already made a name for himself as a score composer and film editor (two positions he once again holds here in addition to the directing reins); his contributions are what elevate the film above the original. His most savvy move was the casting of unknown Jennifer Morrison, who does a much more capable job in the lead than the unimpressive Alicia Witt in the first film. Morrison is likable and convincing as Amy, one of a number of student filmmakers at Alpine University vying for the prestigious Hitchcock Award for best thesis film--which, we are repeatedly told, "guarantees a career in Hollywood."
With that preposterous plot point, writers Scott Derrickson and Paul Harris Boardman immediately throw all story plausibility out the window--long before various co-eds get bumped off by a mysterious stranger wearing a fencing mask. Of course, all these students are all in the running for the Hitchcock, and presumably the masked murderer is killing to get his or her hands on the award and that coveted career.
Much to Ottman's credit, the requisite scare sequences are refreshingly light on the cheap fakeout (which was plentiful in _UL1_), and they are done with a reasonable sense of style and some dark, cheeky humor; this is especially the case with the first major murder scene, which begins with a riff on the "kidney heist" urban legend. However, though the film is called _Urban_Legends_, this is the only concrete reference to that idea. Amy's thesis film is supposed about an urban legend killer (namely, the story of the first film), but all the "legends" are invented ones. And the one major tie to _UL1_, the character of security guard Reese (Loretta Devine, again wasted), adds nothing to the mix.
Which begs the question--why even make this film as an _Urban_Legend_ sequel? The answer is simple: without the tangential ties to the first film, _UL2_ would too obviously be a low-rent version of the also moviemaking-themed _Scream_3_. Ottman does what he can to make this bad idea work (there are some stylishly edited visuals, and his score is up to his standards), but ultimately he and the actors--excepting _Blossom_ alum Joey (I refuse to call him by his new, official moniker of "Joseph") Lawrence, whose work is dreadful all around--must go down the path laid down by the writers, and the course they have mapped out is not pretty.
The subtitle of _Urban_Legends_, _Final_Cut_, is meant to be a play on words referring to filmmaking and the slice-and-dice killings, but one can only hope it also means something else--that this is the final lame-o youth horror film we see in a very long time.
Michael Dequina<EMAIL_ADDRESS>|<EMAIL_ADDRESS>|<EMAIL_ADDRESS>Mr. Brown's Movie Site: http://www.moviereportsite.com CinemaReview Magazine: http://www.CinemaReview.com on ICQ: #25289934 | on AOL Instant Messenger: MrBrown23
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


Equivalent to clicking the Scenarios command on the Tools menu and then clicking the Summary button. Generates a table summarizing the results of all the scenarios for the model on your worksheet.
Syntax
SCENARIO.SUMMARY(result_ref, report_type)
SCENARIO.SUMMARY?(result_ref, report_type)
Result_ref is a reference to the result cells you want to include in the summary report. Normally, result_ref refers to one or more cells containing the formulas that depend on the changing cell values for your model—that is, the cells that show the results of a particular scenario.
If result_ref is omitted, no result cells are included in the report.
If result_ref contains nonadjacent references, you must separate the reference areas by commas and enclose result_ref in an extra set of parentheses.
Report_type is a number specifying the type of report desired.
|
|
|
|
|
|
Remarks
SCENARIO.SUMMARY generates a summary table of the changing cell and result cell values for each scenario.
The table is generated on a new sheet in the current workbook. The sheet becomes active after SCENARIO.SUMMARY runs.
Return to index


MRI & fMRI datasets#
OpenfMRI#
OpenfMRI: is a data sharing resource for task-based fMRI data. It aims to provide a resource for any fMRI researcher who wishes to share their data openly. The OpenfMRI project is managed by the Poldrack Lab and Center for Reproducible Neuroscience at Stanford University, with computing resources provided by the Texas Advanced Computing Center and Amazon.com .
Open Access Series of Imaging Studies (OASIS Brains)#
Open Access Series of Imaging Studies (OASIS): is a project aimed at making neuroimaging data sets of the brain freely available to the scientific community. By compiling and freely distributing neuroimaging data sets, they hope to facilitate future discoveries in basic and clinical neuroscience.
Alzheimer's Disease Neuroimaging Initiative (ADNI)#
Alzheimer's Disease Neuroimaging Initiative (ADNI): is a longitudinal multicenter study designed to develop clinical, imaging, genetic, and biochemical biomarkers for the early detection and tracking of Alzheimers disease (AD).
FastMRI Dataset#
fastMRI: is a collaborative research project between Facebook AI Research (FAIR) and NYU Langone Health. The aim is to investigate the use of AI to make MRI scans up to 10 times faster.
MRI data#
MRI data: is an open platform for researchers to share magnetic resonance imaging (MRI) raw k-space datasets.


Aliases
In MongoDB, since the database is schemaless and the field names are included for every document in the JSON, much more storage space is required than traditional databases with schemas. Because of this, a common practice is to store very short field names in the documents to conserve space. This is not ideal from a business domain standpoint so mappers like Mongoid provide alias functionality to keep the domain model expressive. An example of this in Mongoid is:
class Band include Mongoid::Document field :n, as: :name, type: String end
In the above example you can reference the field by `Band#name`, but the field in the database is stored as `n`. We want to maintain this expressiveness in querying the database as well, so the Queryable needs a hash to know how to map the name to the field in the database. You pass this as the first argument to the queryable's constructor.
class Query include Origin::Queryable end queryable = Query.new({ "name" => "n" })
The aliases hash *must* be string keys and string values. Then you can do this and it will get converted to the database field name `n`:
queryable.where(name: "value") queryable.selector #=> { "n" => "value" }


class Sass::Script::Value::Color
A SassScript object representing a CSS color.
A color may be represented internally as RGBA, HSLA, or both. It’s originally represented as whatever its input is; if it’s created with RGB values, it’s represented as RGBA, and if it’s created with HSL values, it’s represented as HSLA. Once a property is accessed that requires the other representation – for example, {#red} for an HSL color – that component is calculated and cached.
The alpha channel of a color is independent of its RGB or HSL representation. It’s always stored, as 1 if nothing else is specified. If only the alpha channel is modified using {#with}, the cached RGB and HSL values are retained.
Constants
- ALTERNATE_COLOR_NAMES
- COLOR_NAMES
A hash from color names to `[red, green, blue]` value arrays.
- COLOR_NAMES_REVERSE
A hash from `[red, green, blue, alpha]` value arrays to color names.
Public Class Methods
Create a new color from a valid CSS hex string.
The leading hash is optional.
@return [Color]
# File lib/sass/script/value/color.rb, line 268 def self.from_hex(hex_string, alpha = nil) unless hex_string =~ /^#?([0-9a-f]{2})([0-9a-f]{2})([0-9a-f]{2})$/i || hex_string =~ /^#?([0-9a-f])([0-9a-f])([0-9a-f])$/i raise ArgumentError.new("#{hex_string.inspect} is not a valid hex color.") end red = $1.ljust(2, $1).to_i(16) green = $2.ljust(2, $2).to_i(16) blue = $3.ljust(2, $3).to_i(16) attrs = {:red => red, :green => green, :blue => blue} attrs[:alpha] = alpha if alpha new(attrs) end
@private
Convert a ruby integer to a rgba components @param color [Fixnum] @return [Array<Fixnum>] Array of 4 numbers representing r,g,b and alpha
# File lib/sass/script/value/color.rb, line 22 def self.int_to_rgba(color) rgba = (0..3).map {|n| color >> (n << 3) & 0xff}.reverse rgba[-1] = rgba[-1] / 255.0 rgba end
Constructs an RGB or HSL color object, optionally with an alpha channel.
The RGB values must be between 0 and 255. The saturation and lightness values must be between 0 and 100. The alpha value must be between 0 and 1.
@raise [Sass::SyntaxError] if any color value isn’t in the specified range
@overload initialize(attrs)
The attributes are specified as a hash. This hash must contain either %x:hue`, %x:saturation`, and %x:value` keys, or %x:red`, %x:green`, and %x:blue` keys. It cannot contain both HSL and RGB keys. It may also optionally contain an %x:alpha` key. @param attrs [{Symbol => Numeric}] A hash of color attributes to values @raise [ArgumentError] if not enough attributes are specified, or both RGB and HSL attributes are specified
@overload initialize(rgba)
The attributes are specified as an array. This overload only supports RGB or RGBA colors. @param rgba [Array<Numeric>] A three- or four-element array of the red, green, blue, and optionally alpha values (respectively) of the color @raise [ArgumentError] if not enough attributes are specified
# File lib/sass/script/value/color.rb, line 218 def initialize(attrs, allow_both_rgb_and_hsl = false) super(nil) if attrs.is_a?(Array) unless (3..4).include?(attrs.size) raise ArgumentError.new("Color.new(array) expects a three- or four-element array") end red, green, blue = attrs[0...3].map {|c| c.to_i} @attrs = {:red => red, :green => green, :blue => blue} @attrs[:alpha] = attrs[3] ? attrs[3].to_f : 1 else attrs = attrs.reject {|k, v| v.nil?} hsl = [:hue, :saturation, :lightness] & attrs.keys rgb = [:red, :green, :blue] & attrs.keys if !allow_both_rgb_and_hsl && !hsl.empty? && !rgb.empty? raise ArgumentError.new("Color.new(hash) may not have both HSL and RGB keys specified") elsif hsl.empty? && rgb.empty? raise ArgumentError.new("Color.new(hash) must have either HSL or RGB keys specified") elsif !hsl.empty? && hsl.size != 3 raise ArgumentError.new("Color.new(hash) must have all three HSL values specified") elsif !rgb.empty? && rgb.size != 3 raise ArgumentError.new("Color.new(hash) must have all three RGB values specified") end @attrs = attrs @attrs[:hue] = 360 if @attrs[:hue] @attrs[:alpha] ||= 1 end [:red, :green, :blue].each do |k| next if @attrs[k].nil? @attrs[k] = @attrs[k].to_i Sass::Util.check_range("#{k.to_s.capitalize} value", 0..255, @attrs[k]) end [:saturation, :lightness].each do |k| next if @attrs[k].nil? value = Number.new(@attrs[k], ['%']) # Get correct unit for error messages @attrs[k] = Sass::Util.check_range("#{k.to_s.capitalize}", 0..100, value, '%') end @attrs[:alpha] = Sass::Util.check_range("Alpha channel", 0..1, @attrs[:alpha]) end
Public Instance Methods
The alpha channel (opacity) of the color. This is 1 unless otherwise defined.
@return [Fixnum]
# File lib/sass/script/value/color.rb, line 333 def alpha @attrs[:alpha].to_f end
Returns whether this color object is translucent; that is, whether the alpha channel is non-1.
@return [Boolean]
# File lib/sass/script/value/color.rb, line 341 def alpha? alpha < 1 end
The blue component of the color.
@return [Fixnum]
# File lib/sass/script/value/color.rb, line 300 def blue hsl_to_rgb! @attrs[:blue] end
The SassScript `/` operation. Its functionality depends on the type of its argument:
{Number} : Divides each of the RGB color channels by the number.
{Color} : Divides each of this color’s RGB color channels by the other color’s.
{Value} : See {Value::Base#div}.
@param other [Value] The right-hand side of the operator @return [Color] The resulting color @raise [Sass::SyntaxError] if `other` is a number with units
# File lib/sass/script/value/color.rb, line 515 def div(other) if other.is_a?(Sass::Script::Value::Number) || other.is_a?(Sass::Script::Value::Color) piecewise(other, :/) else super end end
The SassScript `==` operation. **Note that this returns a {Sass::Script::Value::Bool} object, not a Ruby boolean**.
@param other [Value] The right-hand side of the operator @return [Bool] True if this value is the same as the other,
false otherwise
# File lib/sass/script/value/color.rb, line 384 def eq(other) Sass::Script::Value::Bool.new( other.is_a?(Color) && rgb == other.rgb && alpha == other.alpha) end
The green component of the color.
@return [Fixnum]
# File lib/sass/script/value/color.rb, line 292 def green hsl_to_rgb! @attrs[:green] end
# File lib/sass/script/value/color.rb, line 389 def hash [rgb, alpha].hash end
Returns the hue, saturation, and lightness components of the color.
@return [Array<Fixnum>] A frozen three-element array of the
hue, saturation, and lightness values (respectively) of the color
# File lib/sass/script/value/color.rb, line 365 def hsl [hue, saturation, lightness].freeze end
Returns the hue, saturation, lightness, and alpha components of the color.
@return [Array<Fixnum>] A frozen four-element array of the hue,
saturation, lightness, and alpha values (respectively) of the color
# File lib/sass/script/value/color.rb, line 373 def hsla [hue, saturation, lightness].freeze end
The hue component of the color.
@return [Numeric]
# File lib/sass/script/value/color.rb, line 308 def hue rgb_to_hsl! @attrs[:hue] end
Returns a string representation of the color.
@return [String] The hex value
# File lib/sass/script/value/color.rb, line 560 def inspect alpha? ? rgba_str : hex_str end
The lightness component of the color.
@return [Numeric]
# File lib/sass/script/value/color.rb, line 324 def lightness rgb_to_hsl! @attrs[:lightness] end
The SassScript `-` operation. Its functionality depends on the type of its argument:
{Number} : Subtracts the number from each of the RGB color channels.
{Color} : Subtracts each of the other color’s RGB color channels from this color’s.
{Value} : See {Value::Base#minus}.
@param other [Value] The right-hand side of the operator @return [Color] The resulting color @raise [Sass::SyntaxError] if `other` is a number with units
# File lib/sass/script/value/color.rb, line 472 def minus(other) if other.is_a?(Sass::Script::Value::Number) || other.is_a?(Sass::Script::Value::Color) piecewise(other, :-) else super end end
The SassScript `%` operation. Its functionality depends on the type of its argument:
{Number} : Takes each of the RGB color channels module the number.
{Color} : Takes each of this color’s RGB color channels modulo the other color’s.
@param other [Number, Color] The right-hand side of the operator @return [Color] The resulting color @raise [Sass::SyntaxError] if `other` is a number with units
# File lib/sass/script/value/color.rb, line 536 def mod(other) if other.is_a?(Sass::Script::Value::Number) || other.is_a?(Sass::Script::Value::Color) piecewise(other, :%) else raise NoMethodError.new(nil, :mod) end end
The SassScript `+` operation. Its functionality depends on the type of its argument:
{Number} : Adds the number to each of the RGB color channels.
{Color} : Adds each of the RGB color channels together.
{Value} : See {Value::Base#plus}.
@param other [Value] The right-hand side of the operator @return [Color] The resulting color @raise [Sass::SyntaxError] if `other` is a number with units
# File lib/sass/script/value/color.rb, line 449 def plus(other) if other.is_a?(Sass::Script::Value::Number) || other.is_a?(Sass::Script::Value::Color) piecewise(other, :+) else super end end
The red component of the color.
@return [Fixnum]
# File lib/sass/script/value/color.rb, line 284 def red hsl_to_rgb! @attrs[:red] end
Returns the red, green, and blue components of the color.
@return [Array<Fixnum>] A frozen three-element array of the red, green, and blue
values (respectively) of the color
# File lib/sass/script/value/color.rb, line 349 def rgb [red, green, blue].freeze end
Returns the red, green, blue, and alpha components of the color.
@return [Array<Fixnum>] A frozen four-element array of the red, green,
blue, and alpha values (respectively) of the color
# File lib/sass/script/value/color.rb, line 357 def rgba [red, green, blue, alpha].freeze end
The saturation component of the color.
@return [Numeric]
# File lib/sass/script/value/color.rb, line 316 def saturation rgb_to_hsl! @attrs[:saturation] end
The SassScript `*` operation. Its functionality depends on the type of its argument:
{Number} : Multiplies the number by each of the RGB color channels.
{Color} : Multiplies each of the RGB color channels together.
@param other [Number, Color] The right-hand side of the operator @return [Color] The resulting color @raise [Sass::SyntaxError] if `other` is a number with units
# File lib/sass/script/value/color.rb, line 492 def times(other) if other.is_a?(Sass::Script::Value::Number) || other.is_a?(Sass::Script::Value::Color) piecewise(other, :*) else raise NoMethodError.new(nil, :times) end end
Returns a string representation of the color. This is usually the color’s hex value, but if the color has a name that’s used instead.
@return [String] The string representation
# File lib/sass/script/value/color.rb, line 550 def to_s(opts = {}) return smallest if options[:style] == :compressed return COLOR_NAMES_REVERSE[rgba] if COLOR_NAMES_REVERSE[rgba] alpha? ? rgba_str : hex_str end
Returns a copy of this color with one or more channels changed. RGB or HSL colors may be changed, but not both at once.
For example:
Color.new([10, 20, 30]).with(:blue => 40) #=> rgb(10, 40, 30) Color.new([126, 126, 126]).with(:red => 0, :green => 255) #=> rgb(0, 255, 126) Color.new([255, 0, 127]).with(:saturation => 60) #=> rgb(204, 51, 127) Color.new([1, 2, 3]).with(:alpha => 0.4) #=> rgba(1, 2, 3, 0.4)
@param attrs [{Symbol => Numeric}]
A map of channel names (`:red`, `:green`, `:blue`, `:hue`, `:saturation`, `:lightness`, or `:alpha`) to values
@return [Color] The new Color object @raise [ArgumentError] if both RGB and HSL keys are specified
# File lib/sass/script/value/color.rb, line 412 def with(attrs) attrs = attrs.reject {|k, v| v.nil?} hsl = !([:hue, :saturation, :lightness] & attrs.keys).empty? rgb = !([:red, :green, :blue] & attrs.keys).empty? if hsl && rgb raise ArgumentError.new("Cannot specify HSL and RGB values for a color at the same time") end if hsl [:hue, :saturation, :lightness].each {|k| attrs[k] ||= send(k)} elsif rgb [:red, :green, :blue].each {|k| attrs[k] ||= send(k)} else # If we're just changing the alpha channel, # keep all the HSL/RGB stuff we've calculated attrs = @attrs.merge(attrs) end attrs[:alpha] ||= alpha Color.new(attrs, :allow_both_rgb_and_hsl) end
Private Instance Methods
# File lib/sass/script/value/color.rb, line 578 def hex_str red, green, blue = rgb.map {|num| num.to_s(16).rjust(2, '0')} "##{red}#{green}#{blue}" end
# File lib/sass/script/value/color.rb, line 603 def hsl_to_rgb! return if @attrs[:red] && @attrs[:blue] && @attrs[:green] h = @attrs[:hue] / 360.0 s = @attrs[:saturation] / 100.0 l = @attrs[:lightness] / 100.0 # Algorithm from the CSS3 spec: http://www.w3.org/TR/css3-color/#hsl-color. m2 = l <= 0.5 ? l * (s + 1) : l + s - l * s m1 = l * 2 - m2 @attrs[:red], @attrs[:green], @attrs[:blue] = [ hue_to_rgb(m1, m2, h + 1.0 / 3), hue_to_rgb(m1, m2, h), hue_to_rgb(m1, m2, h - 1.0 / 3) ].map {|c| (c * 0xff).round} end
# File lib/sass/script/value/color.rb, line 620 def hue_to_rgb(m1, m2, h) h += 1 if h < 0 h -= 1 if h > 1 return m1 + (m2 - m1) * h * 6 if h * 6 < 1 return m2 if h * 2 < 1 return m1 + (m2 - m1) * (2.0 / 3 - h) * 6 if h * 3 < 2 m1 end
# File lib/sass/script/value/color.rb, line 583 def piecewise(other, operation) other_num = other.is_a? Number if other_num && !other.unitless? raise Sass::SyntaxError.new( "Cannot add a number with units (#{other}) to a color (#{self}).") end result = [] (0...3).each do |i| res = rgb[i].send(operation, other_num ? other.value : other.rgb[i]) result[i] = [[res, 255].min, 0].max end if !other_num && other.alpha != alpha raise Sass::SyntaxError.new("Alpha channels must be equal: #{self} #{operation} #{other}") end with(:red => result[0], :green => result[1], :blue => result[2]) end
# File lib/sass/script/value/color.rb, line 629 def rgb_to_hsl! return if @attrs[:hue] && @attrs[:saturation] && @attrs[:lightness] r, g, b = [:red, :green, :blue].map {|k| @attrs[k] / 255.0} # Algorithm from http://en.wikipedia.org/wiki/HSL_and_HSV#Conversion_from_RGB_to_HSL_or_HSV max = [r, g, b].max min = [r, g, b].min d = max - min h = case max when min; 0 when r; 60 * (g - b) / d when g; 60 * (b - r) / d + 120 when b; 60 * (r - g) / d + 240 end l = (max + min) / 2.0 s = if max == min 0 elsif l < 0.5 d / (2 * l) else d / (2 - 2 * l) end @attrs[:hue] = h % 360 @attrs[:saturation] = s * 100 @attrs[:lightness] = l * 100 end
# File lib/sass/script/value/color.rb, line 573 def rgba_str split = options[:style] == :compressed ? ',' : ', ' "rgba(#{rgb.join(split)}#{split}#{Number.round(alpha)})" end
# File lib/sass/script/value/color.rb, line 566 def smallest small_explicit_str = alpha? ? rgba_str : hex_str.gsub(/^#(.)\1(.)\2(.)\3$/, '#\1\2\3') return small_explicit_str unless (color = COLOR_NAMES_REVERSE[rgba]) && color.size <= small_explicit_str.size color end


Chopping videos of Legon lecturers caught in Sex for Grades scandal allegedly leaks
by Nana YawA social media user by username My Leakz is set to cause an uproar in Ghana if the post made by him/her is anything to go by.
According to MyLeakz, he/she has a leak video of the two lectures of the University of Ghana who were captured in the famous BBC sex for grades exposé.
Dr Butakor and Prof. Gyampo who were fingered in the popular BBC exposé have been cleared by the University but if MyLeakz post is anything to go by, then it will indeed confirm the earlier rumours and accusations levelled against them.
The social media user shared two separate screenshots of people doing the thing with the caption;
Hello Ghana, I have a surprise for you all. Before the surprise can someone please check if Dr. Bu and Prof. Gya are doing well, I don’t want any heat attack. I have a nice video here titled BuGya featuring two most popular Leg lecturers dropping soon…”


|
Under
The Bridge
(Red Hot Chili Peppers) |
|
Sometimes
I feel
Like I don't have a partner Sometimes I feel Like my only friend Is the city I live in The city of Angels Lonely as I am Together we cry I drive on her streets 'Cause she's my companion I walk through her hills 'Cause she knows who I am She sees my good detail And she kisses me windy I never worry Now that is a lie I don't ever want to feel Like I did that day Take me to the place I love Take me all the way I don't ever want to feel Like I did that day Take me to the place I love Take me all the way (yeah yeah) It's hard to believe That there's nobody out there It's hard to believe That I'm all alone At least I have her love The city she loves me Lonely as I am Together we cry I don't ever want to feel Like I did that day Take me to the place I love Take me all the way I don't ever want to feel Like I did that day Take me to the place I love Take me all the way (yeah yeah) Ooh no (no no yeah yeah) Love me I say yeah yeah Under the bridge downtown Is were I drew some blood Under the bridge downtown I could not get enough Under the bridge downtown Forgot about my love Under the bridge downtown I gave my life away (yeah yeah) Ooh no (no no yeah yeah) Love me I say yeah yeah |


qvalue [options] <p-values file>
Takes as input a list of p-values and prints a corresponding list of q-values, computed using the method of Benjamini and Hochberg (Journal of the Royal Statistical Society B, 57:289-300, 1995).
The name of a tab separated file containing a column of p-values. Other columns may exist. If the name is - then the input data is read from standard input.
Outputs tab-delimited columns. If the --append option is given, then the line from the input is listed first, followed by the p-value (only when --null is specified) and q-value. Otherwise it outputs the raw score (only when --null is specified). followed by the p-value and q-value. The lines are sorted by p-value.
| Option | Parameter | Description | Default Behavior |
|---|---|---|---|
| General Options | |||
| --null | file | Treat the primary input file as raw scores, and begin by estimating p-values from the empirical null scores given in this file. The --header and --column arguments apply to this file as well as the primary input file. | The primary input is assumed to actually contain p-values. |
| --good-score | high|low | Choose low if smaller scores are better or high if larger scores are better. | Smaller scores are considered better. |
| --pi-zero | Estimate the fraction (pi-zero) of the empirical distribution that is
drawn according to the null hypothesis. This uses the
method described in:
John Storey, "A direct approach to false discovery rates",
Journal of the Royal Statistical Society B, 64:3, 479-498,
2002.
|
The estimation step is skipped and the program conservatively sets pi-zero to 100%. | |
| --pi-zero-file | file name | Specify a file to store the pi-zero estimate in. This option implies the --pi-zero option. | The results of the pi-zero estimate (if calculated) are not stored in a file. |
| --fdr | Only compute false discovery rate (FDR) estimates. | The FDR values are converted into q-values. | |
| --bootstraps | num | Number of bootstraps to perform when estimating pi-zero. | The program performs 1000 bootstraps. |
| --header | line count | Treat the first line count lines of the p-values file as the header. If the --append option is specified these lines will also be included in the output. | No lines are treated as headers. |
| --column | column number | Read the p-value from the specified column number. The first column is 1, the second column is 2 and so on... | The p-value is read from the first column. |
| --append | Print all the columns in the input file to standard output with additional p-value (raw scores only) and q-value columns. | Print the raw score (only when raw scores are supplied), p-value and q-value in tab separated columns. | |
| --seed | seed | Set the seed value for the pseudo-random number generator. | The seed value is set from the system clock. |


Class AuditItem
An audit item
Inheritance
Inherited Members
Namespace: AzureFromTheTrenches.Commanding.Abstractions.Model
Assembly: AzureFromTheTrenches.Commanding.Abstractions.dll
Syntax
public class AuditItem
Fields
| Improve this Doc View SourceExecutionType
The type used to identify post execution audit items
Declaration
public const string ExecutionType = "execution"
Field Value
| Type | Description |
|---|---|
| System.String |
PostDispatchType
The code used to identify post dispatch audit items
Declaration
public const string PostDispatchType = "postdispatch"
Field Value
| Type | Description |
|---|---|
| System.String |
PreDispatchType
The code used to identify pre dispatch audit items
Declaration
public const string PreDispatchType = "predispatch"
Field Value
| Type | Description |
|---|---|
| System.String |
Properties
| Improve this Doc View SourceAdditionalProperties
Any additional properties set by enrichers
Declaration
public Dictionary<string, string> AdditionalProperties { get; set; }
Property Value
| Type | Description |
|---|---|
| System.Collections.Generic.Dictionary<System.String, System.String> |
CommandId
The ID of the command
Declaration
public string CommandId { get; set; }
Property Value
| Type | Description |
|---|---|
| System.String |
CommandType
The short type name of the command
Declaration
public string CommandType { get; set; }
Property Value
| Type | Description |
|---|---|
| System.String |
CommandTypeFullName
The full type name of the command
Declaration
public string CommandTypeFullName { get; set; }
Property Value
| Type | Description |
|---|---|
| System.String |
CorrelationId
Correlation ID from the command dispatch context
Declaration
public string CorrelationId { get; set; }
Property Value
| Type | Description |
|---|---|
| System.String |
Depth
The depth of the command from the dispatch context
Declaration
public int Depth { get; set; }
Property Value
| Type | Description |
|---|---|
| System.Int32 |
DispatchedUtc
The date and time the command was dispatched
Declaration
public DateTime DispatchedUtc { get; set; }
Property Value
| Type | Description |
|---|---|
| System.DateTime |
DispatchTimeMs
The time taken to dispatch the command (will be null in execution audit items or if metrics are disabled)
Declaration
public long? DispatchTimeMs { get; set; }
Property Value
| Type | Description |
|---|---|
| System.Nullable<System.Int64> |
ExecutedSuccessfully
Was the command executed successfully - will be null in the dispatch stages
Declaration
public bool? ExecutedSuccessfully { get; set; }
Property Value
| Type | Description |
|---|---|
| System.Nullable<System.Boolean> |
ExecutionTimeMs
The time taken to execute the command (will be null in dispatch audit items or if metrics are disabled)
Declaration
public long? ExecutionTimeMs { get; set; }
Property Value
| Type | Description |
|---|---|
| System.Nullable<System.Int64> |
SerializedCommand
A serialized version of the command
Declaration
public string SerializedCommand { get; set; }
Property Value
| Type | Description |
|---|---|
| System.String |
Type
The type of the audit item (pre-dispatch, post-dispatch, execution)
Declaration
public string Type { get; set; }
Property Value
| Type | Description |
|---|---|
| System.String |


MICKEY BLUE EYES ***1/2 (out of five stars) A review by Jamey Hughton
Starring-Hugh Grant, James Caan, Jeanne Tripplehorn, Burt Young, Joe Viterelli and James Fox Director-Kelly Makin Rated PG
MOVIE VIEWS by Jamey Hughton http://Welcome.to/MovieViews
With the huge early summer hit Notting Hill under their belts, both Hugh Grant and Julia Roberts are trying to duplicate that success with another round of romance this season. Roberts teamed up again with Richard Gere for the altar comedy Runaway Bride, and now Grant is trying his hand at the Mafia spoof Mickey Blue Eyes. Despite coming so soon after Analyze This, the Englishman uses his naive charm and manages to fuel this predictable but cute comedy simply by using his puppy dog eyes.
You know the look. Grant has used it to his advantage ever since Four Weddings and a Funeral. It's this `I'm in over my head / I can't believe I'm doing this' expression that coats Mickey Blue Eyes with an appealing, totally charming glaze. I don't know, someday maybe it will get old. But for now, his innocent looks and actions perfectly suit comedy vehicles such as this.
Grant plays Michael Felgate, an art auctioneer who's about to get in over his head. Michael is hopelessly in love with a pretty school-teacher named Gina Vitale (Jeanne Tripplehorn), and after some complications involving a botched fortune cookie message, he asks for her hand in marriage. Gina backs out immediately to Michael's confusion, and afterward when he confronts her, she explains: `I can't marry you because of my father'. As it turns out, Frank Vitale (James Caan) is an influential figure in the mob. Gina wants to avoid any involvement Michael could have with the rest of the `family'.
While I won't deny that Mickey Blue Eyes is consistently amusing, it doesn't have the great comedic tag team of Robert DeNiro and Billy Crystal that gave Analyze This it's extra juice. However, casting remains a bright spot. Grant, although displaying marginal range, is delightful in the vital role of Michael. When he's forced to create an alter ego his mob ties, the character of Mickey Blue Eyes is concocted. Seeing Grant attempt to speak Mafia jargon (`No R's,' advises Frank. `And replace the T's with D's') is truly hilarious. James Caan makes for a worthy adversary, and although he is not the perfect choice for the role, his veteran craftsmanship (gained from The Godfather) helps a great deal. The only tiny loose end is Tripplehorn, who plays her role too aggressively to be likable. Although admittedly attractive, Tripplehorn lacks the vibrance and charisma needed to fill the shoes of Gina.
The supporting cast is full of familiar faces that generally populate mob movies. Burt Young is dignified and effective as Uncle Vito, the head of the family, but there is never any humor explored in his character. Joe Viterelli (hilarious as the bodyguard in Analyze This) has a similar role as Vinnie. But again, his character is played far too straight - particularly when considering what a successful stretch he had in the previous film. The remainder of the cast is made up of a troupe of gangster types you would expect.
Director Kelly Makin (Kids in the Hall) often takes the easy route for the humor, but the accomplished stars only make it funnier. There are lots of double-crosses and plot twists towards the end - mainly involving the FBI at a final wedding ceremony - but most are entirely predictable. Still, this is pretty funny stuff. The script is fast and efficient enough to make us forget certain character problems, and the gags are often expertly polished. It's not like we haven't seen this material before, but the charm and overall appeal of the actors is difficult to resist.
How does this stack up with Analyze This? Well, basically the same, except for one small detail: Mickey Blue Eyes is probably better equipped with more crowd-pleasing moments. And Grant and Caan nicely compensate for the loss of DeNiro and Crystal - mostly a fair comparison, if you ask me.
(C) 1999, Jamey Hughton
* * * * * * * * * * * * * * * * * * * * * MOVIE VIEWS by Jamey Hughton http://Welcome.to/MovieViews Up-to-date Movie Reviews Written by a Published Teen Columnist <<<<<<<<<<<<<<>>>>>>>>>>>>>>
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


{% extends "base.html" %} {% block content %}
The link you requested is here...
Shortened to ➠
Originally {{ link.url }}


| 0 |
../DCAL/DCAL_Cloud_Statistics.ipynb |
Working |
|
| 1 |
../DCAL/DCAL_Custom_Mosaics.ipynb |
Working |
|
| 2 |
../DCAL/DCAL_Custom_Mosaics_Dask.ipynb |
Working |
|
| 3 |
../DCAL/DCAL_Land_Change.ipynb |
Working |
|
| 4 |
../DCAL/DCAL_Spectral_Products.ipynb |
Working |
|
| 5 |
../DCAL/DCAL_Vegetation_Phenology.ipynb |
Working |
|
| 6 |
../DCAL/DCAL_Water_Extents.ipynb |
Working |
|
| 7 |
../DCAL/DCAL_Water_WOFS.ipynb |
Working |
|


Use this rule to control the indentation.
2
or 4
,
representing the number of spaces in an indentation level) or to consistent
to allow any number,
as long as it remains the same within the file.-
as part of the indentation). Possible values: true
,
false
, whatever
and consistent
. consistent
requires either all block sequences to be indented, or none to be. whatever
means
either indenting or not indenting individual block sequences is OK.true
to enable, false
to disable.Examples
With spaces = 1
the following code snippet would PASS:
history: - name: Unix date: 1969 - name: Linux date: 1991 nest: recurse: - haystack: needle
With spaces = 4
the following code snippet would PASS:
history: - name: Unix date: 1969 - name: Linux date: 1991 nest: recurse: - haystack: needle
the following code snippet would FAIL:
history: - name: Unix date: 1969 - name: Linux date: 1991 nest: recurse: - haystack: needle
With spaces = consistent
the following code snippet would PASS:
history: - name: Unix date: 1969 - name: Linux date: 1991 nest: recurse: - haystack: needle
the following code snippet would FAIL:
some: Russian: dolls
With spaces = 2
and indent-sequences = false
the following code snippet would PASS:
list: - flying - spaghetti - monster
the following code snippet would FAIL:
list: - flying - spaghetti - monster
With spaces = 2
and indent-sequences = whatever
the following code snippet would PASS:
list: - flying: - spaghetti - monster - not flying: - spaghetti - sauce
With spaces = 2
and indent-sequences = consistent
the following code snippet would PASS:
- flying: - spaghetti - monster - not flying: - spaghetti - sauce
the following code snippet would FAIL:
- flying: - spaghetti - monster - not flying: - spaghetti - sauce
With spaces = 4
and check-multi-line-strings = true
the following code snippet would PASS:
Blaise Pascal: Je vous écris une longue lettre parce que je n'ai pas le temps d'en écrire une courte.
the following code snippet would PASS:
Blaise Pascal: Je vous écris une longue lettre parce que je n'ai pas le temps d'en écrire une courte.
the following code snippet would FAIL:
Blaise Pascal: Je vous écris une longue lettre parce que je n'ai pas le temps d'en écrire une courte.
the following code snippet would FAIL:
C code: void main() { printf("foo"); }
the following code snippet would PASS:
C code: void main() { printf("bar"); }


{% extends 'base.html' %} {% load crispy_forms_tags %} {% block content %} Are you sure you want to delete this experiences


Source code for pygritia.core
"""
Core functionality for lazy expressions
"""
from typing import Any, Mapping, Optional, Sequence, Type, TypeVar, Union, cast
from .util import setattr_
LazyNamespace = Mapping[Union[str, 'LazyMixin'], Any]
LazyNS = LazyNamespace
[docs]class LazyAction:
"""
Lazy Expression Handler
Every derived LazyAction classes must implements :py:meth:`evaluate` method.
It is called by :py:func:`evaluate` function with given namespace
"""
__slots__: Sequence[str] = ('owner',)
owner: 'LazyMixin'
"""Owner lazy expression of this action"""
def __repr__(self) -> str:
return f"<{self.__class__.__name__}: {str(self)}>"
[docs] def evaluate(self, namespace: LazyNamespace) -> Any:
"""Evaluate expression
To substitute actual value for specific symbol, give value with keyword argument.
"""
raise NotImplementedError
[docs] def update(self, val: Any, namespace: LazyNamespace) -> None: # pylint: disable=no-self-use
"""Update value of expression
If the expression is readonly, it raises AttributeError
"""
raise AttributeError("expr cannot be updated")
[docs]class LazyMixin(metaclass=LazyMeta):
"""
Base class of all lazy expression and mixin classes
It provides *Protocol* for lazy expression
All derived classes of this class have ``__hash__`` automatically, because namespace for
evaluate is defined as lazy expression (normally symbol only) to value mapping. Key of
mapping must be hashable.
"""
__slots__: Sequence[str] = ('__action__', '__weakref__')
__action__: LazyAction
def __init_subclass__(cls) -> None:
if '__hash__' not in cls.__dict__:
def __hash__(self: LazyMixin) -> int:
return hash(self.__action__)
setattr(cls, '__hash__', __hash__)
def __init__(self, action: LazyAction, origin: Optional['LazyMixin'] = None) -> None:
del origin
setattr_(self, '__action__', action)
action.owner = self
def __str__(self) -> str:
return str(self.__action__)
def __repr__(self) -> str:
return f"<{self.__class__.__name__}: {str(self)}>"
Lazy = TypeVar('Lazy', bound=LazyMixin)
LazyType = Type[LazyMixin]
_T = TypeVar('_T')
[docs]def evaluate(expr: _T, namespace: LazyNamespace) -> _T:
"""
Evaluate lazy expression
Evaluate expression with symbol substitution according to given ``namespace``
:param expr: Lazy expression or evaluated value
If given value is not a lazy expression, this function returns it immediately
:param namespace: Symbol table which will be used in substitution
The key of table can be both of string and symbol expression
:return: Evaluated value
"""
if isinstance(expr, LazyMixin):
return cast(_T, expr.__action__.evaluate(namespace))
return expr
[docs]def update(expr: _T, val: _T, namespace: LazyNamespace) -> None:
"""
Update the value of lazy expression
Set the value of lazy expression to the given ``val``
Only *assignable expression* can be updated.
ex) ``this[3]``, ``this.spam``
:param expr: Assignable lazy expression
:param val: New value
:param namespace: Symbol table which will be used in substitution
The key of table can be both of string and symbol expression
"""
if not isinstance(expr, LazyMixin):
raise TypeError("Expr must be a lazy expression")
val = evaluate(val, namespace)
if isinstance(val, LazyMixin):
raise TypeError("Val is not fully evaluated")
expr.__action__.update(val, namespace)
[docs]def repr_(expr: Any) -> str:
"""
``repr()`` for lazy expression
Native ``repr`` returns string like ``'<Lazy: this>'``. If you want to get the repr string
like other objects, use this instead of native one. It returns expression only for lazy
expression and ``repr()`` for other object.
:param expr: object for repr
:return: repr string of given object
"""
if isinstance(expr, LazyMixin):
return str(expr)
return repr(expr)


Comments
-
Greg Hurrell
It may be a corrupt preferences file or some other such cause. See http://wincent.com/s/bugs/ for some troubleshooting tips along those lines.
I would also recommend trying with a release from the 3.2 stable series instead and see if you can reproduce the problem there. (For me it works with both 3.2 stable and 3.5 alpha series.)
-
winglet
I have the same issue. Synergy just shows a question mark symbol instead of cover art. My iTunes files have cover art embedded.
Synergy 3.2, OS 10.5.6, MB Pro Intel, iTunes 8.1.1
-
Greg Hurrell
Can you try updating to the latest version in the stable series? (3.2.2)
Did you also try the trouble-shooting hints mentioned above?
-
anonymous
Is 3.2.2 still available anywhere? I can't seem to find it. I've (long since, but only now investigating) lost cover art downloads, as well as the handoff of art from iTunes to Synergy. I've just tried 3.5.5, after being on 3.4 for a very long time. Little Snitch reports that Synergy is trying to contact Amazon, but nothing ends up in the Album Covers folder. Seems like I should try 3.2.
Currently on OS X 10.5.8 and iTunes 8.2.1. I've deleted all prefs and reinstalled,
-
Greg Hurrell
Yes, it's still on the server:
But I don't see why 3.2.2 would work and the other versions wouldn't. If Synergy isn't even picking up art from iTunes I would do some troubleshooting (see here for some tips on that).
-
rotorglow
(Sorry, I posted anonymously before.)
Yeah, I've tried those troubleshooting tips, and have had no luck, even on separate machines. Might have an opportunity to try with a completely clean OS install soon, though. And thanks for the link to 3.2.2 I might try it just to see what happens.
I did look in the console to see what might be logged. All I get are messages like this (regarding the handoff of art from iTunes), every time it fails: 9/9/09 11:38:38 Synergy[298] Warning: Exception caught while attempting to process cover art data from iTunes
Is there any way to see what (if anything) Synergy is getting back from Amazon?
-
Greg Hurrell
Ok, that's excellent info. That message very clearly indicates that it is choking on something that it is getting handed by iTunes. Have you noticed any pattern about which tracks it happens with? Does it happen with all? Some?
-
rotorglow
Only with some files, all of which have art that displays fine in iTunes (so it's not like there're glitches in the art; or maybe there are, but iTunes itself doesn't mind them). AAC (not from iTunes Music Store) and MP3 files alike.
Unfortunately, I upgraded to iTunes 9 on this machine without thinking. And that exception is no longer ocurring, even with the same files that were causing the problem before. (Using Synergy 3.5.5a or 3.4.1) My other machine still has iTunes 8.2.1, but is running Snow Leopard. I move the same songs over to that to see if I can replicate the problem, but I don't know how valid that will be with Snow Leopard in the mix.
Here're some other problems showed up in the console, not immediately after each other:
9/9/09 16:29:20 Synergy[298] Error while cleaning out Synergy "Temporary Album Covers" folder 9/9/09 16:47:45 [0x0-0x99099].org.wincent.Synergy[2029] Synergy: unknown type name "tdta".
-
Greg Hurrell
Not sure what might be causing that error but I will check to see if I can reproduce it.
-
Greg Hurrell
Ok, not sure if it's related to the problem you're having but I have added some instrumentation and through using it I've found one problem that I'll hopefully be able to fix.
-
Greg Hurrell
Status changed:
- From: new
- To: open
-
Greg Hurrell
Version 4.1 is going to be out soon (within the next day or so) and it includes a complete rewrite of all the cover art stuff. I did find a couple of bugs and fix them, and have done a lot of testing and everything seems to be working perfectly. So I am going to mark this one as closed for now. If there turn out to be any problems in 4.1 we can open a new ticket for that.
-
Greg Hurrell
Status changed:
- From: open
- To: closed
Add a comment
Comments are now closed for this issue.


PINEAPPLE BLOG!
This is a blog about pineapples.
Check out this great image of some funky pineapples:


GeoMesa Lambda Quick Start¶
This tutorial can get you started with the GeoMesa Lambda data store. Note that the Lambda data store is for advanced use-cases - see Overview of the Lambda Data Store for details on when to use a Lambda store.
In the spirit of keeping things simple, the code in this tutorial only does a few small things:
- Establishes a new (static) SimpleFeatureType
- Prepares the Accumulo table and Kafka topic to store this type of data
- Creates a thousand example SimpleFeatures
- Repeatedly updates these SimpleFeatures in the Lambda store through Kafka
- Persists the final SimpleFeatures to Accumulo
The only dynamic element in the tutorial is the Accumulo and Kafka connection; it needs to be provided on the command-line when running the code.
Prerequisites¶
Before you begin, you must have the following:
- an instance of Accumulo 1.7 or 1.8 running on Hadoop 2.2 or better,
- an Accumulo user that has both create-table and write permissions,
- the GeoMesa Accumulo distributed runtime installed for your Accumulo instance (see Installing the Accumulo Distributed Runtime Library),
- an instance of Kafka <IP_ADDRESS>,
- optionally, a GeoServer instance with the Lambda data store installed (see Installing GeoMesa Lambda in GeoServer),
- a local copy of Java JDK 8,
- Apache Maven installed, and
- a GitHub client installed.
Download and Build the Tutorial¶
Pick a reasonable directory on your machine, and run:
$ git clone https://github.com/geomesa/geomesa-tutorials.git
$ cd geomesa-tutorials
Note
You may need to download a particular release of the tutorials project to target a particular GeoMesa release.
To build, run
$ mvn clean install -pl geomesa-quickstart-lambda
Note
Ensure that the version of Accumulo, Hadoop, Kafka etc in
the root pom.xml
match your environment.
Note
Depending on the version, you may also need to build GeoMesa locally. Instructions can be found here.
About this Tutorial¶
The QuickStart operates by inserting 1000 features, and then updating them every 200 milliseconds. After approximately 30 seconds, the updates stop and the features are persisted to Accumulo.
Run the Tutorial¶
On the command-line, run:
$ java -cp geomesa-quickstart-lambda/target/geomesa-quickstart-lambda-${geomesa.version}.jar \
com.example.geomesa.lambda.LambdaQuickStart \
--brokers <brokers> \
--instance <instance> \
--zookeepers <zookeepers> \
--user <user> \
--password <password> \
--catalog

where you provide the following arguments:
<brokers>
the host:port for your Kafka brokers<instance>
the name of your Accumulo instance<zookeepers>
your Zookeeper nodes, separated by commas<user>
the name of an Accumulo user that has permissions to create, read and write tables<password>
the password for the previously-mentioned Accumulo user

the name of the destination table that will accept these test records; this table should either not exist or should be empty
Warning
If you have set up the GeoMesa Accumulo distributed
runtime to be isolated within a namespace (see
Namespace Install) the value of

should include the namespace (e.g. myNamespace.geomesa
).
Once you run the quick start, it will prompt you to load the layer in geoserver. Using the same connection
parameters you used for the quick start, register a new data store according to Using the Lambda Data Store in GeoServer.
After saving the store, you should be able to publish the lambda-quick-start
layer. Open the layer preview for
the layer, then proceed with the quick start run.
As the quick start runs, you should be able to refresh the layer preview page and see the features moving across the map. After approximately 30 seconds, the updates will stop, and the features will be persisted to Accumulo.
Transient vs Persistent Features¶
The layer preview will merge the results of features from Kafka with features from Accumulo. You may disable
results from one of the source by using the viewparams
parameter:
...&viewparams=LAMBDA_QUERY_TRANSIENT:false
...&viewparams=LAMBDA_QUERY_PERSISTENT:false
While the quick start is running, all the features should be returned from the transient store (Kafka). After the quick
start finishes, all the feature should be returned from the persistent store (Accumulo). You can play with the
viewparams
to see the difference.
Looking at the Code¶
Looking at the source code, you can see that normal GeoTools FeatureWriters
are used; feature persistence
is managed transparently for you.
Re-Running the Quick Start¶
The quick start relies on not having any existing state when it runs. This can cause issues with Kafka, which
by default does not delete topics when requested. To re-run the quick start, first ensure that your Kafka
instance will delete topics by setting the configuration delete.topic.enable=true
in your server properties.
Then use the Lamdba command-line tools (see Setting up the Lambda Command Line Tools) to remove the quick start schema:
$ geomesa-lambda remove-schema -f lambda-quick-start ...


Kinpurnie
Moving Time
Elapsed Time
Distance
Elevation
Off
Jan
Feb
Mar
Apr
May
Jun
Jul
Aug
Sep
Oct
Nov
Dec
Sun
Mon
Tue
Wed
Thu
Fri
Sat
Text tooltip


_Save_the_Last_Dance_ (PG-13) ** (out of ****)
At quick glance, Julia Stiles' filmography is far from impressive. The teen comedies _10_Things_I_Hate_About_You_ and _Down_to_You_. Michael Almereyda's woefully misguided Y2K-set adaptation of _Hamlet_. Even the one step she has seemingly taken in the right direction, David Mamet's _State_and_Main_, is a decidedly subpar effort from its celebrated writer-director.
But if one actually saw all of these projects, one thing is abundantly clear: while the films as a whole do not deliver, Stiles always does. She gave _10_Things_ the sharp edge that the rest of the movie sorely lacked; she radiated warmth and intelligence that was otherwise absent in _Down_to_You_; and she more than kept up with the top-drawer ensemble casts in _Hamlet_ and _State_and_Main_. Stiles' latest starring vehicle, _Save_the_Last_Dance_, continues this pattern: she rises to the occasion in an enterprise that is beneath her game efforts.
After the death of her mother, Stiles' Sara Johnson moves to Chicago to live with her errant father (Terry Kinney), with whom she has relationship that's tense at best. Sara has slightly less difficulty finding comfort at her predominantly African-American high school, for she is quickly taken under the wing of Chenille (Kerry Washington), an outgoing single mother. While Sara and Chenille quickly become best friends, that soon pales in comparison to Sara's burgeoning relationship with Chenille's ambitious brother Derek (Sean Patrick Thomas), who helps reawaken her dream of becoming a dancer--a goal she abandoned after her mother's untimely passing.
Unlike most teen-targeted films, _Save_the_Last_Dance_ cannot be accused of not being about anything; in fact, it tries to be about too much. In addition to being the story of Sara finding her place and reclaiming her dream, it's also about the Sara/Derek romance, complete with all the outside stumbling blocks that come with an interracial union. It's also about Derek's criminal past, and whether or not he'll fall back on the wrong side of the law with best friend Malakai (Fredro Starr). And last but certainly not least, it's about a lily white girl learning to put some soul into her dance moves.
What works best in _Save_the_Last_Dance_ is the Sara/Derek pairing, and that's because Stiles and Thomas are so well-matched. Not only are they instantly likable and have a genuine, gentle rapport, they also have the chops to bring real pathos to overly familiar dramatic situations. But with the title _Save_the_Last_Dance_, acting ability is somewhat secondary to dancing ability, and Stiles and Thomas can definitely hold their own on a dance floor.
Ultimately, this talented twosome can only do so much with a script that continually lets them down at about every turn. With yet another impressive turn to her credit, Stiles has once again earned her stripes as someone to watch. But until someone puts her in a real movie, it'll be hard to maintain the desire to keep watching.
©2001 Michael Dequina
Michael Dequina<EMAIL_ADDRESS>|<EMAIL_ADDRESS>|<EMAIL_ADDRESS>Mr. Brown's Movie Site: http://www.mrbrownmovies.com CinemaReview Magazine: http://www.CinemaReview.com on ICQ: #25289934 | on AOL Instant Messenger: MrBrown23
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


Inspiration: BubbleFighter is inspired by a 2D casual competitive game, QQTang. When the game starts, all players are divided into two sides, and each person controls a character. Arrow keys control the movement, and the sugar bubble will be put by pressing the space. Sugar bubbles will explode syrup after 5 seconds. If the character touches the syrup, it will be trapped and suffocated to death after 5 seconds.At this time, if the companion walks by, he can be rescued, and if the opponent walks by, he will die immediately. One more line.
GAME NETWORK ARCHITECTURE
• We present a game network that utilizes the consensus protocol RAFT implementation.
• Additionally, we introduce learning algorithms for RAFT optimization.
• The game is currently built on a grid-based UI.
• We have also integrated RSA signatures and validators for encryption and security.
GAME DEMO
GAME LAYER
Game layer is the frontend, the UI. We tried 2 ways to build and integrate the UI, including using Simple and Fast Multimedia Library (SFML) and the Unity3D.
• UI by SFML
Firstly, we used SFML by C++ and built a simple UI shown as follows, which contained a grid-based map, 2 players (squares) and each of which could drop some bombs (circles). SFML is multi-media, multi-platform and multi-language. The five modules including system, window, graphics, audio and network ease the development of games and multimedia applications. Also, players on different platforms are able to interact with each other.
In order to integrate the UI with the raft layer, we used file I/O, the architecture of which is as the following diagram. A readFile.txt and a writeFile.txt are the bridge to connect the UI and the consensus client layer. When the player moves in the UI, the movement will be converted as a command like “move player_id position”, and be written into the writeFile.txt, so the consensus client layer is able to read the movement and execute it in the raft process. Identically, when some other players send a movement command by raft, the consensus client layer will write the movement command received into the readFile.txt, so the UI will read from it and update the status.
The reason why we decided to implement this way is because of the error of compilation integration. As we used the NuRaft framework, it has a complicated and complete compilation system. The UI we achieved relies on the SFML package, and it needs to make up a dependency in the compilation process. However, we were not able to find a way to integrate the two compilation processes together. Therefore, the file I/O became a good option.
However, there was a new problem coming out with the file I/O. When the game layer and the consensus client layer read and wrote the file at the same time, there would be some contents getting missed, so the performance of moving synchronization was not very good. Therefore, we tried to use Unity3D. On the one hand, it had the better UI looking. On the other hand, we could use TCP/IP protocol instead of using the file I/O.
• UI by Unity3D
ABOUT US


In this small article, I show you about pointers by performing the same task using pointers in 3 different way. I think for some one learning c++ this is a very good approach because you can see pointers from different angles and get a much better idea as to what they and how to use them.
the code uses 3 different approaches using pointers to create an array of strings. you can look at the it as a sparse matrix of characters or just an array of strings like
Aa01234
Bb012
Cc0123456
etc.
the 3 approaches are offset, indexes and increments
the codes uses the #define in order to be able to compile
easily the each aproach so by just commenting these 3 lines
you can see how each approach works.
for example now it is set to run using increments
1 2 3
|
//#define _use_offset_
//#define _use_array_
#define _use_increments_
| |
the data structure I use is the char**
this is a pointer to a pointer to a character
like -> (-> character)
I initialize it to
|
char** array_of_strings = new char*[26];
| |
so is basically an array of strings like
-> ->sssssssssssss
->sssssssssssss
->sssssssssssss
array_of_stringsis the main pointer -> which we move by either method
vertically (is better to think of it this way). at the moment
we dereference *array_of_strings we then have another pointer the one that
points to the actual string, the second -> above.
so array_of_strings++ moves to the next string (vertical) and
(*array_of_strings)++ points to the next character in the string horizontal.
the first approach using offsets, in this approach we don't modify
the pointers, instead we use some offset value to point to the data
like *(pointer+5) = something. because pointers hold address we can so this
so pointer+5 points to the address of the byte which is 5 bytes from pointer
in array terminology as you will see in the array approach this is equivalent to pointer[5]. In increments terminology this is equivalent to
++pointer;++pointer;++pointer;++pointer;++pointer, incrementing the pointer 5
times.
the second approach is the best and easiest, using array indexes
array[i][j].
the third approach is the increments. here we need to modify the pointer
because we move the pointer forward or backward using the ++ and -- operators.
so p[1], *(p+1) and *++p are 3 ways to do the same thing
point pointer to one byte after pointer.
in the increment method you will see i used 2 pointers
array_of_strings and new_string they are both pointers but they
behave differently. array_of_strings is a pointer to a pointer
it points to a pointer to a byte (character), while new_string
points to the actual data the string. when we do array_of_strings++
we move array_of_strings to point to the next string.
Aa01234
*array_of_strings++ -> Bb01234567
and when we do *++new_string we point to the next character in the string
Aa01234
^
|
*++new_pointer
notice i use the increment operator before *++p not *p++ because i wanted
to increment p first and then dereference. if i had done *p++ it would process
Aa012345 or which ever string twice
bellow is the code, it has comments and I think is not hard to follow
just comment two of the #define and leave the one you want to experiment with
uncommented, then set break points and see how it works.
to run the code just create a new windows console application if using
Microsoft visual studio. if using some other tool then just copy paste
the code in your Main function
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103
|
/************************************************************************/
/*
this example shows the equivalence in pointer math between
array p[i]
offset *(p+i)
increment p++ p++ ..... i number of times
example p[3] = *(p+3) = p++ p++ p++
*/
//#define _use_offset_
//#define _use_array_
#define _use_increments_
#ifdef _use_offset_
cout << "using offset\n";
#endif
#ifdef _use_array_
cout << "using array\n";
#endif
#ifdef _use_increments_
cout << "using increments\n";
#endif
int j;
/*
declare and initialize the sparse matrix of characters
or the array of string, whichever fits.
*/
char** array_of_strings = new char*[26];
for (int i = 0; i < 26 ; i++)
{
#ifdef _use_offset_
/*
using offsets
instead of changing the pointer, just use
and offset from it all the time. the i is the
vertical offset into the table of strings
while the j is the horizontal. j = x and y = i
in vector terminology.
*/
*(array_of_strings+i) = new char(toascii(65+i));
*(*(array_of_strings+i)+1) = char(toascii(97+i));
for (j = 2; j < rand() % 16 + 2; j++)
*(*(array_of_strings+i)+j) = char(toascii(48+j-2));
*(*(array_of_strings+i)+j) = '\0';
#endif
#ifdef _use_array_
/*
using arrays
the simplest and prefered way because is more
readable and cleaner. just use array indexes
[y][x] or [i][j]
*/
array_of_strings[i] = new char(toascii(65+i));
array_of_strings[i][1] = char(toascii(97+i));
for (j = 2; j < rand() % 16 + 2; j++)
array_of_strings[i][j] = char(toascii(48+j-2));
array_of_strings[i][j] = '\0';
#endif
#ifdef _use_increments_
/*
use increments
here we change the pointers instead of using offsets
like p+i we actuaqlly increment the pointers p++
two things we need a two pointers the vertical pointer
and the horizontal pointer which actually points to
each string. array_of_strings is the verticaal and
new_string is the horizontal and the one which
points to the string and we use to modify the strings.
before printing out the strings we need to reset
the vertical pointer array_of_strings back to the
to the beginning so we simply subtract 26 from it
because we incremented it 26 times.
*/
char* new_string = *array_of_strings++ = new char(toascii(65+i));
*++new_string = char(toascii(97+i));
for (j = 2; j < rand() % 16 + 2; j++)
*++new_string = char(toascii(48+j-2));
*++new_string = '\0';
#endif
}
#ifdef _use_increments_
array_of_strings = array_of_strings - 26;
#endif
for (int i = 0; i < 26 ; i++)
{
#ifdef _use_offset_
cout << *(array_of_strings+i) << endl;
#endif
#ifdef _use_array_
cout << array_of_strings[i] << endl;
#endif
#ifdef _use_increments_
cout << *array_of_strings++ << endl;
#endif
}
/************************************************************************/
| |


Hello! It is I! The great and powerful Thor, God of the Sky and Thunder! I would love to take a mortal like yourself for a night of drinking and parties! And let's face it, you cannot deny our electric connection!
Get to know your mans better! A relationship can't start if you don't connect! Click below to check them out on social social media~


The climate is similar to the Northern Mediterranean, with very hot summers, but colder winters. The prevailing winds of summer are north east, although there is a daily alternation of land and sea breezes.
Weather Broadcasts from Varna Radio broadcast at 10:30, 16:30, 20:30 local time on VHF 26.
Istanbul Broadcasts at 10:00, 16:00, 22:00 local time on VHF 67 sometimes in English and always in Turkish.
www.meteor.gov.tr (Turkish, English or German) provides a good 3 day forecast for the Black Seas Regions.
Navtex out of Romania, Bulgaria and Turkey also covers the region.
For links to free global weather information, forecast services and extreme weather information see the Noonsite Weather Page


| Dashboard link | /{{ details.link }} | |
| Measurements database | {{ config.database_name }} | |
| Username | {{ config.username }} | |
| Guest username |
|
|
| Collecting outlier data? | Yes, with outlier_detection_constant = {{ config.outlier_detection_constant }} | No |
| Custom endpoint colors |
|
|
| User specified timezone | {{ config.timezone }} |
| Currently deployed version | {{ details['config-version'] }} |
| First request in the currently deployed version | {{ details['first-request-version'] | dateLayout }} |
| Monitoring Dashboard version | {{ details['dashboard-version'] }} |
| First request since using the Monitoring Dashboard | {{ details['first-request'] | dateLayout }} |
| Total amount of monitored requests | {{ details['total-requests'] | number }} |


A fixed header table can be created by using the fixed-header-table
directive.
This allows the table header to remain fixed in place and visible while the table
content is scrolled.
To give a column a fixed width you should apply a class to both the th
and associated td
elements.
This class should set the width
property and also set flex: none
.
The attributes of this directive are:
'50%'
.
The following code can be used to create the example shown above:


Utility Methods
Subsections
- Exists - Does an object exist?
- Clear - Reset an object.
- Reinitialize Model - Reload the configuration information for a model.
- Query - Run a RAW SQL query.
- Add Table Name - Add the table name to a field.
- Check Last Query - Output the last query.
Exists
Exists is a simple function that returns TRUE or FALSE depending on whether the object has a corresponding database record. For example:
This method works by looking at one of two variables:
- If the $id field is set, then this returns TRUE if the field is not empty().
- Otherwise, this field returns TRUE if the $all array contains at least one item.
This means that an existing record with an $id of 0 does not "exist". This is to be consistent with the idea that an empty $id implies a new record.
$id = 42; // Get user $u = new User(); $u->get_by_id($id); // Check if we actually got a user back from the database if ($u->exists()) { // Yes, we did! } else { // No, we didn't! }
Clear
Clear is used to clear the object of data.
$id = 42; // Get user $u = new User(); $u->get_by_id($id); // Show username echo $u->username; // Let's say it outputs "foo bar" // Clear object $u->clear(); // Try to show username again echo $u->username; // outputs nothing since the object has been cleared
Reinitialize Model
This method is used to re-configure a model.
The initial configuration happens automatically the first time a model is used. Sometimes, however, it is necessary to re-initialize a model.
A specific example would be after a user's preferences have been loaded, and the localized language of the application has been changed. In this instance, we need to call reinitialize_model() on the user object to ensure that the correct language is loaded.
Note: this will only affect the object it is called on, and future objects created that are of the same model.
Therefore, language changes should be handled as early as possible in the application, before any other models are accessed
Example
// Custom Session class (application/libraries/MY_Session.php) class MY_Session extends CI_Session { function MY_Session() { parent::CI_Session(); $userid = $this->userdata['logged_in']; if(!empty($userid)) { $this->logged_in_user = new User($userid); $CI =& get_instance(); if($this->logged_in_user->language != $CI->config->item('language')) { // override default language $CI->config->config['language'] = $this->logged_in_user->language; // reload the user model $this->logged_in_user->reinitialize_model(); } } }
Query
This method functions in the same way as CodeIgniter's Query method except that the object is populated with the returned results.
Use this method at your own risk as it will only be as reliable as your query. I highly recommend using the binding approach so your data is automatically escaped.
The Query method will populate the object with the results so it is very important to remember that you should be querying for data from the objects table. For example:
// Create user object $u = new User(); // SQL query on users table $sql = "SELECT * FROM `users` WHERE `username` = 'Fred Smith' AND `status` = 'active'"; // Run query to populate user object with the results $u->query($sql);
Obviously you wouldn't use the Query method for the above situation since DataMapper's Get method would be more appropriate.
As I mentioned before, it is recommended you use bindings when using the Query method. For example, doing the same as above but with bindings:
// Create user object $u = new User(); // SQL query on users table $sql = "SELECT * FROM `users` WHERE `username` = ? AND `status` = ?"; // Binding values $binds = array('Fred Smith', 'active'); // Run query to populate user object with the results $u->query($sql, $binds);
The question marks in the query are automatically replaced with the values in the array in the second parameter of the Query method.
Add Table Name
This method will add the object's table name to the provided field.
Useful for the query method, as well as when you need to run more complicated queries using the normal methods from get and get advanced.
Arguments
- $field: A field or array of field names to prepend the table name to.
$u = new User(); $u->where( 'UPPER(' . $u->add_table_name('name') . ') <>', 'SECRET')->get(); // Produces SELECT * FROM `users` WHERE UPPER(`users`.`name`) <> 'SECRET'
The benefit of this method is you are no longer hard-coding the table name. It may or may not be worth it for your application.
Get SQL
Info on this method has been moved here.
Check Last Query
This method allows you to debug the last query that was processed. In its simplest form, it outputs the last query, formatted and placed inside <pre> tags.
You can also pass as the first argument in a two-item array with alternative delimiters, or FALSE for no delimiters. The second argument, when TRUE, prevents the method from automatically outputting the query to the browser.
Example
$u = new User(); $u->where('name', 'Joe')->get(); $u->check_last_query();Outputs to the browser:
SELECT `users`.* FROM `users` WHERE `users`.`name` = 'Joe'


dirtest
OS/161 Reference Manual
Name
dirtest - simple subdirectories test
Synopsis
/testbin/dirtest
Description
dirtest creates and then removes a series of nested directories.
Requirements
dirtest uses the following system calls:
dirtest should run (on SFS filesystems) when assignment 4 is complete.
It will not run on emufs, because emufs does not support rmdir.


Lesson 07
00:00:01 Review of Random Forest previous lessons,
Lots of historical/theoritical techniques in ML that we don’t use anymore (like SVM)
Use of ML in Industry vs Academia, Decision-Trees Ensemble
00:05:30 How big the Validation Set needs to be ? How much the accuracy of your model matters ?
Demo with Excel, T-distribution and n>22 observations in every class
Standard Deviation : np(1-p), Standard Error (stdev mean): stdev/sqrt(n)
00:18:45 Back to Random Forest from scratch.
“Basic data structures” reviewed
00:32:45 Single Branch
Find the best split given variable with ‘find_better_split’, using Excel demo again
00:45:30 Speeding things up
00:55:00 Full single tree
01:01:30 Predictions with ‘predict(self,x)’,
and ‘predict_row(self, xi)’
01:09:05 Putting it all together,
Cython an optimising static compiler for Python and C
01:18:01 “Your mission, for next class, is to implement”:
Confidence based on tree variance,
Feature importance,
Partial dependence,
Tree interpreter.
01:20:15 Reminder: How to ask for Help on Fastai forums
http://wiki.fast.ai/index.php/How_to_ask_for_Help
Getting a screenshot, resizing it.
For lines of code, create a “Gist”, using the extension ‘Gist-it’ for “Create/Edit Gist of Notebook” with ‘nbextensions_configurator’ on Jupyter Notebook, ‘Collapsible Headings’, ‘Chrome Clipboard’, ‘Hide Header’
01:23:15 We’re done with Random Forests, now we move on to Neural Networks.
Random Forests can’t extrapolate, it just averages data that it has already seen, Linear Regression can but only in very limited ways.
Neural Networks give us the best of both worlds.
Intro to SGD for MNIST, unstructured data.
Quick comparison with Fastai/Jeremy’s Deep Learning Course.


My favorite search engine is
Google
!
My favorite time-waster is
Netflix
!
My favorite project site is
GitHub
!
My favorite professional site is
LinkedIn
!


References
Information was gathered from the following sites:
- Wikipedia: Hard disk drive
- History of Hard Disk Drive
- How Hard Disks Work
- What is a Solid State Drives (SSD)?
- OCZ VeloDrive PCI-Express SSD
- Evolution of the Solid-State Drive
- HDD vs SSD
Thank you very much for visiting my site. I hope you learned a lot and enjoyed your stay. If you have any questions, please feel free to send me an email at dwilson@cs.dal.ca


Getting started with webpack and ES6 modules – the demo
Read
about this demo and how it works
.
Check out this
demo source code
.
Made with 💖 by
@svinkle
.


GRAND CANYON A film review by Steve Rhodes Copyright 1996 Steve Rhodes
RATING (0 TO ****): ****
I have no doubt that GRAND CANYON will be my best movie of 1991. This was a movie about how the chance happenings in your life can fundamentally alter your life forever. It especially dealt with the chance meeting of people who might become inseparable to you.
What is the plot of GRAND CANYON? Hard to say. It is about a lot of things. There is a mugging, a rescue, a lost baby, a found baby, getting involved with gangs, getting away from gangs, falling out of love with your wife, falling into love with your wife, being scared of someone of other race, becoming bosom buddies with someone of another race, and so and so forth. In short it is about life. GRAND CANYON is set in LA, but it could have been set anywhere. The movie's title comes from a wish of one of the characters played by Danny Glover.
It was most of all a film full of wonderful characters that you would like personally to meet. The dialog (Lawrence Kasdan and Meg Kasdan) was always incredible. I hope the writers get the Oscar for it. The directing is super. It was done by Lawrence Kasdan who did THE BIG CHILL, and you can think of it as a much more serious and heavy BIG CHILL. Alternatively, you can view it as updated BIG CHILL for the 90s.
 Where else could you have a long scene about the absolute fear of teaching a young boy to drive. Imagine a left turn against heavy traffic that is really scary and realistic and not the laugh track version you have come to expect.
This is also a quite scary movie with a fair amount of fear and blood. A subtheme is the violence in society in general and in LA in particular. As parents who are trying without much luck to have a second child, the episode of finding the baby and keeping it was really touching. Yet this was a life affirming and fundamentally happy movie that made you want to immediately give your spouse (and children and friends) a big hug.
The actors (Danny Glover as Simon, Kevin Kline as Mack, Steve Martin as Davis, Mary McDonnell as Claire, Mary-Louise Parker as Dee, and Alfre Woodard as Jane) are in top form. I had no idea Steve Martin could be an articulate and serious character. There is one very bad side to the show: It ends! The ending is fine and not abrupt yet I wanted to go on for hours. I love these people.
GRAND CANYON runs 2:15 which might be too long in a lessor picture, but here I wish the editor Carol Littleton had included even more footage. Moreover, I hope that someday the producers (Michael Grillo, Lawrence Kasdan, Charles Okun) will do a GRAND CANYON II because I need to know how these new friends of mine from this movie are doing. GRAND CANYON is rated R for some reason and I guess it is the fear and the bad language. Certainly it would be fine for any teenager. I recommend this film strongly to everyone over the age of 12 and award it my top rating of ****.
**** = One of the top few films of this or any year. A must see film. *** = Excellent show. Look for it. ** = Average movie. Kind of enjoyable. * = Poor show.  Totally unbearable.
REVIEW WRITTEN ON: January 17, 1992
Opinions expressed are mine and not meant to reflect my employer's.
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


Curency
Quantity
Orginal Rate [€]
Current Rate [€]
Original Value [€]
Current Value [€]
Profit/Loss [€]
Profit/Loss [%]
code
| © Louis Merlin & Ambroise Mean


--- layout: post title: Tsunami, Flickr and WAP date: 2005-01-03 00:00:00 categories: mobile social ---
It's not just for gadget freaks and techno-utopians; this stuff has a party to play even during harsh times:
Flickr is being used to help locate missing persons...
...and Priya Prakash has a WAP site for emergency numbers (which I notice links through to a BBC WAP site)


Symbol Index for "Projected Property"
Symbol Index for diagram
"Projected Property"
Actual Property (Class)
basis (Association)
Natural Progression (Class)
predicted to be effective at (Association)
Projected Outcome (Class)
Projected Property (Class)
Property To Be Established (Class)
PrPr/Intention (Generalization Node)
SPr/Time (Generalization Node)
Subject Property (Class)
Target Property (Class)
Timepoint (Class)
Unknown Property (Class)


-
Some iPhone 6 Plus Owners Accidentally Bending Their iPhones in Pockets
www.macrumors.com
As highlighted in a few reports shared in the MacRumors forums, a small but growing number of iPhone 6 Plus owners have reportedly bent their ...
-
Kim Stanley Robinson's Mars books to be adapted for TV
boingboing.net
The books, which are among the best science fiction ever written, have been picked up by Game of Thrones co-producer Vince Gerardis, which bodes very ...
-
CEOs Get Paid Too Much, According to Pretty Much Everyone in the World
blogs.hbr.org
This is regardless of political affiliation and opinions on pay.
-
Online Voter Registration
register.rockthevote.com
Note : Some states offer online voter registration. Learn more. If you are an American citizen living abroad or a uniformed military voter, click ...

-
"Dare to Be Stupid"
www.cc.com
Jonah Ray and Chris Hardwick can't hide how happy they are to see "Weird Al" perform.
-
Progress Report: Continued Product Focus
yahoo.tumblr.com
By Jay Rossiter, SVP, Cloud Platform Group At Yahoo, focus is an important part of accomplishing our mission: to make the world’s daily habits more ...
-
Strengths, weaknesses and suspensions
espn.go.com
Roger Goodell is the sports world’s villain du jour, but until the NFL’s elevator of investigation reaches the top -- or ESPN delivers a s
-
Leafy Buzz—Makeshift
mkshft.org
Abdullah al Areeqi spends most afternoons in the back seat of his Toyota pickup truck, hawking plastic baggies of green leaves in Yemen’s capital of ...
-
Jenny Johnson to All Fathers and Sons: Please Get a Prostate Exam: The Q: ...
www.gq.com
There's a lot of crappy people in the world. There are people who do terrible things, and there are people who do amazing things. Sadly, we always ...
-
Curiosity Finds a Weird 'Ball' on Mars : DNews
news.discovery.com
Is that a tiny cannonball on Mars? Nope, but it is a fascinating object all the same. Continue reading →
-
15 lessons from 15 years of blogging
boingboing.net
Anil Dash has been at it for 15 years (slightly longer than me, but only slightly!) and his reflections on a decade and a half of blogging -- through ...
-
Dark Roasted Blend: Glorious Retrofuture from Japan, Part 1
www.darkroastedblend.com
Scroll down for comments: | | 5 comments |
-
Japan firm has 'thumbs up' solution for bigger smartphones | AFP.com
www.afp.com
Human thumbs are just too stumpy to navigate bigger-than-ever smartphone screens, but a Japanese gadget maker has a solution: a thumb extender.
-
Misogyny Isn’t Human Nature, Despite the Internet’s Bitter Baboons
www.slate.com
Light from the monitors cast lurid shadows upon their pallid, staring faces as their right hands pumped rhythmically up and down over the F5 key to ...
-
U.S. Airstrikes In Syria Against ISIS May Cost As Much As $10 Billion
www.ibtimes.com
The cost to the U.S. military of bombing ISIS may reach as high as $10 billion.
-
Housebound Trailer
www.youtube.com
Welcome home to the Kiwi horror house comedy that took SXSW by storm. Gerard Johnstone's brilliant genre mash-up stars Rima Te Wiata, Morgana ...
-
Doug Ford offers tour of city hall to John Tory, who rips “bully boy” ...
www.thestar.com
Councillor designates Sept. 26 as “take John Tory to work day,” while Tory says voters don’t want a bully like Ford as mayor.
-
At Gateway to Hamptons, Ku Klux Klan Advertises for New Members
www.nytimes.com
This summer, pamphlets and a recruitment form have been stuffed into plastic sandwich bags, along with a few Jolly Ranchers, and tossed onto ...

-
Emma Watson Nude Photo Threat Was a Prank Aimed at 4Chan
mashable.com
The website that threatened to release nude photographs of Emma Watson turned out to be a viral marketing campaign.
-
China's Next Tank Could Be This Weaponzied Robotic Spider
io9.com
Weapons designers in China have sketched out a tank-like robotic spider — and they're pitching the idea to the military. A quick scan of the specs ...
-
Why India's Mars mission is so cheap - and thrilling
www.bbc.co.uk
India's Mangalyaan satellite is staggeringly cheap by Western standards - but it hopes to address some of the biggest questions on Mars, writes the ...
-
Police investigated crack video while Rob Ford in rehab, new documents ...
www.theglobeandmail.com
Court documents reveal police believed a video showing Toronto Mayor Rob Ford smoking crack could be used to press charges of drug possession against ...
-
'Tuck-in' café sign upsets residents - Telegraph
www.telegraph.co.uk
The Tuck-in Coffee Shop in Doncaster may have to consider changing its sign
-
Cormac McCarthy Smiles
electricliterature.com
One of the rules I've heard taught most often in writing workshops is that you shouldn't use "smile" or "shrug" too frequently—if at all—as they can ...
-
William Gibson signing The Peripheral
forbiddenplanet.com
WILLIAM GIBSON will be signing THE PERIPHERAL at the Forbidden Planet London Megastore on Monday 24th November from 1 – 2pm. Flynne Fisher lives down ...
-
Stunned shoppers film jewellers raid
www.bbc.co.uk
Four masked people armed with hammers attempt to rob several jewellers in Glasgow's Argyll Arcade.


WITNESS LIST Agriculture & Livestock Committee April 19, 1999-8:00A SB 631 On: Small, Ed (Texas Boll Weevil Eradication Foundation)