Fedora's release-monitoring.org is essentially a giant periodic scraper of tens of thousands of package webpages. Upon detecting a new version of any of those packages, it publishes messages to an AMQP broker. Its scraping of package homepages is what powers this website; this service does no scraping of its own. However, while the Fedora ecosystem does provide the ability to get email notifications for package updates, it may not be immediately obvious how to do so. It requires looking up the package you want on release-monitoring.org, creating a Fedora FAS account, then going to http://apps.fedoraproject.org/notifications/ and then setting up custom filters there.
If you know where to look, this is not terribly onerous, the entire process takes maybe five minutes. However, if all you want is email notifications of new package versions, there's no reason it should be any more complicated than a single form with two fields: a package field, and an email address field. That's what this project is! Removing all the accidental complexity so that you just have those two boxes.
This is just a fun one-man side project. This project has not received any official endorsement from the maintainers of release-monitoring.org. In fact I would be mildly surprised if they'd heard of this website. This service just subscribes to the public AMQP brokers that release-monitoring.org graciously provides.
To add a package you'll need to use release-monitoring.org directly, which means you'll probably want an account with Fedora FAS if you don't already have one. If your package already uses GitHub, GitLab, or BitBucket for releases or is a package on npm, PyPI, Rubygems, crates.io, Hackage, etc., once you have an account set up, it is often a matter of seconds to create a new package.
No! Absolutely not. Your email addresses are never shared with any other party and certainly are not sent off to be harvested in some giant email list somewhere.
Upon subscribing to a package you will be emailed a unique unsubscribe link for that package which you can use to unsubscribe from notifications for that package.
You will be sent a confirmation link first when your email address is entered. Notifications about new package versions will only be sent to you if you follow the instructions on that confirmation link.
Simply unsubscribe to all package notifications you are currently subscribed to. Your email address will be automatically deleted within an hour.
Please email admin at the URL of this website detailing the problems you're running into and I'll do my best to help you out.
The source code for this lives at https://github.com/changlinli/notify-new-package.


{}
Wave:
Sine
Square
Sawtooth
Triangle
White Noise
Frequency:
440
Detune:
1
Volume:
0.2
Attack:
0
Decay:
0
Sustain:
1
Level:
0.6
Release:
0
Distortion
:
Simple
Karplus–Strong
Vintage
Ultra Metal
128
Ovesample:
None
2x
4x
Biquad
:
lowpass
highpass
bandpass
lowshelf
highshelf
peaking
notch
allpas
Detune:
1
Frequency:
350
Gain:
0
Q:
1
Reverb
:
White Noise
Room
Medium Hall
Concert Hall
Cavern
Bright Plate
Old Chamber
Dynamics Compressor
:
Threshold:
-24
Knee:
30
Ratio:
12
Attack:
0.003
Release:
0.25


Connection of <%= connectorTitle%> Connection complete
You can now close this browser tab and in Microsoft Teams Connector dialog click Done and exit out of the Connector dialog.


Name of Work : Providing Central lighting to ZDP road connecting RTC Terminal Road up to Chaitanya college road (Panta kalava) in Kanuru village , Vijayawada
IFB Number/Tender Notice : 04/CRDA-13022(31)/16/2017-AO3 OMG-CRDA-Part(2)
BQ Details
| S.No | Subwork Name | Specification Number | Quantity | UOM | Rate (INR) | Amount (INR) |
|---|---|---|---|---|---|---|
| 1 | Central lighting | APSS | 6.00 | Each | 6000 | 6000 |
| Supply ,transportation and fixing of 240 W LED High Mast Luminaire made of pressure diecast alluminium housing with powder coated,having protective toughned glass, Supply Input voltage 120 - 270 V AC, P.F > 0.90, high power LED's having efficacy >120 lumines/watt, System efficacy >95lm/W and junction temprature < 70° C, with Ingrees protection IP65, IK05, Driver surge protection 4KV, external Surge protection = 5KV with wide/ Narrow beam optics, THD<10% at 110Volts AC, driver efficiency >90%, , CCT: 3000K - 5700K, minimum CRI>70, etc., omplete a) LUMINAIRE MAKE : PHILIPS / OSRAM / GE / CROMPTON / BAJAJ / SCHREDER / VIN b) LED MAKE : PHILIPS LUMILEDS / CREE / NICHIA / OSRAM / SAMSUNG. | ||||||


I'm a full-stack web developer with a passion for building web apps
More About MeMy name is Harlan Heath and I am currently breaking into the world of Web Development. I started out in the IT field doing Desktop Support and while planning the next step in my career, I discovered my passion for web development. During my research I became eager to start in a field where people focus on collaboration, is mentally engaging, and varies day by day with new problems to solve. After completing a rigorous immersive web development program, I feel like I'm ready to continue learning, building, and developing a new career.
Please feel free to contact me with any questions you have


Imperative
int total = 0;
for (int n = 1; n <= 100; n++)
if (n % 2 == 0)
total += n;
Functional
total = sum (filter even [1..100])
Defined with an equation
Prelude> a = 2
Prelude> 5 * a
10
Prelude> b = 10 * a
Prelude> b
20
Prelude> c = b < 100
Prelude> c
True
Values in Haskell are immutable
Defined with an equation, take one or more parameters
double x = 2 * x
Produce single result when applied to arguments
Prelude> double 5
10
Function application can be nested
Prelude> double (double 5)
20
Parameters and arguments are separated by spaces
Prelude> add x y = x + y
Prelude> add 2 5
7
Function application has higher priority than other operators so
f a + b
means (f a) + b
Use parantheses to change order of evaluation, e.g.
f (a + b)
'
)myFunc
,
arg_1
,
x'
,
x''
MyFunc
,
1arg
,
'x
Bool |
Logical values | True and False |
Char |
Single characters | 'a' , 'B' , '1' |
String |
List of Chars |
"abc" , "" , "a" |
Int |
Fixed precision | 1 , -10 , 999 |
Integer |
Arbitrary precision |<PHONE_NUMBER>9999 |
Float |
Single precision | 1.0 , -0.99 |
Double |
Double precision |<PHONE_NUMBER>99.9 |
The notation v :: T
indicates
v
has type
T
Prelude> :type True
True :: Bool
Prelude> :t 'a'
'a' :: Char
Prelude> :t "a"
"a" :: [Char]
Every expression has a type, including functions
Prelude> :type not
not :: Bool -> Bool
Prelude> not True
False
Prelude> not False
True
Functions can be declared with a type
Prelude> :{
Prelude| happy :: Bool -> Bool -> Bool
Prelude| happy sunny cold = sunny && not cold
Prelude| :}
Prelude> happy True True
False
Prelude> happy True False
True
If not declared, types are inferred
Prelude> sad sunny cold = not sunny || cold
Prelude> :t sad
sad :: Bool -> Bool -> Bool
Prelude> sad True False
False
Prelude> double x = x * 2
Prelude> :t double
double :: Num a => a -> a
Num a =>
is a polymorphic constraint
Prelude> :info Num
class Num a where
(+) :: a -> a -> a
(-) :: a -> a -> a
(*) :: a -> a -> a
negate :: a -> a
abs :: a -> a
signum :: a -> a
fromInteger :: Integer -> a
{-# MINIMAL (+), (*), abs, signum, fromInteger, (negate | (-)) #-}
instance Num Word -- Defined in ‘GHC.Num’
instance Num Integer -- Defined in ‘GHC.Num’
instance Num Int -- Defined in ‘GHC.Num’
instance Num Float -- Defined in ‘GHC.Float’
instance Num Double -- Defined in ‘GHC.Float’
Normally written between two arguments (infix)
Prelude> :t (+)
(+) :: Num a => a -> a -> a
Prelude> 2 + 5
7
Prelude> :t (&&)
(&&) :: Bool -> Bool -> Bool
Prelude> True && False
False
Can also be used in prefix notation using brackets
Prelude> (+) 2 5
7
Prelude> (&&) True False
False
Prelude> :t (==)
(==) :: Eq a => a -> a -> Bool
Prelude> 1 == 2
False
Prelude> :t (/=)
(/=) :: Eq a => a -> a -> Bool
Prelude> 1 /= 2
True
Functions can be used in infix notation using backticks
Prelude> :t div
div :: Integral a => a -> a -> a
Prelude> div 10 3
3
Prelude> 10 `div` 3
3
Prelude> 10 `mod` 3
1
Binary subtraction operator and negate
function
Prelude> :t (-)
(-) :: Num a => a -> a -> a
Prelude> 2 - 1
1
Prelude> :t negate
negate :: Num a => a -> a
Prelude> negate 1
-1
Unary minus is syntatic sugar for negate
Prelude> x = -1
Prelude> x
-1
Prelude> y = 2 * (-1)
Prelude> y
-2
Sequences of elements of the same type
Prelude> :t [True,False,True]
[True,False,True] :: [Bool]
Prelude> :t ['a','b','c']
['a','b','c'] :: [Char]
Prelude> :t ["abc","def"]
["abc","def"] :: [[Char]]
Prelude> :t []
[] :: [a]
The type of a list conveys no information about its length; in fact, lists can be infinite!
The cons (:
) and
concatenation (++
) operators
Prelude> :t (:)
(:) :: a -> [a] -> [a]
Prelude> 1 : []
[1]
Prelude> 1 : [2, 3]
[1,2,3]
Prelude> :t (++)
(++) :: [a] -> [a] -> [a]
Prelude> [1] ++ [2]
[1,2]
Prelude> [1,2] ++ [3,4]
[1,2,3,4]
Prelude> [] ++ []
[]
Prelude> head [1,2,3,4,5]
1
Prelude> tail [1,2,3,4,5]
[2,3,4,5]
Prelude> [1,2,3,4,5] !! 2
3
Prelude> take 3 [1,2,3,4,5]
[1,2,3]
Prelude> drop 3 [1,2,3,4,5]
[4,5]
Prelude> length [1,2,3,4,5]
5
Prelude> sum [1,2,3,4,5]
15
Prelude> product [1,2,3,4,5]
120
Prelude> reverse [1,2,3,4,5]
[5,4,3,2,1]
Prelude> filter odd [1,2,3,4,5]
[1,3,5]
Prelude> null [1]
False
Prelude> null []
True
Prelude is a module containing useful definitions and functions, included into all Haskell programs by default
Expressions are not evaluated until results are needed
Prelude> infinity = [1..]
Prelude> take 5 infinity
[1,2,3,4,5]
Prelude> take 10 infinity
[1,2,3,4,5,6,7,8,9,10]
Prelude> sum (take 1000 (filter even infinity))
1001000
Prelude> :t repeat
repeat :: a -> [a]
Prelude> repeatedOnes = repeat 1
Prelude> take 10 repeatedOnes
[1,1,1,1,1,1,1,1,1,1]
It is possible to force the evaluation of an expression, and Haskell libraries often come with strict variants
Finite sequence of elements of possibly different types
Prelude> a = (True, False)
Prelude> :t a
a :: (Bool, Bool)
Prelude> b = (1, "haskell", not, (True, 'a'))
Prelude> :t b
b :: Num a => (a, [Char], Bool -> Bool, (Bool, Char))
Prelude> c = ()
Prelude> :t c
c :: ()
Prelude> d = ("tuple of arity one?")
Prelude> :t d
d :: [Char]
The number of elements in a tuple is called arity; tuples of arity one are not permitted!
Useful functions for tuples of 2 elements (pairs)
Prelude> :t fst
fst :: (a, b) -> a
Prelude> :t snd
snd :: (a, b) -> b
Prelude> fst (1, True)
1
Prelude> snd (1, True)
True


\providecommand{\shadedskip}{}
\definecolor{shadecolor}{rgb}{0.87843, 0.95686, 1.0}
\renewenvironment{shadedskip}{
\def\FrameCommand{\colorbox{shadecolor}}\FrameRule0.6pt
\MakeFramed {\FrameRestore}\vskip3mm}{\vskip0mm\endMakeFramed}
\providecommand{\shadedquoteBlue}{}
\renewenvironment{shadedquoteBlue}[1][]{
\bgroup\rmfamily\fboxsep=0mm\relax
\begin{shadedskip}
\list{}{\parsep=-2mm\parskip=0mm\topsep=0pt\leftmargin=2mm
\rightmargin=2\leftmargin\leftmargin=4pt\relax}
\item\relax}{\endlist\end{shadedskip}\egroup}\begin{shadedquoteBlue}
\fontsize{9pt}{9pt}
\begin{Verbatim}
print 'Hello, World!'
\end{Verbatim}
Big late 1990s question: will MS Word replace LaTeX? It never did!
When I write some scientific material,
Probably not, but I have a solution :-)
equation*
, equation
, align*
, align
+
eqnarray
, split
, alignat
, ... (numerous!)equation*
, equation
, align*
, align
equation*
, equation
, align*
, align
equation*
, equation
, align*
equation*
, equation
, eqnarray*
, align*
(but no labels)
subfigure
)Conclusion: Highly non-trivial to translate a LaTeX document into something based on HTML and vice versa.
montage
for png, gif, jpeg; pdftk
, pdfnup
,
and pdfcrop
for PDF).align
environment,
recall that Sphinx, Markdown, and MediaWiki cannot handle this,
although they have LaTeX math support.
Doconce offers minimalistic typing, great flexibility wrt format, especially for scientific writing with much math and code.
http://hplgit.github.com/teamods/writing_reports/
TITLE: Some Title
AUTHOR: name1 at institution1, with more info, and institution2
AUTHOR: name2<EMAIL_ADDRESS>at institution
DATE: today
# A table of contents is optional:
TOC: on
__Abstract.__
Here goes the abstract...
Or:
__Summary.__
Here goes the summary...
Headings are surrounded by =
signs:
========= This is an H1/chapter heading =========
======= This is an H2/section heading =======
===== This is an H3/subsection heading =====
=== This is an H4/paragraph heading ===
__This is a paragraph heading.__
Result:
This is a paragraph heading.
* Bullet list items start with `*`
and may span several lines
* *Emphasized words* are possible
* _Boldface words_ are also possible
* color{red}{colored words} too
* `inline verbatim code` is featured
o and sublists with enumerated items starting with `o`
o items are just indented as you would do in email
This gets rendered as
*
and may span several linesinline verbatim code
is featuredo
# Insert index items in the source
idx{key word1} idx{key word2}
# Label
===== Some section =====
label{this:section}
# Make reference
As we saw in Section ref{this:section}, references, index
items and labels follow a syntax similar to LaTeX
but without backslashes.
# Make reference to equations
See \eqref{eq1}-\eqref{myeq}.
# Make hyperlink
"some link text": "https://github.com/hplgit/doconce"
# Hyperlink with complete URL as link text
URL: "https://github.com/hplgit/doconce"
FIGURE: [figdir/myfig, width=300 frac=1.2] My caption. label{fig1}
Movies are also supported:
MOVIE: [http://youtu.be/IDeGDFZSYo8, width=420 height=315]
and rendered as
Inline math as in LaTeX:
...where $a=\int_{\Omega}fdx$ is an integral.
gets rendered as ...where \( a=\int_{\Omega}fdx \) is an integral.
An equation environment is surrounded by !bt
and !et
tags,
the rest is plain LaTeX:
!bt
\begin{align}
\frac{\partial u}{\partial t} &= \nabla^2 u,
label{a:eq}\\
\nabla\cdot\pmb{v} & = 0
label{b:eq}
\end{align}
!et
which is rendered as
$$ \begin{align} \frac{\partial u}{\partial t} &= \nabla^2 u, \label{a:eq}\\ \nabla\cdot\pmb{v} & = 0 \label{b:eq} \end{align} $$
Limit math environments to
\[ ... \]
\begin{equation*}
\end{equation*}
\begin{equation}
\end{equation}
\begin{align*}
\end{align*}
\begin{align}
\end{align}
align
with labels
Code is enclosed in !bc
and !ec
tags:
!bc pycod
def solver(I, a, T, dt, theta):
"""Solve u'=-a*u, u(0)=I, for t in (0,T] with steps of dt."""
dt = float(dt); N = int(round(T/dt)); T = N*dt
u = zeros(N+1); t = linspace(0, T, N+1)
u[0] = I
for n in range(0, N):
u[n+1] = (1 - (1-theta)*a*dt)/(1 + theta*dt*a)*u[n]
return u, t
!ec
This gets rendered as
def solver(I, a, T, dt, theta):
"""Solve u'=-a*u, u(0)=I, for t in (0,T] with steps of dt."""
dt = float(dt); N = int(round(T/dt)); T = N*dt
u = zeros(N+1); t = linspace(0, T, N+1)
u[0] = I
for n in range(0, N):
u[n+1] = (1 - (1-theta)*a*dt)/(1 + theta*dt*a)*u[n]
return u, t
We recommend to copy as much code as possible directly from the source files:
@@@CODE path/to/file
@@@CODE path/to/file fromto: start-regex@end-regex
For example, copying a code snippet starting with def solver(
and
ending with (line not included) def next(x, y,
is specified by
start and end regular expressions:
@@@CODE src/dc_mod.py fromto: def solver\(@def next\(x,\s*y,
.py
: pypro
if complete file, pycod
if snippet.pyopt
: visualized execution via the Online Python Tutor.f
, .f90
, f.95
: fpro
and fcod
.cpp
, .cxx
: cpppro
and cppcod
.c
: cpro
and ccod
.*sh
: shpro
and shcod
.m
: mpro
and mcod
ptex2tex
: between 40+ code styles in LaTeXpygments
is used for code in HTML (ca 10 styles)
With !bc pyoptpro
or a file *.pyopt
, the code applies the
Online Python Tutor for displaying
program flow and state of variables:
With !bc pyscpro
or a file *.pysc
, the code is typeset in
a sage cell:
a = 2
b = 3
print 'a+b:', a + b
# In a sage cell we can also plot
from matplotlib.pyplot import *
from numpy import *
x = linspace(0, 4*pi, 101)
y = exp(-0.1*x)*cos(x)
plot(x, y)
xlabel('x'); ylabel('y')
show()
Can take a Doconce source and transform to an IPython notebook with source
|--------------------------------|
|time | velocity | acceleration |
|---r-------r-----------r--------|
| 0.0 | 1.4186 | -5.01 |
| 2.0 | 1.376512 | 11.919 |
| 4.0 | 1.1E+1 | 14.717624 |
|--------------------------------|
Gets rendered as
| time | velocity | acceleration |
| 0.0 | 1.4186 | -5.01 |
| 2.0 | 1.376512 | 11.919 |
| 4.0 | 1.1E+1 | 14.717624 |
newcommands*.tex
files contain newcommandsLables, citations, index, and bibliography follow the ideas of LaTeX, but without backslashes:
===== My Section =====
label{sec:mysec}
idx{key equation} idx{$\u$ conservation}
We refer to Section ref{sec:yoursec} for background material on
the *key equation*. Here we focus on the extension
!bt
\begin{equation}
\Ddt{\u} = \mycommand{v} label{mysec:eq:Dudt}
\end{equation}
!et
Equation \eqref{mysec:eq:Dudt} is important, see
cite{Larsen_et_al_2002,Johnson_Friedman_2010a}.
Also, cite{Miller_2000} supports such a view.
Figure ref{mysec:fig:myfig} displays the features.
FIGURE: [fig/myfile, width=600] My figure. label{mysec:fig:myfig}
===== References =====
BIBFILE: papers.pub
The papers.pub
file must be in Publish
format (easy to make from BibTeX).
Doconce offers a special format for exercises, problems, projects, and examples:
===== Problem: Flip a Coin =====
label{demo:ex:1}
files=flip_coin.py, flip_coin.pdf
solutions=mysol.txt, mysol_flip_coin.py
keywords = random numbers; Monte Carlo simulation
!bsubex
Make a program that simulates flipping a coin $N$ times.
!bhint
Use `r = random.random()` and define head as `r <= 0.5`.
!ehint
!esubex
!bsubex
Compute the probability of getting heads.
!bans
0.5.
!eans
!esubex
a) Make a program that simulates flipping a coin \( N \) times.
Hint.
Use r = random.random()
and define head as r <= 0.5
.
b) Compute the probability of getting heads.
Answer. 0.5.
Filenames: flip_coin.py
, flip_coin.pdf
.
All exercises, problems, and projects in a document are parsed and available in a data structure (list of dicts) for further processing (e.g., making a book of problems).
[{'answer': '',
'closing_remarks': '',
'file': ['flip_coin.py', 'flip_coin.pdf'],
'hints': [],
'keywords': ['random numbers', 'Monte Carlo simulation'],
'label': 'demo:ex:1',
'solution_file': ['mysol.txt', 'mysol_flip_coin.py'],
'subex': [{'answer': '',
'file': None,
'hints': ['Use `r = random.random()` ...'],
'solution': '',
'text': 'Make a program that simulates ...'},],
'title': 'Flip a Coin',
'type': 'Problem'}]
FORMAT
variable can be used to test on format, e.g.,
Very effective way to generate slides from running text:
!split
wherever you want a new slide to
begin!bpop
and !epop
around elements to pop up
in sequence=
or 5 =
in headings (H2 or H3)
!split
======= Headline =======
* Key point 1
* Key point 2
* Key point 3: Although long
bullet points are not recommended in general, we need
it here for demonstration purposes to investigate
what happens with the slide layout where there is
so much text under one point
FIGURE: [fig/teacher1, width=100 frac=0.5]
Key equation:
!bt
\[ -\nabla^2 u = f \quad\hbox{in }\Omega \]
!et
And maybe a final comment?
!split
======= Next slide... =======
Last page gets rendered to
Key equation:
$$ -\nabla^2 u = f \quad\hbox{in }\Omega $$
And maybe a final comment?
Example with a bullet list to the left and a figure to the right (two cells: 00 and 01):
!split
======= Headline =======
!bslidecell 00
!bpop
* Key point 1
* Key point 2
* Key point 3
!epop
!bpop
!bt
\[ -\nabla^2 u = f \quad\hbox{in }\Omega \]
!et
!epop
!eslidecell
!bslidecell 01
FIGURE: [fig/broken_pen_and_paper, width=400, frac=0.8]
!eslidecell
!split
======= Next slide... =======
Last page gets rendered to
$$ -\nabla^2 u = f \quad\hbox{in }\Omega $$
Run in terminal window:
doconce format html doconcefile
# Solarized HTML style
doconce format html doconcefile --html_solarized
# Control pygments typesetting of code
doconce format html doconcefile --pygments_html_style=native
# Or use plain <pre> tag for code
doconce format html doconcefile --no_pygments_html
# Further making of slides
doconce slides_html doconcefile reveal --html_slide_theme=darkgray
Two formats of blog posts are supported:
equation
and align
work in Wordpress :-)--wordpress
:
doconce format html doconcefile --wordpress
and paste the code into the text area.
doconce format pdflatex doconcefile
# Result: doconcefile.p.tex (ptex2tex file)
# Run either
ptex2tex doconcefile
# or
doconce ptex2tex doconcefile -DHELVETICA envir=minted
pdflatex doconcefile
bibtex doconcefile
pdflatex doconcefile
# More control of how code is typeset
doconce format pdflatex doconcefile --minted_latex_style=trac
doconce ptex2tex doconcefile envir=minted
doconce format pdflatex doconcefile
doconce ptex2tex doconcefile envir=ans:nt
doconce format sphinx doconcefile
# Autocreate sphinx directory
doconce sphinx_dir theme=pyramid doconcefile
# Copy files and build HTML document
python automake-sphinx.py
google-chrome sphinx-rootdir/_build/html/index.html
Much easier than running the Sphinx tools manually!
Only MediaWiki supports math.
doconce format mwiki doconcefile
Recommended site:
doconce format pandoc doconcefile # (Pandoc extended) Markdown
doconce format gwiki doconcefile # Googlecode wiki
doconce format cwiki doconcefile # Creole wiki (Bitbucket)
doconce format rst doconcefile # reStructuredText
doconce format plain doconcefile # plain, untagged text for email
sudo apt-get install python-doconce
(old!)hg clone
+ sudo python setyp.py install
preprocess
and mako
latex
, sphinx
, pandoc
, etc. (see the Installation description)preprocess
is needed :-)
doconce latex2doconce
helps the translation\[ \]
, equation
, equation*
, align
, align*
and nothing more for
equations\includegraphics
, have captions after graphics, use short figure captions, position exactly where neededpageref
pdflatex
or xetex
\href
for links (and insert links frequently)bm
package for boldface \( \boldsymbol{u} \)
Figures:
latex
, PDF for pdflatex
,
PNG, GIF or JPEG for HTML formats (html
, and HTML output from
sphinx
, rst
, pandoc
). One can omit the figure file extension and
doconce
will pick the most appropriate file for the given output format.doconce combine_images
to combine several images into one.
\boldsymbol{u}
gives nicer boldface typesetting of math symbols than
the alternatives \boldsymbol{u}
and \pmb{u}
.\boldsymbol{u}
is not supported
and therefore automatically replaced by \boldsymbol{u}
by Doconce.\formula
in math expressions to color a part.doconce spellcheck *.do.txt
to automatically spellcheck files.
For output formats different from latex
, pdflatex
, and html
:
align
math environments: pandoc
and mwiki
cannot refer to them.sphinx
output requires=
) comes
section (7 =
), then subsection (5 =
), then paragraph
(3 =
). Do not make jumps in this progression.=== ... ===
) and after subsection and section headings.


Highlights
Reduction of water in the interstice of the seeds in J. curcas helps to maintain seed viability and oils content.
The NaCl in the irrigation water can affect the seedlings since 75 mM, producing reduction in the biometrics and germination parameters.
Exist a different levels of tolerance between the genotypes of J. curcas from different regions of Brazil
The biometric parameter explain better J. curcas behavior under salinity condition.


Efficient Data Access Mechanisms for Wide-area Distributed Systems
| Sponsor | Prof. Mustaque Ahamad |
|<EMAIL_ADDRESS>| |
| Area | Systems |
Project Description
Popular web servers must deal with huge number of client requests and are often the bottleneck in accessing information supplied by them. Push and pull technologies, caching, clustering, replication and consistency are some of the issues that need to be explored in building scalable servers. This project will explore these techniques for dynamic content and will study workloads that can be used to evaluate their effectiveness.
Deliverables
A project report that identifies the problems discussed, solutions provided, and my views on the problems, solutions.
Meeting Schedule
Meet when there are questions, etc.
Resources
http://www.crhc.uiuc.edu/PERFORM/Papers/USAN_papers/01KRI03.pdf
http://www.infres.enst.fr/~parmenti/these/Biblio/raynal_time_sensitive.pdf
http://www.cs.duke.edu/~yhf/tact-tocs.pdf
Due Date
Oct. 22nd
Final Report
Report on Shared State Consistency and Timeliness for Replicated Services


Welcome them warmly
with new Easter fragrances and accents
To shop now, copy and paste:
http://links.mkt1917.com/ctt?kn=10&ms=MTI3NDYyMzIS1&r=Mzc1MTMwMDUwMTIS1&b=2&j=NzAzMjE4NTkzS0&mt=1&rt=0
into your browser
Easter Tips and Trends
So much to celebrate, so much to decorate—
our store staff can help you with it all!
To find a store, copy and paste:
http://links.mkt1917.com/ctt?kn=16&ms=MTI3NDYyMzIS1&r=Mzc1MTMwMDUwMTIS1&b=2&j=NzAzMjE4NTkzS0&mt=1&rt=0
into your browser


Networked ontologies used by SwO:
| Ontology | Relation | Integration Level |
| SPO - Software Process Ontology |
Figure 1 presents the conceptual model of the SwO.
Figure 1. SwO conceptual model.
The Software Ontology (SwO) captures that software products have a complex artifactual nature, being constituted of software artifacts of different nature, including software systems, programs and code.
The following table shows the definitions for SwO concepts.
| Concept | Definition |
| Code | Software Item representing a set of computer instructions and data definitions expressed in a programming language or in a form output by an assembler, compiler, or other translator (SEVOCAB).
|
| Machine Code | Computer instructions and data definitions expressed in a form output by an assembler, compiler, or other translator, which can be recognized by the processing unit of a computer machine.
|
| Program | Software Item which aims at producing a certain result through execution on a computer, in a particular way, given by the Program Specification. A Program is constituted by code, but it is not identical to code. Code can be changed without altering the identity of its program, which is anchored to the program's essential property: its intended specification (Program Specification).
|
| Program Specification | A document that describes the purpose (structure and functions) of a program in sufficient detail to permit coding and to facilitate maintenance.
|
| Programming Language | A language used to express computer programs.
|
| Software System | Software Item that aims at satisfying a specification (System Specification), concerning a desired change in a data structure inside a computer, abstracting away from the behavior.
|
| Source Code | A well-formed sequence of computer instructions and data definitions expressed in a programming language, in a form suitable for input to an assembler, compiler, or other translator. |
| System Specification |
|
<<subkind>> Code |
Code (0..*) implements (0..1) Program Specification
Code Documentation changes Code
Code Development creates Code
Code Review uses Code
Program (0..1) constituted of (1..*) Code
<<subkind>> Machine Code |
Machine Code (0..*) generated from (1..1) Source Code
<<subkind>> Program |
Program (0..1) constituted of (1..*) Code
Program (0..1) intends to implement (1..1) Program Specification
Program (0..*) implements (1..*) Software Function Universal
Program (0..*) \intends to satisfy (1..*) Requirement Artifact
Loaded Program Copy (0..*) materialization of (1..1) Program
Software System (0..*) constituted of (1..*) Program
<<subkind>> Program Specification |
Program Specification (0..*) intends to satisfy (0..*) System Specification
Program Specification (0..*) intends to satisfy (1..*) Requirement Artifact
Program Specification (0..*) describes (1..*) Software Function Universal
Code (0..*) implements (0..1) Program Specification
Program (0..1) intends to implement (1..1) Program Specification
<<kind>> Programming Language |
Source Code (0..*) written in (1..*) Programming Language
<<subkind>> Software System |
Software System (0..*) constituted of (1..*) Program
Software System (0..1) intends to implement (1..1) System Specification
Software Product (0..1) constituted of (1..*) Software System
<<subkind>> Source Code |
Source Code (0..*) written in (1..*) Programming Language
Machine Code (0..*) generated from (1..1) Source Code
<<subkind>> System Specification |
Program Specification (0..*) intends to satisfy (0..*) System Specification
Software System (0..1) intends to implement (1..1) System Specification


Hacking magnum swarm node to add proxy
I will talk about how to add proxy in magnum swarm framework
Why I need proxy
Because GFW, you know!
Where to add proxy
We need an http_proxy and https_proxy first! if you do not have that proxy, then you can leave now.
dockerd need proxy to pull image
$ mkdir /etc/systemd/system/docker.service.d/
$ cat /etc/systemd/system/docker.service.d/proxy.conf << EOF
[Service]
Environment=HTTP_PROXY=http://x.x.x.x:yy
EOF
$ systemctl daemon-reload
systemctl restart docker.service
docker service need proxy to access extrenl network
we can passing to docker run command line like this:
-e http_proxy=http://x.x.x.x:yy \
-e https_proxy=http://x.x.x.x:yy \
-e no_proxy=<IP_ADDRESS>,<IP_ADDRESS>,<IP_ADDRESS>
no_proxy is important, since swarm node internal access will use 192* ip.
docker host need proxy
cat /etc/bashrc <<EOF
declare -x http_proxy=http://x.x.x.x:yy
declare -x https_proxy=http://x.x.x.x:yy
declare -x no_proxy=<IP_ADDRESS>,<IP_ADDRESS>,<IP_ADDRESS>
EOF
notes we only add <IP_ADDRESS>,<IP_ADDRESS>,<IP_ADDRESS> because we only have 3 nodes and their ips are them, this is hacking, we need to dynimic adding them this is okay, because we can get them from HEAT template. Since I am hacking, it is okay. I know what I am doing.
hacking magnum code to adding proxy
I put all of them into a patch, you may get it from here, but please not it is only working for my enviroment, just an example for you.
go and play with it
And you need to have an OpenStack setup, command line to create baymodelas follows
nova keypair-add --pub-key ~/.ssh/id_rsa.pub testkey
NIC_ID=$(neutron net-show public | awk '/ id /{print $4}')
# create a baymodel
magnum baymodel-create --name swarmmodel --image-id fedora-21-atomic-3 \
--keypair-id testkey --external-network-id $NIC_ID \
--dns-nameserver <IP_ADDRESS> --flavor -id m1.small \
--docker-volume-size 5 --coe swarm --fixed-network <IP_ADDRESS>/24
# create swarm bay which has 2 agent nodes and 1 manager node
magnum bay-create --name swarmbay --baymodel swarmmodel --node-count 2
magnum container-create --name hello --image cirros --bay swarmbay --command "echo hello world"
magnum container-list
+--------------------------------------+---------------+---------+
| uuid | name | status |
+--------------------------------------+---------------+---------+
| 084a650f-e17c-4aab-b229-74567d38f4e7 | testcontainer | Stopped |
| f1d7a992-8073-44cd-966f-6e08d102cc1b | hello | Stopped |
+--------------------------------------+---------------+---------+


StackRoute Labs is our product engineering, technology innovation and incubation heart of StackRoute. New programs, technology product lines are incubated at StackRoute Labs and rolled out in StackRoute. Current work in the labs includes large-scale deep assessment and AI based automated remediation platforms.
NIIT is a leading Skills and Talent Development Corporation that is building a manpower pool for global industry requirements. The company, which was set up in 1981 to help the nascent IT industry overcome its human resource challenges, today ranks among the world’s leading training companies owing to its vast, yet comprehensive array of talent development programs. With a footprint across 30 nations, NIIT offers training and development solutions to Individuals, Enterprises and Institutions.
Present across 30 countries, 35 Million+Learners Worldwide, Industry Mapped Curriculum, India's Most Trusted Educational Brand. NIIT is a market-leading learning outsourcing company that provides managed training services including custom content development and curriculum design, learning administration, learning delivery, strategic sourcing, and learning technology.


{% extends 'emails/base_template.html' %} {% block content %} {% load humanize %}
Hello,
Your credit card ending in {{last_4}} was recently declined, leaving an outstanding balance of ${{payment.paid_amount|floatformat:2 | intcomma}} for usage of your oxd license.
This often happens when a credit or debit card has exceeded its spending limit. Please review your payment method and contact your card issuer to find out why the charge failed. Once you've determined the problem, update or add a new card to complete your payment and keep your oxd installations active.
We will try to bill again on {{billing_date}}. If there is no valid credit card to charge your oxd license will be deactivated and all oxd installations associated with your license will stop working.
If you need help completing your payment, please contact Gluu support.
Thank you,
Gluu


--- layout: default title: Getting Started with Ionic body_css: getting-started-page header_title: Getting Started with Ionic header_sub_title: Build mobile apps faster with the web technologies you know and love. active: getting-started news: Questions? Head over to our Community Forum to chat with others using the framework. pre_footer: true ---
Follow these quick steps and start building high quality mobile apps in minutes. For a more indepth overview, watch our Crash Course video, which covers everything else you'd want to know.
First, install Node.js. Then, install the latest Cordova and Ionic command-line tools. Follow the Android and iOS platform guides to install required platform dependencies. Windows users might want to watch this installation video (or try Vagrant below).
We also have a Vagrant package for an all-in-one setup (experimental).
Note: iOS development requires Mac OS X.
Create an Ionic project using one of our ready-made app templates, or a blank one to start fresh.
$ ionic start myApp blank
$ ionic start myApp tabs
$ ionic start myApp sidemenu
Ionic apps are based on Cordova, so we can use the Cordova utilities to build, test, and deploy our apps, but we provide simple ways to do the same with the ionic utility (substitute ios for android to build for Android):
Ionitron suggests you head over to the Docs for an overview of Ionic's CSS and Javascript components. Make sure to join the Forum and enter your email below for Ionic updates:


User account
User role
Username
Password
Izmeni
New password
Password must containt at least 5 characters.
Repeat password
Passwords don't match.
Firstname
Field can't be empty.
Lastname:
Field can't be empty.
Genre
Female
Male
Save
Cancel


{% extends 'base.html' %} {% block body_block%}
Get time-series data from Weather Stack and save it to HDFS
{{ status }}


|
dgd2cmdi
1.0
|
Public Member Functions | |
| def | __init__ (self, corpuspath, eventspath, speakerspath, transcriptspath) |
| def | find_media (self, resource) |
| def | show_empty_etree (self) |
| def | find_eventsessions (self, speakernode) |
| def | find_events (self, speakernode) |
| def | find_speakers (self, eventnode) |
| def | find_transcripts (self, eventnode) |
| def | get_speaker_data (self, speakernode) |
| def | speaker2event (self, speakernode) |
| def | speaker2event_session (self, speakernode) |
| def | define_resourceproxy (self, metafilenode) |
| def | set_resourceproxy (self, nodename, resourceproxies, rtype='Metadata', mtype=None, idprefix='', refprefix=LANDINGPG, refpostfix='') |
| def | build_resourceproxy (self) |
| def | define_parts (self, resource) |
| def | build_parts (self) |
| def | check_cmdi_xsd (self, nodename) |
| def | validate_corpus (self, corpusnode) |
| def | write2cmdi (self, corpus, outpath) |
Static Public Member Functions | |
| def | contextpath (fname, startpath) |
Public Attributes | |
| corpuspath | |
| eventspath | |
| speakerspath | |
| transcriptspath | |
| name | |
| eventcorpustuples | |
| speakercorpustuples | |
| transcriptcorpustuples | |
represent resources in a tree structure. all involved paths The resurce collection is a Digraph representation of all data. each data is a node that holds a dict defining their attributes: repopath : <path locates the metadata file in the dgd repository scopus> corpusroot : <boolean. is the file a corpus catalogue or not?> input data paths must be pointed towards already cmdi transformed data. NOTE: April 29th Speakers are not removed from resource proxy generation. Transcript nodes are added. their type is labelled "transcript" accordingly. CMDI references only work with new transformed data (revision including session to event metadata)
| def batchxslt.cmdiresource.ResourceTreeCollection.__init__ | ( | self, | |
| corpuspath, | |||
| eventspath, | |||
| speakerspath, | |||
| transcriptspath | |||
| ) |
| def batchxslt.cmdiresource.ResourceTreeCollection.build_parts | ( | self | ) |
build the hasPart Relations for all Nodes :return:
| def batchxslt.cmdiresource.ResourceTreeCollection.build_resourceproxy | ( | self | ) |
inplace resourceproxy generation of the resource. modifies the stored etree object of each resource. :param : :return:
| def batchxslt.cmdiresource.ResourceTreeCollection.check_cmdi_xsd | ( | self, | |
| nodename | |||
| ) |
checks if the cmdi record file of a node is valid :param nodename: :return:
|
static |
find the path from a startpath to a given file
| def batchxslt.cmdiresource.ResourceTreeCollection.define_parts | ( | self, | |
| resource | |||
| ) |
define Parts for a given node inside a Relation Element. all outgoing edges refer to hasParts relations. all ingoing edges refer to isPartOf relations. :param resource: :return:
| def batchxslt.cmdiresource.ResourceTreeCollection.define_resourceproxy | ( | self, | |
| metafilenode | |||
| ) |
defines the ResourceProxies for all Resources referred via edges Resources element structure in a cmdi file. <Resources> <ResourceProxyList> </ResourceProxyList> <JournalFileProxyList> </JournalFileProxyList> <ResourceRelationList> </ResourceRelationList> </Resources> :param metafilenode: :return:
| def batchxslt.cmdiresource.ResourceTreeCollection.find_events | ( | self, | |
| speakernode | |||
| ) |
:param speakernode :return list of event labels searches for events a speaker takes part in.
| def batchxslt.cmdiresource.ResourceTreeCollection.find_eventsessions | ( | self, | |
| speakernode | |||
| ) |
:param speakernode :return list of event labels searches for events a speaker takes part in by looking up the metadata itself. Since there is no physical resource for sessions, they are not filed as nodes.
| def batchxslt.cmdiresource.ResourceTreeCollection.find_media | ( | self, | |
| resource | |||
| ) |
adds a node and edge from event to media. for all media found in a resource node. :param resource: :return:
| def batchxslt.cmdiresource.ResourceTreeCollection.find_speakers | ( | self, | |
| eventnode | |||
| ) |
returns all speaker nodes connected to the eventnode. :param eventnode: :return: list of speaker labels fo/und in event
| def batchxslt.cmdiresource.ResourceTreeCollection.find_transcripts | ( | self, | |
| eventnode | |||
| ) |
finds trancripts associated with given event :param eventnode: :return:
| def batchxslt.cmdiresource.ResourceTreeCollection.get_speaker_data | ( | self, | |
| speakernode | |||
| ) |
returns a dict of all relevant speaker data from a metafile key is element.tag, value is string of the complete element :param speakernode: :return:
| def batchxslt.cmdiresource.ResourceTreeCollection.set_resourceproxy | ( | self, | |
| nodename, | |||
| resourceproxies, | |||
rtype = 'Metadata' , |
|||
mtype = None , |
|||
idprefix = '' , |
|||
refprefix = LANDINGPG , |
|||
refpostfix = '' |
|||
| ) |
sets a resourceproxy entry and its subelements. :param nodename: :param resourceproxies: :return:
| def batchxslt.cmdiresource.ResourceTreeCollection.show_empty_etree | ( | self | ) |
returns all empty etree attributes for debugging :return:
| def batchxslt.cmdiresource.ResourceTreeCollection.speaker2event | ( | self, | |
| speakernode | |||
| ) |
takes a speaker node, finds all events the speaker takes part in and writes the important data to the <Speaker> element of an event datum. :param speakernode: :return:
| def batchxslt.cmdiresource.ResourceTreeCollection.speaker2event_session | ( | self, | |
| speakernode | |||
| ) |
This is a refined version of speaker2event which iterates over every session found in an event rather than looping over all speaker regardless of the session. takes a speaker node, finds all events the speaker takes part in and writes the important data to the <Speaker> element of an event-session datum. :param speakernode: :return:
| def batchxslt.cmdiresource.ResourceTreeCollection.validate_corpus | ( | self, | |
| corpusnode | |||
| ) |
takes a node of a corpus (e.g. 'PF') and checks if it and all its successors are valid according to the cmdi profile. Online access to profiles not yet implemented. :param corpusnode: :return: errorlist if exception
| def batchxslt.cmdiresource.ResourceTreeCollection.write2cmdi | ( | self, | |
| corpus, | |||
| outpath | |||
| ) |
| batchxslt.cmdiresource.ResourceTreeCollection.corpuspath |
| batchxslt.cmdiresource.ResourceTreeCollection.eventcorpustuples |
| batchxslt.cmdiresource.ResourceTreeCollection.eventspath |
| batchxslt.cmdiresource.ResourceTreeCollection.name |
| batchxslt.cmdiresource.ResourceTreeCollection.speakercorpustuples |
| batchxslt.cmdiresource.ResourceTreeCollection.speakerspath |
| batchxslt.cmdiresource.ResourceTreeCollection.transcriptcorpustuples |
| batchxslt.cmdiresource.ResourceTreeCollection.transcriptspath |


{% extends "email_messages/layout.html" %} {% block header_content %} Workshop Accepted {% endblock %} {% block content_body %} {% block content %} {% if presenter %}
Hey {{ presenter_name }},
We're writing in to let you know that the Workshop at {{ workshop_organization }} to be conducted on {{ date }} has been {% if assigned %} assigned to {% else %} unassigned from {% endif %} you.
Please visit the url below for more information. {{ workshop_url }}
{% else %}Hello folks!
Just giving you a heads up. The Workshop you are planning to conduct on {{ date }} has been {% if assigned %} assigned to {% else %} unassigned from {% endif %} {{ presenter_name }}.
Please visit the url below for more information. {{ workshop_url }}
{% endif %}May the love of Python spread far and wide!
Warmly,
The PythonExpress team
{% endblock %} {% endblock %}


There are no Products in your shopping cart.
Click here to return to the Home
Checkout now
Please enter your details, and We'll ship your goods right away!
Ship to
Name
Please enter a name
Address to
Street Address
Please enter a address
Complete order


---
layout: post
title: 'Landscape+Urbanism: Perils of Urban Chickens'
date: '2010-04-04T14:02:55-07:00'
tags:
tumblr_url: http://alexhwilliams.tumblr.com/post/496452097/landscape-urbanism-perils-of-urban-chickens
---
Landscape+Urbanism: Perils of Urban Chickens
And with chickens now legal in the city of Vancouver, BC, our neightbors to the north are thinking with all the forethought….of a chicken.
For with all those chickens will surely come the day when packs of wild hens will wander the streets, pecking and clucking in their vagabond nests.


ThunderAPI
A node.js scraper to get profile and squadron data from War Thunder
About
ThunderAPI is a simple, promise-based data scraper for the War Thunder site to get all kinds of data, including player and squadron info. Additionally, it makes full use of ES2017's async/await functionality for clear, concise code that is simple to write and easy to comprehend.
Features
- Fetching player info
- Fetching squadron info
- Getting news info
- Getting update info
Install
Node.js v8 or higher is required.
npm install thunderapi
To install the development branch (please note that this may not be stable):
npm install thunderstats/thunderapi
Documentation for the master branch can be found here.
Example usage
const { ThunderAPI } = require("thunderapi");
// Create a new instance of ThunderAPI
const thunderAPI = new ThunderAPI();
// The player can be any in-game player. In this example,
// we'll get the profile of the player Abinavski, and log
// the title he set.
thunderAPI.getPlayer("Abinavski")
// We handle the data returned here, in this case
// by logging the title the player has set.
.then(data => console.log("Title:", data.title))
// If an error occurred, we catch it here!
.catch(err => console.error("Oh no, an error occurred!\n", err));
Documentation
Contributing
If you wish to contribute to ThunderAPI, you are free to do so! Before getting started, please read the contribution guidelines first.
Support
If you encounter any problems using the ThunderAPI, want to leave a feature suggestion or just want a gentle nudge in the right direction, feel free to join our official Discord server!


Test Toolbox
Version 1.2, for MATLAB <IP_ADDRESS>2 (R2014a)
Geometry
boxIntersect
: Intersection of two bounding boxes
Graphics
boxOverlay
: Overlay a bounding box
xTickLabelRename
: Rename tick labels on x axis sequentially
xTickLabelRotate
: Rotate the labels of xtick
Utility
toolboxInfo
: Toolbox information


Don't sweat it with Cassidy Williams
Feeling anxious about finding a job? Relax, you’re awesome! But, if you need some tips, we got your back. This week, Clarifai’s Cassidy Williams joins us to chat about our Student Hacker Report, conquering impostor syndrome, and lots more.
Inside Digital Ocean
In this week’s special episode, Richard went to DigitalOcean this week to learn about their dev team’s current projects, structure, culture (46% of the team is remote), and more. Watch our special and see what it’s like to work Inside Digital Ocean!
Want more information about DO’s hiring process, team, and open jobs? Visit their team page on Devpost.
Decoding job listings Part 2
Tech job listings can be pretty cringeworthy. Last week we showed you how to identify bad listings, so today we’ll look at a better, more informative one. We’ll show you how to quickly scan through a listing and what to focus on when you apply.
Staff picks: AlexaWebBot - Use Alexa to navigate and control any website & Bumperz - A dashcam that warns drivers about dangerous road conditions
Decoding job listings Part 2
Job listings are a hot mess. They mix requirements and benefits with statements like “we’re looking for passionate astro-coder-nauts for a rocket ride to the future.” But if you know how to read between the lines, you can quickly sift out good opportunities from bad ones.
We’ve also got a special VR treat for you from Ryan Zehm and the Global Archiact Jam.
All about phone interview with Meetup
What’s a phone screen? (Hint: it comes before an interview, but after you apply) How do you prepare for it? What should you look out for? Meetup’s Jake Levine has all the answers in this week’s episode.
Staff picks: Money accordion - play the accordion using openCV + a dollar bill & EmotionPinTumbler - Emotion controlled locking mechanism
How to not suck at job fairs
Richard’s been going to a lot of job fairs and he’s disappointed. Job seekers, you need to make a better effort and come prepared. But enough complaining, we’re here to help! So take our advice:
Prepare (Google the company before you walk up)
Engage (ask a question / make a suggestion)
Follow up up (email within 24 hours)
Staff picks: Stripr - 3D printed / configurable power strip & Alexa Keep - Store & retrieve anything with Alexa
The culture of fit with Meetup
Culture fit, like “business casual,” can be interpreted in many different ways. So for this week’s episode, we asked Meetup Engineering Manager Rich Hsieh to tell us what he looks for when evaluating developers.
We’ve also got news about this weekend’s Fishackathon and some killer staff picks:
Autocolorization - Unleash your inner Ted Turner and colorize b&w movies with deep learning & Snapglasses - Design, print, and assemble your next pair of sunglasses


The Adventures of Tom Sawyer
by Mark Twain
Chapter 25
Additional Information
- Year Published: 1876
- Language: English
- Country of Origin: United States of America
- Source: Twain, M. (1876). The Adventures of Tom Sawyer. Hartford, CT: American Publishing Co.
-
Readability:
- Flesch–Kincaid Level: 4.5
- Word Count: 2,493
- Genre: Adventure
- ✎ Cite This
Downloads
THERE comes a time in every rightly–constructed boy's life when he has a raging desire to go somewhere and dig for hidden treasure. This desire suddenly came upon Tom one day. He sallied out to find Joe Harper, but failed of success.  Presently he stumbled upon Huck Finn the Red–Handed. Huck would answer. Tom took him to a private place and opened the matter to him confidentially. Huck was willing. Huck was always willing to take a hand in any enterprise that offered entertainment and required no capital, for he had a troublesome superabundance of that sort of time which is not money. "Where'll we dig?" said Huck.
"Oh, most anywhere."
"Why, is it hid all around?"
"No, indeed it ain't. It's hid in mighty particular places, Huck —sometimes on islands, sometimes in rotten chests under the end of a limb of an old dead tree, just where the shadow falls at midnight; but mostly under the floor in ha'nted houses."
"Who hides it?"
"Why, robbers, of course—who'd you reckon? Sunday–school sup'rintendents?"
"I don't know. If 'twas mine I wouldn't hide it; I'd spend it and have a good time."
"So would I. But robbers don't do that way. They always hide it and leave it there."
"Don't they come after it any more?"
"No, they think they will, but they generally forget the marks, or else they die. Anyway, it lays there a long time and gets rusty; and by and by somebody finds an old yellow paper that tells how to find the marks—a paper that's got to be ciphered over about a week because it's mostly signs and hy'roglyphics."
"HyroQwhich?"
"Hy'roglyphics—pictures and things, you know, that don't seem to mean anything."
"Have you got one of them papers, Tom?"
"No."
"Well then, how you going to find the marks?"
"I don't want any marks. They always bury it under a ha'nted house or on an island, or under a dead tree that's got one limb sticking out.
"Is it under all of them?"
"How you talk! No!"
"Then how you going to know which one to go for?"
"Go for all of 'em!"
"Why, Tom, it'll take all summer."
"Well, what of that?  How's that?"
Huck's eyes glowed.
"That's bully. Plenty bully enough for me. Just you gimme the hundred dollars and I don't want no di'monds."
"All right.  Some of 'em's worth twenty dollars apiece—there ain't any, hardly, but's worth six bits or a dollar."
"No! Is that so?"
"Cert'nly—anybody'll tell you so. Hain't you ever seen one, Huck?"
"Not as I remember."
"Oh, kings have slathers of them."
"Well, I don' know no kings, Tom."
"I reckon you don't. But if you was to go to Europe you'd see a raft of 'em hopping around."
"Do they hop?"
"Hop?—your granny! No!"
"Well, what did you say they did, for?"
"Shucks, I only meant you'd SEE 'em—not hopping, of course—what do they want to hop for?—but I mean you'd just see 'em—scattered around, you know, in a kind of a general way. Like that old humpbacked Richard."
"Richard? What's his other name?"
"He didn't have any other name. Kings don't have any but a given name."
"No?"
"But they don't."
 But say—where you going to dig first?"
"Well, I don't know. S'pose we tackle that old dead–limb tree on the hill t'other side of Still–House branch?"
"I'm agreed."
So they got a crippled pick and a shovel, and set out on their three–mile tramp. They arrived hot and panting, and threw themselves down in the shade of a neighboring elm to rest and have a smoke.
"I like this," said Tom.
"So do I."
"Say, Huck, if we find a treasure here, what you going to do with your share?"
"Well, I'll have pie and a glass of soda every day, and I'll go to every circus that comes along.
"Well, ain't you going to save any of it?"
"Save it? What for?"
"Why, so as to have something to live on, by and by."
"Oh, that ain't any use. Pap would come back to thish–yer town some day and get his claws on it if I didn't hurry up, and I tell you he'd clean it out pretty quick. What you going to do with yourn, Tom?"
"I'm going to buy a new drum, and a sure–'nough sword, and a red necktie and a bull pup, and get married."
"Married!"
"That's it."
"Tom, you—why, you ain't in your right mind."
"Wait—you'll see."
"Well, that's the foolishest thing you could do. Look at pap and my mother. Fight! Why, they used to fight all the time. I remember, mighty well."
"That ain't anything. The girl I'm going to marry won't fight."
"Tom, I reckon they're all alike. They'll all comb a body. Now you better think 'bout this awhile. I tell you you better. What's the name of the gal?"
"It ain't a gal at all—it's a girl."
"It's all the same, I reckon; some says gal, some says girl—both's right, like enough. Anyway, what's her name, Tom?"

"All right—that'll do. Only if you get married I'll be more lonesomer than ever."
"No you won't. You'll come and live with me. Now stir out of this and we'll go to digging."
They worked and sweated for half an hour. No result. They toiled another half–hour. Still no result. Huck said:
"Do they always bury it as deep as this?"
"Sometimes—not always. Not generally. I reckon we haven't got the right place."
So they chose a new spot and began again. The labor dragged a little, but still they made progress. They pegged away in silence for some time. Finally Huck leaned on his shovel, swabbed the beaded drops from his brow with his sleeve, and said:
"Where you going to dig next, after we get this one?"
"I reckon maybe we'll tackle the old tree that's over yonder on Cardiff Hill back of the widow's."
"I reckon that'll be a good one. But won't the widow take it away from us, Tom? It's on her land."
"SHE take it away! Maybe she'd like to try it once. Whoever finds one of these hid treasures, it belongs to him. It don't make any difference whose land it's on."
That was satisfactory. The work went on. By and by Huck said:
"Blame it, we must be in the wrong place again. What do you think?"
"It is mighty curious, Huck. I don't understand it. Sometimes witches interfere. I reckon maybe that's what's the trouble now."
"Shucks! Witches ain't got no power in the daytime."
"Well, that's so. I didn't think of that. Oh, I know what the matter is!  You got to find out where the shadow of the limb falls at midnight, and that's where you dig!"
"Then consound it, we've fooled away all this work for nothing. Now hang it all, we got to come back in the night. It's an awful long way. Can you get out?"
"I bet I will. We've got to do it to–night, too, because if somebody sees these holes they'll know in a minute what's here and they'll go for it."
"Well, I'll come around and maow to–night."
"All right. Let's hide the tools in the bushes."
The boys were there that night, about the appointed time. They sat in the shadow waiting. It was a lonely place, and an hour made solemn by old traditions. Spirits whispered in the rustling leaves, ghosts lurked in the murky nooks, the deep baying of a hound floated up out of the distance, an owl answered with his sepulchral note. The boys were subdued by these solemnities, and talked little. By and by they judged that twelve had come; they marked where the shadow fell, and began to dig. Their hopes commenced to rise. Their interest grew stronger, and their industry kept pace with it. The hole deepened and still deepened, but every time their hearts jumped to hear the pick strike upon something, they only suffered a new disappointment. It was only a stone or a chunk. At last Tom said:
"It ain't any use, Huck, we're wrong again."
"Well, but we CAN'T be wrong. We spotted the shadder to a dot."
"I know it, but then there's another thing."
"What's that?".
"Why, we only guessed at the time. Like enough it was too late or too early."
Huck dropped his shovel.
"That's it," said he. "That's the very trouble. We got to give this one up. We can't ever tell the right time, and besides this kind of thing's too awful, here this time of night with witches and ghosts a–fluttering around so. I feel as if something's behind me all the time; and I'm afeard to turn around, becuz maybe there's others in front a–waiting for a chance. I been creeping all over, ever since I got here."
"Well, I've been pretty much so, too, Huck. They most always put in a dead man when they bury a treasure under a tree, to look out for it."
"Lordy!"
"Yes, they do. I've always heard that."
"Tom, I don't like to fool around much where there's dead people. A body's bound to get into trouble with 'em, sure."
"I don't like to stir 'em up, either. S'pose this one here was to stick his skull out and say something!"
"Don't Tom! It's awful."
"Well, it just is. Huck, I don't feel comfortable a bit."
"Say, Tom, let's give this place up, and try somewheres else."
"All right, I reckon we better."
"What'll it be?"
Tom considered awhile; and then said:
"The ha'nted house. That's it!"
"Blame it, I don't like ha'nted houses, Tom. Why, they're a dern sight worse'n dead people. Dead people might talk, maybe, but they don't come sliding around in a shroud, when you ain't noticing, and peep over your shoulder all of a sudden and grit their teeth, the way a ghost does. I couldn't stand such a thing as that, Tom—nobody could."
"Yes, but, Huck, ghosts don't travel around only at night. They won't hender us from digging there in the daytime."
"Well, that's so. But you know mighty well people don't go about that ha'nted house in the day nor the night."
"Well, that's mostly because they don't like to go where a man's been murdered, anyway—but nothing's ever been seen around that house except in the night—just some blue lights slipping by the windows—no regular ghosts."
"Well, where you see one of them blue lights flickering around, Tom, you can bet there's a ghost mighty close behind it. It stands to reason. Becuz you know that they don't anybody but ghosts use 'em."
"Yes, that's so. But anyway they don't come around in the daytime, so what's the use of our being afeard?"
"Well, all right. We'll tackle the ha'nted house if you say so—but I reckon it's taking chances."
They had started down the hill by this time. There in the middle of the moonlit valley below them stood the "ha'nted" house, utterly isolated, its fences gone long ago, rank weeds smothering the very doorsteps, the chimney crumbled to ruin, the window–sashes vacant, a corner of the roof caved in. The boys gazed awhile, half expecting to see a blue light flit past a window; then talking in a low tone, as befitted the time and the circumstances, they struck far off to the right, to give the haunted house a wide berth, and took their way homeward through the woods that adorned the rearward side of Cardiff Hill.


Providing just one primary function, 'readit' uses a set of reasonable heuristics to apply the appropriate reader function to the given file path. As long as the data file has an extension, and the data is (or can be coerced to be) rectangular, readit() can probably read it.
| Version: | 1.0.0 |
| Depends: | R (≥ 3.4.0) |
| Imports: | crayon (≥ 1.3.4), haven (≥ 1.1.1), jsonlite (≥ 1.5), readr (≥ 1.1.1), readxl (≥ 1.0.0), tools (≥ 3.4.3) |
| Suggests: | devtools (≥ 1.13.4), dplyr (≥ 0.7.4), knitr (≥ 1.19), rmarkdown (≥ 1.8), testthat (≥ 2.0.0) |
| Published: | 2018-03-13 |
| Author: | Ryan Price [aut, cre] |
| Maintainer: | Ryan Price <ryapric at gmail.com> |
| BugReports: | https://github.com/ryapric/readit/issues |
| License: | MIT + file LICENSE |
| URL: | https://github.com/ryapric/readit |
| NeedsCompilation: | no |
| Materials: | NEWS |
| CRAN checks: | readit results |
| Reference manual: | readit.pdf |
| Package source: | readit_1.0.0.tar.gz |
| Windows binaries: | r-devel: readit_1.0.0.zip, r-release: readit_1.0.0.zip, r-oldrel: readit_1.0.0.zip |
| OS X binaries: | r-release: readit_1.0.0.tgz, r-oldrel: readit_1.0.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=readit to link to this page.


For documentation, please see
/assets/swagger/swagger-ui/index.html
For old documentation, please see
/assets/docs/index.html
For work-in-progress javascript client, please see
/assets/coral-web-ui/dist/index.html


Main Page Name - Guide Page Name
Description
Dependencies
Parameters
Example
Albany Examples
External Links
Results
Put a description of the capability here. For example,
if the capability is a material model, outline the physics
of the model.
Any library dependencies that must be built with
Trilinos / Albany in order for this capability to be used
- Put
- html
- source
- generated
- by scripts/plHTML.py
- here
A real of the syntax from a file from Albany/examples
- list
- all
- Albany/examples
- that use this capability
Link to some external Links that
Some results if necessary


Double click to return to game.
| User | Score |
|---|
| Your High Score | |
|---|---|
| You don't have one yet! |
Use left and right arrows to move paddle.
Press space to start game.
Break all blocks.
1 point rewarded for each block
Every time a block is broken in between hitting the paddle, the amount of points given for breaking a block goes up by 1.


That means all your progress will be lost and you will be cancelling your attendance at {{ h_name }}. This action can't be reverted. Click below in order to delete your account.


SHIRALEE, THE (director: Leslie Norman; cast: Peter Finch (Jim Macauley), Dana Wilson (Buster Macauley), Rosemary Harris (Lily Parker), Tessie O'Shea (Bella), Elizabeth Sellars (Marge Macauley), Sidney James (Luke), Reg Lye (Desmond), George Rose (Donny), 1957-Australia)
Kids are notorious scene stealers, and as sharp a performance as was put on by Peter Finch, nevertheless, the kid still stole the show from him, as the native Australian, returning to Australia after successfully building a budding career in England, and from working with Laurence Olivier, and as rumored, having an affair with Mrs. Olivier, should be glad to be home again.
SHIRALEE could be at times a very penetrating and hard look at a proud and independent man, who has fallen more in love with the Aussie countryside and outback, than he has with settling down and being a responsible family man. Peter Finch is well up to the task of being this rugged individualist, Jim Macauley, who is known as a scagman, someone who seeks only temporary work and is more interested in moving about whenever he sees fit to.
At other times, the film drifts off into soapy sentimental territory, becoming contrived and not sure if it wants to be that honest and truthful about the bitter-sweet story it is telling.
The story is a rather plain one, Mac comes home to find his wife Marge (Sellars) in bed with the man she is living with, Donny (Rose), while he was away; and, in the same room, is his young daughter asleep, and the room is cluttered with beer bottles. He acts indignant, hears a lecture from his wife that he ignored her, as she says to him, what did you expect me to do, sit here and wait for you forever?
The girl's name is Buster (Dana), and she is cute, tempestuous, and hardy, the best reason for watching this film, as she becomes the Shiralee, which is the aborigine word, meaning a burden, and it is hearbreaking to see her on the road, as no matter what the hardship she shows an unspoken love for her father, who is aloof in his real love for her, but is won completely over by the film's end.
Mac retraces his previous routes, and as expected, we see them caught in many a tough situation, as they roam the country's back roads, with the father getting into a big fight, meeting up with colorful acquaintances again, meeting new colorful characters, going over some beautiful Australian scenic routes, as the father painstakingly is breaking the little girl into his routine. She takes solace in a doll one of Mac's friends gives her, which is used to compensate for her loneliness.
It is a movie made by Ealing, a British studio, that actually used mostly a British cast, making the film seem more British than Aussie. It is a film that Disney could have easily made; and, it should be noted that this film was made into a successful television sitcom.
The subplot did not play really well, that had Mac being kicked off a farm he previously worked at 7-years ago, even though Buster has a high fever, as the owner of the farm, who despises Mac for making his daughter Lily (Harris) pregnant and then leaving her, feels he has to do that. Mac didn't know that she was pregnant and that she had lost the baby.
There is also some comedy thrown into the mix, that acts to soften the story, as a couple (Bella & Luke) that are so good that they seem like the were created only for sitcoms, take Mac and Buster under their wing, and some contrived humor is squeezed out, before Mac leaves to get work in another town, and Buster refuses the comfort of a real bed this warm couple offers, and insists she go along with her dad as he searches for work.
The crises point of the film comes when Buster's mom gets a court date to prove that she would be a better parent than the father to the child, but Buster, when chasing after her father who fails to return home because he is with a woman, gets hit by a car, and it is touch-and-go whether she will live or die, as melodramatics take over and the film is now reduced to being a sentimental weepie, but it is still packed with enough sustaining power to make it a pleasant enough viewing, but no more than that.
REVIEWED ON 5/12/99 GRADE: C
Dennis Schwartz: "Ozus' World Movie Reviews"
<EMAIL_ADDRESS>http://www.sover.net/~ozus
=A9 ALL RIGHTS RESERVED DENNIS SCHWARTZ
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


Florida bill would let schools keep, administer naloxone
by Associated PressTALLAHASSEE, Fla. (AP) — A Florida bill would allow schools to be able to keep and administer naloxone to treat students who overdose on opioids.
The Senate Education Committee unanimously passed the bill on Tuesday. Naloxone is an opioid-blocking drug used to reverse the effects of an overdose.
RECOMMENDED:
- Bill would require Florida couples to read marriage guide before tying the knot
- Florida bill would allow counties to ban smoking on public beaches
- Florida bill would eliminate solitary confinement for juveniles in prison system
- Florida bill giving minors more time to report sex crimes gains momentum
Democratic Sen. Jason Pizzo said he decided to sponsor the bill after receiving an email from a 17-year-old high school student.
A legislative analysis of the bill says that 25 Florida children died of opioid overdose in 2017.
Schools that choose to keep naloxone would work with a licensed doctor to develop a protocol for its use.


Multiple Stories in One? How?
Gladwell, in his book, describes three laws:
When describing each law, he uses, you guessed it, stories as his lead-in to each of them. The best part is that he uses the same order and pattern of story explanations for every law. Here’s how it goes, with an example of each part from Chapter 2 (for spoiler avoiding purposes):
He starts off with a description of a real event to introduce the topic.
"On the afternoon of April 18, 1775, a young boy who worked at a livery stable in Boston overheard one British army officer say to another something about 'hell to pay tomorrow'" (Gladwell 30). 1
He then goes into experiments/statistics to prove his law, as well as to establish credibility and appeal to the logic of his audience to keep them engaged.
"In the late 1960s, the psychologisy Stanley Milgram conducted an experiment to find an answer to what is known as the small-world problem" (Gladwell 34). 1
And to wrap the chapter up, he reminds his readers of what just happened in the chapter.
"relying along the way on a small number of very special people: a few Salesmen and a man with the particular genius of both a Maven and a Connector" (Gladwell 88). 1
This follows the arrangement of the Classical Model to the T, if you haven't noticed already. Gladwell loves this arrangement, as he incorporates it in every chapter of his.
It's important to understand that the book is written in 2000. This means that Gladwell uses examples from back then that his audience, middle/high schoolers and above, would understand, like Sesame Street or Blue's Clues. If the book was written in recent years, there would be quite a few more options, like how Fortnite or other such video games tipped.
How easy is it to read, really?
It's easier than you think.
Take a quick look at this excerpt from the book:
“This was the legacy of Sesame Street: If you paid careful attention to the structure and format of your material, you could dramatically enhance stickiness. But is it possible to make a show even stickier than Sesame Street ?” (Gladwell 110). 1
Here’s what’s fascinating. He’s making a children’s show his focal point of explaining the Stickiness Factor, but look at the words he uses, like
- Attention
- Structure
- Format
- Material
Gladwell, through his methodical and logical diction, is laying out his ideas in an organized, professional manner, which makes readers overlook the fact that a children’s show was just used as evidence. This same logical diction is what directly contributes to the casual tone that Gladwell tries to keep, as he's trying to communicate to a very vast and general audience. That's what he's really good at: using ubiquitous references and credibly explaining them with high level diction, and that's what makes reading this book easy.


| Previous: kuṣ | Next: kūj |
present: kuvate [2.] kauti
verbal: -kūta AV.+ -kā́vam
derivatives: -kūti V.+ kaví V.+ kávīyas SV.
Used only with ā, except in niṣkā́vam, the belonging of which is doubtful (as is also that of kaví). RV. has -kava, kavatnú, kavārí, 'stingy', of questionable relationship. The grammarians set up roots 1ku, 2ku or kū, 'shout', giving them a full set of forms; and Nir. once uses their intens. kokūyate.


public class SP800SecureRandomBuilder
extends java.lang.Object
| Constructor and Description |
|---|
SP800SecureRandomBuilder()
Basic constructor, creates a builder using an EntropySourceProvider based on the default SecureRandom with
predictionResistant set to false.
|
SP800SecureRandomBuilder(EntropySourceProvider entropySourceProvider)
Create a builder which makes creates the SecureRandom objects from a specified entropy source provider.
|
SP800SecureRandomBuilder(java.security.SecureRandom entropySource,
boolean predictionResistant)
Construct a builder with an EntropySourceProvider based on the passed in SecureRandom and the passed in value
for prediction resistance.
|
| Modifier and Type | Method and Description |
|---|---|
SP800SecureRandom |
buildCTR(BlockCipher cipher,
int keySizeInBits,
byte[] nonce,
boolean predictionResistant)
Build a SecureRandom based on a SP 800-90A CTR DRBG.
|
SP800SecureRandom |
buildHash(Digest digest,
byte[] nonce,
boolean predictionResistant)
Build a SecureRandom based on a SP 800-90A Hash DRBG.
|
SP800SecureRandom |
buildHMAC(Mac hMac,
byte[] nonce,
boolean predictionResistant)
Build a SecureRandom based on a SP 800-90A HMAC DRBG.
|
SP800SecureRandomBuilder |
setEntropyBitsRequired(int entropyBitsRequired)
Set the amount of entropy bits required for seeding and reseeding DRBGs used in building SecureRandom objects.
|
SP800SecureRandomBuilder |
setPersonalizationString(byte[] personalizationString)
Set the personalization string for DRBG SecureRandoms created by this builder
|
SP800SecureRandomBuilder |
setSecurityStrength(int securityStrength)
Set the security strength required for DRBGs used in building SecureRandom objects.
|
public SP800SecureRandomBuilder()
Any SecureRandom created from a builder constructed like this will make use of input passed to SecureRandom.setSeed() if the default SecureRandom does for its generateSeed() call.
public SP800SecureRandomBuilder(java.security.SecureRandom entropySource, boolean predictionResistant)
Any SecureRandom created from a builder constructed like this will make use of input passed to SecureRandom.setSeed() if the passed in SecureRandom does for its generateSeed() call.
entropySource
- the SecureRandom acting as a source of entropy for DRBGs made by this builder.predictionResistant
- true if the SecureRandom seeder can be regarded as predictionResistant.public SP800SecureRandomBuilder(EntropySourceProvider entropySourceProvider)
Note: If this constructor is used any calls to setSeed() in the resulting SecureRandom will be ignored.
entropySourceProvider
- a provider of EntropySource objects.public SP800SecureRandomBuilder setPersonalizationString(byte[] personalizationString)
personalizationString
- the personalisation string for the underlying DRBG.public SP800SecureRandomBuilder setSecurityStrength(int securityStrength)
securityStrength
- the security strength (in bits)public SP800SecureRandomBuilder setEntropyBitsRequired(int entropyBitsRequired)
entropyBitsRequired
- the number of bits of entropy to be requested from the entropy source on each seed/reseed.public SP800SecureRandom buildHash(Digest digest, byte[] nonce, boolean predictionResistant)
digest
- digest algorithm to use in the DRBG underneath the SecureRandom.nonce
- nonce value to use in DRBG construction.predictionResistant
- specify whether the underlying DRBG in the resulting SecureRandom should reseed on each request for bytes.public SP800SecureRandom buildCTR(BlockCipher cipher, int keySizeInBits, byte[] nonce, boolean predictionResistant)
cipher
- the block cipher to base the DRBG on.keySizeInBits
- key size in bits to be used with the block cipher.nonce
- nonce value to use in DRBG construction.predictionResistant
- specify whether the underlying DRBG in the resulting SecureRandom should reseed on each request for bytes.public SP800SecureRandom buildHMAC(Mac hMac, byte[] nonce, boolean predictionResistant)
hMac
- HMAC algorithm to use in the DRBG underneath the SecureRandom.nonce
- nonce value to use in DRBG construction.predictionResistant
- specify whether the underlying DRBG in the resulting SecureRandom should reseed on each request for bytes.


Sales
Add New Branch
City Name
Minmum Customers
Maximum Customers
Average Sales
Salmon's cookie sales


Gaze Behavior Analysis and Gaze Position Prediction in Immersive Virtual Reality
In virtual reality (VR) systems, users’ gaze information has gained importance in recent years. It can be applied to many aspects, including VR content design, eye-movement based interaction, gaze-contingent rendering, etc. In this context, it becomes increasingly important to understand users’ gaze behaviors in virtual reality and to predict users’ gaze positions. This paper presents research in gaze behavior analysis and gaze position prediction in virtual reality. Specifically, this paper focuses on static virtual scenes and dynamic virtual scenes under free-viewing conditions. Users’ gaze data in virtual scenes are collected and statistical analysis is performed on the recorded data. The analysis reveals that users’ gaze positions are correlated with their head rotation velocities and the salient regions of the content. In dynamic scenes, users’ gaze positions also have strong correlations with the positions of dynamic objects. A data-driven eye-head coordination model is proposed for realtime gaze prediction in static scenes and a CNN-based model is derived for predicting gaze positions in dynamic scenes.
Our related work on gaze analysis and prediction in virtual reality:
DGaze: CNN-Based Gaze Prediction in Dynamic Scenes
Temporal Continuity of Visual Attention for Future Gaze Prediction in Immersive Virtual Reality
SGaze: A Data-Driven Eye-Head Coordination Model for Realtime Gaze Prediction


I built a nanode application for photovoltaic systems. Very nice!
In case of commercial use, I'd like to know if there are any plastic case for nanode that is easy to buy.
Besides, what do you suggest for optical pulse reader?
I used the TSL257 and it is OK! But I'm looking for a prebuilded sensor with cable. Somthing ready to sell...
I saw on the market industrial pulse reader (e.g. CurrentCost optismart) with very nice pulse reader, with cable...
Do you know where is possible to buy something like this?
Thanks a lot
mau
Re: Nanode case and pulse reader
There are a few Nanode cases knocking about the internet:
http://www.thingiverse.com/thing:10071
http://www.skpang.co.uk/catalog/acrylic-case-for-nanode-p-974.html
I don't know of any ready built optical sensors with the jack plug already on. I use the TSL257 and solder on the jack plug myself.
I would love to hear about your system. Have you used an emonTx. It would be great if you could post a few photos and some information. You can either post here or create a section in the 'builds' section of the website.
All the best, Glyn.
Re: Nanode case and pulse reader
Dear Glyn,
my system is simple: it's just a nice nanode with an optical receiver connected to the Energy Meter for photovoltaic systems.
The firmware is able to catch pulses, sending to pachube and on my aniketos server,and checking real time if the PV system is working good or not (based on GPS, sun position, meteo conditions, tilt, azimuth, etc) without any other expensive sensors.
Furthermore, it will be integrated on PVTEST iphone App (very succesfull, with more than 20.000 downloads in few weeks).
I did hand made...
Now I would like to produce a short quantity to sell, and I'm looking for a good way to do this.
opinions, advice, suggestions welcome!
bye Maurizio
Re: Nanode case and pulse reader
Maurizio, your app appears to provide the 'theoretical best output' by calculating panel azimuth, angle and location, but cannot take account of clouds, haze and poor visibility.
The day's when we get cloudless day's in the UK are very few and far between, and even then, many have high cloud which can easily reduce generated power by 10 - 20% which seriously undermine your apps accuracy.
So why would I spend £2.99p for your full app, when I could download Hubcape from iTunes for 59p which reads data directly from Pachube and provides instant and hystorical data in chart form? (or am I missing something....?)
I use Openenergymonitor and upload it to Pachube via a Nanode - feed number 34843 if you are interested.
Re: Nanode case and pulse reader
Dear pauldreed,
first of all, I thank you for your question. You help me to clarify the goal of my PVTEST app.
1. METEO CONNDITIONS
PVTEST provide 'theoretical best output' in terms ofe meteo situation. It can be usefull to test your general performance, in case of sunny day. I know that is not common in many countries like UK, but in Italy or other countries in southern Europe is more easy to have sunny day, and there are also huge number of PV customers (because there is sun). In PVTEST Pro you can have also METEO condition on your city, and app give you a worning message if the estimation can be good or not, due to clouds. I'm working on next release that give customers better info about clouds.
2. PRICE
PV TEST BASIC can be for FREE or PVTEST PRO @3.99€. I think that there is no other choise for that price. All the other opportunities (e.g. Hubcape) has to combined with price of some electronic device. I think also that is not possibile to compare those applications because they answer different customer demand. PVTEST is the simplest test that you can do on performance of your PV plant related to other similar plant. NANODE device is a monitor device that can show you the production of your plant, but you don't know if, in this specific day, is working very good or quite good, because if you see, for example, 1.530W at 4p.m. in a sunny day, you don't know if it is the right figure or it should be at least 1.950W. With PV TEST you can answer that question.
I think that PV TEST combined with NANODE device give customers very good information on PV plant.
I hope this help to clarify. I will answer all other questions about this.
Bye
Maurizio


WITNESS LIST Health & Human Services Committee March 29, 2005 - 9:00A SB 45 Registering, but not testifying: For: Banning, Tom Lobbyist (Texas Academy of Family Physicians), Austin, TX Gunn, Cindy Advocacy Coordinator (Memorial Hermann Healthcare System), Houston, TX Herzog, Greg (Texas Medical Association), Austin, TX Kroll, Carrie Director of Advocacy (Texas Pediatric Society), Austin, TX Wall, Matt Associate General Counsel (Texas Hospital Association), Austin, TX Zamrazil, Kristie Senior Director, Public Affairs (Texas Pharmacy Association), Austin, TX On: Kirsh, Lisa Senior Policy Advisor (Health and Human Services Commission), Austin, TX Turney, Connie Project Director (Statewide Health Coordiation Council/Department of State Health Services), Austin, TX SB 66 FOR: Bland, Jennifer Hawks Director, State Government Relations (Consumer Healthcare Products Association), Washington, DC Gomez, Jenny Children's Counselor (Betty Ford Center and Texas Alliance for Drug Endangered Children), Irving, TX Hagerman, David Assistant Criminal District Attorney (Tarrant County Narcotics Prosecution), Fort Worth, TX ON: Nicolas, Ken Executive Director - Criminal Justice Division (Office of the Governor), Austin, TX Registering, but not testifying: For: Alexander, Larry Oklahoma State Trooper (Self), Altus, OK Dennis, Hilary Associate Director, Legislative Affairs (Texas Medical Association), Austin, TX Gaylor, Tom (Texas Municipal Police Association), Austin, TX Green, Linda Educator (Self), Devol, OK Hargraves, JoAnne Government Affairs (Schering-Plough External Affairs), Austin, TX Heikkala, Karen Licensed Vocational Nurse (American Civil Liberties Union of Texas), Austin, TX Hoke, Greg Government Affairs (Wyeth Pharmaceuticals), Kingwood, TX Jones, Robert Assistant Director, Government Relations (Pfizer), Austin, TX Kroll, Carrie Director of Advocacy (Texas Pediatric Society), Austin, TX Macha, Barry Wichita County District Attorney (Self), Wichita Falls, TX Mintz, David Vice President, Government Affairs (Texas Apartment Association), Austin, TX Newton, Chris Attorney (Texas Petroleum Marketers and Convenience Store Association), Austin, TX Peacock, Oren CVS/Pharmacy (Texas Federation of Drug Stores), Sachse, TX Reagan, Karen Vice President, Texas Retailers Association (Texas Retailers Association), Austin, TX Rumsey, Ronald Pharmacist (Self), Dallas, TX Spragins, John Police Officer (Wichita Falls Police Department), Wichita Falls, TX Zamrazil, Kristie Senior Director, Public Affairs (Texas Pharmacy Association), Austin, TX On: Bates, Joan Assistant General Counsel (Department of State Health Services), Austin, TX Brown, Janis Texas Department of Family and Protective Services (Texas Department of Family and Protective Services), Austin, TX Dokes, Charlotte Deputy Inspector General for Compliance (Health and Human Services Commission - Office of Inspector General), Austin, TX Herrman, Tim State Chemist and Director (Office of the Texas State Chemist), College Station, TX Hoestenbach, Roger Head of Feed and Fertilizer Control Service (Office of the Texas State Chemist), College Station, TX Kromrei, Elizabeth Child Protective Services Assistant Director (Texas Department of Family and Protective Services), Austin, TX Kunkel, Douglas State Police Officer (Texas Department of Public Safety), Austin, TX McKay, Mimi Martinez (Department of State Health Services), Austin, TX Miller, Travis Professor and Extension Specialist (Texas Cooperative Extension), College Station, TX Tannert, Karen Pharmacist (Texas Department of State Health Services), Austin, TX Providing written testimony: For: Staples, Mary Advocate (National Association of Chain Drug Stores), Southlake, TX SB 107 FOR: Alexander, Larry Oklahoma State Trooper (Self), Altus, OK Gomez, Jenny Children's Counselor (Betty Ford Center and Texas Alliance for Drug Endangered Children), Irving, TX Green, Linda Educator (Self), Devol, OK Hagerman, David Assistant Criminal District Attorney (Tarrant County Narcotics Prosecution), Fort Worth, TX Macha, Barry Wichita County District Attorney (Self), Wichita Falls, TX Pettibon, Chuck Valero Energy Corporation (Retail Merchandising - Valero), San Antonio, TX Spragins, John Police Officer - Narcotics Investigation (Wichita Fallas Police Department), Wichita Falls, TX ON: Bates, Joan Assistant General Counsel (Department of State Health Services), Austin, TX Peacock, Oren CVS/Pharmacy (Texas Federation of Drug Stores), Sachse, TX Tannert, Karen Pharmacist (Texas Department of State Health Services), Austin, TX Registering, but not testifying: For: Beckworth, Elmer District Attorney Cherokee County (Self), Rusk, TX Heikkala, Karen Licensed Vocational Nurse (American Civil Liberties Union of Texas), Austin, TX Landry, Mitch (Texas Municipal Police Association), Austin, TX Maxfield, Don Chief Felony Prosecutor, Ellis County (Ellis County District Attorney), Waxahachie, TX Newton, Chris Attorney (Texas Petroleum Marketers and Convenience Store Association), Austin, TX On: Kunkel, Douglas (Texas Department of Public Safety), Austin, TX Nicolas, Ken Executive Director - Criminal Justice Division (Office of the Governor), Austin, TX Providing written testimony: Against: Staples, Mary Advocate (National Association of Chain Drug Stores), Southlake, TX SB 130 ON: Zamrazil, Kristie Director, Public Affairs (Texas Pharmacy Association), Austin, TX Registering, but not testifying: Against: Arrington, Chris Executive Director (Self), Austin, TX Deerman, Helen President (National Chronic Pain Society), Houston, TX Grove, Melissa Executive Director (Legacy Counseling Center), Dallas, TX Hurt, Kathy Executive Director (The Arc of Dallas), Dallas, TX Kellogg, David Public Policy Director (Mental Health Association of Greater Dallas), Dallas, TX Pearce, Amber Policy Director (Texas Healthcare and Bioscience Institute), Austin, TX Suiter, Kim Vice President and Public Policy Director (Texas Chapters of National Multiple Sclerosis Society), Austin, TX Zobisch, Paul Publisher (The Seniors News Source), Dallas, TX On: Aragon, Steve Chief Counsel (Health and Human Services Commission), Austin, TX Kirsch, Lisa Senior Policy Advisor (Health and Human Services Commission), Austin, TX Peterson, Debbie Unit Manager - Professional Licensing (Department of State Health Services), Austin, TX Tannert, Karen Pharmacist (Texas Department of State Health Services), Austin, TX SB 460 FOR: Blum, Donald (Texas Podiatric Medical Association), Dallas, TX Brancheau, Steven Podiatrist (Texas Podiatric Medical Association), Greenville, TX Canlas, Bernabe Podiatric Foot and Ankle Surgeon (Podiatrists in Texas), Austin, TX Caporusso, Joseph Podiatrist (Texas Podiatric Medical Association), McAllen, TX Carpenter, Brian Podiatrist (Texas Podiatric Medical Association), Decatur, TX Dauphinee, Damien Podiatric Surgeon (Foot and Ankle Associates of North Texas), Lewisville, TX Glass, Bradford Podiatrist (Texas State Board Podiatric Medicine), Midland, TX Harkless, Lawrence Podiatrist (Self), San Antonio, TX AGAINST: Allen, Bohn (Texas Medical Association), Arlington, TX Brown, Marvin Orthopedic Surgeon (Texas Orthopedic Association), San Antonio, TX Callewart, Craig Surgeon (Texas Orthopedic Association), Dallas, TX Gill, John Orthopedic Surgeon (Texas Orthopedic Association), Dallas, TX Henricks, Susan Law (Texas Orphopedic Association), Austin, TX Norwood, Stephen Orthopedic Surgeon (Self), San Marcos, TX Rohack, Jim Cardiologist (American Medical Association), Bryan, TX ON: Zukowski, Jim Executive Director (Texas State Board of Podiatric Medical Examiners), Austin, TX Registering, but not testifying: For: Barrett, Michael Podiatrist (Texas Podiatric Medical Association and the Podiatry Group of South Texas), San Antonio, TX Canada, Don Executive Director (Texas Podiatric Medical Association), Austin, TX Falknor, Donald Podiatry (Self), Sugarland, TX Falknor, Nelda Podiatric Medicine (Texas Podiatric Medical Association), Houston, TX Goforth, Preston Podiatrist (Texas Podiatric Medical Association), Temple, TX Hanna, Mark Attorney (Texas Podiatric Medical Association), Austin, TX Hinjosa, Walter Texas AFL-CIO (Texas American Federation of Labor), Austin, TX Myer, Kevin Podiatrist (Texas Podiatric Medical Association), San Marcos, TX Richter, Krista Association Manager (Texas Podiatric Medical Association), Austin, TX Scuddey, Bruce Pediactric Surgeon (Self), El Paso, TX Against: Adkins, James OB/GYN (Self), Houston, TX Adkins, Linda Swan Legislative Consultant (Texas Society of Anesthesiologists), Houston, TX Banning, Tom Lobbyist (Texas Academy of Family Physicians), Austin, TX Bonner, Lindsay Texas Orthopedic Association (Texas Orthopedic Association), Austin, TX Bresnen, Steve Attorney (Federation of Texas Psychiatry), Austin, TX Bush, John Executive Director (Federation of Texas Psychiatry), Austin, TX Calvert, Raif Manager of Public Affairs (Texas Academy of Internal Medicine), Austin, TX Capelo, Jaime Legislative Consultant (PatientsFIRST Coalition), Austin, TX Duncan, Michael Association Executive (Texas Ophthalmological Association), Austin, TX Forbes, Tom Attorney (Texas Society of Anesthesiologists), Austin, TX Girard, Chuck Lobbyist (Texas Orthopedic Association), Austin, TX Kroll, Carrie Director of Advocacy (Texas Pediatric Society), Austin, TX Parker, Donna Executive Director (Texas Orthopedic Association), Austin, TX Pike, John Executive Director (Texas Ambulatory Surgery Center Society), Austin, TX Propes, Jay Consultant (Texas Orthopedic Association), Austin, TX Smoot, Brannan Physician, Orthopedic Surgeon (Texas Orthopedics), Austin, TX Tessen, Robert Executive Director (Texas Orthopedic Medical Association), Austin, TX Tredway, CJ (Federation of Texas Psychiatrists), Austin, TX Wallace, Jeseka Texas Orthopedic Association (Texas Orthopedic Association), Austin, TX On: Makan, Hemant Investigator (Texas State Board of Podiatric Medical Examiners), Austin, TX Providing written testimony: For: Bowman, Jeff Podiatric Physician (Self), Houston, TX Miller, Jason Podiatrist (Texas Podiatric Medical Association), Kingwood, TX SB 465 ON: Perry, Peggy Assistant Director of State Hospitals (Department of State Health Services), Austin, TX Registering, but not testifying: For: Brady, Denise Public Policy Analyst (Mental Health Association in Texas), Austin, TX Ferris, Beth (Texas Advocates for Nursing Home Residents), DeSoto, TX Gill, Raman Attorney (Texas Appleseed), Austin, TX Lovelace, Joe Executive Director (National Alliance for the Mentally Ill of Texas), Austin, TX Mitchell, Beth Attorney (Advocacy, Inc.), Austin, TX Rachofsky, Marcia Policy Analyst (Texas Mental Health Consumers), Austin, TX Stone, Susan Attorney, Psychiatrist (Self), Rosanky, TX On: Hopkins, Cindy Special Assistant to Medical Director (Department of State Health Services), Austin, TX SB 630 FOR: Bates, Jim Registered Pharmacist - Owner (Self), Marshall, TX Steinhauer, William Pediatric Dentist (Texas Dental Association), San Antonio, TX Registering, but not testifying: For: Bradford, Micheal Texas Claims Manager (EduCare), Austin, TX Culley, Robert (TrueCare (Independent pharmacists)), Austin, TX Dennis, Hilary Associate Director, Legislative Affairs (Texas Medical Association), Austin, TX Hernandez, Richard Director of Government Affairs for EduCare (EduCare Community Living), Austin, TX Kolodzey, Patricia Director, Insurance/Managed Care (Texas Hospital Association), Austin, TX Patel, A.J. Community Chain Pharmacy (Texas Federation of Drug Stores), Austin, TX Peacock, Oren CVS/Pharmacy (Texas Federation of Drug Stores), Sachse, TX Reagan, Karen Vice President (Texas Retailers Association), Austin, TX Rumsey, Ronald Pharmacist (Elam Road Pharmacy), Dallas, TX Smith, Carole Executive Director (Private Providers Association of Texas), Austin, TX Staples, Mary Advocate (National Association of Chain Drug Stores), Southlake, TX Wohlgemuth, Cristen Government Relations Coordinator (Texas Pharmacy Association, Academy of Independent Pharmacists), Austin, TX Zamrazil, Kristie Senior Director, Public Affairs (Texas Pharmacy Association), Austin, TX Zeniecki, Theresa Level of Need Manager (EduCare), Austin, TX On: Copeland, Rick Director - Medicaid Fraud Control Unit (Office of the Attorney General - Medicaid Fraud Control Unit), Austin, TX Dokes, Charlotte Deputy Inspector General for Compliance (Health and Human Services Commission - Office of Inspector General), Austin, TX Dokes, Charlotte Deputy Inspector General for Compliance (Health and Human Services Commission - Office of Inspector General), Austin, TX SB 726 FOR: Brown, John Teacher, Researcher in Preventive Dentistry (Texas Oral Health Network), San Antonio, TX Grant, Alicia Registered Dental Hygienist (Texas Dental Hygienists' Association), Dallas, TX Wright, Rebecca Registered Dental Hygienist (Texas Dental Hygiene Educator's Association), Beaumont, TX AGAINST: Steinhauer, William Pediatric Dentist (Texas Dental Association), San Antonio, TX Registering, but not testifying: For: Palermo, Lois Registered Dental Hygienist (Texas Dental Hygienists Association), League City, TX Valdez, Jerry Consultant (Texas Dental Hygienists Association), Austin, TX On: Schmidt, Bobby Executive Director (Texas State Board of Dental Examiners), Austin, TX Providing written testimony: Against: Kennel, Dietmar Dentist (Texas Academy of Pediatric Dentistry), Lubbock, TX SB 872 FOR: Allen, Bohn (Texas Medical Association), Arlington, TX Bailey, Charles Attorney (Texas Hospital Association), Austin, TX Berger, Ed Vice President (SETON Healthcare Network), Austin, TX Borow, Valarie Physician (Health Help), McKinney, TX DaSilva, Joe (Texas Hospital Association), Austin, TX Foster, Jon President, CEO (Saint David's Health Care System), Austin, TX Green, Shelton (Texas Association of Business), Austin, TX Pearson, David Vice President (Texas Organization of Rural and Community Hospitals), Austin, TX Rodgers, George Cardiologist (Texas Chapter American College of Cardiology, Heart Hospital of Austin), Austin, TX Slaton, Charlie President of MedCath, Inc. (MedCath, Austin Heart Hospital, Texsan Heart, Harlingen Medical Center), Charlotte, NC Thomas, John Hospital Executive (Baylor Health Care System and Affiliates), Dallas, TX Trout, Marcy Hospital Administration (Southwest Surgical Hospital), Flower Mound, TX Registering, but not testifying: For: Gill, John Orthopedic Surgeon (Individual), Dallas, TX McKissack, John Health Care Administration (Baptist St. Anthony's Health System), Amarillo, TX Pike, John Executive Director (Texas Ambulatory Surgery Center Society), Austin, TX Tesmer, David Vice President, Government Affairs (Texas Health Resources), Grand Prairie, TX Thompson, Matt Healthcare Management (Capital Physician Management), Austin, TX Against: Coppedge, Marc Healthcare Management - Physician Practice (Austin Diagnostic Clinic), Austin, TX On: Bednar, Cindy Manager (Department of State Health Services), Austin, TX SB 882 FOR: Cowen, Margaret CPA (Interagency Council on Autism), San Antonio, TX Garnett, Richard Counselor (Chair Interagency Council on Autism), Fort Worth, TX Registering, but not testifying: For: Herzog, Greg (Texas Medical Association), Austin, TX On: Johnstan, Mark Program Specialist Autism and Mental Retardation (Department of Aging and Disability Services), Austin, TX Weizenbaum, Jon (Texas Department of Aging and Disability Services), Austin, TX SB 1330 Registering, but not testifying: For: Caldwell, Jim (Texas Silver-Haired Legislators), Kingsland, TX Herzog, Greg (Texas Medical Association), Austin, TX Higgins, Carlos Retired (Texas Silver-Haired Legislature), Austin, TX Kaufman, Sanford Government Affairs (Sanofi Pasteur), Fort Worth, TX Sjoberg, Elizabeth Association General Counsel (Texas Hospital Association), Austin, TX On: Bednar, Cindy Manager (Department of State Health Services), Austin, TX McFarland, Jane State Employee (Texas State Board of Medical Examiners), Austin, TX Penfield, Susan Physician - Manager, Infectious Disease Control Unit, DSHS (Department of State Health Services), Austin, TX


| GEOS SDK TechDocs
|
|
| 2 The Mechanics of GCN
| 4 Application Local GCN Lists
GCNListAdd(), GCNListSend()
The system provides several lists for common system changes which might affect your application. After signing up on one of these lists (for example, the file change list) you will be notified by the kernel whenever the specified change occurs. In most cases, all you need to do is register for notification with
GCNListAdd()
and intercept the kernel's notification message.
The GCN mechanism performs its functions through a common series of steps. These steps are:
-
The object registers for notification with
GCNListAdd().
-
The change occurs.
-
The GCN mechanism is informed of the change by the acting party (in most cases this is the system itself, although a library may also send notifications). Applications do not send notifications at the system level.
-
The GCN mechanism dispatches notification messages to all interested parties with
GCNListSend()
.
-
The object is informed of the change.
If you need to perform some work related to this change, you should have a message handler to intercept the system messages.
Registering for System Notification
Handling System Notification
Removal from a System List
| GEOS SDK TechDocs
|
|
| 2 The Mechanics of GCN
| 4 Application Local GCN Lists


Rules for text input:
You must type < 100 words
No duplicate words
Alpha-numeric characters only
Submit Text