There is given a construction of the entropy of a dynamical system on arbitrary MV-algebra M. If M is the MV-algebra of characteristic functions of a σ-algebra (isomorphic to the σ-algebra), then the construction leads to the Kolmogorov Sinaj entropy. If M is the MV-algebra (tribe) of fuzzy sets, then the construction coincides with the Maličký modification of the Kolmogorov Sinaj entropy for f...

The relative pair dispersion of galaxies has for the past decade been the standard measure of the thermal energy of fluctuations in the observed galaxy distribution. This statistic is known to be unstable, since it is a pair-weighted measure that is very sensitive to rare, rich clusters of galaxies. As a more stable alternative, we here present a single-particle-weighted statistic σ 1 , which c...

In this paper, we propose three algorithms for the problem of string edit distance with duplication and contraction operations, which improve the time complexity of previous algorithms for this problem. These include a faster algorithm for the general case of the problem, and two improvements which apply under certain assumptions on the cost function. The general algorithm is based on fast min-...

Modern flight control systems are expected to perform beyond their conventional flight envelopes and exhibit robustness and adaptability to uncertain environments and failures. Adaptive control has been shown to improve the performance of a flight control system in the presence of uncertainties and failures. It is well known that modification to standard laws such as e-modification, σ-modificat...

A method called σ-consensus is proposed to eliminate the need for a user-defined inlier-outlier threshold in RANSAC. Instead of estimating σ, it is marginalized over a range of noise scales using a Bayesian estimator, i.e. the optimized model is obtained as the weighted average using the posterior probabilities as weights. Applying σ-consensus, two methods are proposed: (i) a postprocessing ste...

(1) sup λ>λ0, ε>0 ∥(−△+ V − (λ + iε) )−1∥∥ L2,σ(Rd)→L2,−σ(Rd) < ∞ provided that λ0 > 0, (1 + |x|)1+|V (x)| ∈ L∞ and σ > 12 . Here L(R) = {(1 + |x|)−σ f : f ∈ L(R)} is the usual weighted L2. The bound (1) is obtained from the same estimate for V = 0 by means of the resolvent identity. This bound for the free resolvent is related to the so called trace lemma, which refers to the statement that fo...

mangrove sediments were collected during wet and dry seasons from nine stations in khamir,laft and natural reservoir mangrove-dense areas of hormozgan province in the south of iran. σ pcbs ranged from 5.33 to 15.5 ng/g dry weight and the dominant congener was no.153. average σ ddts for khamir and laft mangroves were 16.58 ± 1.51 and 18.8 ± 9.98 ng/g dry weight. ddt was more abundant than dde an...

The Shortest Path Problem with Resource Constraints is a common subproblem in many Branch-Cut-and-Price algorithms (BCP), e.g., routing and scheduling problems. This paper presents a general label-setting algorithm for solving various shortest path problems. An integration of the ‘Shortest Path Problem with Resource Constraints and k-cycle elimination’ with the ‘Partial Elementarity’ is introdu...

(1) sup λ>λ0, ε>0 ∥−4 + V − (λ + iε) )−1∥∥ L2,σ(Rd)→L2,−σ(Rd) <∞ provided that λ0 > 0, (1 + |x|)1+|V (x)| ∈ L∞ and σ > 12 . Here L(R) = {(1 + |x|)−σ f : f ∈ L(R)} is the usual weighted L2. The bound (1) is obtained from the same estimate for V = 0 by means of the resolvent identity. This bound for the free resolvent is related to the so called trace lemma, which refers to the statement that for...