Search results for "FIX"
showing 10 items of 1335 documents
O(n 2 log n) Time On-Line Construction of Two-Dimensional Suffix Trees
2005
The two-dimensional suffix tree of an n × n square matrix A is a compacted trie that represents all square submatrices of Ai¾?[9]. For the off-line case, i.e., A is given in advance to the algorithm, it is known how to build it in optimal time, for any type of alphabet sizei¾?[9,15]. Motivated by applications in Image Compressioni¾?[18], Giancarlo and Guaianai¾?[12] considered the on-line version of the two-dimensional suffix tree and presented an On2log2n-time algorithm, which we refer to as GG. That algorithm is a non-trivial generalization of Ukkonen's on-line algorithm for standard suffix trees [19]. The main contribution in this paper is an Olog n factor improvement in the time complex…
On-line construction of two-dimensional suffix trees
1997
We present a new technique, which we refer to as implicit updates, based on which we obtain: (a) an algorithm for the on-line construction of the Lsuffix tree of an n x n matrix A — this data structure, described in [13], is the two-dimensional analog of the suffix tree of a string; (b) simple algorithms implementing primitive operations for LZ1-type on-dine lossless image compression methods. Those methods, recently introduced by Storer [35], are generalizations of LZl-type compression methods for strings (see also [24, 31]). For the problem in (a), we get nearly an order of magnitude improvement over algorithms that can be derived from known techniques [13]. For the problem in (b), we do …
Fixed points in weak non-Archimedean fuzzy metric spaces
2011
Mihet [Fuzzy $\psi$-contractive mappings in non-Archimedean fuzzy metric spaces, Fuzzy Sets and Systems, 159 (2008) 739-744] proved a theorem which assures the existence of a fixed point for fuzzy $\psi$-contractive mappings in the framework of complete non-Archimedean fuzzy metric spaces. Motivated by this, we introduce a notion of weak non-Archimedean fuzzy metric space and prove that the weak non-Archimedean fuzzy metric induces a Hausdorff topology. We utilize this new notion to obtain some common fixed point results for a pair of generalized contractive type mappings.
Common fixed point theorems of integral type for OWC mappings under relaxed condition
2017
In this paper, we prove a common fixed point theorem for a pair of occasionally weakly compatible (owc) self mappings satisfying a mixed contractive condition of integral type without using the triangle inequality. We prove also analogous results for two pairs of owc self mappings by assuming symmetry only on the set of points of coincidence. These results unify, extend and complement many results existing in the recent literature. Finally, we give an application of our results in dynamic programming.
Some common fixed point theorems for owc mappings with applications
2013
Starting from the setting of fuzzy metric spaces, we give some new common fixed point theorems for a pair of occasionally weakly compatible (owc) self-mappings satisfying a mixed contractive condition. In proving our results, we do not need to use the triangular inequality. Also we obtain analogous results for two pairs of owc self-mappings by assuming symmetry only on the set of points of coincidence. These results unify, extend and complement some results existing in the literature. Finally, we give some applications of our results.
Nonlinear quasi-contractions of Ciric type
2012
In this paper we obtain points of coincidence and common fixed points for two self mappings satisfying a nonlinear contractive condition of Ciric type. As application, using the scalarization method of Du, we deduce a result of common fixed point in cone metric spaces.
Linear-size suffix tries
2016
Suffix trees are highly regarded data structures for text indexing and string algorithms [MCreight 76, Weiner 73]. For any given string w of length n = | w | , a suffix tree for w takes O ( n ) nodes and links. It is often presented as a compacted version of a suffix trie for w, where the latter is the trie (or digital search tree) built on the suffixes of w. Here the compaction process replaces each maximal chain of unary nodes with a single arc. For this, the suffix tree requires that the labels of its arcs are substrings encoded as pointers to w (or equivalent information). On the contrary, the arcs of the suffix trie are labeled by single symbols but there can be Θ ( n 2 ) nodes and lin…
Are there any differences in various polyaxial locking systems? A mechanical study of different locking screws in multidirectional angular stable dis…
2012
Numerous angular stable plates for the distal radius exist, and technically based comparisons of the polyaxial locking interfaces are lacking. The aim of this mechanical study was to investigate three different locking interfaces of angular stable volar plates by cantilever bending: VA-LCP Two-Column Distal Radius Plates 2.4 mm (Synthes® GmbH, Oberdorf, Switzerland), IXOS® P4 (Martin, Tuttlingen, Germany) and VariAX™ (Stryker®, Duisburg, Germany). We assessed the strength of 0°, 5°, 10° and 15° screw locking angles and tested the bending strength from 10° to 5° angles by cyclic loading until breakage. The final setup repeated the above assessments by inclusion of four locking screws. The si…
Spectral approach to the scattering map for the semi-classical defocusing Davey–Stewartson II equation
2019
International audience; The inverse scattering approach for the defocusing Davey–Stewartson II equation is given by a system of D-bar equations. We present a numerical approach to semi-classical D-bar problems for real analytic rapidly decreasing potentials. We treat the D-bar problem as a complex linear second order integral equation which is solved with discrete Fourier transforms complemented by a regularization of the singular parts by explicit analytic computation. The resulting algebraic equation is solved either by fixed point iterations or GMRES. Several examples for small values of the semi-classical parameter in the system are discussed.
An Improved Detection Technique for Cyclic-Prefixed OFDM
2010
A novel Orthogonal Frequency Division Multiplexing detection technique compatible to standard (e.g. Wireless LAN) transmitters is proposed. It features enhanced error-rate performance with flexible computational complexity and robustness to imperfect channel estimation. It is based on exploitation of the redundancy available in the cyclic prefix after cancellation of interference from the preceding block. In order to show the effectiveness of our proposal, an analysis of computational complexity and a number of comparisons to the standard per-subcarrier receiver and a previously existing method in terms of error rates are reported.