Signed graphs, regular matroids, grafts

Mathematics

An extension of König's theorem to graphs with no odd-K4

Mathematics

Streaming Reduction Circuit

Reduction circuits are used to reduce rows of floating point values to single values. Binary floating point operators often have deep pipelines, which may cause hazards when many consecutive rows have to be reduced. We present an algorithm by which any number of consecutive rows of arbitrary lengths can be reduced by a pipelined commutative and associative binary operator in an efficient manner. The algorithm is simple to implement, has a low latency, produces results in-order, and requires only small buffers. Besides, it uses only a single pipeline for the involved operation. The complexity of the algorithm depends on the depth of the pipeline, not on the length of the input rows. In this paper we discuss an implementation of this algorithm and we prove its correctness

Homomorphisms of graphs to odd cycles

Numerical Computation

Architecture Specifications in CλaSH

This paper introduces CλaSH, a novel hardware specification environment, by discussing several non-trivial examples. CλaSH is based on the functional language Haskell, and exploits many of its powerful abstraction mechanisms such as higher order functions, polymorphism, lambda abstraction, pattern matching, type derivation. As a result, specifications in CλaSH are concise and semantically clear, and simulations can be directly executed within a Haskell evaluation environment. CλaSH generates synthesizable low-level VHDL code by applying several transformation rules to a functional specification of a digital circuit

Fetal pulmonary hypoplasia

Vugt, J.M.G. van [Promotor]Twisk, J.W.R. [Promotor

Hiding State in CλaSH Hardware Descriptions

Synchronous hardware can be modelled as a mapping from input and state to output and a new state, such mappings are referred to as transition functions. It is natural to use a functional language to implement transition functions. The CaSH compiler is capable of translating transition functions to VHDL. Modelling hardware using multiple components is convenient. Components in CaSH can be considered as instantiations of functions. To avoid packing and unpacking state when composing components, functions are lifted to arrows. By using arrows the chance of making errors will decrease as it is not required to manually (un)pack the state. Furthermore, the Haskell do-syntax for arrows increases the readability of hardware designs. This is demonstrated using a realistic example of a circuit which consists of multiple components

Respuesta fotoperiódica de tres cultivares de lino (Linum usitatissimum L.)

p.265-270Se realizó el estudio de la respuesta fotoperiòdica de tres cultivares de lino oleaginoso (Areco INTA, Salto INTA y Rojas INTA) mediante el análisis de los resultados obtenidos de fechas de siembra continuadas a campo por un período de dos años y medio. La respuesta encontrada puede ser descripta mediante una función de tipo lineal para fechas no muy lejanas a las tradicionalmente utilizadas en la zona linera argentina. Fuera de ese período el efecto de la falta de vernalización modifica la respuesta de modo tal que se aleja de la función lineal. Con fotoperíodos menores a 12,2 horas(hs.). Los tratamientos vernalizados no mostraron sensibilidad fotoperiòdica. Para la gama de fotoperíodos que se dan en la región pampeana las plantas no llegarían a estar sometidas valores correspondientes al fotoperiodo óptimo