Search results for "Programming"

Protection against Discrimination under the European Convention on Humau Rights―A Second-Class Guarantee?

2002

Neuro-Dynamic Programming for Cooperative Inventory Control

2004

The resources and obstacles of creative collaboration in a long-term learning community

2008

Abstract In the framework of a subject-centred socio-cultural approach, this study investigates creative collaboration and the resources for and obstacles to it in a long-term learning community of ten teacher students. The study focuses on five different learning situations over a 2-year period. The data were taken from teacher students’ evaluations and accounts (on given criteria) of their videotaped group-learning sessions, and their reports of the obstacles to creative collaboration. Using the students’ evaluations of the five videotaped group learning situations, the sessions they assessed as the least and most creative were compared, the aim being to discover the most important situat…

Flipping and Blending : An Action Research Project on Improving a Functional Programming Course

2016

This article reports on an action research project on improving a functional programming course by moving toward a practical and flexible study environment—flipped and blended classroom. Teaching the topic of functional programming was found to be troublesome using a traditional lectured course format. The need to increase students’ amount of practice emerged while subsequent challenges relating to students’ independent practical coursework were observed. Particular concerns relating to group work, learning materials, and the attribute of flexibility were investigated during the third action research cycle. The research cycle was analyzed using a qualitative survey on students’ views, teach…

Differences in Technical Development and Playing Space in Three UEFA Champions Leagues

2021

[Abstract] The analysis of football grows exponentially, with many researchers adopting it as an object of study. The thematic range that addresses it, as well as the different methodologies used, are of a very different nature—physical, psychological, technical, tactical—enriching every day the knowledge, and understanding of the game itself. The objective of this study has been to identify the differences between the different styles of play that lead to becoming the champion of the UEFA Champions League in the last 3 years of the pre-COVID stage, by analyzing the spatial performance developed, the association between the players that make up the different lines of the game system and the…

Integrated Simulation and Formal Verification of a Simple Autonomous Vehicle

2018

This paper presents a proof-of-concept application of an approach to system development based on the integration of formal verification and co-simulation. A simple autonomous vehicle has the task of reaching an assigned straight path and then follow it, and it can be controlled by varying its turning speed. The correctness of the proposed control law has been formalized and verified by interactive theorem proving with the Prototype Verification System. Concurrently, the system has been co-simulated using the Prototype Verification System and the MathWorks Simulink tool: The vehicle kinematics have been simulated in Simulink, whereas the controller has been modeled in the logic language of t…

Automated Synthesis of Application-layer Connectors from Automata-based Specifications

2019

Abstract Ubiquitous and Pervasive Computing, and the Internet of Things, promote dynamic interaction among heterogeneous systems. To achieve this vision, interoperability among heterogeneous systems represents a key enabler, and mediators are often built to solve protocol mismatches. Many approaches propose the synthesis of mediators. Unfortunately, a rigorous characterization of the concept of interoperability is still lacking, hence making hard to assess their applicability and soundness. In this paper, we provide a framework for the synthesis of mediators that allows us to: (i) characterize the conditions for the mediator existence and correctness; and (ii) establish the applicability bo…

PArthENoPE reloaded

2018

We describe the main features of a new and updated version of the program PArthENoPE, which computes the abundances of light elements produced during Big Bang Nucleosynthesis. As the previous first release in 2008, the new one, PArthENoPE 2.0, will be soon publicly available and distributed from the code site, http://parthenope.na.infn.it. Apart from minor changes, which will be also detailed, the main improvements are as follows. The powerful, but not freely accessible, NAG routines have been substituted by ODEPACK libraries, without any significant loss in precision. Moreover, we have developed a Graphical User Interface (GUI) which allows a friendly use of the code and a simpler implemen…

Cost Reduction in Irrigation Networks by an Efficient Use of Pressure Reducing Valves

1992

The cost effective design of hydraulic networks has been traditionally studied from the point of view of the relationship between hydraulic variables and economic parameters, with piping being the main element studied. The reason is clear: the piping is by far the most costly item of a projected network. However it is not usual to find an explicit consideration of the influence that pipe thickness has on the cost of the network because of the added difficulty that this aspect poses to formulating the problem of optimization. In irrigation networks, which are typically branched, it is advisable to place Pressure Reducing Valves (PRV’s) to fulfil three main goals: 1) to control the flow rate …

One-Counter Verifiers for Decidable Languages

2013

Condon and Lipton (FOCS 1989) showed that the class of languages having a space-bounded interactive proof system (IPS) is a proper subset of decidable languages, where the verifier is a probabilistic Turing machine. In this paper, we show that if we use architecturally restricted verifiers instead of restricting the working memory, i.e. replacing the working tape(s) with a single counter, we can define some IPS’s for each decidable language. Such verifiers are called two-way probabilistic one-counter automata (2pca’s). Then, we show that by adding a fixed-size quantum memory to a 2pca, called a two-way one-counter automaton with quantum and classical states (2qcca), the protocol can be spac…