On the set of hypercyclic vectors for the differentiation

Let D be the differentiation operator Df = f' acting on the Fréchet space H of all entire functions in one variable with the standard (compact-open) topology. It is known since the 1950’s that the set H(D) of hypercyclic vectors for the operator D is non-empty. We treat two questions raised by Aron, Conejero, Peris and Seoane-Sepúlveda whether the set H(D) contains (up to the zero function) a non-trivial subalgebra of H or an infinite-dimensional closed linear subspace of H. In the present article both questions are answered affirmatively.

Design of quantum-dot cellular automata circuits using cut-set retiming

As a potential alternative to CMOS technology, QCA provides an interesting paradigm in both communication and computation. However, QCAs unique four-phase clocking scheme and timing constraints present serious timing issues for interconnection and feedback. In this work, a cut-set retiming design procedure is proposed to resolve these QCA timing issues. The proposed design procedure can accommodate QCAs unique characteristics by performing delay-transfer and time-scaling to reallocate the existing delays so as to achieve efficient clocking zone assignment. Cut-set retiming makes it possible to effectively design relatively complex QCA circuits that include feedback. It utilizes the similar characteristics of synchronization, deep pipelines and local interconnections common to both QCA and systolic architectures. As a case study, a systolic Montgomery modular multiplier is designed to illustrate the procedure. Furthermore, a nonsystolic architecture, an S27 benchmark circuit, is designed and compared with previous designs. The comparison shows that the cut-set retiming method achieves a more efficient design, with a reduction of 22%, 44%, and 46% in terms of cell count, area, and latency, respectively.

A TMA De-Arraying Method for High Throughput Biomarker Discovery in Tissue Research

Background: Tissue MicroArrays (TMAs) represent a potential high-throughput platform for the analysis and discovery of tissue biomarkers. As TMA slides are produced manually and subject to processing and sectioning artefacts, the layout of TMA cores on the final slide and subsequent digital scan (TMA digital slide) is often disturbed making it difficult to associate cores with their original position in the planned TMA map. Additionally, the individual cores can be greatly altered and contain numerous irregularities such as missing cores, grid rotation and stretching. These factors demand the development of a robust method for de-arraying TMAs which identifies each TMA core, and assigns them to their appropriate coordinates on the constructed TMA slide.

Methodology: This study presents a robust TMA de-arraying method consisting of three functional phases: TMA core segmentation, gridding and mapping. The segmentation of TMA cores uses a set of morphological operations to identify each TMA core. Gridding then utilises a Delaunay Triangulation based method to find the row and column indices of each TMA core. Finally, mapping correlates each TMA core from a high resolution TMA whole slide image with its name within a TMAMap.

Conclusion: This study describes a genuine robust TMA de-arraying algorithm for the rapid identification of TMA cores from digital slides. The result of this de-arraying algorithm allows the easy partition of each TMA core for further processing. Based on a test group of 19 TMA slides (3129 cores), 99.84% of cores were segmented successfully, 99.81% of cores were gridded correctly and 99.96% of cores were mapped with their correct names via TMAMaps. The gridding of TMA cores were also extensively tested using a set of 113 pseudo slide (13,536 cores) with a variety of irregular grid layouts including missing cores, rotation and stretching. 100% of the cores were gridded correctly.

Measuring Inconsistency in a Network Intrusion Detection Rule Set Based on Snort

In this preliminary study, we investigate how inconsistency in a network intrusion detection rule set can be measured. To achieve this, we first examine the structure of these rules which are based on Snort and incorporate regular expression (Regex) pattern matching. We then identify primitive elements in these rules in order to translate the rules into their (equivalent) logical forms and to establish connections between them. Additional rules from background knowledge are also introduced to make the correlations among rules more explicit. We measure the degree of inconsistency in formulae of such a rule set (using the Scoring function, Shapley inconsistency values and Blame measure for prioritized knowledge) and compare the informativeness of these measures. Finally, we propose a new measure of inconsistency for prioritized knowledge which incorporates the normalized number of atoms in a language involved in inconsistency to provide a deeper inspection of inconsistent formulae. We conclude that such measures are useful for the network intrusion domain assuming that introducing expert knowledge for correlation of rules is feasible.

Order Flow and the Monetary Model of Exchange Rates: Evidence from a Novel Data Set

We propose an exchange rate model that is a hybrid of the conventional specification with monetary fundamentals and the Evans–Lyons microstructure approach. We estimate a model augmented with order flow variables, using a unique data set: almost 100 monthly observations on interdealer order flow on dollar/euro and dollar/yen. The augmented macroeconomic, or “hybrid,” model exhibits greater in-sample stability and out of sample forecasting improvement vis-à-vis the basic macroeconomic and random walk specifications.

Stellar rotation in the Hyades and Praesepe: gyrochronology and braking time-scale

We present the results of photometric surveys for stellar rotation in the Hyades and in Praesepe, using data obtained as part of the SuperWASP exoplanetary transit-search programme. We determined accurate rotation periods for more than 120 sources whose cluster membership was confirmed by common proper motion and colour-magnitude fits to the clusters' isochrones. This allowed us to determine the effect of magnetic braking on a wide range of spectral types for expected ages of ˜600 Myr for the Hyades and Praesepe. Both clusters show a tight and nearly linear relation between J-Ks colour and rotation period in the F, G and K spectral range. This confirms that loss of angular momentum was significant enough that stars with strongly different initial rotation rates have converged to the same rotation period for a given mass, by the ages of Hyades and Praesepe. In the case of the Hyades, our colour-period sequence extends well into the M dwarf regime and shows a steep increase in the scatter of the colour-period relation, with identification of numerous rapid rotators from ˜0.5 Msun down to the lowest masses probed by our survey (˜0.25 Msun). This provides crucial constraints on the rotational braking time-scales and further clears the way to use gyrochronology as an accurate age measurement tool for main-sequence stars.

Approximating the Set of Local Minima in Partial RNA Folding Landscapes

Motivation: We study a stochastic method for approximating the set of local minima in partial RNA folding landscapes associated with a bounded-distance neighbourhood of folding conformations. The conformations are limited to RNA secondary structures without pseudoknots. The method aims at exploring partial energy landscapes pL induced by folding simulations and their underlying neighbourhood relations. It combines an approximation of the number of local optima devised by Garnier and Kallel (2002) with a run-time estimation for identifying sets of local optima established by Reeves and Eremeev (2004).

Results: The method is tested on nine sequences of length between 50 nt and 400 nt, which allows us to compare the results with data generated by RNAsubopt and subsequent barrier tree calculations. On the nine sequences, the method captures on average 92% of local minima with settings designed for a target of 95%. The run-time of the heuristic can be estimated by O(n2D?ln?), where n is the sequence length, ? is the number of local minima in the partial landscape pL under consideration and D is the maximum number of steepest descent steps in attraction basins associated with pL.

Non-radial pulsation, rotation and outburst in the Be star omega Orionis from the MuSiCoS 1998 campaign

omega Ori (HD37490, HR1934) is a Be star known to have presented variations. In order to investigate the nature and origin of its short-term and mid-term variability, a study is performed of several spectral lines (Halpha, Hdelta, HeI 4471, 4713, 4921, 5876, 6678, CII 4267, 6578, 6583, Mg II 4481, Si III 4553 and Si II 6347), based on 249 high signal-to-noise high-resolution spectra taken with 8 telescopes over 22 consecutive nights during the MuSiCoS (Multi SIte COntinuous Spectroscopy) campaign in November-December 1998. The stellar parameters are revisited and the projected rotational velocity (v sin i = 179 km s(-1)) is redetermined using several methods. With the MuSiCoS 98 dataset, a time series analysis of line-profile variations (LPVs) is performed using the Restricted Local Cleanest (RLC) algorithm and a least squares method. The behaviour of the velocity of the centroid of the lines, the equivalent widths and the apparent vsini for several lines, as well as Violet and Red components of photospheric lines affected by emission (red He i lines, Si II 6347, CII 6578, 6583) are analyzed. The non-radial pulsation (NRP) model is examined using phase diagrams and the Fourier-Doppler Imaging (FDI) method. The LPVs are consistent with a NRP mode with l = 2 or 3, \m\ = 2 with frequency 1.03 cd(-1). It is shown that an emission line outburst occurred in the middle of the campaign. Two scenarios are proposed to explain the behaviour of a dense cloud, temporarily orbiting around the star with a frequency 0.46 c d(-1), in relation to the outburst.

On generating set index functions for randomized caches

Caches hide the growing latency of accesses to the main memory from the processor by storing the most recently used data on-chip. To limit the search time through the caches, they are organized in a direct mapped or set-associative way. Such an organization introduces many conflict misses that hamper performance. This paper studies randomizing set index functions, a technique to place the data in the cache in such a way that conflict misses are avoided. The performance of such a randomized cache strongly depends on the randomization function. This paper discusses a methodology to generate randomization functions that perform well over a broad range of benchmarks. The methodology uses profiling information to predict the conflict miss rate of randomization functions. Then, using this information, a search algorithm finds the best randomization function. Due to implementation issues, it is preferable to use a randomization function that is extremely simple and can be evaluated in little time. For these reasons, we use randomization functions where each randomized address bit is computed as the XOR of a subset of the original address bits. These functions are chosen such that they operate on as few address bits as possible and have few inputs to each XOR. This paper shows that to index a 2(m)-set cache, it suffices to randomize m+2 or m+3 address bits and to limit the number of inputs to each XOR to 2 bits to obtain the full potential of randomization. Furthermore, it is shown that the randomization function that we generate for one set of benchmarks also works well for an entirely different set of benchmarks. Using the described methodology, it is possible to reduce the implementation cost of randomization functions with only an insignificant loss in conflict reduction.