This document discusses key concepts in probability and how they can be applied in archaeology. It begins by explaining the frequentist and Bayesian approaches to probability. The basic concepts of probability, independent and conditional probability, and Bayes' Theorem are then defined. Examples are provided to demonstrate how binomial probability, probability density functions, and cumulative density functions can help archaeologists evaluate the significance of artifact samples and absence of types. Specifically, these statistical tools allow researchers to assess how likely it is their results are due to chance rather than reflecting real patterns in the archaeological record.
Basic statistics for algorithmic tradingQuantInsti
In this presentation we try to understand the core basics of statistics and its application in algorithmic trading.
We start by defining what statistics is. Collecting data is the root of statistics. We need data to analyse and take quantitative decisions.
While analyzing, there are certain parameters for statistics, this branches statistics into two - descriptive statistics & inferential statistics.
This data that we have collected can be classified into uni-variate and bi-variate. It also tries to explain the fundamental difference.
Going Further we also cover topics like regression line, Coefficient of Determination, Homoscedasticity and Heteroscedasticity.
In this way the presentation look at various aspects of statistics which are used for algorithmic trading.
To learn the advanced applications of statistics for HFT & Quantitative Trading connect with us one our website: www.quantinsti.com.
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
Basic statistics for algorithmic tradingQuantInsti
In this presentation we try to understand the core basics of statistics and its application in algorithmic trading.
We start by defining what statistics is. Collecting data is the root of statistics. We need data to analyse and take quantitative decisions.
While analyzing, there are certain parameters for statistics, this branches statistics into two - descriptive statistics & inferential statistics.
This data that we have collected can be classified into uni-variate and bi-variate. It also tries to explain the fundamental difference.
Going Further we also cover topics like regression line, Coefficient of Determination, Homoscedasticity and Heteroscedasticity.
In this way the presentation look at various aspects of statistics which are used for algorithmic trading.
To learn the advanced applications of statistics for HFT & Quantitative Trading connect with us one our website: www.quantinsti.com.
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
Welcome to the first live UiPath Community Day Dubai! Join us for this unique occasion to meet our local and global UiPath Community and leaders. You will get a full view of the MEA region's automation landscape and the AI Powered automation technology capabilities of UiPath. Also, hosted by our local partners Marc Ellis, you will enjoy a half-day packed with industry insights and automation peers networking.
📕 Curious on our agenda? Wait no more!
10:00 Welcome note - UiPath Community in Dubai
Lovely Sinha, UiPath Community Chapter Leader, UiPath MVPx3, Hyper-automation Consultant, First Abu Dhabi Bank
10:20 A UiPath cross-region MEA overview
Ashraf El Zarka, VP and Managing Director MEA, UiPath
10:35: Customer Success Journey
Deepthi Deepak, Head of Intelligent Automation CoE, First Abu Dhabi Bank
11:15 The UiPath approach to GenAI with our three principles: improve accuracy, supercharge productivity, and automate more
Boris Krumrey, Global VP, Automation Innovation, UiPath
12:15 To discover how Marc Ellis leverages tech-driven solutions in recruitment and managed services.
Brendan Lingam, Director of Sales and Business Development, Marc Ellis
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
Removing Uninteresting Bytes in Software FuzzingAftab Hussain
Imagine a world where software fuzzing, the process of mutating bytes in test seeds to uncover hidden and erroneous program behaviors, becomes faster and more effective. A lot depends on the initial seeds, which can significantly dictate the trajectory of a fuzzing campaign, particularly in terms of how long it takes to uncover interesting behaviour in your code. We introduce DIAR, a technique designed to speedup fuzzing campaigns by pinpointing and eliminating those uninteresting bytes in the seeds. Picture this: instead of wasting valuable resources on meaningless mutations in large, bloated seeds, DIAR removes the unnecessary bytes, streamlining the entire process.
In this work, we equipped AFL, a popular fuzzer, with DIAR and examined two critical Linux libraries -- Libxml's xmllint, a tool for parsing xml documents, and Binutil's readelf, an essential debugging and security analysis command-line tool used to display detailed information about ELF (Executable and Linkable Format). Our preliminary results show that AFL+DIAR does not only discover new paths more quickly but also achieves higher coverage overall. This work thus showcases how starting with lean and optimized seeds can lead to faster, more comprehensive fuzzing campaigns -- and DIAR helps you find such seeds.
- These are slides of the talk given at IEEE International Conference on Software Testing Verification and Validation Workshop, ICSTW 2022.
Climate Impact of Software Testing at Nordic Testing DaysKari Kakkonen
My slides at Nordic Testing Days 6.6.2024
Climate impact / sustainability of software testing discussed on the talk. ICT and testing must carry their part of global responsibility to help with the climat warming. We can minimize the carbon footprint but we can also have a carbon handprint, a positive impact on the climate. Quality characteristics can be added with sustainability, and then measured continuously. Test environments can be used less, and in smaller scale and on demand. Test techniques can be used in optimizing or minimizing number of tests. Test automation can be used to speed up testing.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
zkStudyClub - Reef: Fast Succinct Non-Interactive Zero-Knowledge Regex ProofsAlex Pruden
This paper presents Reef, a system for generating publicly verifiable succinct non-interactive zero-knowledge proofs that a committed document matches or does not match a regular expression. We describe applications such as proving the strength of passwords, the provenance of email despite redactions, the validity of oblivious DNS queries, and the existence of mutations in DNA. Reef supports the Perl Compatible Regular Expression syntax, including wildcards, alternation, ranges, capture groups, Kleene star, negations, and lookarounds. Reef introduces a new type of automata, Skipping Alternating Finite Automata (SAFA), that skips irrelevant parts of a document when producing proofs without undermining soundness, and instantiates SAFA with a lookup argument. Our experimental evaluation confirms that Reef can generate proofs for documents with 32M characters; the proofs are small and cheap to verify (under a second).
Paper: https://eprint.iacr.org/2023/1886
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
PHP Frameworks: I want to break free (IPC Berlin 2024)Ralf Eggert
In this presentation, we examine the challenges and limitations of relying too heavily on PHP frameworks in web development. We discuss the history of PHP and its frameworks to understand how this dependence has evolved. The focus will be on providing concrete tips and strategies to reduce reliance on these frameworks, based on real-world examples and practical considerations. The goal is to equip developers with the skills and knowledge to create more flexible and future-proof web applications. We'll explore the importance of maintaining autonomy in a rapidly changing tech landscape and how to make informed decisions in PHP development.
This talk is aimed at encouraging a more independent approach to using PHP frameworks, moving towards a more flexible and future-proof approach to PHP development.
2. Questions
• what is a good general size for artifact
samples?
• what proportion of populations of interest
should we be attempting to sample?
• how do we evaluate the absence of an
artifact type in our collections?
3. “frequentist” approach
• probability should be assessed in purely
objective terms
• no room for subjectivity on the part of
individual researchers
• knowledge about probabilities comes from
the relative frequency of a large number of
trials
– this is a good model for coin tossing
– not so useful for archaeology, where many of
the events that interest us are unique…
4. Bayesian approach
• Bayes Theorem
– Thomas Bayes
– 18th century English clergyman
• concerned with integrating “prior knowledge” into
calculations of probability
• problematic for frequentists
– prior knowledge = bias, subjectivity…
5. basic concepts
• probability of event = p
0 <= p <= 1
0 = certain non-occurrence
1 = certain occurrence
• .5 = even odds
• .1 = 1 chance out of 10
6. basic concepts (cont.)
• if A and B are mutually exclusive events:
P(A or B) = P(A) + P(B)
ex., die roll: P(1 or 6) = 1/6 + 1/6 = .33
• possibility set:
sum of all possible outcomes
~A = anything other than A
P(A or ~A) = P(A) + P(~A) = 1
7. basic concepts (cont.)
• discrete vs. continuous probabilities
• discrete
– finite number of outcomes
• continuous
– outcomes vary along continuous scale
10. independent events
• one event has no influence on the outcome
of another event
• if events A & B are independent
then P(A&B) = P(A)*P(B)
• if P(A&B) = P(A)*P(B)
then events A & B are independent
• coin flipping
if P(H) = P(T) = .5 then
P(HTHTH) = P(HHHHH) =
.5*.5*.5*.5*.5 = .55 = .03
11. • if you are flipping a coin and it has already
come up heads 6 times in a row, what are
the odds of an 7th head?
.5
• note that P(10H) < > P(4H,6T)
– lots of ways to achieve the 2nd result (therefore
much more probable)
12. • mutually exclusive events are not
independent
• rather, the most dependent kinds of events
– if not heads, then tails
– joint probability of 2 mutually exclusive events
is 0
• P(A&B)=0
13. conditional probability
• concern the odds of one event occurring,
given that another event has occurred
• P(A|B)=Prob of A, given B
14. e.g.
• consider a temporally ambiguous, but
generally late, pottery type
• the probability that an actual example is
“late” increases if found with other types of
pottery that are unambiguously late…
• P = probability that the specimen is late:
isolated:
P(Ta) = .7
w/ late pottery (Tb):
P(Ta|Tb) = .9
w/ early pottery (Tc):
P(Ta|Tc) = .3
16. Bayes Theorem
P( B ) P( A | B )
P ( B | A) =
P( B ) P( A | B ) + P( ~ B ) P( A |~ B )
• can be derived from the basic equation for
conditional probabilities
17. application
• archaeological data about ceramic design
– bowls and jars, decorated and undecorated
• previous excavations show:
– 75% of assemblage are bowls, 25% jars
– of the bowls, about 50% are decorated
– of the jars, only about 20% are decorated
• we have a decorated sherd fragment, but it’s too
small to determine its form…
• what is the probability that it comes from a bowl?
18. dec.
undec.
bowl
??
50% of bowls
20% of jars
50% of bowls
80% of jars
75%
•
•
•
•
•
•
•
•
jar
P ( B | A) =
P( B ) P( A | B )
P( B ) P( A | B ) + P( ~ B ) P( A |~ B )
25%
can solve for P(B|A)
events:??
events: B = “bowlness”; A = “decoratedness”
P(B)=??; P(A|B)=??
P(B)=.75; P(A|B)=.50
P(~B)=.25; P(A|~B)=.20
P(B|A)=.75*.50 / ((.75*50)+(.25*.20))
P(B|A)=.88
19. Binomial theorem
• P(n,k,p)
– probability of k successes in n trials
where the probability of success on any one
trial is p
– “success” = some specific event or outcome
– k specified outcomes
– n trials
– p probability of the specified outcome in 1 trial
20. P ( n, k , p ) = C ( n, k ) p ( 1 − p )
k
n−k
where
n!
C ( n, k ) =
k!( n − k )!
n! = n*(n-1)*(n-2)…*1 (where n is an integer)
0!=1
21. binomial distribution
• binomial theorem describes a theoretical
distribution that can be plotted in two
different ways:
– probability density function (PDF)
– cumulative density function (CDF)
22. probability density function (PDF)
• summarizes how odds/probabilities are
distributed among the events that can arise
from a series of trials
23. ex: coin toss
• we toss a coin three times, defining the
outcome head as a “success”…
• what are the possible outcomes?
• how do we calculate their probabilities?
24. coin toss (cont.)
• how do we assign values to
P(n,k,p)?
•
•
•
•
3 trials; n = 3
even odds of success; p=.5
P(3,k,.5)
there are 4 possible values for ‘k’,
and we want to calculate P for
each of them
k
0
TTT
1
HTT (THT,TTH)
2
HHT (HTH, THH)
3
HHH
“probability of k successes in n trials
where the probability of success on any one trial is p”
25. (
P( 3,1,.5) = (
P( 3,0,.5) =
(
3!
0!( 3− 0 )!
3!
1!( 3−1)!
) p (1 − p )
k
).5 (1 − .5)
0
).5 (1 − .5)
1
n−k
3− 0
3−1
0.400
0.350
0.300
0.250
P(3,k,.5)
P ( n, k , p ) =
n!
k !( n − k )!
0.200
0.150
0.100
0.050
0.000
0
1
2
k
3
26. practical applications
• how do we interpret the absence of key
types in artifact samples??
• does sample size matter??
• does anything else matter??
27. example
1. we are interested in ceramic production in
southern Utah
2. we have surface collections from a
number of sites
are any of them ceramic workshops??
3. evidence: ceramic “wasters”
ethnoarchaeological data suggests that
wasters tend to make up about 5% of samples
at ceramic workshops
28. • one of our sites 15 sherds, none
identified as wasters…
• so, our evidence seems to suggest that this
site is not a workshop
• how strong is our conclusion??
29. • reverse the logic: assume that it is a ceramic
workshop
• new question:
– how likely is it to have missed collecting wasters in a
sample of 15 sherds from a real ceramic workshop??
• P(n,k,p)
[n trials, k successes, p prob. of success on 1 trial]
• P(15,0,.05)
[we may want to look at other values of k…]
31. • how large a sample do you need before you
can place some reasonable confidence in the
idea that no wasters = no workshop?
• how could we find out??
• we could plot P(n,0,.05) against different
values of n…
33. What if wasters existed at a higher proportion than 5%??
0.50
0.45
p=.05
0.35
P(n,0,p)
0.40
p=.10
0.30
0.25
0.20
0.15
0.10
0.05
0.00
0
20
40
60
80
n
100
120
140
160
34. so, how big should samples be?
• depends on your research goals & interests
• need big samples to study rare items…
• “rules of thumb” are usually misguided (ex.
“200 pollen grains is a valid sample”)
• in general, sheer sample size is more
important that the actual proportion
• large samples that constitute a very small
proportion of a population may be highly
useful for inferential purposes
35. • the plots we have been using are probability
density functions (PDF)
• cumulative density functions (CDF) have a
special purpose
• example based on mortuary data…
36. Pre-Dynastic cemeteries in Upper Egypt
Site 1
•
•
•
800 graves
160 exhibit body position and grave goods that mark
members of a distinct ethnicity (group A)
relative frequency of 0.2
Site 2
•
•
•
badly damaged; only 50 graves excavated
6 exhibit “group A” characteristics
relative frequency of 0.12
37. • expressed as a proportion, Site 1 has around
twice as many burials of individuals from
“group A” as Site 2
• how seriously should we take this
observation as evidence about social
differences between underlying
populations?
38. • assume for the moment that there is no
difference between these societies—they
represent samples from the same underlying
population
• how likely would it be to collect our Site 2
sample from this underlying population?
• we could use data merged from both sites as
a basis for characterizing this population
• but since the sample from Site 1 is so large,
lets just use it …
39. • Site 1 suggests that about 20% of our
society belong to this distinct social class…
• if so, we might have expected that 10 of the
50 sites excavated from site 2 would belong
to this class
• but we found only 6…
40. • how likely is it that this difference (10 vs. 6)
could arise just from random chance??
• to answer this question, we have to be
interested in more than just the probability
associated with the single observed
outcome “6”
• we are also interested in the total
probability associated with outcomes that
are more extreme than “6”…
41. • imagine a simulation of the
discovery/excavation process of graves at
Site 2:
• repeated drawing of 50 balls from a jar:
– ca. 800 balls
– 80% black, 20% white
• on average, samples will contain 10 white
balls, but individual samples will vary
42. • by keeping score on how many times we
draw a sample that is as, or more divergent
(relative to the mean sample) than what we
observed in our real-world sample…
• this means we have to tally all samples that
produce 6, 5, 4…0, white balls…
• a tally of just those samples with 6 white
balls eliminates crucial evidence…
43. • we can use the binomial theorem instead of
the drawing experiment, but the same logic
applies
• a cumulative density function (CDF)
displays probabilities associated with a
range of outcomes (such as 6 to 0 graves
with evidence for elite status)
46. • so, the odds are about 1 in 10 that the
differences we see could be attributed to
random effects—rather than social
differences
• you have to decide what this observation
really means, and other kinds of evidence
will probably play a role in your decision…