Bayesian Logistic Regression Example¶
[1]:
import arviz as az
import bambi as bmb
import numpy as np
import pandas as pd
import matplotlib.pyplot as plt
[2]:
az.style.use('arviz-darkgrid')
Load and examine American National Election Studies (ANES) data¶
These data are from the 2016 pilot study. The full study consisted of 1200 people, but here we’ve selected the subset of 487 people who responded to a question about whether they would vote for Hillary Clinton or Donald Trump.
[3]:
data = pd.read_csv('data/ANES_2016_pilot.csv')
data.head()
[3]:
| vote | age | party_id | |
|---|---|---|---|
| 0 | clinton | 56 | democrat |
| 1 | trump | 65 | republican |
| 2 | clinton | 80 | democrat |
| 3 | trump | 38 | republican |
| 4 | trump | 60 | republican |
Our outcome variable is vote
, which gives peoples’ responses to the following question prompt:
“If the 2016 presidential election were between Hillary Clinton for the Democrats and Donald Trump for the Republicans, would you vote for Hillary Clinton, Donald Trump, someone else, or probably not vote?”
[4]:
data['vote'].value_counts()
[4]:
clinton 215
trump 158
someone_else 48
Name: vote, dtype: int64
The two predictors we’ll examine are a respondent’s age
and their political party affiliation, party_id
, which is their response to the following question prompt:
“Generally speaking, do you usually think of yourself as a Republican, a Democrat, an independent, or what?”
[5]:
data['party_id'].value_counts()
[5]:
democrat 186
independent 138
republican 97
Name: party_id, dtype: int64
These two predictors are somewhat correlated, but not all that much:
[6]:
fig, ax = plt.subplots(3, figsize=(10, 6), constrained_layout=True)
key = dict(zip(data['party_id'].unique(), range(3)))
for label, df in data.groupby('party_id'):
ax[key[label]].hist(df['age'])
ax[key[label]].set_xlim([18, 90])
ax[key[label]].set_xlabel('Age')
ax[key[label]].set_ylabel('Frequency')
ax[key[label]].set_title(label)
ax[key[label]].axvline(df['age'].mean(), color='C1')
We can get a pretty clear idea of how party identification is related to voting intentions by just looking at a contingency table for these two variables:
[7]:
pd.crosstab(data['vote'], data['party_id'])
[7]:
| party_id | democrat | independent | republican |
|---|---|---|---|
| vote | |||
| clinton | 159 | 51 | 5 |
| someone_else | 10 | 22 | 16 |
| trump | 17 | 65 | 76 |
But our main question here will be: How is respondent age related to voting intentions, and is this relationship different for different party affiliations? For this we will need logistic regression.
Build clinton_model
¶
To keep this simple, let’s look at only the data from people who indicated that they would vote for either Clinton or Trump, and we’ll model the probability of voting for Clinton.
[8]:
clinton_data = data.loc[data['vote'].isin(['clinton', 'trump']), :]
clinton_data.head()
[8]:
| vote | age | party_id | |
|---|---|---|---|
| 0 | clinton | 56 | democrat |
| 1 | trump | 65 | republican |
| 2 | clinton | 80 | democrat |
| 3 | trump | 38 | republican |
| 4 | trump | 60 | republican |
Specifying and fitting the model is simple. Notice the (optional) syntax that we use on the left-hand-side of the formula: We say vote[clinton]
to instruct bambi that we wish the model the probability that vote=='clinton'
, rather than the probability that vote=='trump'
. If we leave this unspecified, bambi will just pick one of the events to model, but will inform you which one it picked when you build the model (and again when you look at model summaries.)
When fitting models using the pymc3
backend, the default estimation strategy is to start with an identity mass matrix, but add uniform jitter in [-1, 1] and then adapt a diagonal based on the variance of the tuning samples. This generally works quite well, but occasionally it can fails. That’s what was happening for this particular data set and model, so below we disable the jitter+adapt_diag
initialization by changing from init='auto'
(the default) to init=adapt_diag
, which
tells the pymc3
backend to drop the jitter step.
[9]:
clinton_model = bmb.Model(clinton_data)
clinton_fitted = clinton_model.fit('vote[clinton] ~ party_id + party_id:age',
family='bernoulli', samples=1000, init='adapt_diag')
/home/osvaldo/anaconda3/lib/python3.7/site-packages/pandas/core/frame.py:2963: SettingWithCopyWarning:
A value is trying to be set on a copy of a slice from a DataFrame.
Try using .loc[row_indexer,col_indexer] = value instead
See the caveats in the documentation: https://pandas.pydata.org/pandas-docs/stable/user_guide/indexing.html#returning-a-view-versus-a-copy
self[k1] = value[k2]
INFO:numexpr.utils:NumExpr defaulting to 4 threads.
/home/osvaldo/proyectos/00_BM/Bambi/bambi/bambi/models.py:269: UserWarning: Modeling the probability that vote=='clinton'
self.y.name, str(self.clean_data[self.y.name].iloc[event])
Auto-assigning NUTS sampler...
INFO:pymc3:Auto-assigning NUTS sampler...
Initializing NUTS using adapt_diag...
INFO:pymc3:Initializing NUTS using adapt_diag...
Multiprocess sampling (2 chains in 2 jobs)
INFO:pymc3:Multiprocess sampling (2 chains in 2 jobs)
NUTS: [party_id:age, party_id, Intercept]
INFO:pymc3:NUTS: [party_id:age, party_id, Intercept]
Since we didn’t explicitly set any of the prior distributions, here’s a view of what the default priors look like for all parameters:
[10]:
clinton_model.plot();
[11]:
{x.name: x.prior.args for x in clinton_model.terms.values()}
[11]:
{'Intercept': {'mu': array([0.308043]), 'sd': array([8.39859892])},
'party_id': {'mu': array([0, 0]), 'sd': array([10.51415445, 18.72417819])},
'party_id:age': {'mu': array([0, 0, 0]),
'sd': array([0.16748696, 0.12909332, 0.40771782])}}
Some more info about these default priors can be found in this technical paper.
Now let’s check out the the results!
[12]:
az.plot_trace(clinton_fitted);
[13]:
az.summary(clinton_fitted)
[13]:
| mean | sd | hpd_3% | hpd_97% | mcse_mean | mcse_sd | ess_mean | ess_sd | ess_bulk | ess_tail | r_hat | |
|---|---|---|---|---|---|---|---|---|---|---|---|
| Intercept[0] | 1.638 | 0.702 | 0.373 | 3.031 | 0.025 | 0.017 | 807.0 | 807.0 | 808.0 | 933.0 | 1.0 |
| party_id[0] | -0.257 | 0.924 | -2.055 | 1.376 | 0.033 | 0.023 | 790.0 | 787.0 | 792.0 | 971.0 | 1.0 |
| party_id[1] | -0.790 | 1.774 | -4.172 | 2.668 | 0.062 | 0.044 | 816.0 | 816.0 | 824.0 | 908.0 | 1.0 |
| party_id:age[0] | 0.014 | 0.015 | -0.014 | 0.042 | 0.001 | 0.000 | 840.0 | 840.0 | 839.0 | 977.0 | 1.0 |
| party_id:age[1] | -0.033 | 0.012 | -0.056 | -0.012 | 0.000 | 0.000 | 1193.0 | 1190.0 | 1192.0 | 1115.0 | 1.0 |
| party_id:age[2] | -0.089 | 0.043 | -0.170 | -0.007 | 0.001 | 0.001 | 873.0 | 772.0 | 919.0 | 858.0 | 1.0 |
Run Inference¶
Grab the posteriors samples of the age
slopes for the three party_id
categories.
[14]:
#we need to automatically add labels to InferenceData object to recover this by_label selection
parties = ['democrat', 'independent', 'republican']
parti_idx = [0, 1, 2]
dem, ind, rep = [clinton_fitted.posterior['party_id:age'][:,:,x].values
for x in parti_idx]
[15]:
for idx, x in enumerate([dem, ind, rep]):
ax = az.plot_kde(x, label=f'{parties[idx]}', plot_kwargs={'color':f'C{idx}'})
ax.legend(loc='upper left');
What is the probability that the Democrat slope is greater than the Republican slope?
[16]:
(dem > rep).mean()
[16]:
0.994
Probability that the Democrat slope is greater than the Independent slope?
[17]:
(dem > ind).mean()
[17]:
0.994
Probability that the Independent slope is greater than the Republican slope?
[18]:
(ind > rep).mean()
[18]:
0.9055
Probability that the Democrat slope is greater than 0?
[19]:
(dem > 0).mean()
[19]:
0.8395
Probability that the Republican slope is less than 0?
[20]:
(rep < 0).mean()
[20]:
0.9895
Probability that the Independent slope is less than 0?
[21]:
(ind < 0).mean()
[21]:
0.9975
Spaghetti plot of model predictions¶
Separate results into two, one containing the intercept for each party_id
, the other containing the age
slopes for each party_id
.
[22]:
slopes = clinton_fitted.posterior['party_id:age'].values.reshape(2000, 3).T
[23]:
intercept_dem = clinton_fitted.posterior['Intercept'].squeeze().values.reshape(-1,)
intercept_ind = intercept_dem + clinton_fitted.posterior['party_id'][:,:,0].values.reshape(-1,)
intercept_rep = intercept_dem + clinton_fitted.posterior['party_id'][:,:,1].values.reshape(-1,)
intercepts = [intercept_dem, intercept_ind, intercept_rep]
Compute the predicted values for each posterior sample.
[24]:
def invlogit(x):
return 1/(1+np.exp(-x))
X = np.hstack([np.array([1]*len(np.arange(18, 91)))[:, None], np.arange(18, 91)[:, None]])
yhat = [invlogit(np.dot(X, np.vstack([intercepts[i], slopes[i]]))) for i in range(3)]
Make the plot!
[25]:
_, axes = plt.subplots(figsize=(7, 5))
for i in range(3):
for t in range(500):
axes.plot(X[:, 1], yhat[i][:, t], alpha=0.05, color=f'C{i}')
axes.set_ylabel('P(vote=\'clinton\' | age)')
axes.set_xlabel('Age', fontsize=15)
axes.set_xlim(18, 90);


NGONG ROAD, ADAMS ARCADE
17/05/2019
My absolute favorite carry out spot! Amazing food, extremely reasonable pricing for the large portions and have always had friendly service! Delivery is always hot and fresh when arriving and they are much quicker on delivery times than other places in my area.
16/05/2019
Ordered food from here by using GrubHubs. Estimate was 45mins. But the food was ready & delivered to our house within 25mins! Food is still hot & fresh! My oldest son and I were having a movie night....perfect late night snack! Thank you for good food!
16/05/2019
izzling Black Pepper Beef, Sweet and Sour Chicken, Crab Rangoon and Spring Rolls. Consistent great food at great prices. Wait time for delivery has been an average of 45 min- 1 hr and is reflected with their ETA, so just plan ahead.
15/05/2019
We ordered again tonight for like the 5th time and again it was AMAZING!!
14/05/2019
Great food! The basil chicken and the red curry chicken were exceptional. It wait staff were very attentive and service was speedy. The price was perfect for the portions received. I will be back very soon.


QRTailor's Optimized Dashboard for Businesses
Update the database based off of new inventory additions.
See which items are being scanned the most.
| # | Product | Colour | Size | Uses |
|---|---|---|---|---|
| 1 | Floral Crewneck | Blue | XS | 12 |
| 2 | Floral Crewneck | Red | XS | 8 |
| 3 | Jeans | Gray | XL | 7 |
| 4 | Collared Shirt | White | M | 7 |
| 5 | Hoodie | Orange | XL | 6 |
| 6 | Puffer Jacket | White | XS | 4 |
| 7 | Collared Shirt | Black | M | 4 |
Database Live
Accounts 16 Employees
Products 29 Unique Products
Your Plan has been paid for up to Janruary 31, 2020.


for(; exitCondition(); ) {
process();
}
This loop can be replaced with
while(exitCondition()) {
process();
}
A fix action is also available for other for
loops, so you can replace any for
loop with while
.
Use the checkbox below if you wish this inspection to ignore for loops with trivial or non-existent conditions.


Returns an Observable that mirrors the first source Observable to emit an item.
Useful for encapsulating and managing state. Applies an accumulator (or "reducer function") to each value from the source after an initial state is established -- either via a seed value (second argument), or from the first value from the source.
Groups pairs of consecutive emissions together and emits them as an array of two values.
Buffers the source Observable values until the size hits the maximum bufferSize given.
Buffers the source Observable values for a specific time period.
Emits the most recently emitted value from the source Observable within periodic time intervals.
Emits a value from the source Observable, then ignores subsequent source values for duration milliseconds, then repeats this process.
Ignores source values for duration milliseconds, then emits the most recent value from the source Observable, then repeats this process.
Emits a notification from the source Observable only after a particular time span has passed without another source emission.
Returns an Observable that emits all items emitted by the source Observable that are distinct by comparison from previous items.
Returns an Observable that emits all items emitted by the source Observable that are distinct by comparison from the previous item, using a property accessed by using the key provided to check if the two items are distinct.
Combines the source Observable with other Observables to create an Observable whose values are calculated from the latest values of each, only when the source emits.
Projects each source value to an Observable which is merged in the output Observable, in a serialized fashion waiting for each one to complete before merging the next.
Projects each source value to an Observable which is merged in the output Observable.
Projects each source value to an Observable which is merged in the output Observable, emitting values only from the most recently projected Observable.
Projects each source value to an Observable which is merged in the output Observable only if the previous projected Observable has completed.
Buffers the source Observable values until closingNotifier emits.
Emits the most recently emitted value from the source Observable whenever another Observable, the notifier, emits.
Emits a value from the source Observable, then ignores subsequent source values for a duration determined by another Observable, then repeats this process.
Ignores source values for a duration determined by another Observable, then emits the most recent value from the source Observable, then repeats this process.
Emits a notification from the source Observable only after a particular time span determined by another Observable has passed without another source emission.
Returns an Observable that skips items emitted by the source Observable until a second Observable emits an item.
Emits the values emitted by the source Observable until a notifier Observable emits a value.
Creates an output Observable which sequentially emits all values from the first given Observable and then moves on to the next.
Creates an output Observable which concurrently emits all values from every given input Observable.
Combines multiple Observables to create an Observable whose values are calculated from the values, in order, of each of its input Observables.
Combines multiple Observables to create an Observable whose values are calculated from the latest values of each of its input Observables.
No Description.


Populating multiple DropDownList controls with generic ListItem array
I’ve just had some fun spending the last half-an-hour trying to figure out why when I used the SelectedValue
property of a DropDownList
, it also set the value of another DropDownList
control.
Here’s some background to the problem. On my web-form, I have 2 fieldsets, one for a "Start Date", the other for an "End Date". For each fieldset there are 3 DropDownList
; Day, Month and Year.
Now rather than populating the values declaratively, using <asp:ListItem>
; since the year values will need to be incremented annually. I opted to do this programmatically in the code-behind.
Here was my code (for the Day DropDownList
):
List<ListItem> days = new List<ListItem>(32);
days.Add(new ListItem("Day", "-1"));
for (int i = 1; i <= 31; i++)
days.Add(new ListItem(i.ToString(), i.ToString()));
// start date
ddlStartDateDay.Items.Clear();
ddlStartDateDay.Items.AddRange(days.ToArray());
// end date
ddlEndDateDay.Items.Clear();
ddlEndDateDay.Items.AddRange(days.ToArray());
So, whenever I tried to set the value of ddlStartDateDay.SelectedValue
, the value of ddlEndDateDay
would also change. So frustrated!
What I soon realised that when I was adding new ListItem
objects to the List<ListItem>
, it was creating a unique (internal) ID
for each ListItem
. Therefore when I was selecting the value for one DropDownList
, it was selecting it across all DropDownList
controls that contained that ListItem
!
I’ve refactored my code to the following:
ddlStartDateDay.Items.Clear();
ddlStartDateDay.Items.Add(new ListItem("Day", "-1"));
ddlEndDateDay.Items.Clear();
ddlEndDateDay.Items.Add(new ListItem("Day", "-1"));
for (int i = 1; i <= 31; i++)
{
ddlStartDateDay.Items.Add(new ListItem(i.ToString(), i.ToString()));
ddlEndDateDay.Items.Add(new ListItem(i.ToString(), i.ToString()));
}
I'm not sure if there is any performance difference with this approach, I was just trying to use a single generic array (of ListItem
) to populate multiple DropDownList
controls. Obviously, this has it’s own drawbacks.


sbt's model is immutable
val scalaVersion: SettingKey[String]
val scalacOptions: TaskKey[Seq[String]]
val libraryDependencies: SettingKey[Seq[ModuleID]]
val compile: TaskKey[Analysis]
val test: TaskKey[Unit]
scalacOptions in ( Compile, doc ) := Seq.empty
publishArtifact in Test := false
scalacOptions
in compile and test
> inspect test:scalacOptions
[info] Task: scala.collection.Seq[java.lang.String]
[info] Description:
[info] Options for the Scala compiler.
...
[info] Delegates:
[info] my-project/test:scalacOptions
[info] my-project/runtime:scalacOptions
[info] my-project/compile:scalacOptions
[info] my-project/*:scalacOptions
[info] {.}/test:scalacOptions
...
Each setting or task can depend on another. For example:
libraryDependencies <+= // The '<' prefix denotes a dependency
scalaVersion( "org.scala-lang" % "scala-reflect" % _ % "provided" )
A dependency is implicitly created:
inspect libraryDependencies
[info] Setting: scala.collection.Seq[sbt.ModuleID] = List(org.scala-lang:scala-library:2.10.3, org.scala-lang:scala-reflect:2.10.3:provided, org.scalatest:scalatest:2.0:test)
[info] Description:
[info] Declares managed dependencies.
...
[info] Dependencies:
[info] my-project/*:scalaVersion
[info] Reverse dependencies:
[info] my-project/*:allDependencies
...
lazy val common = Project in file( "common" )
lazy val model = Project in file( "model" ) dependsOn( common )
lazy val webapp = Project in file( "webapp" ) dependsOn( common, model )
lazy val root = Project in file( "." ) aggregate( common, model, webapp )
project/<file>.scala
<file>.sbt
<project>/lib
libraryDependencies
%
%%
helper for Scala dependencies
libraryDependencies ++= Seq(
"org.springframework" % "spring-context" % "3.2.5.RELEASE" ,
"org.springframework" % "spring-test" % "3.2.5.RELEASE" % "test",
"org.scalatest" %% "scalatest" % "2.0" % "test"
)
<project>/<plugin>.sbt
project/Release.sbt:
addSbtPlugin( "com.earldouglas" % "xsbt-web-plugin" % "0.6.0" )
build.sbt:
import com.earldouglas.xsbtwebplugin.PluginKeys._
seq( webSettings:_* )
port in container.Configuration := 12345
Use the REPL to inspect your model:
inspect <key>
inspects the key metadatainspect tree <key>
inspects the dependency treeshow <key>
lists the valueThe REPL provides a specialized key syntax:
[project/][config:][task][::key]
> inspect tree compile // Simplified output
[info] my-project/compile:compile = Task[Analysis]
[info] +-my-project/compile:compile::compileInputs = Task[Compiler$Inputs]
[info] | +-*/*:maxErrors = 100
[info] | +-my-project/compile:dependencyClasspath = Task[Seq[File]]
[info] | +-my-project/compile:sources = Task[Seq[File]]
[info] | +-my-project/compile:scalacOptions = Task[Seq[String]]
[info] | +-my-project/compile:classDirectory = core/target/scala-2.10/classes
[info] | +-*/*:javacOptions = Task[Seq[String]]
[info] |
[info] +-my-project/compile:compile::streams = Task[...]
[info] +-*/*:streamsManager = Task[...]
...
> test
[info] ResultMatchersTest:
[info] RuleViolationMatcher
[info] - should correctly match a rule violation based on value
[info] - should fail to match a non-matching rule violation
[info] Run completed in 314 milliseconds.
[info] Total number of tests run: 2
[info] Suites: completed 1, aborted 0
[info] Tests: succeeded 2, failed 0, canceled 0, ignored 0, pending 0
[info] All tests passed.
[success] Total time: 1 s, completed Jan 20, 2014 3:52:58 PM
> ~test
[info] Compiling 11 Scala sources to /Users/tomer/dev/accord/core/target/scala-2.10/test-classes...
[error] /Users/tomer/dev/accord/core/src/test/scala/com/wix/accord/tests/dsl/OrderingOpsDslSpec.scala:52: not enough arguments for method between: (lowerBound: T, upperBound: T)(implicit evidence$1: Ordering[T])com.wix.accord.dsl.Between[T].
[error] one error found
[error] (accord-core/test:compile) Compilation failed
[error] Total time: 2 s, completed Jan 20, 2014 3:52:24 PM
1. Waiting for source changes... (press enter to interrupt)
arilou:dev tomer$ activator new
Enter an application name
> hello-scala
The new application will be created in /home/typesafe/Desktop/hello-scala
Enter a template name, or hit tab to see a list of possible templates
>
hello-akka hello-play hello-scala reactive-stocks
> hello-scala
OK, application "hello-scala" is being created using the
"hello-scala" template.
To run "hello-scala" from the command-line, run:
/home/typesafe/Desktop/hello-scala/activator run
... but is actually pretty well-documented
Dive into sources every now and then
... you'll learn a lot


Woman dies in crash, man airlifted to Derriford Hospital with life-threatening injuries
Police have released a statement
by Chris Matthews, Rom Preston-EllisAn elderly woman has died after a crash in Cornwall which has seen an elderly man airlifted to Derriford Hospital with serious injuries.
It was reported earlier that two elderly occupants were badly injured after the car crashed at the Heamoor Roundabout near Penzance and crashed into a post.
Devon and Cornwall Police has now confirmed that the elderly lady has died.
The man, who was airlifted to Derriford Hospital, continues to be treated for life-threatening injuries, reports Cornwall Live.
A Devon and Cornwall Police spokesman said earlier: “We were called to an RTC on the (Heamoor) Roundabout.
“It’s a serious crash involving two elderly occupants.
“A car has gone the wrong way around the roundabout and hit a post. There was only one car involved.”
An investigation into the circumstances surrounding the accident is underway and emergency services have remained at the scene throughout the afternoon.
Both the man and woman are believed to be local.
A Coastguard helicopter was seen landing at Derriford Hospital just before 2pm.
The incident took place near to the John Daniel Centre and there were around a dozen emergency service vehicles on the scene including police, fire and ambulance.
The Cornwall Air Ambulance and Coastguard helicopter landed nearby at Penwith College.
One witness described the crash as serious and said that the car ended up down an embankment.


?y
HERBARIO
DEL
INSTITUTO
MIGUEL
L1LLO
UNIVERSIDAD
NACIONAL
DE
TUCUMAN
No.
New
York
Botanical
Garden
Del:..........
Plan
(/'Cartera
et
Species
'Ptantarum
Argentinarum"
6
7
8
9
10
The
New
York
copyright
reserved
botanical
Garden
11.54*172
84350
1624972
Legend -
Level of confidence that token is an accurately-transcribed word
extremely low
very low
low
undetermined
medium
high
very high


The following topics are covered:
Area: Java Cryptography Extension
Synopsis: Public key certificates containing Elliptic Curve Cryptography (ECC) keys are parsed correctly by the SunPKCS11 JCE security provider on Solaris 11. See 7054637.
The Java SE 7 release adds the following features:
SSLSession
under construction, during the handshake.
For example, a trust manager might restrict the types of
certificates used based on the list of valid signature
algorithms.HttpsURLConnection
and HostnameVerifier
),
such verification can now be optionally performed at the TLS
level.In addition, the following enhancements are added:
Area: Security
Standard/Platform: Java SE 7
Synopsis: Security algorithm requirement have been defined
for Java SE 7 that provide a list of algorithms that all
implementations of Java SE 7 must support. The class summary of
applicable classes (ex: java.security.Signature) has been
updated to include the implementation requirements. Also, all of
the requirements are listed in the
Implementation Requirements section of the Standard Algorithms
document.
RFE: 5001004
Area: API: JSSE
Standard/Platform: Java SE 7
Synopsis: In previous releases, except for the default
algorithm, there was no standard algorithm name for
KeyManagerFactory. In the Java SE 7 release, "PKIX" is
exported as the standard algorithem name for
KeymanagerFactory. The "PKIX" KeyManagerFactory
algorithm is defined as:
A factory for X509ExtendedKeyManagers that manages X.509
certificate-based key pairs for the local side authentication
according to the rules defined by th eIETF PKIX working group in
RFC 3280 or its successor. The KeyManagerFactory must
support initialization using the class
javax.net.ssl.KeyStoreBuilderParameters.
RFE: 7022855
Area: API: JSSE
Standard/Platform: Java SE 7
Synopsis: Support for TLS 1.2 has been added to the SunJSSE
provider.
RFE: 6916074
Area: JSSE
Standard/Platform: JDK 7
Synopsis: The TLS renegotiation fix has been implemented.
Please see
TLS/SSLv3 Renegotiation Vulnerability Explained,
Understanding the TLS Renegotiation Attack and Authentication Gap in TLS
Renegotiation for more information.
Area: JSSE
Standard/Platform: JDK 7
Synopsis: Support for the Server Name Indication (SNI)
extension has been added to the JSSE client in the SunJSSE
provider.
RFE: 6985179
Area: SASL
Standard/Platform: JDK 7
Synopsis: NTLM is now supported as a SASL mechanism on both
the client and server side. Only the authentication layer is
implemented, and there is no privacy or integrations protection in
communication.
RFE: 6911951
Area: Security
Standard/Platform: JDK 7
Synopsis: The implementaton of PKIX has been enhanced to
include an option to reject certificates if the corresponding key
is not strong enough, for example MD2 hash functions or any RA key
with key size less than 1024.
RFE: 6792180
Area: API: JSSE
Standard/Platform: JDK 7
Synopsis: Support for TLS 1.1 has been added to the SunJSSE
provider, and the SSLv2Hello "pseudo protocol" is no longer active
by default in the SunJSSE provider.
RFE: 4873177
Area: JGSS
Standard/Platform: JDK 7
Synopsis: Java now reads a keytab file whenever that keytab
file changes. The file can be empty or nonexistent when the
application that uses the file is started.
Area: JGSS
Standard/Platform: JDK 7
Synopsis: A default configuration file is now provided for
JGSS with default krb5.conf settings for Windows and *nix
systems. This makes deploying a JGSS/krb5 program very easy,
especially for deploying Java applets.
RFE: 6483218,
6785456,
6552334
Area: JCE
Standard/Platform: JDK 7
Synopsis: SunPKCS11 provider now supports Raw RSA
encryption, for example,
Cipher.getInstance("RSA/ECB/NoPadding") calls, when the
underlying PKCS11 library supports CKM-RSA_X_509 mechanism. In
addition, SunPKCS11 provider recognizes "RSA" as an alias for the
"RSA/ECB/PKCS1Padding" transformation when requesting a
Cipher object.
RFE: 6994008
Area: JCE
Standard/Platform: JDK 7
Synopsis: The SunPKCS11 provider now supports ECB, CBC modes
with PKCS5Padding for certain block ciphers. To be more specific,
it supports the following transformations for
Cipher.getInstance(...) calls when the corresponding
PKCS11 mechanism is supported by the underlying PKCS11 library:
DES, DESede, AES, and Blowfish with CBC mode and PKCS5Padding DES, DESede, AES with ECB mode and PKCS5Padding DES, DESede, AES with ECB mode and NoPaddingRFE: 4898461
Area: JCE
Standard/Platform: JDK 7
Synopsis: The SunPKCS11 provider now supports AES encryption
with Counter mode (CTR), (for example,
Cipher.getInstance("AES/CTR/NoPadding") calls) when the
underyling PKCS11 library supports CKM_AES_CTR mechanism.
RFE: 6604496
Area: JCE
Standard/Platform: JDK 7
Synopsis: Given that the relevant Solaris bug (i.e. 6306708
"CKM_SSL3_KEY_AND_MAC_DERIVE returns incorrect cipher keys for
exportable ciphersuites") has been addressed in the Solaris 10
update 5 release, the SunPKCS11 provider no longer disables the
following two mechanisms by default:
CKM_SSL3_KEY_AND_MAC_DERIVE CKM_TLS_KEY_AND_MAC_DERIVERFE: 7036252


Try to do what is right
and to be humble.
If you do that, perhaps Yahweh will protect you
on the day when he punishes people.
4 When Yahweh punishes Philistia,
the cities of Gaza and Ashkelon will lose all their inhabitants.
Ashdod will be attacked and the people will be driven away at noon, when they are resting.

He will get rid of all of you; not one of you will survive!
6 The land of Philistia near the sea will become a pasture,
a place for shepherds and their sheep pens.
7 The people of Judah who survive will possess that land.
At night they will sleep in the deserted houses in Ashkelon.
Yahweh will take care of them;
he will enable them to prosper again.
8 Yahweh, Commander of the angel armies, the God of the Israelites, says this:
"I have heard the people of Moab and Ammon
insult my people and plan to conquer my people's country.
9 So now, as surely as I live, I will destroy Moab and Ammon
as I destroyed Sodom and Gomorrah.
Their land will be a place where there are nettles and salt pits;
it will be ruined forever, with none of their people living there!
My people who survive will take away all their valuable possessions
and also occupy their land."
10 The people of Moab and Ammon will get what they deserve for being proud,
because they made fun of the people who belong to Yahweh, Commander of the angel armies.
11 Yahweh will cause them to be terrified
when he destroys all the gods of their countries.
Then people from every nation will worship Yahweh,
each in his own country.
12 Yahweh says that he will also slaughter the people of Ethiopia.
13 Yahweh will punish and destroy Assyria,
that land northeast of us, and cause its capital Nineveh
to become ruined and deserted, and as dry as the desert.
14 Flocks of sheep and herds of cattle and many kinds of wild animals will lie down there.
Owls and crows will sit on the columns of the destroyed buildings,
and they will hoot through the windows.
There will be rubble in the doorways,
and the valuable cedar beams in the roofs of the buildings will become visible.
15 The people of Nineveh used to be happy and proud,
thinking that they were very safe.
They were always saying,
"Our city is the greatest city;
there is no city as great as ours!"
But now it will become a horrible place to see,
a place where wild animals make their dens.
And everyone who passes by there will hiss and scorn that city,
and shake their fists to show that they detest that city very much.


--- redirect_from: /ru/LaunchNewTab.html title: "ConEmu | Launch New Tab" breadcrumbs: - url: TableOfContents.html#launch-apps title: Launch Apps ---
When you run something from Win+R
or shortcut from your Desktop, you may use -cmd
or -cmdlist
to run your application. Remember, -cmd
or -cmdlist
will be the last ConEmu's GUI interpreted switch. The rest of command line will be used to start your application. Read more in the wiki. Example:
ConEmu -reuse -dir "c:\projects" -cmd "set PATH=C:\MinGW\bin;%PATH%" & chcp 65001 & sh -l -i
How to start application (tcc, powershell, far, putty) in ConEmu tab?
This dialog may be opened from:
Well, what you can do with this dialog?
ConEmu.exe
process will be started). Similar dialog may be opened when you ‘Restart current console’.
You may switch off create new console confirmation, just disable ‘Create confirmation’ checkbox on Appearance settings page.
Note. You may pop up confirmation dialog even if ‘Create confirmation’ unchecked. Just hold Shift while creating console from toolbar, System menu, or Keyboard (Win+Shift+W by default).
You may define your own tasks or just use predefined one. Choose the task from drop down menu or run task by hotkey. You may choose task in the ‘Create new console’ dialog too.
Use -new_console switch while executing command. For example, if you want to start PuTTY in new ConEmu tab, type in command prompt (cmd.exe started in ConEmu tab)
putty -new_console
and it will be launched in the new tab of ConEmu.
-new_console works even in batch files.
Note. Option ‘Inject ConEmuHk’ must be turned on (Settings -> Features).
Well, this interesting feature offers a way to duplicate shell (root process of current tab) state to the new ConEmu tab. For example, you have started cmd.exe
, set up environment variables, cd somewhere, run any program (vim for example) and call ‘Duplicate root’ from tab popup menu. This will create ‘copy’ of cmd.exe
at most recent state (when possible).
This allows to seize creation of console processes from many (selected by user) applications. For example, when you run ‘Command prompt’ shortcut from ‘Start menu’ cmd.exe may start in the new ConEmu tab. Read more about Default terminal feature.
Choose ‘Attach...’ from system menu.
Batch file ‘Attach.cmd’ ships with ConEmu package. Run this file from any cmd.exe to attach this console into the new ConEmu tab. This batch just run following command
ConEmuC.exe /ATTACH /NOCMD
which you may run from any other console shell or even from your own console application.
Mostly like as ‘Attach from command prompt’ but you may set up automatic execution of ‘Attach’ on cmd.exe startup. This also works with TCC/LE. Set up feature on ‘ComSpec’ page of ‘Settings’ dialog.
You may set up several most used shells or build environments via GuiMacro. Example: open ‘Keys & Macro’ settings page, click ‘Macros’ radio (it filters long key list) and in the free ‘Macro XX’ slot type
shell("","C:\Windows\System32\cmd.exe /E:ON /V:ON /T:0E /K ""C:\\Program Files\\Microsoft SDKs\\Windows\\v7.1\\Bin\\SetEnv.cmd"" /Release /x86")
choose any wanted hotkey (Ctrl+Shift+1 for example) and Save settings.


Deploy a "Hello JSON" node.js application to Heroku from Github via Cloud9.
You should already have one!
Github to C9 to Heroku
Github push to Heroku remote
Return the json object via node.js hosted on Heroku.com. Submit your github repository url and your hosted heroku url via Canvas.
{
"name" : "Al Ramirez",
"vacation" : {
"places": ["45.64, -73.63","40.760, -73.973","32.750, -117.07"]
}
}


In order examples to work we suppose that the northwind database (which is bound in the jqSuite package) is installed on your machine.
All exmplaes are included into the packege in examples/autocomplete directory
Let suppose that we have a form element which contain a company field wich should be filled with the autocomplete.
Lets create our index page which contain the form.
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"> <html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en"> <head> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <title>My First PHP jqAutocomplete </title> <link rel="stylesheet" type="text/css" media="screen" href="themes/redmond/jquery-ui.custom.css" /> <script src="js/jquery.js" type="text/javascript"></script> <script src="js/jquery-ui-1.8.1.custom.min.js" type="text/javascript"></script> </head> <body> <form action="#"> <label for="company">Company: </label> <input id="company" /> <input type="submit" name="submit" value="Submit" /> </form> <?php include "autocomplete.php";?> </body> </html>
Omitting the meta and title tag in the HTML document we contiue with these lines of code
<link rel="stylesheet" type="text/css" media="screen" href="themes/redmond/jquery-ui.custom.css" /> <script src="js/jquery.js" type="text/javascript"></script> <script src="js/jquery-ui.custom.min.js" type="text/javascript"></script>
Generally, you'll need to include these 3 files on any page to use jQuery UI widgets and interactions:
jquery-ui.custom.css refer to jQuery UI Cascading Style Sheet File
jquery.js refers to jQuery library
jquery-ui.custom.min.js refer to jQuery UI
The autocomplete.php file has the following code:
<?php // include the Database driver class (we will use PDO). require_once 'jq-config.php'; require_once "php/jqGridPdo.php"; // include the jqUtils Class. The class is needed in all jqSuite components. require_once "php/jqUtils.php"; // include the jqAutocomplete Class require_once "php/jqAutocomplete.php"; // Connection to the server $conn = new PDO(DB_DSN,DB_USER,DB_PASSWORD); // Tell the db that we use utf-8 $conn->query("SET NAMES utf8"); // create autocomplete instance $ac = new jqAutocomplete($conn); //write the select command $ac->SelectCommand = "SELECT CompanyName FROM customers WHERE CompanyName LIKE ? ORDER BY CompanyName"; // set the source from where to get data. In this case it is the same file. $ac->setSource("autocomplete.php"); // Enjoy $ac->renderAutocomplete("#company"); ?>
As canb be seen the autocomplete can be set only 4 lines of code.


To get the best experience, consider installing this app to your home screen.
You'll get an easy-to-find launcher icon and a dedicated fullscreen version of the app.
Web Browser
Installed
You can install the app to your home screen later by going to


This web page demonstrates an Arabic Romanization system made by me, Elsanussi Mneina. This romanization system was designed by starting from the Latin orthography used for writing Maltese, and making various adjustments to allow it to represent Arabic more faithfully. These adjustments are necessary because Standard Arabic has more consonant phonemes than Maltese.
For more information about this transliteration system, you may want to watch a short demo at https://youtu.be/6Bh2DuZoQ0Y?t=563 where I briefly demonstrate an older version of this application.
Note that the H-slash Romanization system system for Arabic is not standardized, nor does it have any official status. However, I have tried to make it more suitable than the usual adhoc systems that are found in the wild. For this reason, it may not be suitable for all purposes. Therefore this is best considered a hobby, or experimental at this stage (both the software web application and the transliteration system). End of message.
Message written by Elsanussi Mneina on September 14, 2021.


EDUCATION
Home
(current)
Services
Notes
Payment
Find Schools
Estimate Salary
Contact Us
{% if user.is_authenticated %}
Profile
Logout
{% else %}
Login
Sign Up
{% endif %}
{% csrf_token %}
First name
Last name
Subject name
School Name
Date of Submission
Remarks about the notes
I Agree to terms and conditions
Submit form
Get All Notes
Search Notes


I stumbled upon this comment on HN today:
I was visiting China recently (my first time there). I thought bypassing The Great Firewall was going to be as simple as an “ssh -D” SOCKS setup, or a “ssh -w” tunnel. Oh boy, I was wrong. If you try this, or even a basic OpenVPN setup, you will quickly find out your VPN works fine for about 5 minutes, but then latency increases to 5sec, 10sec, 30sec(!), and then everything times out. After some research I read online the government does deep packet analysis and uses machine learning to find heuristics to guess which TCP connection or UDP stream is likely being used as a VPN. When they think there is a high probability a VPN is detected, they simply start dropping all the packets. Encryption is not enough.  For example in a traditional HTTPS session, if the client browser downloads, say, a 500kB image over HTTPS, it will send periodical empty TCP ACK packets as it receives the data. But when using a VPN that encrypts data at the IP layer, these empty ACK packets will be encrypted, so The Great Firewall will see the client sending small ~80-120 bytes encrypted packets, and will count this as one more sign that this might be a VPN. That’s why people in China have to use VPN tools that most westerners have never heard of: obfsproxy, ShadowVPN, SoftEther, gohop, etc. All these tools try to obfuscate and hide VPNs. I have a lot of respect for all these Chinese hackers like clowwindy who try to escape censorship, as it takes more technical prowess than you think to design a VPN that works in China.
Everything makes sense now. No wonder I kept getting into some strange time-out with VPN services like VyprVPN, strongVPN, etc, when I was in China one and a half year ago. At first I thought it was because the ISP randomly blocked packages going to overseas servers but apparently it was a lot more sophisticated than that. The Chinese Government is paying vigilant attention to Internet censorship. (Perhaps one reason being that tension is building up in Hong Kong?) Initially I got the impression that it is all just a form of protectionism (you know, that “micro-blog” thingy would not have won against the made-in-harvard-I-am-the-CEO-bitch thingy had it not been the Big Brother’s help). But the pigs are indeed serious about social control as well.
And yup, recently the Chinese polices just contacted the author of a popular open-source tool to circumvent the Great Fire Wall of China and politely requested her or him to stop working on the project and delete the source code on Github. So the author cleaned up the repo /shadowsocks/shadowsocks, although for the repos /shadowsocks/shadowsocks-windows and /shadowsocks/shadowsocks-iOS she or he simply created a new branch rm
and switched to it, so you can still grab the source of latest versions in the master
branch.


Tulsi Gabbard’s fiery exchanges stand out in ‘good-natured’ debate | Honolulu Star-Advertiser
Tulsi Gabbard sparred with Kamala Harris and Pete Buttigieg during Wednesday evening’s presidential debate, adding tension to what was a generally collegial event among the top 10 Democratic presidential candidates and highlighting a growing unease among the party with her candidacy. Read more
Mahalo for reading the Honolulu Star-Advertiser!
You're reading a premium story. Read the full story with our Print & Digital Subscription.
Already a subscriber? Log in now to continue reading this story.
Print subscriber but without online access? Activate your Digital Account now.


@(params: Map[String, Any])@uk.gov.hmrc.hmrcemailrenderer.templates.helpers.html.template_main(params, "Your Annual Tax Summary is ready", footerMessage = Some(footer)) { @uk.gov.hmrc.hmrcemailrenderer.templates.helpers.html.salutation(params)
Thank you for completing your Self Assessment tax return.
Your annual tax summary is now online. It shows how much tax and National Insurance you have paid and how Government spends it.
You can find the summary by signing into your tax account, selecting Self Assessment and then ‘more self assessment details’ and then selecting ‘find out how your tax is spent’.
Tax summaries are for information only so there’s no need to take any further action.
Angela MacDonald
Director General, HMRC Customer Services
} @footer = { To manage your paperless notifications - sign in to your HMRC online account. }


Rooms numbers and occupancy levels are shown under Manage Rooms. Remove rooms by clicking the "x" next to the room number. Add rooms (or replace the whole list) by clicking "Manage Rooms" and then selecting the appropriate button. If there is a room with the wrong occupancy, contact Tech Committee
Manage Students
The student list shows the email addresses that are allowed to register for rooms. Manage them the same way you would manage rooms.
Manage Admins
Administrators have full access to the housing website including changing lists and downloading the list of reservations.
Manage Editors
Editors are students in Tech Committee who have limited access the the housing website, for correcting changes. Unless you are in tech committee, you probably don't need to worry about this box.


Description
SwiftChaChaPoly is a Swift implementation of Authenticated Encryption with Associated Data. It is based on ChaCha20 encryption and Poly1305 authentication as defined in [RFC-7539].
Usage
In your project Package.swift file add a dependency like
dependencies: [
.package(url: "https://github.com/leif-ibsen/SwiftChaChaPoly", from: "1.0.1"),
]
Example
// This example is from section 2.8.2 in [RFC-7539].
import SwiftChaChaPoly
let key: Bytes = [
0x80, 0x81, 0x82, 0x83, 0x84, 0x85, 0x86, 0x87, 0x88, 0x89, 0x8a, 0x8b, 0x8c, 0x8d, 0x8e, 0x8f,
0x90, 0x91, 0x92, 0x93, 0x94, 0x95, 0x96, 0x97, 0x98, 0x99, 0x9a, 0x9b, 0x9c, 0x9d, 0x9e, 0x9f]
let nonce: Bytes = [
0x07, 0x00, 0x00, 0x00, 0x40, 0x41, 0x42, 0x43, 0x44, 0x45, 0x46, 0x47]
let aad: Bytes = [
0x50, 0x51, 0x52, 0x53, 0xc0, 0xc1, 0xc2, 0xc3, 0xc4, 0xc5, 0xc6, 0xc7]
let text = "Ladies and Gentlemen of the class of '99: If I could offer you only one tip for the future, sunscreen would be it."
var bytes = Bytes(text.utf8)
let chacha = ChaChaPoly(key, nonce)
let tag = chacha.encrypt(&bytes, aad)
print(tag)
let ok = chacha.decrypt(&bytes, tag, aad)
print(ok && bytes == Bytes(text.utf8) ? "Ok" : "Fail")
Giving
[26, 225, 11, 89, 79, 9, 226, 106, 126, 144, 46, 203, 208, 96, 6, 145]
Ok
Performance
The encryption and decryption speed was measured on a MacBook Pro 2018, 2,2 GHz 6-Core Intel Core i7. The results are:
- Encryption: 192 MBytes / sec (11 cycles / byte)
- Decryption: 213 MBytes / sec (10 cycles / byte)
Dependencies
SwiftChaChaPoly requires Swift 5.0. It does not depend on other packages.
References
Algorithms from the following papers have been used in the implementation. There are references in the source code where appropriate.
- [FILIPPO] - Filippo Valsorda: A GO IMPLEMENTATION OF POLY1305 THAT MAKES SENSE, April 2019
- [RFC-7539] - ChaCha20 and Poly1305 for IETF Protocols, May 2015


Zimniiy Pamyati B A Dutova Marathon
Yekaterinaburg RUS
Website: abr.ur.ru/st/esm.html
Race Winners
(19 runnings)
16 Feb
2008
17 Feb
2007
18 Feb
2006
19 Feb
2005
14 Feb
2004
Feb
2003
16 Feb
2002
Feb
2001
19 Feb
2000
1999
1998
Notes: 1998 was the inaugural year. Zimniiy Pamyati B A Dutova is
translated as Winter Marathon in Memory of Viktor Dutov,
the first
president of CLB
"Ural-100".
18
Feb
2017
---
to be held
---
to be held
21
Feb
2016
2:38:18
Anton Golovin-2
2:50:47
Antonina Ogorodinkova (RUS)
14 Feb
2015
2:48:55
Anton Golovin (RUS)
3:21:17
Yekaterina Andreytsyeva (RUS)
15
Feb
2014
2:49:00
Aleksandr Krasnovperov-3
3:43:15
Nadezhda Gorbunova-7
16
Feb
2013
2:44:42
Yuriy Vyatkin-2
3:29:29
Elena Skoblina (RUS)
18
Feb
2012
2:48:49
Yuriy Vyatkin (RUS)
3:26:41
Nadezhda Gorbunova-6
19
Feb
2011
2:58:17
Aleksandr Krasnovperov-2
3:30:46
Nadezhda Gorbunova-5
20 Feb
2010
2:48:08
Aleksandr Krasnovperov (RUS)
3:22:05
Nadezhda Gorbunova-4
21 Feb
2009
2:46:56.7
Maksim Nikolinkov (RUS)
3:15:22.7
Marina Myschlyanova-3
3:00:33.5
Denis Lekomtsev-2
3:41:54.9
Elena Yegorova (RUS)
2:37:46
Denis Lekomtsev (RUS)
3:15:47
Nadezhda Gorbunova-3
2:35:11
Aleksey Vasilyev-2
3:17:19
Marina Myschlyanova-2
2:35:05
Aleksey Voronchikhin (RUS) +
Aleksey Vasilyev (RUS)
3:13:13
Marina Myschlyanova (RUS)
2:37:44
Aleksandr Vishnyagov-2
3:20:07
Nadezhda Gorbunova-2
2:40:20
Aleksandr Vishnyagov (RUS)
3:39:02
Nadezhda Gorbunova (RUS)
2:31:58
Oleg Kharitonov (RUS)
3:28:49
Irina Karelina (RUS)
2:36:19
Farid Ganiyev -2
3:39:14
Nina Buchelnikova (RUS)
2:29:12
Farid Ganiyev (RUS)
---
n/a
2:27:28
Aleksey
Belosludtsev (RUS)
---
n/a
2:17:00
Igor Tyupin (RUS)
---
n/a
Most Wins
(1998/date)
Men
3
Aleksandr Krasnovperov (RUS)
2010-11,2014
Women
7
Nadezhda Gorbunova (RUS)
2003-04,2007,2010-12,2014
Prize Money (ADR qualified runners)
No information on prize money has been received for this race.
Race Time Bias (sec/km)
Insufficient data to calculate the race time bias.
Competitive Level
(1990-date)
Insufficient data to calculate the competitive level.
Quality Performances
Men no men under 2:20 Women no women under 2:50
Finishers Year Men Women M+F 2016 117 14 131 2015 118 19 137 2014 81 10 91 2013 63 7 70 2012 57 8 65 2011 50 9 59 2010 54 10 64 2009 57 10 67 2008 63 11 74 2007 55 11 66 2006 38 8 46 2005 49 10 59 2004 48 7 55 2003 42 3 45 2002 62 6 68 2001 47 3 50 2000 1999 1998 Sums 1001 146 1147 M/F 6.86
Last Updated on
10 Mar 2016
Contributor: Klaas Loonstra (49)


APT PUPIL *** (out of four) -a review by Bill Chambers<EMAIL_ADDRESS>(Visit my review archive, play some movie trivia, and more! FILM FREAK CENTRAL http://www.geocities.com/~billchambers/ )
starring Brad Renfro, Ian McKellan, Elias Koteas, David Schwimmer screenplay by Brandon Boyce, based on the novella by Stephen King directed by Bryan Singer
"No man is an island," one character quotes John Donne in APT PUPIL, effectively summarizing the movie's themes. While hardly a great film, Singer's ambitious adaptation of King's short story* is challenging nonetheless; perhaps the most shocking aspect of this inclement psychological thriller is that a major studio got behind it. APT PUPIL is a bleak picture destined to be misunderstood by the masses.
1984. Wonder-bred high school honours student Todd Bowden (Renfro) conducts his own extracurricular investigation of Kurt Dussander, a Nazi war criminal who fearfully fled Berlin in the 1960s and was never heard from again. Bowden suspects Arthur Denker (McKellan), the lonely German senior citizen who lives nearby, is actually a pseudonymous Dussander-much research and dusting for fingerprints proves young Todd's theory. Bowden strikes a deal with Dussander: in exchange for not revealing his identity, Dussander must satisfy Bowden's intense curiosity by recounting the atrocities of the holocaust from the Nazi point of view. The stories he hears keep Todd up at night and haunt his daydreams, but like a bystander at a traffic accident, Todd's desire for gory details overrides his repulsion.
Bowden revives in Dussander feelings dormant since the end of WWII. Marching in a mock uniform around his kitchen is wholly cathartic for Dussander: it leads to his torture of a cat and the torment of his "student", among other things. Bowden, who has taken on very hateful qualities (he kills birds and doodles swastikas on his notebook), engages the veteran in an endless game of one-upmanship. Dussander stands to lose his freedom, and Bowden his credibility-in effect, his post-secondary school future. All of this winds down to a fairly unpredictable (and unsettling) conclusion, one which requires leaps of faith from its audience yet is more satisfying than the source material's excessive climax.
Singer has yet to get Keyser Söze out of his system. His The Usual Suspects and APT PUPIL are both about evil masquerading as innocence (Verbal's tics and Todd's golden-boy reputation are plausible ruses); they showcase morally bankrupt anti-heroes to whom telling the truth is not an option if they are to achieve their goals. APT PUPIL is a richer film than The Usual Suspects, a movie famous and popular partly because its plot machinations were not germane to the outcome-there was no way you could see the ending coming, as it was all a hoodwink, anyway. Thankfully, Singer has gotten most of The Usual Suspects' film-schoolish geek theatrics out of his system. Some scenes in APT PUPIL feel overdirected and/or obvious (the dream sequences were extraneous), but the majority of the film is subdued-and Singer's handling of the violent scenes is boldly restrained for a film about a murderer and a murderer-in-training. McKellan's and Renfro's performances contribute enormously to the overall success of the film; while most people will focus on British stage vet McKellan's finely-tuned realization, I'd like to single out Renfro's daring work. He isn't afraid to play someone largely unappealing and cold-hearted; he strips his character of vanity, something many of his peers wouldn't do. (Can you picture Kieran Culkin or Jonathan Taylor-Thomas in the same role?) Renfro was recently charged with possession of cocaine-I hope he doesn't continue down that path, because he has a big future in good movies waiting for him.
As guidance counsellor Edward French, "Friend" Schwimmer also deserves mention. He wants to be the parent to Todd that Todd's own well-to-do folks are not (Todd, like most modern kids-and only-children-has mom and dad wrapped around his pinky finger), and his sincerity makes the apt pupil's blackening-heart even more apparent. But one of the film's ultimate questions, are we born evil or do we learn evil?, might be answered in French, whose motives are the slightest bit ambiguous. No man is an island, indeed-we all have the capacity to make the "right" or the "wrong" choices. Schwimmer winningly plays one of a trio of fascinating characters who make the unconventional APT PUPIL laudible.
-October, 1998
*The excellent collection King's stories called Different Seasons spawned not only Apt Pupil, but The Shawshank Redemption (originally titled Rita Hayworth and The Shawshank Redemption) and Stand By Me (originally titled The Body).
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


/**
* Copyright 2017 Google Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
import { FirebaseApp } from '@firebase/app-types';
import { FirebaseAuthTokenData } from '@firebase/app-types/private';
import { log, warn } from './util/util';
/**
* Abstraction around FirebaseApp's token fetching capabilities.
*/
export class AuthTokenProvider {
/**
* @param {!FirebaseApp} app_
*/
constructor(private app_: FirebaseApp) {}
/**
* @param {boolean} forceRefresh
* @return {!Promise<FirebaseAuthTokenData>}
*/
getToken(forceRefresh: boolean): Promise<FirebaseAuthTokenData> {
return this.app_['INTERNAL']['getToken'](forceRefresh).then(
null,
// .catch
function(error) {
// TODO: Need to figure out all the cases this is raised and whether
// this makes sense.
if (error && error.code === 'auth/token-not-initialized') {
log('Got auth/token-not-initialized error. Treating as null token.');
return null;
} else {
return Promise.reject(error);
}
}
);
}
addTokenChangeListener(listener: (token: string | null) => void) {
// TODO: We might want to wrap the listener and call it with no args to
// avoid a leaky abstraction, but that makes removing the listener harder.
this.app_['INTERNAL']['addAuthTokenListener'](listener);
}
removeTokenChangeListener(listener: (token: string | null) => void) {
this.app_['INTERNAL']['removeAuthTokenListener'](listener);
}
notifyForInvalidToken() {
let errorMessage =
'Provided authentication credentials for the app named "' +
this.app_.name +
'" are invalid. This usually indicates your app was not ' +
'initialized correctly. ';
if ('credential' in this.app_.options) {
errorMessage +=
'Make sure the "credential" property provided to initializeApp() ' +
'is authorized to access the specified "databaseURL" and is from the correct ' +
'project.';
} else if ('serviceAccount' in this.app_.options) {
errorMessage +=
'Make sure the "serviceAccount" property provided to initializeApp() ' +
'is authorized to access the specified "databaseURL" and is from the correct ' +
'project.';
} else {
errorMessage +=
'Make sure the "apiKey" and "databaseURL" properties provided to ' +
'initializeApp() match the values provided for your app at ' +
'https://console.firebase.google.com/.';
}
warn(errorMessage);
}
}
|


ORCTRIX
Create a beautiful research portfolio, the easy way
Get Started by entering your ORCID
{{ form.hidden_tag() }} {{ form.orcid.label }} {{ form.orcid() }} {{ form.submit() }}


The benefits of cycling are almost as endless as the country lanes you could soon be exploring. If you’re considering taking up cycling, and weighing it up against other potential activities, then we’re here to tell you that cycling is hands down the best option.
Swimming is an excellent way to work your entire body and cardiovascular system. An hour of swimming burns almost as many calories as running, without all the impact on your bones and joints.
Whether you play indoors, on the grass, or on a beach, volleyball can be a great way to stay healthy and fit. It’s also a great way to stay involved in social activities, as it can be played with a single partner or with a team.
"ALL WORK AND NO PLAY MAKES JACK A DULL BOY"


|
AceTime
0.5.2
Date and time classes for Arduino that support timezones from the TZ Database, and a system clock that can synchronize from an NTP server or an RTC chip.
|
Base interface for ZoneProcessor classes. More...
#include <ZoneProcessor.h>
Public Member Functions | |
| uint8_t | getType () const |
| Return the kTypeXxx of the current instance. More... | |
| virtual const void * | getZoneInfo () const =0 |
| Return the opaque zoneInfo. More... | |
| virtual uint32_t | getZoneId () const =0 |
| Return the unique stable zoneId. More... | |
| virtual TimeOffset | getUtcOffset (acetime_t epochSeconds) const =0 |
| Return the total UTC offset at epochSeconds, including DST offset. More... | |
| virtual TimeOffset | getDeltaOffset (acetime_t epochSeconds) const =0 |
| Return the DST delta offset at epochSeconds. More... | |
| virtual const char * | getAbbrev (acetime_t epochSeconds) const =0 |
| Return the time zone abbreviation at epochSeconds. More... | |
| virtual OffsetDateTime | getOffsetDateTime (const LocalDateTime &ldt) const =0 |
| Return the best estimate of the OffsetDateTime at the given LocalDateTime for the timezone of the current ZoneProcessor. More... | |
| virtual void | printTo (Print &printer) const =0 |
| Print a human-readable identifier (e.g. More... | |
| virtual void | printShortTo (Print &printer) const =0 |
| Print a short human-readable identifier (e.g. More... | |
Static Public Attributes | |
| static const uint8_t | kTypeBasic = 2 |
| Indicate BasicZoneProcessor. More... | |
| static const uint8_t | kTypeExtended = 3 |
| Indicate ExtendedZoneProcessor. More... | |
Protected Member Functions | |
| ZoneProcessor (const ZoneProcessor &)=delete | |
| ZoneProcessor & | operator= (const ZoneProcessor &)=delete |
| ZoneProcessor (uint8_t type) | |
| Constructor. More... | |
| virtual bool | equals (const ZoneProcessor &other) const =0 |
| Return true if equal. More... | |
| virtual void | setZoneInfo (const void *zoneInfo)=0 |
| Set the opaque zoneInfo. More... | |
Protected Attributes | |
| uint8_t | mType |
Friends | |
| class | TimeZone |
| template<uint8_t SIZE, uint8_t TYPE, typename ZS , typename ZI , typename ZIB > | |
| class | ZoneProcessorCacheImpl |
| bool | operator== (const ZoneProcessor &a, const ZoneProcessor &b) |
Base interface for ZoneProcessor classes.
There were 2 options for implmenting the various concrete implementations of ZoneProcessors:
1) Implement only a single getType() method to distinguish the different runtime types of the object. Then use this type information in the TimeZone class to downcast the ZoneProcessor pointer to the correct subclass, and call the correct methods.
2) Fully implement a polymorphic class hierarchy, lifting various common methods (getUtcOffset(), getDeltaOffset(), getAbbrev()) into this interface as virtual methods, then add a virtual equals() method to implement the operator==().
The problem with Option 1 is that the code for both subclasses would be compiled into the program, even if the application used only one of the subclasses. Instead I use Option 2, using a fully polymorphic class hierarchy, adding 3-4 virtual methods. When a program uses only a single subclass, only that particular subclass is included into the program. Unfortunately, this comes at the cost of forcing programs to use the virtual dispatch at runtime for some of the often-used methods.
Definition at line 45 of file ZoneProcessor.h.
|
inlineprotected |
Constructor.
Definition at line 117 of file ZoneProcessor.h.
|
protectedpure virtual |
Return true if equal.
|
pure virtual |
Return the time zone abbreviation at epochSeconds.
This is an experimental method that has not been tested thoroughly. Use with caution. Returns an empty string ("") if an error occurs.
Implemented in ace_time::ExtendedZoneProcessor, and ace_time::BasicZoneProcessor.
|
pure virtual |
Return the DST delta offset at epochSeconds.
This is an experimental method that has not been tested thoroughly. Use with caution. Returns TimeOffset::forError() if an error occurs.
Implemented in ace_time::ExtendedZoneProcessor, and ace_time::BasicZoneProcessor.
|
pure virtual |
Return the best estimate of the OffsetDateTime at the given LocalDateTime for the timezone of the current ZoneProcessor.
Returns OffsetDateTime::forError() if an error occurs, for example, if the LocalDateTime is outside of the support date range of the underlying ZoneInfo files.
Implemented in ace_time::ExtendedZoneProcessor, and ace_time::BasicZoneProcessor.
|
inline |
Return the kTypeXxx of the current instance.
Definition at line 60 of file ZoneProcessor.h.
|
pure virtual |
Return the total UTC offset at epochSeconds, including DST offset.
Returns TimeOffset::forError() if an error occurs.
Implemented in ace_time::ExtendedZoneProcessor, and ace_time::BasicZoneProcessor.
|
pure virtual |
Return the unique stable zoneId.
Implemented in ace_time::ExtendedZoneProcessor, and ace_time::BasicZoneProcessor.
|
pure virtual |
Return the opaque zoneInfo.
Implemented in ace_time::ExtendedZoneProcessor, and ace_time::BasicZoneProcessor.
|
pure virtual |
Print a short human-readable identifier (e.g.
"Los_Angeles")
Implemented in ace_time::ExtendedZoneProcessor, and ace_time::BasicZoneProcessor.
|
pure virtual |
Print a human-readable identifier (e.g.
"America/Los_Angeles").
Implemented in ace_time::ExtendedZoneProcessor, and ace_time::BasicZoneProcessor.
|
protectedpure virtual |
Set the opaque zoneInfo.
|
static |
Indicate BasicZoneProcessor.
Must not be TimeZone::kTypeError (0) or TimeZone::kTypeManual (1).
Definition at line 51 of file ZoneProcessor.h.
|
static |
Indicate ExtendedZoneProcessor.
Must not be TimeZone::kTypeError (0) or TimeZone::kTypeManual (1).
Definition at line 57 of file ZoneProcessor.h.


iLibrary
Home
(current)
Change Password
Cart
Your Cart
Book
Availability
Quantity
Data Structures made easy
200
Remove
Basic Mechanical Engineering
50
Remove
ADD MORE
Confirm
Confirm Selection
×
Are you sure with your selection of books?


|
QuantLib: a free/open-source library for quantitative finance
Fully annotated sources - version 1.30
|
proxy for a libor forward model covariance parameterization More...
#include <ql/legacy/libormarketmodels/lfmcovarproxy.hpp>
Public Member Functions | |
| LfmCovarianceProxy (ext::shared_ptr< LmVolatilityModel > volaModel, const ext::shared_ptr< LmCorrelationModel > &corrModel) | |
| ext::shared_ptr< LmVolatilityModel > | volatilityModel () const |
| ext::shared_ptr< LmCorrelationModel > | correlationModel () const |
| Matrix | diffusion (Time t, const Array &x=Null< Array >()) const override |
| Matrix | covariance (Time t, const Array &x=Null< Array >()) const override |
| virtual Real | integratedCovariance (Size i, Size j, Time t, const Array &x=Null< Array >()) const |
| virtual Matrix | integratedCovariance (Time t, const Array &x=Null< Array >()) const |
| Public Member Functions inherited from LfmCovarianceParameterization | |
| LfmCovarianceParameterization (Size size, Size factors) | |
| virtual | ~LfmCovarianceParameterization ()=default |
| Size | size () const |
| Size | factors () const |
| virtual Matrix | diffusion (Time t, const Array &x=Null< Array >()) const =0 |
| virtual Matrix | covariance (Time t, const Array &x=Null< Array >()) const |
| virtual Matrix | integratedCovariance (Time t, const Array &x=Null< Array >()) const |
Protected Attributes | |
| const ext::shared_ptr< LmVolatilityModel > | volaModel_ |
| const ext::shared_ptr< LmCorrelationModel > | corrModel_ |
| Protected Attributes inherited from LfmCovarianceParameterization | |
| const Size | size_ |
| const Size | factors_ |
proxy for a libor forward model covariance parameterization
Definition at line 35 of file lfmcovarproxy.hpp.
| LfmCovarianceProxy | ( | ext::shared_ptr< LmVolatilityModel > | volaModel, |
| const ext::shared_ptr< LmCorrelationModel > & | corrModel | ||
| ) |
Definition at line 25 of file lfmcovarproxy.cpp.
| ext::shared_ptr< LmVolatilityModel > volatilityModel | ( | ) | const |
Definition at line 38 of file lfmcovarproxy.cpp.
| ext::shared_ptr< LmCorrelationModel > correlationModel | ( | ) | const |
Definition at line 43 of file lfmcovarproxy.cpp.
Implements LfmCovarianceParameterization.
Definition at line 47 of file lfmcovarproxy.cpp.
Reimplemented from LfmCovarianceParameterization.
Definition at line 60 of file lfmcovarproxy.cpp.
Reimplemented from LfmCovarianceParameterization.
Definition at line 50 of file lfmcovarparam.cpp.
|
protected |
Definition at line 51 of file lfmcovarproxy.hpp.
|
protected |
Definition at line 52 of file lfmcovarproxy.hpp.


To add a title, use the Title property. Once you have
entered text, you can specify a TitleSeparator and TitleSeparatorColor.
This adds a line separator under the title to improve readability. If no
text is entered into the Title property, the title separator
will not be displayed.
You can also use the '\n' string to add line breaks in your title.


--- layout: docpage title: "Documentation" is_homepage: false is_sphinx_doc: true doc-parent: "Data Modeling" doc-title: "Conceptual Data Modeling" doc-header-links: ' ' doc-search-path: "../search.html" extra-footer: ' ' ---
First, let’s create a simple domain model that is easy to understand in the relational world, and then see how you might map it from a relational to a distributed hashtable model in Cassandra.
Let’s use an example that is complex enough to show the various data structures and design patterns, but not something that will bog you down with details. Also, a domain that’s familiar to everyone will allow you to concentrate on how to work with Cassandra, not on what the application domain is all about.
For example, let’s use a domain that is easily understood and that everyone can relate to: making hotel reservations.
The conceptual domain includes hotels, guests that stay in the hotels, a collection of rooms for each hotel, the rates and availability of those rooms, and a record of reservations booked for guests. Hotels typically also maintain a collection of “points of interest,” which are parks, museums, shopping galleries, monuments, or other places near the hotel that guests might want to visit during their stay. Both hotels and points of interest need to maintain geolocation data so that they can be found on maps for mashups, and to calculate distances.
The conceptual domain is depicted below using the entity–relationship model popularized by Peter Chen. This simple diagram represents the entities in the domain with rectangles, and attributes of those entities with ovals. Attributes that represent unique identifiers for items are underlined. Relationships between entities are represented as diamonds, and the connectors between the relationship and each entity show the multiplicity of the connection.
Obviously, in the real world, there would be many more considerations and much more complexity. For example, hotel rates are notoriously dynamic, and calculating them involves a wide array of factors. Here you’re defining something complex enough to be interesting and touch on the important points, but simple enough to maintain the focus on learning Cassandra.
Material adapted from Cassandra, The Definitive Guide. Published by O’Reilly Media, Inc. Copyright © 2020 Jeff Carpenter, Eben Hewitt. All rights reserved. Used with permission.


Thoughts & Notes
(Re-Learning Programming)
July 10, 2017
Notes #1
Bacon ipsum dolor amet capicola strip steak landjaeger, biltong spare ribs rump cow ground round andouille sirloin pork.  Flank turducken turkey rump, leberkas shoulder bresaola ham hock tail drumstick corned beef. Venison pork chop beef jowl short ribs.
Bresaola short ribs pastrami, beef ribs spare ribs kielbasa ham tongue kevin landjaeger chicken ball tip.  Leberkas ham ham hock pork loin. Filet mignon bacon pancetta leberkas turducken fatback tongue frankfurter jowl. Shoulder tenderloin chicken shank bacon shankle sirloin.
 Pork belly salami shank pork chop turducken ribeye swine shoulder tri-tip fatback cupim short loin chuck strip steak. Rump pork chop t-bone.
July 13, 2017
Notes #2
Bacon ipsum dolor amet capicola strip steak landjaeger, biltong spare ribs rump cow ground round andouille sirloin pork.  Flank turducken turkey rump, leberkas shoulder bresaola ham hock tail drumstick corned beef. Venison pork chop beef jowl short ribs.
Shankle beef ribs tongue strip steak flank landjaeger capicola hamburger chuck pancetta kevin. Sirloin landjaeger chicken, bresaola brisket swine short ribs turkey short loin ball tip porchetta ham hock. Capicola frankfurter jowl short loin. Kevin flank hamburger, beef venison shankle short loin bresaola frankfurter
Bresaola short ribs pastrami, beef ribs spare ribs kielbasa ham tongue kevin landjaeger chicken ball tip.  Leberkas ham ham hock pork loin. Filet mignon bacon pancetta leberkas turducken fatback tongue frankfurter jowl. Shoulder tenderloin chicken shank bacon shankle sirloin.
July 18, 2017
Notes #3
Bacon ipsum dolor amet capicola strip steak landjaeger, biltong spare ribs rump cow ground round andouille sirloin pork.  Flank turducken turkey rump, leberkas shoulder bresaola ham hock tail drumstick corned beef. Venison pork chop beef jowl short ribs.
Bresaola short ribs pastrami, beef ribs spare ribs kielbasa ham tongue kevin landjaeger chicken ball tip.  Leberkas ham ham hock pork loin. Filet mignon bacon pancetta leberkas turducken fatback tongue frankfurter jowl. Shoulder tenderloin chicken shank bacon shankle sirloin.
 Pork belly salami shank pork chop turducken ribeye swine shoulder tri-tip fatback cupim short loin chuck strip steak. Rump pork chop t-bone.
July 19, 2017
Notes #4
Bacon ipsum dolor amet capicola strip steak landjaeger, biltong spare ribs rump cow ground round andouille sirloin pork.  Flank turducken turkey rump, leberkas shoulder bresaola ham hock tail drumstick corned beef. Venison pork chop beef jowl short ribs.
Bresaola short ribs pastrami, beef ribs spare ribs kielbasa ham tongue kevin landjaeger chicken ball tip.  Leberkas ham ham hock pork loin. Filet mignon bacon pancetta leberkas turducken fatback tongue frankfurter jowl. Shoulder tenderloin chicken shank bacon shankle sirloin.
 Pork belly salami shank pork chop turducken ribeye swine shoulder tri-tip fatback cupim short loin chuck strip steak. Rump pork chop t-bone.
July 20, 2017
Notes #5
Bacon ipsum dolor amet capicola strip steak landjaeger, biltong spare ribs rump cow ground round andouille sirloin pork.  Flank turducken turkey rump, leberkas shoulder bresaola ham hock tail drumstick corned beef. Venison pork chop beef jowl short ribs.
Bresaola short ribs pastrami, beef ribs spare ribs kielbasa ham tongue kevin landjaeger chicken ball tip.  Leberkas ham ham hock pork loin. Filet mignon bacon pancetta leberkas turducken fatback tongue frankfurter jowl. Shoulder tenderloin chicken shank bacon shankle sirloin.
 Pork belly salami shank pork chop turducken ribeye swine shoulder tri-tip fatback cupim short loin chuck strip steak. Rump pork chop t-bone.
July 24, 2017
Notes #6
Bacon ipsum dolor amet capicola strip steak landjaeger, biltong spare ribs rump cow ground round andouille sirloin pork.  Flank turducken turkey rump, leberkas shoulder bresaola ham hock tail drumstick corned beef. Venison pork chop beef jowl short ribs.
Bresaola short ribs pastrami, beef ribs spare ribs kielbasa ham tongue kevin landjaeger chicken ball tip.  Leberkas ham ham hock pork loin. Filet mignon bacon pancetta leberkas turducken fatback tongue frankfurter jowl. Shoulder tenderloin chicken shank bacon shankle sirloin.
 Pork belly salami shank pork chop turducken ribeye swine shoulder tri-tip fatback cupim short loin chuck strip steak. Rump pork chop t-bone.


Store Rails views on database
The ideal way is to store views on a database, indeed there are some CMSs that solve this problem with similar approaches, like Radiant and Locomotive.
However, I wanted something that let me to reuse this feature on several projects (because a custom CMS may have different features), and to store only certain views, according to specific content and needs.
So, I’ve developed Panoramic, a simple gem inspired from some ideas found in José Valim’s excellent book Crafting Rails Applications. Simply put, once Panoramic is installed, you can store your views on database. It works through an implemetation of ActionView::Resolver
class: Rails will lookup views as if they were on filesystem. In controller, you’ll tell where and when to use those views, using prepend_view_path
and append_view_path
on a controller or action basis (they are both implemented as class and instance methods). Depending from the method you’ll use, Rails will respectively look for views on database, then it will fallback on filesystem, or viceversa. Quite easy, right?
I’ll not show any code here, because there’s a full explanation on Panoramic’s README. As a final note, at the moment it works only with ActiveRecord, but I’ve planned to extend support to DataMapper and Mongoid as soon as possible. It’s very easy to implement, the main problem is about testing: maybe I’ll write some rspec’s custom matchers to reuse with different ORMs, like carrierwave.
Notes:
This article was initially published on http://blog.andreapavoni.com/post/6488774753/store-rails-views-on-database


Tasks
- Figure out how to move to different areas/scene of the game.
- Learn one thing about art from the game.
- Make it to the end of the game.
Evaluation
- How often do you play browser games?
- How often do you play PC games?
- Did you read the instructions before starting the game?
- Did you skip the video in the beginning? If yes, why?
- How clear was the navigation? (i.e. the arrows, clickable items, etc.)
- Were you able to keep up with the dialogue? Did it go by too quickly? Too slowly?
- How was the wording for the educational bits? Too boring? Just right?
- How would you rate the story? 1 being extremely boring. 5 being extremely interesting.
- In the past 6 months, have you played a game similar to this? If yes, which ones?
- Do you feel like the theme fit the information being displayed?


The greatest lyric rating system on google cloud
Please, paste your lyrics in the bin and click submit to find you lyrics score
Input your lyrics:
Your score is:


- M - Variable in class ml.recommendation.util.Data
-
Number of users.
- main(String[]) - Static method in class la.decomposition.EigenValueDecomposition
-
- main(String[]) - Static method in class la.decomposition.LUDecomposition
-
- main(String[]) - Static method in class la.decomposition.QRDecomposition
-
- main(String[]) - Static method in class la.decomposition.SingularValueDecomposition
-
- main(String[]) - Static method in class la.io.IO
-
- main(String[]) - Static method in class la.matrix.DenseMatrix
-
- main(String[]) - Static method in class la.matrix.SparseMatrix
-
- main(String[]) - Static method in class la.matrix.Test
-
- main(String[]) - Static method in class la.vector.DenseVector
-
- main(String[]) - Static method in class la.vector.SparseVector
-
- main(String[]) - Static method in class la.vector.Test
-
- main(String[]) - Static method in class ml.classification.AdaBoost
-
- main(String[]) - Static method in class ml.classification.LinearBinarySVM
-
- main(String[]) - Static method in class ml.classification.LinearMCSVM
-
- main(String[]) - Static method in class ml.classification.LogisticRegression
-
- main(String[]) - Static method in class ml.classification.LogisticRegressionByBoundConstrainedPLBFGS
-
- main(String[]) - Static method in class ml.classification.LogisticRegressionByNonlinearConjugateGradient
-
- main(String[]) - Static method in class ml.classification.LogisticRegressionByNonnegativePLBFGS
-
- main(String[]) - Static method in class ml.classification.MaxEnt
-
- main(String[]) - Static method in class ml.clustering.KMeans
-
- main(String[]) - Static method in class ml.clustering.L1NMF
-
- main(String[]) - Static method in class ml.clustering.NMF
-
- main(String[]) - Static method in class ml.clustering.SpectralClustering
-
- main(String[]) - Static method in class ml.graph.AllPairsShortestPaths
-
- main(String[]) - Static method in class ml.graph.Graph
-
- main(String[]) - Static method in class ml.graph.HuffmanCodes
-
- main(String[]) - Static method in class ml.graph.MaximumFlow
-
- main(String[]) - Static method in class ml.kernel.Kernel
-
- main(String[]) - Static method in class ml.kernel.KernelByColumns
-
- main(String[]) - Static method in class ml.manifold.Manifold
-
- main(String[]) - Static method in class ml.manifold.ManifoldByColumns
-
- main(String[]) - Static method in class ml.optimization.AcceleratedGradientDescent
-
- main(String[]) - Static method in class ml.optimization.AcceleratedProximalGradient
-
- main(String[]) - Static method in class ml.optimization.GeneralQP
-
- main(String[]) - Static method in class ml.optimization.GeneralQPViaPrimalDualInteriorPoint
-
- main(String[]) - Static method in class ml.optimization.LBFGSOnSimplex
-
- main(String[]) - Static method in class ml.optimization.NonnegativePLBFGS
-
- main(String[]) - Static method in class ml.optimization.PrimalDualInteriorPoint
-
- main(String[]) - Static method in class ml.optimization.ProjL1
-
- main(String[]) - Static method in class ml.optimization.ProxLInfinity
-
- main(String[]) - Static method in class ml.optimization.QPWithBoundConstraints
-
- main(String[]) - Static method in class ml.random.MultivariateGaussianDistribution
-
- main(String[]) - Static method in class ml.recommendation.FM
-
- main(String[]) - Static method in class ml.recommendation.STSR
-
- main(String[]) - Static method in class ml.recovery.MatrixCompletion
-
- main(String[]) - Static method in class ml.recovery.RobustPCA
-
- main(String[]) - Static method in class ml.regression.LASSO
-
- main(String[]) - Static method in class ml.regression.LinearRegression
-
- main(String[]) - Static method in class ml.sequence.CRF
-
- main(String[]) - Static method in class ml.sequence.HMM
-
- main(String[]) - Static method in class ml.subspace.Isomap
-
- main(String[]) - Static method in class ml.subspace.KernelPCA
-
- main(String[]) - Static method in class ml.subspace.LLE
-
- main(String[]) - Static method in class ml.subspace.MDS
-
- main(String[]) - Static method in class ml.subspace.PCA
-
- main(String[]) - Static method in class ml.temporal.ReflectedLogisticRegression
-
- main(String[]) - Static method in class ml.temporal.TemporalLASSO
-
- main(String[]) - Static method in class ml.temporal.TemporalLogisticRegression
-
- main(String[]) - Static method in class ml.topics.LDA
-
- main(String[]) - Static method in class ml.topics.LdaGibbsSampler
-
Driver with example data.
- main(String[]) - Static method in class ml.utils.ArrayOperator
-
- main(String[]) - Static method in class ml.utils.InPlaceOperator
-
- main(String[]) - Static method in class ml.utils.Matlab
-
- Manifold - Class in ml.manifold
-
Java implementation of commonly used manifold learning functions.
- Manifold() - Constructor for class ml.manifold.Manifold
-
- ManifoldByColumns - Class in ml.manifold
-
Java implementation of commonly used manifold learning functions.
- ManifoldByColumns() - Constructor for class ml.manifold.ManifoldByColumns
-
- Matlab - Class in ml.utils
-
- Matlab() - Constructor for class ml.utils.Matlab
-
- Matrix - Interface in la.matrix
-
- MatrixCompletion - Class in ml.recovery
-
A Java implementation of matrix completion which solves the
following convex optimization problem:
min ||A||_*
s.t.
- MatrixCompletion() - Constructor for class ml.recovery.MatrixCompletion
-
Constructor.
- matrixCompletion(Matrix, Matrix) - Static method in class ml.recovery.MatrixCompletion
-
Do matrix completion which solves the following convex
optimization problem:
min ||A||_*
s.t.
- matrixCompletion(Matrix, int[]) - Static method in class ml.recovery.MatrixCompletion
-
Do matrix completion which solves the following convex
optimization problem:
min ||A||_*
s.t.
- max(double[]) - Static method in class ml.temporal.SurvivalScoreModel
-
- max(double[]) - Static method in class ml.utils.ArrayOperator
-
Compute the maximal element.
- max(double[], int, int) - Static method in class ml.utils.ArrayOperator
-
Compute the maximal element.
- max(Matrix, double) - Static method in class ml.utils.Matlab
-
Compute maximum between elements of A and a real number and return
as a matrix with the same shape of A.
- max(double, Matrix) - Static method in class ml.utils.Matlab
-
Compute maximum between elements of A and a real number and return
as a matrix with the same shape of A.
- max(Matrix, Matrix) - Static method in class ml.utils.Matlab
-
Compute maximum between two real matrices A and B.
- max(Vector, double) - Static method in class ml.utils.Matlab
-
Compute maximum between elements of V and a real number
and return as a vector with the same shape of V.
- max(double, Vector) - Static method in class ml.utils.Matlab
-
Compute maximum between elements of V and a real number
and return as a vector with the same shape of V.
- max(Vector, Vector) - Static method in class ml.utils.Matlab
-
Compute maximum between two vectors U and V.
- max(Vector) - Static method in class ml.utils.Matlab
-
Compute the maximal value and the corresponding row
index of a vector V.
- max(Matrix) - Static method in class ml.utils.Matlab
-
Compute the maximal value for each column and the
corresponding row indices of a matrix A.
- max(double[][], int) - Static method in class ml.utils.Matlab
-
Compute the maximal value for each row or each column
and the corresponding indices of a matrix A.
- max(Matrix, int) - Static method in class ml.utils.Matlab
-
Compute the maximal value for each row or each column
and the corresponding indices of a matrix A.
- max(double[]) - Static method in class ml.utils.Matlab
-
Compute the maximum of elements in a 1D double
array.
- max(double[], int, int) - Static method in class ml.utils.Matlab
-
Compute the maximum of elements in an interval
of a 1D double
array.
- MaxEnt - Class in ml.classification
-
A Java implementation for the maximum entropy modeling.
- MaxEnt() - Constructor for class ml.classification.MaxEnt
-
- MaximumFlow - Class in ml.graph
-
Maximum flow.
- MaximumFlow() - Constructor for class ml.graph.MaximumFlow
-
- maxIter - Static variable in class la.decomposition.EigenValueDecomposition
-
Maximum number of iterations.
- maxIter - Static variable in class la.decomposition.SingularValueDecomposition
-
Maximum number of iterations.
- maxIter - Variable in class ml.clustering.L1NMF
-
- maxIter - Variable in class ml.options.ClusteringOptions
-
- maxIter - Variable in class ml.options.KMeansOptions
-
- maxIter - Variable in class ml.options.Options
-
- maxIter - Variable in class ml.regression.Regression
-
Maximal number of iterations.
- MDS - Class in ml.subspace
-
Multi-dimensional Scaling (MDS).
- MDS(int) - Constructor for class ml.subspace.MDS
-
Constructor.
- mean(double[]) - Static method in class ml.utils.ArrayOperator
-
Compute the mean of a 1D double
array.
- mean(Matrix, int) - Static method in class ml.utils.Matlab
-
M = mean(A, dim) returns the mean values for elements
along the dimension of A specified by scalar dim.
- Method - Static variable in class ml.recommendation.FM
-
- Method - Static variable in class ml.recommendation.STSR
-
- min(double[]) - Static method in class ml.temporal.SurvivalScoreModel
-
- min(double[]) - Static method in class ml.utils.ArrayOperator
-
Compute the minimal element.
- min(double[], int, int) - Static method in class ml.utils.ArrayOperator
-
Compute the minimal element.
- min(Matrix, double) - Static method in class ml.utils.Matlab
-
Compute minimum between elements of A and a real number and return
as a matrix with the same shape of A.
- min(double, Matrix) - Static method in class ml.utils.Matlab
-
Compute minimum between elements of A and a real number and return
as a matrix with the same shape of A.
- min(Matrix, Matrix) - Static method in class ml.utils.Matlab
-
Compute minimum between two real matrices A and B.
- min(Vector, double) - Static method in class ml.utils.Matlab
-
Compute minimum between elements of V and a real number
and return as a vector with the same shape of V.
- min(double, Vector) - Static method in class ml.utils.Matlab
-
Compute minimum between elements of V and a real number
and return as a vector with the same shape of V.
- min(Vector, Vector) - Static method in class ml.utils.Matlab
-
Compute minimum between two vectors U and V.
- min(Vector) - Static method in class ml.utils.Matlab
-
Compute the minimal value and the corresponding row
index of a vector V.
- min(Matrix) - Static method in class ml.utils.Matlab
-
Compute the minimal value for each column and the
corresponding row indices of a matrix A.
- min(Matrix, int) - Static method in class ml.utils.Matlab
-
Compute the minimal value for each row or each column
and the corresponding indices of a matrix A.
- minimumSpanningTreePrim(Graph<K>) - Static method in class ml.graph.Graph
-
Compute the minimum spanning tree of the graph G by Prim's algorithm.
- minus(Matrix) - Method in class la.matrix.DenseMatrix
-
- minus(double) - Method in class la.matrix.DenseMatrix
-
- minus(Matrix) - Method in interface la.matrix.Matrix
-
This - A.
- minus(double) - Method in interface la.matrix.Matrix
-
This - v.
- minus(Matrix) - Method in class la.matrix.SparseMatrix
-
- minus(double) - Method in class la.matrix.SparseMatrix
-
- minus(Vector) - Method in class la.vector.DenseVector
-
- minus(Vector) - Method in class la.vector.SparseVector
-
- minus(Vector) - Method in interface la.vector.Vector
-
Vector subtraction, i.e.
- minus(double[], double[]) - Static method in class ml.utils.ArrayOperator
-
Element-wise subtraction.
- minus(Vector, Vector, Vector) - Static method in class ml.utils.InPlaceOperator
-
res = V - U.
- minus(double[], double[], double[]) - Static method in class ml.utils.InPlaceOperator
-
res = V1 - V2.
- minus(Vector, Vector, double) - Static method in class ml.utils.InPlaceOperator
-
res = V - v.
- minus(Vector, double, Vector) - Static method in class ml.utils.InPlaceOperator
-
res = v - V.
- minus(Matrix, Matrix, Matrix) - Static method in class ml.utils.InPlaceOperator
-
res = A - B
- minus(Matrix, Matrix, double) - Static method in class ml.utils.InPlaceOperator
-
res = A - v
- minus(Matrix, double, Matrix) - Static method in class ml.utils.InPlaceOperator
-
res = v - A
- minus(Vector, Vector) - Static method in class ml.utils.Matlab
-
- minus(Matrix, Matrix) - Static method in class ml.utils.Matlab
-
- minus(Matrix, double) - Static method in class ml.utils.Matlab
-
- minus(double, Matrix) - Static method in class ml.utils.Matlab
-
res = v - A.
- minusAssign(int[], int) - Static method in class ml.utils.ArrayOperator
-
Element-wise subtraction and assignment operation.
- minusAssign(double[], double) - Static method in class ml.utils.ArrayOperator
-
Element-wise subtraction and assignment operation.
- minusAssign(double[], double, double[]) - Static method in class ml.utils.ArrayOperator
-
res -= a * V.
- minusAssign(double[], double[]) - Static method in class ml.utils.ArrayOperator
-
Element-wise subtraction and assignment operation.
- minusAssign(double[][], double) - Static method in class ml.utils.ArrayOperator
-
res = res - v.
- minusAssign(Vector, double) - Static method in class ml.utils.InPlaceOperator
-
res -= v.
- minusAssign(Vector, Vector) - Static method in class ml.utils.InPlaceOperator
-
res -= V
- minusAssign(Vector, double, Vector) - Static method in class ml.utils.InPlaceOperator
-
res -= a * V.
- minusAssign(Matrix, Matrix) - Static method in class ml.utils.InPlaceOperator
-
res = res - A
- minusAssign(Matrix, double) - Static method in class ml.utils.InPlaceOperator
-
res = res - v
- minusAssign(Matrix, double, Matrix) - Static method in class ml.utils.InPlaceOperator
-
res -= a * A.
- ml.classification - package ml.classification
-
- ml.clustering - package ml.clustering
-
- ml.graph - package ml.graph
-
- ml.kernel - package ml.kernel
-
- ml.manifold - package ml.manifold
-
- ml.optimization - package ml.optimization
-
- ml.options - package ml.options
-
- ml.random - package ml.random
-
- ml.recommendation - package ml.recommendation
-
- ml.recommendation.util - package ml.recommendation.util
-
- ml.recovery - package ml.recovery
-
- ml.regression - package ml.regression
-
- ml.sequence - package ml.sequence
-
- ml.subspace - package ml.subspace
-
- ml.temporal - package ml.temporal
-
- ml.topics - package ml.topics
-
- ml.utils - package ml.utils
-
- mldivide(Matrix, Matrix) - Static method in class ml.utils.Matlab
-
Calculate the left division of the form A \ B.
- mrdivide(Matrix, Matrix) - Static method in class ml.utils.Matlab
-
Calculate the right division of B into A, i.e., A / B.
- mtimes(Matrix) - Method in class la.matrix.DenseMatrix
-
- mtimes(Matrix) - Method in interface la.matrix.Matrix
-
This * A.
- mtimes(Matrix) - Method in class la.matrix.SparseMatrix
-
- mtimes(Matrix, Matrix, char, Matrix) - Static method in class ml.utils.InPlaceOperator
-
res = A * B if operator is ' ',
res = AT * B if operator is 'T'.
- mtimes(Matrix, Matrix, Matrix) - Static method in class ml.utils.InPlaceOperator
-
res = A * B.
- mtimes(Matrix, Matrix) - Static method in class ml.utils.Matlab
-
- mu - Variable in class ml.clustering.L1NMF
-
- mu - Variable in class ml.options.L1NMFOptions
-
- mu - Variable in class ml.options.Options
-
- MultivariateGaussianDistribution - Class in ml.random
-
A Java implementation for the multivariate Gaussian
distribution given mean and covariance.
- MultivariateGaussianDistribution() - Constructor for class ml.random.MultivariateGaussianDistribution
-
- mvnrnd(Matrix, Matrix, int) - Static method in class ml.random.MultivariateGaussianDistribution
-
Generate random samples chosen from the multivariate Gaussian
distribution with mean MU and covariance SIGMA.
- mvnrnd(double[], double[][], int) - Static method in class ml.random.MultivariateGaussianDistribution
-
Generate random samples chosen from the multivariate Gaussian
distribution with mean MU and covariance SIGMA.
- mvnrnd(double[], double[], int) - Static method in class ml.random.MultivariateGaussianDistribution
-
Generate random samples chosen from the multivariate Gaussian
distribution with mean MU and a diagonal covariance SIGMA.
- mvnrnd(Matrix, Matrix, int) - Static method in class ml.utils.Matlab
-
Generate random samples chosen from the multivariate Gaussian
distribution with mean MU and covariance SIGMA.
- mvnrnd(double[], double[][], int) - Static method in class ml.utils.Matlab
-
Generate random samples chosen from the multivariate Gaussian
distribution with mean MU and covariance SIGMA.
- mvnrnd(double[], double[], int) - Static method in class ml.utils.Matlab
-
Generate random samples chosen from the multivariate Gaussian
distribution with mean MU and a diagonal covariance SIGMA.


WITNESS LIST Corrections Committee March 16, 1999-2:00P HB 275 On: Scott, Wayne (Texas Department of Criminal Justice) HB 788 On: Scott, Wayne (Texas Department of Criminal Justice) HB 812 On: Scott, Wayne (Texas Department of Criminal Justice) HB 854 For: Gonzalez, Tony (Texas Sheriff Association) Olivarez, Sr., Sheriff Larry (Texas Sheriff's Association) Westbrook, Steve (Sheriffs' Association of Texas) On: Baker, Thomas A. (Texas Department of Criminal Justice) Rodriguez, Victor (Texas Board of Pardons and Paroles) Scott, Wayne (Texas Department of Criminal Justice) HB 903 Against: Weeks, David P. (Walker County Criminal District Attorney) On: Fabelo, Ph.D, Tony (Criminal Justice Policy Council) Rodriguez, Victor (Tx. Board of Pardons and Paroles) HB 1112 On: Scott, Wayne (Texas Department of Criminal Justice) HB 1713 On: Weeks, David P. (Walker County Criminal District Attorney) HB 1796 For: Bowles, David (San Antonio Crime Prevention Commission) Davis, Bob (Business Crime Council of South Texas) On: Fabelo, Ph.D, Tony (Criminal Justice Policy Council) Rodriguez, Victor (Texas Board of Pardons and Paroles) Weeks, David P. (Walker County District Attorney) HB 2593 For: DuFour, Doots (Diocese of Austin)


What is SuccessWhale?
SuccessWhale is a multi-column, web-based Twitter and Facebook client.
Within its interface you can set up as many different columns as you like, pulling feeds in customisable ways from the various Twitter and Facebook accounts that you have connected to SuccessWhale. For example, you could have a column that combines two Twitter lists from two different users, or one that combines Twitter mentions and Facebook notifications from across all your accounts.
Some of its other features are:
- Mobile web interface for access on the go
- Alternative login to access your social networks from locations that ban Twitter and Facebook
- Post to multiple accounts at once
- Comment, like, retweet and favourite from one interface
- Customise layout and themes to fit your screen
- "Banned phrases" support to hide those game requests
On the geekier side, there's also:
- Extensible API supporting several clients, such as the OnoSendai client for Android
- Free and Open Source so you can make your own version of SuccessWhale
What does it look like?
This is the main interface of SuccessWhale:
Each item on display comes with its own buttons for interacting with it, such as replying and retweeting. You can also view a conversation inline by clicking on the button.
Along the top of the screen are the areas for posting a new status update, including attaching pictures, and choosing which accounts the status update will be posted to:
On the Config page, you can find controls for managing the accounts you have linked with SuccessWhale, and you can add, delete, re-order and mix up your columns however you like:
SuccessWhale has a mobile interface too — just go to the same site as normal on your phone. On small screens, buttons will shrink and a swipe gesture allows you to navigate left and right across your columns. The mobile site otherwise looks just the same as the desktop one:
How do I get started?
To get started, simply sign in using one of your Twitter or Facebook accounts using the buttons on the login page. SuccessWhale will automatically set up some columns for you.
If you only have one account, you're good to go!
If you have more, visit the Config page using the button at the top right. From there you can add more Twitter and Facebook accounts. Each time you add one it'll create some example columns for you, so once you've added a few accounts you probably want to stay on the Config page and set the columns up just the way you like them.
You can also set your display options and banned phrases there, or create yourself an alternative login so that you can use SuccessWhale in places where Twitter and Facebook are banned.
Once you're happy with the configuration, head back to the main interface and get reading and posting!
Your configuration is stored on SuccessWhale, so you can log in on all your devices — including phones and tablets — and see the same interface everywhere.
I'm sold!
To start using SuccessWhale right away, why not head back to the login page right now and click "Log in with Twitter" or "Log in with Facebook"?


Match Play. 1-1 to 5. How should Red play 42?
pips Red=91 White=165
(CorrectAnswer= 0/0, ErrorScore= 0)
I had this position as Red against XG and quickly played 8/6, 8/4. In post-match analysis XG recommended 8/2, a move I hadn't considered. My move rated as an error which looks harsh!
Its advantage is that when the blot is hit it slows Red down and gives White the opportunity to wreck his board, thus reducing Red's risk of losing after a hit in the bear-off. In equity terms it is only fractionally better than 11/7, 8/6 and 11/7, 9/7 but the main point is to remind us all not to overlook a possible play.
Be honest – did you consider 8/2?
Its advantage is that when the blot is hit it slows Red down and gives White the opportunity to wreck his board, thus reducing Red's risk of losing after a hit in the bear-off. In equity terms it is only fractionally better than 11/7, 8/6 and 11/7, 9/7 but the main point is to remind us all not to overlook a possible play.
Be honest – did you consider 8/2?
1. Cubeful 2-ply 6/5 6/1 Eq.: -0.671 0.169 0.005 0.000 - 0.831 0.075 0.002 2. Cubeful 2-ply 6/1 5/4 Eq.: -0.688 (-0.017) 0.164 0.005 0.000 - 0.836 0.081 0.002 3. Cubeful 2-ply 6/1 2/1 Eq.: -0.699 (-0.028) 0.159 0.004 0.000 - 0.841 0.079 0.002 4. Cubeful 2-ply 6/1 4/3 Eq.: -0.702 (-0.031) 0.160 0.005 0.000 - 0.840 0.084 0.002 5. Cubeful 2-ply 6/1 3/2 Eq.: -0.704 (-0.033) 0.160 0.005 0.000 - 0.840 0.083 0.002


User Name
Organization
Access Level
Manage
Edit
Delete
Update or Create
×
Please check your input
USER NAME:
ORGANIZATION:
Choose here
ACCESS LEVEL
Choose here
Admin
Manager
Developer
Reader
New Password:
Delete User
×
Add User


Elegance
The Vampire's natural agility when thirsting for blood allows them to avoid strikes and find gaps in the enemies defense.
+${value}% Defensive Ability
6 8 10 12 14 16 18 20 22 24
+${value}% Offensive Ability
6 8 10 12 14 16 18 20 22 24
MaxLevel
6
UltimateLevel
10


- All you have to do...
- Is create an indented hierarchy
- Of your notes
- In a list
- And Indent.txt will turn it into a nice HTML file
- With a ul hierarchy based on indent levels
- And simple
- formatting
- Just use either
- The command line utility
- or the Sublime Text 2 Plugin
- It's great for:


Archetype Style Guide
Component API
Color-Pallet
Docs
Front End Design Principles
main.scss
Utilities
Colorkit
Objects
Partition Object
Button Object
Alert Object
Components
Typography
Page
Spacers
Layout
Breakpoints
Tests


Home
Attractions
Rides
Restaurants
Park Map
Our Events
Special Events
Quiz
Image Gallery
Site Map
Student Details
Student 1
Student 2
Student 3
Student 4
Products
Interested in out website? Take a look at our Site Map.
You are here :
Home
>
Site Map
Home Page
Attractions
Events
Quiz
Products
Image Gallery
Student Details
Restaurant
Rides
Park Map
Special Events
Student 1
Student 2
Student 3
Student 4
⇧


Welcome to my calculator! Try running :help for help.
Please enable JavaScript to use this calculator.