This chapter discusses discrete random variables and their probability distributions. It introduces the concept of a random variable and defines discrete and continuous random variables. It then covers the probability distributions for discrete random variables including the binomial, Poisson, and hypergeometric distributions. It defines key terms like expected value and variance and provides examples of calculating probabilities using these distributions.
Probability Distribution (Discrete Random Variable)Cess011697
Learning Competencies:
- to find the possible values of a random variable.
illustrates a probability distribution for a discrete random variable and its properties.
- to compute probabilities corresponding to a given random variable.
There are some exercises for you to answer.
: Random Variable, Discrete Random variable, Continuous random variable, Probability Distribution of Discrete Random variable, Mathematical Expectations and variance of a discrete random variable.
Probability Distribution (Discrete Random Variable)Cess011697
Learning Competencies:
- to find the possible values of a random variable.
illustrates a probability distribution for a discrete random variable and its properties.
- to compute probabilities corresponding to a given random variable.
There are some exercises for you to answer.
: Random Variable, Discrete Random variable, Continuous random variable, Probability Distribution of Discrete Random variable, Mathematical Expectations and variance of a discrete random variable.
This slide presentation is a non-technical introduction to the concept of probability. The level of the presentation would be most suitable for college students majoring in business or a related field, but it could also be used in high school classes.
Please Subscribe to this Channel for more solutions and lectures
http://www.youtube.com/onlineteaching
Chapter 5: Discrete Probability Distribution
5.3 - Poisson Probability Distributions
This slide presentation is a non-technical introduction to the concept of probability. The level of the presentation would be most suitable for college students majoring in business or a related field, but it could also be used in high school classes.
Please Subscribe to this Channel for more solutions and lectures
http://www.youtube.com/onlineteaching
Chapter 5: Discrete Probability Distribution
5.3 - Poisson Probability Distributions
This presentation is a part of Business analytics course.
Probability Distribution is a statistical function which links or lists all the possible outcomes a random variable can take, in any random process, with its corresponding probability of occurrence.
Similar to Chapter 04 random variables and probability (20)
StarCompliance is a leading firm specializing in the recovery of stolen cryptocurrency. Our comprehensive services are designed to assist individuals and organizations in navigating the complex process of fraud reporting, investigation, and fund recovery. We combine cutting-edge technology with expert legal support to provide a robust solution for victims of crypto theft.
Our Services Include:
Reporting to Tracking Authorities:
We immediately notify all relevant centralized exchanges (CEX), decentralized exchanges (DEX), and wallet providers about the stolen cryptocurrency. This ensures that the stolen assets are flagged as scam transactions, making it impossible for the thief to use them.
Assistance with Filing Police Reports:
We guide you through the process of filing a valid police report. Our support team provides detailed instructions on which police department to contact and helps you complete the necessary paperwork within the critical 72-hour window.
Launching the Refund Process:
Our team of experienced lawyers can initiate lawsuits on your behalf and represent you in various jurisdictions around the world. They work diligently to recover your stolen funds and ensure that justice is served.
At StarCompliance, we understand the urgency and stress involved in dealing with cryptocurrency theft. Our dedicated team works quickly and efficiently to provide you with the support and expertise needed to recover your assets. Trust us to be your partner in navigating the complexities of the crypto world and safeguarding your investments.
Chatty Kathy - UNC Bootcamp Final Project Presentation - Final Version - 5.23...John Andrews
SlideShare Description for "Chatty Kathy - UNC Bootcamp Final Project Presentation"
Title: Chatty Kathy: Enhancing Physical Activity Among Older Adults
Description:
Discover how Chatty Kathy, an innovative project developed at the UNC Bootcamp, aims to tackle the challenge of low physical activity among older adults. Our AI-driven solution uses peer interaction to boost and sustain exercise levels, significantly improving health outcomes. This presentation covers our problem statement, the rationale behind Chatty Kathy, synthetic data and persona creation, model performance metrics, a visual demonstration of the project, and potential future developments. Join us for an insightful Q&A session to explore the potential of this groundbreaking project.
Project Team: Jay Requarth, Jana Avery, John Andrews, Dr. Dick Davis II, Nee Buntoum, Nam Yeongjin & Mat Nicholas
Show drafts
volume_up
Empowering the Data Analytics Ecosystem: A Laser Focus on Value
The data analytics ecosystem thrives when every component functions at its peak, unlocking the true potential of data. Here's a laser focus on key areas for an empowered ecosystem:
1. Democratize Access, Not Data:
Granular Access Controls: Provide users with self-service tools tailored to their specific needs, preventing data overload and misuse.
Data Catalogs: Implement robust data catalogs for easy discovery and understanding of available data sources.
2. Foster Collaboration with Clear Roles:
Data Mesh Architecture: Break down data silos by creating a distributed data ownership model with clear ownership and responsibilities.
Collaborative Workspaces: Utilize interactive platforms where data scientists, analysts, and domain experts can work seamlessly together.
3. Leverage Advanced Analytics Strategically:
AI-powered Automation: Automate repetitive tasks like data cleaning and feature engineering, freeing up data talent for higher-level analysis.
Right-Tool Selection: Strategically choose the most effective advanced analytics techniques (e.g., AI, ML) based on specific business problems.
4. Prioritize Data Quality with Automation:
Automated Data Validation: Implement automated data quality checks to identify and rectify errors at the source, minimizing downstream issues.
Data Lineage Tracking: Track the flow of data throughout the ecosystem, ensuring transparency and facilitating root cause analysis for errors.
5. Cultivate a Data-Driven Mindset:
Metrics-Driven Performance Management: Align KPIs and performance metrics with data-driven insights to ensure actionable decision making.
Data Storytelling Workshops: Equip stakeholders with the skills to translate complex data findings into compelling narratives that drive action.
Benefits of a Precise Ecosystem:
Sharpened Focus: Precise access and clear roles ensure everyone works with the most relevant data, maximizing efficiency.
Actionable Insights: Strategic analytics and automated quality checks lead to more reliable and actionable data insights.
Continuous Improvement: Data-driven performance management fosters a culture of learning and continuous improvement.
Sustainable Growth: Empowered by data, organizations can make informed decisions to drive sustainable growth and innovation.
By focusing on these precise actions, organizations can create an empowered data analytics ecosystem that delivers real value by driving data-driven decisions and maximizing the return on their data investment.
Levelwise PageRank with Loop-Based Dead End Handling Strategy : SHORT REPORT ...Subhajit Sahu
Abstract — Levelwise PageRank is an alternative method of PageRank computation which decomposes the input graph into a directed acyclic block-graph of strongly connected components, and processes them in topological order, one level at a time. This enables calculation for ranks in a distributed fashion without per-iteration communication, unlike the standard method where all vertices are processed in each iteration. It however comes with a precondition of the absence of dead ends in the input graph. Here, the native non-distributed performance of Levelwise PageRank was compared against Monolithic PageRank on a CPU as well as a GPU. To ensure a fair comparison, Monolithic PageRank was also performed on a graph where vertices were split by components. Results indicate that Levelwise PageRank is about as fast as Monolithic PageRank on the CPU, but quite a bit slower on the GPU. Slowdown on the GPU is likely caused by a large submission of small workloads, and expected to be non-issue when the computation is performed on massive graphs.
Adjusting primitives for graph : SHORT REPORT / NOTESSubhajit Sahu
Graph algorithms, like PageRank Compressed Sparse Row (CSR) is an adjacency-list based graph representation that is
Multiply with different modes (map)
1. Performance of sequential execution based vs OpenMP based vector multiply.
2. Comparing various launch configs for CUDA based vector multiply.
Sum with different storage types (reduce)
1. Performance of vector element sum using float vs bfloat16 as the storage type.
Sum with different modes (reduce)
1. Performance of sequential execution based vs OpenMP based vector element sum.
2. Performance of memcpy vs in-place based CUDA based vector element sum.
3. Comparing various launch configs for CUDA based vector element sum (memcpy).
4. Comparing various launch configs for CUDA based vector element sum (in-place).
Sum with in-place strategies of CUDA mode (reduce)
1. Comparing various launch configs for CUDA based vector element sum (in-place).
2. McClave, Statistics, 11th ed. Chapter 4: Discrete
Random Variables
2
Where We’ve Been
Using probability to make inferences
about populations
Measuring the reliability of the
inferences
3. McClave, Statistics, 11th ed. Chapter 4: Discrete
Random Variables
3
Where We’re Going
Develop the notion of a random
variable
Numerical data and discrete random
variables
Discrete random variables and their
probabilities
4. 4.1: Two Types of Random
Variables
A random variable is a variable hat
assumes numerical values associated
with the random outcome of an
experiment, where one (and only one)
numerical value is assigned to each
sample point.
4McClave, Statistics, 11th ed. Chapter 4:
Discrete Random Variables
5. 4.1: Two Types of Random
Variables
A discrete random variable can assume a
countable number of values.
Number of steps to the top of the Eiffel Tower*
A continuous random variable can
assume any value along a given interval of
a number line.
The time a tourist stays at the top
once s/he gets there
*Believe it or not, the answer ranges from 1,652 to 1,789. See Great Buildings
5McClave, Statistics, 11th ed. Chapter 4:
Discrete Random Variables
6. 4.1: Two Types of Random
Variables
Discrete random variables
Number of sales
Number of calls
Shares of stock
People in line
Mistakes per page
Continuous random
variables
Length
Depth
Volume
Time
Weight
6McClave, Statistics, 11th ed. Chapter 4:
Discrete Random Variables
7. 4.2: Probability Distributions
for Discrete Random Variables
The probability distribution of a
discrete random variable is a graph,
table or formula that specifies the
probability associated with each
possible outcome the random variable
can assume.
p(x) ≥ 0 for all values of x
Σp(x) = 1
7McClave, Statistics, 11th ed. Chapter 4:
Discrete Random Variables
8. 4.2: Probability Distributions
for Discrete Random Variables
Say a random variable
x follows this pattern:
p(x) = (.3)(.7)x-1
for x > 0.
This table gives the
probabilities (rounded
to two digits) for x
between 1 and 10.
x P(x)
1 .30
2 .21
3 .15
4 .11
5 .07
6 .05
7 .04
8 .02
9 .02
10 .01
8McClave, Statistics, 11th ed. Chapter 4:
Discrete Random Variables
9. 4.3: Expected Values of
Discrete Random Variables
The mean, or expected value, of a
discrete random variable is
( ) ( ).E x xp xµ = = ∑
9McClave, Statistics, 11th ed. Chapter 4:
Discrete Random Variables
10. 4.3: Expected Values of
Discrete Random Variables
The variance of a discrete random
variable x is
The standard deviation of a discrete
random variable x is
2 2 2
[( ) ] ( ) ( ).E x x p xσ µ µ= − = −∑
2 2 2
[( ) ] ( ) ( ).E x x p xσ µ µ= − = −∑
10McClave, Statistics, 11th ed. Chapter 4:
Discrete Random Variables
12. 4.3: Expected Values of
Discrete Random Variables
12McClave, Statistics, 11th ed. Chapter 4:
Discrete Random Variables
In a roulette wheel in a U.S. casino, a $1 bet on
“even” wins $1 if the ball falls on an even number
(same for “odd,” or “red,” or “black”).
The odds of winning this bet are 47.37%
9986.
0526.5263.1$4737.1$
5263.)1$(
4737.)1$(
=
−=⋅−⋅+=
=
=
σ
µ
loseP
winP
On average, bettors lose about a nickel for each dollar they put down on a bet like this.
(These are the best bets for patrons.)
13. 4.4: The Binomial Distribution
A Binomial Random Variable
n identical trials
Two outcomes: Success or Failure
P(S) = p; P(F) = q = 1 – p
Trials are independent
x is the number of Successes in n trials
13McClave, Statistics, 11th ed. Chapter 4:
Discrete Random Variables
14. 4.4: The Binomial Distribution
A Binomial Random
Variable
n identical trials
Two outcomes: Success
or Failure
P(S) = p; P(F) = q = 1 – p
Trials are independent
x is the number of S’s in n
trials
Flip a coin 3 times
Outcomes are Heads or Tails
P(H) = .5; P(F) = 1-.5 = .5
A head on flip i doesn’t
change P(H) of flip i + 1
14McClave, Statistics, 11th ed. Chapter 4:
Discrete Random Variables
16. 4.4: The Binomial Distribution
The Binomial Probability Distribution
p = P(S) on a single trial
q = 1 – p
n = number of trials
x = number of successes
xnx
qp
x
n
xP −
=)(
16McClave, Statistics, 11th ed. Chapter 4:
Discrete Random Variables
17. 4.4: The Binomial Distribution
The Binomial Probability Distribution
xnx
qp
x
n
xP −
=)(
17McClave, Statistics, 11th ed. Chapter 4:
Discrete Random Variables
18. Say 40% of the
class is female.
What is the
probability that 6
of the first 10
students walking
in will be female?
4.4: The Binomial Distribution
1115.
)1296)(.004096(.210
)6)(.4(.
6
10
)(
6106
=
=
=
=
−
−xnx
qp
x
n
xP
18McClave, Statistics, 11th ed. Chapter 4:
Discrete Random Variables
19. 4.4: The Binomial Distribution
Mean
Variance
Standard Deviation
A Binomial Random Variable has
McClave, Statistics, 11th ed. Chapter 4:
Discrete Random Variables
19
2
np
npq
npq
µ
σ
σ
=
=
=
20. 4.4: The Binomial Distribution
16250
2505.5.1000
5005.1000
2
≅==
=⋅⋅==
=⋅==
npq
npq
np
σ
σ
µ
For 1,000 coin flips,
The actual probability of getting exactly 500 heads out of 1000 flips is
just over 2.5%, but the probability of getting between 484 and 516 heads
(that is, within one standard deviation of the mean) is about 68%.
20McClave, Statistics, 11th ed. Chapter 4:
Discrete Random Variables
21. 4.5: The Poisson Distribution
Evaluates the probability of a (usually
small) number of occurrences out of many
opportunities in a …
Period of time
Area
Volume
Weight
Distance
Other units of measurement
21McClave, Statistics, 11th ed. Chapter 4:
Discrete Random Variables
22. 4.5: The Poisson Distribution
!
)(
x
e
xP
x λ
λ −
=
= mean number of occurrences in the
given unit of time, area, volume, etc.
e = 2.71828….
µ =
2
=
22McClave, Statistics, 11th ed. Chapter 4:
Discrete Random Variables
23. 4.5: The Poisson Distribution
1008.
!5
3
!
)5(
35
====
−−
e
x
e
xP
x λ
λ
Say in a given stream there are an average
of 3 striped trout per 100 yards. What is the
probability of seeing 5 striped trout in the
next 100 yards, assuming a Poisson
distribution?
23McClave, Statistics, 11th ed. Chapter 4:
Discrete Random Variables
24. 4.5: The Poisson Distribution
0141.
!5
5.1
!
)5(
5.15
====
−−
e
x
e
xP
x λ
λ
How about in the next 50 yards, assuming a
Poisson distribution?
Since the distance is only half as long, is only
half as large.
24McClave, Statistics, 11th ed. Chapter 4:
Discrete Random Variables
25. 4.6: The Hypergeometric
Distribution
In the binomial situation, each trial was
independent.
Drawing cards from a deck and replacing
the drawn card each time
If the card is not replaced, each trial
depends on the previous trial(s).
The hypergeometric distribution can be
used in this case.
McClave, Statistics, 11th ed. Chapter 4:
Discrete Random Variables
25
26. 4.6: The Hypergeometric
Distribution
McClave, Statistics, 11th ed. Chapter 4:
Discrete Random Variables
26
Randomly draw n elements from a set
of N elements, without replacement.
Assume there are r successes and N-r
failures in the N elements.
The hypergeometric random variable
is the number of successes, x, drawn
from the r available in the n selections.
27. 4.6: The Hypergeometric
Distribution
McClave, Statistics, 11th ed. Chapter 4:
Discrete Random Variables
27
−
−
=
n
N
xn
rN
x
r
xP )(
where
N = the total number of elements
r = number of successes in the N elements
n = number of elements drawn
X = the number of successes in the n elements
28. 4.6: The Hypergeometric
Distribution
McClave, Statistics, 11th ed. Chapter 4:
Discrete Random Variables
28
−
−
=
n
N
xn
rN
x
r
xP )(
)1(
)()(
2
2
−
−−
=
=
NN
nNnrNr
N
nr
σ
µ