1. Introduction 1.1 An Overview 1.2 Some Examples 1.3 A Brief History 1.4 A Chapter Summary 2. Probability 2.1 Introduction 2.2 Sample Spaces and the Algebra of Sets 2.3 The Probability Function 2.4 Conditional Probability 2.5 Independence 2.6 Combinatorics 2.7 Combinatorial Probability 2.8 Taking a Second Look at Statistics (Monte Carlo Techniques) 3. Random Variables 3.1 Introduction 3.2 Binomial and Hypergeometric Probabilities 3.3 Discrete Random Variables 3.4 Continuous Random Variables 3.5 Expected Values 3.6 The Variance 3.7 Joint Densities 3.8 Transforming and Combining Random Variables 3.9 Further Properties of the Mean and Variance 3.10 Order Statistics 3.11 Conditional Densities 3.12 Moment-Generating Functions 3.13 Taking a Second Look at Statistics (Interpreting Means) Appendix 3.A.1 MINITAB Applications 4. Special Distributions 4.1 Introduction 4.2 The Poisson Distribution 4.3 The Normal Distribution 4.4 The Geometric Distribution 4.5 The Negative Binomial Distribution 4.6 The Gamma Distribution 4.7 Taking a Second Look at Statistics (Monte Carlo Simulations) Appendix 4.A.1 MINITAB Applications Appendix 4.A.2 A Proof of the Central Limit Theorem 5. Estimation 5.1 Introduction 5.2 Estimating Parameters: The Method of Maximum Likelihood and the Method of Moments 5.3 Interval Estimation 5.4 Properties of Estimators 5.5 Minimum-Variance Estimators: The Crami?½r-Rao Lower Bound 5.6 Sufficient Estimators 5.7 Consistency 5.8 Bayesian Estimation 5.9 Taking A Second Look at Statistics (Beyond Classical Estimation) Appendix 5.A.1 MINITAB Applications 6. Hypothesis Testing 6.1 Introduction 6.2 The Decision Rule 6.3 Testing Binomial Dataâ H0: p = po 6.4 Type I and Type II Errors 6.5 A Notion of Optimality: The Generalized Likelihood Ratio 6.6 Taking a Second Look at Statistics (Statistical Significance versus â Practicalâ Significance) 7. Inferences Based on the Normal Distribution 7.1 Introduction 7.2 Comparing Y-i?½ s/ vn and Y-i?½ S/ vn 7.3 Deriving the Distribution of Y-i?½ S/ vn 7.4 Drawing Inferences About i?½ 7.5 Drawing Inferences About s2 7.6 Taking a Second Look at Statistics (Type II Error) Appendix 7.A.1 MINITAB Applications Appendix 7.A.2 Some Distribution Results for Y and S2 Appendix 7.A.3 A Proof that the One-Sample t Test is a GLRT Appendix 7.A.4 A Proof of Theorem 7.5.2 8. Types of Data: A Brief Overview 8.1 Introduction 8.2 Classifying Data 8.3 Taking a Second Look at Statistics (Samples Are Not â Validâ !) 9. Two-Sample Inferences 9.1 Introduction 9.2 Testing H0: i?½X =i?½Y 9.3 Testing H0: s2X=s2Yâ The F Test 9.4 Binomial Data: Testing H0: pX = pY 9.5 Confidence Intervals for the Two-Sample Problem 9.6 Taking a Second Look at Statistics (Choosing Samples) Appendix 9.A.1 A Derivation of the Two-Sample t Test (A Proof of Theorem 9.2.2) Appendix 9.A.2 MINITAB Applications 10. Goodness-of-Fit Tests 10.1 Introduction 10.2 The Multinomial Distribution 10.3 Goodness-of-Fit Tests: All Parameters Known 10.4 Goodness-of-Fit Tests: Parameters Unknown 10.5 Contingency Tables 10.6 Taking a Second Look at Statistics (Outliers) Appendix 10.A.1 MINITAB Applications 11. Regression 11.1 Introduction 11.2 The Method of Least Squares 11.3 The Linear Model 11.4 Covariance and Correlation 11.5 The Bivariate Normal Distribution 11.6 Taking a Second Look at Statistics (How Not to Interpret the Sample Correlation Coefficient) Appendix 11.A.1 MINITAB Applications Appendix 11.A.2 A Proof of Theorem 11.3.3 12. The Analysis of Variance 12.1 Introduction 12.2 The F Test 12.3 Multiple Comparisons: Tukeyâ s Method 12.4 Testing Subhypotheses with Contrasts 12.5 Data Transformations 12.6 Taking a Second Look at Statistics (Putting the Subject of Statistics togetherâ the Contributions of Ronald A. Fisher) Appendix 12.A.1 MINITAB Applications Appendix 12.A.2 A Proof of Theorem 12.2.2 Appendix 12.A.3 The Distribution of SSTR/(kâ 1) SSE/(nâ k)When H1 is True 13. Randomized Block Designs 13.1 Introduction 13.2 The F Test for a Randomized Block Design 13.3 The Paired t Test 13.4 Taking a Second Look at Statistics (Choosing between a Two-Sample t Test and a Paired t Test) Appendix 13.A.1 MINITAB Applications 14. Nonparametric Statistics 14.1 Introduction 14.2 The Sign Test 14.3 Wilcoxon Tests 14.4 The Kruskal-Wallis Test 14.5 The Friedman Test 14.6 Testing for Randomness 14.7 Taking a Second Look at Statistics (Comparing Parametric and Nonparametric Procedures) Appendix 14.A.1 MINITAB Applications Appendix: Statistical Tables Answers to Selected Odd-Numbered Questions Bibliography Index

http://library.um.ac.id/free-contents/downloadpdf.php/buku/an-introduction-to-mathematical-statistics-and-its-applications-richard-j-larsen-morris-l-marx-12385.pdf

An introduction to mathematical statistical and its applications / Richard J. Larsen, Morris L. Marx

The ability to predict short-term electric energy demand would provide several benefits, both at the economic and environmental level. For example, it would allow for an efficient use of resources in order to face the actual demand, reducing the costs associated to the production as well as the emission of CO 2 . To this aim, in this paper we propose a strategy based on ensemble learning in order to tackle the short-term load forecasting problem. In particular, our approach is based on a stacking ensemble learning scheme, where the predictions produced by three base learning methods are used by a top level method in order to produce final predictions. We tested the proposed scheme on a dataset reporting the energy consumption in Spain over more than nine years. The obtained experimental results show that an approach for short-term electricity consumption forecasting based on ensemble learning can help in combining predictions produced by weaker learning methods in order to obtain superior results. In particular, the system produces a lower error with respect to the existing state-of-the art techniques used on the same dataset. More importantly, this case study has shown that using an ensemble scheme can achieve very accurate predictions, and thus that it is a suitable approach for addressing the short-term load forecasting problem.

https://www.mdpi.com/1996-1073/11/4/949/pdf

Stacking Ensemble Learning for Short-Term Electricity Consumption Forecasting

Time series forecasting using machine learning algorithms has gained popularity recently. Random forest is a machine learning algorithm implemented in time series forecasting; however, most of its forecasting properties have remained unexplored. Here we focus on assessing the performance of random forests in one-step forecasting using two large datasets of short time series with the aim to suggest an optimal set of predictor variables. Furthermore, we compare its performance to benchmarking methods. The first dataset is composed by 16,000 simulated time series from a variety of Autoregressive Fractionally Integrated Moving Average (ARFIMA) models. The second dataset consists of 135 mean annual temperature time series. The highest predictive performance of RF is observed when using a low number of recent lagged predictor variables. This outcome could be useful in relevant future applications, with the prospect to achieve higher predictive accuracy.

https://www.mdpi.com/1999-4893/10/4/114/pdf

Variable Selection in Time Series Forecasting Using Random Forests

The discrete cosine transform (DCT), introduced by Ahmed, Natarajan and Rao, has been used in many applications of digital signal processing, data compression and information hiding. There are four types of the discrete cosine transform. In simulating the discrete cosine transform, we propose a generalized discrete cosine transform with three parameters, and prove its orthogonality for some new cases. A new type of discrete cosine transform is proposed and its orthogonality is proved. Finally, we propose a generalized discrete W transform with three parameters, and prove its orthogonality for some new cases. Keywords: Discrete Fourier transform, discrete sine transform, discrete cosine transform, discrete W transform Nigerian Journal of Technological Research , vol7(1) 2012

On discrete cosine transform

Distribution automation systems in terms of automatic and remote-controlled sectionalizing switches allows distribution utilities to implement flexible control of distribution networks, which is a successful strategy to enhance efficiency, reliability, and quality of service. The sectionalizing switches play a significant role in an automated distribution network, hence optimizing the allocation of switches can improve the quality of supply and reliability indices. This paper presents a mixed-integer nonlinear programming aiming to model the optimal placement of manual and automatic sectionalizing switches and protective devices in distribution networks. A value-based reliability optimization formulation is derived from the proposed model to take into consideration customer interruption cost and related costs of sectionalizing switches and protective devices. A probability distribution cost model is developed based on a cascade correlation neural network to have a more accurate reliability assessment. To ensure the effectiveness of the proposed formulation both technical and economic constraints are considered. Furthermore, introducing distributed generation into distribution networks is also considered subject to the island operation of DG units. The performance of the proposed approach is assessed and illustrated by studying on the bus 4 of the RBTS standard test system. The simulation results verify the capability and accuracy of the proposed approach.

Reliability Optimization of Automated Distribution Networks With Probability Customer Interruption Cost Model in the Presence of DG Units

Sensitive information being shared on the internet is growing. Because of this, it is increasingly necessary to take security measures whilst this information travels in the network. Digital steganography allows one to send sensitive information in a hidden manner. Although there is a plethora of techniques for such a goal, finding an appropriate one is not always simple. This paper implements and compares spatial-domain digital steganography techniques in both RGB and grayscale images. A frequency-domain heuristic for reducing the visual impact of digital steganography in grayscale images is presented. As another result of this work, a dataset is also available in the Kaggle platform with 18 GB of images, containing secret messages using the techniques under study. In addition, a Python language library was also made available in the PyPI repository, allowing for both concealment and revelation of messages using the presented digital steganography methods.

/pdf/analise-comparativa-de-metodos-para-esteganografia-digital-14jv7uavm7.pdf

Análise Comparativa de Métodos para Esteganografia Digital em Imagens

An Internet of Things (IoT) environment usually is composed by sensor nodes connected to the Internet, which constitutes a Wireless Sensor Network (WSN). In this work, the Sensor Allocation Problem (SAP) for a WSN is addressed, which defines the position of sensor nodes according to their different operation modes while pursuing the optimization of network efficiency with respect to performance parameters. An optimization methodology based on a Genetic Algorithm is proposed, in order to solve the SAP. Case studies are performed in order to evaluate the efficiency of the proposed solution method.

Topology control optimization of wireless sensor networks for IoT applications

Computer models have been an important tool to determine soil bulk density. This soil property is fundamental to estimate soil carbon reserves and consequently to understand the global carbon cycle. The estimation of soil bulk density is not a trivial task since it demands an intensive and often impractical work. The purpose of this paper is to evaluate the performance of a pedotransfer function against an Artificial Neural Networks to estimate soil bulk density for soils at Brazilian biomes. The first one consists of a linear model composed of a Least Square method. The latter employs a robust committee of multilayer perceptron networks and a model selection procedure based on k-fold cross-validation. The data are composed of 3404 soil layers distributed in different Brazilian regions and with different uses. The proposed non-linear regressor presents higher precision when compared to the linear model, and requires less information to do so. Additionally, the developed solution brings to light the assumed relationship between soil bulk density and some soil chemical properties.

Brazilian Soil Bulk Density Prediction Based on a Committee of Neural Regressors

The Wireless Body Area Networks (WBANs) are a special case of the Wireless Sensor Networks (WSNs) and, in general, are responsible for gathering and transmitting biometric data from a given patient. One of the features of the WSNs is the self–configuration; i.e., the capability that a given parameter can be adjusted regarding some occurrence in execution time. As stated, the objective of the WBANs is the gathering, through several sensors, of biometric data of a patient. In general, because of possible daily activities and/or pathologies, some sensors can be more demanded (or required) in certain periods of the day. In these situations, information of these mentioned sensors are more relevant and require larger data delivery priority. Thus, we propose QoSBody-AODV, a variation of the AODV routing protocol, which performs the dynamic adjustment of the message’s priority, turning the network functioning to be sensitive to the physical activities performed by the patient, as well as pathological information.

/pdf/prioridade-dinamica-de-mensagens-aplicada-a-redes-de-1ncht1nezp.pdf

Prioridade Dinâmica de Mensagens Aplicada a Redes de Sensores Corporais Sem-Fio

Recent advances in areas such as microelectronic, digital electronic, and wireless communications enable the development of low cost sensors with energy efficiency and small scale. In this work, a prototype of a monitoring system for liquids in industrial tanks with an ultrasonic sensor is developed. A software that interpret readings from the ultrasonic sensor is also designed and the proposed system is used to monitor the liquid volume inside the tanks. An open–source platform called Arduino is considered for the hardware in order to manage and interpret data from the sensor. Experiments with a rectangular base tank filled with water showed that the proposed monitoring system is efficient, since the volume sensed closely reaches the real one. Keywords— Liquid Monitoring, Ultrasonic Sensor, Arduino.

Laura Silva de Assis

Papers

Análise Comparativa de Métodos para Esteganografia Digital em Imagens

Topology control optimization of wireless sensor networks for IoT applications

Brazilian Soil Bulk Density Prediction Based on a Committee of Neural Regressors

Prioridade Dinâmica de Mensagens Aplicada a Redes de Sensores Corporais Sem-Fio

Liquid Monitoring System in Industrial Tanks with Ultrasonic Sensor