We present global and local algorithms for evaluating minimal xed points of dependency graphs, a general problem in xed-point computation and model checking. Our algorithms run in linear-time, matching the complexity of the best existing algorithms for similar problems, and are simple to understand. The main novelty of our global algorithm is that it does not use the counter and \reverse list" ...

We introduce a novel de nition of approximate palindromes in strings, and provide an algorithm to nd all maximal approximate palindromes in a string with up to k errors. Our de nition is based on the usual edit operations of approximate pattern matching, and the algorithm we give, for a string of size n on a xed alphabet, runs in O(kn) time. We also discuss two implementationrelated improvement...

The article presents the results of study materials obtained during excavations early Turkic enclosure at Chichke-I site. Th is multi-temporal archaeological complex, located 13 km southwest Kurai village Kosh-Agach district Altai Republic, studied in 1982–1983 by Ongudai detachment expedition State University. Enclosure 159, northeastern part site, was one objects. During it found out that bas...

Say we are given a stream of elements X = [x1, . . . , xN ] where xi ∈ {a1, . . . , an}. Let ni denote the number of times element ai appeared in the stream, i.e., fi = |{j|xj = ai}|. Our goal is to estimate fi for all frequent elements. This can be solved exactly by keeping a counter for each element {a1, . . . , an}. Alas, this might require, Θ(n) memory. Here we look for methods to approxima...

In this paper, we prove some approximate fixed point results for proximinal valued $beta$-contractive multifunctions on metric spaces. We show that our results generalize some old fixed point results in the literature.

The breakdown point behavior of M-estimators in linear models with xed designs, arising from planned experiments or qualitative factors, is characterized. Particularly, this behavior at xed designs is quite diierent from that at designs which can be corrupted by outliers|the situation prevailing in the literature. For xed designs, the breakdown points of robust M-estimators (those with bounded ...

background: the fi nal position of the abutment changes with the amount of tightening torque. this could eventually lead to loss of passivity and marginal misfi t of prostheses. the aim of this study was to evaluate the effect of three different tightening torques on the marginal adaptation of 3-unit cement-retained implant-supported fi xed dental prostheses (fdps). materials and methods: two i...

subject to q(f |u) = ∏ i q(fi|u) and ∫ dfiq(fi|u) = 1. It is noted that KL(a||b) is the measurement of information “lost” when using b to approximate a. It was argued in [1] that it is appropriate to use this KL divergence as an approximation measure since we are trying to find a sparse representation u and its relationship with f to approximate p by q. The KL divergence above can be expanded a...

Macbeath gave a formula for the number of xed points for each non-identity element of a cyclic group of automorphisms of a compact Riemann surface in terms of the universal covering transformation group of the cyclic group. We observe that this formula generalizes to determine the xed-point set of each non-identity element of a cyclic group of automorphisms acting on a closed non-orientable sur...

In this paper we formulate and prove some xed and common xed pointTheorems for self-mappings dened on complete lower Transversal functionalprobabilistic spaces.