Review of the Performance of Residential PV systems in Belgium

The main objective of this paper is to review the state of the art of residential PV systems in Belgium by the analysis of the operational data of 993 installations. For that, three main questions are posed: how much energy do they produce? What level of performance is associated to their production? Which are the key parameters that most influence their quality? This work brings answers to these questions. A middling commercial PV system, optimally oriented, produces a mean annual energy of 892 kWh/kWp. As a whole, the orientation of PV generators causes energy productions to be some 6% inferior to optimally oriented PV systems. The mean performance ratio is 78% and the mean performance index is 85%. That is to say, the energy produced by a typical PV system in Belgium is 15% inferior to the energy produced by a very high quality PV system. Finally, on average, the real power of the PV modules falls 5% below its corresponding nominal power announced on the manufacturer's datasheet. Differences between real and nominal power of up to 16% have been detected.

Performance Analysis of 10,000 Residential PV Systems in France and Belgium

The main objective of this paper is to review the state of the art of residential PV systems in France and Belgium. This is done analyzing the operational data of 10650 PV systems (9657 located in France and 993 in Belgium). Three main questions are posed. How much energy do they produce? What level of performance is associated to their production? Which are the key parameters that most influence their quality? During the year 2010, the PV systems in France have produced a mean annual energy of 1163 kWh/kWp in France and 852 kWh/kWp in Belgium. As a whole, the orientation of PV generators causes energy productions to be some 7% inferior to optimally oriented PV systems. The mean Performance Ratio is 76% in France and 78% in Belgium, and the mean Performance Index is 85% in both countries. On average, the real power of the PV modules falls 4.9% below its corresponding nominal power announced on the manufacturer?s datasheet. A brief analysis by PV modules technology has lead to relevant observations about two technologies in particular. On the one hand, the PV systems equipped with Heterojunction with Intrinsic. Thin layer (HIT) modules show performances higher than average. On the other hand, the systems equipped with Copper Indium (di)Selenide (CIS) modules show a real power that is 16 % lower than their nominal value.

Non-failure analysis for logic programs

We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at least one solution or not termínate). The technique is based on an intuitively very simple notion, that of a (set of) tests "covering" the type of a set of variables. We show that the problem of determining a covering is undecidable in general, and give decidability and complexity results for the Herbrand and linear arithmetic constraint systems. We give sound algorithms for determining covering that are precise and efiicient in practice. Based on this information, we show how to identify goals and procedures that can be guaranteed to not fail at runtime. Applications of such non-failure information include programming error detection, program transiormations and parallel execution optimization, avoiding speculative parallelism and estimating lower bounds on the computational costs of goals, which can be used for granularity control. Finally, we report on an implementation of our method and show that better results are obtained than with previously proposed approaches.

Extracting non-strict independent and-parallelism using sharing and freeness information

Logic programming systems which exploit and-parallelism among non-deterministic goals rely on notions of independence among those goals in order to ensure certain efficiency properties. "Non-strict" independence (NSI) is a more relaxed notion than the traditional notion of "strict" independence (SI) which still ensures the relevant efficiency properties and can allow considerable more parallelism than SI. However, all compilation technology developed to date has been based on SI, because of the intrinsic complexity of exploiting NSI. This is related to the fact that NSI cannot be determined "a priori" as SI. This paper filis this gap by developing a technique for compile-time detection and annotation of NSI. It also proposes algorithms for combined compiletime/ run-time detection, presenting novel run-time checks for this type of parallelism. Also, a transformation procedure to eliminate shared variables among parallel goals is presented, aimed at performing as much work as possible at compile-time. The approach is based on the knowledge of certain properties regarding the run-time instantiations of program variables —sharing and freeness— for which compile-time technology is available, with new approaches being currently proposed. Thus, the paper does not deal with the analysis itself, but rather with how the analysis results can be used to parallelize programs.

Automatic exploitation of non-determinate independent and-parallelism in the basic andorra model

Andorra-I is the first implementation of a language based on the Andorra Principie, which states that determinate goals can (and shonld) be run before other goals, and even in a parallel fashion. This principie has materialized in a framework called the Basic Andorra model, which allows or-parallelism as well as (dependent) and-parallelism for determinate goals. In this report we show that it is possible to further extend this model in order to allow general independent and-parallelism for nondeterminate goals, withont greatly modifying the underlying implementation machinery. A simple an easy way to realize such an extensión is to make each (nondeterminate) independent goal determinate, by using a special "bagof" constract. We also show that this can be achieved antomatically by compile-time translation from original Prolog programs. A transformation that fulfüls this objective and which can be easily antomated is presented in this report.

Independent AND-parallel implementation of narrowing

We present a parallel graph narrowing machine, which is used to implement a functional logic language on a shared memory multiprocessor. It is an extensión of an abstract machine for a purely functional language. The result is a programmed graph reduction machine which integrates the mechanisms of unification, backtracking, and independent and-parallelism. In the machine, the subexpressions of an expression can run in parallel. In the case of backtracking, the structure of an expression is used to avoid the reevaluation of subexpressions as far as possible. Deterministic computations are detected. Their results are maintained and need not be reevaluated after backtracking.

Estimating the computational cost of logic programs

Information about the computational cost of programs is potentially useful for a variety of purposes, including selecting among different algorithms, guiding program transformations, in granularity control and mapping decisions in parallelizing compilers, and query optimization in deductive databases. Cost analysis of logic programs is complicated by nondeterminism: on the one hand, procedures can return múltiple Solutions, making it necessary to estímate the number of solutions in order to give nontrivial upper bound cost estimates; on the other hand, the possibility of failure has to be taken into account while estimating lower bounds. Here we discuss techniques to address these problems to some extent.

Optimization of logic programs with dynamic scheduling

Dynamic scheduling increases the expressive power of logic programming languages, but also introduces some overhead. In this paper we present two classes of program transformations designed to reduce this additional overhead, while preserving the operational semantics of the original programs, modulo ordering of literals woken at the same time. The first class of transformations simplifies the delay conditions while the second class moves delayed literals later in the rule body. Application of the program transformations can be automated using information provided by compile-time analysis. We provide experimental results obtained from an implementation of the proposed techniques using the CIAO prototype compiler. Our results show that the techniques can lead to substantial performance improvement.

Use and abuse of audivisual media in the college classroom. Slides show and web pages

The multimedia development that has taken place within the university classrooms in recent years has caused a revolution at psychological level within the collectivity of students and teachers inside and outside the classrooms. The slide show applications have become a key supporting element for university professors, who, in many cases, rely blindly in the use of them for teaching. Additionally, ill-conceived slides, poorly structured and with a vast amount of multimedia content, can be the basis of a faulty communication between teacher and student, which is overwhelmed by the appearance and presentation, neglecting their content. The same applies to web pages. This paper focuses on the study and analysis of the impact caused in the process of teaching and learning by the slide show presentations and web pages, and its positive and negative influence on the student’s learning process, paying particular attention to the consequences on the level of attention within the classroom, and on the study outside the classroom. The study is performed by means of a qualitative analysis of student surveys conducted during the last 8 school Civil Engineering School at the Polytechnic University of Madrid. It presents some of the weaknesses of multimedia material, including the difficulties for students to study them, because of the many distractions they face and the need for incentives web pages offer, or the insignificant content and shallowness of the studies due to wrongly formulated presentations.

Overview of the project. Sector analysis: Search market.

Which is the economic value of personal information? -How the exchange of information is benefiting society and the economy -How companies create value from personal information (by providing new services or servicing better an existing need). -The mechanisms by which personal information exchange creates economic value - How the level of privacy protection influences value creation in different markets

Results of the JET real-time disruption predictor in the ITER-like wall campaigns

The impact of disruptions in JET became even more important with the replacement of the previous Carbon Fiber Composite (CFC) wall with a more fragile full metal ITER-like wall (ILW). The development of robust disruption mitigation systems is crucial for JET (and also for ITER). Moreover, a reliable real-time (RT) disruption predictor is a pre-requisite to any mitigation method. The Advance Predictor Of DISruptions (APODIS) has been installed in the JET Real-Time Data Network (RTDN) for the RT recognition of disruptions. The predictor operates with the new ILW but it has been trained only with discharges belonging to campaigns with the CFC wall. 7 realtime signals are used to characterize the plasma status (disruptive or non-disruptive) at regular intervals of 1 ms. After the first 3 JET ILW campaigns (991 discharges), the success rate of the predictor is 98.36% (alarms are triggered in average 426 ms before the disruptions). The false alarm and missed alarm rates are 0.92% and 1.64%.

Looking for business models in digital media and content industries

International Conference on Dynamics of the Media and Content Industry. European Forum for Science and Industry.