Technology of Storage and Processing of Electronic Documents with Intellectual Search Properties

The technology of record, storage and processing of the texts, based on creation of integer index cycles is discussed. Algorithms of exact-match search and search similar on the basis of inquiry in a natural language are considered. The software realizing offered approaches is described, and examples of the electronic archives possessing properties of intellectual search are resulted.

Bit-index sort: a fast non-comparison integer sorting algorithm for permutations

This paper describes a fast integer sorting algorithm, herein referred as Bit-index sort, which is a non-comparison sorting algorithm for partial per-mutations, with linear complexity order in execution time. Bit-index sort uses a bit-array to classify input sequences of distinct integers, and exploits built-in bit functions in C compilers supported by machine hardware to retrieve the ordered output sequence. Results show that Bit-index sort outperforms in execution time to quicksort and counting sort algorithms. A parallel approach for Bit-index sort using two simultaneous threads is included, which obtains speedups up to 1.6.

Bit-index sort: A fast non-comparison integer sorting algorithm for permutations

This paper describes a fast integer sorting algorithm, herein referred to as Bit-index sort, which does not use comparisons and is intended to sort partial permutations. Experimental results exhibit linear complexity order in execution time. Bit-index sort uses a bit-array to classify input sequences of distinct integers, and exploits built-in bit functions in C compilers, supported by machine hardware, to retrieve the ordered output sequence. Results show that Bit-index sort outperforms quicksort and counting sort algorithms when compared in their execution time. A parallel approach for Bit-index sort using two simultaneous threads is also included, which obtains further speedups of up to 1.6 compared to its sequential case.

Continuation of limit cycles near saddle homoclinic points using splines in phase space

We present a new algorithm for continuation of limit cycles of autonomous systems as a system parameter is varied. The algorithm works in phase space with an ordered set of points on the limit cycle, along with spline interpolation. Currently popular algorithms in bifurcation analysis packages compute time-domain approximations of limit cycles using either shooting or collocation. The present approach seems useful for continuation near saddle homoclinic points, where it encounters a corner while time-domain methods essentially encounter a discontinuity (a relatively short period of rapid variation). Other phase space-based algorithms use rescaled arclength in place of time, but subsequently resemble the time-domain methods. Compared to these, we introduce additional freedom through a variable stretching of arclength based on local curvature, through the use of an auxiliary index-based variable. Several numerical examples are presented. Comparisons with results from the popular package, MATCONT, are favorable close to saddle homoclinic points.

d-Regular Graphs of Acyclic Chromatic Index at Least d+2

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). It was conjectured by Alon, Suclakov and Zaks (and earlier by Fiamcik) that a'(G) <= Delta+2, where Delta = Delta(G) denotes the maximum degree of the graph. Alon et al. also raised the question whether the complete graphs of even order are the only regular graphs which require Delta+2 colors to be acyclically edge colored. In this article, using a simple counting argument we observe not only that this is not true, but in fact all d-regular graphs with 2n vertices and d>n, requires at least d+2 colors. We also show that a'(K-n,K-n) >= n+2, when n is odd using a more non-trivial argument. (Here K-n,K-n denotes the complete bipartite graph with n vertices on each side.) This lower bound for Kn,n can be shown to be tight for some families of complete bipartite graphs and for small values of n. We also infer that for every d, n such that d >= 5, n >= 2d+3 and dn even, there exist d-regular graphs which require at least d+2-colors to be acyclically edge colored. (C) 2009 Wiley Periodicals, Inc. J Graph Theory 63: 226-230, 2010.

Relative roles of instruction count and cycles per instruction in WCET estimation

Most of the existing WCET estimation methods directly estimate execution time, ET, in cycles. We propose to study ET as a product of two factors, ET = IC * CPI, where IC is instruction count and CPI is cycles per instruction. Considering directly the estimation of ET may lead to a highly pessimistic estimate since implicitly these methods may be using worst case IC and worst case CPI. We hypothesize that there exists a functional relationship between CPI and IC such that CPI=f(IC). This is ascertained by computing the covariance matrix and studying the scatter plots of CPI versus IC. IC and CPI values are obtained by running benchmarks with a large number of inputs using the cycle accurate architectural simulator, Simplescalar on two different architectures. It is shown that the benchmarks can be grouped into different classes based on the CPI versus IC relationship. For some benchmarks like FFT, FIR etc., both IC and CPI are almost a constant irrespective of the input. There are other benchmarks that exhibit a direct or an inverse relationship between CPI and IC. In such a case, one can predict CPI for a given IC as CPI=f(IC). We derive the theoretical worst case IC for a program, denoted as SWIC, using integer linear programming(ILP) and estimate WCET as SWIC*f(SWIC). However, if CPI decreases sharply with IC then measured maximum cycles is observed to be a better estimate. For certain other benchmarks, it is observed that the CPI versus IC relationship is either random or CPI remains constant with varying IC. In such cases, WCET is estimated as the product of SWIC and measured maximum CPI. It is observed that use of the proposed method results in tighter WCET estimates than Chronos, a static WCET analyzer, for most benchmarks for the two architectures considered in this paper.

Relationship Between Infestation By Mytilicola-Intestinalis Steuer (Copepoda Cyclopoidea) And Condition Index Of Mytilus-Edulis In Southwest England

Seasonal cycles in the condition index of Mytilus edulis from three sites in southwest England are described. These are analysed in relation to host length, stage of gonad development and parasite burden by linear regression analysis. An effect on the condition index due to the presence of Mytilicola intestinalis can be detected only in the sublittoral mussels in those few winter months when the mean intensity of infestation is over about 25 parasites per host. In all cases studied, the magnitude of the effect due to variation in host length, stage of gonad development, seasonal cycles and environmental factors is greater than that due to parasitism.

Integer-valued APARCH processes in the analysis of time series of counts

The Asymmetric Power Arch representation for the volatility was introduced by Ding et al.(1993) in order to account for asymmetric responses in the volatility in the analysis of continuous-valued financial time series like, for instance, the log-return series of foreign exchange rates, stock indices or share prices. As reported by Brannas and Quoreshi (2010), asymmetric responses in volatility are also observed in time series of counts such as the number of intra-day transactions in stocks. In this work, an asymmetric power autoregressive conditional Poisson model is introduced for the analysis of time series of counts exhibiting asymmetric overdispersion. Basic probabilistic and statistical properties are summarized and parameter estimation is discussed. A simulation study is presented to illustrate the proposed model. Finally, an empirical application to a set of data concerning the daily number of stock transactions is also presented to attest for its practical applicability in data analysis.

Gauging the Success of Technical Trading Strategies in the S&P 500 Index Futures Market.

Rapport de recherche

Asymmetries in Business Cycles

Esta disertación busca estudiar los mecanismos de transmisión que vinculan el comportamiento de agentes y firmas con las asimetrías presentes en los ciclos económicos. Para lograr esto, se construyeron tres modelos DSGE. El en primer capítulo, el supuesto de función cuadrática simétrica de ajuste de la inversión fue removido, y el modelo canónico RBC fue reformulado suponiendo que des-invertir es más costoso que invertir una unidad de capital físico. En el segundo capítulo, la contribución más importante de esta disertación es presentada: la construcción de una función de utilidad general que anida aversión a la pérdida, aversión al riesgo y formación de hábitos, por medio de una función de transición suave. La razón para hacerlo así es el hecho de que los individuos son aversos a la pérdidad en recesiones, y son aversos al riesgo en auges. En el tercer capítulo, las asimetrías en los ciclos económicos son analizadas junto con ajuste asimétrico en precios y salarios en un contexto neokeynesiano, con el fin de encontrar una explicación teórica de la bien documentada asimetría presente en la Curva de Phillips.

Twenty-three cycles of changing open solar magnetic flux

This paper presents a comparison of various estimates of the open solar flux, deduced from measurements of the interplanetary magnetic field, from the aa geomagnetic index and from photospheric magnetic field observations. The first two of these estimates are made using the Ulysses discovery that the radial heliospheric field is approximately independent of heliographic latitude, the third makes use of the potential-field source surface method to map the total flux through the photosphere to the open flux at the top of the corona. The uncertainties associated with using the Ulysses result are 5%, but the effects of the assumptions of the potential field source surface method are harder to evaluate. Nevertheless, the three methods give similar results for the last three solar cycles when the data sets overlap. In 11-year running means, all three methods reveal that 1987 marked a significant peak in the long-term variation of the open solar flux. This peak is close to the solar minimum between sunspot cycles 21 and 22, and consequently the mean open flux (averaged from minimum to minimum) is similar for these two cycles. However, this similarity between cycles 21 and 22 in no way implies that the open flux is constant. The long-term variation shows that these cycles are fundamentally different in that the average open flux was rising during cycle 21 (from consistently lower values in cycle 20 and toward the peak in 1987) but was falling during cycle 22 (toward consistently lower values in cycle 23). The estimates from the geomagnetic aa index are unique as they extend from 1842 onwards (using the Helsinki extension). This variation gives strong anticorrelations, with very high statistical significance levels, with cosmic ray fluxes and with the abundances of the cosmogenic isotopes that they produce. Thus observations of photospheric magnetic fields, of cosmic ray fluxes, and of cosmogenic isotope abundances all support the long-term drifts in open solar flux reported by Lockwood et al. [1999a, 1999b].

The 3-colored Ramsey number of even cycles

Denote by R(L, L, L) the minimum integer N such that any 3-coloring of the edges of the complete graph on N vertices contains a monochromatic copy of a graph L. Bondy and Erdos conjectured that when L is the cycle C(n) on n vertices, R(C(n), C(n), C(n)) = 4n - 3 for every odd n > 3. Luczak proved that if n is odd, then R(C(n), C(n), C(n)) = 4n + o(n), as n -> infinity, and Kohayakawa, Simonovits and Skokan confirmed the Bondy-Erdos conjecture for all sufficiently large values of n. Figaj and Luczak determined an asymptotic result for the `complementary` case where the cycles are even: they showed that for even n, we have R(C(n), C(n), C(n)) = 2n + o(n), as n -> infinity. In this paper, we prove that there exists n I such that for every even n >= n(1), R(C(n), C(n), C(n)) = 2n. (C) 2009 Elsevier Inc. All rights reserved.

Loss of periodicity in breeding success of waders links to changes in lemming cycles in Arctic ecosystems

Lemming population cycles in the Arctic have an important impact on the Arctic food web, indirectly also affecting breeding success in Arctic-nesting birds through shared predators. Over the last two decades lemming cycles have changed in amplitude and even disappeared in parts of the Arctic. To examine the large scale effect of these recent changes we re-analysed published data from the East Atlantic Flyway (EAF), where a relationship between lemming cycles and wader breeding success was earlier found, and new data on breeding success of waders in the East Asian-Australasian Flyway (EAAF). We found that 1) any long-term periodicities in wader breeding success existed only until the year 2000 in the EAAF and until the 1980s in the EAF; 2) studying these patterns at a smaller spatial scale, where the Siberian-Alaskan breeding grounds were divided into five geographical units largely based on landscape features, breeding success of waders from the EAAF was not correlated to an index of predation pressure, but positively correlated to Arctic summer temperatures in some species. We argue that fading out of lemming cycles in some parts of the Arctic is responsible for faltering periodicity in wader breeding success along both flyways. These changed conditions have not yet resulted in any marked changing trends in breeding success across years, and declining numbers of waders along the EAAF are therefore more likely a result of changing conditions at stop-over and wintering sites.