{% extends '_visualisation.html' %} {% load core_filters %} {% block head %} {{ block.super }} {{ form.media }} {% endblock %} {% block page_title %}{% if form.errors %}Error: {% endif %}Catalogue item - {{ block.super }}{% endblock %} {% block content %} {% if form_errors %}
In order to publish this visualisation, at least two users must approve it. One approver must be the creator of the visualisation, and a different approver must have completed a peer review of the visualisation.
{% if approvals %} So far, the following {{ approvals | length }} user{{ approvals | pluralize }} {{ approvals | pluralize:'has,have' }} approved it. {% else %} No-one has approved this yet. {% endif %}
By approving that this visualisation is ready to be published, you are confirming that it follows the onboarding guidance. Please contact the Data Workspace team if you have any questions using the support and feedback form.
{% endif %} {% endblock %}


Well I've been meaning to post some of this stuff for a while. I've been doing some Ruby On Rails (RoR) development for a while now, more to teach myself than to create any spectacular applications.
Anyway as you do I've run across a variety of intersesting sources of information about rails as I built my first application (a security checklist management system), so I'll post some of them here...
The main site is at www.rubyonrails.com and is a decent place to start.
For tutorials there's a list here Top 12 Rails Tutorials of which I'd have to say that the rolling on rails one I liked (although it's a bit out of date now). Also if you look at that one I'd be inclined to follow-up with Amy Hoy's ones which can be found here
In terms of forums and the like I've actually not found any that I like a lot yet. There's mailing lists off the main site, but I'm not a great fan of mailing lists for picking up things as I find the web interfaces not that great, usually.
There's some books that are a good bet, the seminal one is Agile Web Development with Rails however I wouldn't buy the current print version as V2 is under development. what you can do is get the PDF of the current cut of V2 from there and then you get the PDF of the final one when it's done...
There's an Oreilly book by the guy who did the Rolling on Rails tutorial I mentioned above, which is out on safari now and will be in print R.S.N . I've not read much of it yet, so I'm not too sure how it'll be...
Anyway that's enough of an intro, I just need to remember to keep posting as I find new stuff...


@* * Copyright 2023 HM Revenue & Customs * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. *@ @import controllers.auth.requests.UserRequest @import scala.concurrent.ExecutionContext @this( main: MainView, niLetter: views.html.print.NiLetterView, hmrcPageHeading: HmrcPageHeading ) @(personDetails: models.PersonDetails, dateString: String, saveNiLetterAsPdfLinkEnabled: Boolean, nino : Option[Nino])(implicit request: UserRequest[_], messages: play.api.i18n.Messages) @stylesheet = { } @main( pageTitle = messages("label.print_your_national_insurance_summary"), serviceName = messages("label.national_insurance"), showBackLink = true, fullWidth = true, yourProfileActive = true, stylesheets = Some(stylesheet) ) { @hmrcPageHeading(PageHeading( text = messages("label.your_national_insurance_letter"), section = Some(messages("label.profile_and_settings")) ))
@if(saveNiLetterAsPdfLinkEnabled) { } @niLetter(personDetails, dateString, nino) }


Cape Coral Police make three DUI arrests in weekend traffic operations
by WFTX Digital TeamCAPE CORAL, Fla. -- Police held high-visibility traffic operations over the weekend and made three DUI arrests.
According to Cape Cora Police, officers made a total of 17 total traffic stops.
Among the results were:
3 DUI arrests
11 Warnings
2 Speeding citations
1 Non-moving citation
1 Criminal citation


Enhanced Networked Monographs
A collaboration between NYU Press and Digital Library Technology Services, Enhanced Networked Monographs (ENM) is an experimental open access publishing project funded by The Andrew W. Mellon Foundation. The ENM Topic Explorer provides free, web-based access to selected eBooks from NYU Press, University of Minnesota Press, and University of Michigan Press. Expanding on work done for the NYU Press Open Square website, ENM’s prototype discovery and reading environments enable full-text search and navigation via a “topic map” derived from back-of-book index entries.
For more background on what went into the project, visit the ENM project blog.
Project Team
NYU Libraries, Digital Library Technology Services (DLTS)
David Millman, Assistant Dean, Digital Library Technology Services and Principal Investigator
Carol Kassel, Senior Manager, Digital Infrastructure
Laura Henze, Designer
David Arjanik, Programmer Analyst
NYU Press
Ellen Chodosh, Director
Eric Zinner, Associate Director and Editor-in-Chief
Jonathan Greenberg, Digital Scholarly Publishing Specialist
Collaborators
Former team members
Monica McCormick, Digital Scholarly Publishing Officer and Project Manager
Alexandra Provo, Project Manager and Digital Production Editor


Format JSON
JSON One
Format
Minify
Paste Over
Clear
Larger
Reset
Smaller
Load Diff
JSON Two
Format
Minify
Paste Over
Clear
JSON Compare
One vs Two
Load Diff
Next Change
Previous Change
Back to Top


--- ---
Derive a new control from TTreeView and override its CreateParams method like this:
uses CommCtrl; procedure TNoScrollbarsTreeview.CreateParams(var Params: TCreateParams); begin inherited; Params.style := Params.style or TVS_NOSCROLL; end;


{% extends 'base.html'%} {% block content %}
BIO:{{writer.bio}}
{{writer.username| capitalize}} has no bio
No profile picture
{{current_user.username|upper}} POSTS AND COMMENTS:
comment:{{com.feedback}}


My Library - Add new book
First Document
Second Document
Author
Edgar Allan Poe
Mark Twain
Arthur Conan Doyle
Submit


Books
Much of Jellyfish's documentation is written as standalone books. Modeling with the System Descriptor provides a good introduction to the System Descriptor language.
--- restrictions: UNCLASSIFIED Copyright © 2018, Northrop Grumman Systems Corporation title: System Descriptor and Jellyfish Manuals and Books --- {% include base.html %}
Much of Jellyfish's documentation is written as standalone books. Modeling with the System Descriptor provides a good introduction to the System Descriptor language.


Sorry you don't have the permission required to access this page. Please contact the system administrator for more details.
In the meantime you can:
Go to the previous page LogoutSorry access to the system has been denied. Kindly request the system administrator to add an organisation to your profile
LogoutSorry access to the system has been denied. Kindly change your password before you can proceed
Change password


Evan is a drummer, artist, website constructor, and West Coast native.
He hasn't made a lot of websites, but that may change some day. For now he spends his time making music, learning HTML, playing gigs at weddings and dive bars, working full time at a grocery store, and reading about early retirement and discrete mathematics.
Check out his "work" below, or at any of the social media links above. Feel free to get in touch here with any inqueries regarding any of the aforementioned areas of activity.


TODO
title: On education credentials author: David Bruant layout: post permalink: /?p=257 categories:
- Uncategorized
Last year, at the Drumbeat Festival, I first heard of badges as a form of education credentials.
The initial assumption of most participants was that current education is broken. So is the diploma model. And badges were presented as one alternative.
It made its way to becoming OpenBadges and the recent launch of the Open Badge Infrastructure.
In plenty of occasions i try to engage people to make them think about education, skills, degrees and I discuss about badges. I would like to take an occasion to write about the common questions and comments I receive on these topics.
In this article, I will try to state the problem that badges are trying to address (focused only on hiring while i’m aware, badges are of interest beyond this single aspect), the current existing solution, its downfalls and try to explain how badges are not worse as some may think.
The problem of hiring
When it comes to hiring, the person who hires has an idea (sometimes not accurate enough, but that’s another issue I won’t go into now) of what the company needs in terms of skill. Before hiring an applicant, the recruiter needs to know whether the person fits the expectations.
The best way would certainly be to spend days, weeks, (months?) with each candidate, but this is unrealistic (in some way, that’s what trial period could be considered as). Recruiters aren’t an army, their time is limited, so choices have to be made. Based on what?
Usually, this falls under 2 categories: education and past professional experiences (other experiences for open minded recruiters). Experience mostly speaks for itself or can be explained through an interview. But for people without or with few experience, only education remains.
What does it mean to hire based on education?
If a recruiter has the time for one interview and has to choose between 2 candidates based on their education, the recruiter makes his choice not based on actual skill, but on expected skill for people having this diploma. Even more accurately, the choice is based on the trust the recruiter has on the institution delivering the degree.
But recruiters don’t know all universities, degrees, they don’t know the exact experience and curriculum someone who graduated from such or such school followed, so most of the time, the trust is not on the institution itself, but rather on the reputation of this institution.
Limitations of a diploma
Relying on reputation and trust has the immediate problem that the reputation could be false. Even if the reputation was right, the trust could be betrayed, because the students may graduate without filling all the requirements. For instance, students may cheat at exams. During team work, they may find teamates who’d do all the work and get the same grade in the end. We’ve also heard in the press of cases of people paying to get a degree, etc.
To be clear, I am not saying that all degrees are worthless, but only reminding that making a decision/judgement based on a degree is based on the trust one has on the delivering institution with the usual problem with trust which is that it may or may not be betrayed.
Besides the trust problem, a diploma, like a coin, is a symbol. A symbol of some skill set. One unfortunate aspect is that this symbol is a strong reduction of the set of skills it represents. Indeed, a diploma is a binary entity, either you have it or you don’t. Diploma lacks of information on what they represent exactly, but also lack of granularity.
Regarding this topic, I can’t help quoting Laura Hilliger’s excellent article
I have a BA in Digital Graphics and am earning a MA in Media and Education. What do you know about those degrees? Did you know that I took Statistics and did well? Or that I have taken 6 different Art History classes? Or what about that I won a debate on Human Sexuality in Primitive Cultures?
Problem of the “diploma-only” culture
Worse than the problem inherent to diplomas themselves is the culture around them which is that they are expected to be sufficient to know someone and make a decision based on it. This is problematic, because it forgets that learning happens outside of schools, outside of places where diplomas are delivered.  Both are completely false.
As I mentioned, this problem is cultural and not inherent to diploma. It may reproduce with badges.
Where badges come in
Badges aren’t a perfect one-fits-all solution. However, they try to address the different aforementioned problems.
Trust
In order to strengthen the trust a badge viewer can have on the badge, Mozilla’s open badges contain a link to how the badge was earned. This doesn’t solve the trust problem. This proof could be faked. If not fake, the person claiming the proof may not be the one who created it, etc. Since, like a diploma a badge is a symbol, there is a trust issue. But trying to provide a proof is a start to enforce the trust.
Badges offer a trust VS cost trade-off. In a blink you can see all badges but not verify that they’ve properly been earned. Or you can check the proof of each badge at the expense of spending time understanding how the badge got earned. In case the badge issuer is considered as trustworthy, trust can be delegated. This delegation is almost compulsory with diplomas, badges offer the choice.
It has to be noted that neither badges nor diploma are inherently more trustworthy. They just address the trust issue differently.
Granularity
Since they are defined by the issuer, badges are of arbitrary granularity. With the downside that work has to be done in order to determine the proper granularity and skills for each domain. In domains where badges would be too numerous, having “meta-badges” could be a good idea.
Once again, choice is offered by badges and come with a cost.
Questionning what is taken for granted
My take on “the current education system is broken” is more moderate than what I can be read in the open education community. But I’m glad an alternative exists. I’m glad my assumptions about education have been questionned. Badges, just by existsing as an alternative form of credentials force the questionning of the current system and everyone’s assumption on diploma and what they really mean.
Final thought on my own diploma
At the end of November, I will receive a diploma. A piece of paper I do not really care about to be honest. I remember the experiences, people I have met, discussions in or outside of class and it was a good experience, all what I’ve learned, technical or not. In a way, it’s unfortunate the piece of paper i’ll receive won’t represent any of that.
Conclusion
Despite the common belief, there is no reason to put more trust in diplomas delivered by universities than badges delivered by anyone else. Moreover, badges offer very pragramtic solutions to the issue of enforcing trust by showing a proof as well as a potentially better granularity. Of course, none of these benefits are free and will come with an additional effort on the badge issuers side and on the people who want to verify the trust they have on the badge. Like in many cases, badges and diploma aren’t better or worse but rather offer the potential of a trade-off and it is to the people who have to make the choice to carefully decide where they put their cursor.


mitochondrial DimB rRNA transcription Arabidopsis RNA DimA DNA proteins gene sequences sequence yeast protein plant using Biol. Figure promoter vitro amino human mitochondria {border-style Mol. coli factor mutant conserved methylation pKL- px;} #ffffff;} initiation polymerase bacterial promoters used acid analysis expression factors plants predicted Pfc animal dimB dimethylase indicated methyltransferase mtTFB plastidial templates KsgA Table activity atp- encoding phylogenetic RPOTm T-DNA adenosine dimethylases fungal primer ribosomal role Dim DimB, S). acids alignment described eukaryotic genes growth insertion linear modification phage-type polymerases recombinant shown supercoiled template Kühn data extension function genome nucleotides related respectively. set small thaliana Gray LINK McCulloch N-terminal Nucleic Plant RPOTmp adenine dimethylation dimethyltransferase functional lacking line presence previously px; reactions transit {font-family Acids Bayesian Cell. Chem. Falkenberg Genet. PCR Res. TFBM Weihe absence assays atp-- coding designated essential font-size group lack localization performed plastid position products recognition rrn- signal specificity structure targeting termination (a) (b) (see Cell EST Evol. Gaspari Gustafsson Lafontaine Mitochondrial Pfc; Tokuhisa according addition algorithms atp binding branch cDNA complementation constructs cost did dimethyltransferases double; employing experiments geneious green hisa nuclear possess results ribosome strains study tree wild-type (data Atg Börner GFP Information Liere Moreover, Ostreococcus Peeters Physcomitrella Promoter Saccharomyces Sci. Shadel Shutt analyses appears available based border-color border-width cells cerevisiae closely confocal control core dimethylase-like encoded end enzyme family fusion gap generated labelled length mammalian maximum mtTFBs nucleus observed proteins, protoplasts putative required revealed reverse rrn separated sequences. shown). shows similarity sites solid; specific subcellular subunit support transcriptional {font-style {font-weight (w/v) Arabidopsis. BL(DE) Burger Clayton Cotney DimA, DimB. DimB–GFP Drosophila EMBO Escherichia Figures Hedtke Jaehning, Larsson Magnoliophyta Matsunaga Matsushima Metodiev N-adenine Parisi Park Pfc-like PpDimA- Proteins RpoTm RpoTp Schinkel Science Selaginella Trends Yeast additional adenosines algae amplified analysed auxiliary bold characterization characterized common conditions containing correctly courier; development dimethyltransferases, diverse does early em; encodes end-labelled evidence evolution factor. fluorescence following fragments fused generate high higher homozygous however, identified implemented imported introduced ksgA laevis likelihood likely moellendorffii mt/pt mtTFBs. multiple obtained oligonucleotide order patens plants. plasmids potential processing product provided pt;} rRNA. regions single standard subunits suggesting supported thra translation trees type upstream vivo −DimB


This page allows you to create and edit users who will have access to
your PostgreSQL databases. For each user you can specify a username, an
optional password, an optional expiry date, and choose whether the user
will be allowed to create other users or databases.


Here, you can buy and sell any products you are interested in.
Do not make your item a garbage!
Thank you!


PANDA, Personal Automated Networked Drug Assistant, is a smart pill box that tells you when to take your medication and when not to. No longer will people have to ask, "Have I taken my medicine today?"


The mission of rescuing a kidnapped CIA agent from a lethal terrorist cell falls to an elite squad of Navy SEALs in this covert-action thriller.
8.9
89%
55%
- Starring:
- Roselyn Sanchez, Jason Cottle
- Directors:
- Mike McCoy, Scott Waugh
- Genre:
- Action & Adventure


![Gitter][Gitter](https://badges.gitter.im/Join Chat.svg)
Smart table is a table module for angular js. It allows you to quickly compose your table in a declarative way including sorting, filtering, row selection pagination. It is lightweight (around 3kb minified) and has no other dependencies than Angular itself. Check the documentation website for more details
Please be responsible, the open source community is not there to guess your problem or to do your job. When submitting an issue try as much as possible to:
search in the already existing issues or on stackoverflow if your issue has not been raised before.
give a precise description mentionning angular version, smart-table version.
give a way to reproduce your issue, the best would be with a running example, you can use plunkr (smart-table is the list of available packages). Note if you want to mimic ajax loading behaviour you can use $timeout angular service or $httpBackend.
isolate your code sample on the probable issue to avoid pollution and noise.
Close your issue when a solution has been found (and share it with the community)
Note that 80% of the open issues are actually not issues but “problem” due to developpers laziness or lack of investigation. These “issues” are a waste of time for us and especially if we have to setup a sample to reproduce the issue which those developpers could have done. Any open issue which does not fulfill this contract will be closed without investigation.
the easiest way is to run bower install angular-smart-table
, then you just have to add the script and register the module smart-table
to you application
run npm install
after you have installed the dependencies (npm install
and bower install
)
smart-table is based around a main directive which generate a top level controller whose API can be accessed by sub directives
(plugins), if you don’t need some of these, simply edit the gulpfile (the pluginList variable) and run gulp build
Smart-Table used to be configuration based and if you rely on this version, you can still access the code on the 0.2.x branch. You will be able to find the documentation related to this version here (simply open index.html in a browser).
Note, I have closed all the issues related to these versions as people get confused when reading these issues and commented on them like it was related to the newer version. Feel free to reopen any of them (or open a new one), but don’t forget to mention it is related to the older versions.
Smart Table module is under MIT license:
Copyright (C) 2014 Laurent Renard.
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the “Software”), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
 IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.


Kaijing holds a vision to educate, empower and drive people to achieve fullest financial potential and be in the psychological state of financial freedom.
Kaijing began the journey of financial planning from year 2004. Over past decade and a half we have completed personal financial planning of over 1500 families.
Our analysis of stock market has helped all our clients to fulfil their various needs. To name a few – Generate funds for education and marriage , Retirement corpus and it's management , accurate debt management to pave their road to Financial Freedom an a lot more to that!
Kaijing is one of the trusted name in the area of personal finance planning and management.
What we do?
Over 80% of the people on the globe have grown up with the thought process of “Money is the root cause of all evils in life” & “Money doesn’t grow on trees”. Being a part of this group who failed to achieve their fullest financial potential, he realised the secret psychology of Money and Success. That's how Financial Fitness came into existance.
It’s an oxygen zone situated in heart of Gagan Bawada - most beautiful taluka of Kolhapur.
O2 zone is clear title, collector approved non agriculture property. For details visit
Sahyadri is corporate farming company. This is a unique opportunity to earn handsome returns from green revolution.
Back to nature for profit and pleasure.
Storyline
Since year 2006, We have helped over 2500 people to achieve full financial potential and enjoy financial freedom.We have an approach of one to many. Through our personal financial planning sessions at Sakal Newspaper, Economic Times and various corporates, we have trained over 300,000 people. Association with us is not just about mutual fund investments, but we can work together in overall financial success of you and your family.


Last updated: 2018-01-29
Code version: cc871a3
MCMC (Markov Chain Monte Carlo) algorithm is used for sampling from a target distribution. Since we use markov chain, so we cannot sample independent samples as we did before. What we are going to do is to construct a markov chain to converge to target distribution as its stationary distribution. In general, this given distribution is usually posterior probability distribution in Baysian framework.
set.seed(1)
## plot convergence towards the true mean (red line at 0)
samples <- rnorm(10000, 0, 1);mean(samples);
[1] -0.006537039
cummean <- function(x)
cumsum(x) / seq_along(x)
plot(cummean(samples),type="l",xlab="Samples",ylab="Cumulative mean",
panel.first=abline(h=0, col="red"),las=1)
#Transforming the x axis onto a log scale and showing another 30 random approaches
plot(cummean(samples), type="l", xlab="Sample", ylab="Cumulative mean",
panel.first=abline(h=0, col="red"),las=1, log="x")
for (i in seq_len(30))
lines(cummean(rnorm(10000, 0, 1)),
col=rgb(runif(1), runif(1), runif(1), .5))
The Markov chain will have a stationary distribution if the process is irreducible (every state is visitable from every other state) and aperiodic (the number of steps between two visits of a state is not a fixed integer multiple number of steps).
#Stationary distributions.Let P be the transition probability matrix for the chain:
P=matrix(c(.5,.2,.25,.25,.1,.25,.25,.7,.5),ncol=3)
rowSums(P)#the rows sum to 1
[1] 1 1 1
colSums(P)#the columns do not necessarily sum to 1
[1] 0.95 0.60 1.45
iterate.P <- function(x, P, n)
{
res <- matrix(NA, n+1, length(x))
res[1,] <- x
for (i in seq_len(n))
res[i+1,] <- x <- x %*% P
res
}
n=10;
#y1 indicates that 100% probability of being in state 1 and no chance of being in any other states
y1 <- iterate.P(c(1, 0, 0), P, n)
y2 <- iterate.P(c(0, 1, 0), P, n)
y3 <- iterate.P(c(0, 0, 1), P, n)
y1
[,1] [,2] [,3]
[1,] 1.0000000 0.0000000 0.0000000
[2,] 0.5000000 0.2500000 0.2500000
[3,] 0.3625000 0.2125000 0.4250000
[4,] 0.3300000 0.2181250 0.4518750
[5,] 0.3215938 0.2172813 0.4611250
[6,] 0.3195344 0.2174078 0.4630578
[7,] 0.3190132 0.2173888 0.4635980
[8,] 0.3188839 0.2173917 0.4637245
[9,] 0.3188514 0.2173912 0.4637574
[10,] 0.3188433 0.2173913 0.4637654
[11,] 0.3188413 0.2173913 0.4637674
y2
[,1] [,2] [,3]
[1,] 0.0000000 1.0000000 0.0000000
[2,] 0.2000000 0.1000000 0.7000000
[3,] 0.2950000 0.2350000 0.4700000
[4,] 0.3120000 0.2147500 0.4732500
[5,] 0.3172625 0.2177875 0.4649500
[6,] 0.3184263 0.2173319 0.4642419
[7,] 0.3187400 0.2174002 0.4638598
[8,] 0.3188150 0.2173900 0.4637951
[9,] 0.3188342 0.2173915 0.4637742
[10,] 0.3188390 0.2173913 0.4637697
[11,] 0.3188402 0.2173913 0.4637685
y3
[,1] [,2] [,3]
[1,] 0.0000000 0.0000000 1.0000000
[2,] 0.2500000 0.2500000 0.5000000
[3,] 0.3000000 0.2125000 0.4875000
[4,] 0.3143750 0.2181250 0.4675000
[5,] 0.3176875 0.2172813 0.4650313
[6,] 0.3185578 0.2174078 0.4640344
[7,] 0.3187691 0.2173888 0.4638421
[8,] 0.3188228 0.2173917 0.4637855
[9,] 0.3188361 0.2173912 0.4637726
[10,] 0.3188395 0.2173913 0.4637692
[11,] 0.3188403 0.2173913 0.4637684
matplot(0:n, y1, type="l", lty=1, xlab="Step", ylab="y", las=1)
matlines(0:n, y2, lty=2)
matlines(0:n, y3, lty=3)
#regardless where it started,y1,y2and y3 indicate 32% chance to converge to state1,22% chance to state2,46% chance to state3
A sufficient (but not necessary) condition for the existance of a stationary distribution is Detailed Balance,which implies this markov chain is reversible.
In following 1D problem, core function is step() and run().
p <- 0.4
mu <- c(-1, 2)
sd <- c(.5, 2)
f <- function(x)
p * dnorm(x, mu[1], sd[1]) +
(1-p) * dnorm(x, mu[2], sd[2])
curve(f(x),las=1,col="red",-4,8,n=300)
q <- function(x) rnorm(1, x, 4)
step <- function(x,f,q){
xp=q(x)
alpha=min(1,f(xp)/f(x))
if(runif(1)<alpha)
x=xp
x
}
run <- function(x,f,q,nsteps){
res <- matrix(NA,nrow=nsteps,ncol=length(x))
for(i in 1:nsteps)
res[i,] <- x <- step(x,f,q)
drop(res)}
res <- run(-10,f,q,1000)
hist(res,50,freq=F,xlab="x",ylab="probability density",xlim=c(-10, 8), ylim=c(0, .35),las=1)
z <- integrate(f,-Inf,Inf)$value;###z=1
curve(f(x)/z,add=T,col="red",n=300)
If p is the frequency of the allele A then the genotypes AA, Aa and aa will have frequencies p^2, 2p(1-p) and (1-p)*(1-p). A simple prior for p is to assume it is uniform on [0,1].
Suppose that we sample n individuals, and observe nAA with genotype AA,nAa with genotype Aa and naa with genotype aa. In our example,nAA = 50, nAa = 21, naa=29. Therefore, we observed 121 As, and 79 as, out of 200, the theoretical posterior p is beta(121+1,79+1).
prior=function(p){
if (p>1|| p<0)
return(0)
else
return(1)
}
likelihood=function(p,nAA,nAa,naa){
return(p^(2*nAA) * (2*p*(1-p))^nAa * (1-p)^(2*naa))
}
easyMCMC=function(niter,pinitial,proposesd,nAA,nAa,naa)
{
p=rep(0,niter)
p[1]=pinitial
for (i in 2:niter)
{
newp=p[i-1]+rnorm(1,0,proposesd)
alpha=prior(newp)*likelihood(newp,nAA,nAa,naa)/(prior(p[i-1])*likelihood(p[i-1],nAA,nAa,naa))
if (runif(1)<alpha)
p[i]=newp
else
p[i]=p[i-1]
}
return(p)
}
sample_p=easyMCMC(10000,0.5,0.01,50,21,29)
x=seq(0,1,length=1000)
hist(sample_p[3001:10000],prob=T,las=1,breaks=50,main="Histogram of sample p")###discard the first 3000 p's as "burnin"
lines(x,dbeta(x,122,80),col="red")
trueA <- 5
trueB <- 0
trueSd <- 10
sampleSize <- 31
x <- (-(sampleSize-1)/2):((sampleSize-1)/2)# create independent x-values
y <- trueA * x + trueB + rnorm(n=sampleSize,mean=0,sd=trueSd)# create dependent y according to ax + b + N(0,sd)
plot(x,y, main="Test Data",type="p")
likelihood <- function(param){
a = param[1]
b = param[2]
sd = param[3]
pred = a*x + b
singlelikelihoods = dnorm(y, mean = pred, sd = sd, log = T)
sumll = sum(singlelikelihoods)
return(sumll)
}
prior <- function(param){
a = param[1]
b = param[2]
sd = param[3]
aprior = dunif(a, min=0, max=10, log = T)
bprior = dnorm(b, sd = 5, log = T)
sdprior = dunif(sd, min=0, max=30, log = T)
return(aprior+bprior+sdprior)
}
posterior <- function(param){
return (likelihood(param) + prior(param))
}
proposalfunction <- function(param){
return(rnorm(3,mean = param, sd= c(0.1,0.5,0.3)))
}
run_metropolis_MCMC <- function(startvalue, iterations){
chain = array(dim = c(iterations+1,3))
chain[1,] = startvalue
for (i in 1:iterations){
proposal = proposalfunction(chain[i,])
probab = exp(posterior(proposal) - posterior(chain[i,]))
if (runif(1) < probab){
chain[i+1,] = proposal
}else{
chain[i+1,] = chain[i,]
}
}
return(chain)
}
startvalue = c(4,0,10)
chain = run_metropolis_MCMC(startvalue, 10000)
burnIn = 5000
acceptance = 1-mean(duplicated(chain[-(1:burnIn),]))
par(mfrow = c(2,3))
hist(chain[-(1:burnIn),1],nclass=30,main="Posterior of a", xlab="True value = red line" )
abline(v = mean(chain[-(1:burnIn),1]))
abline(v = trueA, col="red" )
hist(chain[-(1:burnIn),2],nclass=30, main="Posterior of b", xlab="True value = red line")
abline(v = mean(chain[-(1:burnIn),2]))
abline(v = trueB, col="red" )
hist(chain[-(1:burnIn),3],nclass=30, main="Posterior of sd", xlab="True value = red line")
abline(v = mean(chain[-(1:burnIn),3]) )
abline(v = trueSd, col="red" )
plot(chain[-(1:burnIn),1], type = "l", xlab="True value = red line" , main = "Chain values of a" )
abline(h = trueA, col="red" )
plot(chain[-(1:burnIn),2], type = "l", xlab="True value = red line" , main = "Chain values of b")
abline(h = trueB, col="red" )
plot(chain[-(1:burnIn),3], type = "l", xlab="True value = red line" , main = "Chain values of sd")
abline(h = trueSd, col="red" )
1.tutorial link:What is MCMC and when would you use it?
2.stephens999 github:mcmc examples
3.Florian Hartig: A simple Metropolis-Hastings MCMC in R
sessionInfo()
R version 3.4.2 (2017-09-28)
Platform: x86_64-apple-darwin15.6.0 (64-bit)
Running under: macOS Sierra 10.12.1
Matrix products: default
BLAS: /Library/Frameworks/R.framework/Versions/3.4/Resources/lib/libRblas.0.dylib
LAPACK: /Library/Frameworks/R.framework/Versions/3.4/Resources/lib/libRlapack.dylib
locale:
[1] zh_CN.UTF-8/zh_CN.UTF-8/zh_CN.UTF-8/C/zh_CN.UTF-8/zh_CN.UTF-8
attached base packages:
[1] stats graphics grDevices utils datasets methods base
loaded via a namespace (and not attached):
[1] compiler_3.4.2 backports_1.1.2 magrittr_1.5 rprojroot_1.3-2
[5] tools_3.4.2 htmltools_0.3.6 yaml_2.1.16 Rcpp_0.12.14
[9] stringi_1.1.6 rmarkdown_1.8 knitr_1.18 git2r_0.21.0
[13] stringr_1.2.0 digest_0.6.14 evaluate_0.10.1
This R Markdown site was created with workflowr


Vaccination Schedule
id :{{id}}
Hospital :{{loc}}
Date and Time :{{time_prompt}}
Use this QR Code to check in when you arrive in the hospital
Hospital Location


| < Day Day Up > |
5.3. Printing from EmacsEmacs offers several commands for printing buffers and regions. To print a buffer with page numbers and headers for the filename, type M-x print-buffer Enter. This command sends the buffer to pr (a program that does simple formatting for listings), followed by lpr (which sends the listing to the printer). If you want to print the file directly, without the headers and page numbers that pr provides, give the command M-x lpr-buffer Enter. You can also use these commands to print a selected portion of a file. First define a region by setting a mark at one end and moving the cursor to the other end. Then give the command M-x print-region Enter (or M-x lpr-region Enter). The lpr-buffer and lpr-region commands always check the variable lpr-switches to determine whether any options should be passed to the Unix lpr command. These options are used to request a particular printer and for many other purposes; see the manpage for lpr for more information. For example, if you want to use the printer named lpt1 whenever you print from Emacs, you would want to set lpr-switches to -Plpt1. To do so, add the following line to your .emacs file: (setq lpr-switches '("-Plpt1")) Note the single quote preceding, and the parentheses surrounding, the string "-Plpt1". This is just weird-but-necessary Lisp syntax; see Chapter 11 for more details. You can also print from Dired. To print the file the cursor is on, type P. Emacs puts the default printing command in the minibuffer, and you can modify it. Emacs also includes commands to print a buffer as a PostScript file. If you have formatted text in the file, you can print the buffer with those attributes by typing M-x ps-print-buffer-with-faces. Table 5-3 provides a summary of commands for printing.
|
| < Day Day Up > |


DownloadStatusListner
public protocol DownloadStatusListner : AnyObject
Observer for Downloadable
retrieving progress
-
Next data chunk is downloaded
Declaration
Swift
func downloadProgressUpdated(progress: FileDownloadProgress)
Parameters
progress
object downloading progress struct
-
Called when
Downloadable
is being started to downloadDeclaration
Swift
func downloadBegan()
-
Called when downloading is successfully finished
Declaration
Swift
func downloadFinished()
-
Called when downloading failed
Declaration
Swift
func downloadFailed(_ error: Error)
Parameters
error
reason of failure


Meghalaya State is one of the most visited destinations of northeast India due to its diversity. Meghalaya is one among the Seven Sisters of the NorthEast.The place focussing in this video is Mawryngkhang Located in Wahkhen,Shillong-Dawki road.Mawryngkhang Trek also known as the trek to the legendary King of Stones of Meghalaya.It is not only considered as the scariest trek of Meghalaya but it is also famous for the story behind it.This trek is not so popular and also not known to many people. This trek involves walking on the bamboo bridges over deep gorges and broomstick farms. It is a moderate trek that changes to a difficult on in the end.
Mawlynnong, located in Meghalaya, is called “God’s own Garden” and has enough reasons for that. It was awarded the title “cleanest village in Asia” by Discover India in 2003. Cleanliness must be its most important aspect, but it has achieved so much more than that. From a full hundred percent literacy rate to a highly progressive scenario for women, it has struck all the correct chords.Mawlynnong has a pleasant weather all throughout the year. Nevertheless, It’s best time to visit is in the monsoons.
Wah rymben is a tourist place in Lapalang Village,near Pynursla,Shillong,Meghalaya.
Also known as Wah Rymben Falls, it is formed over Rymben River. It is not so popular among tourists as it is hidden in the dense forests of East Khasi Hills. The waterfalls and its surrounding are very calm & quiet. One can spend some quality time amidst the nature. The falls is at its best during monsoon but be careful while entering into the waters.As it is hidden in the dense forests, one needs to trek about 30 minutes to reach the falls from Lapalang village.


Editor
List of posts
Login page
Contact developer
Title:
Tag:
Cover image URL:
B
I
U
Export to md
----------------- File name:
Content:
Copy to clipboard
Create new post now


Home
About
Products
Blog
Vlog
Feedback
Novice Hacks!
Hacks, Tips, Tricks and Solutions for Novice Programmers


Please enter a start time for the meeting:
Invalid time: the time must be between 9:00 AM and 5:00 PM"
Please enter a start time for the meeting:
Invalid time: the time must be between 9:00 AM and 5:00 PM"
Please enter a start time for the meeting:
Invalid time: the time must be between 9:00 AM and 5:00 PM"
Please enter a start time for the meeting:


Converts the given (lon, lat) point in WGS84 to (x, y) in EPSG:900913.
The origin of the converted point (x, y) is at the middle-left corner.
The meters can be the same instance that is passed in as the lonlat.
Converts EPSG:900913 to pyramid pixel coordinates in given zoom level.
The origin of the pixels is the top-left corner.
The pixels can be the same instance that is passed in as the meters.
Converts pixel coordinates in given zoom level of pyramid to EPSG:900913.
The origin of the pixels is the top-left corner.
The meters can be the same instance that is passed in as the pixels.
Returns a tile covering region in given pixel coordinates.
The origin of the tile is the top-left corner.
The tile can be the same instance that is passed in as the pixels.
Converts the given (lon, lat) point in WGS84 to (x, y) in EPSG:900913. The origin of the converted point (x, y) is at the middle-left corner. The
meters
can be the same instance that is passed in as thelonlat
.https://www.maptiler.com/google-maps-coordinates-tile-bounds-projection/
https://qiita.com/MALORGIS/items/1a9114dd090e5b891bf7


#include <Power.h>
|
| std::ostream & | print (std::ostream &sink) const override |
| |
◆ Power() [1/3]
◆ Power() [2/3]
| symcpp::Power::Power |
( |
const Expression & |
a, |
|
|
double |
p |
|
) |
| |
◆ Power() [3/3]
| symcpp::Power::Power |
( |
const std::unique_ptr< Expression > & |
a, |
|
|
const std::unique_ptr< Expression > & |
b |
|
) |
| |
◆ const_eval()
| double symcpp::Power::const_eval |
( |
| ) |
const |
|
overridevirtual |
◆ copy()
| std::unique_ptr< Expression > symcpp::Power::copy |
( |
| ) |
const |
|
overridevirtual |
◆ diff()
| std::unique_ptr< Expression > symcpp::Power::diff |
( |
std::string |
var | ) |
const |
|
overridevirtual |
◆ is_constant()
| bool symcpp::Power::is_constant |
( |
| ) |
const |
|
overridevirtual |
◆ precedence()
| unsigned int symcpp::Power::precedence |
( |
| ) |
const |
|
overridevirtual |
◆ print()
| std::ostream & symcpp::Power::print |
( |
std::ostream & |
sink | ) |
const |
|
overrideprivatevirtual |
◆ simplify()
| std::unique_ptr< Expression > symcpp::Power::simplify |
( |
| ) |
|
|
overridevirtual |
◆ subs()
| double symcpp::Power::subs |
( |
const std::unordered_map< std::string, double > & |
env | ) |
const |
|
overridevirtual |
The documentation for this class was generated from the following files:


mysqli::$affected_rows
mysqli_affected_rows
(PHP 5, PHP 7)
mysqli::$affected_rows -- mysqli_affected_rows — Gets the number of affected
rows in a previous MySQL operation
说明
面向对象风格
int $mysqli->affected_rows;
过程化风格
int mysqli_affected_rows ( mysqli $link )
Returns the number of rows affected by the last INSERT, UPDATE, REPLACE or
DELETE query.
For SELECT statements mysqli_affected_rows() works like mysqli_num_rows().
参数
link
仅以过程化样式：由mysqli_connect() 或 mysqli_init() 返回的链接标识。
返回值
An integer greater than zero indicates the number of rows affected or
retrieved. Zero indicates that no records were updated for an UPDATE statement,
no rows matched the WHERE clause in the query or that no query has yet been
executed. -1 indicates that the query returned an error.
Note:
If the number of affected rows is greater than the maximum integer value(
PHP_INT_MAX ), the number of affected rows will be returned as a string.
范例
Example #1 $mysqli->affected_rows example
面向对象风格
query("CREATE TABLE Language SELECT * from CountryLanguage");
printf("Affected rows (INSERT): %d\n", $mysqli->affected_rows);
$mysqli->query("ALTER TABLE Language ADD Status int default 0");
/* update rows */
$mysqli->query("UPDATE Language SET Status=1 WHERE Percentage > 50");
printf("Affected rows (UPDATE): %d\n", $mysqli->affected_rows);
/* delete rows */
$mysqli->query("DELETE FROM Language WHERE Percentage < 50");
printf("Affected rows (DELETE): %d\n", $mysqli->affected_rows);
/* select all rows */
$result = $mysqli->query("SELECT CountryCode FROM Language");
printf("Affected rows (SELECT): %d\n", $mysqli->affected_rows);
$result->close();
/* Delete table Language */
$mysqli->query("DROP TABLE Language");
/* close connection */
$mysqli->close();
?>
过程化风格
50");
printf("Affected rows (UPDATE): %d\n", mysqli_affected_rows($link));
/* delete rows */
mysqli_query($link, "DELETE FROM Language WHERE Percentage < 50");
printf("Affected rows (DELETE): %d\n", mysqli_affected_rows($link));
/* select all rows */
$result = mysqli_query($link, "SELECT CountryCode FROM Language");
printf("Affected rows (SELECT): %d\n", mysqli_affected_rows($link));
mysqli_free_result($result);
/* Delete table Language */
mysqli_query($link, "DROP TABLE Language");
/* close connection */
mysqli_close($link);
?>
以上例程会输出：
Affected rows (INSERT): 984
Affected rows (UPDATE): 168
Affected rows (DELETE): 815
Affected rows (SELECT): 169
参见
• mysqli_num_rows() - Gets the number of rows in a result
• mysqli_info() - Retrieves information about the most recently executed
query
User Contributed Notes 7 notes
===============================================================================
On "INSERT INTO ON DUPLICATE KEY UPDATE" queries, though one may expect
affected_rows to return only 0 or 1 per row on successful queries, it may in
fact return 2.
From Mysql manual: "With ON DUPLICATE KEY UPDATE, the affected-rows value per
row is 1 if the row is inserted as a new row and 2 if an existing row is
updated."
See: http://dev.mysql.com/doc/refman/5.0/en/insert-on-duplicate.html
Here's the sum breakdown _per row_:
+0: a row wasn't updated or inserted (likely because the row already existed,
but no field values were actually changed during the UPDATE)
+1: a row was inserted
+2: a row was updated
===============================================================================
If you need to know specifically whether the WHERE condition of an UPDATE
operation failed to match rows, or that simply no rows required updating you
need to instead check mysqli::$info.
As this returns a string that requires parsing, you can use the following to
convert the results into an associative array.
Object oriented style:
info, $matches);
$info = array_combine ($matches[1], $matches[2]);
?>
Procedural style:
You can then use the array to test for the different conditions
This approach can be used with any query that mysqli::$info supports (INSERT
INTO, LOAD DATA, ALTER TABLE, and UPDATE), for other any queries it returns an
empty array.
For any UPDATE operation the array returned will have the following elements:
Array
(
[Rows matched] => 1
[Changed] => 0
[Warnings] => 0
)
===============================================================================
"Zero indicates that no records where updated for an UPDATE statement, no rows
matched the WHERE clause in the query or that no query has yet been executed."
what if i need to know which one of the three occurred? It's dumb that there is
no distinction between the three.
===============================================================================
empty($db->affected_rows) will return TRUE even if affected_rows is greater
than 0.  WHERE
username='wjw6349'");
// $stmt->bind_param('s',$email);
// $stmt->execute();
// $stmt->close();
if ($mysqli->connect_error){
echo("Connect failed: ".mysqli_connect_error()); exit();
}
$querySelect = "SELECT * FROM j_user";
$resultSet = $mysqli->query($querySelect);
if($resultSet->num_rows > 0){
while($row = $resultSet->fetch_assoc()){
foreach($row as $fieldValue){
$bigString .= "$fieldValue
\n";
}
$bigString .= "


Railroad Game Calculator
Car Route Length:
1 Car Routes:
(x1)
2 Car Routes:
(x2)
3 Car Routes:
(x4)
0
1
2
3
4
5
6
4 Car Routes:
(x7)
0
1
2
3
4
5
6
5 Car Routes:
(x10)
0
1
2
3
4
5
6
6 Car routes:
(x15)
0
1
2
3
4
5
6
Longest Route:
+10 For Longest Route
Destination Scores:
Update Score
Reset Scores


Projects based on the Maven - Java project management and project comprehension tool. See http://maven.apache.org for details.


The Counter component is a simple counter. Supports up and down counting for arbitrary bit sizes. C is the count output. The optional UP input controls the counting direction. True means up counting. If not connected, the counter counts up. The counter increments or decrements on the clock leading edge.
The R input is a reset. When high, the counter is reset to zero.
The current value of the counter is indicated on the component.


Next: Examples of Printing Arrays, Previous: Printing Other Vectors, Up: Default Print-Object Methods
If *print-array* is true and *print-readably* is false, any
array other than a vector is printed using #nA format. Let n be the rank of the array. Then # is printed, then n as a decimal integer, then A, then n open parentheses. Next the elements are scanned in row-major order, using write on each element, and separating elements from each other with whitespace_1. The array’s dimensions are numbered 0 to n-1 from left to right, and are enumerated with the rightmost index changing fastest. Every time the index for dimension j is incremented, the following actions are taken:
If j < n-1, then a close parenthesis is printed.
If incrementing the index for dimension j caused it to equal dimension j, that index is reset to zero and the index for dimension j-1 is incremented (thereby performing these three steps recursively), unless j=0, in which case the entire algorithm is terminated. If incrementing the index for dimension j did not cause it to equal dimension j, then a space is printed.
If j < n-1, then an open parenthesis is printed.
This causes the contents to be printed in a format suitable for :initial-contents to make-array. The lists effectively printed by this procedure are subject to truncation by *print-level* and *print-length*.
If the array is of a specialized type, containing bits or characters, then the innermost lists generated by the algorithm given above can instead be printed using bit-vector or string syntax, provided that these innermost lists would not be subject to truncation by *print-length*.
If both *print-array* and *print-readably* are false,
then the array is printed in a format (using #<) that is concise but not readable.
If *print-readably* is true, the array prints in an implementation-defined manner; see the variable *print-readably*.
In particular, this may be important for arrays having some dimension 0.
For information on how the Lisp reader parses these "other arrays," see Sharpsign A.
Next: Examples of Printing Arrays, Previous: Printing Other Vectors, Up: Default Print-Object Methods


|
||||||||||
| PREV NEXT | FRAMES NO FRAMES |
| Packages that use soot.tagkit | |
|---|---|
| soot | Base Soot classes, shared by different intermediate representations. |
| soot.baf | Public classes for the Baf intermediate representation. |
| soot.baf.internal | Internal, messy, implementation-specific classes for the Baf intermediate representation. |
| soot.dava | |
| soot.dava.internal.AST | |
| soot.dava.internal.javaRep | |
| soot.grimp | Public classes for the Grimp intermediate representation. |
| soot.grimp.internal | Internal, messy, implementation-specific classes for the Grimp intermediate representation. |
| soot.javaToJimple | |
| soot.jimple | Public classes for the Jimple intermediate representation. |
| soot.jimple.internal | Internal, messy, implementation-specific classes for the Jimple intermediate representation. |
| soot.jimple.spark | |
| soot.jimple.spark.fieldrw | |
| soot.jimple.spark.pag | |
| soot.jimple.toolkits.annotation.j5anno | |
| soot.jimple.toolkits.annotation.tags | Tags and aggregators to store and combine information about array bounds and null pointer checks. |
| soot.jimple.toolkits.base | A toolkit to optimize the Jimple IR. |
| soot.jimple.toolkits.pointer | |
| soot.jimple.toolkits.thread.mhp.stmt | |
| soot.shimple | Public classes for the SSA Shimple intermediate representation. |
| soot.shimple.internal | Shimple internal messy stuff. |
| soot.tagkit | Classes supporting classfile annotation in Soot. |
| soot.toolkits.scalar | A number of scalar optimizations, and the flow analysis framework. |
| soot.xml |
| Classes in soot.tagkit used by soot | |
|---|---|
| AbstractHost
This class is the reference implementation for the Host interface, which allows arbitrary taggable data to be stored with Soot objects. |
|
| Host
A "taggable" object. |
|
| InnerClassTagAggregator
The aggregator for LineNumberTable attribute. |
|
| LineNumberTagAggregator
The aggregator for LineNumberTable attribute. |
|
| TagManager
Utility functions for tags. |
| Classes in soot.tagkit used by soot.baf | |
|---|---|
| AbstractHost
This class is the reference implementation for the Host interface, which allows arbitrary taggable data to be stored with Soot objects. |
|
| Host
A "taggable" object. |
| Classes in soot.tagkit used by soot.baf.internal | |
|---|---|
| AbstractHost
This class is the reference implementation for the Host interface, which allows arbitrary taggable data to be stored with Soot objects. |
|
| Host
A "taggable" object. |
| Classes in soot.tagkit used by soot.dava | |
|---|---|
| AbstractHost
This class is the reference implementation for the Host interface, which allows arbitrary taggable data to be stored with Soot objects. |
|
| Host
A "taggable" object. |
| Classes in soot.tagkit used by soot.dava.internal.AST | |
|---|---|
| AbstractHost
This class is the reference implementation for the Host interface, which allows arbitrary taggable data to be stored with Soot objects. |
|
| Host
A "taggable" object. |
| Classes in soot.tagkit used by soot.dava.internal.javaRep | |
|---|---|
| AbstractHost
This class is the reference implementation for the Host interface, which allows arbitrary taggable data to be stored with Soot objects. |
|
| Host
A "taggable" object. |
| Classes in soot.tagkit used by soot.grimp | |
|---|---|
| AbstractHost
This class is the reference implementation for the Host interface, which allows arbitrary taggable data to be stored with Soot objects. |
|
| Host
A "taggable" object. |
| Classes in soot.tagkit used by soot.grimp.internal | |
|---|---|
| AbstractHost
This class is the reference implementation for the Host interface, which allows arbitrary taggable data to be stored with Soot objects. |
|
| Host
A "taggable" object. |
| Classes in soot.tagkit used by soot.javaToJimple | |
|---|---|
| Host
A "taggable" object. |
| Classes in soot.tagkit used by soot.jimple | |
|---|---|
| AbstractHost
This class is the reference implementation for the Host interface, which allows arbitrary taggable data to be stored with Soot objects. |
|
| Host
A "taggable" object. |
| Classes in soot.tagkit used by soot.jimple.internal | |
|---|---|
| AbstractHost
This class is the reference implementation for the Host interface, which allows arbitrary taggable data to be stored with Soot objects. |
|
| Host
A "taggable" object. |
| Classes in soot.tagkit used by soot.jimple.spark | |
|---|---|
| Host
A "taggable" object. |
|
| Tag
Represents a tag; these get attached to implementations of Host. |
| Classes in soot.tagkit used by soot.jimple.spark.fieldrw | |
|---|---|
| ImportantTagAggregator
A tag aggregator that associates a tag with the most important instruction that is tagged with it. |
|
| Tag
Represents a tag; these get attached to implementations of Host. |
|
| TagAggregator
Interface to aggregate tags of units. |
| Classes in soot.tagkit used by soot.jimple.spark.pag | |
|---|---|
| Tag
Represents a tag; these get attached to implementations of Host. |
| Classes in soot.tagkit used by soot.jimple.toolkits.annotation.j5anno | |
|---|---|
| AnnotationElem
Represents the base class of annotation elements each annotation can have several elements for Java 1.5. |
|
| Host
A "taggable" object. |
| Classes in soot.tagkit used by soot.jimple.toolkits.annotation.tags | |
|---|---|
| Tag
Represents a tag; these get attached to implementations of Host. |
|
| TagAggregator
Interface to aggregate tags of units. |
| Classes in soot.tagkit used by soot.jimple.toolkits.base | |
|---|---|
| SourceLnPosTag
|
| Classes in soot.tagkit used by soot.jimple.toolkits.pointer | |
|---|---|
| Attribute
Tags that are attached to the class file, field, method, or method body should implement this interface. |
|
| ImportantTagAggregator
A tag aggregator that associates a tag with the most important instruction that is tagged with it. |
|
| Tag
Represents a tag; these get attached to implementations of Host. |
|
| TagAggregator
Interface to aggregate tags of units. |
| Classes in soot.tagkit used by soot.jimple.toolkits.thread.mhp.stmt | |
|---|---|
| AbstractHost
This class is the reference implementation for the Host interface, which allows arbitrary taggable data to be stored with Soot objects. |
|
| Host
A "taggable" object. |
| Classes in soot.tagkit used by soot.shimple | |
|---|---|
| AbstractHost
This class is the reference implementation for the Host interface, which allows arbitrary taggable data to be stored with Soot objects. |
|
| Host
A "taggable" object. |
| Classes in soot.tagkit used by soot.shimple.internal | |
|---|---|
| AbstractHost
This class is the reference implementation for the Host interface, which allows arbitrary taggable data to be stored with Soot objects. |
|
| Host
A "taggable" object. |
| Classes in soot.tagkit used by soot.tagkit | |
|---|---|
| AnnotationElem
Represents the base class of annotation elements each annotation can have several elements for Java 1.5. |
|
| AnnotationTag
Represents the annotation attribute attatched to a class, method, field, method param - they could have many annotations each for Java 1.5. |
|
| Attribute
Tags that are attached to the class file, field, method, or method body should implement this interface. |
|
| AttributeValueException
|
|
| ConstantValueTag
|
|
| FirstTagAggregator
A tag aggregator that associates a tag with the first instruction that is tagged with it. |
|
| Host
A "taggable" object. |
|
| InnerClassTagAggregator
The aggregator for LineNumberTable attribute. |
|
| JasminAttribute
This class must be extended by Attributes that can be emitted in Jasmin. |
|
| LineNumberTagAggregator
The aggregator for LineNumberTable attribute. |
|
| PositionTag
|
|
| SignatureTag
Represents the signature attribute used by fields, methods and classes for dealing with generics in Java 1.5. |
|
| SourceLnPosTag
|
|
| StringTag
Represents a tag that just has a string to be printed with the code. |
|
| SyntheticParamTag
Represents the synthetic attribute. |
|
| Tag
Represents a tag; these get attached to implementations of Host. |
|
| TagAggregator
Interface to aggregate tags of units. |
|
| TagManager
Utility functions for tags. |
|
| TagPrinter
Interface to allow display of tags. |
|
| VisibilityAnnotationTag
Represents the visibility of an annotation attribute attatched to a class, field, method or method param (only one of these each) has one or more annotations for Java 1.5. |
| Classes in soot.tagkit used by soot.toolkits.scalar | |
|---|---|
| AbstractHost
This class is the reference implementation for the Host interface, which allows arbitrary taggable data to be stored with Soot objects. |
|
| Host
A "taggable" object. |
| Classes in soot.tagkit used by soot.xml | |
|---|---|
| Tag
Represents a tag; these get attached to implementations of Host. |
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES |


Automation engineer with 25+ years experience in IT as developer , systems analyst, consulting, solution architect, project manager and operations manager. 15 years in financial industry, as a solutions architect, specialist in EDM, BPM, distributed applications and backoffice solutions for bank. 8 years as solutions architect, project manager and operation manager for insurance and private pensions solutions, with solutions deployed in Brazil, China and India, responsible for architecture, development, delivery and support. Project manager for ERP in a variety of industries, including chemical, electronics, health and financial. Since 2009 at IBM as Cloud Technology Leader for Latin America, specialist in cloud computing, cognitive computing and Internet of Things.
Today is the main evangelist of IBM Latin America for platform of digital innovation, acting as speaker in the main events, conferences and congress in Brazil and abroad, in companies and universities, also acts as mentor for hackathons, accelerators and incubators in Latin America.
As developer specialist is the main evangelist in LA for AI, Cognitive solutions, Data Scients, Cloud Computing and IoT. Speaker in events and conferences in universities an events, in Brazil and abroad.
Part of WW team, is Responsible for enablement and engagement of PaaS, IaaS and Mobile for ecosystem of developers of Latin America.
As Technology Executive, I aim to support and assist partners, ISVs (Independent Software Vendor), in architecture and development planning solutions, as well as the strategy and business model to go to market. Already as IBM Innovation Center Manager, is responsible for providing technological resources, HW, SW and technical support through IBM experts in Brazil and abroad, for partners in order to promote the qualification, approval and development of events within IBM .
As Project Manager I was responsible for IFRS Project - Modeling and Developing product to attend IFRS in Brazil and Latin America for banks and insurance company. The project has participation of SAP Brazil and SAP AG, and will be based on SAP Bank Analyzer AFI product.
Architectural development of AML & ATF solution. This solution has the capabilities to detect, prevent and investigate any transaction (financial movements), trough a integration BUS, engine of rules, software of analytic identity to guarantee KYC and entities relationship, watchlist and blacklist, and PEP (politically exposed person), and finally the cases are investigate trough Intelligence Analysis Platform, which give the possibility of visual operational analysis.
Implementation of a Cloud Lab at USP Sao Paulo, with the objective to provide technologies resources to research and experiences in cloud technology, for professors and employees, as well as for GIS research.
The architectural is based on blade center with blades X, and it is managed trough the software SCP (Smart Cloud Provisioning).
Implementation of a Cloud Lab at USP Sao Paulo, with the objective to provide technologies resources to research and experiences in cloud technology, for professors and employees. The architectural is based on blade center with blades X, and it is managed trough the software SCP (Smart Cloud Provisioning).
The Rio de Janeiro Operations Center integrates and interconnects information from various public bodies of the municipality to improve the responsiveness of the Municipality in relation to various incidents such as floods and landslides. The agreement between IBM and city also plans to develop a pioneering system of Meteorology Forecast with High Resolution (PMAR), which can provide heavy rains of up to 48 hours in advance.


Landing Page
Special Projects
This story is part of a series of specially designed stories that represents some of the best journalism The Post has to offer. Check out the rest of the special projects here.
05.31.18
Welcome to orientation. And more importantly, welcome to your new home.
In my own case, I remember freshman orientation as overwhelming, to put it lightly. The showers were too cold and claustrophobic, the salad bar at Shively seemed impressive but a bit intimidating, and the thought of staring out the window of a single dorm room alone brought tears to my eyes as I tried to fall asleep in Washington Hall. I was feeling more than a little lost.
Orientation, I’ve realized, can be a sobering time.
Don’t get me wrong — it’s the beginning of what will end up being four of the best years of your life (something your parents will never let you forget). But, it’s also a moment of clarity and realization.  You may be thousands of miles from home, stranded in a new place full of strange faces and lofty expectations.
But I’ll let you in on a secret: it’s all going to be okay.
These tree-lined streets will become more and more familiar. You might get lost on your first day of classes, but after a week of stumbling around Seigfred, you’ll know your schedule like clockwork. The dining hall food won’t make you pine for mom’s cooking, and after a few instances of accidentally referring to Athens as “home,” you’ll actually start to mean it.
As much as it pains me to write this, your first year on campus will be my last, and to say that I’m envious of you would be an understatement. This year, and the three that follow, will fly by, and before you know it you’ll be a curmudgeonly senior like myself, writing columns to remind freshmen to “make the most of every moment.”
My hope is that The Post will be a lighthouse to guide you through your freshman year and beyond — as we have been for more than 100 years. Follow us @ThePost on Twitter, sign up for Post Haste, our daily newsletter, and make sure to grab a copy of our print edition each Thursday. We’ll be right by your side through thick and thin as the independent voice of Athens and Ohio University.
And if you ever wanna visit us, our doors in Baker 325 are open.
So buckle up for a wild ride, Bobcats.
Landing Page
This story is part of a series of specially designed stories that represents some of the best journalism The Post has to offer. Check out the rest of the special projects here.


The Bow Robotics team has engineers versed in electrical, mechanical, and software applications. We can quickly and accurately assess the issues to identify the root problem of the specific part or function. Once the problem has been identified; we fix and/or replace, clean, and prep your part for testing. Our testing process usually involves manual circuit and/or manipulations checks along with the part running through various test simulations on one of our test robots for at least 24 hours, and are backed by a 12-month warranty unless otherwise stated.
We are here to listen to your needs and provide the quality service and repair work that you expect from a trusted partner. Ready to explore the difference Bow Robotics can make in your business? Contact Us and we will be happy to answer all your questions!
Want to know more about the parts and products that Bow Robotics can provide? We will be happy to answer all your questions!


{% if not font_styles %}
Visit this documentation to learn how to set them up in Larva, and in the mean time, the brand's typography styles may be available at the legacy URL:This brand does not have typography tokens yet.
.{{class}}
Each of us knows a little, together we know a lot.


HOME
REVIEWS
ADD NEW REVIEW
REFERENCES
Travel marker app
“Live with no excuses and travel with no regrets” ~ Oscar Wilde.


The Human Rights Council (UNHRC) founded on 15th March 2006, is an intergovernmental body within the UN, comprising 47 UN states elected through the General Assembly. Together, they discuss human right violations and work towards strengthening and promoting human rights protection worldwide.
The Human Rights Council shall be a test of judgement, understanding and ethics. This year, delegates shall be discussing the different ways to reimagine migration during the Coronavirus.
Hoping to see you all in committee.
You are not a drop in the ocean. You are the entire ocean in a drop” - Rumi
An avid reader of political novellas and fiction, debate is her natural skill.
Drawing inspiration from poetry and epics, upholding morality and humanity are her key objectives. With logical and emotive arguments being her forte, her MUN career spans over 8 conferences including the previous JMUNs. She firmly believes that communication is just as important as research in any committee and has stuck by it throughout her MUNs.
Apart from debate and politics, language, mythology and arts hold a special place for her. She is an artist who paints not only from colours, but also words. Presenting the Co-Chair of UNHRC, Satviki Shankaran. (Acknowledge the I at the end, it is not an A).
Chakkradar has participated from grades 6 to 8 in this very Bangalore Junior Model United Nations as Libya (UNESCO) in the first year, Afghanistan (DISEC) in the second year, and Germany (DISEC) in the third. Last year, Chakkradar was the rapporteur for DISEC and the committee passed the resolution 2 ½ hours before the end of the second day. In his free time he stays updated on news.
He is looking forward to working with you!
Hi everyone, and welcome to the Human Rights Council of Bangalore JMUN 2020! I am Simran Kaur from MYP5, and I will be your moderator this year. I have been actively participating in MUN's for the past 3 years, and I am looking forward to having an amazing and enjoyable JMUN experience with all of you!


[SYMBOL]
[A]
[B]
[C]
[D]
[E]
[F]
[G]
[H]
[I]
[J]
[K]
[L]
[M]
[N]
[O]
[P]
[Q]
[R]
[S]
[T]
[U]
[V]
[W]
[X]
[Y]
[Z]
Package Compiler (pkg_comp) command
package repositories, creating
packageAdd command
packages automating NetBSD builds
checking dependencies
Packet Filter (PF) configuring
securing wireless networks with
packet sniffers, protecting from
packets capturing
deciphering tcpdump output
PAM (Pluggable Authentication Modules)
pam_passwdqc module changing default settings
enabling
overview of
parallel command execution using tentakel
partition full detection script
partitioning scheme for automated installs
passphrases for cgd devices
changing periodically
one-time passwords and
passwd command
2nd
changing default options using pam_passwdqc module
password protecting loaders
single-user mode
passwords converting existing passwords to Blowfish
crack (dictionary password cracker)
customizing dictionaries
forcing new passwords to use Blowfish
helping users choose memorable passwords
one-time passwords
protecting email
protecting system passwords with Blowfish
reusable, creating policy for
setting expiration dates for
patches applying to files
creating
diff command and
revision control and
security, automating
pathnames, finding
pattern space vs. holding space (sed utility)
pax utility
performance of networks, optimizing
periodic scripts
MTAs (Mail Transport Agents)
peripheral information in kernel configuration files
permission for using code examples
permissions FTP servers, accessing
protecting files with flags
specifying for ACLs
standard Unix vs. ACLs
Peterson, Jan L.
PF (Packet Filter) configuring
securing wireless networks with
pg_dump/pg_dumpall tools
phases of the moon (pom) utility
PHP, configuring
PHP4, installing
PHPlot, installing
pine mail program and pipes
ping command
2nd
pipes for traffic shaping
pkg_add command
pkg_comp command
pkg_info command
checking dependencies before uninstalling
checking disk space used by ports
pkg_version command
Pluggable Authentication Modules (PAM)
Pluggable Password Checking
pom (phases of the moon) utility
pop-up messages, sending
POP3 protocol reading email with telnet
security considerations
Popa, Alexandru
port 25, closing
portable files, creating
portable POSIX archives, creating
portdowngrade command
ports building without ports trees
checking disk space used by
choosing Java ports to install
configuring
dependencies, checking for
downgrading
finding the right port
installing
installing Unix applications on Mac OS X using DarwinPorts
keeping up-to-date with CTM
pkg_info command and
screen window manager
skeletons, checking out
ports collection, keeping up-to-date with
ports trees building ports without
updating DarwinPorts trees
updating using ftp and ctm
portupgrade command
portversion command
POSIX archives, creating
PostgreSQL databases, automating data dumps for
power management information in kernel configuration files
PPP variables
printing manpages
priority number of MX records
ÒThe Problem of PORCMOLSULBÓ
.profile file
program paths, finding
prompt login, changing
for tcsh shell, making more useful
prompt command
protecting the boot process
pseudodevice information in kernel configuration files
pseudoterminals, logging into
pw command
|


Added some better description of fmt_luminex_results().
snprcspf 1.1.7 (20200612)
Corrected bug in fmt_luminex_results() that was saving the data used to control formating of the worksheet to the worksheet instead of the dataframe that was supposed to be written. Some refactoring of code was also done to make the side effects of the function more easily understood.
snprcspf 1.1.6 (20200406)
Changed default blank replacement from “.” to " " in calls to read.xlsx(). The period were causing the column match routines to fail.
snprcspf 1.1.5 (20200403)
Changed positive cell markup to yellow characters and red background
Changed to a conditional test for NA delimited columns of the divisor data. read_excel, which had been used, always added NA values. read.xlsx does not.
snprcspf 1.1.2 (20200330)
Used suppressMessages on read_excel to suppress the New Name messages
snprcspf 1.1.1 (20200329)
Moved misplaced unit test file.
snprcspf 1.1.0 (20200328)
Have replaced dependence on Java for the Excel formatting. Using openxlsx package
Have cleaned up code for file name and file path management for the Excel input file names and paths
snprcspf 1.0.9 (20200321)
Copied build instructions from nprcgenekeepr
Removed redundant copy of a function.
snprcspf 1.0.8 (20200321)
Separated R code into seperate files for each function.
Created some data objects for testing and demonstration. This has created a dependency on R >= 3.5.0.
snprcspf 1.0.7 (20190526)
Removed formating of Excel sheets to remove dependency on rJava used by XLConnect. As of 2019 May 26, Java 12 has a bug that prevents the use of the XLConnect package. This version of snprcspf has removed that dependency with the side effect of not providing formating within the Excel workbook generated.


WARNING
Content Under Development
See
release page for
latest official PDF version.
**Chapter 6: Generating Random Directions**
In this and the next two chapters let’s harden our understanding and tools and figure out which
Cornell Box is right. Let’s first figure out how to generate random directions, but to simplify
things let’s assume the z-axis is the surface normal and $\theta$ is the angle from the normal.
We’ll get them oriented to the surface normal vector in the next chapter. We will only deal with
distributions that are rotationally symmetric about $z$. So $p(direction) = f(\theta)$. If you
have had advanced calculus, you may recall that on the sphere in spherical coordinates
$dA = \sin(\theta) \cdot d\theta \cdot d\phi$. If you haven’t, you’ll have to take my word for the
next step, but you’ll get it when you take advanced calc.
Given a directional pdf, $p(direction) = f(\theta)$ on the sphere, the 1D pdfs on $\theta$ and
$\phi$ are:
$$ a(\phi) = \frac{1}{2\pi} $$
(uniform)
$$ b(\theta) = 2*\pi*f(\theta)\sin(\theta) $$
For uniform random numbers $r_1$ and $r_2$, the material presented in Chapter 2 leads to:
$$ r_1 = \int_{0}^{\phi} \frac{1}{2\pi} = \frac{\phi}{2\pi} $$
Solving for $\phi$ we get:
$$ \phi = 2 \pi \cdot r_1 $$
For theta we have:
$$ r_2 = \int_{0}^{\theta} 2 \pi f(t) \sin(t) $$
Here, $t$ is a dummy variable. Let’s try some different functions for $f()$. Let’s first try a
uniform density on the sphere. The area of the unit sphere is $4\pi$ , so a uniform $p(direction) =
\frac{1}{4\pi}$ on the unit sphere.
$$ r_2 = \frac{-\cos(\theta)}{2} - \frac{-\cos(0)}{2} = \frac{1 - \cos(\theta)}{2} $$
Solving for $\cos(\theta)$ gives:
$$ \cos(\theta) = 1 - 2 r_2 $$
We don’t solve for theta because we probably only need to know $\cos(\theta)$ anyway and don’t want
needless $\arccos()$ calls running around.
To generate a unit vector direction toward $(\theta,\phi)$ we convert to Cartesian coordinates:
$$ x = \cos(\phi) \cdot \sin(\theta) $$
$$ y = \sin(\phi) \cdot \sin(\theta) $$
$$ z = \cos(\theta) $$
And using the identity that $\cos^2 + \sin^2 = 1$, we get the following in terms of random
$(r_1,r_2)$:
$$ x = \cos(2\pi \cdot r_1)\sqrt{1 - (1-2 r_2)^2} $$
$$ y = \sin(2\pi \cdot r_1)\sqrt{1 - (1-2 r_2)^2} $$
$$ z = 1 - 2 r_2 $$
Simplifying a little, $(1 - 2 r_2)^2 = 1 - 4r_2 + 4r_2^2$, so:
$$ x = \cos(2 \pi r_1) \cdot 2 \sqrt{r_2(1 - r_2)} $$
$$ y = \sin(2 \pi r_1) \cdot 2 \sqrt{r_2(1 - r_2)} $$
$$ z = 1 - 2 r_2 $$
We can output some of these:
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ C++
int main() {
for (int i = 0; i < 200; i++) {
float r1 = drand48();
float r2 = drand48();
float x = cos(2*M_PI*r1)*2*sqrt(r2*(1-r2));
float y = sin(2*M_PI*r1)*2*sqrt(r2*(1-r2));
float z = 1 - r2;
std::cout << x << " " << y << " " << z << "\n";
}
}
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
And plot them for free on plot.ly (a great site with 3D scatterplot support):
![Image 6-1](../assets/fig06-1.jpg)
On the plot.ly website you can rotate that around and see that it appears uniform.
Now let’s derive uniform on the hemisphere . The density being uniform on the hemisphere means
$p(direction) = 1 / (2 \pi)$ and just changing the constant in the theta equations yields:
$$ \cos(\theta) = 1 - r_2 $$
It is comforting that $\cos(\theta)$ will vary from 1 to 0, and thus theta will vary from 0 to
$\pi/2$. Rather than plot it, let’s do a 2D integral with a known solution. Let’s integrate cosine
cubed over the hemisphere (just picking something arbitrary with a known solution). First let’s do
it by hand:
$$ \int \cos^3 = 2 \pi \int_{0}^{\pi/2} \cos^3 \sin = \frac{\pi}{2} $$
Now for integration with importance sampling. $p(direction) = 1/(2 \pi)$, so we average $f/p$
which is $\cos^3 / (1/(2 \pi))$, and we can test this:
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ C++
int main() {
int N = 1000000;
float sum = 0.0;
for (int i = 0; i < N; i++) {
float r1 = drand48();
float r2 = drand48();
float x = cos(2*M_PI*r1)*2*sqrt(r2*(1-r2));
float y = sin(2*M_PI*r1)*2*sqrt(r2*(1-r2));
float z = 1 - r2;
sum += z*z*z / (1.0/(2.0*M_PI));
}
std::cout << "PI/2 = " << M_PI/2 << "\n";
std::cout << "Estimate = " << sum/N << "\n";
}
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Now let’s generate directions with $p(directions) = \cos(\theta) / \pi$.
$$ r_2 = \int_{0}^{\theta} 2 \pi \frac{\cos(t)}{\pi} \sin(t) = 1 - \cos^2(\theta) $$
So,
$$ \cos(\theta) = \sqrt{1 - r_2} $$
We can save a little algebra on specific cases by noting
$$ z = \cos(\theta) = \sqrt{1 - r_2} $$
$$ x = \cos(\phi) \sin(\theta) = \cos(2 \pi r_1) \sqrt{1 - z^2} = \cos(2 \pi r_1) \sqrt{r_2} $$
$$ y = \sin(\phi) \sin(\theta) = \sin(2 \pi r_1) \sqrt{1 - z^2} = \sin(2 \pi r_1) \sqrt{r_2} $$
Let’s also start generating them as random vectors:
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ C++
inline vec3 random_cosine_direction() {
float r1 = drand48();
float r2 = drand48();
float z = sqrt(1-r2);
float phi = 2*M_PI*r1;
float x = cos(phi)*sqrt(r2);
float y = sin(phi)*sqrt(r2);
return vec3(x, y, z);
}
int main() {
int N = 1000000;
float sum = 0.0;
for (int i = 0; i < N; i++) {
vec3 v = random_cosine_direction();
sum += v.z()*v.z()*v.z() / (v.z()/(M_PI));
}
std::cout << "PI/2 = " << M_PI/2 << "\n";
std::cout << "Estimate = " << sum/N << "\n";
}
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
We can generate other densities later as we need them. In the next chapter we’ll get them aligned to
the surface normal vector.


=== Test case: lasp_SUITE:sql_join_contracted_latency_test/1 (click for source code) === Config value: [{watchdog,<0.4698.0>}<EMAIL_ADDRESS>{tc_group_properties,[]}, {tc_group_path,[]}, {data_dir,"/home/gcreupelandt/Documents/MEMOIRE/lasp/_build/test/lib/lasp/test/lasp_SUITE_data/"}<EMAIL_ADDRESS>=== Current directory is<EMAIL_ADDRESS>=== Started at 2020-09-27 16:51:09
*** User 2020-09-27 16:51:09.743 *** Beginning case: sql_join_contracted_latency_test
*** User 2020-09-27 16:51:09.769 *** 16:51:09.769 [info] Configured peer_service_manager partisan_pluggable_peer_service_manager on node 'runner@gcreupelandt-N551VW'
*** User 2020-09-27 16:51:09.770 *** 16:51:09.770 [info] Using node name: 'runner@gcreupelandt-N551VW'
*** User 2020-09-27 16:51:09.962 *** 16:51:09.962 [info] Partisan listening on {127,0,1,1}:47121 listen_addrs: [#{ip => {127,0,1,1},port => 47121}]
*** User 2020-09-27 16:51:09.968 *** 16:51:09.968 [info] Not using container orchestration; disabling.

*** User 2020-09-27 16:51:11.392 *** 16:51:11.392 [info] Disabling blocking sync...
*** User 2020-09-27 16:51:11.397 *** 16:51:11.396 [info] Configured peer_service_manager partisan_pluggable_peer_service_manager on node 'node-1@gcreupelandt-N551VW'
*** User 2020-09-27 16:51:12.732 *** Loading applications on node: 'node-2@gcreupelandt-N551VW'
*** User 2020-09-27 16:51:12.846 *** 16:51:12.846 [info] Enabling membership...
*** User 2020-09-27 16:51:12.848 *** 16:51:12.848 [info] Disabling blocking sync...
*** User 2020-09-27 16:51:12.852 *** 16:51:12.852 [info] Configured peer_service_manager partisan_pluggable_peer_service_manager on node 'node-2@gcreupelandt-N551VW'
*** User 2020-09-27 16:51:14.162 *** Loading applications on node: 'node-3@gcreupelandt-N551VW'
*** User 2020-09-27 16:51:14.274 *** 16:51:14.274 [info] Enabling membership...
*** User 2020-09-27 16:51:14.275 *** 16:51:14.275 [info] Disabling blocking sync...
*** User 2020-09-27 16:51:14.280 *** 16:51:14.280 [info] Configured peer_service_manager partisan_pluggable_peer_service_manager on node 'node-3@gcreupelandt-N551VW'
*** User 2020-09-27 16:51:14.511 *** Joining node: 'node-3@gcreupelandt-N551VW' to 'runner@gcreupelandt-N551VW' at listen_addr [#{ip => {127, 0, 1, 1}, port => 59901}]
*** User 2020-09-27 16:51:15.524 *** Joining issued: 'node-3@gcreupelandt-N551VW' to 'runner@gcreupelandt-N551VW' at listen_addrs [#{ip => {127, 0, 1, 1}, port => 59901}]
*** User 2020-09-27 16:51:15.525 *** Joining node: 'node-2@gcreupelandt-N551VW' to 'runner@gcreupelandt-N551VW' at listen_addr [#{ip => {127, 0, 1, 1}, port => 34713}]
*** User 2020-09-27 16:51:16.579 *** Joining issued: 'node-2@gcreupelandt-N551VW' to 'runner@gcreupelandt-N551VW' at listen_addrs [#{ip => {127, 0, 1, 1}, port => 34713}]
*** User 2020-09-27 16:51:16.580 *** Joining node: 'node-1@gcreupelandt-N551VW' to 'runner@gcreupelandt-N551VW' at listen_addr [#{ip => {127, 0, 1, 1}, port => 50289}]
*** User 2020-09-27 16:51:17.636 *** Joining issued: 'node-1@gcreupelandt-N551VW' to 'runner@gcreupelandt-N551VW' at listen_addrs [#{ip => {127, 0, 1, 1}, port => 50289}]
*** User 2020-09-27 16:51:17.697 *** Waiting for join to complete with manager: partisan_pluggable_peer_service_manager
*** User 2020-09-27 16:51:17.705 *** Finished.
*** CT 2020-09-27 16:51:17.705 *** COVER INFO Adding nodes to cover test: ['runner@gcreupelandt-N551VW']
*** CT 2020-09-27 16:51:17.723 *** COVER INFO Successfully added nodes to cover test: []
*** User 2020-09-27 16:51:17.724 *** Case finished: sql_join_contracted_latency_test
*** System report during lasp_SUITE:sql_join_contracted_latency_test/1 2020-09-27 16:51:24.753 *** =INFO REPORT==== 27-Sep-2020::16:51:24.753169 === application: lasp exited: stopped type: temporary
*** User 2020-09-27 16:51:24.754 *** 16:51:24.753 [info] Application lasp exited with reason: stopped
*** User 2020-09-27 16:51:24.757 *** 16:51:24.757 [info] Application partisan exited with reason: stopped
*** System report during lasp_SUITE:sql_join_contracted_latency_test/1 2020-09-27 16:51:24.757 *** =INFO REPORT==== 27-Sep-2020::16:51:24.756809 === application: partisan exited: stopped type: temporary
=== Ended at 2020-09-27 16:51:24 === successfully completed test case === === Returned value: ok
Test run history | Top level test index | Latest test result