A toolkit approach to solar radiation modelling.

Considerable effort is required to implement solar radiation models in software. Many existing implementations have efficiency as their main priority rather than re-usability, and this can adversely affect their further development since the relationships between the software and physical quantities may be obscured. The Solar Toolkit is an attempt to overcome such barriers by exploiting the current abundance of computing resource, and the availability of user-oriented tools such as Microsoft Excel®. The Solar Toolkit takes the form of a set of functions written in Visual Basic for Applications® (VBA) made available under the Academic Free Licence. Transparency is the overriding priority throughout the implementation so that the Toolkit can provide a platform for further modelling initiatives.

On linear extension operators

We construct a countable-dimensional Hausdorff locally convex topological vector space $E$ and a stratifiable closed linear subspace $F$ subset of $E$ such that any linear extension operator from $C_b(F)$ to $C_b(E)$ is unbounded (here $C_b(X)$ stands for the Banach space of continuous bounded real-valued functions on $X$).

Randomized caches for power-efficiency

Embedded processors are used in numerous devices executing dedicated applications. This setting makes it worthwhile to optimize the processor to the application it executes, in order to increase its power-efficiency. This paper proposes to enhance direct mapped data caches with automatically tuned randomized set index functions to achieve that goal. We show how randomization functions can be automatically generated and compare them to traditional set-associative caches in terms of performance and energy consumption. A 16 kB randomized direct mapped cache consumes 22% less energy than a 2-way set-associative cache, while it is less than 3% slower. When the randomization function is made configurable (i.e., it can be adapted to the program), the additional reduction of conflicts outweighs the added complexity of the hardware, provided there is a sufficient amount of conflict misses.

Automated Methods for Aircraft Design Integrated with Manufacturing

Aircraft design is a complex, long and iterative process that requires the use of various specialties and optimization tools. However these tools and specialities do not include manufacturing, which is often considered later in the product development process leading to higher cost and time delays. This work focuses on the development of an automated design tool that accounts for manufacture during the design process focusing on early geometry definition which in turn informs assembly planning. To accomplish this task the design process needs to be open to any variation in structural configuration while maintaining the design intent. Redefining design intent as a map which links a set of requirements to a set of functions using a numerical approach enables the design process itself to be considered as a mathematical function. This definition enables the design process to utilise captured design knowledge and translate it into a set of mathematical equations that design the structure. This process is articulated in this paper using the structural design and definition for an aircraft fuselage section as an exemplar.

The Inferential Complexity of Bayesian and Credal Networks

This paper presents new results on the complexity of graph-theoretical models that represent probabilities (Bayesian networks) and that represent interval and set valued probabilities (credal networks). We define a new class of networks with bounded width, and introduce a new decision problem for Bayesian networks, the maximin a posteriori. We present new links between the Bayesian and credal networks, and present new results both for Bayesian networks (most probable explanation with observations, maximin a posteriori) and for credal networks (bounds on probabilities a posteriori, most probable explanation with and without observations, maximum a posteriori).

Belief Updating and Learning in Semi-Qualitative Probabilistic Networks

This paper explores semi-qualitative probabilistic networks (SQPNs) that combine numeric and qualitative information. We first show that exact inferences with SQPNs are NPPP-Complete. We then show that existing qualitative relations in SQPNs (plus probabilistic logic and imprecise assessments) can be dealt effectively through multilinear programming. We then discuss learning: we consider a maximum likelihood method that generates point estimates given a SQPN and empirical data, and we describe a Bayesian-minded method that employs the Imprecise Dirichlet Model to generate set-valued estimates.

Multilinear and Integer Programming for Markov Decision Processes with Imprecise Probabilities

Markov Decision Processes (MDPs) are extensively used to encode sequences of decisions with probabilistic effects. Markov Decision Processes with Imprecise Probabilities (MDPIPs) encode sequences of decisions whose effects are modeled using sets of probability distributions. In this paper we examine the computation of Γ-maximin policies for MDPIPs using multilinear and integer programming. We discuss the application of our algorithms to “factored” models and to a recent proposal, Markov Decision Processes with Set-valued Transitions (MDPSTs), that unifies the fields of probabilistic and “nondeterministic” planning in artificial intelligence research. 

Consultoria de gestão operacional e gestão da formação

Relatório de estágio apresentado ao Instituto de Contabilidade e Administração do Porto para a obtenção do título de Mestre em Auditoria Orientada por Dr. Rodrigo Carvalho Coorientador: Dr. José Rui Dias

EMG signal filtering based on Empirical Mode Decomposition

This paper introduces a procedure for filtering electromyographic (EMG) signals. Its key element is the Empirical Mode Decomposition, a novel digital signal processing technique that can decompose my time-series into a set of functions designated as intrinsic mode functions. The procedure for EMG signal filtering is compared to a related approach based on the wavelet transform. Results obtained from the analysis of synthetic and experimental EMG signals show that Our method can be Successfully and easily applied in practice to attenuation of background activity in EMG signals. (c) 2006 Elsevier Ltd. All rights reserved.

Extension of explicit formulas in Poissonian white noise analysis using harmonic analysis on configuration spaces

Harmonic analysis on configuration spaces is used in order to extend explicit expressions for the images of creation, annihilation, and second quantization operators in L2-spaces with respect to Poisson point processes to a set of functions larger than the space obtained by directly using chaos expansion. This permits, in particular, to derive an explicit expression for the generator of the second quantization of a sub-Markovian contraction semigroup on a set of functions which forms a core of the generator.

Coherent states of non-relativistic electron in the magnetic-solenoid field

In the present work we construct coherent states in the magnetic-solenoid field, which is a superposition of the Aharonov-Bohm field and a collinear uniform magnetic field. In the problem under consideration there are two kinds of coherent states, those which correspond to classical trajectories which embrace the solenoid and those which do not. The constructed coherent states reproduce exactly classical trajectories, maintain their form under the time evolution and form a complete set of functions, which can be useful in semiclassical calculations. In the absence of the solenoid field these states are reduced to the well known in the case of uniform magnetic field Malkin-Man`ko coherent states.

Search schemes for random optimization algorithms that preserve the asymptotic distribution

Markovian algorithms for estimating the global maximum or minimum of real valued functions defined on some domain Omega subset of R-d are presented. Conditions on the search schemes that preserve the asymptotic distribution are derived. Global and local search schemes satisfying these conditions are analysed and shown to yield sharper confidence intervals when compared to the i.i.d. case.

A Weak Maximum Principle for Optimal Control Problems with Nonsmooth Mixed Constraints

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Prediction of dopant atom distribution on nanocrystals using thermodynamic arguments

A theoretical approach aiming at the prediction of segregation of dopant atoms on nanocrystalline systems is discussed here. It considers the free energy minimization argument in order to provide the most likely dopant distribution as a function of the total doping level. For this, it requires as input (i) a fixed polyhedral geometry with defined facets, and (ii) a set of functions that describe the surface energy as a function of dopant content for different crystallographic planes. Two Sb-doped SnO2 nanocrystalline systems with different morphology and dopant content were selected as a case study, and the calculation of the dopant distributions expected for them is presented in detail. The obtained results were compared to previously reported characterization of this system by a combination of HRTEM and surface energy calculations, and both methods are shown to be equivalent. Considering its application pre-requisites, the present theoretical approach can provide a first estimation of doping atom distribution for a wide range of nanocrystalline systems. We expect that its use will support the reduction of experimental effort for the characterization of doped nanocrystals, and also provide a solution to the characterization of systems where even state-of-art analytical techniques are limited.

On the solvability of implicit differential inclusions

In the paper, the set-valued covering mappings are studied. The statements on solvability, solution estimates, and well-posedness of inclusions with conditionally covering mappings are proved. The results obtained are applied to the investigation of differential inclusions unsolved for the unknown function. The statements on solvability, solution estimates, and well-posedness of these inclusions are derived.