Search results for "algorithm."
showing 10 items of 4617 documents
Space-Efficient 1.5-Way Quantum Turing Machine
2001
1.5QTM is a sort of QTM (Quantum Turing Machine) where the head cannot move left (it can stay where it is and move right). For computations is used other - work tape. In this paper will be studied possibilities to economize work tape space more than the same deterministic Turing Machine can do (for some of the languages). As an example language (0i1i|i ≥ 0) is chosen, and is proved that this language could be recognized by deterministic Turing machine using log(i) cells on work tape , and 1.5QTM can recognize it using constant cells quantity.
Automata and forbidden words
1998
Abstract Let L ( M ) be the (factorial) language avoiding a given anti-factorial language M . We design an automaton accepting L ( M ) and built from the language M . The construction is effective if M is finite. If M is the set of minimal forbidden words of a single word ν, the automaton turns out to be the factor automaton of ν (the minimal automaton accepting the set of factors of ν). We also give an algorithm that builds the trie of M from the factor automaton of a single word. It yields a nontrivial upper bound on the number of minimal forbidden words of a word.
Minimal forbidden words and factor automata
1998
International audience; Let L(M) be the (factorial) language avoiding a given antifactorial language M. We design an automaton accepting L(M) and built from the language M. The construction is eff ective if M is finite. If M is the set of minimal forbidden words of a single word v, the automaton turns out to be the factor automaton of v (the minimal automaton accepting the set of factors of v). We also give an algorithm that builds the trie of M from the factor automaton of a single word. It yields a non-trivial upper bound on the number of minimal forbidden words of a word.
Upper bounds on multiparty communication complexity of shifts
1996
We consider some communication complexity problems which arise when proving lower bounds on the complexity of Boolean functions. In particular, we prove an \(O(\frac{n}{{2\sqrt {\log n} }}\log ^{1/4} n)\)upper bound on 3-party communication complexity of shifts, an O(n e ) upper bound on the multiparty communication complexity of shifts for a polylogarithmic number of parties. These bounds are all significant improvements over ones recently considered “unexpected” by Pudlak [5].
Identification of Clusters of Investors from Their Real Trading Activity in a Financial Market
2011
We use statistically validated networks, a recently introduced method to validate links in a bipartite system, to identify clusters of investors trading in a financial market. Specifically, we investigate a special database allowing to track the trading activity of individual investors of the stock Nokia. We find that many statistically detected clusters of investors show a very high degree of synchronization in the time when they decide to trade and in the trading action taken. We investigate the composition of these clusters and we find that several of them show an over-expression of specific categories of investors.
A novel mutation (Thr116IIe) in the presenilin 1 gene in a patient with early-onset Alzheimer's disease
2004
We report a novel presenilin 1 (PSN1) mutation (Thr116Ile) in a woman with early onset Alzheimer's disease (AD). This mutation was not found in 100 healthy controls, indicating that this is not a common polymorphism. The patient presented with forgetfulness at age 45, followed over the next 3 years by a worsening of the memory loss and frequent episodes of confusion and spatial disorientation. Neuroimaging studies were consistent with AD. The analysis of the family's pedigree showed that the proband was apparently the only member affected. Because the early death of several close relatives (i.e. the mother and the grandmother) and the demonstration that the father is not a mutation carrier,…
Validation of the solution method using Tikhonov regularization algorithm for spectral line diagnostics of microsize plasma
2014
This paper is devoted obtaining the threshold of the credibility of the solution by means of Tikhonov's regularization method in case of spectral lines, emitted from microsize plasma sources. The reliability of Tikhonov algorithm was verified by means of solving model tasks with different ratio between instrumental function and measured profile and, with different levels of noise.
Software tools for using a personal computer as a timer device to assess human kinematic performance: a case study.
1995
Frequently, the assessment of the physical condition of a sportsman depends on the evaluation of different tests, based on biomechanical performance. The data acquisition in these tests is usually hand made, because its automatization is difficult. But when movements are constrained by means of their specific nature, simple tools can be used to achieve that data acquisition. In this paper, a simple and inexpensive system is described to make use of the timing capabilities of a personal computer (PC) to use it as a timer, with applications in biomechanics and sport training. The data acquisition method is based on a PC that, using a specific programming dealing with event timing, gets signal…
Critical behavior of a tumor growth model: directed percolation with a mean-field flavor.
2012
We examine the critical behaviour of a lattice model of tumor growth where supplied nutrients are correlated with the distribution of tumor cells. Our results support the previous report (Ferreira et al., Phys. Rev. E 85, 010901 (2012)), which suggested that the critical behaviour of the model differs from the expected Directed Percolation (DP) universality class. Surprisingly, only some of the critical exponents (beta, alpha, nu_perp, and z) take non-DP values while some others (beta', nu_||, and spreading-dynamics exponents Theta, delta, z') remain very close to their DP counterparts. The obtained exponents satisfy the scaling relations beta=alpha*nu_||, beta'=delta*nu_||, and the general…
Functional Brain Segmentation Using Inter-Subject Correlation in fMRI
2016
The human brain continuously processes massive amounts of rich sensory information. To better understand such highly complex brain processes, modern neuroimaging studies are increasingly utilizing experimental setups that better mimic daily‐life situations. A new exploratory data‐analysis approach, functional segmentation inter‐subject correlation analysis (FuSeISC), was proposed to facilitate the analysis of functional magnetic resonance (fMRI) data sets collected in these experiments. The method provides a new type of functional segmentation of brain areas, not only characterizing areas that display similar processing across subjects but also areas in which processing across subjects is h…