Three constructive examples of separable pre-Hilbert spaces nonisomorphic to their closed hyperplanes

An example of a sigma -compact infinite-dimensional pre-Hilbert space H is constructed such that any continuous linear operator T: H --> H is of the form T = lambdaI + F for some lambda is an element of R and for a finite-dimensional continuous linear operator F. A class of simple examples of pre-Hilbert spaces nonisomorphic to their closed hyperplanes is given. A sigma -compact pre-Hilbert space H isomorphic to H x R x R and nonisomorphic to H x R is also constructed.

The ‘Us’ in Trust: Who Trusts Northern Ireland’s Political Institutions and Actors?

This article examines levels of interest and trust among the public in relation to Northern Ireland's newly established political institutions and actors, through an analysis of the results of the 2007 Northern Ireland Life and Times Survey (NILT). It is important to reveal the specific groups of people with the highest levels of political disenchantment, particularly in the context of the longer-term stability of the Northern Ireland Assembly and Executive, since the willingness of the electorate to have faith and trust in the workability of these political institutions and in the various political actors in whose custody they lie is considered vital.

A constructive approach for examination timetabling based on adaptive decomposition and ordering

In this study, we investigate an adaptive decomposition and ordering strategy that automatically divides examinations into difficult and easy sets for constructing an examination timetable. The examinations in the difficult set are considered to be hard to place and hence are listed before the ones in the easy set in the construction process. Moreover, the examinations within each set are ordered using different strategies based on graph colouring heuristics. Initially, the examinations are placed into the easy set. During the construction process, examinations that cannot be scheduled are identified as the ones causing infeasibility and are moved forward in the difficult set to ensure earlier assignment in subsequent attempts. On the other hand, the examinations that can be scheduled remain in the easy set.

Within the easy set, a new subset called the boundary set is introduced to accommodate shuffling strategies to change the given ordering of examinations. The proposed approach, which incorporates different ordering and shuffling strategies, is explored on the Carter benchmark problems. The empirical results show that the performance of our algorithm is broadly comparable to existing constructive approaches.

Constructive Synthesis of Memory-Intensive Accelerators for FPGA From Nested Loop Kernels

Field-programmable gate arrays are ideal hosts to custom accelerators for signal, image, and data processing but de- mand manual register transfer level design if high performance and low cost are desired. High-level synthesis reduces this design burden but requires manual design of complex on-chip and off-chip memory architectures, a major limitation in applications such as video processing. This paper presents an approach to resolve this shortcoming. A constructive process is described that can derive such accelerators, including on- and off-chip memory storage from a C description such that a user-defined throughput constraint is met. By employing a novel statement-oriented approach, dataflow intermediate models are derived and used to support simple ap- proaches for on-/off-chip buffer partitioning, derivation of custom on-chip memory hierarchies and architecture transformation to ensure user-defined throughput constraints are met with minimum cost. When applied to accelerators for full search motion estima- tion, matrix multiplication, Sobel edge detection, and fast Fourier transform, it is shown how real-time performance up to an order of magnitude in advance of existing commercial HLS tools is enabled whilst including all requisite memory infrastructure. Further, op- timizations are presented that reduce the on-chip buffer capacity and physical resource cost by up to 96% and 75%, respectively, whilst maintaining real-time performance.