| R6Class {R6} | R Documentation |
R6 objects are essentially environments, structured in a way that makes them look like an object in a more typical object-oriented language than R. They support public and private members, as well as inheritance across different packages.
R6Class(classname = NULL, public = list(), private = NULL, active = NULL, inherit = NULL, lock_objects = TRUE, class = TRUE, portable = TRUE, lock_class = FALSE, cloneable = TRUE, parent_env = parent.frame(), lock)
classname |
Name of the class. The class name is useful primarily for S3 method dispatch. |
public |
A list of public members, which can be functions (methods) and non-functions (fields). |
private |
An optional list of private members, which can be functions and non-functions. |
active |
An optional list of active binding functions. |
inherit |
A R6ClassGenerator object to inherit from; in other words, a
superclass. This is captured as an unevaluated expression which is
evaluated in |
lock_objects |
Should the environments of the generated objects be locked? If locked, new members can't be added to the objects. |
class |
Should a class attribute be added to the object? Default is
|
portable |
If |
lock_class |
If |
cloneable |
If |
parent_env |
An environment to use as the parent of newly-created objects. |
lock |
Deprecated as of version 2.1; use |
An R6 object consists of a public environment, and may also contain a private environment, as well as environments for superclasses. In one sense, the object and the public environment are the same; a reference to the object is identical to a reference to the public environment. But in another sense, the object also consists of the fields, methods, private environment and so on.
The active
argument is a list of active binding functions. These
functions take one argument. They look like regular variables, but when
accessed, a function is called with an optional argument. For example, if
obj$x2
is an active binding, then when accessed as obj$x2
, it
calls the x2()
function that was in the active
list, with no
arguments. However, if a value is assigned to it, as in obj$x2 <- 50
,
then the function is called with the right-side value as its argument, as in
x2(50)
. See makeActiveBinding
for more information.
If the public or private lists contain any items that have reference
semantics (for example, an environment), those items will be shared across
all instances of the class. To avoid this, add an entry for that item with a
NULL
initial value, and then in the initialize
method,
instantiate the object and assign it.
print
methodR6 object generators and R6 objects have a default print
method to
show them on the screen: they simply list the members and parameters (e.g.
lock_objects, portable, etc., see above) of the object.
The default print
method of R6 objects can be redefined, by
supplying a public print
method. (print
members that are not
functions are ignored.) This method is automatically called whenever the
object is printed, e.g. when the object's name is typed at the command
prompt, or when print(obj)
is called. It can also be called directly
via obj$print()
. All extra arguments from a print(obj, ...)
call are passed on to the obj$print(...)
method.
When R6 classes are portable (the default), they can be inherited across
packages without complication. However, when in portable mode, members must
be accessed with self
and private
, as in self$x
and
private$y
.
When used in non-portable mode, R6 classes behave more like reference
classes: inheritance across packages will not work well, and self
and private
are not necessary for accessing fields.
R6 objects have a method named clone
by default. To disable this,
use cloneable=FALSE
. Having the clone
method present will
slightly increase the memory footprint of R6 objects, but since the method
will be shared across all R6 objects, the memory use will be negligible.
By default, calling x$clone()
on an R6 object will result in a
shallow clone. That is, if any fields have reference semantics
(environments, R6, or reference class objects), they will not be copied;
instead, the clone object will have a field that simply refers to the same
object.
To make a deep copy, you can use x$clone(deep=TRUE)
. With this
option, any fields that are R6 objects will also be cloned; however,
environments and reference class objects will not be.
If you want different deep copying behavior, you can supply your own
private method called deep_clone
. This method will be called for
each field in the object, with two arguments: name
, which is the
name of the field, and value
, which is the value. Whatever the
method returns will be used as the value for the field in the new clone
object. You can write a deep_clone
method that makes copies of
specific fields, whether they are environments, R6 objects, or reference
class objects.
Normally the public environment will have two classes: the one supplied in
the classname
argument, and "R6"
. It is possible to get the
public environment with no classes, by using class=FALSE
. This will
result in faster access speeds by avoiding class-based dispatch of
$
. The benefit is is negligible in most cases.
If a class is a subclass of another, the object will have as its classes
the classname
, the superclass's classname
, and "R6"
The primary difference in behavior when class=FALSE
is that, without
a class attribute, it won't be possible to use S3 methods with the objects.
So, for example, pretty printing (with print.R6Class
) won't be used.
# A queue --------------------------------------------------------- Queue <- R6Class("Queue", public = list( initialize = function(...) { for (item in list(...)) { self$add(item) } }, add = function(x) { private$queue <- c(private$queue, list(x)) invisible(self) }, remove = function() { if (private$length() == 0) return(NULL) # Can use private$queue for explicit access head <- private$queue[[1]] private$queue <- private$queue[-1] head } ), private = list( queue = list(), length = function() base::length(private$queue) ) ) q <- Queue$new(5, 6, "foo") # Add and remove items q$add("something") q$add("another thing") q$add(17) q$remove() #> [1] 5 q$remove() #> [1] 6 # Private members can't be accessed directly q$queue #> NULL # q$length() #> Error: attempt to apply non-function # add() returns self, so it can be chained q$add(10)$add(11)$add(12) # remove() returns the value removed, so it's not chainable q$remove() #> [1] "foo" q$remove() #> [1] "something" q$remove() #> [1] "another thing" q$remove() #> [1] 17 # Active bindings ------------------------------------------------- Numbers <- R6Class("Numbers", public = list( x = 100 ), active = list( x2 = function(value) { if (missing(value)) return(self$x * 2) else self$x <- value/2 }, rand = function() rnorm(1) ) ) n <- Numbers$new() n$x #> [1] 100 n$x2 #> [1] 200 n$x2 <- 1000 n$x #> [1] 500 # If the function takes no arguments, it's not possible to use it with <-: n$rand #> [1] 0.2648 n$rand #> [1] 2.171 # n$rand <- 3 #> Error: unused argument (quote(3)) # Inheritance ----------------------------------------------------- # Note that this isn't very efficient - it's just for illustrating inheritance. HistoryQueue <- R6Class("HistoryQueue", inherit = Queue, public = list( show = function() { cat("Next item is at index", private$head_idx + 1, "\n") for (i in seq_along(private$queue)) { cat(i, ": ", private$queue[[i]], "\n", sep = "") } }, remove = function() { if (private$length() - private$head_idx == 0) return(NULL) private$head_idx <<- private$head_idx + 1 private$queue[[private$head_idx]] } ), private = list( head_idx = 0 ) ) hq <- HistoryQueue$new(5, 6, "foo") hq$show() #> Next item is at index 1 #> 1: 5 #> 2: 6 #> 3: foo hq$remove() #> [1] 5 hq$show() #> Next item is at index 2 #> 1: 5 #> 2: 6 #> 3: foo hq$remove() #> [1] 6 # Calling superclass methods with super$ -------------------------- CountingQueue <- R6Class("CountingQueue", inherit = Queue, public = list( add = function(x) { private$total <<- private$total + 1 super$add(x) }, get_total = function() private$total ), private = list( total = 0 ) ) cq <- CountingQueue$new("x", "y") cq$get_total() #> [1] 2 cq$add("z") cq$remove() #> [1] "x" cq$remove() #> [1] "y" cq$get_total() #> [1] 3 # Non-portable classes -------------------------------------------- # By default, R6 classes are portable, which means they can be inherited # across different packages. Portable classes require using self$ and # private$ to access members. # When used in non-portable mode, members can be accessed without self$, # and assignments can be made with <<-. NP <- R6Class("NP", portable = FALSE, public = list( x = NA, getx = function() x, setx = function(value) x <<- value ) ) np <- NP$new() np$setx(10) np$getx() #> [1] 10 # Setting new values ---------------------------------------------- # It is possible to add new members to the class after it has been created, # by using the $set() method on the generator. Simple <- R6Class("Simple", public = list( x = 1, getx = function() self$x ) ) Simple$set("public", "getx2", function() self$x*2) # Use overwrite = TRUE to overwrite existing values Simple$set("public", "x", 10, overwrite = TRUE) s <- Simple$new() s$x s$getx2() # Cloning objects ------------------------------------------------- a <- Queue$new(5, 6) a$remove() #> [1] 5 # Clone a. New object gets a's state. b <- a$clone() # Can add to each queue separately now. a$add(10) b$add(20) a$remove() #> [1] 6 a$remove() #> [1] 10 b$remove() #> [1] 6 b$remove() #> [1] 20 # Deep clones ----------------------------------------------------- Simple <- R6Class("Simple", public = list( x = NULL, initialize = function(val) self$x <- val ) ) Cloner <- R6Class("Cloner", public = list( s = NULL, y = 1, initialize = function() self$s <- Simple$new(1) ) ) a <- Cloner$new() b <- a$clone() c <- a$clone(deep = TRUE) # Modify a a$s$x <- 2 a$y <- 2 # b is a shallow clone. b$s is the same as a$s because they are R6 objects. b$s$x #> [1] 2 # But a$y and b$y are different, because y is just a value. b$y #> [1] 1 # c is a deep clone, so c$s is not the same as a$s. c$s$x #> [1] 1 c$y #> [1] 1 # Deep clones with custom deep_clone method ----------------------- CustomCloner <- R6Class("CustomCloner", public = list( e = NULL, s1 = NULL, s2 = NULL, s3 = NULL, initialize = function() { self$e <- new.env(parent = emptyenv()) self$e$x <- 1 self$s1 <- Simple$new(1) self$s2 <- Simple$new(1) self$s3 <- Simple$new(1) } ), private = list( # When x$clone(deep=TRUE) is called, the deep_clone gets invoked once for # each field, with the name and value. deep_clone = function(name, value) { if (name == "e") { # e1 is an environment, so use this quick way of copying list2env(as.list.environment(value, all.names = TRUE), parent = emptyenv()) } else if (name %in% c("s1", "s2")) { # s1 and s2 are R6 objects which we can clone value$clone() } else { # For everything else, just return it. This results in a shallow # copy of s3. value } } ) ) a <- CustomCloner$new() b <- a$clone(deep = TRUE) # Change some values in a's fields a$e$x <- 2 a$s1$x <- 3 a$s2$x <- 4 a$s3$x <- 5 # b has copies of e, s1, and s2, but shares the same s3 b$e$x #> [1] 1 b$s1$x #> [1] 1 b$s2$x #> [1] 1 b$s3$x #> [1] 5 # Debugging ------------------------------------------------------- ## Not run: # This will enable debugging the getx() method for objects of the 'Simple' # class that are instantiated in the future. Simple$debug("getx") s <- Simple$new() s$getx() # Disable debugging for future instances: Simple$undebug("getx") s <- Simple$new() s$getx() # To enable and disable debugging for a method in a single instance of an # R6 object (this will not affect other objects): s <- Simple$new() debug(s$getx) s$getx() undebug(s$getx) ## End(Not run)


He is trying to make an impact in the World with courage and desire to achieve his dream. Sincerely climbing up the academic records while pursuing Master's in Robotics Engineering, with real world experiences to enhance his skill-set. Readily seizing opportunities to learn and apply himself with diligence and excellent time management. Seeking for Full-time opportunity starting June 2019.
RESUME


--- title: "Welcome to BRIŠKODA Cars" date: 2019-06-15T17:13:19+01:00 draft: false weight: 1 anchor: "intro" ---
BRISKODA founded in 2002, is working with approved ŠKODA dealers to be an easy, safe and cheaper way to drive your brand new ŠKODA.
Working with trusted UK ŠKODA dealers, we're here to help you in your search for the right deal.
With our community forums, we can help you with advice and support; before you buy; as you're buying; and afterwards, all from other owners, just like you.
Ultimately as owners and car enthusiasts, we're here to provide you with a great overall deal.


Package org.drip.function.r1tor1
Built-in R1 To R1 Functions
- Author:
- Lakshmi Krishnamurthy
-
Class Summary Class Description AlmgrenEnhancedEulerUpdate AlmgrenEnhancedEulerUpdate is a R1 To R1 Function that is used in Almgren (2009, 2012) to illustrate the Construction of the Enhanced Euler Update Scheme.AndersenPiterbargMeanReverter AndersenPiterbargMeanReverter implements the mean-reverting Univariate Function detailed in:
Andersen and Piterbarg (2010): Interest Rate Modeling (3 Volumes), Atlantic Financial Press.Bennett Bennett is implementation of the Bennett's Function used in the Estimation of the Bennett's Concentration Inequality.BernsteinPolynomial BernsteinPolynomial provides the evaluation of the BernsteinPolynomial and its derivatives for a specified variate.ExponentialDecay ExponentialDecay implements the scaled exponential decay Univariate Function.ExponentialTension ExponentialTension provides the evaluation of the Exponential Tension Function and its derivatives for a specified variate.FlatUnivariate FlatUnivariate implements the level constant Univariate Function.FunctionClassSupremum FunctionClassSupremum implements the Univariate Function that corresponds to the Supremum among the specified Class of Functions.HyperbolicTension HyperbolicTension provides the evaluation of the Hyperbolic Tension Function and its derivatives for a specified variate.ISDABucketCurvatureTenorScaler ISDABucketCurvatureTenorScaler generates the ISDA SIMM Tenor Scaling Factor for a given Bucket Curvature.LinearRationalShapeControl LinearRationalShapeControl implements the deterministic rational shape control functionality on top of the estimator basis splines inside - [0,...,1) - Globally [x_0,...,x_1):
y = 1 / [1 + lambda * x]
where is the normalized ordinate mapped as x === (x - x_i-1) / (x_i - x_i-1)
Module = Computational Core Module Library = Numerical Analysis Library Project = Rd To Rd Function Analysis Package = Built-in R1 To R1 FunctionsLinearRationalTensionExponential LinearRationalTensionExponential provides the evaluation of the Convolution of the Linear Rational and the Tension Exponential Functions and its derivatives for a specified variate.MonicPolynomial MonicPolynomial implements the Multi-root R1 to R1 Monic Polynomial.NaturalLogSeriesElement NaturalLogSeriesElement implements an element in the natural log series expansion.OffsetIdempotent OffsetIdempotent provides the Implementation of the Offset Idempotent Operator - f(x) = x - C.Polynomial Polynomial provides the evaluation of the nth order Polynomial and its derivatives for a specified variate.QuadraticRationalShapeControl QuadraticRationalShapeControl implements the deterministic rational shape control functionality on top of the estimator basis splines inside - [0,...,1) - Globally [x_0,...,x_1):
y = 1 / [1 + lambda * x * (1-x)]
where is the normalized ordinate mapped as
x ==== (x - x_i-1) / (x_i - x_i-1)
Module = Computational Core Module Library = Numerical Analysis Library Project = Rd To Rd Function Analysis Package = Built-in R1 To R1 FunctionsR1UnivariateCIRPDF R1UnivariateCIRPDF exposes the R1 Univariate Cox-Ingersoll-Ross Probability Density Function.SABRLIBORCapVolatility SABRLIBORCapVolatility implements the Deterministic, Non-local Cap Volatility Scheme detailed in:
Rebonato, R., K.Sinc Sinc computes the Pi Z-Scaled Reciprocal of the Sine Function of Pi times the Argument.UnivariateConvolution UnivariateConvolution provides the evaluation of the Convolution au1 * au2 and its derivatives for a specified variate.UnivariateReciprocal UnivariateReciprocal provides the evaluation 1/f(x) instead of f(x) for a given f.UnivariateReflection UnivariateReflection provides the evaluation f(1-x) instead of f(x) for a given f.


Tell me more about you!
Give us some information about you.
Username
Email
Number
Student
Full Time Job
Full Time Learner
Other
1K
10K
100K
Developer
Architect
It was a dark and stormy night...


|
EM datagrams on *.kmall format
Reg. nr. 410224 rev I
|
#SKM - Sensor attitude data block. Data given timestamped, not corrected. More...
#include <EMdgmFormat.h>
Data Fields | |
| uint8_t | dgmType [4] |
| uint16_t | numBytesDgm |
| uint16_t | dgmVersion |
| uint32_t | time_sec |
| uint32_t | time_nanosec |
| uint32_t | status |
Position. | |
| double | latitude_deg |
| double | longitude_deg |
| float | ellipsoidHeight_m |
Attitude. | |
| float | roll_deg |
| float | pitch_deg |
| float | heading_deg |
| float | heave_m |
Rates. | |
| float | rollRate |
| float | pitchRate |
| float | yawRate |
Velocities. | |
| float | velNorth |
| float | velEast |
| float | velDown |
Errors in data. Sensor data quality, as standard deviations. | |
| float | latitudeError_m |
| float | longitudeError_m |
| float | ellipsoidHeightError_m |
| float | rollError_deg |
| float | pitchError_deg |
| float | headingError_deg |
| float | heaveError_m |
Acceleration. | |
| |
| float | northAcceleration |
| float | eastAcceleration |
| float | downAcceleration |
#SKM - Sensor attitude data block. Data given timestamped, not corrected.
See Coordinate systems for definition of positive angles and axis.
Definition at line 300 of file EMdgmFormat.h.
| uint8_t dgmType[4] |
#KMB
Definition at line 302 of file EMdgmFormat.h.
| uint16_t numBytesDgm |
Datagram length in bytes. The length field at the start (4 bytes) and end of the datagram (4 bytes) are included in the length count.
Definition at line 303 of file EMdgmFormat.h.
| uint16_t dgmVersion |
Datagram version.
Definition at line 304 of file EMdgmFormat.h.
| uint32_t time_sec |
UTC time from inside KM sensor data. Unit second. Epoch 1970-01-01 time. Nanosec part to be added for more exact time.
If time is unavailable from attitude sensor input, time of reception on serial port is added to this field.
Definition at line 305 of file EMdgmFormat.h.
| uint32_t time_nanosec |
Nano seconds remainder. Nanosec part to be added to time_sec for more exact time.
If time is unavailable from attitude sensor input, time of reception on serial port is added to this field.
Definition at line 307 of file EMdgmFormat.h.
| uint32_t status |
Bit pattern for indicating validity of sensor data, and reduced performance. The status word consists of 32 single bit flags numbered from 0 to 31, where 0 is the least significant bit.
Bit number 0-7 indicate if from a sensor data is invalid. 0 = valid data, 1 = invalid data.
Bit number 16-> indicate if data from sensor has reduced performance. 0 = valid data, 1 = reduced performance.
Invalid data:
| Bit number | Sensor data |
|---|---|
| 0 | Horizontal position and velocity |
| 1 | Roll and pitch |
| 2 | Heading |
| 3 | Heave and vertical velocity |
| 4 | Acceleration |
| 5 | Delayed heave |
| 6 | Delayed heave |
Reduced performance:
| Bit number | Sensor data |
|---|---|
| 16 | Horizontal position and velocity |
| 17 | Roll and pitch |
| 18 | Heading |
| 19 | Heave and vertical velocity |
| 20 | Acceleration |
| 21 | Delayed heave |
| 22 | Delayed heave |
Definition at line 309 of file EMdgmFormat.h.
| double latitude_deg |
Position in decimal degrees.
Definition at line 344 of file EMdgmFormat.h.
| double longitude_deg |
Position in decimal degrees.
Definition at line 345 of file EMdgmFormat.h.
| float ellipsoidHeight_m |
Height of sensor reference point above the ellipsoid. Positive above ellipsoid. ellipsoidHeight_m is not corrected for motion and installation offsets of the position sensor.
Definition at line 346 of file EMdgmFormat.h.
| float roll_deg |
Roll. Unit degree.
Definition at line 350 of file EMdgmFormat.h.
| float pitch_deg |
Pitch. Unit degree.
Definition at line 351 of file EMdgmFormat.h.
| float heading_deg |
Heading of vessel. Unit degree. Relative to the fixed coordinate system, i.e. true north.
Definition at line 352 of file EMdgmFormat.h.
| float heave_m |
Heave. Unit meter. Positive downwards.
Definition at line 353 of file EMdgmFormat.h.
| float rollRate |
Roll rate. Unit degree/s
Definition at line 358 of file EMdgmFormat.h.
| float pitchRate |
Pitch rate. Unit degree/s
Definition at line 359 of file EMdgmFormat.h.
| float yawRate |
Yaw (heading) rate. Unit degree/s
Definition at line 360 of file EMdgmFormat.h.
| float velNorth |
Velocity North (X). Unit m/s
Definition at line 365 of file EMdgmFormat.h.
| float velEast |
Velocity East (Y). Unit m/s
Definition at line 366 of file EMdgmFormat.h.
| float velDown |
Velocity downwards (Z). Unit m/s
Definition at line 367 of file EMdgmFormat.h.
| float latitudeError_m |
Latitude error. Unit meter.
Definition at line 372 of file EMdgmFormat.h.
| float longitudeError_m |
Longitude error. Unit meter.
Definition at line 373 of file EMdgmFormat.h.
| float ellipsoidHeightError_m |
Ellipsoid height error. Unit meter.
Definition at line 374 of file EMdgmFormat.h.
| float rollError_deg |
Roll error. Unit degree.
Definition at line 375 of file EMdgmFormat.h.
| float pitchError_deg |
Pitch error. Unit degree.
Definition at line 376 of file EMdgmFormat.h.
| float headingError_deg |
Heading error. Unit degree.
Definition at line 377 of file EMdgmFormat.h.
| float heaveError_m |
Heave error. Unit meter.
Definition at line 378 of file EMdgmFormat.h.
| float northAcceleration |
Unit m/s^2.
Definition at line 383 of file EMdgmFormat.h.
| float eastAcceleration |
Unit m/s^2.
Definition at line 384 of file EMdgmFormat.h.
| float downAcceleration |
Unit m/s^2.
Definition at line 385 of file EMdgmFormat.h.


Page 4 of 7
Re: Want to Play Evidyon?
Posted:
Tue Apr 21, 2009 9:42 am
by Joe M.
added x3.
Enjoy. As I said above, the game's real buggy right now but will be fixed up in a patch tonight.
Electro, glad to have you back
. I think you'll find we've come a long way while you've been gone. We're just finishing up our own school work for this term, and so in a couple weeks will be able to develop Evidyon much more rapidly as we go into Beta.
Re: Want to Play Evidyon?
Posted:
Tue Apr 21, 2009 9:20 pm
by Joe M.
added, added.
Re: Want to Play Evidyon?
Posted:
Wed Apr 22, 2009 4:54 pm
by Jabberwock
Sign me up.
Re: Want to Play Evidyon?
Posted:
Wed Apr 22, 2009 7:03 pm
by Joe M.
added.
Re: Want to Play Evidyon?
Posted:
Thu Apr 23, 2009 2:04 pm
by tomgsx
i wanna play =)
Re: Want to Play Evidyon?
Posted:
Thu Apr 23, 2009 2:09 pm
by Joe M.
added.
Re: Want to Play Evidyon?
Posted:
Sat Apr 25, 2009 10:02 pm
by Joe M.
added.
Re: Want to Play Evidyon?
Posted:
Sat May 02, 2009 10:33 pm
by xen01
Please add me.
Re: Want to Play Evidyon?
Posted:
Mon May 04, 2009 12:25 pm
by Joe M.
added both of you. Sorry it took me a few days--just moved into a new apartment and won't have internet access till tomorrow.
So now that I've finally let y'all in, have fun!
Re: Want to Play Evidyon?
Posted:
Mon May 04, 2009 12:28 pm
by xen01
Thank you very much
<3
Re: Want to Play Evidyon?
Posted:
Mon May 04, 2009 8:49 pm
by Forlorn
Add me in for this old skool tightness! please and thank you!
Re: Want to Play Evidyon?
Posted:
Tue May 05, 2009 10:30 am
by Joe M.
added.
Re: Want to join the Alpha test?
Posted:
Tue May 05, 2009 9:17 pm
by Joe M.
you're in.
Re: Want to join the Alpha test?
Posted:
Sun May 10, 2009 9:18 am
by WACOO
Hey, this project sounds like a great idea and I would like to do my best as a tester to make this game amazing!
I have alot of knowledge in MMORPG / RPG games since I have played em my entire life (lol).
Been alpha/beta tester in a few games. Other than that I have probably played over 40 MMORPG / RPG games so I know quite alot how to make it work / balanced.
And I am a oldschool Xeniumus player ofc :3
Re: Want to join the Alpha test?
Posted:
Sun May 10, 2009 10:55 am
by Joe M.
Added x3.
Great to have you! You can download the game in the private Alpha forum.
Re: Want to join the Alpha test?
Posted:
Tue May 12, 2009 10:04 am
by Joe M.
added.
Re: Want to join the Alpha test?
Posted:
Wed May 13, 2009 7:17 pm
by thomeboy
can i play yet?
Re: Want to join the Alpha test?
Posted:
Wed May 13, 2009 11:37 pm
by Tseiga
I would like to join the Alpha Test.
Re: Want to join the Alpha test?
Posted:
Thu May 14, 2009 10:51 am
by Joe M.
thomeboy, you're already in the Alpha group. So yes, you can play.
Tseiga, I just added you.
Go over to the private Alpha forum to download the game, read the basic instructions post, and get started. Have fun!
Re: Want to join the Alpha test?
Posted:
Sun May 17, 2009 4:57 pm
by Hesh
I was in before but got kicked out when he was trimming up the alpha group but now i can actively play again so i would love to test this out lemme know if you add me.
Re: Want to join the Alpha test?
Posted:
Sun May 17, 2009 9:33 pm
by Joe M.
added.
Re: Want to join the Alpha test?
Posted:
Mon May 18, 2009 6:18 pm
by XpLiCiT
Let me play, ive been waiting like 3 years lol
Re: Want to join the Alpha test?
Posted:
Mon May 18, 2009 6:23 pm
by Joe M.
I've added you to the Alpha testing group. You can download the game in the private Alpha forum.
Re: Want to join the Alpha test?
Posted:
Tue May 19, 2009 4:36 am
by Nirvana9832
Can i be Re-Added? I did have a few decent level chars way back at the beginning =]
Allthough i dont remember my Login info, is there a way to retrieve it? lol
Re: Want to join the Alpha test?
Posted:
Tue May 19, 2009 7:17 am
by Joe M.
I've re-added you. I don't know about character/account retrieval; it depends on when you had those characters: first there was Alpha 2 (and the loss of all Alpha 1 characters), and then we lost characters in a server shuffle somewhere a few months back (though I think Karl was able to retrieve those chars for those who wanted them).
Karl's the one to ask though, not me; send him a PM to ask him. Include as much information as you can remember: acct number, character names, &c.


Technical blog from Craig Russell.
This post details how to include the author tag in the generated RSS feed for a Hugo-generated site.
Hugo comes equipped with a template by default. In fact you might be pleasantly surprised to discover your site has an RSS feed already. You can try it out by visiting your site and adding /index.xml
on the end of either of your home page, or your section containing your blog posts. e.g.,
While the default template might be enough for some, others are going to want to customise it. For me, I found that I wanted to include an <author>
tag in my posts.
You can either grab the default template and add the <author>
tag into it (recommended approach) or just skip ahead and grab my one from the gist below. I would recommend using the default one as it may contain newer changes from Hugo that my gist won’t have over time.
To do this, we must start by grabbing a copy of the embedded RSS template. We’ll drop that into your project and customise it to include the author tag.
layouts/_default/rss.xml
<author>
tag in. You’ll probably want to add it under the <item>
tag, and you may additionally want to add it at the top level.config.yaml
, config.toml
or config.json
file)When you’re done, it should look like this 👇
// config.yaml
author:
name: Craig Russell
Now when you publish the site and access the RSS XML, you’ll see the <author>
is now included.


IBM Bluemix Mobile Services - Client SDK Swift Push
This is the Push component of the Swift SDK for IBM Bluemix Mobile Services.
https://console.ng.bluemix.net/solutions/mobilefirst
Contents
This package contains the Push components of the Swift SDK. * Push Registration * Subscribing and Unsubcribing for Tags
Requirements
- iOS 8.0+
- Xcode 7
Installation
The Bluemix Mobile Services Swift SDKs are available via Cocoapods and Carthage.
Cocoapods
To install BMSCore using Cocoapods, add it to your Podfile:
use_frameworks!
target 'MyApp' do
platform :ios, '8.0'
pod 'BMSCore'
pod 'BMSPush'
end
From the Terminal, go to your project folder and install the dependencies with the following command:
pod install
That command installs your dependencies and creates a new Xcode workspace. Note: Ensure that you always open the new Xcode workspace, instead of the original Xcode project file:
open App.xcworkspace
Carthage
To install BMSPush using Carthage, add it to your Cartfile:
github "ibm-bluemix-mobile-services/bms-clientsdk-swift-push"
Then run the carthage update
command. Once the build is finished, drag BMSPush.framework
,BMSCore.framework
and BMSAnalyticsAPI.framework
into your Xcode project.
To complete the integration, follow the instructions here.
Enabling iOS applications to receive push notifications
Reference the SDK in your code.
import BMSPush
import BMSCore
Initializing the Core SDK
let myBMSClient = BMSClient.sharedInstance
myBMSClient.initializeWithBluemixAppRoute("BluemixAppRoute", bluemixAppGUID: "APPGUID", bluemixRegion:"Location where your app Hosted")
myBMSClient.defaultRequestTimeout = 10.0 // Timput in seconds
AppRoute
Specifies the route that is assigned to the server application that you created on Bluemix.
AppGUID
Specifies the unique key that is assigned to the application that you created on Bluemix. This value is case-sensitive.
bluemixRegionSuffix
Specifies the location where the app hosted. You can use one of three values - BMSClient.REGION_US_SOUTH
, BMSClient.REGION_UK
and BMSClient.REGION_SYDNEY
.
Initializing the Push SDK
let push = BMSPushClient.sharedInstance
push.initializeWithPushAppGUID("pushAppGUID")
pushAppGUID
The Push app GUID value.
For userId based notifiction initialize the BMSPush
with clientSecret
.
let push = BMSPushClient.sharedInstance
push.initializeWithPushAppGUID("pushAppGUID", clientSecret:"clientSecret")
pushAppGUID
The Push app GUID value.
clientSecret
The Push client secret value.
Registering iOS applications and devices
Add this code to registering the app for push notification in APNS,
let settings = UIUserNotificationSettings(forTypes: [.Alert, .Badge, .Sound], categories: nil)
UIApplication.sharedApplication().registerUserNotificationSettings(settings)
UIApplication.sharedApplication().registerForRemoteNotifications()
After the token is received from APNS, pass the token to Push Notifications as part of the didRegisterForRemoteNotificationsWithDeviceToken method.
func application (application: UIApplication, didRegisterForRemoteNotificationsWithDeviceToken deviceToken: NSData){
let push = BMSPushClient.sharedInstance
push.initializeWithPushAppGUID("pushAppGUID")
push.registerWithDeviceToken(deviceToken) { (response, statusCode, error) -> Void in
if error.isEmpty {
print( "Response during device registration : \(response)")
print( "status code during device registration : \(statusCode)")
}
else{
print( "Error during device registration \(error) ")
Print( "Error during device registration \n - status code: \(statusCode) \n Error :\(error) \n")
}
}
}
For user Id based notification, the register method will accept one more parameter - userId
func application (application: UIApplication, didRegisterForRemoteNotificationsWithDeviceToken deviceToken: NSData){
let push = BMSPushClient.sharedInstance
push.initializeWithPushAppGUID("pushAppGUID", clientSecret:"clientSecret")
push.registerWithDeviceToken(deviceToken, WithUserId: "your user id") { (response, statusCode, error) -> Void in
if error.isEmpty {
print( "Response during device registration : \(response)")
print( "status code during device registration : \(statusCode)")
}
else{
print( "Error during device registration \(error) ")
Print( "Error during device registration \n - status code: \(statusCode) \n Error :\(error) \n")
}
}
}
WithUserId
the User Id value you want to register in the push service
Note: If userId is provided the client secret value must be provided.
Retrieve Available Tags and register for Tags
Retrieve Available tags
The retrieveAvailableTagsWithCompletionHandler API returns the list of available tags to which the device can subscribe. After the device is subscribed to a particular tag, the device can receive any push notifications that are sent for that tag.
Call the push service to get subscriptions for a tag.
Copy the following code snippets into your Swift mobile application to get a list of available tags to which the device can subscribe.
push.retrieveAvailableTagsWithCompletionHandler({ (response, statusCode, error) -> Void in
if error.isEmpty {
print( "Response during retrieve tags : \(response)")
print( "status code during retrieve tags : \(statusCode)")
}
else{
print( "Error during retrieve tags \(error) ")
Print( "Error during retrieve tags \n - status code: \(statusCode) \n Error :\(error) \n")
}
}
Subscribe to Available tags
push.subscribeToTags(response, completionHandler: { (response, statusCode, error) -> Void in
if error.isEmpty {
print( "Response during Subscribing to tags : \(response?.description)")
print( "status code during Subscribing tags : \(statusCode)")
}
else {
print( "Error during subscribing tags \(error) ")
Print( "Error during subscribing tags \n - status code: \(statusCode) \n Error :\(error) \n")
}
}
Retrieve Subscribed tags
push.retrieveSubscriptionsWithCompletionHandler { (response, statusCode, error) -> Void in
if error.isEmpty {
print( "Response during retrieving subscribed tags : \(response?.description)")
print( "status code during retrieving subscribed tags : \(statusCode)")
}
else {
print( "Error during retrieving subscribed tags \(error) ")
Print( "Error during retrieving subscribed tags \n - status code: \(statusCode) \n Error :\(error) \n")
}
}
unsubscribing tags
Use the following code snippets to allow your devices to get unsubscribe from a tag.
push.unsubscribeFromTags(response, completionHandler: { (response, statusCode, error) -> Void in
if error.isEmpty {
print( "Response during unsubscribed tags : \(response?.description)")
print( "status code during unsubscribed tags : \(statusCode)")
}
else {
print( "Error during unsubscribed tags \(error) ")
print( "Error during unsubscribed tags \n - status code: \(statusCode) \n Error :\(error) \n")
}
}
Unregistering the Device from Bluemix Push Notification
Use the following code snippets to Unregister the device from Bluemix Push Notification
push.unregisterDevice({ (response, statusCode, error) -> Void in
if error.isEmpty {
print( "Response during unregistering device : \(response)")
print( "status code during unregistering device : \(statusCode)")
}
else{
print( "Error during unregistering device \(error) ")
print( "Error during unregistering device \n - status code: \(statusCode) \n Error :\(error) \n")
}
}
Learning More
Connect with Bluemix
Twitter | YouTube | Blog | Facebook | Meetup
======================= Copyright 2015 IBM Corp.
Licensed under the Apache License, Version 2.0 (the License
);
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an AS IS
BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.


[gecode-users] Memory Leak with NaryUnion/Region(?)
Christian Schulte
cschulte at kth.se
Mon Mar 26 16:07:40 CEST 2012
Hmm, thanks for the report. I might not fix that soon as the whole
implementation for Region might change.
Thanks a lot!
Christian
--
Christian Schulte, www.ict.kth.se/~cschulte/
-----Original Message-----
From: users-bounces at gecode.org [mailto:users-bounces at gecode.org] On Behalf
Of Jean-Noël Monette
Sent: Monday, March 26, 2012 1:53 PM
To: users at gecode.org
Subject: [gecode-users] Memory Leak with NaryUnion/Region(?)
Hello,
Sorry for bothering you again with the same class, namely NaryUnion...
When running the next piece of code, within valgrind (memcheck), I get a
report for a memory leak...
#include "gecode/driver.hh"
#include "gecode/iter.hh"
using namespace Gecode;
class MySpace:public Space {
public:
virtual Space* copy(bool share){return this;} }; int main(int argc,
char* argv[]){
MySpace home;
Region region(home);
for(int j=0;j<8;j++){
Iter::Ranges::Empty e;
Iter::Ranges::NaryUnion unio(region,e);
}
}
The report is as follows:
==9213== HEAP SUMMARY:
==9213== in use at exit: 40 bytes in 1 blocks
==9213== total heap usage: 319 allocs, 318 frees, 94,497 bytes allocated
==9213==
==9213== 40 bytes in 1 blocks are definitely lost in loss record 1 of 1
==9213== at 0x4C28FAC: malloc (vg_replace_malloc.c:236)
==9213== by 0x6582629: Gecode::Region::heap_alloc(unsigned long)
(heap.hpp:324)
==9213== by 0x40474F: main (region.hpp:306)
==9213==
==9213== LEAK SUMMARY:
==9213== definitely lost: 40 bytes in 1 blocks
==9213== indirectly lost: 0 bytes in 0 blocks
==9213== possibly lost: 0 bytes in 0 blocks
==9213== still reachable: 0 bytes in 0 blocks
==9213== suppressed: 0 bytes in 0 blocks
The leak does not appear when looping only for 7 iterations instead of 8.
This seems quite normal as the memory is allocated on the heap only when the
region space is exhausted (according to MPG). I am using Gecode 3.7.1, gcc
4.5.2, Linux-Ubuntu 11.04 over a 64 bits architecture. Is it some kind of
bug, or should I stop using NaryUnion once and for all?
Thank you again for your help,
Jean-Noël monette
_______________________________________________
Gecode users mailing list
users at gecode.org
https://www.gecode.org/mailman/listinfo/gecode-users
More information about the users
mailing list


There is a lot of platform for training and learn hacking techniques, here are my favorites.
Root Me (fr) : challenges and CTF.
Exploit Exercises : challenges and virtual machines.
Zenk-Security : challenges and tutoriels repository.
W3Challs : challenges.
Newbie Contest (fr) : french challenges.
VulnHub : vulnerable virtual machines.
DVWA : vulnerable web application.
WebGoat : vulnerable web application.


The scraping API that fetches the content from the Internet.
The filtering API which improves the search query.
The UI (User Interface) which is powering Rex.
The Project is open sourced under the MIT License & the Repository is hosted on Github, click here
Repository & Licensing


Implements the Bayesian Augmented Control (BAC, a.k.a. Bayesian historical data borrowing) method under clinical trial setting by calling 'Just Another Gibbs Sampler' ('JAGS') software. In addition, the 'BACCT' package evaluates user-specified decision rules by computing the type-I error/power, or probability of correct go/no-go decision at interim look. The evaluation can be presented numerically or graphically. Users need to have 'JAGS' 4.0.0 or newer installed due to a compatibility issue with 'rjags' package. Currently, the package implements the BAC method for binary outcome only. Support for continuous and survival endpoints will be added in future releases. We would like to thank AbbVie's Statistical Innovation group and Clinical Statistics group for their support in developing the 'BACCT' package.
| Version: | 1.0 |
| Depends: | R (≥ 2.10) |
| Imports: | rjags, ggplot2, reshape2 |
| Published: | 2016-06-25 |
| Author: | Hongtao Zhang [aut, cre], Qi Tang [aut] |
| Maintainer: | Hongtao Zhang <hongtao.zhang at abbvie.com> |
| License: | GPL (≥ 3) |
| NeedsCompilation: | no |
| CRAN checks: | BACCT results |
| Reference manual: | BACCT.pdf |
| Package source: | BACCT_1.0.tar.gz |
| Windows binaries: | r-devel: BACCT_1.0.zip, r-release: BACCT_1.0.zip, r-oldrel: BACCT_1.0.zip |
| OS X binaries: | r-release: BACCT_1.0.tgz, r-oldrel: BACCT_1.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=BACCT to link to this page.


{% extends "base.html" %} {% block content %}
My goal was to develop an application with the following set of requirements:
Using these requirements as a guide, I make the following decisions about the application development and structure:
Here are some quick links to get you started:
{% endblock %}


[React] Action VS Action creator [Question mark]
I was confused by the action and action creator. So in this article, I
will explain how I understand it now.
In short, action is an object while action creator is a function.
// Action creator return an action
const addWord = (word, meaning) => {
const lastCheckTime = new Date().toGMTString();
return {
type: "ADDWORD",
payload: {
word,
meaning,
lastCheckTime,
checkPeriod: 0
}
};
};
addWord() is action creator. It is a function. And it creates action by
returning an object. While that object is an action.
return <button onClick={() => dispatch(addWord(word, meaning))}>+</button>;
When the onClick function is triggered, it dispatches the action, or to
say the object.
But there is one thing that I am still not that sure. When an action is
dispatched, how could the react know which reducer is that if there are
multiple reducers?


In 1984 I was relatively new to LSD, having only tripped a few times before. My friend R introduced me to it with some Orange Pyramid. The first and second trips we took together were absolutely mind-blowing, in a good way. To this day I still can't properly put them into words. However this is about our third trip. And it is still with me to this day.
We had gotten hold of some Green Pyramid this time. Just like before, we had it all planned out very carefully. Around 6pm, R came over to the house and after a few minutes we dropped the cid. We sat around for a while listening to music and talking. Finally, after around an hour or so, R asks me 'are you tripping?
I said, 'hell yes, this is gonna be great!' Another 5 or 10 minutes went by and he asked again, 'are you tripping?' I said 'yeah, aren't you tripping yet?'
That's when he stood up and said, 'I never took mine. I have to go. You're a drug addict now. I've transformed you. Look at yourself.' And walked out.
My entire existence came crashing down in one massive swirling nuclear Acid bomb. Everything was exactly the opposite of those fantastic trips I had on the Orange Pyramid. Everything was black, poisoned, burnt, and death was everywhere. I sat there in shock at what I knew was going to be a very long night. And I wanted to kill my friend for setting me up for this experience. I know now that he did it because he was curious about how it would turn out and knew I could handle it. But I still wish I could return the favor someday.
The incredibly beauty of the music turned into a hollow, vile mocking of me and everything I was about. And if this wasn't bad enough, R's last words to me came rushing back.... 'you're a drug addict now. Look at yourself....' and I got up and looked at myself in the mirror. Worst mistake ever.
My eyes were completely black. This was very good acid and if the bad was anything like the good, this was going to be hell.   YOU'VE DONE IT THIS TIME.  This must be what the whole world is like. Pointless existence and death.
And then the flesh melted off my face.  DEATH. ETERNAL HELL. POISON. BLACKNESS.
I stood up and tried to shake it off a few times with no luck. Kept telling myself, 'this is just a drug like before. I know it's bad, but I WILL come out of this.'  I was too.  Everything was my fault.  I wanted to die.
It was worse than I can probably ever descibe in any language, but the only thing that kept me from killing myself that night was an anchor to reality based on pure fascination with LSD. I remembered the amizing trips I had before and thought, 'those were so great.... this must be the other side of it. This must be a bad trip.'
And somehow knowing that made it better. The trip remained bad until I finally came down, but for the remainder I was able to see it for what it was. And experience on the dark side of LSD.
I still look back at that night with that frame of mind.  I've tripped several times since then, and even had a few times when friends tried to steer me into the black with everything they could think of. But having gone through that, I'm able to not let it take hold anymore. I can force myself to have a good trip instead regardless of the situation. (although I still am careful not to tempt it.)
I think it's because R did that to me on purpose, to show me what can happen. If it had happened without any logical reason, I don't know if I would have lived through it.
I do not recommend doing this to anyone. I was fortunate to have a strong mind and be able to work through it. This could seriously damage someone. Always trip safe.  Never forget, it is just a drug, and you WILL come out of it.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


Microsoft has announced a new command line program called Windows Terminal with the goal of being the central location for accessing command line programs.
We are so excited to announce Windows Terminal! Windows Terminal is a new, modern, fast, efficient, powerful, and productive terminal application for users o...
Strob18-May-19 07:32 PM
yes saw that!
pubkey is the 66 characters one right?(edited)
Exile1318-May-19 07:32 PM
1 min
1. ./komodo-cli getnewaddress (this gets a new address)
2. ./komodo-cli dumprivkey <ADDRESS FROM ABOVE> (this gets the wif)
3. ./komodo-cli validataddress <ADRESS FROM STEP 1> (this gets pubkey)
then pubkey is 3rd from the bottom
on the return in {}
Strob18-May-19 07:34 PM
ok validateaddress! that's the one I was looking for
Exile1318-May-19 07:34 PM
looks like
"iswatchonly": false,
"isscript": false,
"pubkey": "03d14e810f3458ce760a83c2c2193cf4ac9b1df774e7267193d66238cb38c0e25c",
im still mining lmk when you've registered
Strob18-May-19 07:36 PM
CFEKORC started!
I was looking at the paper wallet to get the pubkey and it gives 1 with 130 and 1 with 66 char. All in caps. But the command (validateaddress) gives it in lower case (66 char) so I guess it's not case sensitive(edited)
Do I need to import my private key too in CFEKORC?
PHBA206118-May-19 07:40 PM
the shorter one is compressed, the longer one is uncompressed, either one should work
Strob18-May-19 07:40 PM
ok good to know. I knew there was one compressed but good to know they both work(edited)
synced!
PHBA206118-May-19 07:42 PM
I did import my wif, not sure if it works w/o privkey or not, probably not because you need to sign tx later on
Alright18-May-19 07:50 PM
uncompressed will not work
and yes, it's case insensitive
use the one that starts with 02 or 03, that's the compressed pubkey
if it starts with 04, that's uncompressed
Strob18-May-19 07:50 PM
ok tx
now I need fund please: RFy86TMMtBTyz1EnuTsMC9DB5k3iiJLMpN
@Exile13 the signed message field is wrong in that PR
Exile1318-May-19 08:26 PM
ok
Alright18-May-19 08:26 PM
look at phba's PR as an example
Exile1318-May-19 08:29 PM
updated
1
Alright18-May-19 08:32 PM
merged
2
@Strob merged your's as well
2
Alright18-May-19 09:14 PM
Pinned a message.
CrisF18-May-19 10:40 PM
Good stuff guys!
Great to have you all here.
I think we are all going to have a lot of fun and am really keen to see the things that come out of your participation!
KMDLabs - Make & Break


A little about me
Hey there! I'm a 22 year old developer and designer living in Dallas, Texas. I'm married to a wonderful girl, and occasionally take pictures of things.
I work with the fine folks at Oven Bits, make side projects, and sometimes write words here on my blog.
I enjoy giving advice and collaborating with others. My time is pretty limited, but you can email me or tweet me and I'll get back to you as soon as I can.
I'm on other places around the web too. You can see some of my designs on Dribbble, code on Github, and follow me on Twitter.


Well you died, try harder...
Well you won, or finished, or whatever, congrats...
Thanks for playing this shoddy, thrown together, poorly balanced and poorly made game
peace


Glacier Bay Cumulative Oceanographic Monitoring Database (OC_D)
Glacier Bay, Alaska oceanographic observations in CSV format beginning 1993. Includes salinity, temperature, sigma-t, PAR, turbidity, Chlorophyll-a proxy, and dissolved oxygen in vertical profile ...


Module containing utility functions for time and temperature units conversion
Converts an ISO8601-formatted string in the format YYYY-MM-DD HH:MM:SS+00 to the correspondant UNIXtime
| Parameters: | iso (string) – the ISO8601-formatted string |
|---|---|
| Returns: | a long UNIXtime |
| Raises: | TypeError when bad argument types are provided, ValueError when the ISO8601 string is badly formatted |
Converts a UNIXtime to the correspondant ISO8601-formatted string The result string is in the format YYYY-MM-DD HH:MM:SS+00
| Parameters: | unixtime (int/long) – the UNIXtime |
|---|---|
| Returns: | an ISO8601-formatted string |
| Raises: | TypeError when bad argument types are provided, ValueError for negative values of UNIX time |
Converts a datetime.datetime object to its correspondent UNIXtime
| Parameters: | date (datetime.datetime) – the datetime.datetime object |
|---|---|
| Returns: | a long UNIXtime |
| Raises: | TypeError when bad argument types are provided |
Converts a numeric temperature from Kelvin degrees to Celsius degrees
| Parameters: | kelvintemp (int/long/float) – the Kelvin temperature |
|---|---|
| Returns: | the float Celsius temperature |
| Raises: | TypeError when bad argument types are provided |
Converts a numeric temperature from Kelvin degrees to Fahrenheit degrees
| Parameters: | kelvintemp (int/long/float) – the Kelvin temperature |
|---|---|
| Returns: | the float Fahrenheit temperature |
| Raises: | TypeError when bad argument types are provided |
Returns the UNIXtime corresponding to the time value conveyed by the specified object, which can be either a UNIXtime, a datetime.datetime object or an ISO8601-formatted string in the format YYYY-MM-DD HH:MM:SS+00`.
| Parameters: | timeobject (int/long, datetime.datetime or ISO8601-formatted string) – the object conveying the time value |
|---|---|
| Returns: | a long UNIXtime |
| Raises: | TypeError when bad argument types are provided |
Module containing utility functions for HTTP client/server interactions
Adds the API key and the query parameters dictionary to the specified API endpoint URL, returning a complete HTTP request URL.
| Parameters: |
|
|---|---|
| Returns: | a full string HTTP request URL |
Turns dictionary items into query parameters and adds them to the base URL
| Parameters: |
|
|---|---|
| Returns: | a full string HTTP request URL |
Invokes a specific OWM web API endpoint URL, returning raw JSON data. The functionality is built on the top of Python’s urllib2 library.
| Parameters: |
|
|---|---|
| Returns: | a string containing raw JSON data |
| Raises: | APICallError in chain to exceptions raised by urllib2 |
Module containing utility functions for parsing of JSON data coming from OWM web API responses
Factory method that builds a Location object out of a data dictionary data. Only certain properties of the dictionary are used: if these properties are not found or cannot be parsed, an error is issued.
| Parameters: | d (dict) – a data dictionary |
|---|---|
| Returns: | a Location instance |
| Raises: | ParseResponseError if it is impossible to find or parse the data needed to build the instance |
Factory method that builds a Weather object out of a data dictionary data. Only certain properties of the dictionary are used: if these properties are not found or cannot be parsed, an error is issued.
| Parameters: | d (dict) – a data dictionary |
|---|---|
| Returns: | a Weather instance |
| Raises: | ParseResponseError if it is impossible to find or parse the data needed to build the instance |
Parses a Forecast instance out of raw JSON data coming from OWM web API responses. Only certain properties of the data are used: if these properties are not found or cannot be parsed, an error is issued.
| Parameters: | json_data (str) – a raw JSON string |
|---|---|
| Returns: | a Forecast instance |
| Raises: | ParseResponseError if it is impossible to find or parse the data needed to build the result, APIResponseError if the OWM API returns a HTTP status error |
Parses an Observation instance out of raw JSON data coming from OWM web API responses. Only certain properties of the data are used: if these properties are not found or cannot be parsed, an error is issued.
| Parameters: | json_data (str) – a raw JSON string |
|---|---|
| Returns: | an Observation instance |
| Raises: | ParseResponseError if it is impossible to find or parse the data needed to build the result, APIResponseError if the OWM API returns a HTTP status error |
Parses a list of Observation instances out of raw JSON data coming from OWM web API responses. Only certain properties of the data are used: if these properties are not found or cannot be parsed, an error is issued.
| Parameters: | json_data (str) – a raw JSON string |
|---|---|
| Returns: | a list of Observation instances |
| Raises: | ParseResponseError if it is impossible to find or parse the data needed to build the result, APIResponseError if the OWM API returns a HTTP status error |
Module containing utility functions for time values generation/management
Gives the datetime.datetime object corresponding to tomorrow. The default value for optional parameters is the current value of hour and minute. I.e: when called without specifying values for parameters, the resulting object will refer to the time = now + 24 hours; when called with only hour specified, the resulting object will refer to the tomorrow at the specified hour and at the current minute.
| Parameters: |
|
|---|---|
| Returns: | a datetime.datetime object |
| Raises: | ValueError when hour or minute have bad values |
Module containing search and filter utilities for Weather objects lists management
Returns a sublist of the given list of Weather objects, whose items have at least one of the keywords from the given list as part of their detailed statuses.
| Parameters: |
|
|---|---|
| Returns: | a list of Weather objects |
Extracts from the provided list of Weather objects the item which is closest in time to the provided UNIXtime.
| Parameters: |
|
|---|---|
| Returns: | the Weather object which is closest in time or None if the list is empty |
Checks if the supplied UNIX time is contained into the time range (coverage) defined by the most ancient and most recent Weather objects in the supplied list
| Parameters: |
|
|---|---|
| Returns: | True if the UNIX time is contained into the time range, False otherwise |
Checks if one or more keywords in a given list is contained into the detailed weather status of a Weather object
| Parameters: |
|
|---|---|
| Returns: | True if one or more matchings are found, False otherwise |
Checks if one or more of the detailed statuses of the Weather objects into the given list contain at least one of the keywords in the given list
| Parameters: |
|
|---|---|
| Returns: | True if one or more matchings are found, False otherwise |
Module containing utility functions for generating XML strings
Returns an XML representation of a plain Python dictionary, in example: {“a”: 3, “b”: “foo”}. The dictionary should not contain None values and nested dictionaries. :param d: the input dictionary :type d: dict :returns the XML string representation of the dictionary


For the fig-swirl: Melt butter over medium heat in a saucepan. Add brown sugar and stir to dissolve. Halve all of the figs and toss in the saucepan with water and lemon juice. Cook over medium heat, stirring frequently, until you have a chunky-jammy mixture. Add salt with one or two stirs, set aside and let cool completely.
Ice cream: In a small pot over medium heat, combine milk, and granulated sugar until sugar is completely dissolved and the milk is just barely lukewarm. Whisk in the egg yolks. Set mixture in the fridge and wait until the fig mixture is cooled.
Using an ice cream machine, pour liquids into the frozen basin and process according to manufacturer instructions, i.e., let spin and thicken for 20 minutes before adding mascarpone, fig jam mixture, and the nuts. Continue to process for +/- 10 minutes. Pour semi-frozen mixture into a pyrex dish or glass tupperware. Freeze for at least two hours before serving.
1 1/2 cups milk
1/2 cups marscaopne
1/2 tsp pink salt
1 lb Black Mission Figs
1/2 cup brown sugar
2-4 tbsp water
1 1/2 cups heavy cream
1/3 granulated sugar
2 egg yolks
1 lemon, juiced
2 tbps butter
1 cup honey roasted pecans, roughly chopped
Vanessa Stevenson
Food enthusiast, photography fan. Add a pinch of raw foodism and that's pretty much who I am.


[gecode-users] Benchmarks comparing Gecode to other systems?
Jonathan Skovhus Andersen
jonathanskovhus at gmail.com
Thu Apr 7 13:49:24 CEST 2011
Hi,
Does anyone know where I can find benchmarks comparing Gecode to other
system. I have read several places that they should be on Gecode.org, but I
can't find it.
/Jonathan Skovhus.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.gecode.org/pipermail/users/attachments/20110407/3218b958/attachment.htm>
More information about the users
mailing list


Plugins are used to complement the normal system of inheritance in object-oriented Perl. Whereas a child object can inherit methods from multiple parents, a parent object normally cannot be overridden by multiple children. The plugin system "aggregates" the contents of several methods into one "master" method that can then be used by mod_perl when rendering the webpage.
The module conf/Plugins.pm
controls which plugins are
used by an instance of Ensembl and their order of precedence. In a
standard Ensembl mirror, the module will define a plugin array as follows:
$SiteDefs::ENSEMBL_PLUGINS = [ 'EnsEMBL::Mirror' => $SiteDefs::ENSEMBL_SERVERROOT.'/public-plugins/mirror', 'EnsEMBL::Ensembl' => $SiteDefs::ENSEMBL_SERVERROOT.'/public-plugins/ensembl' ];
The plugins are processed in reverse order, starting with the last one:


Your offer
You sent this offer to {% if data['theclaimant'] == 'true' %}{{ partyName( 'defendant' ) }}{% else %}{{ partyName( 'claimant' ) }}{% endif %} on 12 July 2019.
| The offer | I'll pay a maximum of £100 towards any new materials. |
| By when | 1 December 2018 |


Input Hint
Display input hints to users within a text input and remove them automatically
on focus/form submission. The hint text for each input can be supplied by
assigning it to the standard XHTML title
attribute, or by supplying
a jQuery selector that, when evaluated in the context of some input element
(e.g. $(selector, inputElement)
), matches an auxiliary element
containing the hint text.
Examples of both methods are given below:
HTML: <input type='text' name='forename' hint='Forename' /> JS: $('*[title]').inputHint();
HTML: <input type='text' name='forename' /> <kbd>Enter your forename here</kbd> JS: $('input').inputHint({using: '+kbd'});


<IP_ADDRESS>
Welcome to Embedded Web Server
The embedded Web server (EWS) is a web tool that allows you to view product status information, change settings, and manage device from your computer using a Web browser.
For more information, see the electronic User Guide available on your computer after you install the software. (The user guide is also available online at www.hp.com/support)
Status
Status: Ready
Estimated Ink Levels:
Cyan: 27%
Magenta: 50%
Yellow: 42%
Black: 28%
Setup
Set up common features of your device.
Digital Filing:
- Scan to Network Folder Setup
- Scan to E-mail Setup
- Digital Fax Setup
Connectivity:
- Network Settings
- Wireless (802.11) Setup Wizard
- Bluetooth Settings
Manage
Manage settings for common features of your device.
Security:
- Admin Password Setup
Contacts:
- Fax Speed-dial
- E-mail Address Book
Reports:
- Usage Tracking
- Fax Log
- Alerts
Maintenance:
- Diagnostic Tools
- Backup and Restore Settings
Setup
Help
Preferences
Tools
Power Management
Network
Bluetooth
Overview
Status
Applications
EWS Settings
Webscan
Webscan lets you scan photos and documents from your device to your computer using a Web browser, even if you choose not to install the device software on your computer.


Breaking JavaScript
into Pieces
By @kirjs
Bin to dec
Why do we need to break JavaScript into pieces?
Why do we need to break JavaScript into pieces?
- Building tools
- Getting more control of your code/better refactoring/codemods
- Make robots do their job/More peaceful code reviews
- Creating educational projects/Games
- Curiousity/Inspiration
Let's solve some real issue
There's a debugger statement in our code, can we get rid of it?
JavaScript is not like sausage!
Abstract Syntax Tree Example
Traversing AST with babel-traverse
Transforming AST babel-traverse
Autofixing fit (focused tests)
Focusing a test by line number
Making this work with all files with
ESLint (on
AstExplorer)
More links
Bonus?
Thanks Pierre-Auguste for pics!
Thank you!
@kirjs


It was an interesting experience drawing up the navigation/basic look of my game, but there was a lot I didn't know how to translate into a black and white form, so I think it made it difficult for my partner to experience. Stuff like an item with a white halo around it to indicate that it should be hovered/click on. After the initial testing, I found that my navigation needs to be more prominent because my partner kept pressing on the dialogue box, thinking it was a link (probably because I wrote "explore" in it, so that was also confusing). I also realized how much I am trying to do within the couple of weeks we have left. (I have to draw A LOT of things within the next week so I can code everything.) That... is... so... exciting. ._. I may have to simplify some things to make it easier on myself, as well as the player. Also, I don't have a finalized storyboard/map of my game or that some pages/overlays are similar, but I put in the key aspects.
Reminder: Add instructions option to menu.


{{- partial "head.html" . -}}
{{- partial "header.html" . -}}Sasya GoMos cloud app runs 24X7 securely to ingest high speed data from its thousands of sensors.
Configurations of devices, sensors, payloads, alerts, rules and trigger points can be done on GoMos.
Dashboards to see the real time sensor data, and last alerts generated.
Operating dashboard to see status of automated devices and manually operate devices
Timely Alerts and Notifications with current reading of the parameters and possible advisory on next action.


[1]
ANDROID,3G,NO CONTRACT,WIFI, BLUETOOTH,; NONE I CAN THINK OF.
[2]
Android, size, prepaid/ econimy; a bit sluggish some times, bluetooth restrictions


CURLOPT_PIPEWAIT explained
NAME
CURLOPT_PIPEWAIT - wait for pipelining/multiplexing
SYNOPSIS
#include <curl/curl.h>
CURLcode curl_easy_setopt(CURL *handle, CURLOPT_PIPEWAIT, long wait);
DESCRIPTION
Set wait to 1L to tell libcurl to prefer to wait for a connection to confirm or deny that it can do pipelining or multiplexing before continuing.
When about to perform a new transfer that allows pipelining or multiplexing, libcurl will check for existing connections to re-use and pipeline on. If no such connection exists it will immediately continue and create a fresh new connection to use.
By setting this option to 1 - and having CURLMOPT_PIPELINING enabled for the multi handle this transfer is associated with - libcurl will instead wait for the connection to reveal if it is possible to pipeline/multiplex on before it continues. This enables libcurl to much better keep the number of connections to a minimum when using pipelining or multiplexing protocols.
The effect thus becomes that with this option set, libcurl prefers to wait and re-use an existing connection for pipelining rather than the opposite: prefer to open a new connection rather than waiting.
The waiting time is as long as it takes for the connection to get up and for libcurl to get the necessary response back that informs it about its protocol and support level.
DEFAULT
PROTOCOLS
EXAMPLE
AVAILABILITY
RETURN VALUE
Returns CURLE_OK if the option is supported, and CURLE_UNKNOWN_OPTION if not.
SEE ALSO
CURLOPT_FORBID_REUSE, CURLOPT_FRESH_CONNECT, CURLMOPT_PIPELINING, CURLMOPT_MAX_HOST_CONNECTIONS
This HTML page was made with roffit.


Accomodations
Choose from our many wonderful options for your resort stay
The Portland Suite
Stay in our spacious suite including a kitchen
The Salem Room
Single and double bed rooms are available


AngularJS Presentations
-
Introduction to AngularJS
-
Examples
-
Drag and Drop
-
Examples
-
Canvas
-
Examples
-
Ajax File Uploads
-
Examples
-
Creating a static E2E rig
-
Examples
-
Angular UI Bootstrap's $dialog service
-
Examples
-
Nested Routing with ui-router
-
Examples


EBD - Easton Bible DIctionary
Destroyer
DESTROYER
"DESTROYER "(
Exodus 12:23
), the agent employed in the killing of the first-born; the destroying angel or messenger of God. (Comp.
2 Kings 19:35
;
2 Samuel 24:15, 16
;
Psalm 78:49
;
Acts 12:23
.)
"DESTROYER "(Exodus 12:23), the agent employed in the killing of the first-born; the destroying angel or messenger of God. (Comp. 2 Kings 19:35; 2 Samuel 24:15, 16; Psalm 78:49; Acts 12:23.)


{% include meta_tags/base.html %} {% include meta_tags/sharing.html %} {% include externals/styling.html %}


{% include common/head.html %} {% include common/preloader.html %}
{{ content }} {% include common/footer.html %} {% include common/js.html %}


MS&E310
Linear Optimization
2014-2015 Winter
|
Announcements
(Updated Frequently)
|
General Info
|
Course Info
|
Handouts
|
Assignments
|
MS&E 310
Handouts
Title
Last Updated
Lecture note #17
Updated 03/10/15
Suggested Project 2
updated 03/10/2015
Lecture note #16
Updated 03/08/15
Lecture note #15
Updated 02/26/15
Lecture note #14
Updated 02/26/15
Various Matlab Solvers, such as hsdLPsolver.m
Updated 02/25/15
Lecture note #13
Updated 02/24/15
Lecture note #12
Updated 02/16/15
Lecture note #11
Updated 02/16/15
Lecture note #10
Updated 02/07/2015
Lecture note #9
Updated 02/07/2015
Lecture note #8: Midterm Review
Updated 02/01/2015
Lecture note #7
Updated 02/01/2015
Lecture note #6
Updated 01/29/2015
Suggested Project 1
updated 01/27/2015
Lecture note #5
Updated 01/25/2015
Lecture note #4
Updated 01/11/2015
Lecture note #3
Updated 01/11/2015
Lecture note #2
Updated 01/06/2015
Lecture note #1
Updated 01/04/2015
4th Edition Text (trial version)
Updated 01/01/2015
Final Review
Updated 12/03/13
Sample Midterm Exam Problems
10/22/13
Research Topic: Online preduction market
Updated 10/10/12
Sample of Final Problems
12/04/06
IPM Matlab Demonstration
11/30/06
Bonus Case Supplement File
11/29/06
Bland-Rule Proof
10/27/04
Facility Location
Updated 10/10/06
World Series Auction
Posted 10/5/06
MDVRP Matlab Demonstration
Posted 9/27/06
LP Excel Demonstration
Posted 9/27/06
Supplement Note: Ellipsoid Method
11/7/05
Supplement Text
10/28/05
Sample Final Problems
12/4/04


DayPilot Pro for JavaScript
»
Demo
AJAX Calendar/Scheduling Widgets for JavaScript.
Download
Download a trial version (1.1 MB).
DayPilotProJavaScriptTrial-8.3.2450.zip
Home
Calendar
Month
Scheduler
Gantt
Kanban
JavaScript Event Calendar
Outlook-like day/week view. Customizable columns.
JavaScript Monthly Event Calendar
Outlook-like month view.
JavaScript Scheduler
A time line for multiple resources.
JavaScript Gantt
Gantt chart displays a time line with one task per row.
JavaScript Kanban
Kanban displays tasks organized by columns (phases).


--- layout: post title: Hug date: '2016-01-20T18:30:49+01:00' categories: - Sketches picture_url: https://film-Storyboards.tumblr.com/post/137716540145 ---


|
Chip8 Emulator
|
Chip8 prototype class. More...
#include <Chip8.h>
Public Member Functions | |
| Chip8 () | |
| Chip8 Constructor More... | |
| ~Chip8 () | |
| Chip8 Destructor. More... | |
| void | LoadROM (char const *) |
| ROM Loader More... | |
| void | OP_00E0 () |
| Clear Screen More... | |
| void | OP_00EE () |
| Return from Sub Routine More... | |
| void | OP_1nnn () |
| Jump to location NNN More... | |
| void | OP_2nnn () |
| Call addr More... | |
| void | OP_3xkk () |
| SE Vx, byte More... | |
| void | OP_4xkk () |
| SNE Vx, byte More... | |
| void | OP_5xy0 () |
| SE Vx, Vy More... | |
| void | OP_6xkk () |
| LD Vx, byte More... | |
| void | OP_7xkk () |
| ADD Vx, byte More... | |
| void | OP_8xy0 () |
| LD Vx, Vy More... | |
| void | OP_8xy1 () |
| OR Vx, Vy More... | |
| void | OP_8xy2 () |
| AND Vx, Vy More... | |
| void | OP_8xy3 () |
| XOR Vx, Vy More... | |
| void | OP_8xy4 () |
| ADD Vx, Vy More... | |
| void | OP_8xy5 () |
| SUB Vx, Vy More... | |
| void | OP_8xy6 () |
| SHR Vx More... | |
| void | OP_8xy7 () |
| SUBN Vx, Vy More... | |
| void | OP_8xyE () |
| SHL Vx More... | |
| void | OP_9xy0 () |
| SNE Vx, Vy More... | |
| void | OP_Annn () |
| LD I, addr More... | |
| void | OP_Bnnn () |
| JP V0, addr More... | |
| void | OP_Cxkk () |
| RND Vx, byte More... | |
| void | OP_Dxyn () |
| DRW Vx, Vy, nibble More... | |
| void | OP_Ex9E () |
| SKP Vx More... | |
| void | OP_ExA1 () |
| SKNP Vx More... | |
| void | OP_Fx07 () |
| LD Vx, DT More... | |
| void | OP_Fx0A () |
| LD Vx, K More... | |
| void | OP_Fx15 () |
| LD DT, Vx More... | |
| void | OP_Fx18 () |
| LD ST, Vx More... | |
| void | OP_Fx1E () |
| ADD I, Vx More... | |
| void | OP_Fx29 () |
| LD F, Vx More... | |
| void | OP_Fx33 () |
| LD B, Vx More... | |
| void | OP_Fx55 () |
| LD [I], Vx More... | |
| void | OP_Fx65 () |
| LD [Vx], I More... | |
Chip8 prototype class.
Contains all the data members and the associated member functions
The main components to be emulated include:
| Chip8::Chip8 | ( | ) |
Chip8 Constructor
Used to initialize the Chip-8 member variables
| void Chip8::LoadROM | ( | char const * | filename | ) |
ROM Loader
Loads ROM into the main memory before any execution occurs
| filename | Constant char ptr to filename |
| void Chip8::OP_00E0 | ( | ) |
Clear Screen
Set the entire video buffer to zeroes
Defining implementation for all the 34 opcodes
| void Chip8::OP_00EE | ( | ) |
Return from Sub Routine
Set the program counter to the calling routine
| void Chip8::OP_1nnn | ( | ) |
Jump to location NNN
Set the program counter to nnn
| void Chip8::OP_2nnn | ( | ) |
Call addr
Call sub-routine at nnn
| void Chip8::OP_3xkk | ( | ) |
SE Vx, byte
Skip next instruction if Vx = kk
| void Chip8::OP_4xkk | ( | ) |
SNE Vx, byte
Skip next instruction if Vx != kk
| void Chip8::OP_5xy0 | ( | ) |
SE Vx, Vy
Skip next instruction if Vx = Vy
| void Chip8::OP_6xkk | ( | ) |
LD Vx, byte
Set Vx = kk
| void Chip8::OP_7xkk | ( | ) |
ADD Vx, byte
Set Vx = Vx + kk
| void Chip8::OP_8xy0 | ( | ) |
LD Vx, Vy
Set Vx = Vy
| void Chip8::OP_8xy1 | ( | ) |
OR Vx, Vy
Set Vx = Vx OR Vy
| void Chip8::OP_8xy2 | ( | ) |
AND Vx, Vy
Set Vx = Vx AND Vy
| void Chip8::OP_8xy3 | ( | ) |
XOR Vx, Vy
Set Vx = Vx XOR Vy
| void Chip8::OP_8xy4 | ( | ) |
ADD Vx, Vy
Set Vx = Vx + Vy. Set VF = carry
| void Chip8::OP_8xy5 | ( | ) |
SUB Vx, Vy
Set Vx = Vx - Vy. Set VF = NOT borrow
| void Chip8::OP_8xy6 | ( | ) |
SHR Vx
Set Vx = Vx SHR 1
| void Chip8::OP_8xy7 | ( | ) |
SUBN Vx, Vy
Set Vx = Vy - Vx. Set VF = NOT borrow
| void Chip8::OP_8xyE | ( | ) |
SHL Vx
Set Vx = Vx SHL 1. Set VF = MSB
| void Chip8::OP_9xy0 | ( | ) |
SNE Vx, Vy
Skip next instruction if Vx != Vy
| void Chip8::OP_Annn | ( | ) |
LD I, addr
Set I = nnn
| void Chip8::OP_Bnnn | ( | ) |
JP V0, addr
Jump to location nnn + V0
| void Chip8::OP_Cxkk | ( | ) |
RND Vx, byte
Set Vx = randomByte AND kk
| void Chip8::OP_Dxyn | ( | ) |
DRW Vx, Vy, nibble
Draw n-byte sprite starting at memory location I at (Vx, Vy). Set VF = collision
| void Chip8::OP_Ex9E | ( | ) |
SKP Vx
Skip next instruction if key with value = Vx is pressed
| void Chip8::OP_ExA1 | ( | ) |
SKNP Vx
Skip next instruction if key with value = Vx is NOT pressed
| void Chip8::OP_Fx07 | ( | ) |
LD Vx, DT
Set Vx = delay timer value
| void Chip8::OP_Fx0A | ( | ) |
LD Vx, K
Wait for key press and store its value in Vx
| void Chip8::OP_Fx15 | ( | ) |
LD DT, Vx
Set delay timer value = Vx
| void Chip8::OP_Fx18 | ( | ) |
LD ST, Vx
Set sound timer = Vx
| void Chip8::OP_Fx1E | ( | ) |
ADD I, Vx
Set I = I + Vx
| void Chip8::OP_Fx29 | ( | ) |
LD F, Vx
Set I = location of sprite for digit Vx
| void Chip8::OP_Fx33 | ( | ) |
LD B, Vx
Store BCD representation of Vx in memory locations I, I+1, I+2
| void Chip8::OP_Fx55 | ( | ) |
LD [I], Vx
Store registers V0 to Vx in memory starting from location I
| void Chip8::OP_Fx65 | ( | ) |
LD [Vx], I
Read registers V0 to Vx starting from memory location I


A map of the USA from the United States Geological Survey (USGS). Irucka worked with this data set while a Cherokee Nation Technology Solutions (CNTS) USGS Contractor and/or USGS employee. It is replaced by 'states2k'.
| Version: | 1.0.1 |
| Depends: | R (≥ 2.14.0), sp (≥ 1.1-0) |
| Suggests: | rgdal |
| Published: | 2017-01-10 |
| Author: | Irucka Embry [aut] |
| Maintainer: | Irucka Embry <iembry at usgs.gov> |
| License: | CC0 |
| Copyright: | This software is in the public domain because it contains materials that originally came from the United States Geological Survey, an agency of the United States Department of Interior. For more information, see the official USGS copyright policy at http://www.usgs.gov/visual-id/credit_usgs.html#copyright |
| NeedsCompilation: | no |
| Materials: | README NEWS |
| CRAN checks: | USGSstates2k results |
| Reference manual: | USGSstates2k.pdf |
| Package source: | USGSstates2k_1.0.1.tar.gz |
| Windows binaries: | r-devel: USGSstates2k_1.0.1.zip, r-release: USGSstates2k_1.0.1.zip, r-oldrel: USGSstates2k_1.0.1.zip |
| OS X binaries: | r-release: USGSstates2k_1.0.1.tgz, r-oldrel: USGSstates2k_1.0.1.tgz |
| Old sources: | USGSstates2k archive |
Please use the canonical form https://CRAN.R-project.org/package=USGSstates2k to link to this page.


A face analyzing app that will scan your picture and show how close you match up to George Clooney.
It is so easy! Choose one of the options below as a way to upload your photo. Our sophisticated technology will compare your likeness to that of Mr. Clooney .


This is my page
Starting A Project
- Make a directory
- CMD Line: mkdir repos/<name-of-project>
- Change into the directoty and create a file (index.html)
- CMD Line: cd repos/<name-of-project>
- CMD Line: touch index.html
- Initialize the repository and make a commit
Note: Be sure you're in the project directory
- CMD Line: git init
- CMD Line: git add -A && git commit -am "Initialize repo"
- Set the remote origin as the main URL and push
CMD Line: git remote add origin <repo URL>
- CMD Line: git push -u origin master
- Begin working on the prokect, adding and committing changes
- (To add new files) CMD Line: git add -A
- CMD Line: git commit -am "(message)"
- Finally, push changes to the repo
Upload to GitHub. Where real artists ship.


ScrapeTHIS!!!
A Restful Web Scraper, Powered by MongoDB. Now with comments!
Click for entries saved from these reddits:
Click on an article to pull up comments!
For RESTful routes see the readme.


Café Meals for Pickup Available During Café Closures
For the general safety of all café participants and the community, the Illinois department on aging has mandated that we close our café dining rooms. To go and delivered meal options are being made available to café participants during this time. To take part in either of these, contact the locations below to sign up and confirm your pickup meals. Pickup days and times listed below are only for clients who have already confirmed with staff.
Volunteer Opportunities
At Community Nutrition Network & Senior Services Association/Meals on Wheels, our volunteers are a critical part of our operation. The most common volunteer job is delivering meals and friendly greetings to home-bound seniors. Most typically, this involves picking up meals at a central location and delivering them along a pre-determined route in communities throughout northern Illinois, including Cook, Kane, Kendall, and Grundy counties.


dialpad
Email Verification Code
replay
Back to Login Screen
---
An email was sent to your inbox containing a verification code. Please check your inbox and provide us with that code.
{errormsg}
code
Didn't Recieve Your Email?
Choose Another Email Address
I didn't recieve the email
I want to choose another email
lock
Loading


# Installing Windows on a physical drive using VirtualBox
![Alt text](img/vbox-screen.png)
## Keyword: _physical_ drive
This guide uses Windows 10, but this applies to any version of Windows. I've tested this on Windows 7, 8, and 8.1.  Use source of physical media, such as a Windows install CD/DVD or USB flash drive.
2. Use VirtualBox/Parallels Desktop/VMWare Fusion and set up a virtual machine.
### Why run it natively?
_To play games_. Or to be able to use 100% of the hardware resources for other applications, if you're into productivity and those things... VMs are much more convienent for everything else.
### Why run a VM?
VMs are super convenient for many reasons:
* They can run side-by-side with macOS without partitioning, rebooting, etc...
* You don't have to reboot
* They can be backed up
* You don't have to reboot
* You can use snapshots to revert immediately back to working installations
* You don't have to reboot
* They can integrate with the host OS for the purposes of transferring files, running guest OS-specific applications, etc...
* _You don't have to reboot_
## An alternative method for native installation
We can use VirtualBox to start the installation process for Windows on a physical drive, then complete the installation by booting the drive using the actual hardware (instead of the VM).
#### Why not use a flash drive?
See my notes down at the bottom about the "Why some Macs cannot use Boot Camp Assistant to make USB boot drive."
#### Why not use a CD/DVD?
_...because we're not stuck in the 90s anymore..._
---
### 1. Install [VirtualBox](https://www.virtualbox.org/wiki/Downloads)
### 2. Set up your Mac's secondary physical drive for access
#### VirtualBox needs full access to the physical drive that you plan to use.
Fire up Terminal and look for your physical drive's mount point using `diskutil list`
![Alt text](img/diskutil-list.png)
On my MacBook Pro, there are two physical SSDs. The one I am interested in using is `/dev/disk0`. Next, we have to set up the correct permissions for the physical drive so that userland VirtualBox can access it.
```
diskutil umountDisk /dev/disk0
sudo chmod 775 /dev/disk0
sudo chown tim /dev/disk0
```
VirtualBox comes with a nice tool that we can use called `createrawvmdk`. We will use this to create the .VMDK file that will be attached to the VM. This VMDK is simply a pointer to our physical drive.
```
sudo VBoxManage internalcommands createrawvmdk -filename "Windows.vmdk" -rawdisk /dev/disk0
```
VirtualBox will create a file called `Windows.vmdk` in your working directory.
![Alt text](img/vmdk.png)
VirtualBox will remount the disk after it has created the VMDK. We need to unmount it and repeat the permissions modification:
```
diskutil umountDisk /dev/disk0
sudo chmod 775 /dev/disk0
sudo chown tim /dev/disk0
```
We also need to define the permissions for the VMDK file so that the VM will have access to the physical drive:
```
sudo chmod 775 ~/Windows.vmdk
sudo chown tim ~/Windows.vmdk
```
Now we are done setting up the VMDK for physical drive access.
### 3. Create the VM
Open VirtualBox and create a new virtual machine.
![Alt text](img/create-vm-1.png)
Give it a solid amount of RAM
![Alt text](img/create-vm-2.png)
**Select "Do not add a virtual disk."** This is important because VirtualBox by default attaches virtual disks using a SATA controller. Initially, we need to attach the physical drive using the IDE controller. After the drive is formatted and the install files are copied over, the rest of the installation is completed using the native hardware (and thus, the native onboard SATA controller), so VBox's setup becomes irrelevant.
![Alt text](img/create-vm-3.png)
Select "Create" and we are done.
### 4. Change the virtual disk controller
Open up the settings for your new VM and select "storage." Remove the default SATA storage controller, and add an IDE storage controller. Change the "Type" to "ICH6."
![Alt text](img/ide-win-1.png)
Add an optical drive, and attach your Windows ISO to it.
![Alt text](img/ide-win-2.png)
Set the permissions on the physical drive and the VMDK before attaching it to the virtual machine with
```
diskutil umountDisk /dev/disk0
sudo chmod 775 /dev/disk0
sudo chown tim /dev/disk0
sudo chmod 775 ~/Windows.vmdk
sudo chown tim ~/Windows.vmdk
```
Add a virtual hard disk drive to the VM:
![Alt text](img/ide-win-3.png)
![Alt text](img/ide-win-4.png)
![Alt text](img/ide-win-5.png)
You'll notice that the size of the virtual hard disk is the same as the size of your physical disk.
### 5. Before launching the VM...
When you add the VMDK, VBox mounts the physical drive, so we need to set the permissions again before we launch the VM. This needs to be done every time your Mac mounts the physical drive. This happens every time you reboot the Mac, and every time you shut down the VM.
So, once more:
```
diskutil umountDisk /dev/disk0
sudo chmod 775 /dev/disk0
sudo chown tim /dev/disk0
sudo chmod 775 ~/Windows.vmdk
sudo chown tim ~/Windows.vmdk
```
### 6. Launch the VM
Click "Start" to fire up the VM. Make sure to press a key to boot the installer from the DVD image.
![Alt text](img/launch-vm-1.png)
This should look familiar:
![Alt text](img/launch-vm-2.png)
Format the drive as you normally would:
![Alt text](img/launch-vm-3.png)
And then start the Windows installation. When it's finished copying the files, it will reboot.  **If you're not quick enough, and the installation process starts in the VM, you're gonna be starting over, so pay attention**.
### 7. Finish the installation natively
1. Reboot your Mac while holding the Option key.
2. Select "Windows"
3.
### 8. Install Bootcamp drivers
Plug in the flash drive that you used to store the Bootcamp drivers, and install them in Windows. You're done! _Go download [Steam](http://store.steampowered.com) and [Origin](https://www.origin.com/en-us/store/) and play some games_.
---
## End Notes
---
#### Why some Macs cannot use Boot Camp Assistant to make USB boot drive
If you want to go the USB flash drive route, you're stuck with Apple's Boot Camp Assistant utility. Boot Camp Assistant can not only download the Bootcamp drivers for your Mac, but it can also use a Windows 7, 8, 8.1, or 10 image to create a USB boot drive, which will then allow you to boot your Mac from it and install Windows. _However_, Apple's BCA is configured such that if your Mac originally shipped with an optical drive, it will force you to use a physical Windows CD/DVD to install Windows using the Boot Camp route.  It prevents us from taking advantage of the convenience and speed of USB and an ISO image of Windows on any Mac that is not a MacBook Air (or retina Pro)
2. If you swapped your useless optical drive for a secondary SSD/HDD carrier ([OWC's Data Doubler](https://eshop.macsales.com/shop/internal_storage/Data_Doubler) is one example), you literally have no optical drive. BCA fails to account for hardware changes, and will refuse to allow you to create a USB drive despite not having access to an actual optical drive.
#### Further notes on BCA
Boot Camp Assistant can also non-destructively reparition your boot disk to make room for a Windows partition. _Please don't go this route_. The hybrid MBR partition scheme sucks, and will instantly corrupt your Windows installation if you attempt to modify any of the GPT partitions.
----
### Limits of VM
We all know that installing Windows (or any OS) in a VM takes up space on your main boot drive. We also know that you obviously cannot boot from a .VDI, .VHD, .HDD, or a .VMDK file, which is the virtual hard disk file for your VM.
#### Limits of booting a Windows installation (_not the installer_) on different hardware
Windows installs itself by first copying the critical files from the installation media to the drive on which it will be installed, then reboots and continues the installation using the files already copied to the boot drive. The reason this is important is because Windows (in CSM) configures itself for the hardware that it is completing the installation on. So, if you complete the installation on the native hardware, Windows will configure itself for the native hardware. If you complete the installation in a VM, Windows will configure itself for the virtual/emulated hardware.
---
Copyright © wheelsandbytes 2015-2017. All Rights Reserved


Can
Simple English Wikipedia
editors
teach
us
readability?
For Aizawa Lab
by Hugo Mougard on
May the 16th
Overview
- Goal: learning how to make a text readable
- Idea: unsupervised parallel corpus construction
- Walking the walk (how the corpus was built)
- Corpus metrics
- Learning from the corpus:
- Lexical mappings
- String rewriting
- Tree rewriting
- Conclusion
Making texts readable
Goal is to learn how to make a text readable.
With a weak definition of
readable (due to the approach):
- No consideration of
the reader
- Weak consideration of
the text domain
- Strong emphasis on general syntactic ease
- Also strong emphasis on general lexical ease
Idea
Use Simple English
Wikipedia revision history to build a parallel
corpus of poorly readable
$\mapsto$ readable texts.
Building the corpus
→ Best explained with an example!
Mappings
- ~38k mappings
- ~30k are unique
- ~24k original terms have one
translation only.
Top 10 most translated
| , | 319 |
| and | 191 |
| The | 106 |
| , and | 98 |
| which | 63 |
| , which | 61 |
| of | 60 |
| in | 60 |
| It | 59 |
| to | 57 |
| with | 55 |
Top 3 translations of
“, which”
(in the filtered resource)
A tool to query the corpus
→ Demo time again!
Lexical mappings
Most straightforward way to use the corpus. Possible
variations:
-
Use of the context to decide whether or not the
mapping is applicable:
- Context vectors
- Fixed window to improve grammaticality
- Including POS and parse information
Lexical mappings generalized
We can learn (generalize) in some cases:
-
I decided
to not do that
→ I decided
not to do that
-
“It is about time”,
he said → “About time”, he said
→ We know how to derive every target
word from the source words. We can
generalize (e.g. to POS or parse info).
→ Can be extended to inflections.
… and introduce weights
Ranking translations
We can then choose a weight and rank:
| Name |
Set |
⊕ |
⊗ |
0 |
1 |
| Real |
$\{0, +\infty\}$ |
$+$ |
$*$ |
$0$ |
$1$ |
| Log |
$\{-\infty, +\infty\}$ |
$-\log(e^{-x} + e^{-y})$ |
$+$ |
$+\infty$ |
$0$ |
| Tropical |
$\{-\infty, +\infty\}$ |
$\min$ |
$+$ |
$+\infty$ |
$0$ |
| MinMax |
$\{-\infty, +\infty\}$ |
$\min$ |
$\max$ |
$+\infty$ |
$-\infty$ |
| MaxMin |
$\{-\infty, +\infty\}$ |
$\max$ |
$\min$ |
$-\infty$ |
$+\infty$ |
From strings to trees
With parse trees available, we can define tree
transducers, for example as:
- one branch per sentence/transformation (as before)
- recursively pattern matche on the root node and
apply transformation
- the branches split at each level, as the resulting
parse tree.
Conclusion
- Simple English Wikipedia is a promising resource
- There are many ways we can approach rewriting for
readability
- Please get in touch if you have an idea of another
one!
Thank
you
very
much
for
your
attention
☕
Do you have any
question?


The Truman Show
As Reviewed by James Brundage
There's one thing that Peter Weir (the director) does with The Truman Show that makes it utterly brilliant, and it's something so subtle that you have to think to notice it. The entire time you're viewing Truman, you're not watching a movie, you're watching a show. The Truman Show, in fact. From its opening frame, where Big Brother-esque creator Christof is explaining his concept of The Truman Show, you are being drawn not into a film but into a television story. In fact, as it remains strictly within the dome in which Truman lives for the first half of the film, you are watching him not in the conventional shot of a box shape, but instead in the shape of a human eye. In the paranoid world of Truman, you are watching.
The Truman Show, in truth, has no truth. It's a movie about the farce of small town reality, and when you go there, you get weird. In so many ways this movie mirrors the darker, more industrial and film noir Best Picture nominated "Blue Velvet" (1986), the David Lynch film in which a man walks through a field, begins throwing stones at a small shack, and picks up a human ear. The bittersweet small town satire in this film is coolly and calmly apparent. It's not a fast film. It's not a funny film. What it is is a film about humanity, about human reactions, and about how strange our realities can be as we accept them. Triumphant and sorrowful, the movie reminds me of 94's Forrest Gump, another film where you had a man not quite knowing his world.
The plot is simple: the plot of any negative utopia book or movie. A man, discovering that THEY are watching, does not like this and tries to escape. But what is he escaping from? In reality it is paradise. Acted, melodramatic, but still paradise. And the thing is, he's just like everyone else in a small town: he wants to get out.
But we have people against him. The Big Brother (George Orwell's "1984") of the establishment would rather he live in the dome, live and die on public television. Of course this makes it a film about triumph. But it has a twist to it: at the end, it makes it so you don't know what you want. Posed to go out the door, part of you is cheering for him to run, and part of you wants him to stay, to continue providing hope. He's told to say something. He thinks. Opens his mouth and …
You'll have to see it for yourself.
http://fly.to/criticsheaven
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


In the Ruby language, there's always a seemingly large number of ways to complete a certain task. This is how I feel when I look at #cycle. It takes an an enumerable and calls the following code block repeatedly for an n number of times. Here's the example code given in the Ruby documentation:
a = ["a", "b", "c"]
a.cycle { |x| puts x } # print, a, b, c, a, b, c,.. forever.
a.cycle(2) { |x| puts x } # print, a, b, c, a, b, c.
As you can see, it's similar to #times except it's specifically for each element of the enumerable. I'll admit, I had trouble coming up with a viable use for #cycle, but here are some examples that will hopefully help you learn more about it!
The following code will print out a times table for the numbers 1 through 10. #cycle is one of the many methods you could do to iterate through the range (1..10).
i = 1
until i == 11
  (1..10).cycle(1){|x| print "#{x*i} "}
  puts "\n"
  i+=1
end
#cycle takes a block, but if no block is given, it returns an enumerator. This means you can create an "infinite" iteration of sorts. The following is what happens when you try this in IRB:
>> infinite_numbers = (1..3).cycle
=> #<Enumerator: 1..3:cycle>
If you were to keep calling infinite_numbers.next, it'll keep looping from 1, 2, 3, 1, 2, 3, and so on. Whether or not you can find a use for this is up to you!


name: John Doe
age: 22
type: NORMAL
name: Mary Lee
age: 27
type: HYPER
name: Wong Fan
age: 33
type: SOFT
name: John Doe
age: 22
type: NORMAL
name: Mary Lee
age: 27
type: HYPER
name: Wong Fan
age: 33
type: SOFT


One can improve performance on many systems by overlapping communication and computation. This is especially true on systems where communication can be executed autonomously by an intelligent communication controller. Light-weight threads are one mechanism for achieving such overlap. An alternative mechanism that often leads to better performance is to use nonblocking communication. A nonblocking send start call initiates the send operation, but does not complete it. The send start call can return before the message was copied out of the send buffer. A separate send complete call is needed to complete the communication, i.e., to verify that the data has been copied out of the send buffer. With suitable hardware, the transfer of data out of the sender memory may proceed concurrently with computations done at the sender after the send was initiated and before it completed. Similarly, a nonblocking receive start call initiates the receive operation, but does not complete it. The call can return before a message is stored into the receive buffer. A separate receive complete call is needed to complete the receive operation and verify that the data has been received into the receive buffer. With suitable hardware, the transfer of data into the receiver memory may proceed concurrently with computations done after the receive was initiated and before it completed. The use of nonblocking receives may also avoid system buffering and memory-to-memory copying, as information is provided early on the location of the receive buffer.
Nonblocking send start calls can use the same four modes as blocking sends: standard, buffered, synchronous and ready. These carry the same meaning. Sends of all modes, ready excepted, can be started whether a matching receive has been posted or not; a nonblocking ready send can be started only if a matching receive is posted. In all cases, the send start call is local: it returns immediately, irrespective of the status of other processes. If the call causes some system resource to be exhausted, then it will fail and return an error code. Quality implementations of MPI should ensure that this happens only in ``pathological'' cases. That is, an MPI implementation should be able to support a large number of pending nonblocking operations.
The send-complete call returns when data has been copied out of the send buffer. It may carry additional meaning, depending on the send mode.
If the send mode is synchronous, then the send can complete only if a matching receive has started. That is, a receive has been posted, and has been matched with the send. In this case, the send-complete call is non-local. Note that a synchronous, nonblocking send may complete, if matched by a nonblocking receive, before the receive complete call occurs. (It can complete as soon as the sender ``knows'' the transfer will complete, but before the receiver ``knows'' the transfer will complete.)
If the send mode is buffered then the message must be buffered if there is no pending receive. In this case, the send-complete call is local, and must succeed irrespective of the status of a matching receive.
If the send mode is standard then the send-complete call may return before a matching receive is posted, if the message is buffered. On the other hand, the send-complete may not complete until a matching receive is posted, and the message was copied into the receive buffer.
Nonblocking sends can be matched with blocking receives, and vice-versa.
Advice to users.
The completion of a send operation may be delayed, for standard mode, and must be delayed, for synchronous mode, until a matching receive is posted. The use of nonblocking sends in these two cases allows the sender to proceed ahead of the receiver, so that the computation is more tolerant of fluctuations in the speeds of the two processes.
2.2
Nonblocking sends in the buffered and ready modes have a more limited
impact, e.g., the blocking version of buffered send is capable of
completing regardless of when a matching receive call is made. However,
separating the start from the completion of these sends still gives
some opportunity for optimization within the MPI library. For example,
starting a buffered send gives an implementation more flexibility in
determining if and how the message is buffered. There are also advantages
for both nonblocking buffered and ready modes when data copying can
be done concurrently with computation.
The message-passing model implies that communication is initiated by
the sender.
The communication will generally have lower overhead if a receive is
already posted when the sender initiates the communication (data can be moved
directly to the receive buffer, and there is no need to queue a pending send
request). However,
a receive operation can complete only after the matching send has occurred.
The use of nonblocking receives allows one to achieve lower communication overheads
without blocking the receiver while it waits for the send.
( End of advice to users.)
Up: Contents
Next: Communication Request Objects
Previous: Model Implementation of Buffered Mode
Return to MPI-2.2 Standard Index
Return to MPI Forum Home Page
(Unofficial) MPI-2.2 of September 4, 2009
HTML Generated on September 10, 2009


My favorite Kdrama is Crash Landing on You. From the mention of mental illness, love, death, hesrtbreak and to each character truly desrving every ounce of camera time and your eyes glued on them, even the villians. A few of the actors in the show include:
Yoon Se-Ri (Son Ye-Jin) is an heiress to a conglomerate in South Korea. One day, while paragliding, an accident caused by strong winds leads Yoon Se-Ri to make an emergency landing in North Korea. There, she meets Ri Jeong-Hyeok (Hyun-Bin), who is a North Korean army officer. He tries to protect her and hide her. Soon, Ri Jeong-Hyeok falls in love with Yoon Se-Ri. If you want to check it out I definetly reccomend you to check out these websites starting with number one and making your way down.
This drama will bring you HAPPINESS!
Who does not want to feel happy
This drama will bring you SADNESS!
Who does not want to feel sadness....wait..mmh
This drama will bring you LOVE!
Who does not want to feel love