Ramos, Luís Quase normalidade e inferência para séries de estudos emparelhadas. Universidade Nova de Lisboa., 2007.
AbstractWe use the almost normality approach to derive the models we use. Polynomial almost normality is presented in a first chapter. Thus we show that low degree polynomials on independent normal variables with small variation coefficients are very approximately normal distributed. This result is then used do derive models for series of studies assuming normality and independence for the initial observations and low variation coefficients. We then apply this models first for single series and then for matched series of studies. We will assume that the matched series are associated to the treatments and orthogonal design. The special case of prime basis factorials is considered.
SCUTARU, G., F. SANDU, E. COCORADA, M. PAVALACHE, L. Gomes, F. Coito, A. K. MÖRSKY-LINDQUIST, D. TALABA, V. NEUNDORF, V. FEDAK, and others Relatório de consolidação relativo à utilização de realidade virtual e de experimentação remota em educação. IDENTITY; 229930-CP-1-2006-1-RO-MINERVA-M, 2007.
Abstract
Semigroups and formal languages. Eds. Jorge M. André, V{\'ı}tor H. Fernandes, Mário J. J. Branco, Gracinda M. S. Gomes, John Fountain, and John C. Meakin. Proceedings of the International Conference held at the Universidade de Lisboa, Lisboa, July 12–15, 2005. World Scientific Publishing Co. Pte. Ltd., Hackensack, NJ, 2007.
Amado, Miguel, Júlia Pinto, Catarina Santos, and Ana Cruz Lopes Sustainable Building Process. III Artec International Congress 2007. Bolonha: Alinea Editrice, 2007.
Lourenço, João M., and Gonçalo Cunha. "
Testing patterns for software transactional memory engines."
Proceedings of the 5th Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging (PADTAD'07). {PADTAD}'07. New York, NY, USA: ACM, 2007. 36-42.
AbstractThe emergence of multi-core processors is promoting the use of concurrency and multithreading. To raise the abstraction level of synchronization constructs is fundamental to ease the development of concurrent software, and Software Transactional Memory (STM) is a good approach towards such goal. However, execution environment issues such as the processor instruction set, caching policy, and memory model, may have strong influence upon the reliability of STM engines. This paper addresses the testing of STM engines aiming at improving their reliability and independence from execution environment. From our experience with porting and extending a specific STM engine, we report on some of the bugs found and synthesize some testing patterns that proved to be useful at testing STM engines.
Barbosa, Luís, Jácome Cunha, and Joost Visser. "
A Type-Level Approach to Component Prototyping."
International Workshop on Synthesis and Analysis of Component Connectors: in Conjunction with the 6th ESEC/FSE Joint Meeting. SYANCO '07. New York, NY, USA: ACM, 2007. 23-36.
AbstractAlgebraic theories for modeling components and their interactions offer abstraction over the specifics of component states and interfaces. For example, such theories deal with forms of sequential composition of two components in a manner independent of the type of data stored in the states of the components, and independent of the number and types of methods offered by the interfaces of the combinators. General purpose programming languages do not offer this level of abstraction, which implies that a gap must be bridged when turning component models into implementations. In this paper, we present an approach to prototyping of component-based systems that employs so-called type-level programming (or compile-time computation) to bridge the gap between abstract component models and their type-safe implementation in a functional programming language. We demonstrate our approach using Barbosa's model of components as generalized Mealy machines. For this model, we develop a combinator library in Haskell, which uses type-level programming with two effects. Firstly, wiring between components is computed during compilation. Secondly, the well-formedness of the component compositions is guarded by Haskell's strong type system.