Conformity Assessments and Post-market Monitoring: A Guide to the Role of Auditing in the Proposed European AI Regulation

The proposed European Artificial Intelligence Act (AIA) is the first attempt to elaborate a general legal framework for AI carried out by any major global economy. As such, the AIA is likely to become a point of reference in the larger discourse on how AI systems can (and should) be regulated. In this article, we describe and discuss the two primary enforcement mechanisms proposed in the AIA: the conformity assessments that providers of high-risk AI systems are expected to conduct, and the post-market monitoring plans that providers must establish to document the performance of high-risk AI systems throughout their lifetimes. We argue that the AIA can be interpreted as a proposal to establish a Europe-wide ecosystem for conducting AI auditing, albeit in other words. Our analysis offers two main contributions. First, by describing the enforcement mechanisms included in the AIA in terminology borrowed from existing literature on AI auditing, we help providers of AI systems understand how they can prove adherence to the requirements set out in the AIA in practice. Second, by examining the AIA from an auditing perspective, we seek to provide transferable lessons from previous research about how to refine further the regulatory approach outlined in the AIA. We conclude by highlighting seven aspects of the AIA where amendments (or simply clarifications) would be helpful. These include, above all, the need to translate vague concepts into verifiable criteria and to strengthen the institutional safeguards concerning conformity assessments based on internal checks.

     

Generation and interpretation of parsimonious predictive models for load forecasting in smart heating networks

Applied Intelligence - Forecasting future heat load in smart district heating networks is a key problem for utility companies that need such predictions for optimizing their operational activities....     

Floral nectar phenolics as biochemical markers for the botanical origin of heather honey

In order to find out biochemical markers for the botanical origin of heather (Erica) honey, the phenolic metabolites present in heather floral nectar, collected from the honey-stomach of bees gathering nectar from these flowers, were analysed. The flavonoid fraction of nectar contained four main flavonoids. Two of them were quercetin and kaempferol 3-rhamnosides, and the other two were tentatively identified as myricetin 3-methyl ether and isorhamnetin 3-rhamnosides. Since the natural glycosides are hydrolysed by bee enzymes to render the corresponding aglycones, which are the metabolites detected in honey, acid hydrolysis of the nectar glycosides was achieved. The aglycones quercetin, myricetin 3-methyl ether, kaempferol and isorhamnetin were identified, as well as the gallic acid derivative ellagic acid. The analysis of Portuguese heather honey samples showed that ellagic acid was present in all the samples in significant amounts ranging between 100 g and 600 g per 100 g honey. The other nectar-derived flavonoids were also present, although some of them in very variable amounts. Ellagic acid and myricetin 3-methyl ether, which have not been detected in any of the monofloral honey samples investigated so far, with the only exception being a French honey sample of the botanically relatedCalluna (Ericaceae) which also contained ellagic acid, seem to be the most useful potential markers for the floral origin of heather honey. However, more detailed and extensive investigations are needed to prove the utility of these markers.     

Projective active shape models for pose-variant image analysis of quasi-planar objects: Application to facial analysis

One of the important obstacles in the image-based analysis of the human face is the 3D nature of the problem and the 2D nature of most imaging systems used for biometric applications. Due to this, accuracy is strongly influenced by the viewpoint of the images, being frontal views the most thoroughly studied. However, when fully automatic face analysis systems are designed, capturing frontal-view images cannot be guaranteed. Examples of this situation can be found in surveillance systems, car driver images or whenever there are architectural constraints that prevent from placing a camera frontal to the subject. Taking advantage of the fact that most facial features lie approximately on the same plane, we propose the use of projective geometry across different views. An active shape model constructed with frontal-view images can then be directly applied to the segmentation of pictures taken from other viewpoints. The proposed extension demonstrates being significantly more invariant than the standard approach. Validation of the method is presented in 360 images from the AV@CAR database, systematically divided into three different rotations (to both sides), as well as upper and lower views due to nodding. The presented tests are among the largest quantitative results reported to date in face segmentation under varying poses.     

Ontological reasoning for improving the treatment of emotions in text

With the advent of affective computing, the task of adequately identifying, representing and processing the emotional connotations of text has acquired importance. Two problems facing this task are addressed in this paper: the composition of sentence emotion from word emotion, and a representation of emotion that allows easy conversion between existing computational representations. The emotion of a sentence of text should be derived by composition of the emotions of the words in the sentence, but no method has been proposed so far to model this compositionality. Of the various existing approaches for representing emotions, some are better suited for some problems and some for others, but there is no easy way of converting from one to another. This paper presents a system that addresses these two problems by reasoning with two ontologies implemented with Semantic Web technologies: one designed to represent word dependency relations within a sentence, and one designed to represent emotions. The ontology of word dependency relies on roles to represent the way emotional contributions project over word dependencies. By applying automated classification of mark-up results in terms of the emotion ontology the system can interpret unrestricted input in terms of a restricted set of concepts for which particular rules are provided. The rules applied at the end of the process provide configuration parameters for a system for emotional voice synthesis.     

Information systems in the public sector: The e-Government enactment framework

Despite the burgeoning number of studies of public sector information systems, very few scholars have focussed on the relationship between e-Government policies and information systems choice and design. Drawing on Fountain’s (2001) technology enactment framework, this paper endeavours to conduct an in-depth investigation of the intricacies characterising the choice and design of new technologies in the context of e-Government reforms. By claiming that technologies are carriers of e-Government reform aims, this study investigates the logics embedded in the design of new technology and extant political interests and values inscribed in e-Government policies. The e-Government enactment framework is proposed as a theoretical and analytical approach to understand and study the complexity of these relationships which shape e-Government policies.     

Nogood-FC for solving partitionable constraint satisfaction problems

Many real problems can be naturally modelled as constraint satisfaction problems (CSPs). However, some of these problems are of a distributed nature, which requires problems of this kind to be modelled as distributed constraint satisfaction problems (DCSPs). In this work, we present a distributed model for solving CSPs. Our technique carries out a partition over the constraint network using a graph partitioning software; after partitioning, each sub-CSP is arranged into a DFS-tree CSP structure that is used as a hierarchy of communication by our distributed algorithm. We show that our distributed algorithm outperforms well-known centralized algorithms solving partitionable CSPs.     

Rule-based tools for the configuration of ambient intelligence systems: a comparative user study

Multimedia Tools and Applications - This paper describes a 63-participant user study that compares two widely known systems supporting end users in creating trigger-action rules for the Internet of...     

Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form

This paper describes an algorithm to enforce hyper-arc consistency of polynomial constraints defined over finite domains. First, the paper describes the language of so called polynomial constraints over finite domains, and it introduces a canonical form for such constraints. Then, the canonical form is used to transform the problem of testing the satisfiability of a constraint in a box into the problem of studying the sign of a related polynomial function in the same box, a problem which is effectively solved by using the modified Bernstein form of polynomials. The modified Bernstein form of polynomials is briefly discussed, and the proposed hyper-arc consistency algorithm is finally detailed. The proposed algorithm is a subdivision procedure which, starting from an initial approximation of the domains of variables, removes values from domains to enforce hyper-arc consistency.     

Turbulent premixed flame model based on a recent dispersion model

A model of turbulent premixed combustion is formulated based on a recent dispersion model and on earlier flame models. The dispersion model accounts for the effect of velocity correlation on turbulent dispersion without using parameters that are explicitly dependent on time or space. The earlier flame models are used as a basis for formulating an appropriate chemical source term. The resulting model is more general than the earlier models.The proposed model and one of the earlier models are validated against various experimental flames. It is shown that the proposed model is more accurate and requires less calibration. Furthermore, the proposed model is tested successfully against general criteria for premixed combustion modeling formulated in earlier works. It is therefore concluded that the dispersion model is a useful tool for premixed combustion modeling.