1. The document describes exercises from a probability and statistics lab report, including generating random vectors, estimating distributions, and assessing hypotheses.
2. For the first exercise, random vectors were generated from uniform, normal, and exponential distributions and their histograms, CDFs, and boxplots were represented. Bin sizes were also calculated.
3. Subsequent exercises involved comparing mean and variance, assessing dependence between random variables, modeling loss event data, and applying the central limit theorem.
An Exploration of the Formal Properties of PromQLBrian Brazil
Prometheus is often considered in a production sense. But what about the more formal and academic aspects? Is PromQL interesting from a Computer Science standpoint?
An Exploration of the Formal Properties of PromQLBrian Brazil
Prometheus is often considered in a production sense. But what about the more formal and academic aspects? Is PromQL interesting from a Computer Science standpoint?
Explanation on Tensorflow example -Deep mnist for expert홍배 김
you can find the exact and detailed network architecture of 'Deep mnist for expert' example of tensorflow's tutorial. I also added descriptions on the program for your better understanding.
Presented at Evolution 2013, June 24; describes an approach to teaching populations genetics at the upper undergraduate/beginning graduate level, using simulations based in R and incorporating available large genomic data sets.
Gracheva Inessa - Fast Global Image Denoising Algorithm on the Basis of Nonst...AIST
Gracheva Inessa, Kopylov Andrey, Krasotkina Olga,
(Tula State University, Tula, Russia) - Fast Global Image Denoising Algorithm on the Basis of Nonstationary Gamma-Normal Statistical Model
AIST 2015 Conference
Efficient Analysis of high-dimensional data in tensor formatsAlexander Litvinenko
We solve a PDE with uncertain coefficients. The solution is approximated in the Karhunen Loeve/PCE basis. How to compute maximum ? frequency? probability density function? with almost linear complexity? We offer various methods.
The Newton-Raphson method ( also known as Newton's method) is a way to quickly find a good approximation for the root of a real-valued function f (x) = 0f (x) = 0. It uses the idea that a nonstop and differentiable function can be approached by a straight line tangent to it.
This slide includes the basic descriptions and function determinations ideas.
Explanation on Tensorflow example -Deep mnist for expert홍배 김
you can find the exact and detailed network architecture of 'Deep mnist for expert' example of tensorflow's tutorial. I also added descriptions on the program for your better understanding.
Presented at Evolution 2013, June 24; describes an approach to teaching populations genetics at the upper undergraduate/beginning graduate level, using simulations based in R and incorporating available large genomic data sets.
Gracheva Inessa - Fast Global Image Denoising Algorithm on the Basis of Nonst...AIST
Gracheva Inessa, Kopylov Andrey, Krasotkina Olga,
(Tula State University, Tula, Russia) - Fast Global Image Denoising Algorithm on the Basis of Nonstationary Gamma-Normal Statistical Model
AIST 2015 Conference
Efficient Analysis of high-dimensional data in tensor formatsAlexander Litvinenko
We solve a PDE with uncertain coefficients. The solution is approximated in the Karhunen Loeve/PCE basis. How to compute maximum ? frequency? probability density function? with almost linear complexity? We offer various methods.
The Newton-Raphson method ( also known as Newton's method) is a way to quickly find a good approximation for the root of a real-valued function f (x) = 0f (x) = 0. It uses the idea that a nonstop and differentiable function can be approached by a straight line tangent to it.
This slide includes the basic descriptions and function determinations ideas.
Kazushi Okamoto: Families of Triangular Norm Based Kernel Function and Its Application to Kernel k-means, Joint 8th International Conference on Soft Computing and Intelligent Systems and 17th International Symposium on Advanced Intelligent Systems (SCIS-ISIS2016), 2016.08.25
MVPA with SpaceNet: sparse structured priorsElvis DOHMATOB
The GraphNet (aka S-Lasso), as well as other “sparsity + structure” priors like TV (Total-Variation), TV-L1, etc., are not easily applicable to brain data because of technical problems
relating to the selection of the regularization parameters. Also, in
their own right, such models lead to challenging high-dimensional optimization problems. In this manuscript, we present some heuristics for speeding up the overall optimization process: (a) Early-stopping, whereby one halts the optimization process when the test score (performance on leftout data) for the internal cross-validation for model-selection stops improving, and (b) univariate feature-screening, whereby irrelevant (non-predictive) voxels are detected and eliminated before the optimization problem is entered, thus reducing the size of the problem. Empirical results with GraphNet on real MRI (Magnetic Resonance Imaging) datasets indicate that these heuristics are a win-win strategy, as they add speed without sacrificing the quality of the predictions. We expect the proposed heuristics to work on other models like TV-L1, etc.
Ubiquitous computing described in the domain of Computer Vision and how these two concepts can be deployed in IoT. Why future integrity is necessary to achieve a better technology for the future world.
"Bugünün Teknolojisi ve Korkusuz Makinelerin Yarını!"
"Today's Tech versus Brave Machine's Tomorrow !"
Yarının güvenli geleceğini inşa etmek için ihtiyacımız olan makine felsefesi nedir sizce? Bu konuşmamda Bilgisayar Görüsü'nün kilit taşı olacağı çözümlerden bahsedeceğiz. Günümüz tekniklerini ve bu tekniklerin sınırlarını inceleyeceğiz.
Today's Tech versus Brave Machine's Tomorrow !
What kind of machine philosophy do we need to build safe future of tomorrow? We will talk about proposals of computer vision as future's keystones. By examining today's pain points and limitations we will try to derive tomorrow's technologic boundaries.
Teknoloji insanların alışkanlıklarını değiştirmeden onların hayatlarını iyileştirebilir mi ? Bu konuşmamda Digital Wellbeing hedefiyle Bilgisayar Görüsü'nden nasıl faydalanabileceğimizden bahsediyoruz. Dijitalizasyon sürecine yeni bir bakış açısı getirdik ve dijitalizasyon sürecinin kontrol altına alınıp toplumsal faydayı gözetmesi gerektiğinin altını çizdik. Aksi durumlarda toplum psikolojisinde ortaya çıkmış olan problemlere değindik. Bilgisayar görüsü teknolojik bağımlılık yaratmadan ve temas gözetmeden hayatımızı iyileştirebilecek çıkarımı yapabilir. Bu anlamda potansiyeli doğru değerlendirmek için digital wellbeing peşinden gidilesi bir amaç ve faydalı bir sonuçtur. Bilgisayar görüsü ve digital wellbeing isimli iki faydalı konsepti birleştirmenin vakti geldi.
Activity Recognition Using RGB-Depth Sensors-Final reportnazlitemu
Current state of art contains several methods to achieve intelligent recognition. Some methods are machine learning oriented.In these methods , activities are learnt from the context in an
unsupervised or semi supervised manner. One other method is description based event recognition. In the heart of the method, describing scenarios wrt activities employed. For the
description, a language is necessarily needed. There are mathematical languages in which logic is used to represent activities and their relations. Also some graphical languages such as hidden markov models, state machines, state charts are being used. Some textual languages proposed as well.
In this study , i will be performing an analysis on a constraint satisfaction applied, RGBD based algorithm to improve the algorithm. I dealt with unconstraint environment of a nursing
home. Existing algorithm includes detection-tracking and recognition. To be able to improve the recognition, i dealt with its description based nature by investigating defined event models
and constraints. I find it useful to extend existing event scopes with modeling existential qualifications, a route-target, appear, disappear and increase and decrease properties.
Algorithm improvement is done with respect to recognition of multiple actor scene.
Current state of art contains several methods to achieve intelligent tracking. Some methods are machine learning oriented. In these methods, activities are learnt from the context in an unsupervised or semi supervised manner. One other method is description based event recognition. In the heart of the method , describing scenarios wrt activities employed. For the description, a language is necessarily needed. There are mathematical languages in which logic is used to represent activities and their relations.Also some graphical languages such as hidden markov models, state machines, state charts are being used. Some textual languages proposed as well.
This presentation gives some details about graph representation through touching domains. It is also known as kissing disk representation or circle packing. I tried to prove that Koebe's Theorem holds by using Brouwer Fixed-Point Theorem.
Antescofo Syncronous Languages for Musical Composition nazlitemu
Antescofo is a syncronous language that is composed of some properties that Esterel and Lustral Languages..
Antesfoco is a project that is dedicated to generate intelligent contribution of the computers to the live music syntesis.
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Water scarcity is the lack of fresh water resources to meet the standard water demand. There are two type of water scarcity. One is physical. The other is economic water scarcity.
2. Introduction
This lab includes 5 main exercises that should be completed by the help of R Tool.
I achived to complete all the exercises except 5th one and this report includes a small
brief as per exercises along with R codes&outcomes.
Exercise 1
1.1 Generate 3 random vectors of size 10000 from different distributions .
• A uniform distribution between 0 and 1.
unif <-runif(10000,0.0,1.0)
• AnormaldistributionN(0,10)
norm<-rnorm(10000,0,sqrt(10))
• A exponential distribution of parameter λ = 2
rexp(10000,2)
a) What is the number of bins to be used to represent the corresponding
histograms according to Sturge’s rule?
Technically, Sturges’ rule is a number-of-bins rule rather than a bin-width rule.
> number_of_bin=log(10000,base=2)+1
> number_of_bin
[1] 14.28771
PROBABILITY&STATISTICS - NAZLI TEMUR 2
n=1+log
2
N
3. b) What is the bin size according to the Normal Reference rule?
For Uniform : ((24*(sd(unif)^2)*sqrt(pi))/10000)^(1/3)
0.0706738
For Normal : ((24*(sd(norm)^2)*sqrt(pi))/10000)^(1/3)
0.3470349
For Exponantial : ((24*(sd(exp)^2)*sqrt(pi))/10000)^(1/3)
0.1013582
c) What is the number of bins for each sample vector you have generated
according to the Normal Reference Rule ?
For Uniform :
> unif_n=NULL
> unif_max=length(unif)
> unif_min=0
> unif_n=(unif_max-unif_min)/unif_h
> unit_n [1] 141495.2
PROBABILITY&STATISTICS - NAZLI TEMUR 3
4. For Normal :
> norm_n=NULL //number
> norm_max=length(norm) // number of elements
> norm_max
[1] 10000
> norm_min=0
> norm_n=(norm_max-norm_min)/norm_h
> norm_n //number of elements divided by width of bin equally gives number of bin
[1] 28815.54
For Exponantial :
> exp_n=NULL
> exp_max=length(exp)
> exp_min=0
> exp_n=(exp_max-exp_min)/exp_h
> exp_n
[1] 98660.04
PROBABILITY&STATISTICS - NAZLI TEMUR 4
5. d) Represent the histograms (R is using Sturge’s rule with improvements, hence
you can just use hist(X)) , cdfs and boxplots of each random vector.
hist(unif)
boxplot(unif)
plot.ecdf(unif)
hist(norm)
boxplot(norm)
plot.ecdf(norm)
hist(exp)
boxplot(exp)
plot.ecdf(exp)
PROBABILITY&STATISTICS - NAZLI TEMUR 5
6. 1.2 For each random vector, compute the empirical variance and the empirical IQR
and plot those pairs in a graph.
Varvector=NULL
IQRvector=NULL
for(V in seq(1,1000,by=50))
{
+ x<-rnorm(1000,0,sqrt(V))
+ IQRvector=c(IQRvector,IQR(x))
+ Varvector=c(Varvector,var(x))
}
plot(IQRvector,Varvector)
PROBABILITY&STATISTICS - NAZLI TEMUR 6
7. Exercise 2
2. E[1/X] vs. 1/E[X]
Let us consider the family of uniform distributions in the interval [100 − v, 100 + v] for v > 0
2.1. What are the mean/variance of the family?
x=[a,b] //a =100-v b=100+v
E=[a+b]/2 //mean
V= [b-a]^2/12 //variance
E=(100+v-(100-v))/2 =100 it means the mean is not depend the variance of this uniform
distribution of interval.
V=((100+v) -(100-v))^2 /12 =(2v)^2/12 = v^2/3 which means, the variance is impacted
exponentially depend on the v value.
2.2. For each v ∈ {1, 2, . . . 30}, draw a random vector of size 1000, compute its empirical
variance v[X] as well as E[1/X] (simply mean(1/x) in R). Plot the pairs (E[1/X] − 1/E[X],
> for(v in seq(1,30,by=1))
+ { E=(100-v)+(100+v)/2
+ V=((100+v)-(100-v))^2/12
+ Vector_x<-rnorm(1000,E,V)
+ }
> for(v in seq(1,30,by=1))
+ { E=(100-v)+(100+v)/2
PROBABILITY&STATISTICS - NAZLI TEMUR 7
8. + V=((100+v)-(100-v))^2/12
+ Vector_y<-rnorm(1000,1/E,V)
+ }
> plot(Vector_x,Vector_y)
Exercise 3
3. Dependence vs. similar distribution
3.1. Draw a random variable X and a random variable Y (both of size 10000) from the same
exponen- tial distribution of parameter λ = 2. Plot the qqplot and the scatterplot of X and Y .
The scatterplot is simply obtained by plot(X,Y). In the scatterplot, it might be useful to zoom
in where the mass is. You can adjust the x-axis (resp. y-axis) between the 10-th and 90-th
quantiles of X (resp. Y) with the command :
> X<-rexp(10000,2)
> Y<-rexp(10000,2)
> plot(X,Y,main="Scatter Plot")
> qqplot(X,Y,main="QQ Plot")
PROBABILITY&STATISTICS - NAZLI TEMUR 8
9. For Adjusment :
> min_x=quantile(X,0.1)
> max_x=quantile(X,0.9)
> min_y=quantile(Y,0.1)
> max_y=quantile(Y,0.9)
> X2<-X[X>min_x&X<max_x]
> Y2<-Y[Y>min_y&Y<max_y]
> plot(X2,Y2,main="Adjusted Scatter Plot")
> qqplot(X2,Y2,main="Adjusted QQ Plot")
>
3.2. Let Z = log(X) + 5. Plot the qqplot and the scatterplot of X and Z. Comment the results
PROBABILITY&STATISTICS - NAZLI TEMUR 9
10. The distribution of new vector Z follows the same distribution.We can see this via QQ Plot.
and If we try to draw a scatter plot it will look like line because there is a relation between Z
and X such that Z=a(x)+c , because a is a log of X vector the line will be convergent like
logarithm function.
>Z<-log(X)+5
> qqplot(Z,X,main=" QQ Plot X-Z”)
> Z2<-log(X2)+5
> qqplot(Z2,X2,main="Adjusted QQ Plot X2-Z2")
PROBABILITY&STATISTICS - NAZLI TEMUR 10
12. 4.2 Assessing the exponential hypothesis
4.2.1. For each of the 2 connections (the cleaned versions obtained from the previous
question), estimate the parameter of the exponential distribution that should model it.
First File
> myfile=scan("~/Desktop/LAB/147.32.125.132.loss.txt")
> Read 3439 items
> min=quantile(myfile,0.1)
> max=quantile(myfile,0.9)
> X<-myfile
> X2<-X[X>min&X<max]
> Mean_vector_x=NULL
> for(V in seq(1,1000,by=1)) {
+ x<-rnorm(1000,mean(X2),sqrt(var(X2)))
+ y<-sample(x,10)
+ Mean_vector_x<-c(Mean_vector_x,mean(y))
+ }
+ > hist(Mean_vector_x,main=“Sample Means")
+ > plot(Mean_vector_x,main=“Sample Means”)
Second File
PROBABILITY&STATISTICS - NAZLI TEMUR 12
13. Second File
> myfile2=scan("~/Desktop/LAB/195.204.26.25.loss.txt")
Read 16091 items
> min2=quantile(myfile2,0.1)
> max2=quantile(myfile2,0.9)
> Y<-myfile2
> Y2<-Y[Y>min&Y<max]
> Mean_vector_y=NULL
> for(V in seq(1,1000,by=1)) {
+ x<-rnorm(1000,mean(Y2),sqrt(var(Y2)))
+ y<-sample(x,10)
+ Mean_vector_y<-c(Mean_vector_y,mean(y))
+ }
+ > hist(Mean_vector_y,main=“Sample Means of Second File ")
+ > plot(Mean_vector_y,main=“Sample Means of Second File ")
PROBABILITY&STATISTICS - NAZLI TEMUR 13
14. 4.2.2 For each of the 2 connections, generate a random vector following the exponential
distribution of size 1000, represent the qqplot of each vector and the corresponding trace.
Comment.
qqplot(Mean_vector_x,Mean_vector_y)
Exercise 5
5. Central limit theorem
• A uniform distribution between 0 and 1.
• AnormaldistributionN(0,10)
• A exponential distribution of parameter λ = 2
5.1 Report in a table the empirical (resp. theoretical) mean and standard deviation for each
random vector (resp. random variable).
5.2 Prove that we are in the conditions of the theorem for each vector.
PROBABILITY&STATISTICS - NAZLI TEMUR 14
15. 5.3 Towards which distribution should
︎
(n)(Sn − #) should converge in each case.
5.4 Represent in a table with three columns (one for each original distribution) and two
rows corresponding to:
• the histogram of the original distributions
• S10
5.5 Report also the empirical mean and standard deviation for S10 for all cases.
PROBABILITY&STATISTICS - NAZLI TEMUR 15