Search results for "string"
showing 10 items of 381 documents
Quantum Algorithms for Some Strings Problems Based on Quantum String Comparator
2022
We study algorithms for solving three problems on strings. These are sorting of n strings of length k, “the Most Frequent String Search Problem”, and “searching intersection of two sequences of strings”. We construct quantum algorithms that are faster than classical (randomized or deterministic) counterparts for each of these problems. The quantum algorithms are based on the quantum procedure for comparing two strings of length k in O(k) queries. The first problem is sorting n strings of length k. We show that classical complexity of the problem is Θ(nk) for constant size alphabet, but our quantum algorithm has O˜(nk) complexity. The second one is searching the most frequent string among n …
Group theory aspects of chaotic strings
2014
Chaotic strings are a special type of non-hyperbolic coupled map lattices, exhibiting a rich structure of complex dynamical phenomena with a surprising correspondence to physical contents. Chaotic strings are generated by the Chebyshev maps T2() and T3(). In this paper we connect the Chebyshev maps via the Galois theory to the cyclic groups Z2 and Z3 and give some ideas how this fundamental connection might lead to the emergence of the familiar Lie group structure of particle physics and, finally, even to the emergence of space-time. The Z3-graded cubic and ternary algebras presented here have been introduced by R. Kerner in 1991 and then developed and elaborated in collaboration with many …
Salivary protein profiles and sensitivity to the bitter taste of caffeine.
2011
WOS: 000298381900008; International audience; The interindividual variation in the sensitivity to bitterness is attributed in part to genetic polymorphism at the taste receptor level, but other factors, such as saliva composition, might be involved. In order to investigate this, 2 groups of subjects (hyposensitive, hypersensitive) were selected from 29 healthy male volunteers based on their detection thresholds for caffeine, and their salivary proteome composition was compared. Abundance of 26 of the 255 spots detected on saliva electrophoretic patterns was significantly different between hypo- and hypersensitive subjects. Saliva of hypersensitive subjects contained higher levels of amylase…
An Improved Decision System for URL Accesses Based on a Rough Feature Selection Technique
2015
Corporate security is usually one of the matters in which companies invest more resources, since the loss of information directly translates into monetary losses. Security issues might have an origin in external attacks or internal security failures, but an important part of the security breaches is related to the lack of awareness that the employees have with regard to the use of the Web. In this work we have focused on the latter problem, describing the improvements to a system able to detect anomalous and potentially insecure situations that could be dangerous for a company. This system was initially conceived as a better alternative to what are known as black/white lists. These lists co…
Improving Efficacy of PubMed Clinical Queries for Retrieving Scientifically Strong Studies on Treatment
2006
The authors evaluated the retrieval power of PubMed "Clinical Queries," narrow search string, about therapy in comparison with a modified search string to avoid possible retrieval bias. PubMed search strategy was compared to a slightly modified string that included the Britannic English term "randomised." The authors tested the two strings joined onto each of four terms concerning topics of broad interest: hypertension, hepatitis, diabetes, and heart failure. In particular, precision was computed for not-indexed citations. The added word "randomised" improved total citation retrieval in any case. Total retrieval gain for not-indexed citations ranged from 11.1% to 21.4%. A significant number…
Inter-string arrays of bimetallic assemblies with alternative Cu2+-Cl-Cu2+ and Cu-NC-M (M = Co3+, Fe+3, Cr+3) bridges: syntheses, crystal structure, …
2004
Three bimetallic assemblies with alternate homometallic bridges through chloride ligands and heterometallic bridges through cyanide ligands of formula [(323)(2)Cu(2)(Cl)M(CN)(6)](n).2n(H(2)O), where 323 = N,N'-bis(3-aminopropyl)ethylenediamine and M = Co(3+) for 1, Fe(3+) for 2, and Cr(3+) for 3, were synthesized. They have been characterized structurally, analytically, spectroscopically, and magnetically. All three assemblies crystallize in the monoclinic system in the same space group P2(1)/n, with a = 11.642(2) A, b = 10.285(3) A, c = 13.622(2) A, beta = 95.69(3) degrees, V = 1623.1(6) A(3), and Z = 4 for 1; a = 11.681(4) A, b = 10.315(3) A, c = 13.567(5) A, beta = 95.62(3) degrees, V = …
Supersymmetric Indices of 3d S-fold SCFTs
2019
Enhancement of global symmetry and supersymmetry in the infrared is one of the most intriguing phenomena in quantum field theory. We investigate such phenomena in a large class of three dimensional superconformal field theories, known as the S-fold SCFTs. Supersymmetric indices are computed for a number of theories containing small rank gauge groups. It is found that indices of several models exhibit enhancement of supersymmetry at the superconformal fixed point in the infrared. Dualities between S-fold theories that have different quiver descriptions are also analysed. We explore a new class of theories with a discrete global symmetry, whose gauge symmetry in the quiver has a different glo…
Doesdarknesslead tohappiness? Masked suffix priming effects
2008
Masked affix priming effects have usually been obtained for words sharing the initial affix (e.g., re action- RE FORM). However, prior evidence on masked suffix priming effects (e.g., bak er -WALK ER ) is inconclusive. In the present series of masked priming lexical decision experiments, a target word was briefly preceded by a morphologically or orthographically related prime, or by an unrelated prime. In Experiment 1, the prime words in the suffix priming condition were formed by their suffixes (e.g., er -WALK ER ). In Experiment 2, the primes included the suffix inserted in a nonsense symbol string (e.g., %%%% er -WALK ER ). In Experiment 3, the primes were formed by a real word that shar…
Orthographic and Phonological Neighborhoods in Naming: Not All Neighbors Are Equally Influential in Orthographic Space
1997
Abstract The neighborhood size effect refers to the finding that single word naming is faster for stimuli that are orthographically similar to numerous lexical entries. We explored the nature of this phenomenon in five experiments with French pseudowords and words, and we examined the orthographic and the phonological characteristics of neighbors through quantitative analyses of a word corpus. Experiments 1 and 2 showed that the facilitatory effect of neighborhood size was determined by a subset of neighbors, called phonographic neighbors, which are also phonologically similar to the target letter string. Experiments 3 to 5 aimed at assessing the influence of phonographic neighbors as a fun…
Sparse Dynamic Programming for Longest Common Subsequence from Fragments
2002
Sparse Dynamic Programming has emerged as an essential tool for the design of efficient algorithms for optimization problems coming from such diverse areas as computer science, computational biology, and speech recognition. We provide a new sparse dynamic programming technique that extends the Hunt?Szymanski paradigm for the computation of the longest common subsequence (LCS) and apply it to solve the LCS from Fragments problem: given a pair of strings X and Y (of length n and m, respectively) and a set M of matching substrings of X and Y, find the longest common subsequence based only on the symbol correspondences induced by the substrings. This problem arises in an application to analysis…