| survfit.formula {survival} | R Documentation |
Computes an estimate of a survival curve for censored data. More multi-state data the Andersen-Johansen estimate is use, for ordinary survival either the Kaplan-Meier or Fleming-Harrington estimate is produced.
## S3 method for class 'formula' survfit(formula, data, weights, subset, na.action, etype, id, istate, timefix=TRUE, ...)
formula |
a formula object, which must have a
|
data |
a data frame in which to interpret the variables named in the formula,
|
weights |
The weights must be nonnegative and it is strongly recommended that
they be strictly positive, since zero weights are ambiguous, compared
to use of the |
subset |
expression saying that only a subset of the rows of the data should be used in the fit. |
na.action |
a missing-data filter function, applied to the model frame, after any
|
etype |
a variable giving the type of event. This has been superseded by multi-state Surv objects; see example below. |
id |
identifies individual subjects, when a given person can have multiple lines of data. |
istate |
for multi-state models, identifies the initial state of each subject |
timefix |
process times through the |
... |
The following additional arguments are passed to internal functions
called by
|
The estimates used are the Kalbfleisch-Prentice (Kalbfleisch and Prentice, 1980, p.86) and the Tsiatis/Link/Breslow, which reduce to the Kaplan-Meier and Fleming-Harrington estimates, respectively, when the weights are unity.
The Greenwood formula for the variance is a sum of terms d/(n*(n-m)), where d is the number of deaths at a given time point, n is the sum of weights for all individuals still at risk at that time, and m is the sum of weights for the deaths at that time. The justification is based on a binomial argument when weights are all equal to one; extension to the weighted case is ad hoc. Tsiatis (1981) proposes a sum of terms d/(n*n), based on a counting process argument which includes the weighted case.
The two variants of the F-H estimate have to do with how ties are handled.
If there were 3 deaths out of 10 at risk, then the first
increments the hazard by 3/10 and the second
by 1/10 + 1/9 + 1/8.
For the first method S(t) = exp(H), where H is
the Nelson-Aalen cumulative hazard estimate,
whereas the fh2
method will
give results S(t) results closer to the Kaplan-Meier.
When the data set includes left censored or interval censored data (or both), then the EM approach of Turnbull is used to compute the overall curve. When the baseline method is the Kaplan-Meier, this is known to converge to the maximum likelihood estimate.
The cumulative incidence curve is an alternative to the Kaplan-Meier for competing risks data. For instance, in patients with MGUS, conversion to an overt plasma cell malignancy occurs at a nearly constant rate among those still alive. A Kaplan-Meier estimate, treating death due to other causes as censored, gives a 20 year cumulate rate of 33% for the 241 early patients of Kyle. This estimates the incidence of conversion if all other causes of death were removed, which is an unrealistic assumption given the mean starting age of 63 and a median follow up of over 21 years.
The CI estimate, on the other hand, estimates the total number of conversions that will actually occur. Because the population is older, this is much smaller than the KM, 22% at 20 years for Kyle's data. If there were no censoring, then CI(t) could very simply be computed as total number of patients with progression by time t divided by the sample size n.
an object of class "survfit"
.
See survfit.object
for
details. Methods defined for survfit objects are
print
, plot
,
lines
, and points
.
Dorey, F. J. and Korn, E. L. (1987). Effective sample sizes for confidence intervals for survival probabilities. Statistics in Medicine 6, 679-87.
Fleming, T. H. and Harrington, D. P. (1984). Nonparametric estimation of the survival distribution in censored data. Comm. in Statistics 13, 2469-86.
Kalbfleisch, J. D. and Prentice, R. L. (1980). The Statistical Analysis of Failure Time Data. New York:Wiley.
Kyle, R. A. (1997). Moncolonal gammopathy of undetermined significance and solitary plasmacytoma. Implications for progression to overt multiple myeloma}, Hematology/Oncology Clinics N. Amer. 11, 71-87.
Link, C. L. (1984). Confidence intervals for the survival function using Cox's proportional hazards model with covariates. Biometrics 40, 601-610.
Turnbull, B. W. (1974). Nonparametric estimation of a survivorship function with doubly censored data. J Am Stat Assoc, 69, 169-173.
survfit.coxph
for survival curves from Cox models,
survfit.object
for a description of the components of a
survfit object,
print.survfit
,
plot.survfit
,
lines.survfit
,
coxph
,
Surv
.
#fit a Kaplan-Meier and plot it fit <- survfit(Surv(time, status) ~ x, data = aml) plot(fit, lty = 2:3) legend(100, .8, c("Maintained", "Nonmaintained"), lty = 2:3) #fit a Cox proportional hazards model and plot the #predicted survival for a 60 year old fit <- coxph(Surv(futime, fustat) ~ age, data = ovarian) plot(survfit(fit, newdata=data.frame(age=60)), xscale=365.25, xlab = "Years", ylab="Survival") # Here is the data set from Turnbull # There are no interval censored subjects, only left-censored (status=3), # right-censored (status 0) and observed events (status 1) # # Time # 1 2 3 4 # Type of observation # death 12 6 2 3 # losses 3 2 0 3 # late entry 2 4 2 5 # tdata <- data.frame(time =c(1,1,1,2,2,2,3,3,3,4,4,4), status=rep(c(1,0,2),4), n =c(12,3,2,6,2,4,2,0,2,3,3,5)) fit <- survfit(Surv(time, time, status, type='interval') ~1, data=tdata, weight=n) # # Time to progression/death for patients with monoclonal gammopathy # Competing risk curves (cumulative incidence) fitKM <- survfit(Surv(stop, event=='progression') ~1, data=mgus1, subset=(start==0)) fitCI <- survfit(Surv(stop, status*as.numeric(event), type="mstate") ~1, data=mgus1, subset=(start==0)) # CI curves are always plotted from 0 upwards, rather than 1 down plot(fitCI, xscale=365.25, xmax=7300, mark.time=FALSE, col=2:3, xlab="Years post diagnosis of MGUS") lines(fitKM, fun='event', xmax=7300, mark.time=FALSE, conf.int=FALSE) text(10, .4, "Competing risk: death", col=3) text(16, .15,"Competing risk: progression", col=2) text(15, .30,"KM:prog")


Fear and Loathing in Las Vegas * * * * (out of four) Starring Johnny Depp, Benicio Del Toro, Ellen Barkin, Gary Busey, Cameron Diaz and Tobey Maguire Directed by Terry Gilliam Rated R for profanity, non-stop drug use and general weirdness Theatrical aspect ratio of 2.35:1 Released in 1998 Running 125 minutes
Since it's opening on Friday, Terry Gilliam's new film Fear and Loathing in Las Vegas has, to say the very least, not been received too well by most film critics. I knew this before I entered the theater yesterday, so I wasn't expecting to see the masterpiece I had anticipated ever since I saw the first previews for the movie. However, I still had to see the flick anyway, no matter how disappointed I might have become (I'm a die-hard Gilliam fan). For the following two hours, I sat in my seat and scrutinized every frame of the movie, waiting for just one single scene to slip up or go wrong. By the time I left the theater, I was completely convinced of one thing; along with Joel Coen and Quentin Tarantino, Gilliam is one of the most talented directors working in Hollywood today.
At first, I was a tad hesitant in writing this particular review because I fully realize that I'm quite possibly the only critic on the face of this planet that is going to praise this movie. But I'm just going to come out and say it, just like I did last year when everyone was attacking U-Turn and Lost Highway; I loved this movie.
Much like the other two films I mentioned, Fear and Loathing in Las Vegas isn't so much about story or plot as it is about style and construction. Hell, I defy anyone to give me an even semi-rational explanation of the plot of Lynch's Lost Highway. But like I said, plot doesn't matter; that was an exploration of the possibilities of cinema. Much like an abstract painting, if you will, only put on film instead of a canvas.
How can this film be about plot when it's only existing trace of a storyline involves a drug-addled journalist (Johnny Depp, with his head shaved and sporting a cigarette holder) and his allegedly Samoan attorney (Benicio Del Toro, gaining about sixty pounds since his Usual Suspects days) getting stoned out of their minds and trashing hotel rooms virtually beyond recognition? That is the plot in it's entirety. Along the way, though, they do encounter a variety of characters (played mostly by celebrities in quick cameos), including Gary Busey as a "lonely" (hehe) highway patrol officer and Cameron Diaz as a woman who has Del Toro convinced that she is in love with him merely because they made eye contact.
I've been told that the novel from which this was based (written by Hunter S. Thompson - one of the supposedly cool beatnik authors that I have yet to be acquainted with) is so weird and bizarre that it would be almost un-filmable using any conventional film concepts and techniques. I've also been told by some that have seen this movie that it is pretty much a direct translation of the novel, complete with alot of cool narration. So shouldn't we be giving Gilliam at least some credit for filming a story that was thought to be so odd that it could not be put on celluloid? Even if you don't dig the movie, you at least have to admire that.
One one of the many strong points of Fear and Loathing in Las Vegas that I forgot to mention earlier is the awesome as hell soundtrack that the film features. If you want to hear what is probably the best movie soundtrack since Reservoir Dogs, featuring such mind-altering tunes as "White Rabbit", "One Toke Over the Line" and "Get Together", I strongly urge you to buy a copy of the CD (I'm listening to it as I type, as a matter of fact).
I know it's going to sound odd for me to say this about what is basically just a drug trip in movie form, but I seriously doubt that you will see very many films come out this year that are as good as this one. It's that well made.
Copyright 1998 Jason Wallis
Jason Wallis<EMAIL_ADDRESS>http://www.geocities.com/Hollywood/Boulevard/7475
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


When did they take up stones?
When Jesus said, "Before Abraham was, I AM"
(John 8:58).
Why did they take up stones?
To stone Jesus to death.

When He called them the sons of the devil (see John 8:44 in
Father Abraham).
To them, why was Jesus declaring "Before Abraham was, I
AM" worse than calling them the sons of the devil?
“I AM” is the name God gave Himself in Exodus 3:13-14:
"Then Moses said to God, “Indeed, when I come to the children of
Israel and say to them, ‘The God of
your fathers has sent me to you,’ and
they say to me, ‘What is His name?’ what shall I say to them?” And God said
to Moses, “I AM WHO I AM.” And He said, “Thus you shall say to the children
of Israel, ‘I AM has sent me to you.’ ” Jesus was declaring
in terms that are crystal clear to them that He is God, and that's what
enraged them enough to try to kill Him.
How did Jesus hide Himself and go through "the midst of them" (John 8:59)?
The same way He did when the people tried to kill Him upon
hearing His very first sermon in Nazareth: "So all those in the
synagogue, when they heard these things, were filled with wrath, and rose up
and thrust Him out of the city; and they led Him to the brow of the hill on
which their city was built, that they might throw Him down over the cliff.
Then passing through the midst of them, He went His way" (Luke
4:28-30).
How can God make Himself invisible and walk through a crowd?
What did Jesus mean by
“Your father Abraham rejoiced to see My day, and he saw it
and was glad" (John 8:56)?
Abraham saw Jesus and was glad.
How could Abraham, who lived two thousands years
before Jesus was born, have seen Jesus?
Jesus appeared to him with God the Father and even spoke to him. Read
the explanation below Genesis 15. Note that Abraham is still called
"Abram" in these early chapters of Genesis.


/*
* Removes `value` from `array`, assuming it exists.
*
* It will only remove the first instance of `value`. It returns the index (of the original array)
* that was removed. Therefore, callers can check for `-1` to see if nothing as removed.
*/
function removeFromArray(array, value) {
const index = array.indexOf(value);
if (index >= 0) {
array.splice(index, 1);
}
return index;
}
/*
* This is the generic handler adder
* @param {string} eventName The event to handle
* @param {string} threshold Whether to trigger the listener on `"all"` or `"any"` event
* @param {string} frequency Whether to do this `"once"` or repeatedly (`"on"`)
* @param {function()} listener The listener to trigger on this event
*/
function addHandler(eventName, threshold, frequency, listener) {
if (!this.listeners[eventName]) {
this.listeners[eventName] = [];
}
const handler = {
threshold,
frequency,
fn: listener,
eventArgs: new Array(this.sources.length).fill(null),
};
this.listeners[eventName].push(handler);
}
function clearFiredEvents(listener) {
listener.eventArgs.fill(null);
}
function getMasterListener(eventName) {
const aggregator = this;
if (!this.masterListeners[eventName]) {
this.masterListeners[eventName] = function masterListener(...eventArguments) {
const sourceEmitter = this;
const listeners = aggregator.listeners[eventName];
const emitterIndex = aggregator.sources.indexOf(sourceEmitter);
if (emitterIndex < 0) {
throw new Error('Somehow called the listener with an emitter that we are not aggregating');
}
aggregator.listeners[eventName] = listeners.filter((listener) => {
listener.eventArgs[emitterIndex] = Array.prototype.slice.call(eventArguments);
const allFired = (listener.eventArgs.indexOf(null) < 0);
const waitForAll = (listener.threshold === 'all');
const callListener = allFired || !waitForAll;
if (callListener) {
if (waitForAll) {
listener.fn.call(aggregator, listener.eventArgs.slice());
clearFiredEvents(listener);
} else {
listener.fn.call(aggregator, sourceEmitter, eventArguments);
clearFiredEvents(listener);
}
}
return !(callListener && (listener.frequency === 'once'));
});
};
}
return this.masterListeners[eventName];
}
function attachMasterListener(eventName) {
const masterListener = getMasterListener.call(this, eventName);
if (!(eventName in this.listeners)) {
this.sources.forEach(emitter => emitter.on(eventName, masterListener));
}
}
/**
* The EventAggregator provides a way to bring EventEmitters together into a group and to interact
* with them as a collection (rather than individuals)
*/
class EventAggregator {
/**
* When instantiating an aggregator, you can pass it a single EventEmitter, a collection of
* Emitters or nothing.
* @param {EventEmitter[]|EventEmitter} [sources=[]]
*/
constructor(sources = []) {
if (!Array.isArray(sources)) {
this.sources = [sources];
} else {
this.sources = sources;
}
this.listeners = {};
this.masterListeners = {};
}
/**
* Provides a list of the events that the aggregator is listening for.
*
* NB: This doesn't mean that there are necessarily any handlers attached to these events.
* @returns {Array<string>}
*/
eventsListenedTo() {
return Object.keys(this.listeners);
}
/**
* Add a source source to the group.
*
* Any listeners that are currently defined will be automatically added to this source.
* @param {EventEmitter} source
*/
addSource(source) {
this.sources.push(source);
Object.keys(this.listeners).forEach((eventName) => {
source.on(eventName, getMasterListener.call(this, eventName));
});
}
/**
* Removers a source from the group.
*
* Any listeners attached to this source are also removed.
*
* If any listeners are attached via onAll or onceAll, then removing this source may result in
* those listeners being fired. This will happen if the source that is being removed is the only
* one in the group that hadn't emitted an event.
*
* Put another way, if *all* of the sources except this one had fired, then removing this one
* fires the `onAll` and `onceAll` listeners.
* @param {EventEmitter} source
*/
removeSource(source) {
const removedIndex = removeFromArray(this.sources, source);
this.eventsListenedTo().forEach((eventName) => {
source.removeListener(eventName, getMasterListener.call(this, eventName));
this.listeners[eventName].forEach((listener) => {
listener.eventArgs.splice(removedIndex, 1);
const allFired = (listener.eventArgs.indexOf(null) < 0) && listener.eventArgs.length > 0;
if (allFired) {
listener.fn.call(this, listener.eventArgs.slice());
clearFiredEvents(listener);
}
});
});
}
/**
* Removes a listener from the aggregator (just like EventEmitter#removeListener)
*
* @param {string} eventName The name of the event from which we're removing a listener
* @param {function} listenerToRemove The listener that we wish to remove
*/
removeListener(eventName, listenerToRemove) {
const listeners = this.listeners[eventName] || [];
this.listeners[eventName] = listeners.filter(listener => listener.fn !== listenerToRemove);
}
/**
* If any of the sources in this aggregator emits a `eventName` event, trigger the associated
* `listener`.
*
* Like `EventEmitter#on`, this will continue to fire until it is explicitly removed.
*
* The `listener` will receive a reference to the emitter that emitted the event and an array
* of the arguments that the event included.
*
* @param {string} eventName
* @param {function(EventEmitter, Array)} listener
*/
onAny(eventName, listener) {
attachMasterListener.call(this, eventName);
addHandler.call(this, eventName, 'any', 'on', listener);
}
/**
* Once all of the sources in this aggregator have emitted a `eventName` event, the associated
* `listener` is triggered.
*
* Like `EventEmitter#on`, this will continue to fire until it is explicitly removed.
*
* The `listener` will receive an array of the arguments from each of the events that were emitted
* from the aggregated sources. The array is in the order in which the sources were added to
* this aggregator.
*
* If a source has emitted an event multiple times, the listener will get the arguments from the
* first event.
*
* Once the listener has been triggered, this aggregator is reset for this event.
*
* @param {string} eventName
* @param {function(EventEmitter, Array)} listener
*/
onAll(eventName, listener) {
attachMasterListener.call(this, eventName);
addHandler.call(this, eventName, 'all', 'on', listener);
}
/**
* If any of the sources in this aggregator emits a `eventName` event, trigger the associated
* `listener`.
*
* Like `EventEmitter#once`, the listener will be removed once it has been triggered.
*
* The `listener` will receive a reference to the source that emitted the event and an array
* of the arguments that the event included.
*
* @param {string} eventName
* @param {function(EventEmitter, Array)} listener
*/
onceAny(eventName, listener) {
attachMasterListener.call(this, eventName);
addHandler.call(this, eventName, 'any', 'once', listener);
}
/**
* Once all of the sources in this aggregator have emitted a `eventName` event, the associated
* `listener` is triggered.
*
* Like `EventEmitter#once`, the listener will be removed for this event.
*
* The `listener` will receive an array of the arguments from each of the events that were emitted
* from the aggregated sources. The array is in the order in which the sources were added to
* aggregator.
*
* If a source has emitted events multiple times, the listener will get the arguments from the
* first event.
*
* @param {string} eventName
* @param {function(EventEmitter, Array)} listener
*/
onceAll(eventName, listener) {
attachMasterListener.call(this, eventName);
addHandler.call(this, eventName, 'all', 'once', listener);
}
/**
* If there are listeners that are waiting for all of the sources in this aggregation to emit,
* then calling this method will reset the aggregator so that it's as if none of them have
* emitted.
*
* If an `eventName` is provided, this is limited to listeners for that event. Otherwise, calling
* this resets all of the listeners.
*
* @param {string} [eventName]
*/
reset(eventName) {
if (eventName) {
this.listeners[eventName].forEach(clearFiredEvents);
} else {
Object.keys(this.listeners).forEach((name) => {
this.reset(name);
});
}
}
/**
* Calling this method removes all listeners from all sources. It should be called to avoid
* memory leaks when you're done with the aggregator.
*/
destroy() {
this.sources.forEach(this.removeSource.bind(this));
this.listeners = null;
}
}
export default EventAggregator;


Go Ethereum
Official golang implementation of the Ethereum protocol.
Automated builds are available for stable releases and the unstable master branch. Binary archives are published at https://geth.ethereum.org/downloads/.
Building the source
For prerequisites and detailed build instructions please read the Installation Instructions on the wiki.
Building geth requires both a Go (version 1.7 or later) and a C compiler. You can install them using your favourite package manager. Once the dependencies are installed, run
make geth
or, to build the full suite of utilities:
make all
Executables
The go-ethereum project comes with several wrappers/executables found in the cmd
directory.
| Command | Description |
|---|---|
geth |
Our main Ethereum CLI client. It is the entry point into the Ethereum network (main-, test- or private net), capable of running as a full node (default) archive node (retaining all historical state) or a light node (retrieving data live). It can be used by other processes as a gateway into the Ethereum network via JSON RPC endpoints exposed on top of HTTP, WebSocket and/or IPC transports. geth --help and the CLI Wiki page for command line options. |
abigen |
Source code generator to convert Ethereum contract definitions into easy to use, compile-time type-safe Go packages. It operates on plain Ethereum contract ABIs with expanded functionality if the contract bytecode is also available. However it also accepts Solidity source files, making development much more streamlined. Please see our Native DApps wiki page for details. |
bootnode |
Stripped down version of our Ethereum client implementation that only takes part in the network node discovery protocol, but does not run any of the higher level application protocols. It can be used as a lightweight bootstrap node to aid in finding peers in private networks. |
evm |
Developer utility version of the EVM (Ethereum Virtual Machine) that is capable of running bytecode snippets within a configurable environment and execution mode. Its purpose is to allow isolated, fine-grained debugging of EVM opcodes (e.g. evm --code 60ff60ff --debug ). |
gethrpctest |
Developer utility tool to support our ethereum/rpc-test test suite which validates baseline conformity to the Ethereum JSON RPC specs. Please see the test suite's readme for details. |
rlpdump |
Developer utility tool to convert binary RLP (Recursive Length Prefix) dumps (data encoding used by the Ethereum protocol both network as well as consensus wise) to user friendlier hierarchical representation (e.g. rlpdump --hex CE0183FFFFFFC4C304050583616263 ). |
swarm |
swarm daemon and tools. This is the entrypoint for the swarm network. swarm --help for command line options and subcommands. See https://swarm-guide.readthedocs.io for swarm documentation. |
puppeth |
a CLI wizard that aids in creating a new Ethereum network. |
Running geth
Going through all the possible command line flags is out of scope here (please consult our CLI Wiki page), but we've enumerated a few common parameter combos to get you up to speed quickly on how you can run your own Geth instance.
Full node on the main Ethereum network
By far the most common scenario is people wanting to simply interact with the Ethereum network: create accounts; transfer funds; deploy and interact with contracts. For this particular use-case the user doesn't care about years-old historical data, so we can fast-sync quickly to the current state of the network. To do so:
$ geth console
This command will:
- Start geth in fast sync mode (default, can be changed with the
--syncmode
flag), causing it to download more data in exchange for avoiding processing the entire history of the Ethereum network, which is very CPU intensive. - Start up Geth's built-in interactive JavaScript console,
(via the trailing
console
subcommand) through which you can invoke all officialweb3
methods as well as Geth's own management APIs. This too is optional and if you leave it out you can always attach to an already running Geth instance withgeth attach
.
Full node on the Ethereum test network
Transitioning towards developers, if you'd like to play around with creating Ethereum contracts, you almost certainly would like to do that without any real money involved until you get the hang of the entire system. In other words, instead of attaching to the main network, you want to join the test network with your node, which is fully equivalent to the main network, but with play-Ether only.
$ geth --testnet console
The console
subcommand have the exact same meaning as above and they are equally useful on the
testnet too. Please see above for their explanations if you've skipped to here.
Specifying the --testnet
flag however will reconfigure your Geth instance a bit:
- Instead of using the default data directory (
~/.ethereum
on Linux for example), Geth will nest itself one level deeper into atestnet
subfolder (~/.ethereum/testnet
on Linux). Note, on OSX and Linux this also means that attaching to a running testnet node requires the use of a custom endpoint sincegeth attach
will try to attach to a production node endpoint by default. E.g.geth attach <datadir>/testnet/geth.ipc
. Windows users are not affected by this. - Instead of connecting the main Ethereum network, the client will connect to the test network, which uses different P2P bootnodes, different network IDs and genesis states.
Note: Although there are some internal protective measures to prevent transactions from crossing over between the main network and test network, you should make sure to always use separate accounts for play-money and real-money. Unless you manually move accounts, Geth will by default correctly separate the two networks and will not make any accounts available between them.
Full node on the Rinkeby test network
The above test network is a cross client one based on the ethash proof-of-work consensus algorithm. As such, it has certain extra overhead and is more susceptible to reorganization attacks due to the network's low difficulty / security. Go Ethereum also supports connecting to a proof-of-authority based test network called Rinkeby (operated by members of the community). This network is lighter, more secure, but is only supported by go-ethereum.
$ geth --rinkeby console
Configuration
As an alternative to passing the numerous flags to the geth
binary, you can also pass a configuration file via:
$ geth --config /path/to/your_config.toml
To get an idea how the file should look like you can use the dumpconfig
subcommand to export your existing configuration:
$ geth --your-favourite-flags dumpconfig
Note: This works only with geth v1.6.0 and above.
Docker quick start
One of the quickest ways to get Ethereum up and running on your machine is by using Docker:
docker run -d --name ethereum-node -v /Users/alice/ethereum:/root \
-p 8545:8545 -p 30303:30303 \
ethereum/client-go
This will start geth in fast-sync mode with a DB memory allowance of 1GB just as the above command does. It will also create a persistent volume in your home directory for saving your blockchain as well as map the default ports. There is also an alpine
tag available for a slim version of the image.
Do not forget --rpcaddr <IP_ADDRESS>
, if you want to access RPC from other containers and/or hosts. By default, geth
binds to the local interface and RPC endpoints is not accessible from the outside.
Programatically interfacing Geth nodes
As a developer, sooner rather than later you'll want to start interacting with Geth and the Ethereum network via your own programs and not manually through the console. To aid this, Geth has built in support for a JSON-RPC based APIs (standard APIs and Geth specific APIs). These can be exposed via HTTP, WebSockets and IPC (unix sockets on unix based platforms, and named pipes on Windows).
The IPC interface is enabled by default and exposes all the APIs supported by Geth, whereas the HTTP and WS interfaces need to manually be enabled and only expose a subset of APIs due to security reasons. These can be turned on/off and configured as you'd expect.
HTTP based JSON-RPC API options:
--rpc
Enable the HTTP-RPC server--rpcaddr
HTTP-RPC server listening interface (default: "localhost")--rpcport
HTTP-RPC server listening port (default: 8545)--rpcapi
API's offered over the HTTP-RPC interface (default: "eth,net,web3")--rpccorsdomain
Comma separated list of domains from which to accept cross origin requests (browser enforced)--ws
Enable the WS-RPC server--wsaddr
WS-RPC server listening interface (default: "localhost")--wsport
WS-RPC server listening port (default: 8546)--wsapi
API's offered over the WS-RPC interface (default: "eth,net,web3")--wsorigins
Origins from which to accept websockets requests--ipcdisable
Disable the IPC-RPC server--ipcapi
API's offered over the IPC-RPC interface (default: "admin,debug,eth,miner,net,personal,shh,txpool,web3")--ipcpath
Filename for IPC socket/pipe within the datadir (explicit paths escape it)
You'll need to use your own programming environments' capabilities (libraries, tools, etc) to connect via HTTP, WS or IPC to a Geth node configured with the above flags and you'll need to speak JSON-RPC on all transports. You can reuse the same connection for multiple requests!
Note: Please understand the security implications of opening up an HTTP/WS based transport before doing so! Hackers on the internet are actively trying to subvert Ethereum nodes with exposed APIs! Further, all browser tabs can access locally running webservers, so malicious webpages could try to subvert locally available APIs!
Operating a private network
Maintaining your own private network is more involved as a lot of configurations taken for granted in the official networks need to be manually set up.
Defining the private genesis state
First, you'll need to create the genesis state of your networks, which all nodes need to be aware of
and agree upon. This consists of a small JSON file (e.g. call it genesis.json
):
{
"config": {
"chainId": 0,
"homesteadBlock": 0,
"eip155Block": 0,
"eip158Block": 0
},
"alloc" : {},
"coinbase" : "0x0000000000000000000000000000000000000000",
"difficulty" : "0x20000",
"extraData" : "",
"gasLimit" : "0x2fefd8",
"nonce" : "0x0000000000000042",
"mixhash" : "0x0000000000000000000000000000000000000000000000000000000000000000",
"parentHash" : "0x0000000000000000000000000000000000000000000000000000000000000000",
"timestamp" : "0x00"
}
The above fields should be fine for most purposes, although we'd recommend changing the nonce
to
some random value so you prevent unknown remote nodes from being able to connect to you. If you'd
like to pre-fund some accounts for easier testing, you can populate the alloc
field with account
configs:
"alloc": {
"0x0000000000000000000000000000000000000001": {"balance": "111111111"},
"0x0000000000000000000000000000000000000002": {"balance": "222222222"}
}
With the genesis state defined in the above JSON file, you'll need to initialize every Geth node with it prior to starting it up to ensure all blockchain parameters are correctly set:
$ geth init path/to/genesis.json
Creating the rendezvous point
With all nodes that you want to run initialized to the desired genesis state, you'll need to start a bootstrap node that others can use to find each other in your network and/or over the internet. The clean way is to configure and run a dedicated bootnode:
$ bootnode --genkey=boot.key
$ bootnode --nodekey=boot.key
With the bootnode online, it will display an enode
URL
that other nodes can use to connect to it and exchange peer information. Make sure to replace the
displayed IP address information (most probably [::]
) with your externally accessible IP to get the
actual enode
URL.
Note: You could also use a full fledged Geth node as a bootnode, but it's the less recommended way.
Starting up your member nodes
With the bootnode operational and externally reachable (you can try telnet <ip> <port>
to ensure
it's indeed reachable), start every subsequent Geth node pointed to the bootnode for peer discovery
via the --bootnodes
flag. It will probably also be desirable to keep the data directory of your
private network separated, so do also specify a custom --datadir
flag.
$ geth --datadir=path/to/custom/data/folder --bootnodes=<bootnode-enode-url-from-above>
Note: Since your network will be completely cut off from the main and test networks, you'll also need to configure a miner to process transactions and create new blocks for you.
Running a private miner
Mining on the public Ethereum network is a complex task as it's only feasible using GPUs, requiring
an OpenCL or CUDA enabled ethminer
instance. For information on such a setup, please consult the
EtherMining subreddit and the Genoil miner
repository.
In a private network setting however, a single CPU miner instance is more than enough for practical purposes as it can produce a stable stream of blocks at the correct intervals without needing heavy resources (consider running on a single thread, no need for multiple ones either). To start a Geth instance for mining, run it with all your usual flags, extended by:
$ geth <usual-flags> --mine --minerthreads=1 --etherbase=0x0000000000000000000000000000000000000000
Which will start mining blocks and transactions on a single CPU thread, crediting all proceedings to
the account specified by --etherbase
. You can further tune the mining by changing the default gas
limit blocks converge to (--targetgaslimit
) and the price transactions are accepted at (--gasprice
).
Contribution
Thank you for considering to help out with the source code! We welcome contributions from anyone on the internet, and are grateful for even the smallest of fixes!
If you'd like to contribute to go-ethereum, please fork, fix, commit and send a pull request for the maintainers to review and merge into the main code base. If you wish to submit more complex changes though, please check up with the core devs first on our gitter channel to ensure those changes are in line with the general philosophy of the project and/or get some early feedback which can make both your efforts much lighter as well as our review and merge procedures quick and simple.
Please make sure your contributions adhere to our coding guidelines:
- Code must adhere to the official Go formatting guidelines (i.e. uses gofmt).
- Code must be documented adhering to the official Go commentary guidelines.
- Pull requests need to be based on and opened against the
master
branch. - Commit messages should be prefixed with the package(s) they modify.
- E.g. "eth, rpc: make trace configs optional"
Please see the Developers' Guide for more details on configuring your environment, managing project dependencies and testing procedures.
License
The go-ethereum library (i.e. all code outside of the cmd
directory) is licensed under the
GNU Lesser General Public License v3.0, also
included in our repository in the COPYING.LESSER
file.
The go-ethereum binaries (i.e. all code inside of the cmd
directory) is licensed under the
GNU General Public License v3.0, also included
in our repository in the COPYING
file.


main module¶
-
async
main.
start_new_session
(self, repo_id, model, hyperparameters, percentage_averaged=0.75, max_rounds=5, library_type='PYTHON', checkpoint_frequency=1)¶ Validate arguments and then start a new session by sending a message to the server with the given configuration. Designed to be called in Explora.ipynb.
- Parameters
repo_id (str) – The repo ID associated with the current dataset.
model (keras.engine.Model) – The initial Keras model to train with. The model must be compiled!
hyperparams (dict) – The hyperparameters to be used during training. Must include batch_size!
percentage_averaged (float) – Percentage of nodes to be averaged before moving on to the next round.
max_rounds (int) – Maximum number of rounds to train for.
library_type (str) – The type of library to train with. Must be either PYTHON or JAVASCRIPT.
checkpoint_frequency (int) – Save the model in S3 every checkpoint_frequency rounds.
 ) Starting session! Waiting... Session complete! Check dashboard for final model!


Among the services we provide we stand out in our incentive sales programs that have helped innumerous companies and corporations to maximize their profits in the fastest way possible.
We want to connect the most with our customers to understand their needs and be able to implement the best platform they can get.
Experience built from a lot of research of projects to business management platforms, B2B, EAI (Enterprise Application Integration), BI (Business Intelligence), CRM (Customer Relationship Management), e-commerce, amongst others.
A team formed by professionals with long business and TI market experience, envolved in important nacional and internacional projects.
IncentivSales has over fifteen successfull projects with big customers in the market couting with the investments of many visionary entrepreneurs over the years.
Our company has never failed to deliver a project on time after the signing of a contract with any other company. Out of our many capacities, transparency is the one we value the most and work to always meet and exceed our customer's expectations.


optional<T>¶
This is an implemention of optional from the standard library. If it detects that a proper optional exists, it will attempt to use it. This is mostly an implementation detail, used in the sol::stack::check_get and sol::stack::get<optional<T>> and sol::optional<T> maybe_value = table["arf"];
implementations for additional safety reasons.
See this example here for a demonstration on how to use it and other features!


| |
- Method resolution order:
- ImageSaver
- observer.ScreenGrabObserver
- builtins.object
Methods defined here:
- __init__(self)
- Constructor.
- create_output_dir(self)
- Helper function to create the specified output directory. Creates also the path to the directory based on the
configured directory parts.
:return: True if successful, else False.
- delete_output_dir(self)
- Helper function to completely delete the specified output directory.
:return: True if successful, else False.
- generate_next_image_index(self)
- Helper function to generate the next index for an image.
:return: The generated image index.
- generate_next_image_name(self)
- Helper function to generate the next name for an image.
:return: The generated image name.
- parse_config(self, config_json)
- Parses the read config.
:param config_json: The read config as python dict.
- process(self, image)
- Saves a given PIL image to disk.
:param image: The image as PIL.Image object.
- read_config(self)
- Reads the config file for the ImageSaver.
:return: A python dict representation of the config.
Data descriptors inherited from observer.ScreenGrabObserver:
- __dict__
- dictionary for instance variables (if defined)
- __weakref__
- list of weak references to the object (if defined)
|


Class Discussions:
"The Seamless Web" can be seen as related to the debate between formative approaches and substantive approaches. See how Polanyi discussed economics.
Technology is seen as a category, but it has an undeniable social dimension. The material dimension is entangled with social relations.
Technology, Society, and Science are analytical categories. Scholar have tried to analyze the relations between Science and Society, Science and Technology, and Technology and Society:
- The SCOT scholars have argued that these categories are inter-related, but their insistence proves that these categories are currently separated.
- It pushes the problem further. Einstein: "You cannot find the solution at the level of the problem." As Langdon Winner's criticism goes, artifacts gave technology stability. The material dimension has its own determinism.
Most interesting terms: interpretive flexibility and technological frame (because it forms an internal logic; it suggests configuration. "Frame" indicates the historical dimension, and "technological" is related to cosmology and ontology).
Technological systems are prone to automation. It's not merely material but mechanic.
Questions to think about
- How is the technological frame related to cosmology/ontology?
- How is interpretative flexibility related to affordances?


Global, US, Franchise
Key RFI Examples
Studies from brand planning and pitches
Photos and experience desciptions
Strategic templates and key examples
Brand planning templates and key examples
Costs and timing templates and key examples
Showcase of key creative examples
Post close-out examples, what worked/didn't work


@* * Copyright 2023 HM Revenue & Customs * * 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. *@ @import uk.gov.hmrc.gatekeeper.models._ @import uk.gov.hmrc.gatekeeper.config.AppConfig @import uk.gov.hmrc.apiplatform.modules.gkauth.domain.models.LoggedInUser @import uk.gov.hmrc.gatekeeper.controllers.routes @import uk.gov.hmrc.gatekeeper.views.models.Crumb @this(main: MainView, applicationConfig: AppConfig) @(application: ApplicationResponse)(implicit request: Request[_], loggedInUser: LoggedInUser, messagesProvider: MessagesProvider) @main( title = s"${applicationConfig.title} - View IP allow list", breadcrumbs = Seq( Crumb( s"${application.name}", s"${routes.ApplicationController.applicationPage(application.id)}", Some("data-breadcrumb-view-application") ), Crumb( "Applications", s"${routes.ApplicationController.applicationsPage(None)}", Some("data-breadcrumb-view-applications") ) ) ) {
The IP allow list controls where traffic is allowed to originate from. The IP addresses below restrict traffic for this application.
| IP addresses |
|---|
| @ipRange |
The IP allow list is mandatory for this application.
}


Research and analysis
Research reports from a study into the work of teaching schools and their alliances.
Ref: ISBN 978-1-78105-563-2 , DFE- RR 505 PDF , 3.46MB , 228 pages
Ref: ISBN 978-1-78105-564-9 , DFE- RB 505 PDF , 134KB , 18 pages
Ref: ISBN 978-1-78105-318-8 , DFE-RR332 PDF , 738KB , 71 pages
Ref: ISBN 978-1-78105-306-5 , RB332 PDF , 244KB , 8 pages
This 2-year research project was led by the University of Nottingham on behalf of the National College for Teaching and Leadership.
The research method was based on:
in-depth case studies
a survey of teaching schools across cohorts 1 to 3
The report also draws on statistical data to look at programme reach and association with pupil performance.
Published: 25 February 2016
Updated: 7 March 2016