Search results for "Computer program"

Remarks on verbo-tonal phonetics for a communicative context

2018

El objetivo de este artículo es presentar algunas técnicas de corrección fonética a los profesores de lengua extranjera, especialmente a aquellos que trabajan en un contexto comunicativo (Arnold et al. 2005) y no están familiarizados con la clase de pronunciación. El artículo se divide en dos partes: en primer lugar, presentaremos las contribuciones más generales del Método verbo-tonal (Asp 2006; Berré (ed.), 2005; Billières, 2002, 2014; Calvo and Murillo, 2012; Dalmau et al., 1985; Guberina, 1956, 1961; Guberina and Murillo 2008; Murillo, 2002; Intravaia, 2002; Renard, 1971, 1979, 2010; Renard and van Vlasselaer 1976; Roberge, 2002; etc.); en segundo lugar, propondremos algunas técnicas pa…

Understanding maritime transport route choice among Irish exporters: A latent class approach

2021

Abstract The reduction in the level of maritime connectivity between Ireland and mainland Europe has been the focus of concern for Irish exporters since the withdrawal of the United Kingdom from the European Union in January 2019. In a post-Brexit scenario, new proposals are being sought to address Ireland's reliance on the UK land-bridge. Policy developments aimed at circumventing the potential negative impact of UK customs checks for Irish exports include the proposals by the European Commission to introduce new direct shipping routes connecting main ports in Ireland with Zeebrugge and Antwerp in Belgium, as well as with Rotterdam in the Netherlands. From a transport policy perspective, f…

Use of Movies in an accounting class as a teaching technique to promote learning about financial reporting and ethical issues

2021

[EN] This study presents an innovative experience using movies in an accounting class. The learning experience was found interesting and useful for the learning process in three groups in University XXX. The students voluntarily watched three movies and answered a test for each one, containing questions about the ethical and accounting concepts in the film, as well as their satisfaction with the methodology. Non-parametric tests have been computed to assess if those students that watch a movie obtain a higher exam mark as compared to those that do not follow the methodology, as well as for the other accounting and ethical questions. Our results show that there is a particular film that evid…

Czy potrzebne są zmiany preambuł w tzw. ustawach wyznaniowych?

2020

Ustawy z maja 1989 r. dotyczące gwarancji wolności sumienia i wyznania oraz relacji pomiędzy państwem a Kościołem katolickim w Polsce ze względu na ich znaczenie wyposażono w uroczysty wstęp podnoszący jeszcze bardziej rangę tych przepisów. Jednak formuła przyjęta wcześniej dzisiaj wymaga zmian szanujących godność człowieka i jego podmiotowość. Stąd też należy uwzględnić nie tylko wytyczne Narodów Zjednoczonych ale także dyrektywy wywodzące się z prawa Unii Europejskiej i fakt członkostwa Polski w Radzie Europy.

Thermal analysis and new insights to support decision making in retrofit and relaxation of heat exchanger networks

2011

International audience; Pinch analysis offers a rational framework for identifying energy saving targets and designing efficient heat recovery networks, especially in process industry. Several scientists have contributed to improve and automate the original pinch method over the last decades, increasing its capability to deal with a number of specific issues; the expertise of the analyst, however, remains determinant in achieving optimal results. In this paper a procedure for retrofit of existing networks is proposed, based on an integrate use of several techniques (either existing or innovative). The diagnosis of the existing network and of a "Minimum Energy Requirement" configuration emer…

MEMORIA: A computer program for experimental control of verbal learning and memory experiments with the Apple II microcomputer

1983

Adaptive Task Assignment in Online Learning Environments

2016

With the increasing popularity of online learning, intelligent tutoring systems are regaining increased attention. In this paper, we introduce adaptive algorithms for personalized assignment of learning tasks to student so that to improve his performance in online learning environments. As main contribution of this paper, we propose a a novel Skill-Based Task Selector (SBTS) algorithm which is able to approximate a student's skill level based on his performance and consequently suggest adequate assignments. The SBTS is inspired by the class of multi-armed bandit algorithms. However, in contrast to standard multi-armed bandit approaches, the SBTS aims at acquiring two criteria related to stu…

Learning User's Confidence for Active Learning

2013

In this paper, we study the applicability of active learning in operative scenarios: more particularly, we consider the well-known contradiction between the active learning heuristics, which rank the pixels according to their uncertainty, and the user's confidence in labeling, which is related to both the homogeneity of the pixel context and user's knowledge of the scene. We propose a filtering scheme based on a classifier that learns the confidence of the user in labeling, thus minimizing the queries where the user would not be able to provide a class for the pixel. The capacity of a model to learn the user's confidence is studied in detail, also showing the effect of resolution is such a …

On the Convergence of Tsetlin Machines for the IDENTITY- and NOT Operators

2020

The Tsetlin Machine (TM) is a recent machine learning algorithm with several distinct properties, such as interpretability, simplicity, and hardware-friendliness. Although numerous empirical evaluations report on its performance, the mathematical analysis of its convergence is still open. In this article, we analyze the convergence of the TM with only one clause involved for classification. More specifically, we examine two basic logical operators, namely, the "IDENTITY"- and "NOT" operators. Our analysis reveals that the TM, with just one clause, can converge correctly to the intended logical operator, learning from training data over an infinite time horizon. Besides, it can capture arbit…

Separations in Query Complexity Based on Pointer Functions

2015

In 1986, Saks and Wigderson conjectured that the largest separation between deterministic and zero-error randomized query complexity for a total boolean function is given by the function $f$ on $n=2^k$ bits defined by a complete binary tree of NAND gates of depth $k$, which achieves $R_0(f) = O(D(f)^{0.7537\ldots})$. We show this is false by giving an example of a total boolean function $f$ on $n$ bits whose deterministic query complexity is $\Omega(n/\log(n))$ while its zero-error randomized query complexity is $\tilde O(\sqrt{n})$. We further show that the quantum query complexity of the same function is $\tilde O(n^{1/4})$, giving the first example of a total function with a super-quadra…