In this paper, the adsorption of Basic Blue159 (BB159) onto banana peel as a low-cost material was studied. At first, the banana peel was sieved. Later, banana peel particles were characterized by field emission scanning electron microscopy (FESEM), energy dispersive x-ray spectroscopy (EDXS) and Fourier Transform Infrared (FTIR) techniques. Batch adsorption experiments were carried out as a fu...

Distributions that are highly concentrated in the time-frequency plane are presented. Since the idea for these distributions originated from the Wigner representation in the quantum mechanics, a review of this representation is done in the first part of the paper. Abstracting the physical sense of the quantum mechanics representation, we defined the “pseudo quantum” signal representation. On th...

The Grøstl hash function is one of the five finalists in the third round of SHA-3 competition hosted by NIST. In this paper, we propose some improved (pseudo) preimage attacks on the Grøstl hash function by using some techniques, such as subspace preimage attack and the guess-and-determine technique. We present the improved pseudo preimage attacks on 5-round Grøstl-256 hash function and 8-round...

Let (L;⊓,⊔) be a finite lattice and let n be a positive integer. A function f : L → R is said to be submodular if f(a ⊓ b) + f(a ⊔ b) ≤ f(a)+f(b) for all a, b ∈ L. In this paper we study submodular functions when L is a diamond. Given oracle access to f we are interested in finding x ∈ L such that f(x) = miny∈Ln f(y) as efficiently as possible. We establish • a min–max theorem, which states tha...

For a graph G and a non-negative integral weight function w on the vertex set of G, a set S of vertices of G is w-safe if w(C) ≥ w(D) for every component C of the subgraph of G induced by S and every component D of the subgraph of G induced by the complement of S such that some vertex in C is adjacent to some vertex of D. The minimum weight w(S) of a w-safe set S is the safe number s(G,w) of th...

Owing to several applications in large scale learning and vision problems, fast submodular function minimization (SFM) has become a critical problem. Theoretically, unconstrained SFM can be performed in polynomial time [10, 11]. However, these algorithms are typically not practical. In 1976, Wolfe [21] proposed an algorithm to find the minimum Euclidean norm point in a polytope, and in 1980, Fu...

Consider selling bundles of indivisible goods to buyers with concave utilities that are additively separable in money and goods. We propose an ascending auction for the case when the seller is constrained to sell bundles whose elements form a basis of a matroid. It extends easily to polymatroids. Applications include scheduling, allocation of homogeneous goods, and spatially distributed markets...

in this paper, we characterize multiresolution analysis(mra) parseval frame multiwavelets in l^2(r^d) with matrix dilations of the form (d f )(x) = sqrt{2}f (ax), where a is an arbitrary expanding dtimes d matrix with integer coefficients, such that |deta| =2. we study a class of generalized low pass matrix filters that allow us to define (and construct) the subclass of mra tight frame multiwav...

The Pseudo-Smarandache Function is part of number theory. The function comes from the Smarandache Function. The Pseudo-Smarandache Function is represented by Z(n) where n represents any natural number. The value for a given Z(n) is the smallest integer such that 1+2+3+ . . . + Z(n) is divisible by n. Within the Pseudo-Smarandache Function, there are several formulas which make it easier to find...