-
Common rounding. More...
#include <boost/math/tr1.hpp>
#include <boost/math/special_functions/fpclassify.hpp>
#include <boost/math/special_functions/sign.hpp>
#include <boost/math/distributions/students_t.hpp>
#include <boost/math/distributions/normal.hpp>
#include <boost/math/distributions/uniform.hpp>
#include <boost/math/distributions/triangular.hpp>
#include <boost/static_assert.hpp>
#include <boost/type_traits/is_floating_point.hpp>
#include <boost/concept_check.hpp>
#include "boost/quan/xiostream.hpp"
#include <iostream>
#include <iomanip>
#include <string>
#include <fstream>
#include <sstream>
#include <limits>
#include <locale>
Go to the source code of this file.
Enumerations | |
| enum | distribution_type { gaussian = 0, uniform = 1, triangular = 2, undefined = 3 } |
Functions | |
| BOOST_STATIC_ASSERT (std::numeric_limits< double >::is_iec559) | |
| BOOST_STATIC_ASSERT (std::numeric_limits< double >::is_specialized) | |
| std::ostream & | operator<< (std::ostream &os, std::pair< double, double > &p) |
| std::ostream & | operator<< (std::ostream &os, const std::pair< double, double > &p) |
| template<typename FPT > | |
| FPT | round_sig (FPT v, int n) |
| template<typename FPT > | |
| FPT | round_to_n (FPT v, int p) |
| template<typename FPT > | |
| std::string | round_f (FPT v, int sigdigits) |
| template<typename FPT > | |
| std::string | round_ms (FPT v, int m) |
| template<typename FPT > | |
| std::string | round_e (FPT d, int sigdigits) |
| template<typename FPT > | |
| std::string | round_ms (FPT v, signed int m) |
| double | round_nth (double v, unsigned int d) |
| double | round_1 (double v) |
| double | round_2 (double v) |
| double | round_3 (double v) |
| double | delta (double epsilon, double gamma, distribution_type distrib=gaussian) |
| double | gamma (double rounded, double value) |
| int | round_m (double epsilon=0.01, double sigma=0., unsigned int sigma_sigdigits=2U, distribution_type distrib=gaussian) |
| std::string | round_ue (double v, double sigma, double epsilon=0.01, unsigned int sigdigits=2U) |
| std::pair< double, double > | conf_interval (double mean, double sigma, double df=1., double alpha=0.05, distribution_type distrib=gaussian) |
| double | cdf_uni (double z) |
| double | quantile_uni (double alpha) |
| double | cdf_tri (double z) |
| double | quantile_tri (double alpha) |
| void | out_confidence_interval (std::pair< double, double > ci, int m, std::ostream &os=std::cout) |
| void | out_value_limits (double mean, double unc, std::pair< double, double > ci, int m, std::ostream &os=std::cout) |
| void | out_value_df_limits (double mean, double unc, int degfree=1, std::ostream &os=std::cout) |
Variables | |
| const unsigned int | maxdigits10 = std::numeric_limits<double>::max_digits10 |
| bool | scaled = true |
Common rounding.
http://www.diycalculator.com/popup-m-round.shtml#A3 all rounding types, including round-to-half and asymmetric and symmetric versions.
http://www.chem1.com/acad/webtext/pre/mm3.html "The purpose in rounding off is to avoid expressing a value to a greater degree of precision
than is consistent with the uncertainty in the measurement." "Observed values should be rounded off to the number of digits
that most accurately conveys the uncertainty in the measurement."
Definition in file rounding.hpp.
| enum distribution_type |
Definition at line 989 of file rounding.hpp.
| BOOST_STATIC_ASSERT | ( | std::numeric_limits< double >::is_iec559 | ) |
mainpage Proper rounding testbed documentation.
This is a testbed for the epsilon-Proper rounding for a few distributions assumed to be appropriate for the data observations.
Based on:
Gejza Wimmer, Viktor Witkovsky, Tomas Duby
Measurement Science and Technolology, 11 (2000) pages 1659-1665. ISSN 0957-0233 S0957-233(00)13838-X.
Proper rounding of the measurement results under normality assumptions.
Gejza Wimmer, Viktor Witkovsky, Proper rounding of the measurement result under the assumption of uniform distribution,
Measurement Science Review, Vol 2, section 1, (2002), pages 1 - 7.
Gejza Wimmer, Viktor Witkovsky, Proper rounding of the measurement result under the assumption of triangular distribution,
Measurement Science Review, Vol 2, section 1, (2002), pages 21 to 31.
| BOOST_STATIC_ASSERT | ( | std::numeric_limits< double >::is_specialized | ) |
| double cdf_tri | ( | double | z | ) |
Cumulative distribution function CDF of triangular distribution.
Gejza Wimmer, Viktor Witkovsky, Tomas Duby, Proper rounding of the measurement result under the assumption of triangular distribution, Measurement Science Review, Vol 2, section 1, (2002), page 24, equation 7.
| z |
Definition at line 1354 of file rounding.hpp.
| double cdf_uni | ( | double | z | ) |
Cumulative distribution Function of uniform distribution Un(-sqrt_3, + sqrt_3),
with an expectation of mean zero and variance unity. Gejza Wimmer & Victor Witkovsky, Measurement Science Review, volume 2 section 1 2002, page 3, equation 5.
Definition at line 1329 of file rounding.hpp.
| std::pair<double, double> conf_interval | ( | double | mean, |
| double | sigma, | ||
| double | df = 1. , |
||
| double | alpha = 0.05 , |
||
| distribution_type | distrib = gaussian |
||
| ) |
Calculate confidence interval for chosen alpha confidence level and chosen distribution type.
Uses confidence interval equations from:
Gejza Wimmer, Viktor Witkovsky, Tomas Duby Measurement Science and Technolology, 11 (2000) 1659-1665. ISSN 0957-0233 S0957-233(00)13838-X. Proper rounding of the measurement result under the assumption of gaussian distribution,
Confidence interval equation 6, p 1660.
Gejza Wimmer, Viktor Witkovsky, Tomas Duby
Measurement Science and Technolology, 11 (2000) 1659-1665. ISSN 0957-0233 S0957-233(00)13838-X.
Proper rounding of the measurement result under the assumption of triangular distribution,
Measurement Science Review, Vol 2, section 1, (2002), pages 21 to 31.
Confidence interval Equation 12, page 25.
Gejza Wimmer, Viktor Witkovsky,
Proper rounding of the measurement result under the assumption of uniform distribution,
Measurement Science Review, Vol 2, section 1, (2002), pages 1 - 7.
Confidence interval, page 5, equation 13.
| mean | Interval estimate for mean mu. |
| sigma | Standard uncertainty sigma from variance sigma. |
| df | Degrees of freedom (usually number of observations -1). |
| alpha | Confidence (0. < unc < 1.), typically 0.05 for 95% confidence. alpha/2 = 0.025 quantile = -1.96, and 1 - alpha/2 is 1.96 for normal distribution, so typically confidence interval is roughly twice unc either side (+ or - ) of mean. |
| distrib | Distribution type, Gaussian(default), uniform, triangular, laplace. |
std::pair
of double
.Definition at line 1230 of file rounding.hpp.
| double delta | ( | double | epsilon, |
| double | gamma, | ||
| distribution_type | distrib = gaussian |
||
| ) |
Calculate Wimmer delta function using equation 24, p 1664.
Gejza Wimmer, Viktor Witkovsky, Tomas Duby
Measurement Science and Technology, 11 (2000) pages 1659-1665. ISSN 0957-0233 S0957-233(00)13838-X.
Proper rounding of the measurement results under normality assumptions.
Gejza Wimmer, Viktor Witkovsky, Proper rounding of the measurement result under the assumption of uniform distribution,
Measurement Science Review, Vol 2, section 1, (2002), pages 1 - 7.
Gejza Wimmer, Viktor Witkovsky, Proper rounding of the measurement result under the assumtpion of triangular distribution,
Measurement Science Review, Vol 2, section 1, (2002), pages 21 to 31.
| epsilon | Proper-rounding increase of confidence interval because of rounding, must be positive and 'small'. |
| gamma | Ratio rounded / unrounded (gamma is assumed <= 1). |
| distrib | Distribution type, normal or gaussian(default), uniform, triangular, or laplace. |
Definition at line 999 of file rounding.hpp.
| double gamma | ( | double | rounded, |
| double | value | ||
| ) |
Calculate Wimmer gamma rounded/unrounded function p 1664.
Measurement Science and Technolology, 11 (2000) 1659-1665. ISSN 0957-0233 S0957-233(00)13838-X. Gejza Wimmer, Viktor Witkovsky, Tomas Duby Proper rounding of the measurement results under normality assumptions.
| rounded | Value (as double ) after rounding. |
| value | Value (as double ) before rounding. Assumes rounded < unrounded value . |
Definition at line 1082 of file rounding.hpp.
| std::ostream& operator<< | ( | std::ostream & | os, |
| std::pair< double, double > & | p | ||
| ) |
Output a pair of double
s, using < > angle brackets and comma separator, using current stream's precision..
Explicit specialization for std::pair
for double
s.
For example: <97.8725, 157.798>
| p | Pair of doubles. |
| os | std::ostream for string output. |
Definition at line 150 of file rounding.hpp.
| std::ostream& operator<< | ( | std::ostream & | os, |
| const std::pair< double, double > & | p | ||
| ) |
Output a pair of double
s, using < > angle brackets and comma separator, using current stream's precision..
Explicit specialization for const
std::pair
for double
s.
For example: <97.8725, 157.798>
| p | Pair of double to be output to stream os. |
| os | std::ostream for string output. |
Definition at line 162 of file rounding.hpp.
| void out_confidence_interval | ( | std::pair< double, double > | ci, |
| int | m, | ||
| std::ostream & | os = std::cout |
||
| ) |
Output to os, confidence interval enclosed in brackets and separated by comma.
The precision is controlled by the rounding order m
used for the mean but with one extra decimal digit of precision, so rounding to m-1 th place. For example: <99.5, 156.5> rounding to -1 position (where the mean was rounded with m == 0, using the units digit to round the tens digit to "128.")
| ci | Confidence interval or limits. |
| m | Signed position for rounding. |
| os | std::ostream for output. |
Definition at line 1396 of file rounding.hpp.
| void out_value_df_limits | ( | double | mean, |
| double | unc, | ||
| int | degfree = 1 , |
||
| std::ostream & | os = std::cout |
||
| ) |
Output mean, uncertainty and confidence interval. For example:
128. +/- 15 \<99.5, 156.5\>
| mean | Mean or central estimate of value. |
| unc | Uncertainty estimate as standard deviation. |
| degfree | Number of degrees of freedom. |
| os | std::ostream for output. |
Definition at line 1438 of file rounding.hpp.
| void out_value_limits | ( | double | mean, |
| double | unc, | ||
| std::pair< double, double > | ci, | ||
| int | m, | ||
| std::ostream & | os = std::cout |
||
| ) |
Output mean, uncertainty and confidence interval. For example:
128. +/- 15 <99.5, 156.5>
| mean | Mean or central estimate of value. |
| unc | Uncertainty estimate as standard deviation. |
| ci | Confidence interval as an interval. |
| m | Rounding position. |
| os | std::ostream for output. |
Definition at line 1415 of file rounding.hpp.
| double quantile_tri | ( | double | alpha | ) |
Quantile or Inverse of cumulative distribution function CDF of triangular distribution.
Gejza Wimmer, Viktor Witkovsky, Tomas Duby, Proper rounding of the measurement result under the assumption of triangular distribution, Measurement Science Review, Vol 2, section 1, (2002), page 24, equation 8.
| alpha | Confidence level. |
Definition at line 1378 of file rounding.hpp.
| double quantile_uni | ( | double | alpha | ) |
Quantile of uniform distribution Uniform(-sqrt_3, + sqrt_3), expectation or mean zero and variance unity.
Wimmer & Witkovsky, Measurement Science Review, volume 2 section 1 2002, page 3, eq 6.
Definition at line 1344 of file rounding.hpp.
| double round_1 | ( | double | v | ) |
round value v to 1 digit after decimal point, using 1st digit to round.
Definition at line 977 of file rounding.hpp.
| double round_2 | ( | double | v | ) |
round value v to 2 digit2 after decimal point, using 2nd digit to round.
Definition at line 981 of file rounding.hpp.
| double round_3 | ( | double | v | ) |
round value v to 3 digit2 after decimal point, using 3rd digit to round.
Definition at line 985 of file rounding.hpp.
| std::string round_e | ( | FPT | d, |
| int | sigdigits | ||
| ) |
Show only sigdigits
digits, in minimal scientific or 'e' format only, rounded asymmetric (round-half-up, arithmetic rounding).
Round asymmetric avoids values like 0.15, which cannot be stored exactly in binary IEEE 754 floating-point format and are stored internally as 1.499999999999, being rounded unexpectedly to 0.1 rather than 0.2. For example: format -1.2345e12 or 1.2345e-123.
d = 19.99;
cerr << setprecision(2) << d << endl; // 20 // rounded
cerr << fixed << setprecision(1) << d << endl; // 20.0 - rounded up.
cerr << fixed << setprecision(2) << d << endl; // 19.99 - 2 digits after decimal point.
cerr << scientific << setprecision(2) << d << endl; // 2.00e+001 - 2 digits after decimal point
Also remove all redundant exponent characters and digits, See http://en.wikipedia.org/wiki/Rounding .
std::numeric_limits<FPT>::max_digits10
in C++0x, or 2
+ std::numeric_limits<FPT>::digits * 3010/10000 if the platform implementation of C++ Standard IOstream library does not yet provide this. For 64-bit double, max_digits10
is 17, so write cout.precision(17)
. This will avoid any bias or loss of accuracy in statistical calculations caused by rounding.double
.defaultfloat
format - about 1/3 third of significand values in the range 0.0001 to 0.003894 are not input to the nearest representable double, but are 1-bit different.It is impracticable to test all floating-point values in a useful time, so random values were tested.
For details see:
This is very significant if you wish to 'round-trip' (outputting a value and reading it back in again) for example with lexical_cast or using Boost.Serialization. A test like
assert(value_output == value_reinput)
will fail very intermittently.
So if this is important to you, use the scientific (exponential) format with precision max_digits10 (17 for double) where random tests have not revealed any differences.
Logic of using C++ std printf-style rounding to start with a decimal digit string with rounded value of digits10, only the guaranteed correct digits to get the best estimate of the digit to be used for the final rounding. Hopefully, any imprecision caused by inexact presentation is (binary) rounded away.
| d | value to be converted to decimal digit string. |
| sigdigits | number of significant digits to show in string. |
sigdigits
decimal digits in exponential format.Definition at line 241 of file rounding.hpp.
| std::string round_f | ( | FPT | v, |
| int | sigdigits | ||
| ) |
Round floating-point value v
(fixed, not-exponential) to sigdigits
significant digits. This is variously called 'common rounding', 'round_5_up'.
Gejza Wimmer, Viktor Witkovsky, Tomas Duby
Measurement Science and Technology, 11 (2000) 1659-1665. ISSN 0957-0233 S0957-233(00)13838-X
Proper rounding of the measurement results under normality assumptions.
Uncertainty of measurement – Part 3: Guide to the expression of uncertainty in measurement (GUM:1995)
ISO Guide 98 (1995) and updated version 2008.
| v | Value to be converted to a decimal digit string, rounded to sigdigits significant digits. |
| sigdigits | Number of significant digits after rounding. |
std::string
containing decimal digit string, properly rounded.std::numeric_limits<double>::max_digits10
; which is maximum possibly significant, but only digit10
are guaranteed to be significant, so limit sigdigits
to digits10
(15 for IEEE 64-bit double).Definition at line 720 of file rounding.hpp.
| int round_m | ( | double | epsilon = 0.01 , |
| double | sigma = 0. , |
||
| unsigned int | sigma_sigdigits = 2U , |
||
| distribution_type | distrib = gaussian |
||
| ) |
Calculate the Wimmer rounding digit m using delta and gamma functions p 1661, equation 12.
Measurement Science and Technology, 11 (2000) 1659-1665. ISSN 0957-0233 S0957-233(00)13838-X. Gejza Wimmer, Viktor Witkovsky, Tomas Duby
Proper rounding of the measurement results under normality assumptions.
| epsilon | Rounding loss (as fraction) accepted (default is 0.01 or 1%). |
| sigma | Uncertainty as standard deviation. |
| sigma_sigdigits | Number of significant decimal digits for uncertainty to be rounded (range 1 to 4, default = 2), depending on degrees of freedom. If degrees_of_freedom <= 2, then 1, else if degrees_of_freedom > 1000, then 3 else default = 2. |
| distrib | Type of distribution (default gaussian, or triangular or uniform). |
m == 0
means use the units digit for rounding the tens digit.Definition at line 1109 of file rounding.hpp.
| std::string round_ms | ( | FPT | v, |
| int | m | ||
| ) |
| std::string round_ms | ( | FPT | v, |
| signed int | m | ||
| ) |
Round floating-point v (not-exponential) to order m. (m is the index of the rounder digit). This is variously called 'common rounding', 'round_5_up'.
Gejza Wimmer, Viktor Witkovsky, Tomas Duby
Measurement Science and Technology, 11 (2000) 1659-1665. ISSN 0957-0233 S0957-233(00)13838-X
Proper rounding of the measurement results under normality assumptions.
Uncertainty of measurement – Part 3: Guide to the expression of uncertainty in measurement (GUM:1995)
ISO Guide 98 (1995) and updated version 2008.
m
is the index of the rounder digit, that is the just insignificant digit used to decide if the m+1th digit is to be rounded up or left as is. So m == 0
means that the rounder digit is the units digits, used to round the tens digit, m == +1
the rounder is the tens digit, and the rounded digit is the hundreds digit m == -1
rounder is the tenths digit (0.1), rounding the hundredths digit (0.01).(Other authors specify the nth digit to be significant, where n = m + 1).
| v | Value to convert to decimal digit string after rounding. |
| m | Signed digit position to round. |
std::string
decimal digit string of rounded value.'sign' of NaNs cannot reliably and portably be tested using "x < 0" because all comparisons using NaN are false - by definition.
Definition at line 477 of file rounding.hpp.
| double round_nth | ( | double | v, |
| unsigned int | d | ||
| ) |
round value v to d digits after decimal point, using d+1 digit to round.
Definition at line 971 of file rounding.hpp.
| FPT round_sig | ( | FPT | v, |
| int | n | ||
| ) |
Returns v rounded to n significant decimal digits.
http://www.jason.mock.ws/wordpress/2007/02/22/round-a-float-to-of-significant-digits, David A. Pimentel
These use log10 and pow and so are vulnerable to binary rounding errors, as the value may not be exactly representable for the type specified. Should give the same value as printf precision. (int)(x < 0 ? x - 0.5 : x + 0.5)) So do we need to do something different for negative doubles? The difference between symmetric and asymmetric rounding?
Definition at line 184 of file rounding.hpp.
| FPT round_to_n | ( | FPT | v, |
| int | p | ||
| ) |
Round value v to p decimal digits after the decimal point. http://www.jason.mock.ws/wordpress/2007/02/22/round-a-float-to-of-significant-digits
| v | Value to round. |
| p | Number of decimal digits after the decimal point. |
Definition at line 223 of file rounding.hpp.
| std::string round_ue | ( | double | v, |
| double | sigma, | ||
| double | epsilon = 0.01 , |
||
| unsigned int | sigdigits = 2U |
||
| ) |
Properly round value to a decimal digit std::string
.
Measurement Science and Technolology, 11 (2000) 1659-1665. ISSN 0957-0233 S0957-233(00)13838-X.
Gejza Wimmer, Viktor Witkovsky, Tomas Duby, Proper rounding of the measurement results under normality assumptions. p 1661, equation 12.
| v | Central value, often estimate of mean. |
| sigma | Uncertainty of value, usually standard deviation. |
| epsilon | Fraction of loss of accuracy from rounding permitted (default 1%). |
| sigdigits | Number of digits that are significant (default 2). |
std::string
containing rounded value.Definition at line 1211 of file rounding.hpp.
| const unsigned int maxdigits10 = std::numeric_limits<double>::max_digits10 |
Definition at line 145 of file rounding.hpp.
| bool scaled = true |
Definition at line 717 of file rounding.hpp.


Facebook bug accesses iPhone camera while user scrolls
News Feed bug to be fixed ASAP
by Allen Kim, CNN(CNN) - Facebook says a bug that inadvertently accesses a user's iPhone camera while they're scrolling through the News Feed will be fixed sometime today.
The bug, which was discovered by Joshua Maddux, owner of web design firm 95Visual, appears to be exclusive to iOS and does not affect Android devices.
Maddux took to Twitter to report his discovery, where he posted a video that showed his camera, pointing forward, was running in the background while he was scrolling Facebook.
"I thought I had opened the camera by accident," Maddux wrote in an email to CNN of the discovery. "Then, on Saturday evening as I closed out a video on Facebook [I] saw the camera again on the left side."
Jerry Gamblin, principal security engineer at Kenna Security, was able to replicate the bug and told CNN "there is no indication that the data actually is transmitted to Facebook."
Reached for comment, Facebook confirmed the bug was "inadvertently introduced" and promised a fix was in the works.
"We have seen no evidence of photos or videos being uploaded due to this bug. We're submitting the fix for this to Apple today," a spokesman said.
Until the fix is officially approved, Gamblin recommends that users revoke camera access for the Facebook app until an update is available.
Facebook has been steadily working to win back user trust after a series of scandals, including the 2018 Cambridge Analytica scandal in which Facebook exposed up to 87 million users' information to the political analysis firm hired by Donald Trump's 2016 presidential campaign.
That data was later used for targeted political advertising.
A security firm also discovered that hundreds of millions of Facebook records were left exposed on Amazon cloud servers earlier this year.
CNN's Seth Fiegerman and Donie O'Sullivan contributed to this report


We have different rooms at your request.
Foods and resorces catered for i.e gym and library
We have had all these taken care of, we receive payment and make sure all our guest who have made an effort to book online have a good trip to our RESORT
We have three different means of transport.These are:


Time: 60 seconds
Try to answer the following questions within the timeframe. Keep in mind that incorrect answers will penalize your time by ten seconds!


Snowfall warning continues for Calgary; 15 cm expected by Wednesday
by Shawn KnoxCalgary and surrounding areas are under a snowfall warning which could last until Wednesday morning.
A low-pressure system that moved into Calgary early Tuesday morning is expected to bring 10 to 15 centimetres of snow.
Calgary road crews are currently focused on high-volume priority one roads (Crowchild, Memorial Drive, Glenmore) and these roads will continue to be plowed until the snow stops, which will then activate the city’s seven-day snow plan. The city is also using salt on the roads to help accelerate melting.
The city added that they do not anticipate needing to call for a parking ban on designated snow routes.
The snow is expected to taper off by Wednesday morning as the system moves into Saskatchewan.
Drivers in Calgary will have to deal with slippery streets and low visibility.
Weather agency Environment Canada is also reminding drivers to prepare for quickly changing conditions as highways and roads may be difficult to drive on as the snow accumulates. The agency is also reminding people to turn on their headlights if visibility is reduced and follow at a safe distance.
According to 511 Alberta, all the Highways around Calgary are currently covered in snow and ice.
The wintery weather is not expected to last that long. By Thursday, Environment Canada is predicting sunny skies for Calgary with a high of 7 C.
The bad news? The Weather Network is predicting a winter for Calgary that’s slightly colder and snowier than average.
https://twitter.com/Jonleescholes/status/1196872866509144064


Javascript Workshop
Javascript Challenge 2021
Workshop #1 | Shapes
Workshop #2 | Sales
Workshop #3A | Promedio
Workshop #3B | Mediana
Workshop #3C | Moda
Workshop #4| Salaries


First name:
Last name:
Password:
Age:
Accept:
Sex:
Male
Female
Mercedes
Audi
BMW
Text area
Test
Test
TestTestTest
Test
Test test
te
st test


Raise the stakes while ensuring all customer rewards are profitabile to your business.
Equitability is designed from the ground up to cost effectively incentivize your customers to adopt move valuable behavior.
Need: Coffee shop giving away $10 in revenue per referral and seeing less than 1% engagement.
Solution: Once-a-month “Recruit a Friend Week” which offers double loyalty point bonuses for you and your friend.
Result: Significantly higher engagement and 50%-75% less revenue used as incentives for referrals.


Terminal multiplexer, like screen only better IMO.
This book fast tracked me into it.
Manage tmux sessions
See My config.
http://www.thejach.com/view/2012/07/vims_learning_curve_is_wrong
Don't learn shortcuts or cheat sheets, it's a language
Be in normal mode as much as possible
| Key | Motion |
|---|---|
| ^ | Beginning of line |
| $ | End of line |
| 0 | First column |
i = in, a = all (around)
| Obj | Text object |
|---|---|
| iw | inside word |
| i( | Inside brackets |
| i" | Inside quotes |
| ip | Inside paragraph |
:h text-objects
Travelling Without Moving, Jamiroquai
| Command | Motion |
|---|---|
| f / F | Find char to right/left |
| t / T | Till char to right/left |
| ; | Repeat find/till |
| , | Repeat find/till in opposite direction/till in opposite direction |
| % | Find match |
Motions and verbs can be preceded with count.
| key | Verb |
|---|---|
| d | Delete with motion |
| c | Change. Delete by motion and switch to insert mode |
| y | Yank, aka copy, with motion |
| = | Format/filter |
| Command | Result |
|---|---|
| ci( | Change in () |
| cit | Change inside tag |
| c2t, | Change till 2nd comma |
| Action | Result |
|---|---|
| . | Repeat last change |
| =i{ | Format inside curly brackets (e.g: js, golang} |
| =it | Format inside tag |
| ci( | Change inside () |
| 5dd | Delete 5 lines |
| yat | Copy all tag |
| % | Find match |
| gq<motion> | Format to text width |
| CTRL-A, CTRL-X | Increment/Decrement numbers |
| :set rnu | Relative numbers |
| Action | Completion |
|---|---|
| CTRL-N | Simple completion from open buffers |
| CTRL-X CTRL-F | Filesystem completion |
| CTRL-X CTRL-O | Omni completion |
| Action | Result |
|---|---|
| m<lowercase letter> | Bookmark in current buffer |
| m<uppercase letter> | Bookmark Across buffers |
| `<letter> | Goto bookmarked letter |
| Bookmark | Meaning |
|---|---|
| . | Move to previous edit |
| , | Move to cursor position before jump |
| binding | Action |
|---|---|
| jj | <Esc> |
| , | <Leader> |
| <Leader>v | Load .vimrc |
| <Leader>V | Activate changes to .vimrc |
| <F2> | Close current split (window) |
| <Leader>S | Remove trailing whitespace |
| <CTRL>hjkl | Window movement commands |
| <Leader>d | Delete buffer, keep the split |
| -, + | Resize horizontal splits |
| <ALT>< <ALT>> | Resize vertical splits |
| <F9> | Toggle logical (RTL) editing |
IMO the worst part of VIM, plugins run synchronously
Buffer explorer
I prefer splits over tabs
Git wrapper, simply great
The Fugitive Series at VimCasts
And vim-lawrencium for mercurial
Aasynchronous commands dispatcher
When inside tmux, opens a split, runs in it and captures the output.
Fugitive will use it for :Gpush, :Gpull
:Dispatch ./manage.py compilemessages -l he
:Dispatch gulp test
all about "surroundings": parentheses, brackets, quotes, XML tags, and more.
Easily delete, change and add such surroundings in pairs.
Frontend for the ack command
Custom shortcut: g*
Syntax checking hacks for vim
Fuzzy file, buffer, mru, tag, etc finder
Custom shortcut: gr for CtrlPBufTag
Tree explorer
TextMate's snippets features in Vim
Insert or delete brackets, parens, quotes in pair.
Extended % matching for HTML, LaTeX, and many other languages.
MatchTag, highlight maching tag
Sublime Text style multiple selections for Vim
simplifies the transition between multiline and single-line code
extensible & universal commenting vim plugin that also handles embedded filetypes
gc<motion>
Or visual selection + gc
PyLint, Rope, Pydoc, breakpoints from box.
Trying it for python auto completion, navigation, etc
Also for Django's translations files
| \m Next untranslated string |
| \p Prev untranslated string |
| \c Copy msgid to msgstr |
https://github.com/MeirKriheli/dotvim
Learn, use, fork
Questions ?


U-571 (2000)
How much impact the Second World War has on contemporary culture is visible in Jonathan Mostow's story of submarine warfare, U-571.
I can remember watching films as a child, films like THE LONGEST DAY, THE BATTLE OF THE BULGE, PATTON and countless others; always, as in episodes of THE TWILIGHT ZONE, the Nazis were demonized, and the Allies were victorious.
Well, in U-571, this formula is touch-and-go: we don't know immediately if the American crew will be successful in raiding a stranded German sub; further, we don't know if they will survive at all when their S-class American submarine is torpedoed by yet another U-boat, forcing the handful of sailors to retreat into the German vessel that they were about to scuttle.
Perhaps what causes the story to float is the blend of a solid – though fictionalized – story, with a script that goes out of its way to avoid clichés. What's bound to happen in any story set aboard a sub does happen – the claustrophobic sets, the spraying water and floods, and even the popping rivets (or seals) a la DAS BOOT. Similar to Hitchcock's LIFEBOAT, it turns out they bring aboard a German saboteur. Otherwise, this new treatment makes a very plausible effort to speed along the plot with originality and a few scenes of fine acting.
Largely a part of the background, the premise follows the crew's efforts at capturing an `Enigma' encoding machine, a device that was enabling the German Navy to run roughshod over the Allied forces in the early years of the war. In fact, the American involvement in this particular treatment has drawn protest – as it was the British who mounted an astounding and ultimately successful effort at capturing the machines and breaking the code. Of course the real aim of U-571 is to thrill the audience, not to explain the finer points of history.
The finest performance available here is the Chief – the military equivalent of a foreman on a construction job – who is played by Harvey Keitel. With his blooming nose and stubbly mustache, Chief Klough helps to hold the story together. He has been at this type of warfare since the Great War – when he apparently worked aboard this same, now crumbling class of American sub (that is, the S-boat destroyed less than half-way into the narrative, a gutsy twist). Mixing unquestionable loyalty with uncanny intuition, the Chief excels at running the ship and at giving advice to the officer in command, Lieutenant Andrew Tyler (Matthew McConaughey). To put a spin on a line spoken by Keitel, this actor is welcome to play in any movie I pay to see.
Other outstanding performances are turned in by rock artist Jon Bon Jovi and Jake Walker – the two Americans fluent in German. Walker, as Lt. Hirsch, is at first touted as the key to the mission; later he actually freezes when German sailors are shouting greetings to the American boarding party. Walker is clearly good at playing multi-dimensional characters.
Matthew McConaughey has a harder time convincing us and gaining our sympathy. Tyler has a problem with not having received his own captaincy – blown out of the water, as it were, by his own skipper, Captain Dahlgren (Bill Paxton, another actor often challenged by the prospect of acting with believable naturalness). McConaughey often plays well off the characters around him, though he seems to try too hard during particularly stressful scenes.
A subtle and engaging effect occurs when U-571 is being attacked by depth charges. The hull of the submarine bows under the great pressure, but does not implode. Other effects include several exploding vessels; most of these detonations are convincing, but occasionally we see the blur of fake-y motion, just at the edges of the action. Computer generation has come a heck of a long way, but has not reached it final destination.
Fifty-five years after the war ended, Hollywood producers are still backing projects that highlight its battles, famous or not. A couple of years ago we watched SAVING PRIVATE RYAN and THE THIN RED LINE. No doubt we will see more, but why? Yes, there are repetitions of the rhetoric we have heard before: it was the last great and honest war, the American army was the most awesome war machine ever assembled, never was there a more noble effort to preserve democracy…. But these narratives make just good stories, too. Granted, they are stories of the hunt, stories involving aggression and weaponry; but they are also the embodiment of values so many viewers hold important. War stories have always sold, and World War Two stories will continue to hold our interest.
As I write this review, I am watching Roger Ebert and this week's co-host (fellow `Tribune' employee Richard Roeper), both of whom are panning U-571. Although I do see some of what they are speaking, I still have to recommend the film for its engaging pace spurts of originality. Not as well-made as DAS BOOT, U-571 nevertheless undertakes a tough task – sustaining a story in a microcosm of society at war. And it is a good watch for the time it takes.
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


jQuery is a cross-platform JavaScript library designed to simplify the client-side scripting of HTML. jQuery is the most popular JavaScript library in use today, with installation on 65% of the top 10 million highest-trafficked sites on the Web. jQuery is free, open-source software licensed under the MIT License.
jQuery's syntax is designed to make it easier to navigate a document, select DOM elements, create animations, handle events, and develop Ajax applications. jQuery also provides capabilities for developers to create plug-ins on top of the JavaScript library. This enables developers to create abstractions for low-level interaction and animation, advanced effects and high-level, theme-able widgets. The modular approach to the jQuery library allows the creation of powerful dynamic web pages and Web applications.
The set of jQuery core features—DOM element selections, traversal and manipulation—enabled by its selector engine (named "Sizzle" from v1.3), created a new "programming style", fusing algorithms and DOM data structures. This style influenced the architecture of other JavaScript frameworks like YUI v3 and Dojo, later stimulating the creation of the standard Selectors API.
This is how you excecute a method on a specific class of element using jQuery:
$(".class").method();


TerminusDB: Importing, Reordering & Exporting a CSV
Remember Sarah? She’s a junior developer at Industrial Gizmos and Widgets. Her boss Nathan needs to figure out how to unwarble some widgets. It’s not an easy task and her senior team members don’t seem interested.
Industrial Gizmos and Widgets have some seriously antiquated IT systems and that makes everything harder.
The main gizmo and widget ERP is built on a DB2 that was first installed in 1986 when DB2 was still young. The database schema is out of control and the source code for the application has been lost. The only person that knows how to fix the DB2 was poached by IBM and they charge Industrial Gizmos and Widgets $2,500 per hour of her time.
The system is a mess.
Sarah thinks that what they really need is some sort of abstraction layer to allow them to better understand the important things in the ERP data — leave the DB2 chugging away and extract the key information into a knowledge graph. Much easier to manipulate and query once it’s there.
If they had such a tool, solving the warbled widgets problem would be relatively easy.
Sarah saw Cheuk’s ‘World of WOQLcraft’ stream on Twitch and thought she could use some of the methods to solve the warbled widgets problem.
After watching Cheuk’s videos, Sarah ran TerminusDB Quickstart.
She opened up a terminal (or Git Bash for a Windows user — Sarah runs Ubuntu) and ran:
git clone https://github.com/terminusdb/terminusdb-quickstart.git
cd terminusdb-quickstart
mkdir csvs
Sarah ran the following afterwards:
TERMINUSDB_LOCAL="$(pwd)/csvs" ./terminusdb-container run
Windows users can use this:
TERMINUSDB_LOCAL=$(cmd //c cd)\\csvs ./terminusdb-container run
The mkdir csvs command made sure that Sarah had a local directory - Sarah will save the output of this tutorial in that folder. That is also the purpose of the TERMINUSDB_LOCAL environment variable, it sets the directory for TerminusDB to mount to the local csvs directory.
After installing TerminusDB using Quickstart, Sarah opens the Console. The default address is http://<IP_ADDRESS>:6363/console.
The TerminusDB console appears in Sarah’s browser:
Sarah creates a new database so she can import and manipulate her warbled widgets CSV. She calls it ProjectSpreadsheet
.
Next Sarah wants to eyeball the data to see what she is dealing with. So she grabs the relevant csv extract. It is a mess:
Sarah quickly writes a short WOQL query to load the CSV into TerminusDB, filter the data to only contain the warbled widgets, and export a new CSV.
Sarah knows that the warbled widgets contain the date “1970–01–01T00:00:00” as the DB2 was set up in 1986 and no widgets could possibly have been created at the company at that time!
 She then hits run query
.
The query returned in just under 2 seconds and Sarah found the exported CSV in the csvs directory in the terminusdb-quickstart folder. All tidied up as well:warbled_widgets.csv
.
When she opens the CSV, Sarah found that it had been filtered just the way she wanted it:
Sarah took the csv and emailed it to her boss, Nathan. He rang her the next morning to thank her for her excellent work and, while he still called her Sandra, she was happy to have solved a meaningful problem.
Sarah thought — if I could do that so easily with TerminusDB, maybe I should take a deeper look.
See you soon for Episode 2!
Building the database of the future.


Scream Chad'z rating: *** (out of 4 = good) 1996, R, 111 minutes [1 hour, 51 minutes] [horror] starring: Neve Campbell (Sidney), Courtney Cox (Gail Weathers), Skeet Ulrich (Billy), Matthew Lillard (Stu), written by Kevin Williamson, produced by Cathy Konrad, Cary Woods, directed by Wes Craven.
Of all the genres out there, horror is probably the most difficult to work with in terms of making something really original (aren't they all about stupid teenagers getting hacked up?). Given that, you'd think satirizing the genre would be simple, but "Scream" disproves both of these ideas. It works as a wholly original horror film by, ironically, blatantly admitting it's a "Dead Teenager Movie" and exploiting itself.
The film opens in typical "slasher flick" style by depicting a girl (Drew Barrymore) home alone on a Friday night getting ready to watch some "scary videos" with her soon-to-be-arriving boyfriend. The phone rings and it's a guy with a scary, but somehow charming voice.  Since this is a horror film you know what's going to happen, but the script is so fluid and the scene shot with such plausibility you can't help but be caught up in the tension of it all. It's a 90s take on countless bad scenes of such from the 70s and 80s and it works.
In fact, this is how the film works as a whole. The horror genre is pretty much dead (no pun intended) as far as Hollywood is concerned, so what makes the film appealing is the realistic way it deals with the plot of masked-psycho-killer-on-the-loose-in-a-small-town. The main characters are mostly teens who grew up on "Dead Teenager" movies and look back at them with a more intelligent and mature manner. When they hear about the masked murderer they can't believe what's happening because it's so much like a movie but this time it's real (well, you know what I mean).
I'm afraid to describe any of the numerous details, even giving away the basic plot might be too much of a spoiler. Basically, it's the story of a girl named Sidney (Campbell) whose mother was raped and murdered a year ago, and now the masked murderer who killed the girl in the beginning is after her. Since this isn't a sequel to anything it's obvious the killer must be someone right under our nose, but who could it be?
Williamson's script, as directed by Craven makes every character seem like a suspect, not because they seem like they'd be a silent psychopath but because they don't (it's always the last person you suspect eh?). One by one, main and supporting characters are knocked off but done so in such close proximity to each other (in terms of physical space and elapsed time) it's impossible to tell who the killer is.
The only problem I had was the execution scenes where the characters always manage to fight back and stall the killer, but of course trap themselves in the process. Sometimes this seems just plain cheesy (why does only Sidney turn into a superhero but not the other victims?).
I'm not sure about the ending though. In one way you could say it follows the logical conclusion of the film when it reveals the killer and their motive, but in another way you could say it contradicts the entire premise by doing so. I found the ending to be a bit more surrealistic and violent than necessary. Maybe there shouldn't have been an ending at all, but since the entire film exploits itself in leading up to the ending I guess it makes sense.
"Scream" isn't a work of genius, but it's not a bad movie. Sometimes it tries too hard to make for suspense, but it works as a whole by constantly throwing plot twists and making us wonder what's going to happen next. When's the last time a horror movie did that?
Please visit Chad'z Movie Page @ http://members.aol.com/ChadPolenz - over 140 new and old movies reviewed in depth - not just quick capsules and blind ratings. Also, check out The FIRST Shay Astar Web Page @ http://members.aol.com/ChadPolenz/ShayAstar.html
e-mail<EMAIL_ADDRESS>(C)1997 Chad Polenz
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


Taylor Swift sets new record for all-time wins at 2019 American Music Awards
by Danny ClemensLOS ANGELES -- Taylor Swift made history at the 2019 American Music Awards on Sunday, shattering Michael Jackson's record for all-time AMA wins on the same night she was named Artist of the Decade.
Heading into the show, the "You Need to Calm Down" singer had racked up an impressive 23 career wins, putting her one trophy behind Michael Jackson's record 24 all-time wins. She needed one win to tie Jackson's record and two wins to set her own new record. (Country act Alabama also has a total of 23 wins under their belt.)
Early in the telecast, Swift beat out Billie Eilish and Ariana Grande for Favorite Album - Pop/Rock for "Lover." In the final moments of the show, she was also named Artist of the Year.
"The last year of my life has had some of the most amazing times and also some of the hardest things I've gone through...and a lot of them are things that haven't been public," Swift said as she accepted Artist of the Year. "I wanted to thank you so much for being the thing that has been a constant in my life."
Swift said she has recently felt like her "stock is either up or down and people either like you or they don't...but the people who hang in there for you are the ones that you will never forget," thanking "the fans who have hung in there for 15 years of me doing this."
"Thank you for being there and for caring," she said.
Swift was nominated in a total of five categories, only two of which were announced during the show. It was revealed after the telecast that Swift had also won Favorite Music Video, Favorite Female Artist (Pop/Rock) and Favorite Artist (Adult Contemporary). Click here to see a full list of 2019 American Music Awards winners and nominees.
Including her Artist of the Decade honor, Swift now has a total of 29 American Music Awards under her belt.
Swift, who has won more American Music Awards than any other act in the 2010s, was also crowned the Artist of the Decade during the show.
"The past decade has been incredible for this brilliant artist, and the best is yet to come," King added.
Swift said as she accepted the honor: "All any of the artists, or really anyone, in this room wants is to create something that will last...The fact that this is an award that celebrates a decade of hard work and of art, and of fun and memories -- all that matters to me is the memories that I have had with you guys, with you the fans, over the years. We've had fun, incredible, exhilarating, extraordinary times together. May it continue."
A video montage highlighted Swift's achievements on the charts, on tour and in business, and she performed a medley of her greatest hits that included appearances by Camila Cabello, Halsey, Misty Copeland and Craig Hall.
Swift had previously claimed in a Nov. 15 social media post that her planned performance at the show was put in jeopardy by Scott Borchetta and Scooter Braun, the owners of her master recordings. The two sides appeared to have worked out their differences following a series of conflicting reports in the days leading up to the show.
Swift won her first American Music Award in 2008 for Favorite Female Artist - Country. She's also been honored at various times in the pop, rock and adult contemporary genres for favorite song, album and tour in addition to her Artist of the Year wins and a 2015 Dick Clark Award For Excellence.
In 2018, Swift became the most decorated woman in American Music Awards history. She also set a new record for most Artist of the Year wins, which she won for the fifth time in 2019.
Here's a look at the 29 American Music Awards Swift has won through 2019:
- 2019: Artist of the Decade
- 2019: Artist of the Year
- 2019: Favorite Music Video (for "You Need to Calm Down")
- 2019: Favorite Female Artist - Pop/Rock
- 2019: Favorite Album - Pop/Rock (for "Lover")
- 2019: Favorite Artist - Adult Contemporary
- 2018: Artist Of The Year
- 2018: Favorite Female Artist - Pop/Rock
- 2018: Favorite Album - Pop/Rock (for "reputation")
- 2018: Tour of the Year
- 2015: Adult Contemporary Artist
- 2015: Pop/Rock Album (for "1989")
- 2015: Song of the Year (for "Blank Space")
- 2014: Dick Clark Award For Excellence
- 2013: Pop/Rock Female
- 2013: Artist Of The Year
- 2013: Country Album
- 2013: Country Female
- 2012: Country Female
- 2011: Artist Of The Year
- 2011: Country Album (for "Speak Now")
- 2011: Country Female
- 2010: Country Female
- 2009: Adult Contemporary Artist
- 2009: Artist Of The Year
- 2009: Country Album (for "Fearless")
- 2009: Country Female
- 2009: Pop/Rock Female
- 2008: Country Female
The Associated Press contributed to this report.


Director: Ms. Smita Shetty
+974 3328 7500
Secretary General: Mr. Jan Sedláček
+974 3355 2479 (Message or WhatsApp)
Maps:
Interactive Location:
Static Location and Directions:


costs intervention cost care health study visits obesity primary time training usual High {border-style Kids px;} #ffffff;} Health plan using costs, analyses children ($) counseling program study-related trial approach group analysis child data interventions perspective mean APCs care-based child. childhood costs. equipment estimates spent used visit (n = ) base conducted cost-effectiveness costing motivational parent practices reported results staff Economic Intervention LEAP case clinical considered interviewing medical micro-costing net parents pediatric prevention px; wage weight {font-family Care [], calculated estimated font-size overweight participants sensitivity societal use Parent U.S. [$, attended child, double; intervention, intervention. number phone practice total $]) APC Carter Cost-effectiveness Costs Haby Int Mean Med Moodie Pediatr Training United assess border-color border-width controlled cost/child dollars groups higher measure obesity: perspective. provider-incurred received reimbursement required solid; television {font-style {font-weight Act Cost Gold Press Price Provider-incurred Range Sensitivity States Suppl Swinburn Table Usual [$,, analyses. annuitized bold childcare courier; effective em; evaluation improve improving including life methods missing obese out-of-pocket perspective, possible pt;} rate relative responsible scales stadiometers trainer value valued visits. year


|
Solar
|
Matches two sets of descriptors based on geometric constraints. UUID: 389ece8b-9e29-45ae-bd60-de1784ff0931
More...
#include <SolARDescriptorMatcherGeometricOpencv.h>
Public Member Functions | |
| SolARDescriptorMatcherGeometricOpencv () | |
| SolARDescriptorMatcherGeometricOpencv constructor. | |
| ~SolARDescriptorMatcherGeometricOpencv () override | |
| SolARDescriptorMatcherGeometricOpencv destructor. | |
| FrameworkReturnCode | match (const SRef< SolAR::datastructure::DescriptorBuffer > descriptors1, const SRef< SolAR::datastructure::DescriptorBuffer > descriptors2, const std::vector< SolAR::datastructure::Keypoint > &undistortedKeypoints1, const std::vector< SolAR::datastructure::Keypoint > &undistortedKeypoints2, const SolAR::datastructure::Transform3Df &pose1, const SolAR::datastructure::Transform3Df &pose2, const SolAR::datastructure::CameraParameters &camParams, std::vector< SolAR::datastructure::DescriptorMatch > &matches, const std::vector< uint32_t > &mask={}) override |
| Match two sets of descriptors from two frames based on epipolar constraint. More... | |
| void | unloadComponent () override |
Matches two sets of descriptors based on geometric constraints. UUID: 389ece8b-9e29-45ae-bd60-de1784ff0931
| distanceRatio | distance ratio used to keep good matches. Several matches can correspond to a given keypoint of the first image. The first match with the best score is always retained. But here, we can also retain the second match if its distance or score is greater than the score of the best match * m_distanceRatio. |
| type: float; range : [0..MAX FLOAT]; default: default: 0.75f | |
| paddingRatio | |
| type: float; range : [0..MAX FLOAT]; default: 0.003f | |
| matchingDistanceMax | |
| type: float; range : [0..MAX FLOAT]; default: 500.f |
|
override |
Match two sets of descriptors from two frames based on epipolar constraint.
| [in] | descriptors1 | The first set of descriptors. |
| [in] | descriptors2 | The second set of descriptors. |
| [in] | undistortedKeypoints1 | The first set of undistorted keypoints. |
| [in] | undistortedKeypoints2 | The second set of undistorted keypoints. |
| [in] | pose1 | The first pose. |
| [in] | pose2 | The second pose. |
| [in] | camParams | The intrinsic parameters of the camera. |
| [out] | matches | A vector of matches representing pairs of indices relatively to the first and second set of descriptors. |
| [in] | mask | The indices of descriptors in the first frame are used for matching to the second frame. If it is empty then all will be used. |


About Me
A byte about me:
BIO
an accomplished Data Analyst and Cathodic Protection Technician.
Traveling as a CP Tech prepared me for the turmoils of the lowly Data Analyst (and fatherhood).
Layered by the sweaty life, I am a Rock Climber/Fly Fisher/Bow Hunter turned Full-Stack Software Engineer.
I am in constant need of a great challenge and I strive to find that
niche that allows me to make my mark on the world.
My Favourite language to work on is Python and I would love to colleborate on any kind of projects.
Mears Group
Data Analyst
• Creating reports from in-line inspection data to produce a comprehensive overview of pipeline integrity. • Developing new reports and delegate tasks to multiple field team members. • Successfully interpreted data to draw conclusions for managerial actions and strategies. • Proposing solutions to improve system efficiencies and reduce total expenses. • Effectively working and communicating in a team environment.
Mears Group
Technical Field Supervisor
• Supervised crew members surveying underground pipelines to identify areas of potential issues. • Collected data using techniques and equipment such as Direct Current Voltage Gradient (DCVG), Alternating Current Voltage Gradient (ACVG), Close Interval Survey (CIS), Pipeline Current Mappers (PCMs) and GPS systems • Analyzed and used CAD drawings for above ground surveys. • Conducted performance evaluations and provided training and motivation to make full use of individual capabilities and to meet changing system demands.
Harder Inc.
Retail Manager
• Performed all opening and closing procedures and responsibilities. • Directed supervision overall retail supervisors and hourly staff. • Successfully interpreted data to draw conclusions for managerial action and strategy. • Ensured that the store audits are maintained at or above an acceptable level. • Maintained inventory, managed expenses, and monthly/annual reports. • Ensured security and safety systems are in working order, including, but not limited to door locks, alarms, bank deposits, refunds, vouchers, and incident reports.


Day 6: Red
I remember back in the late-90s, after watching Wishbone and Where in the World is Carmen Sandiego? on my local PBS station, there would be this strange show where a flannel-clad man in a bucket hat would, among other things, coming up with comedic hacks to household chores. This was the strange world of The Red Green Show . It was a distinclty Candian show that despite being pretty dumb, was charming. I haven’t watched The Red Green Show in over 20 years, but when I was thinking about what to map for my Day 6 map, I suddenly had a memory of this show. I discovered that not only does Red Green hace a website, but he also tours! I found a list of his 2019 tour dates which included information about the date and location of each show. Through the combined magic of copy & paste and find & replace in Notepad, I was able to create a CSV containing a record of each tour stop.
Admittedly, it’s not the most interesting data, so I decided I’d use this opportunity to try and do some non-Web Mercator web mapping. I’d considered using D3.js - I may do so for another map - but I recalled that CARTO had at one time published a tutorial on non-Web Mercator web mapping. Sure enough, I found this great post from Mamata Akella written way back in 2015 on this topic . CARTO has changed quite a bit since then, but because PostGIS is the backbone of CARTO, the workflow Mamata described worked with minimal adjustment.
For my map,I imported my CSV of Red Green tour dates, which were then geocoded by CARTO. I also added Canadian provincial boundaries from
Natural Earth Data
. I wanted to use the North America Albers Equal Area Conic projection, but CARTO’s PostGIS implementation does not come with this projection included. Following Mamata’s guide I copied the SQL definition for this projection from
epsg.io
. From there it was just a matter of using PostGIS’s
ST_TRANSFORM()
to transform the geometry column for both the tour dates and Natural Earth data from Web Mercator to North America Albers Equal Area Conic. For styling, I opted for something simple, albeit unnecessarily elegant within the Red Green-verse.
I’ve opted to only embed an image of this map as the actual performance of the interactive version is not great. If you’d like to check for yourself, you can here here .


OOOPS...
The page you were looking for could not be found
This could be the result of the page being removed, the name being changed or the page being temporarily unavailable. This could be the result of the page being removed, the name being changed or the page being temporarily unavailable.
Troubleshooting
- If you spelled the URL manually, double check the spelling
- Go to our website’s home page, and navigate to the content in question
- Alternatively, you can search our website below


A technologist and creative person who has very keen interest in data science, user experience design, experience research and social media marketing.
Some of my hobbies includes DIY stuffs, problem solving, photography, gaming.
Connect with me:
Skills/Knowledge: Experience Design, Data Analysis, Data Visualisation, User Research, Prototyping, Wire-framing, Story-Boarding, Annotation, Usability Testing, Information Architect, User Flows, Project Management, Web Programming
Code: HTML5, CSS3, Ajax, JavaScript, JQuery, ASP, Java, SQL, Python.
Software: Tableau, PowerBI, Excel, Axure, InVision, Sketch, Figma, Adobe XD, Omnigraffle, Photoshop, Lightroom, PremierePro, Illustrator, Flash, Dreamweaver, InDesign, 3D Studio Max


|
| void | startWorld (const int length, const int width, const int height) |
| |
| void | saveWorld () |
| |
|
void | closeWorld () |
| |
|
void | setCube (const int x, const int y, const int z, const unsigned int cube) |
| |
|
unsigned int | getCube (const int x, const int y, const int z) |
| |
| unsigned int * | getCubePointer (const int x, const int y, const int z) |
| |
| RayTraceInfo | rayTraceCubes (const glm::vec3 startPos, const float rotationYaw, const float rotationPitch, const float reach) |
| |
| void | setSaveDir (const char *const __restrict dir) |
| |
| void | fillCubes (const unsigned int color, const int x, const int y, const int z) |
| |
| | World () |
| |
◆ World()
Initializes critical variables so they don't mess things up.
◆ fillCubes()
| void World::fillCubes |
( |
const unsigned int |
color, |
|
|
const int |
x, |
|
|
const int |
y, |
|
|
const int |
z |
|
) |
| |
Fills the cubes starting at the coords with the given color
◆ getCubePointer()
| unsigned int * World::getCubePointer |
( |
const int |
x, |
|
|
const int |
y, |
|
|
const int |
z |
|
) |
| |
Returns a pointer to the cube at the specified coords. Useful for quick operations with its memory location.
◆ rayTraceCubes()
| RayTraceInfo World::rayTraceCubes |
( |
const glm::vec3 |
startPos, |
|
|
const float |
rotationYaw, |
|
|
const float |
rotationPitch, |
|
|
const float |
reach |
|
) |
| |
Traces from the specified position to the first solid cube within reach distance. Returns the position of the cube and the previous position.
◆ saveWorld()
| void World::saveWorld |
( |
| ) |
|
saves the cube data in world/cubes.dat
◆ setSaveDir()
| void World::setSaveDir |
( |
const char *const __restrict |
dir | ) |
|
Specifies the folder in which to load/save level.dat and cubes.dat
◆ startWorld()
| void World::startWorld |
( |
const int |
length, |
|
|
const int |
width, |
|
|
const int |
height |
|
) |
| |
Starts the world, with the specified size if it is generating a new one.
◆ cubes
| unsigned int* __restrict World::cubes |
An array of all the cubes in the world, in the order of x, z, y.
◆ cubesDatPath
| char* __restrict World::cubesDatPath |
Relative path to cubes.dat.
◆ isNewWorld
Was the world newly created or loaded from a file?
◆ levelDatPath
| char* __restrict World::levelDatPath |
Relative path to level.dat.
◆ worldDir
| char* __restrict World::worldDir |
Folder that the world is stored in.
◆ worldHeight
| unsigned short World::worldHeight |
Height (y) of the world in cubes.
◆ worldLength
| unsigned short World::worldLength |
Length (x) of the world in cubes.
◆ worldWidth
| unsigned short World::worldWidth |
Width (z) of the world in cubes.
The documentation for this class was generated from the following files:
- /home/crystalvulpine/workspace/VoxelPlanet/VoxelPlanet/src/World.hpp
- /home/crystalvulpine/workspace/VoxelPlanet/VoxelPlanet/src/World.cpp


Setting up and configuring hugo-geo is as simple as changing a few values in your site config.toml
. Lets look at this example site's config and go over what
each of hugo-geo's site [params]
do.
If this guide doesn't answer your question it may be covered in the Hugo documentation.
baseurl = "http://replace-this-with-your-hugo-site.com/"
relativeURLs = false
languageCode = "en-us"
title = "My New Hugo Site"
disqusShortname = "shortcode-here"
paginate = 5
[taxonomies]
tag = "tags"
tutorial = "tutorials"
[params]
showglobe = true
favicon = "favicon.ico"
analytics = "code-here"
github = "https://github.com/alexurquhart"
twitter = "https://twitter.com/alexanderurq"
linkedin = "https://www.linkedin.com/profile/view?id=339355941"
email =<EMAIL_ADDRESS>profilepic = "img/profile.png"
title = "MY NAME"
subtitle = "MY HUGO BLOG"
[[params.navlinks]]
name = "About"
url = "about"
[[params.navlinks]]
name = "Blog"
url = ""
[[params.navlinks]]
name = "Tutorials"
url = "tutorial/"
The Spinning Globe
showglobe = true
Set this to false
and the spinning globe in the sidebar will not be rendered.
Favicon
favicon = "favicon.ico"
Copy your site's icon file to the static
folder of your site. Delete this parameter if you don't wish to display a favicon.
Analytics
In order to remain compatible with Hugo v0.14, the analytics shortcode is specified in the site params.
Social Links
github = "https://github.com/alexurquhart"
twitter = "https://twitter.com/alexanderurq"
linkedin = "https://www.linkedin.com/profile/view?id=339355941"
email =<EMAIL_ADDRESS>These social settings set the icon links in the sidebar. If you don't want to have a certain icon or link show up, simply remove it.
Sidebar Profile Picture
profilepic = "img/profile.png"
This is the path to the profile image shown in the sidebar, relative to the baseurl
Title & Subtitle
Either of these can be removed. If the title
param is removed, then the site title
will be used instead.
Nav Links
A customizable array of links that will appear in the sidebar, or dropdown menu when viewed on mobile. The URL is relative to the baseurl
.
Content Front Matter
There are few custom settings you can specify in your content front matter that will effect how hugo generates your site.
Syntax highlighting with hljs
Set highlight = true
in your post front matter to include highlight.js javascript and css.
Custom JS/CSS
Include custom CSS and Javascript on an individual piece of content like so:
scripts = [
"//cdnjs.cloudflare.com/ajax/libs/highlight.js/8.8.0/languages/go.min.js",
]
css = [
"//cdn.leafletjs.com/leaflet/v0.7.7/leaflet.css"
]
Posting Tutorials
In order for a tutorial
to show up on the /tutorials/
page list, it must have index = true
present in the front matter of the post.
New tutorial
's will not show up on the front page of the site, yet.
Multi-paged tutorial series can be accomplished by including links to each page of the tutorial on the page with index = true
.


{% extends "base.html" %} {% block title%} Research {% endblock %} {% block content %}
| Year | Project | Sponsoring Agency | Principal Investigator |
|---|---|---|---|
| Apr 95 - Mar 98 | Integrated Computer Aided Diagnosis Project | AICTE Thrust Area Scheme. (Rs. 7.70 lacs) | Dr. K.K Shukla |
| 1998-2000 | Advance Computer Architecture & Networking | AICTE(MODROB) (Rs 9.00 Lacs) | Dr. A.K Tripathi |
| 1998-2000 | Design of Intelligent Computing Systems & its Applications | AICTE (TAPTEC) (Rs 9.50 Lacs) | Dr. R.B Mishra |
| Fuzzy Systems | UGC ( Rs 0.45 Lacs) | Dr. Y.P Singh | |
| Software Engineering | UGC ( Rs 0.45 Lacs) | Dr. Y.P Singh | |
| Mar 99- Mar 01 | Neural Network Application To Machine Vision | AICTE project (Rs. 10.00 lacs) | Dr. K.K Shukla |
| July 02 -2005 (3 years) | Malaviya Center for Information Technology Localization | Dept. of Information Technology, Ministry of Communication & Information Technology (Rs. 1Crore) | Dr. K.K Shukla |
| Year | Project | Sponsoring Agency | Principal Investigator |
|---|---|---|---|
| April 2010- July 2014 | Design and Development of interactive E-content for the subject Digital Image Processing and Machine Vision Web link to project site: NMEICT E-Contents |
MHRD, New Delhi (Rs. 06.50 Lacs) | Dr. Rajeev Srivastava |
| April 2010- July 2014 | E-content for Video Processing | MHRD, New Delhi (Rs. 09.50 Lacs) | Dr. S.K. Singh |
| April 2010- July 2014 | E-content for High Performance Computing | MHRD, New Delhi (Rs. 04.75 Lacs) | Dr. R.S.Singh |
The Department faculty members are working in following research areas/specializations:
Artificial Intelligence, Neural Networks Database System, Data Mining, Web Mining, Social Networks Parallel/Distributed Computing Software Engineering, Software Reengineering Multiagent Systems, Semantic Web, Robotics Image Processing, Computer Vision, Biomedical Imaging Biometrics, Pattern Classification, Video Processing Computational Aspects of Bioinformatics Algorithms Design and Analysis of Algorithms High Performance Computing E-Learning Technologies Information Extraction, Text Summarization Natural Language Processing Information Retrieval Computational Liguistics and other related areas and its applications.
| S.no. | Name | Title of the Thesis/ Topics of Research | Status |
|---|---|---|---|
| 1. | Dr. M. V. N. K. Prasad | Domain Decomposition Based Image Compression | AWARDED |
| 2. | Dr. Arvind Kr. Tiwari | New Implementation Techniques of DWT and their Applications to Signal Denoising & Classification | AWARDED |
| 3. | Dr. P. Roychowdhury | New Tunneling Based Learning Algorithms For Neural Nets | AWARDED |
| 4. | Dr. Amitabh Wahi | Neural Network And Fuzzy Logic Applications in Some Classification Problems | AWARDED |
| 5. | Dr. Arvind Shrivastava | Application of Artificial Neural Network in Gas/Odor Identification Using Sensor Array | AWARDED |
| 6. | Dr. S. P. Sisodia | Neural Network Techniques with a Special Reference to Digital System Testing | AWARDED |
| 7. | Dr. P. K. Singh | Intelligent Heating Schedule Controller for SC Furnace (ISM) | AWARDED |
| 8. | Dr. B. R. K. Rao | On New Learning Techniques in Radial Basis Function Neural Networks and Their Applications | AWARDED |
| 9. | Dr. R.R.Das | Neuro-Fuzzy Classifiers for Identification of Gases / Odours | AWARDED |
| 10. | Dr.Pranab Kr. Muhuri | Task Scheduling in Real Time Systems with Fuzzy Uncertainty in Deadlines and Processing Times | AWARDED |
| 11. | Dr. Sandeep Agrawal | Intelligent Scheduling in Real Time Systems | AWARDED |
| 12. | Dr. Bhaskar Biswas | Web Mining | AWARDED |
| 13. | Dr. Abhigyan Dwivedi | Nominal Phrase in Sanskrit and English - A Machine Translation Algorithm | AWARDED |
| 14. | Dr. Mohanchur Sarkar | Performance Enhancement Algorithms for Satellite Interactive Network | AWARDED |
| 15. | Dr. Bharavi Mishra | Data-mining Techniques in Software Engineering | AWARDED |
| 16. | Dr. (Ms.) Mousumi Dhara | Algorithms for Mining Graphs and Sequences | AWARDED |
| 17. | Dr. (Ms.) Madhushi Verma | Heuristic Algorithms for Graphs | AWARDED |
| 18. | Mr. Jayadeep Pati | Software Quality Modeling | AWARDED |
| 19. | Mr. R.C. Pandey | Video Authentication | AWARDED |
| 20. | Ms. Mridula Verma | Large Scale Machine Learning | AWARDED |
| S.no. | Name | Title of the Thesis/ Topics of Research | Status |
|---|---|---|---|
| 1. | Dr. M. V. N. K. Prasad | Domain Decomposition Based Image Compression | AWARDED |
| S.no. | Name | Title of the Thesis/ Topics of Research | Status |
|---|---|---|---|
| 1. | Dr. M. V. N. K. Prasad | Domain Decomposition Based Image Compression | AWARDED |
| S.no. | Name | Title of the Thesis/ Topics of Research | Status |
|---|---|---|---|
| 1. | Dr. M. V. N. K. Prasad | Domain Decomposition Based Image Compression | AWARDED |
| S.no. | Name | Title of the Thesis/ Topics of Research | Status |
|---|---|---|---|
| 1. | Dr. M. V. N. K. Prasad | Domain Decomposition Based Image Compression | AWARDED |
| S.no. | Name | Title of the Thesis/ Topics of Research | Status |
|---|---|---|---|
| 1. | Dr. M. V. N. K. Prasad | Domain Decomposition Based Image Compression | AWARDED |
| S.no. | Name | Title of the Thesis/ Topics of Research | Status |
|---|---|---|---|
| 1. | Dr. M. V. N. K. Prasad | Domain Decomposition Based Image Compression | AWARDED |


Inspired by the incomparable Liz Fosslien
It's that time of the year.
But you've learned how to take care of yourself physically...
...and mentally.
Sometimes, you have mixed feelings.
But you know what really matters.
Ultimately, you're ready for the emotional ride.
And, hey, there's always next year.


Fintech enthusiast, currently advancing the state of equity derivatives investment solutions at Leonteq. I enjoy building and navigating systems with a sense of conscientiousness and deliberacy.
AHM AutoTraders
Arbitrage and noise trading bots, seeking profit while maintaining asset holdings
Facebook Batch Tools
Quick and dirty set of tools for Facebook power users and page admins
python-saxo
Python wrapper for Saxo Bank's OpenAPI
gtt-sdefense
Simple tower defense game, made in Java using the BAGEL graphics manipulation library


Description:
In a court of Equity, complainant Kissnochurn
Mullick attempts to gain recompense for
family property from his brother, Ramnarain
Mullick. Some violence is alleged. The
ongoing dispute has already been
arbitrated but remains unresolved. The court
orders that the complainant must amend the
bill to add the name of his mother, a partial
owner of the property, for the case to be tried.
Transcription:
Thursd 27 Nov 1788
In equity
Present
Chambers
Hyde &
Jones
Kissnochurn Mullick Complt
Against
Ramnarain Mullick
Mr. Martyn for Complt states the Prayer of the Bill which is that ye Deft may be
desired to come to an accot with ye Plf for the personal Estate of Permanundo
Mullick, and for the rents of the real Estate, and of all monies arising from the
earnings of the Complt and all prof Deft, and that ye Deft may pay to Plf what on such
Accot sd appear to be due to him, & assign over one 1/2 of all securities for any part
of 1 family estate and that ye Complt may be let into the passion of 1/2 of the real
Estate, whereof his fatr Permanundo
Died seized or possessed; & for genl relief.
The Bill states that on 31 Chort 1180 = 10 Apr 1774, Permanundo died in Calc possd of
est real & pl to the value of 200,000 SR, without will, leaving 6 children, viz ye
Complt then 18 yrs old, Deft then abt 30, (who is an Inhab of Calcutta & [three dots]
subj to the Jurisdiction &c) and 4 dautrs, who at the time of P's death were an
undivided Hindu family. That
By the Laws & Customs of Hindoos the whole of P's prop bec the jt prop of Complt & Deft,
their sisters being entitled to no share thereof, but a bare maintenance thereout,
that since the death of Permanundo & till the yr 1186 = AD 1780, they all contd to
live to [ill] as an undivided family; during which time Deft continued in Possion of
the whole estate & recd the profits thereof, & made
Great advantage by tradg with the same, without accounting with Plf; That Complt not only
suffered him to do so, but gave into his hands all the money which Compl himself earned
in the service of sevl English Gentlemen.
That about 1186 BS the Deft conceived a design to defraud G Prator, & ordered him to eat
separately which he did, but applied to some neighbours to interceded wth his brotr to
come to an account & division
Division of Property. That 3 persons who are named did interceded, & prevailed on Deft
to submit the Mtre to arbitr and Complt & Deft agreed upon one Modun Mohun Dutt who
consented to arbitrate, but when the Arb bond was prepared Deft flew off from the Agreemt
& refused to sign. That about the 25 Decr 1780, Complt was told one evening by Deft's
servants that they were ordered to hinder him from entering
The house, complt remonstrated whereupon he and his wife were beaten, and he and his
family turned into the street.
That Complt agn applied to his friends to interceded with Deft, who instead of attend
to it made a complaint to Mr. Justice Hyde, who summoned the now Complainant & he appeared,
when Mr. Just H advised an Arbiror & that Deft shod make Compl a monthly allowance till the
mre should be settled. Deft pretended to comply
& Modun Mohun Dutt & Ram Sunker Dutt, were chosen Arbrs but as soon as Deft was out of the
Judge's presence he refused either to submit to arbitration or to make Complainant any allowance.
That your Orator at length comd a suit at law in which he was non prosd
That all 1 books & papers having been in possession of Deft ever since the death of Permanundo,
ye Complainant cannot set forth an Account, but
He has set forth in Sched A a list of houses Lands & effects, which are a small part of
Permanundo's stated which at his death amounted to 2 lacks of S Rupees.
Friendly applications are then set forth.
Mr. Atkinson states the Answer.
Deft admits the undevided Hindo family as stated in the bill, that the fatr died intestate,
leaving Plf & Deft with their 4 Sisters
& their mother his wife, Tillukshima, but he denies that the fatr died possd of prop value
200,000 SR as charged, admits that he is an Inhabt of Calc & [3 dots] subjt to the Jurisd &c &
that the whole of the estate of ye Tatr including the family petmony, because the joint
Propy not of Plf & Deft only, but of Plf, Deft and their said motr subject to the maintenance
of the 4 sisters. That from the d of Permanundo until 1186 BS = AD1779, they all lived togr
As an und Hindo fam but he denies that during that time he recd the profitsof the whole family
Estate save as after mentd or that he made any profits by trading with the same, or that he ever
possd any of the fam Est exclusively or that he ever derived any benefit from the sd estate other
han by living on the ground jointly with the rest; that the Plf separated from the rest of the
family without any provo
Provoc from any part of it. He admits that there have been no division of the family Estate, the
whole thereof except that fam ho the ground adjoining & a garden having been ever since P's death
& still continues in the sep passion of P's widow, the Mor of Plf & Deft. That Plf & his wife
lived with the rest & were supported partly from the produce of sd ground & partly from bounty
Of Deft, the far's est not being sufft for that purpose, and he says that such support as he gave
to Complt out of his se pest was greater than he derived from the fam estate. Deft denies that
he or his mor or sisters were instrumental in making Plf quit the house, & says that that Plf's
apartmt still continues unoccupied. That from the d of P till Assin 1186 = Sept 1779 Plf & Deft
lived togr, & Plf never
Contributed anything to the support of the family tho it was in his power. That Deft has made
consid additions to the fam house both in his far's life & since his death, out of his own sep
estate.
Admits that Deft earnd money in the service of Engl Gent but denies that he ever put an of it
into his hands to be added to the common store that in Assin 1184= Sept 1777, just before the
great Hindu Holidays, Complt sent to Deft for the use
Of the family, some cloth, Gee & oil, for the use of the family to the amot of abot 70 RS &
Deft sent him in a shawl & piece of cloth w abot 90 RS denies that he ever wanted to defraud
Plf of his share of the estate, or that he ever ordered him to separate. That Plf by his own
choice ate separately for about 9 months before he left the house, but denies all ill treatment.
He denies that Plf was entitled to a moiety of the est & says that on a devision of the est
the motr will be eneitled to 1/3d thereof in
Her own right, which will leave one 3d each for Plf and Deft. That he belvs Plf did apply to
some of the neighbours to request him to come to an accot of 1/2 of deced far's estate & also of their
joint est acquired as well by their mutual earnings as from the use & profit of 1 Far's est but denies
that Plf's motices were those mentioned in the bill. Admits that Needy Kissno Ghosaul, Jugul Kissore
Hazerah, & Ramcany Meter did apply to him, & it is prob that they talked of the scandal of going to
Law, admits that our of respect to those psons
And to satisfy Plf, he was prevailed upon by them to submit to arbitr- that accordly Plf & Deft
pitched upon Modum Mohun Dutt who agreed to accept of the Argitr- admits also that he refused to
sign the bond & [three dots] by put an end to the reference, but he denies that he [three dots] by
flew off from the agreemt for he says that the 3 psons above named had mentioned only the family &
separate estate of the fatr and the inj done to the Plf by excluding him from the fam ho as the
Mres in dispute, & [three dots] when a writer of M.M. Dutt's was directed to draw up the agreemt &
Deft perceived that it related to his own private estate he obj to it, bec it wod have involved
him in trouble & Plf cod not with any reason lay claim to any of it. That he had infd those 3
persons that the fam ho & ground were the only parts that had ever been in his passion, the pers
Prop having always been a
Poss of the Mor.
He admits that abt 25 Decr 1780, Plf went to his duty in the New Buildings, but says he never
heard save by the bill, nor does he believe, that he was hindered by servts from entering or that
his w & he were turned into the street.
That Plf then withdrew from fam ho & went to that of Needy Kissno Gosaul.
Admits complt made by him to Mr. Just H. who recommended Arbitr-, and an allowance,
but denies that he agreed to it. He admits that M.M. Dutt & Ram Sunker Dutt were chosen
Arbitrators.
[single line]
It had been intimated before that this cause must probably go off for want of parties,
the mother not having been made a Defendant, and now
Mr. Justice Jones, after quoting Mr. Halhed's compilation Chap 2 sect 12, read his own
translation of the original text, from which the first words in that section of Mr. Halhed's
book are taken. Sir W. Jone's version of them runs thus
"After the civil or religious death of the father although the Sons have an absolute right
to his property, yet, while their mother lives, it is illegal for them to divide that property."
Sir William observed that the word which he has rendered by illegal, is [blank] which seems to
be equivalent to inofficiosum in latin and to import something more than not right or decent,
which is Mr. Halhed's phrase. It means inconsistent with civil & religious duty. Sir W. Jones
then read his own translation of an extract from the sacred text of Menu. (so he writes the name
It is in these words.
"After the death of both father & mother let
"the brothers meet and equally divide the paternal inheritance: while the parents live, they are
not masters of it." Sir William Jones then proceeds thus Gloss "From this text it appears, that
the brothers of the whole blood must divide the father's estate after the death of both parents;
that they cannot, at their own pleasure, divide it, while the mother is living; but that a legal
division must be made with her assent. If they are desirous of living together undivided, the
eldest brother (being of ability to transact business & keep house) shall take the whole: and the
other brothers shall live under him as under their father. So is the text of Menu, The eldest
bro shall ever take entire possession of the paternal estate the others shall live under him as
under a father."
The Judges seemed to think that it would be proper in this case to consult the Pundits, but
in the mean time they were all clearly of opinion that the mother ought to be made a defendant,
and though perhaps, in strickness, the Bill ought to have been dismissed for want of parties,
yet the Complainant being a pauper it was Ordered, with the consent of the Defendant's counsel,
that the Complainant be at liberty to amend his Bill by adding the name of the mother of the
Defendant Ramnarain Mullick as party Defendant thereto and that the Costs of bringing this
cause to a Hearing do abide the Event of the Suit


We got interfaces!
- scale impactful models
- reinvent robust action-items
- disintermediate bleeding-edge metrics
- optimize cross-media metrics
- innovate 24/365 communities
- benchmark killer networks
- utilize granular portals
- synthesize collaborative e-commerce
- embrace front-end networks
- extend proactive users
- scale enterprise architectures
- architect global e-markets


Welcome to Dillards Reporting System
Reference Links
Requirements Documentation
Data Migration Plan
Data Insertion Plan
Data Quality/Integrity Report
Data Access Plan
Please enter your login credentials
User ID:
Password:
Forgot Password?


Storefront
We've got the best fruit.
Dashboard
apple
Oranges
Bananas
Pears
Bananas
Buy
Sell
Pears
Buy
Sell
Apples
Buy
Sell
Oranges
Buy
Sell


Chris's Notes on The Instant Millionaire: A Tale of Wisdom and Wealth, Mark Fisher, New World Library, 1991. I recommend this book for folks that are willing to believe that the act of willing something to happen hard enough will make it happen.
On the one hand, I've solved many an engineering problem by simply letting my subconscious know that it needed solving. On the other hand, I've never been able to successfully wish for something to happen. The question is whether you view this book as channeling your subconscious energies into finding ways of making your dreams of financial independence come true or whether you view it as a fairy tale.


Problem Statement
You are given an undirected graph with n vertices numbered 0 through n-1.
For each valid i, there is an undirected edge connecting two different vertices x[i] and y[i].
No two edges connect the same pair of vertices.
A triangle is a set of three distinct vertices such that each pair of those vertices is connected by an edge.
Formally, three distinct vertices u,v,w are a triangle if the graph contains the edges (u,v), (v,w), and (w,u).
The graph has 2^n subsets of vertices (including the empty set).
A subset S of vertices is called triangle-free if and only if no three vertices in S form a triangle.
You are given the description of the graph: the int n and the int[]s x and y.
Compute and return the number of triangle-free subsets of vertices of the given graph.


Dr. Priyanka Joshi
Alzheimer and Interdisciplinary Research Scope in Biology
Biology,Physics Pilani-LTC 5103 (Telepresence Room), Sept. 7, 2018, 8:30 p.m.
Nicolas Rivron
Self Organizing Life
Biology Pialni Campus-LTC 5103, Aug. 23, 2018, 8:30 p.m
Dushka Zapata
How to spend your time well?
Other Pilani Campus-LTC 5103, Feb. 4, 2018, 8:30 p.m.


I want to help clean up the lot before it becomes a park. Could we get a clean-up group organized for this? I'm available on the weekends and after school on weekdays.


Exercise 3.
Colgate toothpaste was once fined for making the misleading claim that "80% of dentists recommend Colgate toothpaste."
Read about the case that was made against Colgate. How was their claim true? How was it misleading?
How could Colgate have more accurately represented the results of their survey? Create an advertising statement that uses the same survey information you researched in Item 3.9.3.a, but is not misleading.
When you hear a claim like Colgate's, why should you be suspicious about it? What particular parts of the claim sound "off"?


---
title: Samsung’s Mobile OS Dilemma
date: '2015-07-08T19:00:21+05:30'
tags:
- business
tumblr_url: https://sureshshanmugam.com/post/123548486195/samsungs-mobile-os-dilemma
---
Samsung’s Mobile OS Dilemma
Follow my blog for more - Analytics & Marketing


you gathered all the data you need regarding your education and your future job! Now it's the time to comparison all the data in one place! this Multi line Diagram will help you to compare several job's income at the same time. Simply check as many as jobs you want from the menu and compare the trends!
Comparison
Click on the following Majors to compare the salaries.


If there is anything we can help you with, please leave us a message and we will respond within 48 hours. Thanks for your interest in Lambda.


Doctor Who Season 12 Trailer: Shiny Unhappy Cybermen, Not Holding Hands
by Devon IvieNot to brag, but a Cyberman could most likely pummel a Cybertruck to death with only its helmet. Just the facts! In the trailer for Doctor Who’s upcoming 12th season, it’s the same as it ever was for the Doctor (Jodie Whittaker) and her merry band of TARDIS companions, as they continue to rack up some sweet frequent-flier miles with all that space and time travel. (1943 Paris? Ugh, think of the charcuterie.) But the steely, fiberglassy reemergence of an old foe threatens to ruin just about everything for the group, and not to mention — Stephen Fry and the Judoon might be causing some mischief, too. The new season will debut sometime in “early 2020.”


Hey!
I'm Adam Hageman, an LA-Based photographer, tinkerer and startup geek.
I've made people surprisingly happy at Photojojo, launched the most comprehensive guides to SXSW with Sched, combined humans + AI at SuperHuman, helped Samsung win a Shorty Award, connected you with experts on Operator, and taken the headache out of car rental with Skurt.
Let's grab a coffee.
Cool!
This screen will come at a later date when I've had time to finish this


Catastrophic recovery is necessary whenever your environment and/or database have been lost or corrupted due to a media failure (disk failure, for example). Catastrophic recovery is also required if normal recovery fails for any reason.
In order to perform catastrophic recovery, you must have a full backup of your databases. You will use this backup to restore your database. See the previous section for information on running back ups.

Delete the contents of your environment home directory (the one that experienced a catastrophic failure), if there is anything there.
Copy your most recent full backup into your environment home directory. If you are using subdirectories to store your log files, be sure to place the recovered log files back into the subdirectory from which they were originally backed up.
If you are using a backup utility that runs incremental backups of your environment directory, copy any log files generated since the time of your last full backup. Be sure to restore all log files in the order that they were written. The order is important because it is possible the same log file appears in multiple archives, and you want to run recovery using the most recent version of each log file.
Open the environment as normal. JE's normal recovery will run, which will bring your database to a consistent state relative to the changed data found in your log files.
You are now done restoring your database.


Support
=
Support for Treetop is provided through the mailing list you can join or browse here: groups.google.com/group/treetop-dev
Tutorial
==
Languages can be split into two components, their syntax and their semantics. It’s your understanding of English syntax that tells you the stream of words “Sleep furiously green ideas colorless” is not a valid sentence. Semantics is deeper. Even if we rearrange the above sentence to be “Colorless green ideas sleep furiously”, which is syntactically correct, it remains nonsensical on a semantic level. With Treetop, you’ll be dealing with languages that are much simpler than English, but these basic concepts apply. Your programs will need to address both the syntax and the semantics of the languages they interpret.
Treetop equips you with powerful tools for each of these two aspects of interpreter writing. You’ll describe the syntax of your language with a *parsing expression grammar*. From this description, Treetop will generate a Ruby parser that transforms streams of characters written into your language into *abstract syntax trees* representing their structure. You’ll then describe the semantics of your language in Ruby by defining methods on the syntax trees the parser generates.
Parsing Expression Grammars, The Basics
=================================
The first step in using Treetop is defining a grammar in a file with the `.treetop` extension. Here’s a grammar that’s useless because it’s empty:
# my_grammar.treetop grammar MyGrammar end
Next, you start filling your grammar with rules. Each rule associates a name with a parsing expression, like the following:
# my_grammar.treetop # You can use a .tt extension instead if you wish grammar MyGrammar rule hello 'hello chomsky' end end
The first rule becomes the root of the grammar, causing its expression to be matched when a parser for the grammar is fed a string. The above grammar can now be used in a Ruby program. Notice how a string matching the first rule parses successfully, but a second nonmatching string does not.
# use_grammar.rb require 'rubygems' require 'treetop' Treetop.load 'my_grammar' # or just: # require 'my_grammar' # This works because Polyglot hooks "require" to find and load Treetop files parser = MyGrammarParser.new puts parser.parse('hello chomsky') # => Treetop::Runtime::SyntaxNode puts parser.parse('silly generativists!') # => nil
Users of *regular expressions* will find parsing expressions familiar. They share the same basic purpose, matching strings against patterns. However, parsing expressions can recognize a broader category of languages than their less expressive brethren. Before we get into demonstrating that, lets cover some basics. At first parsing expressions won’t seem much different. Trust that they are.
Terminal Symbols
The expression in the grammar above is a terminal symbol. It will only match a string that matches it exactly. There are two other kinds of terminal symbols, which we’ll revisit later. Terminals are called *atomic expressions* because they aren’t composed of smaller expressions.
Ordered Choices
Ordered choices are *composite expressions*, which allow for any of several subexpressions to be matched. These should be familiar from regular expressions, but in parsing expressions, they are delimited by the `/` character. Its important to note that the choices are prioritized in the order they appear. If an earlier expression is matched, no subsequent expressions are tried. Here’s an example:
# my_grammar.treetop grammar MyGrammar rule hello 'hello chomsky' / 'hello lambek' end end # fragment of use_grammar.rb puts parser.parse('hello chomsky') # => Treetop::Runtime::SyntaxNode puts parser.parse('hello lambek') # => Treetop::Runtime::SyntaxNode puts parser.parse('silly generativists!') # => nil
Note that once a choice rule has matched the text using a particular alternative at a particular location in the input and hence has succeeded, that choice will never be reconsidered, even if the chosen alternative causes another rule to fail where a later alternative wouldn’t have. It’s always a later alternative, since the first to succeed is final - why keep looking when you’ve found what you wanted? This is a feature of PEG parsers that you need to understand if you’re going to succeed in using Treetop. In order to memoize success and failures, such decisions cannot be reversed. Luckily Treetop provides a variety of clever ways you can tell it to avoid making the wrong decisions. But more on that later.
Sequences
Sequences are composed of other parsing expressions separated by spaces. Using sequences, we can tighten up the above grammar.
# my_grammar.treetop grammar MyGrammar rule hello 'hello ' ('chomsky' / 'lambek') end end
Note the use of parentheses to override the default precedence rules, which bind sequences more tightly than choices.
Once the whole sequence has been matched, the result is memoized and the details of the match will not be reconsidered for that location in the input.
Nonterminal Symbols
Here we leave regular expressions behind. Nonterminals allow expressions to refer to other expressions by name. A trivial use of this facility would allow us to make the above grammar more readable should the list of names grow longer.
# my_grammar.treetop grammar MyGrammar rule hello 'hello ' linguist end rule linguist 'chomsky' / 'lambek' / 'jacobsen' / 'frege' end end
The true power of this facility, however, is unleashed when writing *recursive expressions*. Here is a self-referential expression that can match any number of open parentheses followed by any number of closed parentheses. This is theoretically impossible with regular expressions due to the *pumping lemma*.
# parentheses.treetop grammar Parentheses rule parens '(' parens ')' / '' end end
The `parens` expression simply states that a `parens` is a set of parentheses surrounding another `parens` expression or, if that doesn’t match, the empty string. If you are uncomfortable with recursion, its time to get comfortable, because it is the basis of language. Here’s a tip: Don’t try and imagine the parser circling round and round through the same rule. Instead, imagine the rule is already defined while you are defining it. If you imagine that `parens` already matches a string of matching parentheses, then its easy to think of `parens` as an open and closing parentheses around another set of matching parentheses, which conveniently, you happen to be defining. You know that `parens` is supposed to represent a string of matched parentheses, so trust in that meaning, even if you haven’t fully implemented it yet.
Repetition
Any item in a rule may be followed by a ’+’ or a ’*’ character, signifying one-or-more and zero-or-more occurrences of that item. Beware though; the match is greedy, and if it matches too many items and causes subsequent items in the sequence to fail, the number matched will never be reconsidered. Here’s a simple example of a rule that will never succeed:
# toogreedy.treetop grammar TooGreedy rule a_s 'a'* 'a' end end
The ‘a’* will always eat up any ‘a’s that follow, and the subsequent ‘a’ will find none there, so the whole rule will fail. You might need to use lookahead to avoid matching too much. Alternatively, you can use an occurrence range:
# toogreedy.treetop grammar TooGreedy rule two_to_four_as 'a' 2..4 end end
In an occurrence range, you may omit either the minimum count or the maximum count, so that “0.. “ works like “*” and “1.. “ works like ’+’.
Negative Lookahead
When you need to ensure that the following item *doesn’t* match in some case where it might otherwise, you can use negat!ve lookahead, which is an item preceeded by a ! - here’s an example:
# postcondition.treetop grammar PostCondition rule conditional_sentence ( !conditional_keyword word )+ conditional_keyword [ \t]+ word* end rule word ([a-zA-Z]+ [ \t]+) end rule conditional_keyword 'if' / 'while' / 'until' end end
Even though the rule `word` would match any of the conditional keywords, the first words of a conditional_sentence must not be conditional_keywords. The negative lookahead prevents that matching, and prevents the repetition from matching too much input. Note that the lookahead may be a grammar rule of any complexity, including one that isn’t used elsewhere in your grammar.
Positive lookahead
Sometimes you want an item to match, but only if the following text would match some pattern. You don’t want to consume that following text, but if it’s not there, you want this rule to fail. You can append a positive lookahead like this to a rule by appending the lookahead rule preceeded by an & character.
Semantic predicates
Warning: This is an advanced feature. You need to understand the way a packrat parser operates to use it correctly. The result of computing a rule containing a semantic predicate will be memoized, even if the same rule, applied later at the same location in the input, would work differently due to a semantic predicate returning a different value. If you don’t understand the previous sentence yet still use this feature, you’re on your own, so test carefully!
Sometimes, you need to run external Ruby code to decide whether this syntax rule should continue or should fail. You can do this using either positive or negative semantic predicates. These are Ruby code blocks (lambdas) which are called when the parser reaches that location. For this rule to succeed, the value must be true for a positive predicate (a block like &{ … }), or false for a negative predicate (a block like !{ … }).
The block is called with one argument, the array containing the preceding syntax nodes in the current sequence. Within the block, you cannot use node names or labels for the preceding nodes, as the node for the current rule does not yet exist. You must refer to preceding nodes using their position in the sequence.
grammar Keywords rule sequence_of_reserved_and_nonreserved_words ( reserved / word )* end rule reserved word &{ |s| symbol_reserved?(s[0].text_value) } end rule word ([a-zA-Z]+ [ \t]+) end end
One case where it is always safe to use a semantic predicate is to invoke the Ruby debugger, but don’t forget to return true so the rule succeeds! Assuming you have required the ‘ruby-debug’ module somewhere, it looks like this:
rule problems word &{ |s| debugger; true } end
When the debugger stops here, you can inspect the contents of the SyntaxNode for “word” by looking at s[0], and the stack trace will show how you got there.