CUSTOMER REVEIWS
What happy customers say about us
Joan Cherotich
"This place was amazing! Quality service and very clean. I took my duvet cover and pillow cases for the drop off service and it was quick and easy to do. Will come here again for my laundry needs."
Grace Muthoni
"First time here and felt like I was at home, awesome customer service, and very friendly. You need a laundry card to use the machines."
Mwangi James
"They did an excellent job in cleaning my vehicle. They were professional and thorough. Highly recommend."
Alfred Mutua
"I loved the location, professionalism and the quality of work. I will continue to use their service and highly recommend you look no further."


Jeff L Gaol
Photography
Engineering
Photography
See my
Instagram here
.
Your tour-guide around Taipei and New Taipei City
.
Beauty
Traveling
Couple
Event
Graduation
Family


Bundled Third Party Applications Support
Some Silicon Graphics product bundles contain software produced by other companies. Often, these companies provide direct end-user support for their products. If the product you have purchased contains the software listed below, please pay special attention to the details on this page when you need support.
| Adobe Acrobat | All support for Adobe products is provided directly by Adobe. Customers who would like to receive updates, licenses, and support for these products should contact Adobe directly. Adobe has many support phone numbers, to find the correct one for your situation please see the Adobe Support & Services website and click on "How to Reach Us By Phone". |
|
| Appletalk from Xinet |
The AppleTalk and AppleShare connectivity solutions included with your System are products of Xinet. Support for these products is available by contacting Xinet.
Phone:<PHONE_NUMBER>, You can purchase upgrades from Xinet which will allow you to access your system from more than one Macintosh at a time, and to print to multiple printers. This functionality can be added with a simple license, the software is already loaded! Xinet can also provide FullPress(tm), their state of the art software that will allow your system to become a file, print, and OPI server for prepress workgroups. For information, contact Xinet. |
For more information on SGI support modes, see Supportfolio Online.
For more information on other services available in your area, contact your Silicon Graphics sales representative. For more information on SGI's Support & Service visit our website or contact 1-800-800-4SGI.


S3 stands for Simple Storage Service. It’s designed as a web service to store and retrieve any amount of data from anywhere on the web. In short, highly scalable, reliable, fast, inexpensive data storage. By default, access to them is fairly restricted, but there’s a few ways that it can get a little messed up and potentially allow an attacker to access or store arbitrary data in your bucket.
S3 Buckets are within a global namespace, so they must be uniquely named. S3 buckets can be used for arbitrary data storage but many people use them for hosting websites and web content. Being able to enumerate an S3 bucket is just a fact of how they work, but being able to list their contents, view all contents, and write to them are configurable options.
Controls for S3 Buckets
Access to S3 buckets can be controlled in several ways: IAM policies, S3 bucket policies and S3 ACLs. S3 ACLs are legacy. There’s Amazon documentation about their protection here: https://aws.amazon.com/blogs/security/iam-policies-and-bucket-policies-and-acls-oh-my-controlling-access-to-s3-resources/.
A world-readable S3 bucket could be accessible like:
aws s3 ls s3://bucket.name


Figure 7. Animated XLink drop-down
This figure uses an animated GIF to show how an extended XLink can be rendered as a drop-down list.
Back to the home page.
This figure uses an animated GIF to show how an extended XLink can be rendered as a drop-down list.


My Parents
My Tribute, Nup, Biggest Tribute is worth-giving to my Parents.To them I'm thankful for
absolutely everything.
"When you look into your Parent's eyes, you know that is the purest love you can find on this Earth."
“ The greatest gifts I ever got from Allah; I call them my Mama and Baba.My
love and respect for them is beyond words. And I hope they will always feel that, even when I’m not
around to tell them so.”
Honestly speaking, whenever me and my friends discussed our
parents, I used to give you the same title everytime.I used to call you the Catalyst
to my life reactions.It is so hard for me to do anything when you are not around.


|
|||||||||||
| PREV NEXT | FRAMES NO FRAMES |
| Packages that use ProtocolException | |
| net.nutch.protocol | |
| net.nutch.protocol.file | Protocol plugin which supports retrieving local file resources. |
| net.nutch.protocol.ftp | Protocol plugin which supports retrieving documents via the ftp protocol. |
| net.nutch.protocol.http | Protocol plugin which supports retrieving documents via the http protocol. |
| Uses of ProtocolException in net.nutch.protocol |
| Subclasses of ProtocolException in net.nutch.protocol | |
class |
ProtocolNotFound
|
class |
ResourceGone
Thrown by Protocol.getContent(String) when a URL is invalid. |
class |
RetryLater
Thrown by Protocol.getContent(String) when a URL should be
retried later. |
| Methods in net.nutch.protocol that throw ProtocolException | |
Content |
Protocol.getContent(String url)
Returns the Content for a url. |
| Uses of ProtocolException in net.nutch.protocol.file |
| Subclasses of ProtocolException in net.nutch.protocol.file | |
class |
FileError
Thrown for File error codes. |
class |
FileException
|
| Uses of ProtocolException in net.nutch.protocol.ftp |
| Subclasses of ProtocolException in net.nutch.protocol.ftp | |
class |
FtpError
Thrown for Ftp error codes. |
class |
FtpException
Superclass for important exceptions thrown during FTP talk, that must be handled with care. |
class |
FtpExceptionBadSystResponse
Exception indicating bad reply of SYST command. |
class |
FtpExceptionCanNotHaveDataConnection
Exception indicating failure of opening data connection. |
class |
FtpExceptionControlClosedByForcedDataClose
Exception indicating control channel is closed by server end, due to forced closure of data channel at client (our) end. |
class |
FtpExceptionUnknownForcedDataClose
Exception indicating unrecognizable reply from server after forced closure of data channel by client (our) side. |
| Uses of ProtocolException in net.nutch.protocol.http |
| Subclasses of ProtocolException in net.nutch.protocol.http | |
class |
HttpError
Thrown for HTTP error codes. |
class |
HttpException
|
| Methods in net.nutch.protocol.http that throw ProtocolException | |
static boolean |
RobotRulesParser.isAllowed(URL url)
|
Content |
Http.getContent(String urlString)
|
| Constructors in net.nutch.protocol.http that throw ProtocolException | |
HttpResponse(URL url)
|
|
HttpResponse(String orig,
URL url)
|
|
|||||||||||
| PREV NEXT | FRAMES NO FRAMES |


test some really long content test some really long content test some really long content test some really long content
icon
icon
icon
icon
icon
icon
icon
test some really long content test some really long content test some really long content test some really long content


--- redirect_from: /docs/1.0.19/modules/ng1.html ---
This angular 1 provider instantiates a Router and exposes its services via the angular injector
This angular 1 provider instantiates a Router and exposes its services via the angular injector
This is a StateBuilder.builder function for angular1 onEnter
, onExit
,
onRetain
callback hooks on a Ng1StateDeclaration.
This is a StateBuilder.builder function for angular1 onEnter
, onExit
,
onRetain
callback hooks on a Ng1StateDeclaration.
When the StateBuilder builds a StateObject object from a raw StateDeclaration, this builder ensures that those hooks are injectable for @uirouter/angularjs (ng1).
This is a StateBuilder.builder function for angular1 views
.
This is a StateBuilder.builder function for angular1 views
.
When the StateBuilder builds a StateObject object from a raw StateDeclaration, this builder
handles the views
property with logic specific to @uirouter/angularjs (ng1).
If no views: {}
property exists on the StateDeclaration, then it creates the views
object
and applies the state-level configuration to a view named $default
.
Implementation of the legacy $resolve
service for angular 1.
Asynchronously injects a resolve block.
Asynchronously injects a resolve block.
This emulates most of the behavior of the ui-router 0.2.x $resolve.resolve() service API.
This API is no longer not part of the standard @uirouter/angularjs
bundle.
For users of the prebuilt bundles, add the release/resolveService.min.js
UMD bundle.
For bundlers (webpack, browserify, etc), add @uirouter/angularjs/lib/legacy/resolveService
.
Given an object invocables
, where keys are strings and values are injectable functions,
injects each function, and waits for the resulting promise to resolve.
When all resulting promises are resolved, returns the results as an object.
let invocables = {
foo: [ '$http', ($http) =>
$http.get('/api/foo').then(resp => resp.data) ],
bar: [ 'foo', '$http', (foo, $http) =>
$http.get('/api/bar/' + foo.barId).then(resp => resp.data) ]
}
$resolve.resolve(invocables)
.then(results => console.log(results.foo, results.bar))
// Logs foo and bar:
// { id: 123, barId: 456, fooData: 'foo data' }
// { id: 456, barData: 'bar data' }
an object which looks like an StateDeclaration.resolve object; keys are resolve names and values are injectable functions
key/value pre-resolved data (locals)
a promise for a "parent resolve"
Generated using TypeDoc
Angular 1 types
UI-Router core provides various Typescript types which you can use for code completion and validating parameter values, etc. The customizations to the core types for Angular UI-Router are documented here.
The optional $resolve service is also documented here.


7. Logical Agents
Suppose the agent has progressed to the point shown in Figure wumpus-seq35-figure(a), page wumpus-seq35-figure, having perceived nothing in [1,1], a breeze in [2,1], and a stench in [1,2], and is now concerned with the contents of [1,3], [2,2], and [3,1]. Each of these can contain a pit, and at most one can contain a wumpus. Following the example of Figure wumpus-entailment-figure, construct the set of possible worlds. (You should find 32 of them.) Mark the worlds in which the KB is true and those in which each of the following sentences is true:
$\alpha_2$ = “There is no pit in [2,2].”
$\alpha_3$ = “There is a wumpus in [1,3].”
Hence show that ${KB} {\models}\alpha_2$ and ${KB} {\models}\alpha_3$.
(Adapted from @Barwise+Etchemendy:1993 .) Given the following, can you prove that the unicorn is mythical? How about magical? Horned?
If the unicorn is mythical, then it is immortal, but if it is not mythical, then it is a mortal mammal. If the unicorn is either immortal or a mammal, then it is horned. The unicorn is magical if it is horned.
Exercise 7.3 [truth-value-exercise]
Consider the problem of deciding whether a propositional logic sentence is true in a given model.
-
Write a recursive algorithm PL-True?$ (s, m )$ that returns ${true}$ if and only if the sentence $s$ is true in the model $m$ (where $m$ assigns a truth value for every symbol in $s$). The algorithm should run in time linear in the size of the sentence. (Alternatively, use a version of this function from the online code repository.)
-
Give three examples of sentences that can be determined to be true or false in a partial model that does not specify a truth value for some of the symbols.
-
Show that the truth value (if any) of a sentence in a partial model cannot be determined efficiently in general.
-
Modify your algorithm so that it can sometimes judge truth from partial models, while retaining its recursive structure and linear run time. Give three examples of sentences whose truth in a partial model is not detected by your algorithm.
-
Investigate whether the modified algorithm makes $TT-Entails?$ more efficient.
Which of the following are correct?
-
${False} \models {True}$.
-
${True} \models {False}$.
-
$(A\land B) \models (A{\;\;{\Leftrightarrow}\;\;}B)$.
-
$A{\;\;{\Leftrightarrow}\;\;}B \models A \lor B$.
-
$A{\;\;{\Leftrightarrow}\;\;}B \models \lnot A \lor B$.
-
$(A\land B){:\;{\Rightarrow}:\;}C \models (A{:\;{\Rightarrow}:\;}C)\lor(B{:\;{\Rightarrow}:\;}C)$.
-
$(C\lor (\lnot A \land \lnot B)) \equiv ((A{:\;{\Rightarrow}:\;}C) \land (B {:\;{\Rightarrow}:\;}C))$.
-
$(A\lor B) \land (\lnot C\lor\lnot D\lor E) \models (A\lor B)$.
-
$(A\lor B) \land (\lnot C\lor\lnot D\lor E) \models (A\lor B) \land (\lnot D\lor E)$.
-
$(A\lor B) \land \lnot(A {:\;{\Rightarrow}:\;}B)$ is satisfiable.
-
$(A{\;\;{\Leftrightarrow}\;\;}B) \land (\lnot A \lor B)$ is satisfiable.
-
$(A{\;\;{\Leftrightarrow}\;\;}B) {\;\;{\Leftrightarrow}\;\;}C$ has the same number of models as $(A{\;\;{\Leftrightarrow}\;\;}B)$ for any fixed set of proposition symbols that includes $A$, $B$, $C$.
Which of the following are correct?
-
${False} \models {True}$.
-
${True} \models {False}$.
-
$(A\land B) \models (A{\;\;{\Leftrightarrow}\;\;}B)$.
-
$A{\;\;{\Leftrightarrow}\;\;}B \models A \lor B$.
-
$A{\;\;{\Leftrightarrow}\;\;}B \models \lnot A \lor B$.
-
$(A\lor B) \land (\lnot C\lor\lnot D\lor E) \models (A\lor B\lor C) \land (B\land C\land D{:\;{\Rightarrow}:\;}E)$.
-
$(A\lor B) \land (\lnot C\lor\lnot D\lor E) \models (A\lor B) \land (\lnot D\lor E)$.
-
$(A\lor B) \land \lnot(A {:\;{\Rightarrow}:\;}B)$ is satisfiable.
-
$(A\land B){:\;{\Rightarrow}:\;}C \models (A{:\;{\Rightarrow}:\;}C)\lor(B{:\;{\Rightarrow}:\;}C)$.
-
$(C\lor (\lnot A \land \lnot B)) \equiv ((A{:\;{\Rightarrow}:\;}C) \land (B {:\;{\Rightarrow}:\;}C))$.
-
$(A{\;\;{\Leftrightarrow}\;\;}B) \land (\lnot A \lor B)$ is satisfiable.
-
$(A{\;\;{\Leftrightarrow}\;\;}B) {\;\;{\Leftrightarrow}\;\;}C$ has the same number of models as $(A{\;\;{\Leftrightarrow}\;\;}B)$ for any fixed set of proposition symbols that includes $A$, $B$, $C$.
Exercise 7.6 [deduction-theorem-exercise]
Prove each of the following assertions:
-
$\alpha$ is valid if and only if ${True}{\models}\alpha$.
-
For any $\alpha$, ${False}{\models}\alpha$.
-
$\alpha{\models}\beta$ if and only if the sentence $(\alpha {:\;{\Rightarrow}:\;}\beta)$ is valid.
-
$\alpha \equiv \beta$ if and only if the sentence $(\alpha{\;\;{\Leftrightarrow}\;\;}\beta)$ is valid.
-
$\alpha{\models}\beta$ if and only if the sentence $(\alpha \land \lnot \beta)$ is unsatisfiable.
Prove, or find a counterexample to, each of the following assertions:
-
If $\alpha\models\gamma$ or $\beta\models\gamma$ (or both) then $(\alpha\land \beta)\models\gamma$
-
If $(\alpha\land \beta)\models\gamma$ then $\alpha\models\gamma$ or $\beta\models\gamma$ (or both).
-
If $\alpha\models (\beta \lor \gamma)$ then $\alpha \models \beta$ or $\alpha \models \gamma$ (or both).
Prove, or find a counterexample to, each of the following assertions:
-
If $\alpha\models\gamma$ or $\beta\models\gamma$ (or both) then $(\alpha\land \beta)\models\gamma$
-
If $\alpha\models (\beta \land \gamma)$ then $\alpha \models \beta$ and $\alpha \models \gamma$.
-
If $\alpha\models (\beta \lor \gamma)$ then $\alpha \models \beta$ or $\alpha \models \gamma$ (or both).
Consider a vocabulary with only four propositions, $A$, $B$, $C$, and $D$. How many models are there for the following sentences?
-
$B\lor C$.
-
$\lnot A\lor \lnot B \lor \lnot C \lor \lnot D$.
-
$(A{:\;{\Rightarrow}:\;}B) \land A \land \lnot B \land C \land D$.
We have defined four binary logical connectives.
-
Are there any others that might be useful?
-
How many binary connectives can there be?
-
Why are some of them not very useful?
Exercise 7.11 [logical-equivalence-exercise]
Using a method of your choice, verify each of the equivalences in Table [logical-equivalence-table] (page logical-equivalence-table).
Exercise 7.12 [propositional-validity-exercise]
Decide whether each of the following sentences is valid, unsatisfiable, or neither. Verify your decisions using truth tables or the equivalence rules of Table [logical-equivalence-table] (page logical-equivalence-table).
-
${Smoke} {:\;{\Rightarrow}:\;}{Smoke}$
-
${Smoke} {:\;{\Rightarrow}:\;}{Fire}$
-
$({Smoke} {:\;{\Rightarrow}:\;}{Fire}) {:\;{\Rightarrow}:\;}(\lnot {Smoke} {:\;{\Rightarrow}:\;}\lnot {Fire})$
-
${Smoke} \lor {Fire} \lor \lnot {Fire}$
-
$(({Smoke} \land {Heat}) {:\;{\Rightarrow}:\;}{Fire}) {\;\;{\Leftrightarrow}\;\;}(({Smoke} {:\;{\Rightarrow}:\;}{Fire}) \lor ({Heat} {:\;{\Rightarrow}:\;}{Fire}))$
-
$({Smoke} {:\;{\Rightarrow}:\;}{Fire}) {:\;{\Rightarrow}:\;}(({Smoke} \land {Heat}) {:\;{\Rightarrow}:\;}{Fire}) $
-
${Big} \lor {Dumb} \lor ({Big} {:\;{\Rightarrow}:\;}{Dumb})$
Exercise 7.13 [propositional-validity-exercise]
Decide whether each of the following sentences is valid, unsatisfiable, or neither. Verify your decisions using truth tables or the equivalence rules of Table [logical-equivalence-table] (page logical-equivalence-table).
-
${Smoke} {:\;{\Rightarrow}:\;}{Smoke}$
-
${Smoke} {:\;{\Rightarrow}:\;}{Fire}$
-
$({Smoke} {:\;{\Rightarrow}:\;}{Fire}) {:\;{\Rightarrow}:\;}(\lnot {Smoke} {:\;{\Rightarrow}:\;}\lnot {Fire})$
-
${Smoke} \lor {Fire} \lor \lnot {Fire}$
-
$(({Smoke} \land {Heat}) {:\;{\Rightarrow}:\;}{Fire}) {\;\;{\Leftrightarrow}\;\;}(({Smoke} {:\;{\Rightarrow}:\;}{Fire}) \lor ({Heat} {:\;{\Rightarrow}:\;}{Fire}))$
-
${Big} \lor {Dumb} \lor ({Big} {:\;{\Rightarrow}:\;}{Dumb})$
-
$({Big} \land {Dumb}) \lor \lnot {Dumb}$
Exercise 7.14 [cnf-proof-exercise]
Any propositional logic sentence is logically equivalent to the assertion that each possible world in which it would be false is not the case. From this observation, prove that any sentence can be written in CNF.
Use resolution to prove the sentence $\lnot A \land \lnot B$ from the clauses in Exercise convert-clausal-exercise.
This exercise looks into the relationship between clauses and implication sentences.
-
Show that the clause $(\lnot P_1 \lor \cdots \lor \lnot P_m \lor Q)$ is logically equivalent to the implication sentence $(P_1 \land \cdots \land P_m) {\;{\Rightarrow}\;}Q$.
-
Show that every clause (regardless of the number of positive literals) can be written in the form $(P_1 \land \cdots \land P_m) {\;{\Rightarrow}\;}(Q_1 \lor \cdots \lor Q_n)$, where the $P$s and $Q$s are proposition symbols. A knowledge base consisting of such sentences is in implicative normal form or Kowalski form @Kowalski:1979.
-
Write down the full resolution rule for sentences in implicative normal form.
According to some political pundits, a person who is radical ($R$) is electable ($E$) if he/she is conservative ($C$), but otherwise is not electable.
-
Which of the following are correct representations of this assertion?
-
$(R\land E)\iff C$
-
$R{:\;{\Rightarrow}:\;}(E\iff C)$
-
$R{:\;{\Rightarrow}:\;}((C{:\;{\Rightarrow}:\;}E) \lor \lnot E)$
-
-
Which of the sentences in (a) can be expressed in Horn form?
This question considers representing satisfiability (SAT) problems as CSPs.
-
Draw the constraint graph corresponding to the SAT problem for the particular case $n5$.
-
How many solutions are there for this general SAT problem as a function of $n$?
-
Suppose we apply {Backtracking-Search} (page backtracking-search-algorithm) to find all solutions to a SAT CSP of the type given in (a). (To find all solutions to a CSP, we simply modify the basic algorithm so it continues searching after each solution is found.) Assume that variables are ordered $X_1,\ldots,X_n$ and ${false}$ is ordered before ${true}$. How much time will the algorithm take to terminate? (Write an $O(\cdot)$ expression as a function of $n$.)
-
We know that SAT problems in Horn form can be solved in linear time by forward chaining (unit propagation). We also know that every tree-structured binary CSP with discrete, finite domains can be solved in time linear in the number of variables (Section csp-structure-section). Are these two facts connected? Discuss.
This question considers representing satisfiability (SAT) problems as CSPs.
-
Draw the constraint graph corresponding to the SAT problem for the particular case $n4$.
-
How many solutions are there for this general SAT problem as a function of $n$?
-
Suppose we apply {Backtracking-Search} (page backtracking-search-algorithm) to find all solutions to a SAT CSP of the type given in (a). (To find all solutions to a CSP, we simply modify the basic algorithm so it continues searching after each solution is found.) Assume that variables are ordered $X_1,\ldots,X_n$ and ${false}$ is ordered before ${true}$. How much time will the algorithm take to terminate? (Write an $O(\cdot)$ expression as a function of $n$.)
-
We know that SAT problems in Horn form can be solved in linear time by forward chaining (unit propagation). We also know that every tree-structured binary CSP with discrete, finite domains can be solved in time linear in the number of variables (Section csp-structure-section). Are these two facts connected? Discuss.
Explain why every nonempty propositional clause, by itself, is satisfiable. Prove rigorously that every set of five 3-SAT clauses is satisfiable, provided that each clause mentions exactly three distinct variables. What is the smallest set of such clauses that is unsatisfiable? Construct such a set.
A propositional 2-CNF expression is a conjunction of clauses, each containing exactly 2 literals, e.g.,
-
Prove using resolution that the above sentence entails $G$.
-
Two clauses are semantically distinct if they are not logically equivalent. How many semantically distinct 2-CNF clauses can be constructed from $n$ proposition symbols?
-
Using your answer to (b), prove that propositional resolution always terminates in time polynomial in $n$ given a 2-CNF sentence containing no more than $n$ distinct symbols.
-
Explain why your argument in (c) does not apply to 3-CNF.
Prove each of the following assertions:
-
Every pair of propositional clauses either has no resolvents, or all their resolvents are logically equivalent.
-
There is no clause that, when resolved with itself, yields (after factoring) the clause $(\lnot P \lor \lnot Q)$.
-
If a propositional clause $C$ can be resolved with a copy of itself, it must be logically equivalent to $ True $.
Consider the following sentence:
-
Determine, using enumeration, whether this sentence is valid, satisfiable (but not valid), or unsatisfiable.
-
Convert the left-hand and right-hand sides of the main implication into CNF, showing each step, and explain how the results confirm your answer to (a).
-
Prove your answer to (a) using resolution.
A sentence is in disjunctive normal form(DNF) if it is the disjunction of conjunctions of literals. For example, the sentence $(A \land B \land \lnot C) \lor (\lnot A \land C) \lor (B \land \lnot C)$ is in DNF.
-
Any propositional logic sentence is logically equivalent to the assertion that some possible world in which it would be true is in fact the case. From this observation, prove that any sentence can be written in DNF.
-
Construct an algorithm that converts any sentence in propositional logic into DNF. (Hint: The algorithm is similar to the algorithm for conversion to CNF iven in Sectio pl-resolution-section.)
-
Construct a simple algorithm that takes as input a sentence in DNF and returns a satisfying assignment if one exists, or reports that no satisfying assignment exists.
-
Apply the algorithms in (b) and (c) to the following set of sentences:
$A {\Rightarrow} B$
$B {\Rightarrow} C$
$C {\Rightarrow} A$
- Since the algorithm in (b) is very similar to the algorithm for conversion to CNF, and since the algorithm in (c) is much simpler than any algorithm for solving a set of sentences in CNF, why is this technique not used in automated reasoning?
Exercise 7.25 [convert-clausal-exercise]
Convert the following set of sentences to clausal form.
S1: $A {\;\;{\Leftrightarrow}\;\;}(B \lor E)$.
S2: $E {:\;{\Rightarrow}:\;}D$.
S3: $C \land F {:\;{\Rightarrow}:\;}\lnot B$.
S4: $E {:\;{\Rightarrow}:\;}B$.
S5: $B {:\;{\Rightarrow}:\;}F$.
S6: $B {:\;{\Rightarrow}:\;}C$
Give a trace of the execution of DPLL on the conjunction of these clauses.
Exercise 7.26 [convert-clausal-exercise]
Convert the following set of sentences to clausal form.
S1: $A {\;\;{\Leftrightarrow}\;\;}(C \lor E)$.
S2: $E {:\;{\Rightarrow}:\;}D$.
S3: $B \land F {:\;{\Rightarrow}:\;}\lnot C$.
S4: $E {:\;{\Rightarrow}:\;}C$.
S5: $C {:\;{\Rightarrow}:\;}F$.
S6: $C {:\;{\Rightarrow}:\;}B$
Give a trace of the execution of DPLL on the conjunction of these clauses.
Is a randomly generated 4-CNF sentence with $n$ symbols and $m$ clauses more or less likely to be solvable than a randomly generated 3-CNF sentence with $n$ symbols and $m$ clauses? Explain.
Exercise 7.28 [minesweeper-exercise]
Minesweeper, the well-known computer game, is closely related to the wumpus world. A minesweeper world is a rectangular grid of $N$ squares with $M$ invisible mines scattered among them. Any square may be probed by the agent; instant death follows if a mine is probed. Minesweeper indicates the presence of mines by revealing, in each probed square, the number of mines that are directly or diagonally adjacent. The goal is to probe every unmined square.
-
Let $X_{i,j}$ be true iff square $[i,j]$ contains a mine. Write down the assertion that exactly two mines are adjacent to [1,1] as a sentence involving some logical combination of $X_{i,j}$ propositions.
-
Generalize your assertion from (a) by explaining how to construct a CNF sentence asserting that $k$ of $n$ neighbors contain mines.
-
Explain precisely how an agent can use {DPLL} to prove that a given square does (or does not) contain a mine, ignoring the global constraint that there are exactly $M$ mines in all.
-
Suppose that the global constraint is constructed from your method from part (b). How does the number of clauses depend on $M$ and $N$? Suggest a way to modify {DPLL} so that the global constraint does not need to be represented explicitly.
-
Are any conclusions derived by the method in part (c) invalidated when the global constraint is taken into account?
-
Give examples of configurations of probe values that induce long-range dependencies such that the contents of a given unprobed square would give information about the contents of a far-distant square. (Hint: consider an $N\times 1$ board.)
Exercise 7.29 [known-literal-exercise]
How long does it take to prove ${KB}{\models}\alpha$ using {DPLL} when $\alpha$ is a literal already contained in ${KB}$? Explain.
Exercise 7.30 [dpll-fc-exercise]
Trace the behavior of {DPLL} on the knowledge base in Figure pl-horn-example-figure when trying to prove $Q$, and compare this behavior with that of the forward-chaining algorithm.
Write a successor-state axiom for the ${Locked}$ predicate, which applies to doors, assuming the only actions available are ${Lock}$ and ${Unlock}$.
Discuss what is meant by optimal behavior in the wumpus world. Show that the {Hybrid-Wumpus-Agent} is not optimal, and suggest ways to improve it.
Suppose an agent inhabits a world with two states, $S$ and $\lnot S$, and can do exactly one of two actions, $a$ and $b$. Action $a$ does nothing and action $b$ flips from one state to the other. Let $S^t$ be the proposition that the agent is in state $S$ at time $t$, and let $a^t$ be the proposition that the agent does action $a$ at time $t$ (similarly for $b^t$).
-
Write a successor-state axiom for $S^{t+1}$.
-
Convert the sentence in (a) into CNF.
-
Show a resolution refutation proof that if the agent is in $\lnot S$ at time $t$ and does $a$, it will still be in $\lnot S$ at time $t+1$.
Exercise 7.34 [ss-axiom-exercise]
Section successor-state-section provides some of the successor-state axioms required for the wumpus world. Write down axioms for all remaining fluent symbols.
Exercise 7.35 [hybrid-wumpus-exercise]
Modify the {Hybrid-Wumpus-Agent} to use the 1-CNF logical state estimation method described on page 1cnf-belief-state-page. We noted on that page that such an agent will not be able to acquire, maintain, and use more complex beliefs such as the disjunction $P_{3,1}\lor P_{2,2}$. Suggest a method for overcoming this problem by defining additional proposition symbols, and try it out in the wumpus world. Does it improve the performance of the agent?


Colts Kicker Adam Vinatieri To Undergo Knee Injury, Miss Rest Of Season
by Matt LombardiIndianapolis Colts kicker Adam Vinatieri has been one of the most reliable players in the NFL for over two decades now. But the 46-year-old’s career could be over after a recent diagnosis.
Vinatieri, who missed his team’s game this past Sunday for the first time since 2010, will undergo knee surgery and miss the rest of the season. ESPN’s Adam Schefter was the first to report the news.
Vinatieri has been inconsistent this year, but he managed to hold onto his job until the injury. It’s unclear if he plans to return after surgery, but he’ll be 47 years old in a few weeks.
Vinatieri will be placed on IR.
Vinatieri is one of the most (if not the most) successful kickers in NFL history. He won three Super Bowl titles for the New England Patriots and added a fourth with the Colts. He has the most career field goals made and the most career points in league history.
 He kicked for the team against the Tampa Bay Buccaneers.
This season, Vinatieri will finish 17-of-25 on field goals and 22-of-28 on PATs. The Colts currently have a 6-7 record.


private var hasModified: Boolean
Whether any modifications have been made on this page (such as adding a new person). This is used to determine what result should be sent to the calling activity.
See Also
sendResult


with tf.name_scope(name) as scope:
return tf.concat(0, tensor_list)
with tf.name_scope(name) as scope:
x = tf.concat(1, tensor_list)
// Track output tensor.
tf.add_to_collection(tf.GraphKeys.LAYER_TENSOR + "/" + name, x)
return x


Last online 10 years ago.
Type any expression and send it to me! E.g. - 2 + ( 5 + 6)
Ok
Fast!
Yes,wait!
I have waited a lot!
Wait for 10 years!


dispersed_phases.initial_conditions¶
-
dispersed_phases.
initial_conditions
(profile, z0, dbm_particle, yk, q, q_type, de, T0=None)[source]¶ Define standard initial conditions for a PlumeParticle from flow rate
Returns the standard variables describing a particle as needed to initializae a PlumeParticle object from specification of the dispersed phase flow rate.
- Parameters
- profileambient.Profile object
The ambient CTD object used by the simulation.
- z0float
Depth of the release point (m)
- dbm_particledbm.FluidParticle or dbm.InsolubleParticle object
Object describing the particle properties and behavior
- ykndarray
Vector of mol fractions of each component of the dispersed phase particle. If the particle is a dbm.InsolubleParticle, then yk should be equal to one.
- qfloat
Flux of the dispersed phase, either as the volume flux (m^3/s) at standard conditions, defined as 0 deg C and 1 bar, or as mass flux (kg/s).
- q_typeint
Determines the type of flux units. 0: we want the mass of a single particle (hence q = None since it is currently unknown), 1: q is volume flux, 2: q is mass flux
- defloat
Initial diameter (m) of the particle
- T0float, default = None
Initial temperature of the of dbm particle object (K). If None, then T0 is set equal to the ambient temperature.
- Returns
- m0ndarray
Initial masses of the components of one particle in the dbm particle object (kg)
- T0float
Initial temperature of the of dbm particle object (K)
- nb0float
Initial number flux of particles at the release (–)
- Pfloat
Local pressure (Pa)
- Safloat
Local salinity surrounding the particle (psu)
- Tafloat
Local temperature surrounding the particle (K)


Legacy COM Application
For many years Microsoft based its products on COM (Component Object Model) and its network extension DCOM (Distributed COM). Many customer built their infrastructure and products over COM technology. The technology is mature, but over the years it becomes legacy; there are many disadvantages when it is needed to use COM based application over networks and cybersecurity is mandatory today. To protect these applications it is needed to put in place countermeasures against malicious attachers or rewrite the entire applications with cyber-security in mind.
With Data Distribution Manager we overcome the previous problems, revamping legacy COM applications at transport layer.
COM/DCOM simple overview
Just try to have a look on how COM works. The following figure shows a basic behavior of DCOM (figure come from https://www.geeksforgeeks.org/distributed-component-object-model-dcom/):
Simplifiying: DCOM extends COM over the network and allows clients to connect to the component (server) just as if it is in the same machine. Looking at the figure above there is a common joining point: DCOM network protocol.
COM/DCOM over Data Distribution Manager
To overcome the DCOM network protocol we developed a library based on Data Distribution Manager which replace the transport layer and use all features available in Data Distribution Manager.
The following figure shows a simple overview:
Data Distribution Manager comes with two ready-made underlying protocols: OpenDDS and Apache Kafka. Both can be used as the final transport protocols. Depending on application and infrastructure requirements it is possible to choose one or the other.
Data Distribution Manager over OpenDDS
To have an overview on the protocol navigate on https://opendds.org/. It is more or less close to DCOM. It is based over a CORBA implementation. Data Distribution Manager has a simple IDL to have a common shared layer with other transport protocols (e.g. Apache Kafka). With OpenDDS the component acts as server like in DCOM and clients connects to it using OpenDDS. With OpenDDS it is not needed to have an external infrastructure, but clients shall be aware where is located DCPSInfoRepo or can use static discovery. Data Distribution Manager is able to start DCPSInfoRepo within the COM Server, anyway clients shall know the DCPSInfoRepo endpoint. OpenDDS can be configured in multiple way, can use multiple wire protocols and achieve the needs to replace DCOM network protocol within some network conditions.
Data Distribution Manager over Apache Kafka
To have an overview on the protocol navigate on https://kafka.apache.org/. It is far from DCOM. It is a stream platform with central server (clusterable), clients connects to the Apache Kafka server and it dispatch messages. With Apache Kafka both the component and clients connects use Apache Kafka servers to exchange messages. With Apache Kafka it is mandatory to have an external infrastruture. So what are the advantages to use Apache Kafka? Try to list some of them:
- The Apache Kafka servers stores the messages: a component (COM server) can recover from a fault and continue to operate from the last point it has stopped
- There is a unique point of dispatching: client and component (COM server) does not be aware of each other, only needs to know the address of Apache Kafka brokers.
- The previous point it is important if the COM application must communicate over the internet, over NAT network and firewall: the communication starts always from the Kafka client (COM Client and/or COM Server)
COM over the Cloud
With Data Distribution Manager over Apache Kafka it is possible to have COM applications over the Cloud. Many cloud players today have an installation of Apache Kafka in their datacenters. So a legacy COM application can be revamped to be internet-aware.
If the article is interesting and want to know more contact us.


We enhance dogs!
- exploit mission-critical technologies
- innovate B2B supply-chains
- morph cross-platform initiatives
- recontextualize end-to-end e-services
- reintermediate intuitive deliverables
- extend intuitive schemas
- iterate world-class interfaces
- deliver bleeding-edge synergies


public class RequestInterpreter
extends java.lang.Object
| Constructor and Description |
|---|
RequestInterpreter(java.lang.String requestLine)
Add request line to the request model, if request line is not understood,
then request model will be leave null which indicates the bad request.
|
| Modifier and Type | Method and Description |
|---|---|
long |
getBodyLength()
Get the length of received entity body, 0 means the request is either not
understood or not a post method.
|
long |
getContentLenght()
Get the entity body length from the header "Content-Length", 0 means the
request is either not understood or not a post request.
|
RequestModel |
getRequestModel()
Return the request model that RequestInterpreter constructed.
|
boolean |
isBadRequest()
return true if the request model has not been initialized.
|
void |
processBody(char[] input)
Append char[] to the request entity body.
|
boolean |
processHeaders(java.lang.String header)
Add a header to request model if the input string is not empty and the
request line has been understood and the version of HTTP is not 0.9.
|
public RequestInterpreter(java.lang.String requestLine)
requestLine
- request line from network controllerpublic boolean isBadRequest()
public boolean processHeaders(java.lang.String header)
header
- HTTP headerpublic long getContentLenght()
public long getBodyLength()
public void processBody(char[] input)
input
- the char[] that to append to the body.public RequestModel getRequestModel()


Dak Prescott, Cowboys Hold Off Lions 35-27 Sunday in Detroit
by Frank HeinzThe Dallas Cowboys improved to 6-4 on the year with a win over a struggling Lions team Sunday in Detroit.
Dak Prescott, who has racked up more than 835 yards in the last two games, finished the day 29 of 46 for 444 yards and three TDs.
Zeke Elliott carried the ball 16 times for 45 yards and got one touchdown on the ground and another through the air where he caught two balls for 28 yards. Elliott also had a fumble on the first carry of the game -- that led to six points for the Lions.
Prescott completed nine passes to Michael Gallup, who tallied 148 yards, and another seven to Randall Cobb, who had 115 yards on the day and a touchdown.
Rookie Tony Pollard also had a receiving touchdown with four catches for 44 yards.
Dallas came into the game leading the league in total yards for a fourth straight week and will likely hold onto that spot after Sunday's game.
The Cowboys continue to have a chance to close the season as the NFL's top-ranked offense for the first time in 42 years.
Dallas needed the win, coming off a loss to Minnesota at home and having dropped four of six games.
The Cowboys are tied with Philadelphia atop the NFC East and their schedule down the stretch is facing tough opponents in the New England Patriots and the Eagles on the road.
The Eagles and the Pats play Sunday afternoon and the outcome will help determine the NFC East rankings.
The Lions, meanwhile, have lost six of seven after a solid start and may be watching their season slip away.


Promised? OK! Here's the use case: you want to test your systems that have made up addresses like awesomeserver.local
and don't want to deal with certificate warnings or fancy errors that arise when you just use a self signed cert. This post is a self-reference for my convenience. There are ample other instructions out there.
Disclaimer: I mostly followed this instructions short of updating some of the commands to use elliptic-curve cyphers.
Useful with a side of work
The process requires a series of steps:
- Create the private key and root certificate
- Create an intermediate key and certificate
- Create certs for your servers
- Convert them if necessary (e.g. for import in Java Keystors JKS)
- Make the public key of the root and intermediate certs available
- Import these certs in all browsers and runtimes that you will use for testing
Normal mortal users, without these imports will get scary error messages. While this doesn't deter the determined, it's good for a laugh.
We don't want old school certs, so we aim at a modern Elliptic-curve cert (Details here). Here we go:
Setting up the directory structure
mkdir -pv -m 600 /root/ca/intermediate
cd /root/ca
curl https://jamielinux.com/docs/openssl-certificate-authority/_downloads/root-config.txt -o openssl.cnf
curl https://jamielinux.com/docs/openssl-certificate-authority/_downloads/intermediate-config.txt -o intermediate/openssl.cnf
mkdir certs crl newcerts private
chmod 700 private
touch index.txt
echo 1000 > serial
cd intermediate
mkdir certs crl csr newcerts private
chmod 700 private
touch index.txt
echo 1000 > serial
echo 1000 > crlnumber
cd ..
You want to check the downloaded files and eventually change the path in case you have chosen to us a different one.
The Root CA
export OPENSSL_CONF=./openssl.cnf
openssl ecparam -genkey -name prime256v1 -outform PEM | openssl ec -aes256 -out private/ca.key.pem
chmod 400 private/ca.key.pem
openssl req -config openssl.cnf -key private/ca.key.pem -new -x509 -days 7300 -SHA384 -extensions v3_ca -out certs/ca.cert.pem
Keep them save - remember: its on my harddrive only isn't save!!!
You want to check the file using openssl x509 -noout -text -in certs/ca.cert.pem
or on macOS just hit the space key in finder.
The intermediate CA (one or more)
Good practise is to keep the root keys save and only use them for one or more intermediate certificate(s).
This allows to delegate cert creation to multiple players and also allows to invalidate an intermediate cert if needed.
openssl ecparam -genkey -name prime256v1 -outform PEM | openssl ec -aes256 -out intermediate/private/intermediate.key.pem
chmod 400 intermediate/private/intermediate.key.pem
openssl req -config intermediate/openssl.cnf -new -SHA384 -key intermediate/private/intermediate.key.pem -out intermediate/csr/intermediate.csr.pem
openssl ca -config openssl.cnf -extensions v3_intermediate_ca -days 3650 -notext -md sha256 -in intermediate/csr/intermediate.csr.pem -out intermediate/certs/intermediate.cert.pem
chmod 444 intermediate/certs/intermediate.cert.pem
openssl verify -CAfile certs/ca.cert.pem intermediate/certs/intermediate.cert.pem
The last command should return OK. Now we need to create the certificate chain.
That's the file you need to install in browsers or other key stores avoid unknown certificate
errors.
cat intermediate/certs/intermediate.cert.pem certs/ca.cert.pem > intermediate/certs/ca-chain.cert.pem
chmod 444 intermediate/certs/ca-chain.cert.pem
That was a lot of command line. For a production system, save yourself the headache and use LetsEncrypt with LE4D for Domino
Actual server certificates
With all the prerequisites in place we now can create server certificates. You could, to save time, create a wildcard certificate (like *.theprojectthatshallnotbenamed.com
), but that might bite you once you want to enable mutual TLS authentication. So stick to individual certs.
export SSL_DOMAIN_NAME=www.example.com
openssl ecparam -genkey -name prime256v1 -outform PEM -out intermediate/private/$SSL_DOMAIN_NAME.key.pem
chmod 400 intermediate/private/$SSL_DOMAIN_NAME.key.pem
openssl req -config intermediate/openssl.cnf -key intermediate/private/$SSL_DOMAIN_NAME.key.pem -new -sha256 -out intermediate/csr/$SSL_DOMAIN_NAME.csr.pem
openssl ca -config intermediate/openssl.cnf -extensions server_cert -days 375 -notext -md sha256 -in intermediate/csr/$SSL_DOMAIN_NAME.csr.pem -out intermediate/certs/$SSL_DOMAIN_NAME.cert.pem
chmod 444 intermediate/certs/$SSL_DOMAIN_NAME.cert.pem
You need 3 files on your server system:
- ca-chain.cert.pem
- www.example.com.key.pem
- www.example.com.cert.pem
As usual: YMMV - make sure you read the detailed instructions
Posted by Stephan H Wissel on 16 October 2019 | Comments (0) | categories: HTTP(S) Networking WebDevelopment


Language
Sign Up for Special Offers
Deals
Sign In / Register
Search
Cruises
Phone
Menu

Plan a Cruise
Onboard our Ships
Destinations
Booked Guests
Contact Us
1-800-774-6237
FIND A CRUISE
See Recently Viewed
See if you qualify for special cruise fares
Advanced Search
Month / Year: Any
Destination: Any
Departure / End Port: Any
Cruise Length: Any
View Results
Find a Cruise Vacation
Mediterranean Cruises from $1,049
Alaska Cruisestours from $998
Mexico Cruises from $506
Princess MedallionClass
More time for me time


| • Overview | ||
| • List of tags | ||
| • Custom tags | ||
Next: List of tags, Up: Tags [Contents][Index]
Tags look like this: {% tag %}
. Tags are more complex than variables: Some
create text in the output, some control flow by performing loops or logic, and
some load external information into the template to be used by later variables.
Some tags require beginning and ending tags (i.e. {% tag %} ... tag contents
... {% endtag %}
).
Here are some of the more commonly used tags:
for
Loop over each item in an array. For example, to display a list of athletes
provided in athlete-list
:

 {% for athlete in athlete-list %}
{{ athlete.name }}
 {% endfor %}

if
, else
Evaluates a variable, and if that variable is “true” the contents of the block are displayed:
{% if athlete-list %} Number of athletes: {{ athlete-list|length }} {% else %} No athletes. {% endif %}
block
and extends
Set up template inheritance (see below), a powerful way of cutting down on “boilerplate” in templates.
Next: Custom tags, Previous: Overview, Up: Tags [Contents][Index]
| • block | ||
| • extends | ||
| • super | ||
| • comment | ||
| • cycle | ||
| • debug | ||
| • filter | ||
| • firstof | ||
| • for | ||
| • if | ||
| • Boolean operators | ||
| • ifchanged | ||
| • ifequal | ||
| • ifnotequal | ||
| • include | ||
Next: extends, Up: List of tags [Contents][Index]
Defines a block that can be overridden by child templates.
Sample usage:
{% block stylesheets %} ... {% endblock %}
See Template inheritance for more information.
Next: super, Previous: block, Up: List of tags [Contents][Index]
Extends a template
Sample usage:
{% extends "base.html" %}
Next: comment, Previous: extends, Up: List of tags [Contents][Index]
Gets the content of the block from the parent template. You can pass the name of the block of the parent block you want to access. If no name is passed, then the current block’s parent is used.
Sample usage:
{% super "stylesheets" %} {% block stylesheets %} {% super %} {% endblock %}
Next: cycle, Previous: super, Up: List of tags [Contents][Index]
Ignores everything between {% comment %}
and {% endcomment %}
.
An optional note may be inserted in the first tag. For example, this is
useful when commenting out code for documenting why the code was disabled.
Sample usage:

Rendered text with {{ pub-date|date }}
 {% comment "Optional note" %}
Commented out text with {{ create-date|date }}
 {% endcomment %}
comment
tags cannot be nested.
Next: debug, Previous: comment, Up: List of tags [Contents][Index]
Produces one of its arguments each time this tag is encountered. The first argument is produced on the first encounter, the second argument on the second encounter, and so forth. Once all arguments are exhausted, the tag cycles to the first argument and produces it again.
This tag is particularly useful in a loop:
{% for o in some-list %}
 ...
 {% endfor %}
The first iteration produces HTML that refers to class row1
, the second to
row2
, the third to row1
again, and so on for each iteration of the
loop.
You can use variables, too. For example, if you have two template variables,
rowvalue1
and rowvalue2
, you can alternate between their values like
this:
{% for o in some-list %}
 ...
 {% endfor %}
You can mix variables and strings:
{% for o in some-list %}
 ...
 {% endfor %}
You can use any number of values in a cycle
tag, separated by spaces.
Values enclosed in double quotes ("
) are treated
as string literals, while values without quotes are treated as template
variables.
Next: filter, Previous: cycle, Up: List of tags [Contents][Index]
Outputs a whole load of debugging information
Next: firstof, Previous: debug, Up: List of tags [Contents][Index]
Filters the contents of the block through one or more filters. Multiple filters can be specified with pipes and filters can have arguments, just as in variable syntax.
Note that the block includes all the text between the filter
and
endfilter
tags.
Sample usage:
{% filter force-escape|lower %} This text will be HTML-escaped, and will appear in all lowercase. {% endfilter %}
|
Next: for, Previous: filter, Up: List of tags [Contents][Index]
Outputs the first argument variable that is not False
. Outputs nothing if
all the passed variables are False
.
Sample usage:
{% firstof var1 var2 var3 %}
You can also use a literal string as a fallback value in case all passed variables are False:
{% firstof var1 var2 var3 "fallback value" %}
Next: if, Previous: firstof, Up: List of tags [Contents][Index]
Loops over each item in an array, making the item available in a context
variable. For example, to display a list of athletes provided in
athlete-list
:

 {% for athlete in athlete-list %}
{{ athlete.name }}
 {% endfor %}

If you need to loop over an association list, you can unpack the values
in each sublist into individual variables. For example, if your context
contains a list of (x . y) coordinates called points
, you could use the
following to output the list of points:
{% for (x . y) in points %} There is a point at {{ x }},{{ y }} {% endfor %}
This can also be useful if you need to access the items in a hash-table.
For example, if your context contained a hash-table named data
, the following
would display the keys and values of the hash-table:
{% for (key . value) in data.items %} {{ key }}: {{ value }} {% endfor %}
If you need to loop a fixed number of times, you can use the following trick, where data.nb
resolves to an integer:
{% for _ in data.nb.make-list %} index: {{ forloop.counter }} {% endfor %}
The _
is not meaningful, it is only a placeholder for a value that we can’t reuse (it’s nil). See also the djula::iterable-list
generic method.
The for loop sets a number of variables available within the loop:
| Variable | Description |
|---|---|
forloop.counter | The current iteration of the loop (1-indexed) |
forloop.counter0 | The current iteration of the loop (0-indexed) |
forloop.revcounter | The number of iterations from the end of the loop (1-indexed) |
forloop.revcounter0 | The number of iterations from the end of the loop (0-indexed) |
forloop.first | True if this is the first time through the loop |
forloop.last | True if this is the last time through the loop |
forloop.parentloop | For nested loops, this is the loop surrounding the current one |
Next: Boolean operators, Previous: for, Up: List of tags [Contents][Index]
The {% if %}
tag evaluates a variable, and if that variable is “true” (i.e.
exists, is not empty, and is not a false boolean value) the contents of the
block are output:
{% if athlete-list %} Number of athletes: {{ athlete-list|length }} {% else %} No athletes. {% endif %}
In the above, if athlete-list
is not empty, the number of athletes will be
displayed by the {{ athlete-list|length }}
variable.
For multiple branches, elif
and else
can be used:
{% if kenny.sick %} Kenny is sick. {% elif kenny.dead %} You killed Kenny! You bastard!!! {% else %} Kenny looks okay --- so far {% endif %}
Next: ifchanged, Previous: if, Up: List of tags [Contents][Index]
if
tags may use and
, or
or not
to test a number of
variables or to negate a given variable:
{% if athlete-list and coach-list %} Both athletes and coaches are available. {% endif %} {% if not athlete-list %} There are no athletes. {% endif %} {% if athlete-list or coach-list %} There are some athletes or some coaches. {% endif %} {% if not athlete-list or coach-list %} There are no athletes or there are some coaches (OK, so writing English translations of boolean logic sounds stupid; it's not our fault). {% endif %} {% if athlete-list and not coach-list %} There are some athletes and absolutely no coaches. {% endif %}
Use of both and
and or
clauses within the same tag is allowed, with
and
having higher precedence than or
e.g.:
{% if athlete-list and coach-list or cheerleader-list %}
will be interpreted like:
(if (or (athlete-list and coach-list) cheerleader-list) ..)
Use of actual parentheses in the if
tag is invalid syntax. If you need
them to indicate precedence, you should use nested if
tags.
Next: ifequal, Previous: Boolean operators, Up: List of tags [Contents][Index]
Check if a value has changed from the last iteration of a loop.
The {% ifchanged %}
block tag is used within a loop.
If given one or more variables, check whether any variable has changed.
For example, the following shows the date every time it changes, while showing the hour if either the hour or the date has changed:
{% for date in days %} {% ifchanged date.date %} {{ date.date }} {% endifchanged %} {% ifchanged date.hour date.date %} {{ date.hour }} {% endifchanged %} {% endfor %}
The ifchanged
tag can also take an optional {% else %}
clause that
will be displayed if the value has not changed:
{% for match in matches %}
{{ match }}
 {% endfor %}
Next: ifnotequal, Previous: ifchanged, Up: List of tags [Contents][Index]
Output the contents of the block if the two arguments equal each other.
Example:
{% ifequal user.pk comment.user-id %} ... {% endifequal %}
As in the if
tag, an {% else %}
clause is optional.
The arguments can be hard-coded strings, so the following is valid:
{% ifequal user.username "adrian" %} ... {% endifequal %}
An alternative to the ifequal
tag is to use the if
tag and the
==
operator.
Next: include, Previous: ifequal, Up: List of tags [Contents][Index]
Just like ifequal
, except it tests that the two arguments are not
equal.
An alternative to the ifnotequal
tag is to use the if
and
the !=
operator.
Previous: ifnotequal, Up: List of tags [Contents][Index]
Loads a template and renders it with the current context. This is a way of “including” other templates within a template.
The template name can either be a variable or a hard-coded (quoted) string, in either single or double quotes.
This example includes the contents of the template "foo/bar.html"
:
{% include "foo/bar.html" %}
A set of parameters can also be added, which become available as context variables when the included template is rendered:
{% include "user.html" :user record.creator %} {% include "user.html" :user record.updater %}
Previous: List of tags, Up: Tags [Contents][Index]
TODO
Previous: List of tags, Up: Tags [Contents][Index]


make
things in my spare time. Here are a few of mypersonal projects
that I'vemade
, or am in the process ofmaking
.PocketPal is probably my favorite thing that I've made. It's a small command line app that I wrote to help me better manage my pocket account, and track what I read.
I actually made this site from scratch! Though I drew heavy stylistic inspiration from other sources (like substituteteacher.js and evan.land) and used velocity.js for animations, I made everything you see here.


---
layout: post
title: ToxoDB 43 Released
category: [ToxoDB]
---
We are pleased to announce the release of ToxoDB 43
Release 43 Webinar
Join us on May 15th at 10:00 am (EST) for our Release 43 Highlights webinar where we will discuss and
demonstrate new features and data available in release 43 of EuPathDB sites.
Register here
Tachyzoite and merozoite transcriptomes —
High-throughput RNA-Seq (SOLiD5) to compare the merozoite and tachyzoite transcriptomes from T. gondii CZ strain. Data are aligned to T. gondii ME49.
Hehl et al.


These classes provides a MFC wrapping for the Scintilla edit control (http://www.scintilla.org). This control provides an open source cross platform edit control. Some of the features it provides include syntax colouring, call tips, brace highlighting, Styles, margins and markers to name but a few. The provided wrapper classes make it easier to include the control in MFC projects on Windows.
| Features |
| Usage |
| Copyright |
| History |
| Planned Enhancements |
| Reference |
| Contacting the Author |
V1.0 (18 March 2004)
V1.01 (18 March 2004)
V1.02 (6 June 2004)
V1.03 (13 August 2004)
V1.04 (20 December 2004)
V1.05 (4 March 2005)
30 May 2005
V1.06 (10 July 2005)
V1.07 (3 January 2006)
V1.08 (6 January 2006)
V1.09 (8 January 2006)
V1.10 (16 January 2006)
V1.11 (2 February 2006)
V1.12 (14 March 2006)
V1.13 (22 May 2006)
V1.14 (5 June 2006)
V1.15 (6 June 2006)
V1.16 (29 June 2006)
27 July 2006
V1.17 (17 September 2006)
V1.18 (11 June 2007)
V1.19 (28 November 2007)
V1.20 (19 March 2008)
V1.21 (15 June 2008)
V1.22 (1 November 2008)
V1.23 (20 January 2009)
V1.24 (11 February 2009)
30 April 2009
V1.25 (3 October 2009)
Updated class to work with Scintilla v2.01. New messages wrapped include: SCI_SETWRAPINDENTMODE, SCI_GETWRAPINDENTMODE, SCI_INDICSETALPHA, SCI_INDICGETALPHA, SCI_SETEXTRAASCENT, SCI_GETEXTRAASCENT, SCI_SETEXTRADESCENT, SCI_GETEXTRADESCENT, SCI_MARKERSYMBOLDEFINED, SCI_MARGINSETTEXT, SCI_MARGINGETTEXT, SCI_MARGINSETSTYLE, SCI_MARGINGETSTYLE, SCI_MARGINSETSTYLES, SCI_MARGINGETSTYLES, SCI_MARGINTEXTCLEARALL, SCI_MARGINSETSTYLEOFFSET, SCI_MARGINGETSTYLEOFFSET, SCI_ANNOTATIONSETTEXT, SCI_ANNOTATIONGETTEXT, SCI_ANNOTATIONSETSTYLE, SCI_ANNOTATIONGETSTYLE, SCI_ANNOTATIONSETSTYLES, SCI_ANNOTATIONGETSTYLES, SCI_ANNOTATIONGETLINES, SCI_ANNOTATIONCLEARALL, SCI_ANNOTATIONSETVISIBLE, SCI_ANNOTATIONGETVISIBLE, SCI_ANNOTATIONSETSTYLEOFFSET, SCI_ANNOTATIONGETSTYLEOFFSET, SCI_ADDUNDOACTION, SCI_CHARPOSITIONFROMPOINT, SCI_CHARPOSITIONFROMPOINTCLOSE, SCI_SETMULTIPLESELECTION, SCI_GETMULTIPLESELECTION, SCI_SETADDITIONALSELECTIONTYPING, SCI_GETADDITIONALSELECTIONTYPING, SCI_SETADDITIONALCARETSBLINK, SCI_GETADDITIONALCARETSBLINK, SCI_GETSELECTIONS, SCI_CLEARSELECTIONS, SCI_SETSELECTION, SCI_ADDSELECTION, SCI_SETMAINSELECTION, SCI_GETMAINSELECTION, SCI_SETSELECTIONNCARET, SCI_GETSELECTIONNCARET, SCI_SETSELECTIONNANCHOR, SCI_GETSELECTIONNANCHOR, SCI_SETSELECTIONNCARETVIRTUALSPACE, SCI_GETSELECTIONNCARETVIRTUALSPACE, SCI_SETSELECTIONNANCHORVIRTUALSPACE, SCI_GETSELECTIONNANCHORVIRTUALSPACE, SCI_SETSELECTIONNSTART, SCI_GETSELECTIONNSTART, SCI_SETSELECTIONNEND, SCI_GETSELECTIONNEND, SCI_SETRECTANGULARSELECTIONCARET, SCI_GETRECTANGULARSELECTIONCARET, SCI_SETRECTANGULARSELECTIONANCHOR, SCI_GETRECTANGULARSELECTIONANCHOR, SCI_SETRECTANGULARSELECTIONCARETVIRTUALSPACE, SCI_GETRECTANGULARSELECTIONCARETVIRTUALSPACE, SCI_SETRECTANGULARSELECTIONANCHORVIRTUALSPACE, SCI_GETRECTANGULARSELECTIONANCHORVIRTUALSPACE, SCI_SETVIRTUALSPACEOPTIONS, SCI_GETVIRTUALSPACEOPTIONS, SCI_SETRECTANGULARSELECTIONMODIFIER, SCI_GETRECTANGULARSELECTIONMODIFIER, SCI_SETADDITIONALSELFORE, SCI_SETADDITIONALSELBACK, SCI_SETADDITIONALSELALPHA, SCI_GETADDITIONALSELALPHA, SCI_SETADDITIONALCARETFORE, SCI_GETADDITIONALCARETFORE, SCI_ROTATESELECTION & SCI_SWAPMAINANCHORCARET
V1.26 (22 November 2010)
V1.27 (1 April 2011)
PJ Naughter
Email<EMAIL_ADDRESS>Web: http://www.naughter.com
1 April 2011


| Actions | Name | Condition | Entities | Team | Responsible Team | Tags | Priority | Status |
|---|---|---|---|---|---|---|---|---|
| {{def.name || '(no name)'}} | {{def.condition}} | (no entity filter) | {{def.team}} | {{def.responsible_team}} | {{def.tags.toString()}} | |||
| No alerts are defined for this check definition. Data is only collected for entities covered by at least one alert. Please add a new alert definition to start collecting data. |


Toggle
Entity
File
Project
Table
Seed
Model
Controller
Form
File
Refresh
Load
New
Save
Table
Save
Save
Model
Save
Save
Form
Save
×


promtool
Tooling for the Prometheus monitoring system.
More information: home page
- Check if the config files are valid or not (if present report errors):
promtool check config config_file.yml
- Check if the rule files are valid or not (if present report errors):
promtool check rules rules_file.yml
- Pass Prometheus metrics over `stdin` to check them for consistency and correctness:
curl --silent http://example.com:9090/metrics/ | promtool check metrics
- Unit tests for rules config:
promtool test rules test_file.yml


The Best New Deals + Exclusive Offers from RetailMeNot!
Get Up to 60% Off Sale Items and Free Shipping on $75 at Vera Bradley!
More top offers include:
eBay: Up to 40% Off TVs & Accessories + Free Shipping
Disney Store: Up to 45% Off New Markdowns + Free Shipping on $75
Chico’s: $25 Off $50 or More
JC Penney: $25 Spring Shoe Event + Free Shipping on $75
& many more at www.retailmenot.com
Copyright 2013 WhaleShark Media. 301 Congress Avenue, Suite 700, Austin, Texas 78701
To opt-out please reply to this email with UNSUBSCRIBE in the subject line.


Nataly Dawn ( PomplamooseMusic ) — Je Me Suis Fait Tout Petit
by wednesday_thursday_fridayYouTube
Save this song on Spotify: https://spoti.fi/2r3Yqkh Become a patron of our music (to vote on the songs we cover and get merch and stuff like that): http://www.p…www.youtube.com


The world wide web has been rapidly expanding over the last decade, and today more than 40% of the world population is using it on a daily basis. Social media have played a very important part in this increase of the internet’s popularity, since for many people, social media is one of the few if not the only reason to go online. As a result of this explosion, large quantities of raw data have been produced, and its analysis is a huge challenge for the scientific community. In this context, sentiment analysis and natural language processing are in the center of the scientific status qwo, presenting great interest and vast new opportunities. Especially so in Greece, where these fields are still relatively evolving in a very slow pace.
For that reason, this thesis tries to develop a sentiment analysis system, by using natural language processing methods. The aim of this thesis, is to apply sentiment analysis in order to evaluate points of interest (or venues) in the city of Thessaloniki, by evaluating users’ comments. These comments are categorized as positive or negative by a classifier that was developed and trained using a relevant dataset. By using the classifier to evaluate each venue’s comments, we then decide if each venue offers a positive or negative experience to the visitor.
The results of this NLP system are presented in a web application named Venuetrack. Venuetrack is a smart and easy-to-use search engine for venues in the city of Thessaloniki, in which users can search for points of interest on the map of Thessaloniki, and check out their information as well as the classification of the NLP classifier created.


JSONLint Partners
Check out their products!About JSONModel?
JSONModel is a tool to translate json directly to Object-c model file or Java Bean file.
Common Errors
'STRING'
- You probably have an extra comma at the end of your collection. Something like { "a": "b", }
'STRING'
, 'NUMBER'
, 'NULL'
, 'TRUE'
, 'FALSE'
, '{'
, '['
- You probably have an extra comma at the end of your list. Something like: ["a", "b", ]
{ "key": "value" }
Credits
Maintained by CircleCell. Thanks to JSONLint of JSON and JS Lint, and Zach Carter, who built a pure JavaScript implementation.


The App that's better than Wikipedia!
Drink-a-pedia can help you manage your diet, stay healthier, and keep you safe on the road with our vigorous algorithm.
Find Out MoreYou can use this app to monitor your Blood Alcohol Concentration, and determine if you are fit to drive properly.
You can determine how much water you should drink daily and how close you are to that water goal.
You can use this app to monitor how long you can stay awake with the amount of caffeine you have consumed.
You can use this app to calculate if the amount of sugar you are consuming is healthy.


[gecode-users] Propagation condition and cloning
Vincent Barichard
Vincent.Barichard at univ-angers.fr
Mon Dec 14 00:33:05 CET 2009
Hi Everyone,
I would like to put another Propagation Condition in BoolVarImp. You gave me good advice on how to process. For a first step, I just wanted to make some test. So I first modified bool.vis and add this new Propagation Condition. Then I tried to make existing propagators subscribe to this new propagation condition (without scheduling propagators and sending the corresponding events). Unfortunately, I failed to achieved this first step. Indeed, some problems occur during cloning.
I first thought that It was a problem with the rewriting of propagator during cloning. Indeed, I didn't update all propagators, so it can't be possible to change a propagator by another one which doesn't subscribe to the same propagation conditions than the original one.
I disabled the rewrite of a propagator by another propagator from a different class during cloning. But I still have problems. I tried many things, without success and now I have no more ideas.
For now, I just want to understand why I can't make it work. For this purpose, I designed an example to make gecode crash. I used the "sat" example given with Gecode, and only deal with this example (no matter if the other examples don't work anymore).
My problem is reproducible by applying the patch attached in this mail to Gecode 3.2.2. Then, I configured and compiled Gecode with the following commands:
./configure --enable-debug --enable-audit
make
The test problem can be launched by copying the test2.cnf file (attached in the mail) in the gecode directory and executing the command:
./examples/sat test2.cnf
If I use a debugger I get:
Program received signal EXC_BAD_ACCESS, Could not access memory.
Reason: KERN_INVALID_ADDRESS at address: 0x000000020000001b
0x000000010146d908 in Gecode::ActorLink::prev (this=0x200000013) at core.hpp:2328
2328 return _prev;
(gdb) bt
#0 0x000000010146d908 in Gecode::ActorLink::prev (this=0x200000013) at core.hpp:2328
#1 0x000000010146e0be in Gecode::VarImp<Gecode::Int::BoolVarImpConf>::update (this=0x101896350, x=0x101877698, sub=@0x7fff5fbfece0) at core.hpp:3295
#2 0x000000010146e1d9 in Gecode::VarImp<Gecode::Int::BoolVarImpConf>::update (home=@0x101503f80, sub=@0x7fff5fbfece0) at core.hpp:3314
#3 0x000000010146e4b4 in Gecode::Space::update (this=0x101503f80, sub=0x101888798) at var-imp.hpp:343
#4 0x000000010146bae7 in Gecode::Space::_clone (this=0x101503e20, share=true) at gecode/kernel/core.cpp:481
#5 0x000000010011b58b in Gecode::Space::clone (this=0x101503e20, share=true) at core.hpp:2465
#6 0x000000010011c2c0 in Gecode::Search::Sequential::Path::recompute (this=0x101503798, d=@0x1015037b8, a_d=2, stat=@0x101503718) at path.hh:305
#7 0x000000010011c5be in Gecode::Search::Sequential::DFS::next (this=0x101503718) at dfs.hh:146
#8 0x000000010011c615 in Gecode::Search::WorkerToEngine<Gecode::Search::Sequential::DFS>::next (this=0x101503710) at support.hh:74
#9 0x0000000100007ed2 in Gecode::DFS<Sat>::next (this=0x7fff5fbff070) at dfs.hpp:53
#10 0x000000010000811b in Gecode::Driver::ScriptBase<Gecode::Space>::run<Sat, Gecode::DFS, SatOptions> (o=@0x7fff5fbff1a0) at script.hpp:198
#11 0x0000000100001a34 in main (argc=1, argv=0x7fff5fbff4f0) at examples/sat.cpp:256
I probably made an obvious mistake, but I can not see.
Thanks for your help,
Cheers,
Vincent
Vincent Barichard Université d'Angers (LERIA)
Tel: 02 41 73 52 06 Département Informatique
Fax: 02 41 73 50 73 H203
-------------- next part --------------
An embedded and charset-unspecified text was scrubbed...
Name: patch.txt
URL: <http://www.gecode.org/pipermail/users/attachments/20091214/0c0c5909/attachment.txt>
-------------- next part --------------
-------------- next part --------------
A non-text attachment was scrubbed...
Name: test2.cnf
Type: application/octet-stream
Size: 5842 bytes
Desc: not available
URL: <http://www.gecode.org/pipermail/users/attachments/20091214/0c0c5909/attachment.obj>
More information about the users
mailing list


Module: ActiveSupport::Dependencies
| Relationships & Source Files | |
| Namespace Children | |
|
Modules:
| |
|
Classes:
| |
| Defined in: | activesupport/lib/active_support/dependencies.rb, activesupport/lib/active_support/dependencies/interlock.rb |
Class Method Summary
-
.clear
Private method that reloads constants autoloaded by the main autoloader.
-
.eager_load?(path) ⇒ Boolean
Private method that helps configuring the autoloaders.
-
.load_interlock(&block)
Execute the supplied block while holding an exclusive lock, preventing any other thread from being inside a
#run_interlock
block at the same time. -
.run_interlock(&block)
Execute the supplied block without interference from any concurrent loads.
-
.search_for_file(relpath)
Private method used by require_dependency.
-
.unload_interlock(&block)
Execute the supplied block while holding an exclusive lock, preventing any other thread from being inside a
#run_interlock
block at the same time.
Instance Attribute Summary
-
#_autoloaded_tracked_classes
rw
If reloading is enabled, this private set holds autoloaded classes tracked by the descendants tracker.
-
#_eager_load_paths
rw
This is a private set that collects all eager load paths during bootstrap.
-
#autoload_once_paths
rw
The array of directories from which we autoload and never reload, even if reloading is enabled.
-
#autoload_paths
rw
The array of directories from which we autoload and reload, if reloading is enabled.
-
#autoloader
rw
If reloading is enabled, this private attribute stores the main autoloader of a
::Rails
application. - #interlock rw
Class Method Details
.clear
Private method that reloads constants autoloaded by the main autoloader.
Rails.application.reloader.reload! is the public interface for application reload. That involves more things, like deleting unloaded classes from the internal state of the descendants tracker, or reloading routes.
# File 'activesupport/lib/active_support/dependencies.rb', line 76
def self.clear unload_interlock do _autoloaded_tracked_classes.clear autoloader.reload end end
.eager_load?(path) ⇒ Boolean
Private method that helps configuring the autoloaders.
# File 'activesupport/lib/active_support/dependencies.rb', line 94
def self.eager_load?(path) _eager_load_paths.member?(path) end
.load_interlock(&block)
Execute the supplied block while holding an exclusive lock, preventing any other thread from being inside a #run_interlock
block at the same time.
# File 'activesupport/lib/active_support/dependencies.rb', line 24
def self.load_interlock(&block) interlock.loading(&block) end
.run_interlock(&block)
Execute the supplied block without interference from any concurrent loads.
# File 'activesupport/lib/active_support/dependencies.rb', line 17
def self.run_interlock(&block) interlock.running(&block) end
.search_for_file(relpath)
Private method used by require_dependency.
# File 'activesupport/lib/active_support/dependencies.rb', line 84
def self.search_for_file(relpath) relpath += ".rb" unless relpath.end_with?(".rb") autoload_paths.each do |autoload_path| abspath = File.join(autoload_path, relpath) return abspath if File.file?(abspath) end nil end
.unload_interlock(&block)
Execute the supplied block while holding an exclusive lock, preventing any other thread from being inside a #run_interlock
block at the same time.
# File 'activesupport/lib/active_support/dependencies.rb', line 31
def self.unload_interlock(&block) interlock.unloading(&block) end
Instance Attribute Details
#_autoloaded_tracked_classes (rw)
If reloading is enabled, this private set holds autoloaded classes tracked by the descendants tracker. It is populated by an on_load callback in the main autoloader. Used to clear state.
# File 'activesupport/lib/active_support/dependencies.rb', line 62
singleton_class.attr_accessor :_autoloaded_tracked_classes
#_eager_load_paths (rw)
This is a private set that collects all eager load paths during bootstrap. Useful for Zeitwerk integration. The public interface to push custom directories to this collection from applications or engines is config.eager_load_paths.
# File 'activesupport/lib/active_support/dependencies.rb', line 56
singleton_class.attr_accessor :_eager_load_paths
#autoload_once_paths (rw)
The array of directories from which we autoload and never reload, even if reloading is enabled. The public interface to push directories to this collection from applications or engines is config.autoload_once_paths.
# File 'activesupport/lib/active_support/dependencies.rb', line 49
singleton_class.attr_accessor :autoload_once_paths
#autoload_paths (rw)
The array of directories from which we autoload and reload, if reloading is enabled. The public interface to push directories to this collection from applications or engines is config.autoload_paths.
This collection is allowed to have intersection with autoload_once_paths. Common directories are not reloaded.
# File 'activesupport/lib/active_support/dependencies.rb', line 43
singleton_class.attr_accessor :autoload_paths
#autoloader (rw)
If reloading is enabled, this private attribute stores the main autoloader of a ::Rails
application. It is nil
otherwise.
The public interface for this autoloader is Rails.autoloaders.main
.
# File 'activesupport/lib/active_support/dependencies.rb', line 69
singleton_class.attr_accessor :autoloader
#interlock (rw)
[ GitHub ]# File 'activesupport/lib/active_support/dependencies.rb', line 10
singleton_class.attr_accessor :interlock


Check the console log
RedBackground stuff
Card title
Some quick example text to build on the card title and make up the bulk of the card's content.
Go somewhere


RT @newrelic: What do ponies have to do with #Rails version benchmarking? @1337807 tells us in a tour through our Ruby VM stats http://t.co…
4/25/2014, 3:44:24 PM
Favs: 0
Retweets: 0
link--- layout: tweet ---
RT @newrelic: What do ponies have to do with #Rails version benchmarking? @1337807 tells us in a tour through our Ruby VM stats http://t.co…
4/25/2014, 3:44:24 PM
Favs: 0
Retweets: 0
link


- getBuffer() - Method in class com.c77.androidstreamingclient.lib.video.BufferedSample
-
Retrieves the byte buffer.
- getIndex() - Method in class com.c77.androidstreamingclient.lib.video.BufferedSample
-
Retrieves the index corresponding to this one buffered sample
- getMediaFormat() - Method in interface com.c77.androidstreamingclient.lib.rtp.MediaExtractor
-
Returns Android MediaFormat used to properly configure Android API decoder.
- getMediaFormat() - Method in class com.c77.androidstreamingclient.lib.rtp.RtpMediaExtractor
-
Retrieves an Android MediaFormat for H.264, 640x480 video codec.
- getPresentationTimeUs() - Method in class com.c77.androidstreamingclient.lib.video.BufferedSample
-
Retrieves presentation timestamp in microseconds.
- getRtpTimestamp() - Method in class com.c77.androidstreamingclient.lib.video.BufferedSample
-
Retrieves RTP timestamp
- getSampleBuffer() - Method in class com.c77.androidstreamingclient.lib.rtp.RtpMediaDecoder
-
Retrieves a buffer from the decoder to be filled with data getting it from the Android
decoder input buffers
- getSampleBuffer() - Method in interface com.c77.androidstreamingclient.lib.video.Decoder
-
Retrieves a buffer from the decoder to be filled with data
- getSampleSize() - Method in class com.c77.androidstreamingclient.lib.video.BufferedSample
-
Retrieves the sample's size


When the report is using custom script to load data from your application, you will probably need to authenticate it's request. This can be easily achieved by forwarding authentication cookies. The rendering flow is than following.
Client side jsreport will automatically take cookies from the hosting application, packs them and sends with the rendering request. jsreport custom script on the server then can take the cookies from the rendering request and attach them to the request loading data from the hosting application. This means hosting application will be able to authenticate user from the provided cookie same as it would be send from the browser and provides authorized data.
You can see in the following example data are not correctly loaded into the report because user is not authenticated in the hosting application. When you click login, user will be authenticated with the cookie and report refreshed with correct values.


--- layout: base ---
You gotta spend money to steal money.
Learn More
A scrappy adventurer takes on a post-apocalyptic wasteland.


class: center, middle, inverse, title-slide #
R I: Basics
##
Data Wrangling
###
Michael Clark
###
m-clark.github.io
@statsdatasci
CSCAR, UM
###
2020-09-24
--- class: inverse background-image: url(https://github.com/m-clark/m-clark.github.io/raw/master/img/Rlogo.svg) --- class: inverse, middle, center ### *Data Structures* ### *Input/Output* ### *Indexing* ### *Tidyverse* --- class: inverse, center, middle # Data Structures   --- class: inverse, center # Data Structures
 *Vectors* *Matrices* *Lists* *Data Frames* --- class: inverse # Data Structures: Vectors - *Character strings * ```r string = c('a', 'b', 'b', 'q', 'q', 'r') ``` - *Factors* ```r factor(string) ``` ``` [1] a b b q q r Levels: a b q r ``` How are they different? --- class: inverse # Data Structures: Vectors - *Logicals* ```r my_logic = c(TRUE, FALSE, TRUE) as.logical(1:5 > 3) ``` ``` [1] FALSE FALSE FALSE TRUE TRUE ``` ```r as.numeric(my_logic) ``` ``` [1] 1 0 1 ``` - *Numeric* and *integers* ```r x = c(1, 2.5, 3) ``` --- class: inverse # Data Structures: Vectors Another common data structure: *dates*. ```r Sys.Date() ``` ``` [1] "2020-09-30" ``` ```r x = as.Date(c(Sys.Date(), '2020-09-01')) class(x) ``` ``` [1] "Date" ``` The lubridate package will a lot. --- class: inverse # Data Structures: Matrices - *Matrices*: like vectors, all *elements* must be the same type! ```r x = 1:4 y = 5:8 z = 9:12 cbind(x, y, z) # column bind ``` ``` x y z [1,] 1 5 9 [2,] 2 6 10 [3,] 3 7 11 [4,] 4 8 12 ``` --- class: inverse # Data Structures: Data Frames - *Data Frame*: Mix it up! ```r my_df = data.frame(x = 1:2, y = c('a', 'b')) my_df ``` ``` x y 1 1 a 2 2 b ``` *tibbles* - Special class of data frames - Part of the tidyverse we will look at later ```r as_tibble(mtcars) ``` --- class: inverse # Data Structures: Lists Data frames are flexible because they are *lists*. ```r list(1, '1', my_df) ``` ``` [[1]] [1] 1 [[2]] [1] "1" [[3]] x y 1 1 a 2 2 b ``` --- class: inverse # Data Structures: Lists Most R objects you deal with are lists! - Data frames, model objects, plots, etc. How do you get at its elements? --- class: inverse # Data Structure Exercises - Exercise 1 - Create an object that is a matrix and/or a data.frame, and inspect its class or structure (use the class or str functions on the object you just created). - Exercise 2 - Create a list of 3 elements, the first of which contains character strings, the second numbers, and the third, the data.frame or matrix you just created in Exercise 1. - Thinking Exercises - How is a factor different from a character vector? - How is a data.frame the same as and different from a matrix? - How is a data.frame the same as and different from a list? --- class: inverse, center, middle # Input/Output    --- class: inverse # Input/Output Primary packages: - readr - write_csv, read_csv - haven - other statistical packages (e.g. Stata) - base R - save, save.image, load - readRDS, saveRDS ```r my_data = readr::read_csv('some_file.csv') load('my_saved_R_objects.RData') ``` --- class: inverse # Input/Output Exercises Read this csv (or any in your project data folder): https://raw.githubusercontent.com/m-clark/data-processing-and-visualization/master/data/cars.csv Use load to load an .RData file from your data folder. --- class: inverse, center, middle # Indexing ![](img/original-dfs.svg) --- class: inverse # Indexing: Slicing How do I extract: - elements of a vector - columns/rows of a matrix - subsets of a data frame - ...? ```r letters[4:6] # lower case letters a-z myMatrix[1, 2:3] # matrix[rows, columns] mydf['row1', 'b'] # data frame by name mydf[mydf$a >= 2, ] # boolean ``` --- class: inverse # Indexing: List extraction *[* : grab a slice of elements/columns *[[* : grab specific elements/columns *$* : grab specific elements/columns *@*: extract slot for S4 objects ```r my_list_or_df[2:4] my_list_or_df[['name']] my_list_or_df$name ``` --- class: inverse # Indexing: Exercises .pull-left[ Here is a matrix, a data.frame and a list. ```r mymatrix = matrix( rnorm(100), nrows = 10, ncols = 10 ) mydf = mtcars mylist = list( mat = mymatrix, thisdf = mydf ) ``` ] .pull-right[ - Exercise 1 - For the matrix, in separate operations, take a slice of rows, a selection of columns, and a single element. - Exercise 2 - For the data.frame, grab a column in 3 different ways. - Exercise 3 - For the list, grab an element by number and by name. ] --- class: tidyverse background-image: url(img/tidyverse.png)   --- class: inverse # Tidyverse What is the *tidyverse*? ```r library(tidyverse) ``` ``` ⬢ __ _ __ . ⬡ ⬢ . / /_(_)__/ /_ ___ _____ _______ ___ / __/ / _ / // / |/ / -_) __(_-</ -_) \__/_/\_,_/\_, /|___/\__/_/ /___/\__/ ⬢ . /___/ ⬡ . ⬢ ``` ``` ── Attaching packages ────────────── tidyverse 1.3.0 ── ✓ ggplot2 3.3.2 ✓ purrr 0.3.4 ✓ tibble 3.0.3 ✓ dplyr 1.0.2 ✓ tidyr 1.1.2 ✓ stringr 1.4.0 ✓ readr 1.3.1 ✓ forcats 0.5.0 ``` --- class: inverse # Tidyverse: Packages - ggplot2: data visualization - tibble: a re-imagining of data frames - tidyr: data tidying - readr: data import - purrr: functional programming - dplyr: data manipulation - stringr: string processing - forcats: easier factors --- class: inverse # Tidyverse: Tidiness What is *tidy data*? - Arranged in a way that makes processing, analysis, and visualization simpler. In a tidy data set: - Each variable must have its own column. - Each observation must have its own row. - Each value must have its own cell. - In theory... --- class: inverse # Tidyverse: dplyr The workhorse package. It has three main goals: - Make the most important data manipulation tasks *easier*. - Do them *faster*. - Use the same interface to work with data frames, data tables or a database. --- class: inverse # Tidyverse: dplyr Some key operations include: - select: grab columns - select helpers: one\_of, starts\_with, num_range etc. - filter/slice: grab rows - group_by: grouped operations - mutate/transmute: create new variables - summarize: summarize/aggregate --- class: inverse # Tidyverse: Piping The pipe:

%>%
 What goes before is provided as the first argument to the subsequent function. ```r mydata %>% summary() ``` --- class: inverse # Tidyverse: Example ```r ## load('data/bball.RData') glimpse(bball[,1:5]) ``` ``` Rows: 734 Columns: 5 $ Rk <chr> "1", "2", "3", "4", "5", "6", "7", "8", "9", "10", "11", "12", "13", "14", "15", "16", "16", "16", "17", "18", "19", "20", "Rk", "21", "22", "23", "23", "23", "24", "25", "26", "27", "28", "28", "28", "… $ Player <chr> "Álex Abrines", "Quincy Acy", "Jaylen Adams", "Steven Adams", "Bam Adebayo", "Deng Adel", "DeVaughn Akoon-Purcell", "LaMarcus Aldridge", "Rawle Alkins", "Grayson Allen", "Jarrett Allen", "Kadeem Allen",… $ Pos <chr> "SG", "PF", "PG", "C", "C", "SF", "SG", "C", "SG", "SG", "C", "SG", "PF", "SF", "SF", "PF", "PF", "PF", "C", "PF", "PF", "PF", "Pos", "SF", "PG", "SF", "SF", "SF", "PG", "C", "SG", "PF", "SG", "SG", "SG… $ Age <chr> "25", "28", "22", "25", "21", "21", "25", "33", "21", "23", "20", "26", "28", "25", "25", "30", "30", "30", "20", "24", "21", "34", "Age", "21", "24", "33", "33", "33", "31", "20", "23", "19", "25", "25… $ Tm <chr> "OKC", "PHO", "ATL", "OKC", "MIA", "CLE", "DEN", "SAS", "CHI", "UTA", "BRK", "NYK", "POR", "ATL", "MEM", "TOT", "PHO", "MIA", "IND", "MIL", "DAL", "HOU", "Tm", "TOR", "CHI", "TOT", "PHO", "WAS", "ORL", … ``` --- class: inverse # Tidyverse: Selecting columns ```r bball %>% select(Player, Tm, Pos) %>% head() ``` ``` # A tibble: 6 x 3 Player Tm Pos <chr> <chr> <chr> 1 Álex Abrines OKC SG 2 Quincy Acy PHO PF 3 Jaylen Adams ATL PG 4 Steven Adams OKC C 5 Bam Adebayo MIA C 6 Deng Adel CLE SF ``` Use the *-* in front of the name to drop. --- class: inverse # Tidyverse: Selecting columns Select helpers: - starts_with: starts with a prefix - ends_with: ends with a suffix - contains: contains a literal string - matches: matches a regular expression - num_range: a numerical range like x01, x02, x03. - one_of: variables in character vector. - everything: all variables. ```r bball %>% select(starts_with('p'), contains('3')) ``` --- class: inverse # Tidyverse: Filtering rows Filtering requires input that can be converted to a logical vector. ```r bball = bball %>% filter(Rk != "Rk") ``` ```r bball %>% filter(Age > 35, Pos == "SF" | Pos == "PF") %>% distinct(Player, Pos, Age) ``` ``` # A tibble: 3 x 3 Player Pos Age <chr> <chr> <chr> 1 Vince Carter PF 42 2 Kyle Korver PF 37 3 Dirk Nowitzki PF 40 ``` --- class: inverse Everything's a character string! ```r glimpse(bball, width = 50) ``` ``` Rows: 708 Columns: 30 $ Rk <chr> "1", "2", "3", "4", "5", "6", "7… $ Player <chr> "Álex Abrines", "Quincy Acy", "J… $ Pos <chr> "SG", "PF", "PG", "C", "C", "SF"… $ Age <chr> "25", "28", "22", "25", "21", "2… $ Tm <chr> "OKC", "PHO", "ATL", "OKC", "MIA… $ G <chr> "31", "10", "34", "80", "82", "1… $ GS <chr> "2", "0", "1", "80", "28", "3", … $ MP <chr> "588", "123", "428", "2669", "19… $ FG <chr> "56", "4", "38", "481", "280", "… $ FGA <chr> "157", "18", "110", "809", "486"… $ FG. <chr> ".357", ".222", ".345", ".595", … $ X3P <chr> "41", "2", "25", "0", "3", "6", … $ X3PA <chr> "127", "15", "74", "2", "15", "2… $ X3P. <chr> ".323", ".133", ".338", ".000", … $ X2P <chr> "15", "2", "13", "481", "277", "… $ X2PA <chr> "30", "3", "36", "807", "471", "… $ X2P. <chr> ".500", ".667", ".361", ".596", … $ eFG. <chr> ".487", ".278", ".459", ".595", … $ FT <chr> "12", "7", "7", "146", "166", "4… $ FTA <chr> "13", "10", "9", "292", "226", "… $ FT. <chr> ".923", ".700", ".778", ".500", … $ ORB <chr> "5", "3", "11", "391", "165", "3… $ DRB <chr> "43", "22", "49", "369", "432", … $ TRB <chr> "48", "25", "60", "760", "597", … $ AST <chr> "20", "8", "65", "124", "184", "… $ STL <chr> "17", "1", "14", "117", "71", "1… $ BLK <chr> "6", "4", "5", "76", "65", "4", … $ TOV <chr> "14", "4", "28", "135", "121", "… $ PF <chr> "53", "24", "45", "204", "203", … $ PTS <chr> "165", "17", "108", "1108", "729… ``` --- class: inverse # Tidyverse: Generating New Data ```r bball = bball %>% mutate(across(c(-Player, -Pos, -Tm), as.numeric)) ``` ```r bball = bball %>% mutate( trueShooting = PTS / (2 * (FGA + (.44 * FTA))), effectiveFG = (FG + (.5 * X3P)) / FGA, shootingDif = trueShooting - FG. ) bball %>% select(Player, trueShooting:shootingDif) ``` ``` # A tibble: 708 x 4 Player trueShooting effectiveFG shootingDif <chr> <dbl> <dbl> <dbl> 1 Álex Abrines 0.507 0.487 0.150 2 Quincy Acy 0.379 0.278 0.157 3 Jaylen Adams 0.474 0.459 0.129 4 Steven Adams 0.591 0.595 -0.00405 5 Bam Adebayo 0.623 0.579 0.0466 6 Deng Adel 0.424 0.389 0.118 7 DeVaughn Akoon-Purcell 0.322 0.3 0.0217 8 LaMarcus Aldridge 0.576 0.522 0.0566 9 Rawle Alkins 0.418 0.372 0.0848 10 Grayson Allen 0.516 0.466 0.140 # … with 698 more rows ``` --- class: inverse # Tidyverse: Grouping & Summarizing Another very common task is to look at group-based statistics Primary functions: - group_by - summarize --- class: inverse # Tidyverse: Grouping & Summarizing ```r bball %>% * group_by(Pos) %>% summarize( `Mean FG%` = mean(FG., na.rm = TRUE), `Mean True Shooting` = mean(trueShooting, na.rm = TRUE) ) ``` ``` # A tibble: 11 x 3 Pos `Mean FG%` `Mean True Shooting` <chr> <dbl> <dbl> 1 C 0.522 0.572 2 C-PF 0.407 0.530 3 PF 0.442 0.536 4 PF-C 0.356 0.492 5 PF-SF 0.419 0.544 6 PG 0.409 0.512 7 SF 0.425 0.528 8 SF-SG 0.431 0.558 9 SG 0.407 0.517 10 SG-PF 0.416 0.582 11 SG-SF 0.38 0.466 ``` ```r bball %>% mutate( Pos = case_when( Pos == 'PG-SG' ~ 'PG', Pos == 'C-PF' ~ 'C', Pos == 'SF-SG' ~ 'SF', Pos == 'PF-C' | Pos == 'PF-SF' ~ 'PF', Pos == 'SG-PF' | Pos == 'SG-SF' ~ 'SG', TRUE ~ Pos )) %>% nest_by(Pos) %>% mutate(FgFt_Corr = list(cor(data$FG., data$FT., use = 'complete'))) %>% unnest(c(Pos, FgFt_Corr)) ``` --- class: inverse # Tidyverse: Renaming Columns Standard approach. ```r data %>% rename(new_name = old_name, new_name2 = old_name2) ``` More complex. ```r bball %>% rename_with( str_replace, # function contains('.'), # columns pattern = '\\.', # function arguments replacement = '%' ) %>% rename_with(str_remove, starts_with('X'), pattern = 'X') %>% colnames() ``` --- class: inverse # Tidyverse: Merging inner_join: return all rows from x where there are matching values in y, and all columns from x and y. left_join: return all rows from x, and all columns from x and y. right_join: return all rows from y, and all columns from x and y. --- class: inverse # Tidyverse: Merging semi_join: return all rows from x where there are matching values in y, keeping just columns from x. anti_join: return all rows from x where there are not matching values in y, keeping just columns from x. full_join: return all rows and all columns from both x and y. --- class: inverse # Tidyverse: Merging ```r band_members ``` ``` # A tibble: 2 x 2 Name Band <chr> <chr> 1 Seth Com Truise 2 Francis Pixies ``` ```r band_instruments ``` ``` # A tibble: 3 x 2 Name Instrument <chr> <chr> 1 Francis Guitar 2 Bubba Guitar 3 Seth Synthesizer ``` --- class: inverse # Tidyverse: Merging ```r left_join(band_members, band_instruments) ``` ``` # A tibble: 2 x 3 Name Band Instrument <chr> <chr> <chr> 1 Seth Com Truise Synthesizer 2 Francis Pixies Guitar ``` ```r full_join(band_members, band_instruments) ``` ``` # A tibble: 3 x 3 Name Band Instrument <chr> <chr> <chr> 1 Seth Com Truise Synthesizer 2 Francis Pixies Guitar 3 Bubba <NA> Guitar ``` --- class: inverse # Tidyverse: Pivoting Pivoting involves reshaping the data. pivot_longer: convert data from a wider format to longer one pivot_wider: convert data from a longer format to wider one   --- class: inverse # Tidyverse: Pivoting ```r library(tidyr) stocks <- data.frame( time = as.Date('2009-01-01') + 0:9, X = rnorm(10, 0, 1), Y = rnorm(10, 0, 2), Z = rnorm(10, 0, 4) ) head(stocks) ``` ``` time X Y Z 1 2009-01-01 2.2717401 0.8996038 4.0738061 2 2009-01-02 0.0708918 0.8776203 0.8981631 3 2009-01-03 -0.4524709 -3.9142764 -8.9257966 4 2009-01-04 -1.1678554 0.3156956 7.7532890 5 2009-01-05 0.2341694 4.2079608 -1.7337537 6 2009-01-06 -1.6258130 0.9685308 -1.3621592 ``` --- class: inverse # Tidyverse: Pivoting ```r stocks %>% pivot_longer( cols = -time, # works similar to using select() names_to = 'stock', # the name of the column that will have column names as labels values_to = 'price' # the name of the column for the values ) %>% head() ``` ``` # A tibble: 6 x 3 time stock price <date> <chr> <dbl> 1 2009-01-01 X 2.27 2 2009-01-01 Y 0.900 3 2009-01-01 Z 4.07 4 2009-01-02 X 0.0709 5 2009-01-02 Y 0.878 6 2009-01-02 Z 0.898 ``` --- class: inverse # Tidyverse: More Other packages are in the *Hadleyverse* or *RStudioverse* that stick to tidy principles. Beyond that, many modeling and visualization packages are now tidy aware. --- class: inverse # Tidyverse: Exercises ### Exercise 0 Install and load the dplyr ggplot2movies packages. Look at the help file for the `movies` data set, which contains data from IMDB. ```r install.packages('ggplot2movies') data('movies', package = 'ggplot2movies') ``` --- class: inverse # Tidyverse: Exercises ### Exercise 1a Use mutate to create a centered version of the rating variable. A centered variable is one whose mean has been subtracted from it. The process will take the following form: ```r data %>% mutate(new_var_name = '?') ``` --- class: inverse # Tidyverse: Exercises ### Exercise 1b Use filter to create a new data frame that has only movies from the years 2000 and beyond. Use the greater than or equal operator `>=`. ### Exercise 1c Use select to create a new data frame that only has the `title`, `year`, `budget`, `length`, `rating` and `votes` variables. There are at least 3 ways to do this. --- class: inverse # Tidyverse: Exercises ### Exercise 1d Rename the `length` column to `length_in_min` (i.e. length in minutes). --- class: inverse # Tidyverse: Exercises ### Exercise 2 Use group_by to group the data by year, and summarize to create a new variable that is the average budget. The summarize function works just like mutate in this case. Use the mean function to get the average, but you'll also need to use the argument `na.rm = TRUE` within it because the earliest years have no budget recorded. --- class: inverse # Tidyverse: Exercises ### Exercise 3 Use pivot_longer to create a 'tidy' data set from the following. ```r dat = tibble(id = 1:10, x = rnorm(10), y = rnorm(10)) ``` --- class: inverse # Tidyverse: Exercises ### Exercise 4 Now put several actions together in one set of piped operations. - Filter movies released *after* 1990 - select the same variables as before but also the `mpaa`, `Action`, and `Drama` variables - group by `mpaa` *and* (your choice) `Action` *or* `Drama` - get the average rating It should spit out something like the following: --- class: inverse, other-stuff # Other Stuff .pull-left[ *base R* - still okay! *data.table* - faster, specialized data frame syntax, good for larger data *tidyfast*: - use data.table in a dplyr way *disk.frame* - for processing data too large for memory ] .pull-right[
  ] --- class: last-slide, inverse, center, middle ![](https://github.com/m-clark/m-clark.github.io/raw/master/img/Rlogo.svg)


County Auditor List
Adair - Mandy Berg (R)
Contact
| Phone | Fax |
|---|---|
|<PHONE_NUMBER> |<PHONE_NUMBER> |
|<EMAIL_ADDRESS>| |
| Website | |
| www.adaircountyiowa.org/departments/auditor/ | |
| Hours | |
| 8:00 AM - 4:30 PM, Monday - Friday | |
| Mailing Address | |
|
400 Public Square Ste 5 Greenfield IA 50849 |
|
| Physical Address | Maps* |
|
400 Public Square Ste 5 Greenfield IA 50849 |
Google Maps Bing Maps |
*Secretary of State does not guarantee the accuracy of the locations as mapped by Google and Bing.


Episode 031
Some simple unit tests with xUnit
ASP.NET Core: From 0 to overkill
In the previous episodes
- We explored a bunch of more complex topics like
- IdentityServer
- Docker
- ProxyKit
- BenchmarkDotNet
In this episode
- Take a little break and get back to some fundamentals we've been ignoring until now, namely tests.
- Create a xUnit test project
- Create a really simple first test
- Test for an exception being thrown
- Executing the same test with varying data
The usual plugs...
- If these videos are being useful
- Like
- Share
- Leave feedback
- More stuff at:


Definition 4.5.5.
The Polsby-Popper score is a ratio that compares the area of a district to the area of a square with the same perimeter as the district. Thus we have
\begin{equation*}
PP =\displaystyle\frac{\text{Area of district}}{\text{Area of a square with the same perimeter as the district}} \text{.}
\end{equation*}


I met some really talented people last year and worked on this project with them. We saw that existing social tools fell short in the realm of actually organizing people to do things. Joynme is all about being active and meeting up with people outdoors in what us programmers refer to as "meatspace".


We're sorry but this application doesn't work properly without JavaScript enabled. Please enable it to continue.


Managment
Our software makes time and project management a breeze for employees, freeing up managers for more important tasks.
Our Software
User our intuitive software for detailed reports, summaries, statuses, and a wealth of other info key for organization.


Double-tap and hold until the JavaScript alert occurs. After closing the alert, tap again. Without touchcancel you will see a double tap instead of a tap.


Settings
Tree
Culture
???
System
Number of Generations:
Birth Rate
LOW
NORMAL
HIGH
Something else here
45645645645645
67876867867
Frame Rate:
Update


|
ESP32 HTTPS Server
|
Certificate and private key that can be passed to the HTTPSServer. More...
#include <SSLCert.hpp>
Public Member Functions | |
| SSLCert (unsigned char *certData=NULL, uint16_t certLength=0, unsigned char *pkData=NULL, uint16_t pkLength=0) | |
| Creates a new SSLCert. More... | |
| uint16_t | getCertLength () |
| Returns the length of the certificate in byte. | |
| uint16_t | getPKLength () |
| Returns the length of the private key in byte. | |
| unsigned char * | getCertData () |
| Returns the certificate data. | |
| unsigned char * | getPKData () |
| Returns the private key data. | |
| void | setPK (unsigned char *_pkData, uint16_t length) |
| Sets the private key in DER format. More... | |
| void | setCert (unsigned char *_certData, uint16_t length) |
| Sets the certificate data in DER format. More... | |
| void | clear () |
| Clears the key buffers and deletes them. | |
Certificate and private key that can be passed to the HTTPSServer.
Converting PEM to DER Files
Certificate:
Private Key:
Converting DER File to C Header
| httpsserver::SSLCert::SSLCert | ( | unsigned char * | certData = NULL , |
| uint16_t | certLength = 0 , |
||
| unsigned char * | pkData = NULL , |
||
| uint16_t | pkLength = 0 |
||
| ) |
Creates a new SSLCert.
The certificate and key data may be NULL (default values) if the certificate is meant to be passed to createSelfSignedCert().
Otherwise, the data must reside in a memory location that is not deleted until the server using the certificate is stopped.
| [in] | certData | The certificate data to use (DER format) |
| [in] | certLength | The length of the certificate data |
| [in] | pkData | The private key data to use (DER format) |
| [in] | pkLength | The length of the private key |
| void httpsserver::SSLCert::setCert | ( | unsigned char * | _certData, |
| uint16_t | length | ||
| ) |
Sets the certificate data in DER format.
The data has to reside in a place in memory that is not deleted as long as the server is running.
See SSLCert for some information on how to generate DER data.
| [in] | _certData | The data of the certificate |
| [in] | length | The length of the certificate |
| void httpsserver::SSLCert::setPK | ( | unsigned char * | _pkData, |
| uint16_t | length | ||
| ) |
Sets the private key in DER format.
The data has to reside in a place in memory that is not deleted as long as the server is running.
See SSLCert() for some information on how to generate DER data.
| [in] | _pkData | The data of the private key |
| [in] | length | The length of the private key |