String Length Research Articles

How are brand names of Chinese companies perceived by Americans?

Purpose – The purpose of this paper was to conduct an experimental design of Americans’ preferences for the English version of Chinese brand names by drawing from prior research in psychology, linguistics and marketing. The impact of string length and semantic relevance to English on meaningfulness, memorability and likeability of brand names from Chinese companies was assessed. Design/methodology/approach – A 2 × 2 experimental design was used, whereby brand names are categorized by string length (short vs long) and semantic relevance to English (with vs without). Respondents’ perception of the Chinese language in terms of pronounceability, language familiarity and language attitude is used as covariate. Findings – Results reveal shorter brand names, and those with semantic relevance to English are perceived as more memorable. It was also found that pronounceability of the brand name does influence brand name preference in terms of their meaningfulness, memorability and likeability. Research limitations/implications – This exploratory paper is limited to Americans’ perceptions of the English version of Chinese automobile brand names. Practical implications – Chinese companies should therefore carefully consider the brand name characteristics in terms of string length and semantic relevance, as well as their ease of pronunciation when choosing and introducing their brand name in the USA. Originality/value – This is the first paper which assesses Western consumers’ perception of brand names from Chinese automobile companies in terms of their brand meaningfulness, brand memorability and brand likeability.

Synchronous context-free grammars and optimal linear parsing strategies

Synchronous Context-Free Grammars (SCFGs), also known as syntax-directed translation schemata [1,2], are unlike context-free grammars in that they do not have a binary normal form. In general, parsing with SCFGs takes space and time polynomial in the length of the input strings, but with the degree of the polynomial depending on the permutations of the SCFG rules. We consider linear parsing strategies, which add one nonterminal at a time. We show that for a given input permutation, the problems of finding the linear parsing strategy with the minimum space and time complexity are both NP-hard.

Generalized closest substring encryption

We propose a new cryptographic notion called generalized closest substring encryption. In this notion, a ciphertext encrypted with a string \(S\) can be decrypted with a private key of another string \(S'\), if there exist a substring of \(S\), i.e. \(\hat{S}\), and a substring of \(S'\), i.e. \(\hat{S}'\), that are “close” to each other measured by their “overlap distance”. The overlap distance between \(\hat{S}\) and \(\hat{S}'\) is the number of identical positions at which the corresponding symbols are the same. In comparison with other encryption systems, the closest notion is the Fuzzy-IBE proposed by Sahai and Waters. The main difference is that the Fuzzy-IBE measures the overlap distance between \(S\) and \(S'\), while ours measures the overlap distance of all of their substrings (including the complete string), and we take the maximum value among those. The overlap distance between their substrings will measure the similarity of \(S\) and \(S'\) more precisely compared to the overlap distance between the two complete strings. We note that embedding this overlap distance in an encryption is a challenging task, in particular in order to achieve a practical scheme. Therefore, we invent a new approach to develop a practical generalized closest substring encryption system. The novelty of our approach relies on the way we generate ciphertext and private key representing the complete string so that they can still measure the overlap distance of substrings. The size of ciphertext and private key grow linearly only in the length of the input string. We prove the security in the selective model under a generalization of decision \(q\)-Bilinear Diffie–Hellman Exponent assumption.

환형문자열에 대한 대표문자열을 찾는 병렬 알고리즘

The consensus problem is finding a representative string, called a consensus, of a given set S of k strings. Circular strings are different from linear strings in that the last symbol precedes the first symbol. Given a set S of circular strings of length n over an alphabet , we first present an time parallel algorithm for finding a consensus of S minimizing both radius and distance sum when k=3 using O(n) threads. Then we present an time parallel algorithm for finding a consensus of S minimizing distance sum when k=4 using O(n) threads. Finally, we compare execution times of our algorithms implemented using CUDA with corresponding sequential algorithms.

Algorithmic complexity for psychology: a user-friendly implementation of the coding theorem method.

Kolmogorov-Chaitin complexity has long been believed to be impossible to approximate when it comes to short sequences (e.g. of length 5-50). However, with the newly developed coding theorem method the complexity of strings of length 2-11 can now be numerically estimated. We present the theoretical basis of algorithmic complexity for short strings (ACSS) and describe an R-package providing functions based on ACSS that will cover psychologists' needs and improve upon previous methods in three ways: (1) ACSS is now available not only for binary strings, but for strings based on up to 9 different symbols, (2) ACSS no longer requires time-consuming computing, and (3) a new approach based on ACSS gives access to an estimation of the complexity of strings of any length. Finally, three illustrative examples show how these tools can be applied to psychology.

Spectral analysis for a degenerate tree and applications

The energy in network of strings subject to the feedback in a root is decreasing to zero if the network is non-degenerate and this decrease is never exponential. We study in this paper the case of degenerate network (i.e. the ratio of two lengths of strings is a rational number) with a feedback in the root of the network. Under this assumption, we determine the energy limit and we identify the best rate of decay with the spectral abscissa of the underlying semi-group generator. We identify the spectral abscissa as in terms of the largest modulus of the roots of a polynomial.

Confining strings in supersymmetric theories with Higgs branches

We study flux tubes (strings) on the Higgs branches in supersymmetric gauge theories. In generic vacua on the Higgs branches strings were shown to develop long-range "tails" associated with massless fields, a characteristic feature of the Higgs branch (the only exception is the vacuum at the base of the Higgs branch). A natural infrared regularization for the above tails is provided by a finite string length L. We perform a numerical study of these strings in generic vacua. We focus on the simplest example of strings in N=1 supersymmetric QED with the Fayet-Iliopoulos term. In particular, we examine the accuracy of a logarithmic approximation (proposed earlier by Evlampiev and Yung) for the tension of such string solutions. In the Evlampiev-Yung formula the dependence of tension on the string length is logarithmic and the dependence on the geodesic length from the base of the Higgs branch is quadratic. We observe a remarkable agreement of our numerical results for the string tension with the Evlampiev-Yung analytic expression.

Testing a model of componential processing of multi-symbol numbers-evidence from measurement units.

Research on numerical cognition has addressed the processing of nonsymbolic quantities and symbolic digits extensively. However, magnitude processing of measurement units is still a neglected topic in numerical cognition research. Hence, we investigated the processing of measurement units to evaluate whether typical effects of multi-digit number processing such as the compatibility effect, the string length congruity effect, and the distance effect are also present for measurement units. In three experiments, participants had to single out the larger one of two physical quantities (e.g., lengths). In Experiment 1, the compatibility of number and measurement unit (compatible: 3 mm_6 cm with 3 < 6 and mm < cm; incompatible: 3 cm_6 mm with 3 < 6 but cm > mm) as well as string length congruity (congruent: 1 m_2 km with m < km and 2 < 3 characters; incongruent: 2 mm_1 m with mm < m, but 3 > 2 characters) were manipulated. We observed reliable compatibility effects with prolonged reaction times (RT) for incompatible trials. Moreover, a string length congruity effect was present in RT with longer RT for incongruent trials. Experiments 2 and 3 served as control experiments showing that compatibility effects persist when controlling for holistic distance and that a distance effect for measurement units exists. Our findings indicate that numbers and measurement units are processed in a componential manner and thus highlight that processing characteristics of multi-digit numbers generalize to measurement units. Thereby, our data lend further support to the recently proposed generalized model of componential multi-symbol number processing.

A multiobjective spatial fuzzy clustering algorithm for image segmentation

This article describes a multiobjective spatial fuzzy clustering algorithm for image segmentation. To obtain satisfactory segmentation performance for noisy images, the proposed method introduces the non-local spatial information derived from the image into fitness functions which respectively consider the global fuzzy compactness and fuzzy separation among the clusters. After producing the set of non-dominated solutions, the final clustering solution is chosen by a cluster validity index utilizing the non-local spatial information. Moreover, to automatically evolve the number of clusters in the proposed method, a real-coded variable string length technique is used to encode the cluster centers in the chromosomes. The proposed method is applied to synthetic and real images contaminated by noise and compared with k-means, fuzzy c-means, two fuzzy c-means clustering algorithms with spatial information and a multiobjective variable string length genetic fuzzy clustering algorithm. The experimental results show that the proposed method behaves well in evolving the number of clusters and obtaining satisfactory performance on noisy image segmentation.

Economic Modeling Using Evolutionary Algorithms: The Influence of Mutation on the Premature Convergence Effect

This work is concerned with the possible impact binary encoding of strategies may have on the performance of genetic algorithms popular in agent-based computational economic research. In their recent work, Waltman et al. (J Evol Econ 21(5): 737---756, 2011) consider binary encoding and its possible contribution to a phenomenon referred to as premature convergence; the observation that different individual runs of the genetic algorithm can lead to very different results. While Alkemade et al. (Comput Econ 28(4): 355---370, 2006), (Comput Intell 23(2): 162---175, 2007), (Comput Econ 33(1): 99---101, 2009) argue that premature convergence is caused by insufficient population size, Waltman et al. argue that this phenomenon depends crucially on strategies being encoded in binary form. This conclusion is based on their illustration that premature convergence can be avoided even in simulations with small populations so long as real, rather than binary, encoding of strategies is utilized. Utilizing their methodology, we return to the consideration of the cause of premature convergence. After robustness checks with respect to the length of the binary string used for encoding, the fitness function, and the form of mutation, it is concluded that an alternative specification of mutation may also alleviate the occurrence of premature convergence. It is argued that this alternative form of mutation may be more appropriate in a wider range of problems where real encoding of strategies may not prove sufficient.

DReX

We present DReX, a declarative language that can express all regular string-to string transformations, and can still be efficiently evaluated. The class of regular string transformations has a robust theoretical foundation including multiple characterizations, closure properties, and decidable analysis questions, and admits a number of string operations such as insertion, deletion, substring swap, and reversal. Recent research has led to a characterization of regular string transformations using a primitive set of function combinators analogous to the definition of regular languages using regular expressions. While these combinators form the basis for the language DReX proposed in this paper, our main technical focus is on the complexity of evaluating the output of a DReX program on a given input string. It turns out that the natural evaluation algorithm involves dynamic programming, leading to complexity that is cubic in the length of the input string. Our main contribution is identifying a consistency restriction on the use of combinators in DReX programs, and a single-pass evaluation algorithm for consistent programs with time complexity that is linear in the length of the input string and polynomial in the size of the program. We show that the consistency restriction does not limit the expressiveness, and whether a DReX program is consistent can be checked efficiently. We report on a prototype implementation, and evaluate it using a representative set of text processing tasks.

Shifted Hamming distance: a fast and accurate SIMD-friendly filter to accelerate alignment verification in read mapping.

Calculating the edit-distance (i.e. minimum number of insertions, deletions and substitutions) between short DNA sequences is the primary task performed by seed-and-extend based mappers, which compare billions of sequences. In practice, only sequence pairs with a small edit-distance provide useful scientific data. However, the majority of sequence pairs analyzed by seed-and-extend based mappers differ by significantly more errors than what is typically allowed. Such error-abundant sequence pairs needlessly waste resources and severely hinder the performance of read mappers. Therefore, it is crucial to develop a fast and accurate filter that can rapidly and efficiently detect error-abundant string pairs and remove them from consideration before more computationally expensive methods are used. We present a simple and efficient algorithm, Shifted Hamming Distance (SHD), which accelerates the alignment verification procedure in read mapping, by quickly filtering out error-abundant sequence pairs using bit-parallel and SIMD-parallel operations. SHD only filters string pairs that contain more errors than a user-defined threshold, making it fully comprehensive. It also maintains high accuracy with moderate error threshold (up to 5% of the string length) while achieving a 3-fold speedup over the best previous algorithm (Gene Myers's bit-vector algorithm). SHD is compatible with all mappers that perform sequence alignment for verification.

String Reconstruction from Substring Compositions

Motivated by mass-spectrometry protein sequencing, we consider the problem of reconstructing a string from the multisets of its substring composition. We show that all strings of length 7, one less than a prime and one less than twice a prime, can be reconstructed uniquely up to reversal. For all other lengths, we show that unique reconstruction is not always possible and provide sometimes-tight bounds on the largest number of strings with given substring compositions. The lower bounds are derived by combinatorial arguments, while the upper bounds follow from algebraic approaches that lead to precise characterizations of the sets of strings with the same substring compositions in terms of the factorization properties of bivariate polynomials. Using results on the transience of multidimensional random walks, we also provide a reconstruction algorithm that recovers random strings over alphabets of size $\ge4$ from their substring compositions in optimal near-quadratic time. The problem considered is related...

Random Access to Grammar-Compressed Strings and Trees

Grammar-based compression, where one replaces a long string by a small context-free grammar that generates the string, is a simple and powerful paradigm that captures (sometimes with slight reduction in efficiency) many of the popular compression schemes, including the Lempel--Ziv family, run-length encoding, byte-pair encoding, Sequitur, and Re-Pair. In this paper, we present a novel grammar representation that allows efficient random access to any character or substring without decompressing the string. Let $S$ be a string of length $N$ compressed into a context-free grammar $\mathcal{S}$ of size $n$. We present two representations of $\mathcal{S}$ achieving $O(\log N)$ random access time, and either $O(n\cdot\alpha_k(n))$ construction time and space on the pointer machine model, or $O(n)$ construction time and space on the RAM. Here, $\alpha_k(n)$ is the inverse of the $k$th row of Ackermann's function. Our representations also efficiently support decompression of any substring in $S$: we can decompres...

D-brane scattering and annihilation

We study the dynamics of parallel brane-brane and brane-antibrane scattering in string theory in flat spacetime, focusing on the pair production of open strings that stretch between the branes. We are particularly interested in the case of scattering at small impact parameter $b < l_s$, where there is a tachyon in the spectrum when a brane and an antibrane approach within a string length. Our conclusion is that despite the tachyon, branes and antibranes can pass through each other with only a very small probability of annihilating, so long as $g_s$ is small and the relative velocity $v$ is neither too small nor too close to 1. Our analysis is relevant also to the case of charged open string production in world-volume electric fields, and we make use of this T-dual scenario in our analysis. We briefly discuss the application of our results to a stringy model of inflation involving moving branes.

Developmental stages and fecundity of Lepeophtheirus simplex (Copepoda: Caligidae) parasitic on bullseye puffer fish (Sphoeroides annulatus)

Lepeophtheirus simplex Ho, Gómez et Fajer-Avila, 2001 is a parasite of Sphoeroides annulatus (Jenyns), an economically important fish species, with potential for aquaculture, in northwestern Mexico. The goal of this study was to describe the developmental stages under experimental conditions and seasonal fecundity of this parasite on wild fish. There are two naupliar, one copepodid, two chalimus and two pre-adult stages preceding the adult of L. simplex. The results support previous findings, which point out that the life cycle of the caligid copepods includes only six post-naupliar stages. The generation time from egg extrusion to adult for L. simplex was approximately 10 days at 22 °C. The body length of the ovigerous females ranged between 2.2 and 4.1 mm, and its fecundity between 12 and 36 eggs per string. Fecundity was negatively correlated with the egg size and positively correlated with the egg string length. Our data did not reveal significant differences in fecundity among sampling months, but ovigerous females were significantly larger in March (when water temperature was 22 °C) than in June and July (when water temperature was 30 °C). To some extent, our fecundity results contrast with those found in species of sea lice from higher latitudes. Undoubtedly, biological information on different species of sea lice from different environmental conditions will enhance our understanding of their infection strategies and will be valuable, given the increasing interest in marine fish farming in Mexico.

Outline of a String Cosmology

Recent discussions attributed fermion mass to an analogue of Weyl curvature which occurred by hypothesis when closed, spin strings swept out closed world tubes. A new degree of freedom and corresponding curvature class were attributed to “second order tubes” that were swept out by initially introduced closed tubes, etc. Curvature classes were associated by hypothesis with composite masses where d enoted a mass-less spin field and where a and respectively denoted an LH quark and an RH anti-lepton that were characterized by opposite I3 values and shared a common generation. The resulting model accounted for known quark masses and predicted a new quark of mass 30 GeV/c2. The composite masses form a symmetry, the preservation of which is equivalent to the conservation of electrical charge and string scale. SUGRA interactions that preserve the proposed symmetry can therefore be precisely defined. In this context, gauge transformations that establish the proposed curvature classes also associate with a second realization of the originally generated symmetry, the preservation of which is equivalent to the conservation of string length and of the curvature from which the postulated model generates admissible increments of large scale expansion. The latter symmetry is associated by hypothesis with the large scale structure of the observable universe, thereby motivating a theoretical approximation of the total number of galaxies. This result parallels the approximation that is indicated by observation.

Word Similarity Calculation by Using the Edit Distance Metrics with Consonant Normalization

Edit distance metrics are widely used for many applications such as string comparison and spelling error corrections. Hamming distance is a metric for two equal length strings and Damerau-Levenshtein distance is a well-known metrics for making spelling corrections through string-to-string comparison. Previous distance metrics seems to be appropriate for alphabetic languages like English and European languages. However, the conventional edit distance criterion is not the best method for agglutinative languages like Korean. The reason is that two or more letter units make a Korean character, which is called as a syllable. This mechanism of syllable-based word construction in the Korean language causes an edit distance calculation to be inefficient. As such, we have explored a new edit distance method by using consonant normalization and the normalization factor.

IJARCCE - Computer and Communication Engineering

Multimedia data security is very important for multimedia commerce on the internet and real time data multicast. An attractive solution for encrypting data with adequate message security at low cost is the use of Scrambler/Descrambler. Scramblers are essential components of physical layer system standards besides interleaved coding and modulation. Scramblers are successfully used in modern VLSI design especially those are used in data communication system either to secure data or re-code periodic sequence of binary bits stream. However, it is necessary to have a descrambler block on the receiving side while using scrambling data in the transmitting end to have the actual input sequence on the receiving end. Scrambling/ De-scrambling are an algorithm that converts an input string into a seemingly random string of the same length to avoid simultaneous bits in the long format of data. Scramblers have many uses in today's data communication protocols. However, those methods that are theoretical proposed are not feasible in the modern digital design due to many reasons such as slower data rate, dropping information, circuit hazards, uncountable delays etc. Therefore it is required for the modern digital design to have modified architecture to meet the required goal. We will propose here modified scrambler design which is perfectly suitable for any industrial design. Besides, we showed simulation result, detailed analysis and usage in digital design.

Interpretation of an “edge” in proton-proton scattering

A study of proton-proton collisions at very high energy has revealed a "black disk," whose radius grows with the logarithm of the center-of-mass energy, surrounded by an edge of approximately constant width 1 fm. We interpret this behavior as the maximum length of a QCD string connecting the color triplet and antitriplet components of the proton, and propose further tests of this explanation.