Skip to content.
|
Skip to navigation
Log In
Contact Us
Report a Bug
Search Site
Connexions
Sections
Home
Content
Lenses
About Us
Help
MyCNX
You are here:
Home
»
Content
Browse by Author:
C. Sidney Burrus
View author profile
Return to Browsing Content
|
Search for Content
Content by C. Sidney Burrus
Other authors' collections containing modules by C. Sidney Burrus
Content based on works by C. Sidney Burrus (derived copies)
Content maintained by C. Sidney Burrus
(What are
modules
and
collections
?)
Sort by:
Popularity
Language
Revision Date
Title
Type
Results per page:
10
25
100
View:
Detail
|
Compact
|
Statistics
« Previous
10
1
2
3
[
4
]
5
6
7
...
34
Next
10
»
Simple Random Samples and Statistics
(m23496)
Author:
Paul E Pfeiffer
Maintainers:
Paul E Pfeiffer
,
Daniel Williamson
,
C. Sidney Burrus
Keywords:
Matllab techniques
,
Population distribution
,
Population parameters
,
Random sample
,
Sample parameters
,
Sampling process
,
Statistic as estimator
Summary:
The (simple) random sample, is basic to much of classical statistics. Once formulated, we may apply probability theory to exhibit several basic ideas of statistical analysis. A population may be most any collection of individuals or entities. Associated with each member is a quantity or a feature that can be ... population parameters.
[Expand Summary]
The (simple) random sample, is basic to much of classical statistics. Once formulated, we may apply probability theory to exhibit several basic ideas of statistical analysis. A population may be most any collection of individuals or entities. Associated with each member is a quantity or a feature that can be assigned a number. The population distribution is the distribution of that quantity among the members of the population. To obtain information about the population distribution, we select “at random” a subset of the population and observe how the quantity varies over the sample. Hopefully, the distribution in the sample will give a useful approximation to the population distribution. We obtain values of such quantities as the mean and variance in the sample (which are random quantities) and use these as estimators for corresponding population parameters (which are fixed). Probability analysis provides estimates of the variation of the sample parameters about the corresponding population parameters.
[Collapse Summary]
Subject:
Mathematics and Statistics
Language:
English
Popularity:
81.92%
Revised:
2009-09-18
Revisions:
8
Minterms
(m23247)
Author:
Paul E Pfeiffer
Maintainers:
Paul E Pfeiffer
,
Daniel Williamson
,
C. Sidney Burrus
Keywords:
applied probability
,
minterm expansion
,
minterm maps
,
minterms
,
minterm vectors
,
partitions
Summary:
A fundamental problem is to determine the probability of a logical (Boolean) combination of a finite class of events, when the probabilities of certain other combinations are known. If we partition an event F into component events whose probabilities can be determined, then the additivity property implies the probability of ... orderly arrangement.
[Expand Summary]
A fundamental problem is to determine the probability of a logical (Boolean) combination of a finite class of events, when the probabilities of certain other combinations are known. If we partition an event F into component events whose probabilities can be determined, then the additivity property implies the probability of F is the sum of these component probabilities. Frequently, the event F is a Boolean combination of members of a finite class -- say {A, B, C} or {A, B, C,D}. For each such finite class, there is a fundamental partition determined by the class. The members of this partition are called minterms. Any Boolean combination of members of the class can be expressed as the disjoint union of a unique subclass of the minterms. If the probability of every minterm in this subclass can be determined, then by additivity the probability of the Boolean combination is determined. An important geometric aid to analysis is the minterm map, which has spaces for minterms in an orderly arrangement.
[Collapse Summary]
Subject:
Mathematics and Statistics
Language:
English
Popularity:
80.98%
Revised:
2009-09-18
Revisions:
8
Convergence and the central Limit Theorem
(m23475)
Author:
Paul E Pfeiffer
Maintainers:
Paul E Pfeiffer
,
Daniel Williamson
,
C. Sidney Burrus
Keywords:
Convergence of sequences of random variables
,
Relationships between types of convergence
,
Weak law of large numbers
Summary:
The central limit theorem (CLT) asserts that the sum of a large class of independent random variables, each with reasonable distributions,is approximately normally distributed. Various versions of this theorem have been studied intensively. On the other hand, certain common forms serve as the basis of an extraordinary amount of ... quite appropriate
[Expand Summary]
The central limit theorem (CLT) asserts that the sum of a large class of independent random variables, each with reasonable distributions,is approximately normally distributed. Various versions of this theorem have been studied intensively. On the other hand, certain common forms serve as the basis of an extraordinary amount of applied work. In the statistics of large samples, the sample average is approximately normal—whether or not the population distribution is normal. In much of the theory of errors of measurement, the observed error is the sum of a large number of independent random quantities which contribute additively to the result. Similarly, in the theory of noise, the noise signal is the sum of a large number of random components, independently produced. In such situations, the assumption of a normal population distribution is frequently quite appropriate
[Collapse Summary]
Subject:
Mathematics and Statistics
Language:
English
Popularity:
80.92%
Revised:
2009-09-18
Revisions:
6
An Introduction to MATLAB: Loops and Control
(m21392)
Author:
Louis Scharf
Maintainers:
Louis Scharf
,
Daniel Williamson
,
C. Sidney Burrus
,
Richard Baraniuk
Keywords:
electrical engineering
,
engineering
,
MATLAB
Subject:
Mathematics and Statistics
Language:
English
Popularity:
80.58%
Revised:
2009-09-16
Revisions:
5
2008-'09 Open Education Cup: High Performance Computing
(col10594)
Author:
Jan E. Odegard
Maintainers:
Jan E. Odegard
,
Amy Kavalewitz
,
Charles Koelbel
,
C. Sidney Burrus
,
Jonathan Emmons
,
Katherine Fletcher
,
Connexions
Keywords:
High Performance Computing
,
HPC
,
Open Education Resources
,
Parallel Programming
Summary:
This collection provides an overview of the 2008-'09 Open Education Cup competition. Contest rules, author resources, and example content are provided. This competition is intended to encourage development of original educational content in the field of parallel computing, with cash prizes awarded to contest winners. Selected modules will be ... through Connexions.
[Expand Summary]
This collection provides an overview of the 2008-'09 Open Education Cup competition. Contest rules, author resources, and example content are provided. This competition is intended to encourage development of original educational content in the field of parallel computing, with cash prizes awarded to contest winners. Selected modules will be included as part of a new collection available through Connexions.
[Collapse Summary]
Subject:
Science and Technology
Language:
English
Popularity:
80.55%
Revised:
2008-10-28
Revisions:
3
Matlab Procedures for Markov Decision Processes
(m31095)
Author:
Paul E Pfeiffer
Maintainers:
Paul E Pfeiffer
,
Daniel Williamson
,
Richard Baraniuk
,
C. Sidney Burrus
,
Jared Adler
Keywords:
Alpha potential
,
Alpha-potential matrix
,
Costs and rewards
,
Decision policy
,
Discounting and potentials
,
Gain patterns
,
Long run averages
,
Markov chain
,
Matlab policy procedures
,
Matlab procedures w discounting
,
Next period gains
,
Policy iteration
,
Recurrence relation
,
State space
Summary:
We first summarize certain essentials in the analysis of homogeneous Markov chains with costs and rewards associated with states, or with transitions between states. Then we consider three cases: a. Gain associated with a state; b. One-step transition gains; and c. Gains associated with a demand under certain reasonable ... of problems.
[Expand Summary]
We first summarize certain essentials in the analysis of homogeneous Markov chains with costs and rewards associated with states, or with transitions between states. Then we consider three cases: a. Gain associated with a state; b. One-step transition gains; and c. Gains associated with a demand under certain reasonable conditions. Matlab implementations of the results of analysis provide machine solutions to a variety of problems.
[Collapse Summary]
Subject:
Mathematics and Statistics
Language:
English
Popularity:
80.44%
Revised:
2009-09-18
Revisions:
7
Adaptive Quantization
(m32074)
Author:
Phil Schniter
Maintainers:
Phil Schniter
,
Daniel Williamson
,
Richard Baraniuk
,
C. Sidney Burrus
,
Jared Adler
Keywords:
adaptive quantization
,
AQB
,
AQF
,
forgetting factor
,
learning period
,
non-stationary
,
uniform quantization
Summary:
Motivated by the practical problem of non-stationary sources, adaptation of the uniform quantizer's stepsize is discussed. In particular, adaptive quantization based on forward estimation (AQF) and backward estimation (AQB) are discussed, in both block-based and recursive forms.
Subject:
Mathematics and Statistics
Language:
English
Popularity:
80.27%
Revised:
2009-09-22
Revisions:
2
Linear Algebra: Introduction
(m21454)
Author:
Louis Scharf
Maintainers:
Louis Scharf
,
Daniel Williamson
,
C. Sidney Burrus
,
Richard Baraniuk
Keywords:
electrical engineering
,
engineering
,
linear algebra
Subject:
Mathematics and Statistics
Language:
English
Popularity:
80.09%
Revised:
2009-09-16
Revisions:
7
Conditional Independence
(m23258)
Author:
Paul E Pfeiffer
Maintainers:
Paul E Pfeiffer
,
Daniel Williamson
,
C. Sidney Burrus
Keywords:
Equivalent conditions
,
Independence techniques
,
Product rule
,
Replacement rule
Summary:
The idea of stochastic (probabilistic) independence is approached as lack of conditioning: P(A|B)=P(A). This is equivalent to the product rule P(AB)=P(A)P(B). We consider an extension to conditional independence. Using the facts on repeated conditioning and the equivalent conditions for independence, we ... rule extends.
[Expand Summary]
The idea of stochastic (probabilistic) independence is approached as lack of conditioning: P(A|B)=P(A). This is equivalent to the product rule P(AB)=P(A)P(B). We consider an extension to conditional independence. Using the facts on repeated conditioning and the equivalent conditions for independence, we may produce a similar table of equivalent conditions for conditional independence. In a given problem, one or the other of these conditions may seem a reasonable assumption. As soon as one of these patterns is recognized, then all are equally valid assumptions. Because of its simplicity and symmetry, we take as the defining condition the product rule P(AB|C)=P(A|C)P(B|C). As in the case of simple independence, the replacement rule extends.
[Collapse Summary]
Subject:
Mathematics and Statistics
Language:
English
Popularity:
78.03%
Revised:
2009-09-18
Revisions:
8
Binary Codes: Hamming Codes for Channel Coding
(m21403)
Author:
Louis Scharf
Maintainers:
Louis Scharf
,
Daniel Williamson
,
C. Sidney Burrus
,
Richard Baraniuk
Keywords:
Binary codes
,
electrical engineering
,
engineering
Subject:
Mathematics and Statistics
Language:
English
Popularity:
77.68%
Revised:
2009-09-16
Revisions:
5
« Previous
10
1
2
3
[
4
]
5
6
7
...
34
Next
10
»
Popularity is measured as percentile rank of page views/day over all time
My Account
Username
Password
Cookies are not enabled. You must
enable cookies
before you can log in.
Get an account
Forgot your password?
Repository
Total Collections:
1317
Visit a random collection
Total Modules:
21758
Visit a random module