PLANET SICK-BOY: http://www.sick-boy.com "We Put the SIN in Cinema"
Films about filmmaking always seem to play well with critics, and State and Main isn't likely to be any different (for some reason, most critics think they're in The Business). David Mamet's (The Winslow Boy) seventh directorial effort is a scathing, drop-dead hysterical look at the out-of-touch insincerity of Hollywood and its uncanny ability to corrupt everything it touches.
Main is set in tiny Waterford, Vermont, where the crew for a film called `The Old Mill' has recently relocated after being kicked out of a similar town in New Hampshire. The film, which is supposed to be about the search for purity set in the twilight of the 19th century, has chosen Waterford not only for its sleepy, picturesque porch-swing/white-picket-fence community, but also because the town is home to two structures integral to the picture's plot – a mill and an old firehouse.
Taking place in the week leading up the filming of `The Old Mill,' Main features characters so real, so flawed and, for the most part, so instantly dislikeable, it's hard not to find yourself immediately wrapped up in their antics. William H. Macy plays Walt Price, the film's director, whose motto ("Shoot first – ask questions afterward') is embroidered on a lucky pillow that he drags to each shoot. Marty Rossen (David Paymer, Bounce) is his producer, and the two men form an intimidating pair with an aggressive manner surpassed only by their ability to kiss the asses of their stars and trample the feelings of pretty much everybody else.
The production of `The Old Mill' has plenty of hilarious stumbling blocks to overcome before it begins principal photography. The process of casting extras for the film is at a standstill because of a local play to which most of Waterford's citizens have already committed. The male lead (Alec Baldwin, Thomas and the Magic Railroad) has a thing for underage girls and begins sniffing around a nubile young Waterford native (Julia Stiles, Hamlet) as soon as he arrives in the small town. The female star (Sarah Jessica Parker, Sex and the City) is balking at her nude scene, despite the fact that it is clearly specified in her contract.
On the more innocent side of things is Joseph Turner White (Philip Seymour Hoffman, Almost Famous), the film's naïve playwright-turned-screenwriter who is baffled by the behind-the-scenes goings-on, not to mention the last-minute rewrites Price and Rossen demand he make, even though they would completely change his original script. He meets a local bookseller (Rebecca Pidgeon – Mamet's real-life wife), who becomes White's confidante and guiding light of veracity. Charles Durning (Everybody Loves Raymond) and Patti LuPone (Summer of Sam) play Waterford's Mayor and his wife, who want only to host an elaborate dinner party for the cast and crew of the film.
Throw in a big pothole on Waterford's Main Street, a local attorney with political ambitions (What Lies Beneath screenwriter Clark Gregg), a witty product-placement debate and a strange local catchphrase that the filmies adopt as their own, and you'll start to wonder how Mamet was able to pack all of this into a 90-minute film. Heck, I was sad when it ended, wishing it could continue for at least another 90. The writer/director's trademark hypnotically rhythmic salvos will do that kind of thing to you. The carefully written dialogue makes Main so much more than just a classier, feature-film version of the short-lived television show Action.
Another thing you can expect from a Mamet film is incredible acting performances, and Main doesn't disappoint in that category, either. Several actors could be in the hunt for Oscar nominations, especially Hoffman, who plays his most normal (and most romantic) role to date as the beleaguered screenwriter. Main reminded me of the Mamet-penned Wag the Dog, which also dealt with unscrupulous film folk and their behind-the-scene shenanigans. My only complaint (other than the short running time) is a story thread involving the stained glass window of Waterford's firehouse that goes unresolved.
If Kevin Bacon would only appear in one of Mamet's films, it would make playing `The Six Degrees of Kevin Bacon' a lot easier. With Main, Mamet seems to borrow a majority of his cast from the regulars that turn up in Paul Thomas Anderson's films. Anderson, in turn, seems to do his casting from the roster of acting talent involved in films made by the Coen brothers. Hoffman and Macy were both in Anderson's Magnolia and the Coens' The Big Lebowski. Ricky Jay and Gregg were also in Magnolia, as well as Mamet's The Spanish Prisoner. And Durning is in the Coens' upcoming O Brother, Where Art Thou?, in addition to the film version of Mamet's play, Lakeboat.
1:30 – Rated R for adult language and some cartoon nudity
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


Change the maximum number of iterations with the slider.
Change the number of polynomial roots with the Roots button.
Reset zoom and pan with the Home button.
Animate to different root presets with the Presets button.
View a heat map of the complex numbers that took the longest to converge with the Iterations to Converge toggle.


{% extends "base.html" %} {% load url from future %} {% block content %}
{{ report.sql }}
Created on {{ report.report_ptr.created_at }}
Status: {{ status.details.status }}
{% if status.details.status == "complete" %}Sent to {{ status.params.email }} at {{ status.updated_at }}
Didn't see the email? Click here to download it or re-run your search.
{% endif %} {% endblock %}


This is a tool for MSU History Majors.
Use it to review your work, evalute your historical skills,
and prepare the required reflection statements
for your required graduation portfolio.
You can use Reflect to complete the cover sheet for your portfolio, to enter the titles and courses for your selected
papers, and to assess your mastery of the program’s different Student Learning Outcomes. You can then Preview your
portfolio document and download it as a PDF file to include with your graduation portfolio.
Reflect saves your changes locally your computer or device, but nothing is uploaded anywhere else. If you clear your
browser’s history and cookies you will lose your saved information.
About Reflect
This application was created by Alex Ringrose.
If you have issues or suggestions you can reach us at our email or github page
The code base can be found at Github
The email associated with this project is<EMAIL_ADDRESS>This is an open source project using the MIT
License
Copyright (c) 2018 Alex Ringrose


One of the first Directors of the House of Wisdom in Bagdad in the early 9th Century was an outstanding Persian mathematician called Muhammad Al-Khwarizmi. He oversaw the translation of the major Greek and Indian mathematical and astronomy works (including those of Brahmagupta) into Arabic, and produced original work which had a lasting influence on the advance of Muslim and (after his works spread to Europe through Latin translations in the 12th Century) later European mathematics.
Al-Khwārizmī accomplished most of his work in the period between 813 and 833. After the Muslim conquest of Persia, Baghdad (the recent capital of what is known today as Iraq) became the centre of scientific studies and trade, and many merchants and scientists from as far as China and India traveled to this city, as did al-Khwārizmī. He worked in Baghdad as a scholar at the House of Wisdom established by Caliph al-Ma’mūn, where he studied the sciences and mathematics, which included the translation of Greek and Sanskrit scientific manuscripts.
The word “algorithm” is derived from the Latinization of his name, and the word "algebra" is derived from the Latinization of "al-jabr", part of the title of his most famous book, in which he introduced the fundamental algebraic methods and techniques for solving equations.
Perhaps his most important contribution to mathematics was his strong advocacy of the Hindu numerical system, which Al-Khwarizmi recognized as having the power and efficiency needed to revolutionize Islamic and Western mathematics. The Hindu numerals 1 - 9 and 0 - which have since become known as Hindu-Arabic numerals - were soon adopted by the entire Islamic world. Later, with translations of Al-Khwarizmi’s work into Latin by Adelard of Bath and others in the 12th Century, and with the influence of Fibonacci’s “Liber Abaci” they would be adopted throughout Europe as well.
- algebra
- arithmetic
- astronomy
- trigonometry
- geography


Before Change
"static_equation": "static equation"}
// Units of the special variables that are always defined
UNITS_SPECIAL_VARS = {"t": second, "dt": second, "xi": second**-0.5}
SPECIAL_VARS = UNITS_SPECIAL_VARS.keys()
// Definitions of equation structure for parsing with pyparsing
After Change
__all__ = ["Equations"]
logger = get_logger(__name__)
// A dictionary mapping equation types to nice names for error messages
EQUATION_TYPE = {"parameter": "parameter",


Assignment II
Geographic Data Science
Task
- Use (at least) two methods from class
- Justify them
- Combine (at least) two datasets used in the labs
- Provide a list of five LSOAs in Liverpool identified as disadvantaged and popular. Be explicit about what definition you use for each of them
- Justify your choice of the list on the basis of your analysis
- Remember to always document your code
Full detail list on course website
Limits
- Submitted by Monday, December 12th. 2016
- 750 words (sharp!)
- Three (3) figures. To avoid "cheating", the definition of a figure this time is changed to "an object that comes out of a single
matplotlib.figure
". You create a new matplotlib.figure
everytime:
- You call any
seaborn
function and do not append the output into an axis ax
- You set up a new canvas using
plt.subplots
Submission
- Turnitin
- Do not submit raw notebook this time
- Instead, submit an HTML version (from a running notebook, you can convert it into html in
File
→ Download as
→ HTML
)
- Make sure the HTML page renders correctly independently (e.g. copy it to a different folder and open it on a browser to see all the elements are there as you would expect)
Marking guide
- Minimum requirements are basic
- Including some of the suggestions is positively valued
- Routes that are not suggested but go beyond what is suggested is even better
- Creativity counts: doing what is suggested exactly the way it's been taught is OK but going the extra mile is valued
Help
- Unless it's strictly personal, please post to the forum (faster answer)
- You are most encouraged to not only ask but to respond as well
- Feel free to run by me ideas in Lab time


Future
Future<T>
A Future is a swift generic class that let’s you represent an object that will be returned at somepoint in the future. Usually from some asynchronous operation that may be running in a different thread/dispatch_queue or represent data that must be retrieved from a remote server somewhere.
-
returns: the current completion value of the Future
accessing this variable directly requires thread synchronization.
It is more efficient to examine completion values that are sent to an onComplete/onSuccess handler of a future than to examine it directly here.
type of synchronization used can be configured via GLOBAL_PARMS.LOCKING_STRATEGY
Declaration
Swift
public final var completion : Completion<T>?
-
returns: the result of the Future iff the future has completed successfully. returns nil otherwise.
accessing this variable directly requires thread synchronization.
Declaration
Swift
public var result : T?
-
returns: the error of the Future iff the future has completed with an Error. returns nil otherwise.
accessing this variable directly requires thread synchronization.
Declaration
Swift
public var error : NSError?
-
returns: the cancelToken of the Future iff the future has completed with an Cancel and Cancelation has a token. returns nil otherwise.
accessing this variable directly requires thread synchronization.
Declaration
Swift
public var cancelToken:Any?
-
returns: the CompletionState of the Future
accessing this variable directly requires thread synchronization.
Declaration
Swift
public var completionState : CompletionState?
-
is true if the Future supports cancellation requests using
cancel()
May return true, even if the Future has already been completed, and cancellation is no longer possible.
It only informs the user that this type of future can be cancelled.
Declaration
Swift
public var cancellationIsSupported : Bool
-
returns: true if the Future has completed with any completion value.
accessing this variable directly requires thread synchronization.
Declaration
Swift
public final var isCompleted : Bool
-
creates a completed Future.
Declaration
Swift
public init(completed:Completion<T>) { // returns an completed Task
-
creates a completed Future with a completion == .Success(success)
Declaration
Swift
public init(success:T) { // returns an completed Task with result T
-
creates a completed Future with a completion == .Error(failed)
Declaration
Swift
public init(failed:NSError) { // returns an completed Task that has Failed with this error
-
creates a completed Future with a completion == .Error(FutureNSError(failWithErrorMessage))
Declaration
Swift
public init(failWithErrorMessage errorMessage: String)
-
creates a completed Future with a completion == .Error(FutureNSError(exception))
Declaration
Swift
public init(exception:NSException) { // returns an completed Task that has Failed with this error
-
creates a completed Future with a completion == .Cancelled(cancelled)
Declaration
Swift
public init(cancelled:Any?) { // returns an completed Task that has Failed with this error
-
Undocumented
-
Undocumented
-
creates a completed Future with a completion == completion
Declaration
Swift
public init(@autoclosure completion c:() -> Completion<T>)
-
creates a completed Future with a completion == Success(block)
Declaration
Swift
public init(@autoclosure success s:() -> T)
-
Creates a future by executes block inside of an Executor, and when it’s complete, sets the completion = .Success(block())
can only be used to a create a Future that should always succeed.
Declaration
Swift
public init(_ executor : Executor, block: () -> T)
-
Creates a future by executes block inside of an Executor, and when it’s complete, sets the completion = block()
can be used to create a Future that may succeed or fail.
the block can return a value of .CompleteUsing(Future
) if it wants this Future to complete with the results of another future. Declaration
Swift
public init(_ executor : Executor, block: () -> Completion<T>)
-
if we try to convert a future from type T to type T, just ignore the request.
the compile should automatically figure out which version of convert() execute
Declaration
Swift
public func convert() -> Future<T>
-
convert this future of type
Future<T>
into another future typeFuture<__Type>
WARNING: if
T as! __Type
isn’t legal, than your code may generate an exception.works iff the following code works:
let t : T let s = t as! __Type
example:
let f = Future<Int>(success:5) let f2 : Future<Int32> = f.convert() assert(f2.result! == Int32(5))
you will need to formally declare the type of the new variable in order for Swift to perform the correct conversion.
the following conversions should always work for any future
let fofany : Future<Any> = f.convert() let fofvoid: Future<Void> = f.convert()
Declaration
Swift
public func convert<__Type>() -> Future<__Type>
Return Value
a new Future of with the result type of __Type
-
convert
Future<T>
into another typeFuture<__Type?>
.WARNING: if
T as! __Type
isn’t legal, than all Success values may be converted to nilexample:
let f = Future<String>(success:"5") let f2 : Future<[Int]?> = f.convertOptional() assert(f2.result! == nil)
you will need to formally declare the type of the new variable (ex:
f2
), in order for Swift to perform the correct conversion.Declaration
Swift
public func convertOptional<__Type>() -> Future<__Type?>
Return Value
a new Future of with the result type of __Type?
-
executes a block using the supplied Executor if and when the target future is completed. Will execute immediately if the target is already completed.
This method will let you examine the completion state of target, and return a new future in any completion state, with the user defined type __Type.
The
completion
argument will be set to the Completionvalue that completed the target. It will be one of 3 values (.Success, .Fail, or .Cancelled). The block must return one of four enumeration values (.Success/.Fail/.Cancelled/.CompleteUsing).
Returning a future
f
using .CompleteUsing(f) causes the future returned from this method to be completed whenf
completes, using the completion value off
. (Leaving the Future in an incomplete state, until ‘f’ completes).The new future returned from this function will be completed using the completion value returned from this block.
Declaration
Swift
public func onComplete<__Type>(executor : Executor,block:(completion:Completion<T>)-> Completion<__Type>) -> Future<__Type>
Parameters
__Type
the type of the new Future that will be returned. When using XCode auto-complete, you will need to modify this into the swift Type you wish to return.
executor
an Executor to use to execute the block when it is ready to run.
block
a block that will execute when this future completes, and returns a new completion value for the new completion type. The block must return a Completion value (Completion<__Type>).
Return Value
a new Future that returns results of type Type (Future<Type>)
-
executes a block using the Executor.Primary if and when the target future is completed. Will execute immediately if the target is already completed.
This method will let you examine the completion state of target, and return a new future in any completion state, with the user defined type __Type.
The
completion
argument will be set to the Completionvalue that completed the target. It will be one of 3 values (.Success, .Fail, or .Cancelled). The block must return one of four enumeration values (.Success/.Fail/.Cancelled/.CompleteUsing).
Returning a future
f
using .CompleteUsing(f) causes the future returned from this method to be completed whenf
completes. (Leaving the Future in an incomplete state, until ‘f’ completes).The new future returned from this function will be completed using the completion value returned from this block.
Declaration
Swift
public func onComplete<__Type>(block:(completion:Completion<T>)-> Completion<__Type>) -> Future<__Type>
Parameters
__Type
the type of the new Future that will be returned. When using XCode auto-complete, you will need to modify this into the swift Type you wish to return.
executor
an Executor to use to execute the block when it is ready to run.
block
a block that will execute when this future completes, and returns a new completion value for the new completion type. The block must return a Completion value (Completion<__Type>).
Return Value
a new Future that returns results of type Type (Future<Type>)
-
executes a block using the supplied Executor if and when the target future is completed. Will execute immediately if the target is already completed.
This method will let you examine the completion state of target, and return a new future that completes with a
.Success(result)
. The value returned from the block will be set as this Future’s result.Declaration
Swift
public func onComplete<__Type>(executor: Executor, _ block:(completion:Completion<T>)-> __Type) -> Future<__Type>
Parameters
__Type
the type of the new Future that will be returned. When using XCode auto-complete, you will need to modify this into the swift Type you wish to return.
executor
an Executor to use to execute the block when it is ready to run.
block
a block that will execute when this future completes, a
.Success(result)
using the return value of the block.Return Value
a new Future that returns results of type __Type
-
executes a block using the Executor.Primary if and when the target future is completed. Will execute immediately if the target is already completed.
This method will let you examine the completion state of target, and return a new future that completes with a
.Success(result)
. The value returned from the block will be set as this Future’s result.Declaration
Swift
public func onComplete<__Type>(block:(completion:Completion<T>)-> __Type) -> Future<__Type>
Parameters
__Type
the type of the new Future that will be returned. When using XCode auto-complete, you will need to modify this into the swift Type you wish to return.
executor
an Executor to use to execute the block when it is ready to run.
block
a block that will execute when this future completes, a
.Success(result)
using the return value of the block.Return Value
a new Future that returns results of type __Type
-
takes a block and executes it if and when this future is completed. The block will be executed using supplied Executor.
The new future returned from this function will be completed with `.Success’.
Declaration
Swift
public func onComplete(executor: Executor, block:(completion:Completion<T>)-> Void) -> Future<Void>
Parameters
executor
an Executor to use to execute the block when it is ready to run.
block
a block that will execute when this future completes.
Return Value
a
Future
that completes after this block has executed. -
takes a block and executes it if and when this future is completed. The block will be executed using supplied Executor.
The new future returned from this function will be completed with `.Success’.
Declaration
Swift
public func onComplete(block:(completion:Completion<T>)-> Void) -> Future<Void>
Parameters
executor
an Executor to use to execute the block when it is ready to run.
block
a block that will execute when this future completes.
Return Value
a
Future
that completes after this block has executed. -
takes a block and executes it if and when this future is completed. The block will be executed using supplied Executor.
The new future returned from this function will be completed when the future returned from the block is completed.
This is the same as returning Completion
.CompleteUsing(f) Declaration
Swift
public func onComplete<__Type>(executor: Executor, _ block:(completion:Completion<T>)-> Future<__Type>) -> Future<__Type>
Parameters
executor
an Executor to use to execute the block when it is ready to run.
block
a block that will execute when this future completes, and return a new Future.
Return Value
a
Future
that completes after this block has executed. -
Undocumented
-
takes a two block and executes one or the other. the didComplete() block will be executed if the target completes prior before the timeout.
it if and when this future is completed. The block will be executed using supplied Executor.
The new future returned from this function will be completed when the future returned from the block is completed.
This is the same as returning Completion
.CompleteUsing(f) Declaration
Swift
public func waitForComplete<__Type>(timeout: NSTimeInterval, executor : Executor, didComplete:(Completion<T>)-> Completion<__Type>, timedOut:()-> Completion<__Type> ) -> Future<__Type>
Parameters
executor
an Executor to use to execute the block when it is ready to run.
didComplete
a block that will execute if this future completes. It will return a completion value that
Return Value
a
Future
that completes after this block has executed. -
takes a block and executes it iff the target is completed with a .Success
If the target is completed with a .Success, then the block will be executed using the supplied Executor. The new future returned from this function will be completed using the completion value returned from this block.
If the target is completed with a .Fail, then the returned future will also complete with .Fail and this block will not be executed.
If the target is completed with a .Cancelled, then the returned future will also complete with .Cancelled and this block will not be executed.
Warning - as of swift 1.2, you can’t use this method with a Future
(it will give a compiler error). Instead use onAnySuccess()
Declaration
Swift
public func onSuccess<__Type>(executor : Executor, _ block:(result:T) -> Completion<__Type>) -> Future<__Type>
Parameters
__Type
the type of the new Future that will be returned. When using XCode auto-complete, you will need to modify this into the swift Type you wish to return.
executor
an Executor to use to execute the block when it is ready to run.
block
a block takes the .Success result of the target Future and returns the completion value of the returned Future.
Return Value
a new Future of type Future<__Type>
-
takes a block and executes it iff the target is completed with a .Success.
Unlike, onSuccess(), this function ignores the .Success result value. and it isn’t sent it to the block. onAnySuccess implies you don’t about the result of the target, just that it completed with a .Success
Currently, in swift 1.2, this is the only way to add a Success handler to a future of type Future
. But can be used with Future’s of all types. If the target is completed with a .Success, then the block will be executed using the supplied Executor. The future returned from this function will be completed using the value returned from this block.
If the target is completed with a .Fail, then the returned future will also complete with .Fail and this block will not be executed.
If the target is completed with a .Cancelled, then the returned future will also complete with .Cancelled and this block will not be executed.
Declaration
Swift
public func onAnySuccess<__Type>(executor : Executor, _ block:() -> Completion<__Type>) -> Future<__Type>
Parameters
__Type
the type of the new Future that will be returned. When using XCode auto-complete, you will need to modify this into the swift Type you wish to return.
executor
an Executor to use to execute the block when it is ready to run.
block
a block that returns the completion value of the returned Future.
Return Value
a new future of type
Future<__Type>
-
takes a block and executes it iff the target is completed with a .Success
If the target is completed with a .Success, then the block will be executed using Executor.Primary. The new future returned from this function will be completed using the completion value returned from this block.
The block may end up running inside ANY other thread or queue. If the block must run in a specific context, use onSuccess()
If the target is completed with a .Fail, then the returned future will also complete with .Fail and this block will not be executed.
If the target is completed with a .Cancelled, then the returned future will also complete with .Cancelled and this block will not be executed.
Warning - as of swift 1.2, you can’t use this method with a Future
(it will give a compiler error). Instead use onAnySuccess()
Declaration
Swift
public func onSuccess<__Type>(block:(result:T)-> Completion<__Type>) -> Future<__Type>
Parameters
__Type
the type of the new Future that will be returned. When using XCode auto-complete, you will need to modify this into the swift Type you wish to return.
block
a block takes the .Success result of the target Future and returns the completion value of the returned Future.
Return Value
a new Future of type Future<__Type>
-
takes a block and executes it iff the target is completed with a .Success.
If the target is completed with a .Success, then the block will be executed using Executor.Primary. The new future returned from this function will be completed using the completion value returned from this block.
The block may end up running inside ANY other thread or queue. If the block must run in a specific context, use onSuccess()
Unlike, onSuccess(), this function ignores the .Success result value. and it isn’t sent it to the block. onAnySuccess implies you don’t about the result of the target, just that it completed with a .Success
Currently, in swift 1.2, this is the only way to add a Success handler to a future of type Future
. But can be used with Future’s of all types. If the target is completed with a .Success, then the block will be executed using Executor.Primary. The future returned from this function will be completed using the value returned from this block.
If the target is completed with a .Fail, then the returned future will also complete with .Fail and this block will not be executed.
If the target is completed with a .Cancelled, then the returned future will also complete with .Cancelled and this block will not be executed.
Declaration
Swift
public func onAnySuccess<__Type>(block:() -> Completion<__Type>) -> Future<__Type>
Parameters
__Type
the type of the new Future that will be returned. When using XCode auto-complete, you will need to modify this into the swift Type you wish to return.
block
a block takes the .Success result of the target Future and returns the completion value of the returned Future.
Return Value
a new future of type
Future<__Type>
-
takes a block and executes it iff the target is completed with a .Fail
If the target is completed with a .Fail, then the block will be executed using the supplied Executor.
This method does not return a new Future. If you need a new future, than use
onComplete()
instead.Declaration
Swift
public func onFail(executor : Executor, _ block:(error:NSError)-> Void)
Parameters
executor
an Executor to use to execute the block when it is ready to run.
block
a block can process the error of a future.
-
takes a block and executes it iff the target is completed with a .Fail
If the target is completed with a .Fail, then the block will be executed using Executor.Primary.
This method does not return a new Future. If you need a new future, than use
onComplete()
instead.Declaration
Swift
public func onFail(block:(error:NSError)-> Void)
Parameters
executor
an Executor to use to execute the block when it is ready to run.
block
a block can process the error of a future.
-
takes a block and executes it iff the target is completed with a .Cancelled
If the target is completed with a .Cancelled, then the block will be executed using the supplied Executor.
This method does not return a new Future. If you need a new future, than use
onComplete()
instead.Declaration
Swift
public func onCancel(executor : Executor, _ block:(cancelToken:Any?)-> Void)
Parameters
executor
an Executor to use to execute the block when it is ready to run.
block
a block takes the canceltoken returned by the target Future and returns the completion value of the returned Future.
-
takes a block and executes it iff the target is completed with a .Cancelled
If the target is completed with a .Cancelled, then the block will be executed using Executor.Primary
This method does not return a new Future. If you need a new future, than use
onComplete()
instead.Declaration
Swift
public func onCancel(block:(cancelToken:Any?)-> Void)
Parameters
executor
an Executor to use to execute the block when it is ready to run.
block
a block takes the canceltoken returned by the target Future and returns the completion value of the returned Future.
-
takes a block and executes it iff the target is completed with a .Success
If the target is completed with a .Success, then the block will be executed using the supplied Executor.
The new future returned from this function will be completed with
.Success(result)
using the value returned from this block as the result.If the target is completed with a .Fail, then the returned future will also complete with .Fail and this block will not be executed.
If the target is completed with a .Cancelled, then the returned future will also complete with .Cancelled and this block will not be executed.
Warning - as of swift 1.2, you can’t use this method with a Future
(it will give a compiler error). Instead use onAnySuccess()
Declaration
Swift
public func onSuccess<__Type>(executor : Executor, _ block:(result:T)-> __Type) -> Future<__Type>
Parameters
__Type
the type of the new Future that will be returned. When using XCode auto-complete, you will need to modify this into the swift Type you wish to return.
executor
an Executor to use to execute the block when it is ready to run.
block
a block takes the .Success result of the target Future and returns a new result.
Return Value
a new Future of type Future<__Type>
-
takes a block and executes it iff the target is completed with a .Success
If the target is completed with a .Success, then the block will be executed using the Executor.Primary. The new future returned from this function will be completed using the completion value returned from this block.
The block will be executed in using the Executor.Primary (usually configued as .Immediate). The block may end up running inside ANY other thread or queue. If the block must run in a specific context, use onComplete()
If the target is completed with a .Fail, then the returned future will also complete with .Fail and this block will not be executed.
If the target is completed with a .Cancelled, then the returned future will also complete with .Cancelled and this block will not be executed.
Warning - as of swift 1.2, you can’t use this method with a Future
(it will give a compiler error). Instead use onAnySuccess()
Declaration
Swift
public func onSuccess<__Type>(block:(result:T)-> __Type) -> Future<__Type>
Parameters
__Type
the type of the new Future that will be returned. When using XCode auto-complete, you will need to modify this into the swift Type you wish to return.
executor
an Executor to use to execute the block when it is ready to run.
block
a block takes the .Success result of the target Future and returns a new result.
Return Value
a new Future of type Future<__Type>
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
requests that the future be cancelled.
does not guarantee that the cancel request was succesful. Futures may still complete.
this call does not modify the completion state directly. It only forwards a request to the owner of the Promise to perform it’s own cancellation. If you want to support cancellation, you must us a Promise() with a cancellationHandler and call “promise.completeWithCancel() inside the cancellationHandler.
most Futures are not cancelable.
you can use
cancellationIsSupported
to determine if a future supports cancellation.Declaration
Swift
public func cancel()
-
Undocumented
-
Undocumented
-
Undocumented


This software and GitHub API wrapper were written by Jerry Dodge. It in itself is open-source on GitHub, available for anybody to contribute.
Embarcadero Delphi 10.1 Berlin is the base language for this software.
Installation is compliments of Inno Setup.
Help authoring is with the help of WinCHM.
OpenSSL binaries are used for HTTPS.
There are numerous third-party Delphi libraries involved...
And a special thanks to my girl Jackie who has painfully dealt with my absence while I work on this project.


Creates and owns a collection of animations.
More...
#include <AnimationSet.h>
|
|
using | iterator = InternalContainer::iterator |
| |
|
using | const_iterator = InternalContainer::const_iterator |
| |
|
using | reverse_iterator = InternalContainer::reverse_iterator |
| |
|
using | const_reverse_iterator = InternalContainer::const_reverse_iterator |
| |
| using | Ptr = std::shared_ptr< AnimationSet > |
| | shared_ptr to AnimationSet. More...
|
| |
Creates and owns a collection of animations.
◆ Ptr
◆ AnimationSet()
| AnimationSet::AnimationSet |
( |
std::vector< Animation > |
animations | ) |
|
Construct a new AnimationSet object. The provided animations will all be added to the animation set.
- Parameters
-
| animations | The animations to add. |
◆ addAnimation()
| void AnimationSet::addAnimation |
( |
Animation |
animation | ) |
|
Adds the animation to the AnimationSet.
- Parameters
-
| animation | The animation to add. |
◆ at()
| const Animation & AnimationSet::at |
( |
std::size_t |
animationIndex | ) |
const |
Access the animation at the given index. Throws out_of_range exception if the provided index is greater than the number of animations stored by the AnimationSet.
- Parameters
-
| animationIndex | The index of the animation to return. |
<return> The animation at the provided index. </return>
◆ begin() [1/2]
| AnimationSet::iterator AnimationSet::begin |
( |
| ) |
|
◆ begin() [2/2]
| AnimationSet::const_iterator AnimationSet::begin |
( |
| ) |
const |
|
noexcept |
◆ cbegin()
| AnimationSet::const_iterator AnimationSet::cbegin |
( |
| ) |
const |
|
noexcept |
◆ cend()
| AnimationSet::const_iterator AnimationSet::cend |
( |
| ) |
const |
|
noexcept |
◆ clearAnimations()
| void AnimationSet::clearAnimations |
( |
| ) |
|
◆ crbegin()
| AnimationSet::const_reverse_iterator AnimationSet::crbegin |
( |
| ) |
const |
|
noexcept |
Reverse const iterator to the beginning of the AnimationSet.
◆ crend()
| AnimationSet::const_reverse_iterator AnimationSet::crend |
( |
| ) |
const |
|
noexcept |
◆ end() [1/2]
| AnimationSet::iterator AnimationSet::end |
( |
| ) |
|
◆ end() [2/2]
| AnimationSet::const_iterator AnimationSet::end |
( |
| ) |
const |
|
noexcept |
◆ eraseAnimation()
| void AnimationSet::eraseAnimation |
( |
const_iterator |
animation | ) |
|
Removes an animation from the AnimationSet.
- Parameters
-
| animation | The animation to remove. |
◆ eraseAnimations()
| void AnimationSet::eraseAnimations |
( |
const_iterator |
first, |
|
|
const_iterator |
last |
|
) |
| |
Removes a range of animations form the AnimationSet.
- Parameters
-
| first | The first animation to erase. |
| last | The last animation to erase. |
◆ getSize()
| std::size_t AnimationSet::getSize |
( |
| ) |
const |
Returns the number of Animations stored by the AnimationSet.
◆ isEmpty()
| bool AnimationSet::isEmpty |
( |
| ) |
const |
Returns true if the AnimationSet holds no animations. Returns false otherwise.
◆ operator[]()
| const Animation & AnimationSet::operator[] |
( |
std::size_t |
animationIndex | ) |
const |
|
noexcept |
Access the animation at the given index.
- Parameters
-
| animationIndex | The index of the animation to return. |
<return> The animation at the provided index. </return>
◆ rbegin() [1/2]
| AnimationSet::reverse_iterator AnimationSet::rbegin |
( |
| ) |
|
◆ rbegin() [2/2]
| AnimationSet::const_reverse_iterator AnimationSet::rbegin |
( |
| ) |
const |
|
noexcept |
Reverse const iterator to the beginning of the AnimationSet.
◆ rend() [1/2]
| AnimationSet::reverse_iterator AnimationSet::rend |
( |
| ) |
|
◆ rend() [2/2]
| AnimationSet::const_reverse_iterator AnimationSet::rend |
( |
| ) |
const |
|
noexcept |
The documentation for this class was generated from the following files:
- C:/Programming/Cpp/GameBackbone/GameBackbone/GameBackboneSln/GameBackbone/Include/GameBackbone/Core/AnimationSet.h
- C:/Programming/Cpp/GameBackbone/GameBackbone/GameBackboneSln/GameBackbone/Source/Core/AnimationSet.cpp


DatagramSocket is used to create the 'server' side of a connection. It listens on a 'service name' (often a port number) and each time a datagram is received on the port number it fires MessageReceived event.
Service Name:
Listen


The GNOME Settings Daemon is responsible for setting various parameters of a GNOME Session and the applications that run under it.
This package is known to build and work properly using an LFS-9.1 platform.
Download (HTTP): http://ftp.gnome.org/pub/gnome/sources/gnome-settings-daemon/3.34/gnome-settings-daemon-3.34.2.tar.xz
Download (FTP): ftp://ftp.gnome.org/pub/gnome/sources/gnome-settings-daemon/3.34/gnome-settings-daemon-3.34.2.tar.xz
Download MD5 sum: 493332fa0f36645188468fed41c0060b
Download size: 1.3 MB
Estimated disk space required: 29 MB
Estimated build time: 0.1 SBU (Using parallelism=4)
colord-1.4.4, Fontconfig-2.13.1, GeoClue-2.5.6, geocode-glib-3.26.2, gnome-desktop-3.36.1, Little CMS-2.9, libcanberra-0.30, libgweather-3.36.0, libnotify-0.7.9, librsvg-2.48.2, libwacom-1.3, PulseAudio-13.0, elogind-243.7, UPower-0.99.11, and Xorg Wacom Driver-0.39.0
ALSA-1.2.2, Cups-2.3.1, NetworkManager-1.22.10, NSS-3.51, and Wayland-1.18.0
Recommended dependencies are not strictly required for this package to build and function, but you may not get expected results at runtime if you don't install them.
dbusmock-0.19 and umockdev (required for the tests)
User Notes: http://wiki.linuxfromscratch.org/blfs/wiki/gnome-settings-daemon
Install GNOME Settings Daemon by running the following commands:
mkdir build && cd build && meson --prefix=/usr --sysconfdir=/etc -Dsystemd=false .. && ninja
To check the results, execute: ninja test. Note that you must have python-dbusmock installed in order for the tests to complete successfully. Some tests in the "power" testsuite may fail depending on the init system in use.
Now, as the root
user:
ninja install
Last updated on 2020-02-27 00:00:52 -0600


Just a minute.
Sorry! We are working hard to make sure we can serve you better.
We promise we won't be long. Please check back in a little while.


--- layout: page title: "Research" description: "Stay hungry, stay foolish" header-img: "img/post-bg-coffee.jpeg" ---
Bayesian Method
High Dimensional Statistics
Statistical Machine Learning
Estimated parameters of detector and receiver in CT system with the help of iradon function in MATLAB,
based on mathematical background of Radon Transformation.
Defined overall error δ and computed it out by comparing the estimated parameter with the given parameter.
Our method worked perfect since δ value is 0.0260.
Given the data of an unknown material in CT,
applied the parameters estimated before to compute the absorption values in 10 different parts of it.
Analyzed where δ came from and found that the smooth edge of the original phantom for parameters calibration
caused the error. A new model consisting of broken lines is created to reduce error.
Divided the world into 31 regions and listed top 20 popular languages to be considered.
Then data is collected from Internet and got cleaned in Python.
Applied logistic model to predict population growth in 31 regions,
using nonlinear programming technique to minimize the error and estimate parameters of the model.
In this way the number of native speakers can be predicted.
Defined a Markov Chain and its transition matrix based on migration data in recent years
and predicted migrating population.
Then L2 population (People who use the language as their second language) can be figured out.
Realized a Bayesian framework on genetic data, referring to a paper
Uncertainty Quantification in Graph-based Classification of High Dimensional Data
, and used both MAP and MCMC to give a classification.
Applied various techniques to reduce dimensions.
Kolmogorov-Smirnov Tests is used to remove certain dimensions obeying the same distribution and
Fisher linear discriminant analysis is implemented to choose 50 dimensions which are most vital.
Applied Linearly-Implicit Gradient Flow Method with Spectral Projection to maximize a posterior
and ACC(accuracy of classification) is about 70%.
Compared the Bayesian method with spectral clustering. Under the same circumstances,
the Bayesian method may work better with a proper initial value.


The same symbol can name both a lexical variable and a dynamic variable, but never in the same lexical environment.
In the following example, the symbol x is used, at different times, as the name of a lexical variable and as the name of a dynamic variable.
(let ((x 1)) ;Binds a special variable X (declare (special x)) (let ((x 2)) ;Binds a lexical variable X (+ x ;Reads a lexical variable X (locally (declare (special x)) x)))) ;Reads a special variable X => 3


| |
|
Hello,
Attached is a list of ${x-row-count} students that currently have one or more D or F as of ${x-current-date}. Please see the attached file for more information.
${x-repeat-start}
| ${student-name} (${student-number}) |
| Number of Courses Enrolled |
${enrollment-count} |
| Number of Ds |
${d-count} |
| D Courses |
${d-courses} |
| Number of Fs |
${f-count} |
| F Courses |
${f-courses} |
${x-repeat-end}
|
|
|
|
|


03 Oct 2014
In my previous blog post, I discussed what an automated build tool is, and how using one in your project will benefit you and your team. Over the last few weeks, I have been working on 2 Java projects, a Tic Tac Toe Engine and an Android Tic Tac Toe that uses the engine as a dependency. Both of these projects use the Gradle build tool, and in this post I will show you how I set it up and what plugin does.
Before I go into my personal Gradle setup, I will explain what Gradle is, and why I chose it over other build tools. The description from the Gradle website says:
Gradle combines the power and flexibility of Ant with the dependency management and conventions of Maven into a more effective way to build. Powered by a Groovy DSL and packed with innovation...
If we remove the buzzwords and jargon, the description could be summed up as: Gradle is a flexible build tool that can script common build tasks, and it follows the maven repository convention. Instead of using XML, Gradle uses Groovy, a dynamically typed language on the JVM, to describe the build. This results in a build file that contains a lot less boilerplate XML, and can be parsed easier by human readers.
There are a few reasons why I chose Gradle over Maven or Ant, but the greatest factor in me choosing to do so was the fact that it did not use XML in the build file. Compared to Ant or Maven, Gradle's build file is very clean and easy to read because of the fact that it does not have any XML tags cluttering the information. Here is my build file for my Java Tic Tac Toe project:
apply plugin: 'java'
apply plugin: 'application'
apply plugin: 'maven-publish'
mainClassName = 'me.jakenations.Main'
sourceCompatibility = 1.6
targetCompatibility = 1.6
sourceSets {
main {
java{
srcDir 'src/main/me/jakenations'
}
}
test {
java {
srcDir 'src/test/me/jakenations'
}
}
}
jar {
manifest {
attributes 'Main-Class': 'me.jakenations.Main'
}
}
repositories {
mavenCentral()
}
dependencies {
testCompile group: 'junit', name: 'junit', version: '4.+'
}
test {
systemProperties 'property': 'value'
}
run{
standardInput = System.in
}
group = 'me.jakenations'
version = '1.0'
publishing {
publications {
mavenJava(MavenPublication) {
from components.java
}
}
repositories {
maven {
url "http://s3.amazonaws.com/tttrepository/repository"
}
}
}
02 Oct 2014
Over the last few weeks, I have been working exclusively with Java to build my Tic Tac Toe applications. Since Java is a compiled language, source code must be compiled before it can be run. The compiler converts your human readable source code into computer readable byte code, and once your code is compiled, your code is now executable and can be run. This process has to be done each time the source code changes in order for the changes that were made to be available in the program. This process can be done manually by compiling and building a .jar file (Java Executable file) in your IDE, and then you can manually run the .jar file by running
java -jar <.jar file here>
This process works well when you have a small project that you are working on, but when you get to a larger project, there are a lot more things to do than just compiling and running. This is where an automated build tool comes in very handy. An automated build tool is a program that automates the creation of executable software from source code, and many other tasks that are needed on larger projects.
One of the things that an automated build tool will do for you is running all of your tests before it builds the program, and if one of the tests fails, it will interrupt the build and tell you that a test failed. This is very helpful because it will alert you that something isn't working, and it will prevent you from compiling and publishing broken code.
Another thing that automated build tools will do for you is take care of installing and maintaining the dependencies of the project. This means that the build tool knows what external libraries the project relies, and makes sure that the correct versions are installed. Most build tools can be pointed to a remote repository where the external library is stored, and then download and cache the correct version in your project.
Along with getting the dependencies from remote repositories, most build tools will also be able to publish your program to a remote repository as well. While sounding very technical, a repository is a file structure that holds .jar files and artifacts that are needed to build the library. The way most repositories file structures are set up is: the organization, then the package name, and lastly the version. Using my Tic Tac Toe application as an example, the file structure of the remote repository looks like this me/jakenations/java-tic-tac-toe/1.0 . This is a common file structure that is used by build tools in order to maintain a convention between programmers, so that built tools can get any dependency that is needed from a repository.
While build tools make programmers lives easier by taking care of these tasks automatically, they also help by making this process repeatable for anyone building the project. If configured correctly, everyone working on or with the project will have it build the same way without any extra effort. This is what I consider to be the most important aspect of the build tool because without this repeatability, programmers would be struggling to share projects with each other because the code will be different each time the code is built by someone else.
In my next blog post, I will go more in depth about how I used Gradle to build my Tic Tac Toe projects, and how you can create your own repository on Amazon S3.
01 Oct 2014
This week I have completed my Tic Tac Toe Android app, and I am now working on refactoring and polishing it. One of the major refactors that I completed was to remove the duplication of code that was shared between the activities of the same game type.
In order to do this I had to create an abstract activity class that contained the shared behaviors between the activities that controlled games versus humans and games versus computers. While this seems like a straightforward refactor, there were some snags because of the way that the activity class works. Because each subclass of the activity class must call an onCreate method that calls its superclass when it is created, I had to come up with a way for the base class to call all the way up to the Activity class. I was able to do this by having the base class call its super class and the super class to call the activity class, and it was able to start the new activity while sharing the behavior between two different activities.
26 Sep 2014
As I described in my previous blog, one of the largest complaints that I have had while building my android app has been the speed of the emulator. Yesterday I decided that something had to be done about it because my previously quick Tic Tac Toe algorithm had become abysmally slow. What used to take less than a second on the console, was now taking over 10 seconds. It was time to do some research and figure out how to make it faster.
Graphics Acceleration
The main reason that the emulator is slow is simply the fact that it is an emulator. Emulators are inherently slow because what they do is make a software representation of a piece of hardware, and the software copy is nowhere near as powerful as the hardware device. This is especially true when it comes to graphics processing.
The Android SDK now allows you to enable graphics acceleration. When enabled, this moves the graphics processing from inside the emulator to the dedicated graphics processing unit (GPU) that is built into your computer. When enabled you should see a drastic improvement in the way the graphics load on the emulator.
The only thing that you must do in order to implement the graphics acceleration on the Android Virtual Device (AVD) is to set GPU emulation to yes during the initial set up of the device. That's it. If you are using Android Studio as your IDE this is what the check box looks like:
After setting this option, and restarting the emulator you should notice a difference in the quality of the graphics rendered.
Processor Acceleration
This is also a problem that has the same root as the graphics, the emulator is trying to emulate the processor instead of using the processor that is running your computer. If you are using one of the newer intel processors, you have an option to install a hardware accelerator that will make the emulator an order of magnitude faster.
The first step in order to implement processor acceleration is to download the Intel Hardware Accelerated Execution Manager (HAXM). You can download that here at intel. check to make sure the that the HAXM is running by going to your console and running:
This should return a status message that contains the following extension name:
If you don't see the message, make sure that you have properly installed the HAXM.
Once you have installed the HAXM, you will need to download the x86 Emulator System Image. Since most android phones use an ARM processor, this allows you to run an emulator that matches your computers processor architecture instead of having to emulate an ARM core. You can download the system image here.
After you have downloaded and installed the system image, go to the AVD manager where you enabled the GPU acceleration. In the drop down box called CPU/ABI, select the Intel Atom (x86) processor.
Boot It Up
Now that you have enabled these two steps, boot up your emulator and you should see a noticeable improvement in its speed. In another blog post I will go over some changes that you can do to your program that will make it run faster as well.
25 Sep 2014
After completing my second iteration of Tic Tac toe, I was given the next iteration of the application, port it to an android app. This is my first foray in the world of mobile development, and it has gotten off to a slow but steady start. Even though it has gotten off to a slow start, as I am getting used to the android API's, it had become a much smoother process. One of the challenges I faced even before I could write any code, was to get the android virtual machine working on my computer. As I do not have an android phone, this was the only was for me to execute and interact with the code that I have written so far. Another challenge I faced was learning how to use the XML based layouts for the user interface. It felt a bit clumsy at first, but after some time writing it, it began to feel like I was writing HTML which is very easy to me.
Now that we got the bad parts out of the way, I can talk about what I have enjoyed so far and what I am looking forward to. I am glad that I took the time to figure out how gradle works because it has been an invaluable resource in building my original tic tac toe into a .jar file. Since android uses gradle as well, I was able to quickly set my original code as a dependency and was able to access all of the game methods from within my android app. Once I got it all wired up, I was able to play a simple game of tic tac toe on the VM. Now that I have my simple game working, I need to build it out to be as functional as my console based version. This means that I will need to add a replay function and the ability to run the game on a 4 x 4 board as well.
This leads me to what I am looking forward to the most, using threads to move the game process to run in the background of the main UI thread. I have noticed that the Negamax algorithm runs much slower on the phone than on the computer, and if I did not move it to a background process for a 4 x 4 board, the algorithm will certainly crash the application. I have been doing a lot of reading about threading lately, and I am excited to get my first start on it.


A Victorious Union
by Oliver Optic
Chapter XXX: “Another Sailing Contest Inaugurated”
Additional Information
- Year Published: 1893
- Language: English
- Country of Origin: United States of America
- Source: Optic, O. (1893). A Victorious Union. Boston, MA: Lee and Shepherd Publishers.
-
Readability:
- Flesch–Kincaid Level: 9.0
- Word Count: 2,158
- Genre: Adventure
- Keywords: 19th century literature, american literature, blue and the gray, civil war
- ✎ Cite This
Downloads
Although the Raven had not yet been disposed of, the ship’s company were immediately interested in the vessel which the lookout had tardily announced; and the vigor with which he had given the hail to the deck indicated that he was conscious of the defect.
“Where away?” returned Mr. Baskirk; though it was a superfluous question, for all on the deck who cast their eyes to the westward could see the sail.
“On the starboard, sir.”
Commander Passford was already examining the distant sail with his glass, as were all the officers who were not otherwise occupied. There were fog banks in that direction; and the craft might have suddenly loomed up out of them, though this did not appear to have been the case. The sail was too far off to be made out with anything like distinctness. It was a steamer headed to the east, and the quantity of smoke that trailed in the air above indicated that she had been liberal in the use of coal in her furnaces.
As the sail was diminishing her distance from the St. Regis, Christy turned his attention again to the prize alongside his ship. The two chasers that had been pursuing the Raven, neither of which appeared to be capable of making more than fourteen knots an hour, were now almost within hailing distance.
The Raven was a steamer of nearly the size of the St. Regis. She was not armed, and had a ship’s company of about thirty men, including officers. Her cargo was miscellaneous in its character, consisting of such merchandise as was most needed in the Confederacy, especially in the army. A watch had been set below on board of her to extinguish fires if any more appeared; but this peril had been effectually removed. The attempt to destroy the steamer and her cargo looked like malice and revenge, and some of the officers of the ship thought it ought to be regarded and treated as an act of war.
To burn, scuttle, blow up, run ashore, or otherwise destroy a blockade-runner after her situation has become absolutely hopeless can result only to the benefit of the enemy, since it deprived the Federals of the property that would otherwise be confiscated under international law. But blockade-runners are regarded as neutrals unless proved to be Americans, in which case they are subject to the penalties of treason, and the forfeiture of the ship and cargo is the only punishment.
Christy had never been able to regard this class of persons with much respect, for they appeared to be in league with the enemy. Captain Bristler had not only attempted to break through the blockade, which he and many of his countrymen regarded as a legitimate business; but he had attempted to burn his vessel. He had got out his boats; and when she was wrapped in flames, he evidently expected the Federal victor to pick up himself and his ship’s company, and treat the whole of them as though they had not been, at least constructively if not really, in the service of the enemy.
“The cold water applied to the commander of the Raven has had a good effect upon him,” said the first lieutenant, as he touched his cap on the quarter-deck of the St. Regis. “He sends word that he regrets his conduct, and asks to be released from confinement.”
“He has behaved himself more like a swine than a gentleman; but I have no ill-will towards him, for I regarded him as beneath my contempt,” replied Captain Passford. “I can understand his condition, for of course he is suffering under a tremendous disappointment; but that does not atone for his brutality.”
“Certainly not, sir. He was running away from the two blockaders that were pursuing him, and had beaten them both. He was absolutely sure of his escape till he encountered the fleet in shore when the St. Regis came upon the scene,” added Mr. Baskirk.
“Her captain had no particular respect for our steamer when he saw her, and kept on his course as if in contempt of her, till we dropped a shot near him. If he had headed to the south when he first made out the St. Regis, he would have improved his chances, but he would only have given us a longer chase. Let Captain Bristler out of the brig, Mr. Baskirk; we will see if he can behave himself any better; but I will not allow any man to swear at me if I can help myself.”
A little later Captain Bristler came on deck in charge of the ship’s corporal. He was dressed in his best clothes, and his personal appearance had been greatly improved.
“Captain Passford,” said he, raising his cap to the commander, “under the influence of my awful disappointment at the failure of the Raven to outsail you, I was rude and ungentlemanly, and some of my forecastle habits came back to me. I beg your pardon; and I shall show you that I know how to be a gentleman, if I did forget myself for a time.”
“That is sufficient, and I accept your apology, Captain Bristler,” replied Christy with abundant dignity.
“I did not believe there was a ship in the Federal navy that could outsail the Raven, for she was built more for speed than for cargo,” continued the captain of the prize.
“The St. Regis is not the only one that can outsail the Raven. I have served in a steamer that could beat her four knots an hour in an emergency,” added Christy.
“What steamer is that, Captain?” asked Captain Bristler.
“That is not important, but it was the one that outsailed and captured the St. Regis when she had another name.”
“Then your ship was a blockade-runner?”
“She was, and also a Confederate man-of-war; she was the Trafalgar.”
“Ah! Then I know her very well; and the company owning the Raven, of which I am a member, offered nearly double what it cost to build the Raven for her,” replied Captain Bristler. “I can understand now how I happened to be so thoroughly beaten in the last chase. She was built for a yacht, and no money was spared upon her.”
By this time the two steamers that had first chased the Raven had stopped their screws, and a boat was on its way from each of them. The two cutters came up to the gangway, and the officer in each ascended to the deck. Christy permitted the captain of the Raven to take care of himself, while he waited for the visitors to present themselves.
“I am very glad to see you, Mr. Amblen!” exclaimed Christy, as he extended his hand; for he recognized in the first officer the gentleman who had been his third lieutenant in the Bronx.
“I am delighted to see you again, Captain Passford,” replied Lieutenant Amblen, for such was his present rank. “I am now the executive officer of the Muskegon. I have the pleasure of presenting to you Mr. Cartright, first lieutenant of the St. Croix.”
“I am happy to meet you, Mr. Cartright.”
“I have often heard of you, Captain Passford, and I am glad to see you in command of so fine and fast a steamer as the St. Regis, though I never heard of her before,” added the executive officer of the St. Croix. “Of course you are aware that there is a steamer in sight to the westward of us.”
“I am aware of it; and for that reason we should hasten our present business,” replied Christy, as he glanced at the steamer in the distance and the trails of smoke astern of her. “I do not know who is the ranking officer here; and I have not yet reported to the admiral, for I took part in the chase from the moment of my arrival.”
“You are a lieutenant”—Mr. Amblen began.
“A lieutenant-commander, if you please,” interposed Christy with a smile.
“Then you are the ranking officer, Captain Passford, for both of the other commanders are lieutenants,” added the executive officer of the Muskegon. “We are ready to transmit your orders to our superiors.”
“My orders will depend somewhat upon the steamer astern of us; and if you will excuse me a few moments, I shall soon be ready to issue them,” replied Christy, as he took his spy-glass from the brackets, and directed it to the approaching steamer from the west. “What do you make of her, Mr. Baskirk?”
The executive officer had been observing the steamer astern with his glass; and she was not more than four miles distant by this time.
“She is a large vessel, I judge, not less than a thousand tons. She has all sail set and drawing, and she seems to be making very rapid progress through the water,” replied the first lieutenant. “But there are not less than three steamers pursuing her, though they are a long way astern of her.”
“I make out the chasers, and I should judge that she is getting away from them,” added Christy.

“I only wonder she has not done so before,” added the commander, rejoining the officers of the other steamers. “I believe Captain Wright of the Muskegon outranks Captain Boyden of the St. Croix,” he continued.
“He does, Captain Passford,” replied Mr. Amblen.
“If you will excuse me a moment, I will write an order for him;” and Christy retired to his cabin for this purpose.
His communication directed Captain Wright to take possession of the Raven, and treat her precisely as though she were the prize of the Muskegon and her consort; and constructively she was concerned in the capture of the vessel, especially in the distribution of the prize-money. He added to the order the fact that what appeared to be a blockade-runner astern of his ship was outsailing her pursuers, and the St. Regis being a very fast steamer, his duty did not permit him to make any further delay in taking part in the chase.
With this order in the hands of Mr. Amblen, Christy took leave of the two officers and they departed in their boats. But he was obliged to await the arrival of one or both of the blockaders before starting the screw, for he was not willing to leave any number of his crew in charge of the prize. While he was waiting, he wrote a letter to the acting admiral of the station, announcing his arrival, and copying into it the material portion of his orders from the department.
The Muskegon was the first to come alongside of the Raven, which she did on the starboard side. Captain Wright, crossing the deck of the Raven, presented himself to Captain Passford on the quarter-deck of the St. Regis; he was received with Christy’s accustomed politeness, and the prize was handed over to him verbally, as it had been done before in writing.
Captain Wright began to compliment Captain Passford, with whose brilliant reputation he was already very familiar; but Christy interposed, declaring that he was in a great hurry, and could hear no more, if his orders were clearly understood. Mr. Baskirk had directed the recall of all the ship’s company, with the exception of a master’s mate, who was to remain on board to give any further information needed to the officers of the Muskegon, and to be a witness in New York at the prize court.
Captain Bristler and his effects were sent back to the Raven, the grappling irons and the fasts were cast off, and the St. Regis backed out from her position on the port side of the prize. During all this time Christy was very busy with his glass. As Mr. Baskirk had discovered, the leading steamer had three blockaders in chase of her. She was now headed to the south, having done so as soon as she saw the four vessels lying in her course.
“Make the course south-west by south, Mr. Baskirk,” said the young commander, after he had brought his trigonometry into use again.
Then it became a very exciting question to ascertain which was the faster steamer of the two.


Please note: JavaScript (scripting) must be enabled for this site to work as intended.
Store Search
Printer friendly version
LCBO Store # 444:
KENNEDY & SHEPPARD (AGINCOURT MALL)
2356 KENNEDY ROAD, AGINCOURT MALL,
TORONTO-SCARBOROUGH, M1T3H1
Telephone:<PHONE_NUMBER>
Fax:<PHONE_NUMBER>
HOURS OF OPERATION
Sunday:
12:00 - 17:00
Monday:
10:00 - 22:00
Tuesday:
10:00 - 22:00
Wednesday:
10:00 - 22:00
Thursday:
10:00 - 22:00
Friday:
10:00 - 22:00
Saturday:
10:00 - 22:00
This store has the following features:
parking
transit access
wheelchair accessibility
bilingual services
product consultant
a tasting bar
a beer cold room
special occasion permits
a vintages corner
About LCBO
|
Accessibility
|
Social Responsibility
|
Careers
|
VINTAGES
|
Contact Us
|
Site Map
|
Store Search
© 2000/2010 LCBO
|
Privacy Policy
|
Terms & Conditions
|
Franšais
TRADE RESOURCES


Perfect Scrollbar is a nice library showing a customizable scrollbar on every browser, on every operating system. You can add it to ngx-extended-pdf-viewer with a few lines of code.
Caveat: I suspect the library has been abandoned. I'm going to remove both the demo and the support soon.
In this demo, the distinguishing feature of the perfect scrollbar is that it gets a bit wider when the mouse hovers over it. If the mouse is outside the PDF file, the scrollbar vanishes completely.


Schematic illustration of the one-pot hydrothermal routine to prepare CNT@TiO 2-C nanocable with the assistance of glucose.
Figure 1
Morphology and structure. SEM images of (a) pristine CNT and (b,c) CNT@TiO 2-C nanocable; (d) TEM image and (e) HR-TEM image of CNT@TiO 2-C nanocable; (f) Fast Fourier transform pattern of (e); (g) Annular dark-field scanning transmission electron microscopy (ADF-STEM) Z-contrast image of CNT@TiO 2-C nanocable and electron energy loss spectrum of the TiO 2 supported on the CNT.
Figure 2
(a) XRD pattern of CNT@TiO 2-C nanocable; (b) Raman spectra of CNT@TiO 2-C nanocable, TiO 2 nanoparticle, and pristine CNT.
Figure 3
SEM images of (a,b) CNT/TiO 2 composite prepared by hydrothermal reaction in the absence of glucose and (c,d) TiO 2 nanoparticles prepared by hydrothermal reaction in the absence of glucose and CNT.
Figure 4
Electrochemical measurements. (a) Representative cyclic voltammograms of the CNT@TiO 2-C nanocable electrode at a scan rate of 0.1 mV s −1; (b) The first charge-discharge voltage profiles and (c) The rate capability of the CNT@TiO 2-C nanocable, CNT/TiO 2 composite and commercial TiO 2 nanoparticle electrodes; (d) Comparison of rate-capability of a variety of TiO 2-based high-rate electrodes reported recently.TiO 2-graphene 16, CNT-TiO 2 nanocrystals 41, TiO 2-RuO 2 13, TiO 2 nanosheets 42, TiO 2 mesocrystals 43, SWCNT-TiO 2 10, TiO 2 nanosphere/graphene 44.
Figure 5
Cycling performance of the CNT@TiO 2-C nanocable electrode at high current rate of 5C and 50C (the first 5 cycles is cycled at low rate).


Dashboard
Courses
Assignments
Certificates
Foundation
Learn
Jamie Meininger
Dashboard
Recent Courses
Cloud Computing
CCom101
Information Security
SEC101
Computer Netoworks
CNET101
Inroduction to GDPR
GDPR1
Advanced Cloud Computing
CCom102
Cloud Computing
CCom101
Assignments
23
Security quiz 1
Cloud computing
50
The Need For Ethical Hackers
Cloud computing
10
Cloud Computing Mid-Term
Cloud computing
2
Keeping Data Safe
Cloud computing
To Do
Talk to Harold about help for coursework
Makes sure to ask tutor about peer-review
Organise focus group for project


The Programming Environment
To start with, if you plan on doing much browsing
around, you might want to read the page on Keyboard Usage (then press
"Back" to return to this page).
The Launcher
The launcher provides Transcript functionality,
as in other Smalltalks. It is the first window opened, and
usually ends up right behind the Start Page browser. The launcher
toolbar provides quick access to some common functions:
- : Open a browser on the Start Page.
- : Find and open any top level construct by name (wildcards allowed).
- : Find implementors of a message (wildcards allowed). Sorry about the lousy icon.
- : Find senders of a message (wildcards allowed). Another lousy icon.
- : Open a filtered hierarchy browser showing only the classes that users typically need.
- : Open a hierarchy browser on the entire class hierarchy
- : Open a workspace.
- : Open a text editor.
- : Browse the documentation.


Using @supports (transform: rotateX(45deg) )
If the browser supports the transform
property and a value of rotateX(45deg)
, the image below will be rotated, and the background light green. Otherwise, the background will be light purple.
If you can see this paragraph, congratulations! Your browser supports @supports and transform: rotateX(45deg)
!


|
The Red Matrix
|
Functions | |
| group_add ($uid, $name, $public=0) | |
| group_rmv ($uid, $name) | |
| group_byname ($uid, $name) | |
| group_rec_byhash ($uid, $hash) | |
| group_rmv_member ($uid, $name, $member) | |
| group_add_member ($uid, $name, $member, $gid=0) | |
| group_get_members ($gid) | |
| mini_group_select ($uid, $gid=0) | |
| group_side ($every="contacts", $each="group", $edit=false, $group_id=0, $cid= '') | |
| expand_groups ($a) | |
| member_of ($c) | |
| groups_containing ($uid, $c) | |
| expand_groups | ( | $a | ) |
Referenced by collect_recipients(), enumerate_permissions(), items_fetch(), and network_content().
| group_add | ( | $uid, | |
| $name, | |||
$public = 0 |
|||
| ) |
Referenced by create_identity(), and group_post().
| group_add_member | ( | $uid, | |
| $name, | |||
| $member, | |||
$gid = 0 |
|||
| ) |
Referenced by contactgroup_content(), group_content(), and new_contact().
| group_byname | ( | $uid, | |
| $name | |||
| ) |
Referenced by group_add(), group_add_member(), group_post(), and group_rmv_member().
| group_get_members | ( | $gid | ) |
Referenced by contactgroup_content(), and group_content().
| group_rec_byhash | ( | $uid, | |
| $hash | |||
| ) |
Referenced by new_contact().
| group_rmv | ( | $uid, | |
| $name | |||
| ) |
Referenced by group_content().
| group_rmv_member | ( | $uid, | |
| $name, | |||
| $member | |||
| ) |
Referenced by contactgroup_content(), and group_content().
| group_side | ( | $every = "contacts" , |
|
$each = "group" , |
|||
$edit = false , |
|||
$group_id = 0 , |
|||
$cid = '' |
|||
| ) |
Referenced by connections_aside(), group_aside(), network_init(), and nogroup_init().
| groups_containing | ( | $uid, | |
| $c | |||
| ) |
Referenced by group_side().
| member_of | ( | $c | ) |
| mini_group_select | ( | $uid, | |
$gid = 0 |
|||
| ) |


Version Control
October 25th, 2015
After a long journey that took me around the world and finding out who Alex Mitzman really is, I’ve embarked on a new journey which takes me into the world of programming.  This whole first week was dedicated to learning Git and GitHub and how valuable they are to programmers.. While I’ve briefly used them before in a JavaScript class I took recently, I never realized why we were using them. This week, I learned that reason why we were using them was for version control. Throughout this first week I learned the importance of version control and how it is essential knowing a version control system is for a developer. I just wanted to share what I felt are a couple of key benefits of a version control system.
Just like in the real world, I will be working collaboratively throughout DBC and version control makes working on a project so much easier. No more worrying about working on a shared file and overwriting team member’s work. With a version control system in place, it allows any team member to work freely on a project at any time and allows one to merge changes into the common version of the file. This file is saved at a central spot where everyone knows where to find it rather than trying find which shared folder it may be in.
Another great benefit of version control is how well it keeps track of changes made to a file. The version control system I’ve been using, Git, does a great job of this. Whenever a change is made to a file, we do a “git commit”. This is essentially like saving a file, and good practice is to commit early and often.  The great part about it is that it allows one to recall a commit from any time. So if I made a mistake on the current file, I can just open up the latest time I did commit. Or if I wanted to make a major change, I could go back to the beginning of the life-span of a file and restart from the beginning. It’s a great safeguard from making mistakes or accidently deleting months of work.
The other name I mentioned earlier was GitHub. GitHub is a social coding website that allows a developer to share their code and keep track of their changes using Git. GitHub is a great place to store code for a developer, because just like I mentioned before it’s a great central location for developers working on a team. Since GitHub is full of so many developers, it’s a very popular place to store open source code. This allows other developers in the world to contribute to your code or vice versa. For me, it makes me feel like I’m a part of great community and looking forward to be a contributor to other people’s code once I’m a full-fledged developer.
Next week, I’ll be diving into some actual coding with HTML and can’t wait to apply some version control for the upcoming challenges and projects.


<% include includes/page/header_attributes %>
<% include includes/page/content %>
<% include includes/page/rating %>
<% include includes/page/contact %>
<% include includes/page/sources %>
Recensioner
<% } else { %>Kommentarer
<% } %>


dlemstra/code-sign-action Action that signs libraries with a code signing certificate. - dlemstra/code-sign-action
Have I Been Pwned: Notify me Have I Been Pwned allows you to search across multiple data breaches to see if your email address has been compromised.
Native Blazor Components powered by DevExpress DevExpress UI for Blazor ships with native user interface components (including a Data Grid, Pivot Grid, Charts and Scheduler) so you can design rich user experiences with both Blazor.
Kurds and Turkey Accuse Each Other of Cease-Fire Violations Kurdish forces and Turkey traded accusations of violating a cease-fire agreement between Washington and Ankara, as scattered fighting in northeastern Syria began to subside, according to local activists.
Test A Blazor App With Cypress How to test a Blazor app with Cypress using docker-compose On my Toss project, I chose to have some end-to-end (e2e). End-to-end test on web project are tests that automate a browsing session on a web browser. Most of the time it works by using API provid...
The Smallest MIDI Synth Again... More info: https://mitxela.com/flash_synth Interested in owning one? Head to Aaron's shop: https://hpi.zentral.zone/flash


|
libcbor
0.5.0
libcbor is a C library for parsing and generating CBOR, the general-purpose schema-less binary data format.
|
#include "cbor/common.h"
Go to the source code of this file.
Functions | |
| size_t | cbor_serialize (const cbor_item_t *item, cbor_mutable_data buffer, size_t buffer_size) |
| Serialize the given item. More... | |
| size_t | cbor_serialize_alloc (const cbor_item_t *item, cbor_mutable_data *buffer, size_t *buffer_size) |
| Serialize the given item, allocating buffers as needed. More... | |
| size_t | cbor_serialize_uint (const cbor_item_t *, cbor_mutable_data, size_t) |
| Serialize an uint. More... | |
| size_t | cbor_serialize_negint (const cbor_item_t *, cbor_mutable_data, size_t) |
| Serialize a negint. More... | |
| size_t | cbor_serialize_bytestring (const cbor_item_t *, cbor_mutable_data, size_t) |
| Serialize a bytestring. More... | |
| size_t | cbor_serialize_string (const cbor_item_t *, cbor_mutable_data, size_t) |
| Serialize a string. More... | |
| size_t | cbor_serialize_array (const cbor_item_t *, cbor_mutable_data, size_t) |
| Serialize an array. More... | |
| size_t | cbor_serialize_map (const cbor_item_t *, cbor_mutable_data, size_t) |
| Serialize a map. More... | |
| size_t | cbor_serialize_tag (const cbor_item_t *, cbor_mutable_data, size_t) |
| Serialize a tag. More... | |
| size_t | cbor_serialize_float_ctrl (const cbor_item_t *, cbor_mutable_data, size_t) |
| Serialize a. More... | |
| size_t cbor_serialize | ( | const cbor_item_t * | item, |
| cbor_mutable_data | buffer, | ||
| size_t | buffer_size | ||
| ) |
Serialize the given item.
| item[borrow] | A data item |
| buffer | Buffer to serialize to |
| buffer_size | Size of the buffer |
Definition at line 20 of file serialization.c.
| size_t cbor_serialize_alloc | ( | const cbor_item_t * | item, |
| cbor_mutable_data * | buffer, | ||
| size_t * | buffer_size | ||
| ) |
Serialize the given item, allocating buffers as needed.
embed:rst:leading-asterisk * .. warning:: It is your responsibility to free the buffer using an appropriate ``free`` implementation. *
| item[borrow] | A data item |
| buffer[out] | Buffer containing the result |
| buffer_size[out] | Size of the buffer |
buffer
is NULL
. Definition at line 44 of file serialization.c.
| size_t cbor_serialize_array | ( | const cbor_item_t * | , |
| cbor_mutable_data | , | ||
| size_t | |||
| ) |
Serialize an array.
| item[borrow] | An array |
| buffer | Buffer to serialize to |
| buffer_size | Size of the buffer |
Definition at line 178 of file serialization.c.
| size_t cbor_serialize_bytestring | ( | const cbor_item_t * | , |
| cbor_mutable_data | , | ||
| size_t | |||
| ) |
Serialize a bytestring.
| item[borrow] | A bytestring |
| buffer | Buffer to serialize to |
| buffer_size | Size of the buffer |
Definition at line 110 of file serialization.c.
| size_t cbor_serialize_float_ctrl | ( | const cbor_item_t * | , |
| cbor_mutable_data | , | ||
| size_t | |||
| ) |
Serialize a.
| item[borrow] | A float or ctrl |
| buffer | Buffer to serialize to |
| buffer_size | Size of the buffer |
Definition at line 270 of file serialization.c.
| size_t cbor_serialize_map | ( | const cbor_item_t * | , |
| cbor_mutable_data | , | ||
| size_t | |||
| ) |
Serialize a map.
| item[borrow] | A map |
| buffer | Buffer to serialize to |
| buffer_size | Size of the buffer |
Definition at line 214 of file serialization.c.
| size_t cbor_serialize_negint | ( | const cbor_item_t * | , |
| cbor_mutable_data | , | ||
| size_t | |||
| ) |
Serialize a negint.
| item[borrow] | A neging |
| buffer | Buffer to serialize to |
| buffer_size | Size of the buffer |
Definition at line 93 of file serialization.c.
| size_t cbor_serialize_string | ( | const cbor_item_t * | , |
| cbor_mutable_data | , | ||
| size_t | |||
| ) |
Serialize a string.
| item[borrow] | A string |
| buffer | Buffer to serialize to |
| buffer_size | Size of the buffer |
Definition at line 144 of file serialization.c.
| size_t cbor_serialize_tag | ( | const cbor_item_t * | , |
| cbor_mutable_data | , | ||
| size_t | |||
| ) |
Serialize a tag.
| item[borrow] | A tag |
| buffer | Buffer to serialize to |
| buffer_size | Size of the buffer |
Definition at line 256 of file serialization.c.
| size_t cbor_serialize_uint | ( | const cbor_item_t * | , |
| cbor_mutable_data | , | ||
| size_t | |||
| ) |
Serialize an uint.
| item[borrow] | A uint |
| buffer | Buffer to serialize to |
| buffer_size | Size of the buffer |
Definition at line 76 of file serialization.c.


Başakşehir takes 1-point lead in Turkey after win at Galatasaray
by ANADOLU AGENCYMedipol Başakşehir on Friday defeated Galatasaray 1-0 in Matchday 12 of the Turkey's Süper Lig.
Meeting at Türk Telekom Stadium in Istanbul, last season's top two teams were unable to break the deadlock in the first half.
Başakşehir captain Mahmut Tekdemir had to leave the pitch due to an injury in the 60th minute and was replaced Norwegian forward Fredrik Gulbrandsen.
Gulbrandsen's goal eventually claimed the victory for Başakşehir in the 78th minute of the match.
The Lions' 41-game home unbeaten streak also came to an end, while the Orange-Navies climbed to first place with 22 points, extending their unbeaten streak to 10 games.


| include_graphics {knitr} | R Documentation |
When plots are not generated from R code, there is no way for knitr to
capture plots automatically. In this case, you may generate the images
manually and pass their file paths to this function to include them in the
output. The major advantage of using this function is that it is portable in
the sense that it works for all document formats that knitr supports,
so you do not need to think if you have to use, for example, LaTeX or
Markdown syntax, to embed an external image. Chunk options related to
graphics output that work for normal R plots also work for these images, such
as out.width
and out.height
.
include_graphics( path, auto_pdf = getOption("knitr.graphics.auto_pdf", FALSE), dpi = NULL, error = getOption("knitr.graphics.error", TRUE) )
path |
A character vector of image paths. |
auto_pdf |
Whether to use PDF images automatically when the output
format is LaTeX. If |
dpi |
DPI (dots per inch) value. Used to calculate the output width (in
inches) of the images. This will be their actual width in pixels, divided
by |
error |
Whether to signal an error if any files specified in the
|
The same as the input character vector path
but it is marked
with special internal S3 classes so that knitr will convert the file
paths to proper output code according to the output format.
This function is supposed to be used in R code chunks or inline R code
expressions. You are recommended to use forward slashes (/
) as path
separators instead of backslashes in the image paths.
The automatic calculation of the output width requires the png
package (for PNG images) or the jpeg package (for JPEG images). The
width will not be calculated if the chunk option out.width
is
already provided or dpi = NA
.


Import SSL certificate
To prevent HTTPS warnings when accessing your IG Server user interface you will need to obtain and import an SSL certificate.
To complete this task you will need to use an existing, valid certificate that your organisation currently owns, or purchase a certificate from a trusted Certificate Authority. You need access to the IG Server UI and the Clearswift Server Console to complete the task.
The certificate should comprise two files:
- {hostname}.key
- {hostname}.cert
where hostname is the hostname of your IG Server.
Note: The hostname specified in the certificate must match the hostname of your IG Server.
-
From your IG Server Home page, click System > Security > SSH Access.
SSH configuration options are displayed.
- Click Edit.
- Select the Enable SSH access check box, and type the IP or hostname of the SSH client you want to use to connect to your IG Server.
- Click Save.
-
From the SSH client, connect to your IG server.
Tip: Leaving SSH access enabled for extended periods might represent a security risk. You should consider disabling SSH when not using it.
To import the certificate:
-
From the Clearswift Server Console, select Open Terminal Session.
A terminal session window is displayed.
-
From the command line type the following:
keytool -importcert -file {hostname}.cert -keystore /srv/tomcat/igpadmin/conf/igp.keystore -alias '{alias}'
where:
- hostname is the hostname of your IG Server.
-
alias is your chosen name to identify the certificate.
Note: When defining alias, do not use ‘igp’ as this is a reserved alias.
- Use a text editor to open /srv/tomcat/igpadmin/conf/server.xml.
-
Add the following attribute to the <Connector> settings node (below the server attribute):
KeyAlias="{alias}"
where alias is your chosen name to identify the certificate.
-
Restart the IG administration UI application by typing the following command:
sudo igp-servicecontrol restart igpadmin


New Orders List
Customer ID
Company Name
Order
Delivery Date Expected
07/05/2016
00302
$500
Not Paid
000125
Dragon Everest
Create Invoice
22/07/2017
000125
Dragon Everest
Create Invoice
22/07/2017


Contact: B. Wyman Reviewers: Change history: WebCVS Log for bgrid_core_driver.f90
Provides high-level interfaces to the B-grid dynamical core that allow easy initialization, integration, and diagnostics.
There is a namelist interface for initializing the optional arguments to subroutine bgrid_core_init.
bgrid_core_mod bgrid_horiz_mod bgrid_vert_mod bgrid_prog_var_mod bgrid_halo_mod bgrid_diagnostics_mod bgrid_integrals_mod bgrid_conserve_energy_mod time_manager_mod fms_mod
use bgrid_core_driver_mod [ ,only: bgrid_dynam_type, bgrid_core_driver_init, bgrid_core_driver, bgrid_core_driver_end, bgrid_core_time_diff, get_bottom_data, put_bottom_data ] bgrid_dynam_type A defined-type variable that contains constants needed by the B-grid dynamical core (see bgrid_core_mod) bgrid_core_driver_init Initializes the B-grid dynamical core. This interface returns values for the "bgrid_dynam_type" and prog_var_type" derived-type variables. Also internally initialized are other B-grid derived-type variables for the horizontal and vertical grid constants. bgrid_core_driver A wrapper for integrating the dynamical core one (atmospheric) time step. Note that only the tendencies of prognostic variables are updated. bgrid_core_time_diff Performs the time differencing of the prognostics variables and outputs diagnostics for the B-grid dynamical core. bgrid_core_driver_end A wrapper for terminating the dynamical core. get_bottom_data, put_bottom_data Routines for getting and putting data at the model level closest to the ground. NOTES * A namelist interface called bgrid_core_driver_nml is read from file input.nml.
type (bgrid_dynam_type) See bgrid_core_mod for details.
call bgrid_core_driver_init ( Time_init, Time, Time_step, Var, Var_dt, Dynam, phys_axes ) DESCRIPTION Returns initialized/allocated values for the "bgrid_dynam_type" and "prog_var_type" derived-type variables. Also internally initialized are other B-grid derived-type variables for the horizontal and vertical grid constants. INPUT Time_init The initial (or base) time. [time_type] Time The current time. [time_type] Time_step The atmospheric model/physics time step. [time_type] INPUT/OUTPUT Var A derived-type variable that contains the prognostic variables for the B-grid dynamical core. The returned values will have been initialized by prog_var_mod (most likely read from a restart file). [type(prog_var_type)] Var_dt A derived-type variable that contains the prognostic variable time tendencies. The returned value is zero. [type(prog_var_type)] Dynam A derived-type variable that contains almost everything needed by the dynamical core. [type(bgrid_dynam_type)] OUTPUT phys_axes Axis identifiers as returned by the diagnostics manager and needed for subsequent calls to the diagnostics manager. [integer, dimension(4)]
call bgrid_core_driver ( Time_diag, Var, Var_dt, Dynam, omega ) DESCRIPTION Updates the prognostic variable tendencies with the dynamical core tendencies for the current atmospheric time step. Also calls diagnostics routines for outputting the dynamical core tendencies. INPUT Time_diag The diagnostics time, usually the current time + time step. [type(time_type)] Var A derived-type variable that contains the B-grid's prognostic variables. [type(prog_var_type)] INPUT/OUTPUT Var_dt A derived-type variable that contains the TENDENCIES for the B-grid's prognostic variables. [type(prog_var_type)] Dynam The derived-type variable returned by a previous call to bgrid_core_driver_init (see above). [type(bgrid_dynam_type)] OUTPUT omega The omega diagnostic (from the thermodynamic equation) in pascals per second. The array should have horizontal dimensions that are consistent with the data domain of the B-grid dynamical core. [real, dimension(ilb:,jlb:,:)]
call bgrid_core_time_diff ( omega, Time_diag, Dynam, Var, Var_dt ) DESCRIPTION Performs the time differencing of the prognostics variables and outputs diagnostics for the B-grid dynamical core. INPUT omega The pressure vertical velocity in Pascals/second. This is only needed for diagnostic purposes. [real, dimension(:,:,:)] Time_diag The diagnostics time, usually the current time + time step. [type(time_type)] Dynam The derived-type variable returned by a previous call to bgrid_core_driver_init (see above). [type(bgrid_dynam_type)] INPUT/OUTPUT Var The prognostic variables. The input quantities are at the current and on output they are at the next time step. [type(prog_var_type)] Var_dt The time tendencies for the prognostic variables. The output tendencies will have been set to zero. [type(prog_var_type)]
call bgrid_core_driver_end (Dynam) DESCRIPTION Termination routine for the B-grid dynamical core. INPUT Dynam The derived-type variable returned by a previous call to bgrid_core_driver_init (see above). [type(bgrid_dynam_type)]
call get_bottom_data ( a, b, a_bot, b_bot, [, k_bot] ) DESCRIPTION Given a pair of 3-dimensional model fields this interface returns the 2-dimensional fields at the model level closest to the ground. If optional argument "kbot" is NOT present the returned field will be the 2-d field at k = size(a,3). INPUT a, b Three-dimension fields on the model grid. The last dimension varies from the top of the atmosphere towards the surface. [real, dimension(:,:,:)] OUTPUT a_bot, b_bot Data located at the model level closest to the ground. Must have the same size as the first two dimensions of a and b. [real, dimension(:,:)] OPTIONAL INPUT k_bot The vertical index for the model level closest to the ground. Must have the same size as a_bot and b_bot. [integer, dimension(:,:)]
call put_bottom_data ( a_bot, b_bot, a, b [, k_bot] ) DESCRIPTION Puts 2-dimensional data given at the lowest model level into their 3-dimensional model fields. INPUT a_bot, b_bot Data located at the model level closest to the ground. This data will be inserted into arrays a and b. [real, dimension(:,:)] INPUT/OUTPUT a, b Three-dimension fields on the model grid. [real, dimension(:,:,:)] OPTIONAL INPUT k_bot The vertical index for the model level closest to the ground. Must have the same size as a_bot and b_bot. [integer, dimension(:,:)]
&bgrid_core_driver_nml damp_scheme Determines how horizontal damping coefficients vary with latitude. = 1, constant = 2, varies as inverse of diagonal grid distance = 3, varies as inverse of x-axis grid distance Note: damp_scheme = 1 is recommended, damp_scheme = 2,3 is experimental. [integer, default: damp_scheme = 1] damp_order_wind The horizontal damping order for momentum, damp_order_temp temperature, and default order for all damp_order_tracer prognostic tracers. The damping order must be an even number; damp_order = 0 turns off damping. [integer, default: damp_order = 4] damp_coeff_wind The horizontal damping coefficients for damp_coeff_temp momentum, temperature, and default value for damp_coeff_tracer all prognostic tracers. The coefficients are expressed as non-dimensional values for the second-order diffusion operator (range = 0,1). [real, default: damp_coeff = 0.50] slope_corr_wind The topography slope correction applied to horizontal slope_corr_temp damping of momentum and temperature (including all prognostic tracers). The coefficients (with range = 0,1) are expressed as arrays of size 4. The first 3 values are coefficients for the lowest 3 model layers, the last value represents the remaining uppermost layers. A NON-ZERO value turns the correction ON. Typical values might be (/ .25, .50, .75, .95 /). [real, dimension(4), default: slope_corr = 0.,0.,0.,0.] advec_order_wind The advection order for momentum, temperature, advec_order_temp and default order for all prognostic tracers. advec_order_tracer The advection order must be an even number. [integer, default: advec_order = 2] advec_coeff_wind Coefficients for modified Euler-backward advection advec_coeff_temp scheme for momentum, temperature, and all advec_coeff_tracer prognostic tracers. NOTE: advec_coeff=0 is the Euler-forward scheme which is unstable, advec_coeff=1 is the Euler-backward scheme which is highly dissipative. [real, default: advec_coeff = 0.7] num_fill_pass The number of successive passes applied in the tracer borrowing/filling scheme. This conservative scheme is used to fill negative tracer values. It is applied in both the vertical and horizontal directions. Each successive pass should remove more negative values, however an optimum number of passes is probably between 1-3. This is applied after advection to all prognostic tracers. [integer, default: num_fill_pass = 1] grid_sep_coeff Coefficient to suppress grid-separation problem associated with the B-grid. Currently, this option has been disabled within the model, so that this coefficient does nothing. [real, default: grid_sep_coeff = 0.00] filter_option Determines how polar filtering is performed. filter_option = 0, NO filtering = 1, not implemented = 2, filter horiz OMG/DIV, advec mass tendencies, and momentum [integer, default: filter_option = 2] filter_weight Weight applied to the polar filter that will increase (or decrease) the strength of the standard polar filter response function. SS(new) = SS(std)**filter_weight, where SS(std) is the Arakawa and Lamb response function. [integer, default: filter_weight = 1 ] ref_lat_filter The reference latitude at which polar filtering (in each hemisphere) will begin to be applied. Setting this argument >= 90. will turn off polar filtering. [real, default: ref_lat_filter = 60.] num_sponge_levels Number of uppermost model level where a band-pass filter is applied to damp undesirable waves. Currently num_sponge_levels > 1 is not allowed. If num_sponge_levels = 0, no damping is done. [integer, default: num_sponge_levels = 0 ] sponge_coeff_wind Damping coefficients for the sponge layer(s) in sponge_coeff_temp the uppermost model levels. Coefficients have been sponge_coeff_tracer normalized and must be in the range [0,1]. If num_sponge_levels = 0, the value of the coefficients is ignored. There is no option to specify coefficients that vary with level, although currently num_sponge_levels > 1 is not allowed. [real, default: sponge_coeff = 0.] halo The number of halo rows along all (NEWS) boundaries. There is currently no namelist option that allows unequal halo boundary. NOTE: Additional halo rows are not necessary when using higher order horizontal damping or advection, and may in fact result in poorer cpu performance. [integer, default, halo = 1] num_adjust_dt The number of adjustment time steps for each advection time step, where num_adjust_dt >= 1. [integer, default: num_adjust_dt = 3] num_advec_dt The number of advection/dynamics time steps for each atmospheric/physics time step, where num_advec_dt >= 1. [integer, default: num_advec_dt = 1] decomp The domain decomposition, where decomp(1) = x-axis decomposition, decomp(2) = y-axis decomposition. * If decomp(1)*decomp(2) does not equal the number of processors the model will fail. * If decomp(1)=decomp(2)=0 then default rules apply. * By default, one-dimensional decomposition (in Y) is used. When there is fewer than 2 points per processor, then 2-D decomposition is used. [integer, dimension(2), default: decomp = 0,0] do_conserve_energy If TRUE the temperature tendency will be updated to guarantee that the dynamical core conserves total energy. The correction is applied to a uniform global value. [logical, default: do_conserve_energy=.false.] verbose Flag that control additional printed output. Currently, this option is not being used. [integer, default: verbose = 0] NOTES
None.
None.
None.