Core-based Methodology: An Automated Approach for Implementing a Complete System From Algorithms to a Heterogeneous Network Including FPGAs

In this paper, we present a methodology for implementing a complete Digital Signal Processing (DSP) system onto a heterogeneous network including Field Programmable Gate Arrays (FPGAs) automatically. The methodology aims to allow design refinement and real time verification at the system level. The DSP application is constructed in the form of a Data Flow Graph (DFG) which provides an entry point to the methodology. The netlist for parts that are mapped onto the FPGA(s) together with the corresponding software and hardware Application Protocol Interface (API) are also generated. Using a set of case studies, we demonstrate that the design and development time can be significantly reduced using the methodology developed.

Evolutionary Requirements for Next-Generation Dataflow-Based FPGA System Design

The use of dataflow digital signal processing system modelling
and synthesis techniques has been a fruitful research theme for many years and has yielded many powerful rapid system synthesis and optimisation capabilities. However, recent years have seen the spectrum of languages and techniques splinter in an application specific manner, resulting in an ad-hoc design process which is increasingly dependent on the particular application under development. This poses a major problem for automated toolflows attempting to provide rapid system synthesis for a wide ranges of applications. By analysing a number of dataflow FPGA implementation case studies, this paper shows that despit ethis common traits may be found in current techniques, which fall largely into three classes. Further, it exposes limitations pertaining to their ability to adapt algorith models to implementations for different operating environments and target platforms.

Convergent evolutionary processes driven by foraging opportunity in two sympatric morph pairs of Arctic charr with contrasting post-glacial origins

The expression of two or more discrete phenotypes amongst individuals within a species (morphs) provides multiple modes upon which selection can act semi-independently, and thus may be an important stage in speciation. In the present study, we compared two sympatric morph systems aiming to address hypotheses related to their evolutionary origin. Arctic charr in sympatry in Loch Tay, Scotland, exhibit one of two discrete, alternative body size phenotypes at maturity (large or small body size). Arctic charr in Loch Awe segregate into two temporally segregated spawning groups (breeding in either spring or autumn). Mitochondrial DNA restriction fragment length polymorphism analysis showed that the morph pairs in both lakes comprise separate gene pools, although segregation of the Loch Awe morphs is more subtle than that of Loch Tay. We conclude that the Loch Awe morphs diverged in situ (within the lake), whereas Loch Tay morphs most likely arose through multiple invasions by different ancestral groups that segregated before post-glacial invasion (i.e. in allopatry). Both morph pairs showed clear trophic segregation between planktonic and benthic resources (measured by stable isotope analysis) but this was significantly less distinct in Loch Tay than in Loch Awe. By contrast, both inter-morph morphological and life-history differences were more subtle in Loch Awe than in Loch Tay. The strong ecological but relatively weak morphological and life-history divergence of the in situ derived morphs compared to morphs with allopatric origins indicates a strong link between early ecological and subsequent genetic divergence of sympatric origin emerging species pairs. The emergence of parallel specialisms despite distinct genetic origins of these morph pairs suggests that the effect of available foraging opportunities may be at least as important as genetic origin in structuring sympatric divergence in post-glacial fishes with high levels of phenotypic plasticity. (c) 2012 The Linnean Society of London, Biological Journal of the Linnean Society, 2012, , .

Semiring induced valuation algebras: Exact and approximate local computation algorithms

Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra.There are many models of this algebraic structure ranging from probability theory to numerical analysis, relational databases and various classical and non-classical logics. It turns out that many interesting models of valuation algebras may be derived from semiring valued mappings. In this paper we study how valuation algebras are induced by semirings and how the structure of the valuation algebra is related to the algebraic structure of the semiring. In particular, c-semirings with idempotent multiplication induce idempotent valuation algebras and therefore permit particularly efficient architectures for local computation. Also important are semirings whose multiplicative semigroup is embedded in a union of groups. They induce valuation algebras with a partially defined division. For these valuation algebras, the well-known architectures for Bayesian networks apply. We also extend the general computational framework to allow derivation of bounds and approximations, for when exact computation is not feasible.

Asymmetric information without common priors: an indirect evolutionary analysis of quantity competition

The common prior assumption justifies private beliefs as posterior probabilities when updating a common prior based on individual information. We dispose of the common prior assumption for a homogeneous oligopoly market with uncertain costs and firms entertaining arbitrary priors about other firms' cost-type. We show that true prior beliefs can not be evolutionarily stable when truly expected profit measures (reproductive) success.