Exact Probability Distribution versus Entropy

The problem addressed concerns the determination of the average numberof successive attempts of guessing a word of a certain length consisting of letters withgiven probabilities of occurrence. Both first- and second-order approximations to a naturallanguage are considered. The guessing strategy used is guessing words in decreasing orderof probability. When word and alphabet sizes are large, approximations are necessary inorder to estimate the number of guesses. Several kinds of approximations are discusseddemonstrating moderate requirements regarding both memory and central processing unit(CPU) time. When considering realistic sizes of alphabets and words (100), the numberof guesses can be estimated within minutes with reasonable accuracy (a few percent) andmay therefore constitute an alternative to, e.g., various entropy expressions. For manyprobability distributions, the density of the logarithm of probability products is close to anormal distribution. For those cases, it is possible to derive an analytical expression for theaverage number of guesses. The proportion of guesses needed on average compared to thetotal number decreases almost exponentially with the word length. The leading term in anasymptotic expansion can be used to estimate the number of guesses for large word lengths.Comparisons with analytical lower bounds and entropy expressions are also provided.

Asymptotic and structural properties of special cases of the Wright function arising in probability theory

This analysis paper presents previously unknown properties of some special cases of the Wright function whose consideration is necessitated by our work on probability theory and the theory of stochastic processes. Specifically, we establish new asymptotic properties of the particular Wright function 1Ψ1(ρ, k; ρ, 0; x) = X∞ n=0 Γ(k + ρn) Γ(ρn) x n n! (|x| < ∞) when the parameter ρ ∈ (−1, 0)∪(0, ∞) and the argument x is real. In the probability theory applications, which are focused on studies of the Poisson-Tweedie mixtures, the parameter k is a non-negative integer. Several representations involving well-known special functions are given for certain particular values of ρ. The asymptotics of 1Ψ1(ρ, k; ρ, 0; x) are obtained under numerous assumptions on the behavior of the arguments k and x when the parameter ρ is both positive and negative. We also provide some integral representations and structural properties involving the ‘reduced’ Wright function 0Ψ1(−−; ρ, 0; x) with ρ ∈ (−1, 0) ∪ (0, ∞), which might be useful for the derivation of new properties of members of the power-variance family of distributions. Some of these imply a reflection principle that connects the functions 0Ψ1(−−;±ρ, 0; ·) and certain Bessel functions. Several asymptotic relationships for both particular cases of this function are also given. A few of these follow under additional constraints from probability theory results which, although previously available, were unknown to analysts.

Analysis on the connotation of probability in the artificial intelligence algorithm for economic decision making.

This paper analyzes the inner relations between classical sub-scheme probability and statistic probability, subjective probability and objective probability, prior probability and posterior probability, transition probability and probability of utility, and further analysis the goal, method, and its practical economic purpose which represent by these various probability from the perspective of mathematics, so as to deeply understand there connotation and its relation with economic decision making, thus will pave the route for scientific predication and decision making.

Model Probability in Self-organising Maps

Growing models have been widely used for clustering or topology learning. Traditionally these models work on stationary environments, grow incrementally and adapt their nodes to a given distribution based on global parameters. In this paper, we present an enhanced unsupervised self-organising network for the modelling of visual objects. We first develop a framework for building non-rigid shapes using the growth mechanism of the self-organising maps, and then we define an optimal number of nodes without overfitting or underfitting the network based on the knowledge obtained from information-theoretic considerations. We present experimental results for hands and we quantitatively evaluate the matching capabilities of the proposed method with the topographic product.

Probability and Common-Sense: Tandem Towards Robust Robotic Object Recognition in Ambient Assisted Living

The suitable operation of mobile robots when providing Ambient Assisted Living (AAL) services calls for robust object recognition capabilities. Probabilistic Graphical Models (PGMs) have become the de-facto choice in recognition systems aiming to e ciently exploit contextual relations among objects, also dealing with the uncertainty inherent to the robot workspace. However, these models can perform in an inco herent way when operating in a long-term fashion out of the laboratory, e.g. while recognizing objects in peculiar con gurations or belonging to new types. In this work we propose a recognition system that resorts to PGMs and common-sense knowledge, represented in the form of an ontology, to detect those inconsistencies and learn from them. The utilization of the ontology carries additional advantages, e.g. the possibility to verbalize the robot's knowledge. A primary demonstration of the system capabilities has been carried out with very promising results.

Computer Aided Design Algorithmic Technique for Very Large Scale Integrated Circuit Design and Smart Home Embedded System Design

To tackle the challenges at circuit level and system level VLSI and embedded system design, this dissertation proposes various novel algorithms to explore the efficient solutions. At the circuit level, a new reliability-driven minimum cost Steiner routing and layer assignment scheme is proposed, and the first transceiver insertion algorithmic framework for the optical interconnect is proposed. At the system level, a reliability-driven task scheduling scheme for multiprocessor real-time embedded systems, which optimizes system energy consumption under stochastic fault occurrences, is proposed. The embedded system design is also widely used in the smart home area for improving health, wellbeing and quality of life. The proposed scheduling scheme for multiprocessor embedded systems is hence extended to handle the energy consumption scheduling issues for smart homes. The extended scheme can arrange the household appliances for operation to minimize monetary expense of a customer based on the time-varying pricing model.

SAMPLING BIAS IN EVALUATING THE PROBABILITY OF SEISMICALLY INDUCED SOIL LIQUEFACTION WITH SPT & CPT CASE HISTORIES

Several deterministic and probabilistic methods are used to evaluate the probability of seismically induced liquefaction of a soil. The probabilistic models usually possess some uncertainty in that model and uncertainties in the parameters used to develop that model. These model uncertainties vary from one statistical model to another. Most of the model uncertainties are epistemic, and can be addressed through appropriate knowledge of the statistical model. One such epistemic model uncertainty in evaluating liquefaction potential using a probabilistic model such as logistic regression is sampling bias. Sampling bias is the difference between the class distribution in the sample used for developing the statistical model and the true population distribution of liquefaction and non-liquefaction instances. Recent studies have shown that sampling bias can significantly affect the predicted probability using a statistical model. To address this epistemic uncertainty, a new approach was developed for evaluating the probability of seismically-induced soil liquefaction, in which a logistic regression model in combination with Hosmer-Lemeshow statistic was used. This approach was used to estimate the population (true) distribution of liquefaction to non-liquefaction instances of standard penetration test (SPT) and cone penetration test (CPT) based most updated case histories. Apart from this, other model uncertainties such as distribution of explanatory variables and significance of explanatory variables were also addressed using KS test and Wald statistic respectively. Moreover, based on estimated population distribution, logistic regression equations were proposed to calculate the probability of liquefaction for both SPT and CPT based case history. Additionally, the proposed probability curves were compared with existing probability curves based on SPT and CPT case histories.

Relevant Aspects on Teaching Probability and Statistics in Basic General Education

Probability and Statistics were included in the Basic General Education curricula by the Ministry of Public Education (Costa Rica), since 1995. To analyze the teaching reality in these fields, a research was conducted in two educational regions of the country: Heredia and Pérez Zeledón. The survey included university training and updating processes of teachers teaching Statistics and Probability in the schools. The research demonstrated the limited university training in these fields, the dissatisfaction of teachers about it, and the poor support of training institutions to their professional exercise.

Individuals in the Workplatform. Exploring Implications for Work Identity and Algorithmic Reputation Management

In the new world of work, workers not only change jobs more frequently, but also perform independent work on online labor markets. As they accomplish smaller and shorter jobs at the boundaries of organizations, employment relationships become unstable and career trajectories less linear. These new working conditions question the validity of existing management theories and call for more studies explaining gig workers’ behavior. Aim of this dissertation is contributing to this emerging body of knowledge by (I) exploring how gig workers shape their work identity on online platforms, and (II) investigating how algorithmic reputation changes dynamics of quality signaling and affects gig workers’ behavior. Chapter 1 introduces the debate on gig work, detailing why existing theories and definitions cannot be applied to this emergent workforce. Chapter 2 provides a systematic review of studies on individual work in online labor markets and identifies areas for future research. Chapter 3 describes the exploratory, qualitative methodology applied to collect and analyze data. Chapter 4 presents the first empirical paper investigating how the process of work identity construction unfolds for gig workers. It explores how digital platforms, intended both as providers of technological features and online environments, affect this process. Findings reveal the online environment constrains the action of workers who are pushed to take advantage of platform’s technological features to succeed. This interplay leads workers to develop an entrepreneurial orientation. Drawing on signaling theory, Chapter 5 understands how gig workers interpret algorithmic calculated reputation and with what consequences for their experience. Results show that, after complying to platform’s rules in the first period, freelancers respond to algorithmic management through different strategies – i.e. manipulation, nurturing relationships, and living with it. Although reputation scores standardize information on freelancers’ quality, and, apparently, freelancers’ work, this study shows instead responses to algorithmic control can be diverse.

Algorithmic business and EU law on fair trading

This thesis studies how commercial practice is developing with artificial intelligence (AI) technologies and discusses some normative concepts in EU consumer law. The author analyses the phenomenon of 'algorithmic business', which defines the increasing use of data-driven AI in marketing organisations for the optimisation of a range of consumer-related tasks. The phenomenon is orienting business-consumer relations towards some general trends that influence power and behaviors of consumers. These developments are not taking place in a legal vacuum, but against the background of a normative system aimed at maintaining fairness and balance in market transactions. The author assesses current developments in commercial practices in the context of EU consumer law, which is specifically aimed at regulating commercial practices. The analysis is critical by design and without neglecting concrete practices tries to look at the big picture. The thesis consists of nine chapters divided in three thematic parts. The first part discusses the deployment of AI in marketing organisations, a brief history, the technical foundations, and their modes of integration in business organisations. In the second part, a selected number of socio-technical developments in commercial practice are analysed. The following are addressed: the monitoring and analysis of consumers’ behaviour based on data; the personalisation of commercial offers and customer experience; the use of information on consumers’ psychology and emotions, the mediation through marketing conversational applications. The third part assesses these developments in the context of EU consumer law and of the broader policy debate concerning consumer protection in the algorithmic society. In particular, two normative concepts underlying the EU fairness standard are analysed: manipulation, as a substantive regulatory standard that limits commercial behaviours in order to protect consumers’ informed and free choices and vulnerability, as a concept of social policy that portrays people who are more exposed to marketing practices.

Statistical learning of random probability measures

The study of random probability measures is a lively research topic that has attracted interest from different fields in recent years. In this thesis, we consider random probability measures in the context of Bayesian nonparametrics, where the law of a random probability measure is used as prior distribution, and in the context of distributional data analysis, where the goal is to perform inference given avsample from the law of a random probability measure. The contributions contained in this thesis can be subdivided according to three different topics: (i) the use of almost surely discrete repulsive random measures (i.e., whose support points are well separated) for Bayesian model-based clustering, (ii) the proposal of new laws for collections of random probability measures for Bayesian density estimation of partially exchangeable data subdivided into different groups, and (iii) the study of principal component analysis and regression models for probability distributions seen as elements of the 2-Wasserstein space. Specifically, for point (i) above we propose an efficient Markov chain Monte Carlo algorithm for posterior inference, which sidesteps the need of split-merge reversible jump moves typically associated with poor performance, we propose a model for clustering high-dimensional data by introducing a novel class of anisotropic determinantal point processes, and study the distributional properties of the repulsive measures, shedding light on important theoretical results which enable more principled prior elicitation and more efficient posterior simulation algorithms. For point (ii) above, we consider several models suitable for clustering homogeneous populations, inducing spatial dependence across groups of data, extracting the characteristic traits common to all the data-groups, and propose a novel vector autoregressive model to study of growth curves of Singaporean kids. Finally, for point (iii), we propose a novel class of projected statistical methods for distributional data analysis for measures on the real line and on the unit-circle.

Spacecraft Collision Probability Calculation from Conjunction Data Message and High Precision Orbit Propagator

The increasing number of Resident Space Objects (RSOs) is a threat to spaceflight operations. Conjunction Data Messages (CDMs) are sent to satellite operators to warn for possible future collision and their probabilities. The research project described herein pushed forward an algorithm that is able to update the collision probability directly on-board starting from CDMs and the state vector of the hosting satellite which is constantly updated thanks to an onboard GNSS receiver. A large set of methods for computing the collision probability was analyzed in order to find the best ones for this application. The selected algorithm was then tested to assess and improve its performance. Finally, parts of the algorithm and external software were implemented on a Raspberry Pi 3B+ board to demonstrate the compatibility of this approach with computational resources similar to those typically available onboard modern spacecraft.

Development And Characterization Of Microsatellite Loci For Ocotea Species (lauraceae) Threatened With Extinction.

The Atlantic rainforest species Ocotea catharinensis, Ocotea odorifera, and Ocotea porosa have been extensively harvested in the past for timber and oil extraction and are currently listed as threatened due to overexploitation. To investigate the genetic diversity and population structure of these species, we developed 8 polymorphic microsatellite markers for O. odorifera from an enriched microsatellite library by using 2 dinucleotide repeats. The microsatellite markers were tested for cross-amplification in O. catharinensis and O. porosa. The average number of alleles per locus was 10.2, considering all loci over 2 populations of O. odorifera. Observed and expected heterozygosities for O. odorifera ranged from 0.39 to 0.93 and 0.41 to 0.92 across populations, respectively. Cross-amplification of all loci was successfully observed in O. catharinensis and O. porosa except 1 locus that was found to lack polymorphism in O. porosa. Combined probabilities of identity in the studied Ocotea species were very low ranging from 1.0 x 10-24 to 7.7 x 10-24. The probability of exclusion over all loci estimated for O. odorifera indicated a 99.9% chance of correctly excluding a random nonparent individual. The microsatellite markers described in this study have high information content and will be useful for further investigations on genetic diversity within these species and for subsequent conservation purposes.