The polytope of pointed pseudo triangulations was described in [RSS01]. This polytope is a combinatorial tool to observe all possible pseudo triangulations of a certain point set. Each point of the polytope refers to one possible pseudo triangulation of the point set. To polytope vertices are connected by an edge if their pseudo triangulations just differ in one edge-flip. Once we have a PPT-po...

A pseudo-Boolean function is a function from a 0/1-vector to the reals. Minimizing pseudo-Boolean functions is a very general problem with many applications. In image analysis, the problem arises in segmentation or as a subroutine in task like stero estimation and image denoising. Recent years have seen an increased interest in higher-degree problems, as opposed to quadratic pseudo-Boolean func...

Let (M, θ) be a strictly pseudoconvex pseudo-Hermitian compact hypersurface in C in the sense of Webster [34] with a pseudo-Hermitian real oneform θ on M . Let Rθ be the Webster pseudo scalar curvature for M with respect to θ. By the solution of the CR Yamabe problem given by Jerison and Lee [18], Gamara and Yacoub [10] and Gamara [9] (for n = 1), there is a pseudo-Hermitian real one-form θ so ...

in this study, the potential of biosorbent obtained from silk maze, was investigated for the batch biosorption of direct red 81 (dr 81) in aqueous solution. the effects of temperature, biosorbent amount, contact time, initial dye concentration and ultrasonic irradiation were also evaluated. furthermore, experimental equilibrium and kinetics data were fitted by langmuir and freundlich isotherms ...

graphene, a new member of the carbon family, was used as an adsorbent due to its exceptional capability to remove rhodamine b (rb) and malachite green (mg), two organic dyes, from aqueous solutions. adsorption kinetics of rb and mg onto graphene and adsorption capacity of the adsorbent were studied. also the effects of parameters, including ph, contact time, temperature, and adsorbent dosage we...

Time series occur throughout nature and within almost every discipline of science. Producing accurate alignments of time series data was made feasible with the Dynamic Time Warping algorithm. Through stretching and compressing of individual points in time series data, this algorithm produces accurate and intuitive global time series alignments. In this paper, we extend the DTW algorithm to perf...

In this paper we present a model exhibiting a new type of continuous-time quantum walk (as a quantum mechanical transport process) on networks, which is described by a non-Hermitian Hamiltonian possessing a real spectrum. We call it pseudo-Hermitian continuous-time quantum walk. We introduce a method to obtain the probability distribution of walk on any vertex and then study a specific system. ...

It has recently been shown how to construct online, non-amortised approximate pattern matching algorithms for a class of problems whose distance functions can be classified as being local. Informally, a distance function is said to be local if for a pattern P of lengthm and any substring T [i, i+m−1] of a text T , the distance between P and T [i, i+m− 1] can be expressed as Σj∆(P [j], T [i+ j])...

We introduce a novel concept of the pseudo-parity-time (pseudo-PT) symmetry in periodically modulated optical systems with balanced gain and loss. We demonstrate that whether or not the original system is PT symmetric, we can manipulate the property of the PT symmetry by applying a periodic modulation in such a way that the effective system derived by the high-frequency Floquet method is PT sym...