Search results for "Programming Language"
showing 10 items of 624 documents
Analyzing the Contextual Nature of Collaborative Activity
2010
This chapter discusses a methodology designed to explore the contextual nature of collaborative activity. The methods that can be generally considered to be based on ‘socio-cultural’ discourse analysis are discussed as a means to explore how different aspects of a situation mediate students’ shared meaning-making. First, an analysis is demonstrated, illustrating how different immediate and mediated contexts are embedded in students’ discourse as they are engaged in face-to-face collaborative activity in a computer-mediated context. Second, a multidimensional coding scheme is presented for analyzing the contextualized process of collaborative knowledge construction in an asynchronous web-ba…
On Using “Stochastic Learning on the Line” to Design Novel Distance Estimation Methods for Three-Dimensional Environments
2019
We consider the unsolved problem of Distance Estimation (DE) when the inputs are the x and y coordinates (i.e., the latitudinal and longitudinal positions) of the points under consideration, and the elevation/altitudes of the points specified, for example, in terms of their z coordinates (3DDE). The aim of the problem is to yield an accurate value for the real (road) distance between the points specified by all the three coordinates of the cities in question (This is a typical problem encountered in a GISs and GPSs.). In our setting, the distance between any pair of cities is assumed to be computed by merely having access to the coordinates and known inter-city distances of a small subset o…
Modelling Dependencies Between Classifiers in Mobile Masquerader Detection
2004
The unauthorised use of mobile terminals may result in an abuse of sensitive information kept locally on the terminals or accessible over the network. Therefore, there is a need for security means capable of detecting the cases when the legitimate user of the terminal is substituted. The problem of user substitution detection is considered in the paper as a problem of classifying the behaviour of the person interacting with the terminal as originating from the user or someone else. Different aspects of behaviour are analysed by designated one-class classifiers whose classifications are subsequently combined. A modification of majority voting that takes into account some of the dependencies …
Algorithmic differentiation for cloud schemes (IFS Cy43r3) using CoDiPack (v1.8.1)
2019
Abstract. Numerical models in atmospheric sciences not only need to approximate the flow equations on a suitable computational grid, they also need to include subgrid effects of many non-resolved physical processes. Among others, the formation and evolution of cloud particles is an example of such subgrid processes. Moreover, to date there is no universal mathematical description of a cloud, hence many cloud schemes have been proposed and these schemes typically contain several uncertain parameters. In this study, we propose the use of algorithmic differentiation (AD) as a method to identify parameters within the cloud scheme, to which the output of the cloud scheme is most sensitive. We il…
Algorithmic Differentiation for Cloud Schemes
2019
<p>Numerical models in atmospheric sciences do not only need to approximate the flow equations on a suitable computational grid, they also need to include subgrid effects of many non-resolved physical processes. Among others, the formation and evolution of cloud particles is an example of such subgrid processes. Moreover, to date there is no universal mathematical description of a cloud, hence many cloud schemes were proposed and these schemes typically contain several uncertain parameters. In this study, we propose the use of algorithmic differentiation (AD) as a method to identify parameters within the cloud scheme, to which the output of the cloud scheme is most sensitive.…
Discretized Bayesian Pursuit – A New Scheme for Reinforcement Learning
2012
Published version of a chapter in the book: Advanced Research in Applied Artificial Intelligence. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-642-31087-4_79 The success of Learning Automata (LA)-based estimator algorithms over the classical, Linear Reward-Inaction ( L RI )-like schemes, can be explained by their ability to pursue the actions with the highest reward probability estimates. Without access to reward probability estimates, it makes sense for schemes like the L RI to first make large exploring steps, and then to gradually turn exploration into exploitation by making progressively smaller learning steps. However, this behavior becomes counter-intuitive wh…
A Learning Automata Local Contribution Sampling Applied to Hydropower Production Optimisation
2017
Learning Automata (LA) is a powerful approach for solving complex, non-linear and stochastic optimisation problems. However, existing solutions struggle with high-dimensional problems due to slow convergence, arguably caused by the global nature of feedback. In this paper we introduce a novel Learning Automata (LA) scheme to attack this challenge. The scheme is based on a parallel form of Local Contribution Sampling (LCS), which means that the LA receive individually directed feedback, designed to speed up convergence. Furthermore, our scheme is highly decentralized, allowing parallel execution on GPU architectures. To demonstrate the power of our scheme, the LA LCS is applied to hydropower…
Solving Non-Stationary Bandit Problems by Random Sampling from Sibling Kalman Filters
2010
Published version of an article from Lecture Notes in Computer Science. Also available at SpringerLink: http://dx.doi.org/10.1007/978-3-642-13033-5_21 The multi-armed bandit problem is a classical optimization problem where an agent sequentially pulls one of multiple arms attached to a gambling machine, with each pull resulting in a random reward. The reward distributions are unknown, and thus, one must balance between exploiting existing knowledge about the arms, and obtaining new information. Dynamically changing (non-stationary) bandit problems are particularly challenging because each change of the reward distributions may progressively degrade the performance of any fixed strategy. Alt…
New descent rules for solving the linear semi-infinite programming problem
1994
The algorithm described in this paper approaches the optimal solution of a continuous semi-infinite linear programming problem through a sequence of basic feasible solutions. The descent rules that we present for the improvement step are quite different when one deals with non-degenerate or degenerate extreme points. For the non-degenerate case we use a simplex-type approach, and for the other case a search direction scheme is applied. Some numerical examples illustrating the method are given.
A Forecasting Support System Based on Exponential Smoothing
2010
This chapter presents a forecasting support system based on the exponential smoothing scheme to forecast time-series data. Exponential smoothing methods are simple to apply, which facilitates computation and considerably reduces data storage requirements. Consequently, they are widely used as forecasting techniques in inventory systems and business planning. After selecting the most adequate model to replicate patterns of the time series under study, the system provides accurate forecasts which can play decisive roles in organizational planning, budgeting and performance monitoring.