نتایج جستجو برای: linear text

تعداد نتایج: 642048  

Journal: :پژوهشنامه نقد ادبی و بلاغت 0
افسانه حسن زاده دستجردی استادیار، زبان و ادبیات فارسی، دانشگاه حضرت نرجس (س) رفسنجان

some literary texts seem being created on the threshold of two different movements, since they reflect the features of them both. some literary features are also common in two different literary movements and they can even be seen in the works belong to two different eras. the novel “asfār-e-kātebān” (books of scribers) is among the works which have lots of techniques and measures which are the...

Steganography is the ability to hide secret information in a cover-media such as sound, pictures and text. A new approach is proposed to hide a secret into Arabic text cover media using "Kashida", an Arabic extension character. The proposed approach is an attempt to maximize the use of "Kashida" to hide more information in Arabic text cover-media. To approach this, some algorithms have been des...

2017
Lê Duy Huynh Yongchao Xu Thierry Géraud

A method of text detection in natural images, to be turned into an effective embedded software on a mobile device, shall be both efficient and lightweight. We observed that a simple method based on the morphological Laplace operator can do the trick: we can construct in quasi-linear time a hierarchical image decomposition / simplification based on its 0-crossings, and search for some text in th...

Journal: :Bulletin of mathematical biology 2014
Alan Veliz-Cuba Ajit Kumar Krešimir Josić

Models of biochemical networks are frequently complex and high-dimensional. Reduction methods that preserve important dynamical properties are therefore essential for their study. Interactions in biochemical networks are frequently modeled using Hill functions ([Formula: see text]). Reduced ODEs and Boolean approximations of such model networks have been studied extensively when the exponent [F...

2002
Torben Amtoft Charles Consel Olivier Danvy Karoline Malmkjær

We consider a naive, quadratic string matcher testing whether a pattern occurs in a text; we equip it with a cache mediating its access to the text; and we abstract the traversal policy of the pattern, the cache, and the text. We then specialize this abstracted program with respect to a pattern, using the off-the-shelf partial evaluator Similix. Instantiating the abstracted program with a left-...

2010
Matthias Priebe Clemens H. Cap

Monitoring news and blogs has become a promising application for global operating groups, who are interested in recognizing topic developments in a fragmented topic landscape. News articles especially long ones may consist of several topics or different aspects of the same topic. In terms of Topic Detection and Tracking (TDT) it is hard to figure out the topic development in a stream of news or...

2011
Shoshana Marcus Dina Sokol

The dictionary matching problem seeks all locations in a given text that match any of the patterns in a given dictionary. Efficient algorithms for dictionary matching scan the text once, searching for all patterns simultaneously. This paper presents the first 2-dimensional dictionary matching algorithm that operates in small space and linear time. Given d patterns, D = {P1, . . . , Pd}, each of...

Journal: :Evolutionary computation 2016
Tobias Kuhn Carlos M. Fonseca Luís Paquete Stefan Ruzika Miguel Duarte José Rui Figueira

The hypervolume subset selection problem consists of finding a subset, with a given cardinality k, of a set of nondominated points that maximizes the hypervolume indicator. This problem arises in selection procedures of evolutionary algorithms for multiobjective optimization, for which practically efficient algorithms are required. In this article, two new formulations are provided for the two-...

2002
Kunihiko Sadakane

We introduce two succinct data structures to solve various string problems. One is for storing the information of lcp, the longest common prefix, between suffixes in the suffix array, and the other is an improvement in the compressed suffix array which supports linear time counting queries for any pattern. The former occupies only 2n + o(n) bits for a text of length n for computing lcp between ...

1999
Ronald Morrison Richard C. H. Connor Quintin I. Cutts Alan Dearle Alex Farkas Graham N. C. Kirby Robert McGettrick Evangelos Zirintsis

The traditional representation of a program is as a linear sequence of text. At some stage in the execution sequence the source text is checked for type correctness and its translated form is linked to values in the environment. When this is performed early in the execution process, confidence in the correctness of the program is raised. During program execution, tools such as debuggers are use...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید