We say that a binary operation $*$ is associated with a (finite undirected) graph $G$ (without loops and multiple edges) if $*$ is defined on $V(G)$ and $uv\in E(G)$ if and only if $u\ne v$, $u * v=v$ and $v*u=u$ for any $u$, $v\in V(G)$. In the paper it is proved that a connected graph $G$ is geodetic if and only if there exists a binary operation associated with $G$ which fulfils a certain set of four axioms. (This characterization is obtained as an immediate consequence of a stronger result proved in the paper).
The Cantor-Bernstein-Schröder theorem of the set theory was generalized by Sikorski and Tarski to $\sigma $-complete boolean algebras, and recently by several authors to other algebraic structures. In this paper we expose an abstract version which is applicable to algebras with an underlying lattice structure and such that the central elements of this lattice determine a direct decomposition of the algebra. Necessary and sufficient conditions for the validity of the Cantor-Bernstein-Schröder theorem for these algebras are given. These results are applied to obtain versions of the Cantor-Bernstein-Schröder theorem for $\sigma $-complete orthomodular lattices, Stone algebras, $BL$-algebras, $MV$-algebras, pseudo $MV$-algebras, Łukasiewicz and Post algebras of order $n$.
We present an algorithm to generate a smooth curve interpolating a set of data on an n-dimensional ellipsoid, which is given in closed form. This is inspired by an algorithm based on a rolling and wrapping technique, described in \cite{fatima-knut-rolling} for data on a general manifold embedded in Euclidean space. Since the ellipsoid can be embedded in an Euclidean space, this algorithm can be implemented, at least theoretically. However, one of the basic steps of that algorithm consists in rolling the ellipsoid, over its affine tangent space at a point, along a curve. This would allow to project data from the ellipsoid to a space where interpolation problems can be easily solved. However, even if one chooses to roll along a geodesic, the fact that explicit forms for Euclidean geodesics on the ellipsoid are not known, would be a major obstacle to implement the rolling part of the algorithm. To overcome this problem and achieve our goal, we embed the ellipsoid and its affine tangent space in \Rn+1 equipped with an appropriate Riemannian metric, so that geodesics are given in explicit form and, consequently, the kinematics of the rolling motion are easy to solve. By doing so, we can rewrite the algorithm to generate a smooth interpolating curve on the ellipsoid which is given in closed form.
Standard Bidirectional Associative Memory (BAM) Stores sum-of-thecorrelation-matrices of the pairs of patterns. When a pattern of an encoded pair is presented, the other is expected to be recalled. It has been shown that standard BAM cannot correctly recall a pattern pair if it is not at local minima of the energy function. To overcome this problem, novel niethods for encoding have been proposed. The efficient novel-encoding methods require knowledge of the interference noise in the standard BAM. In this paper, we propose an algorithm for computing the exact amount of interference noise in standard encoding of BAM. The computational cornplexity of the algorithm is the same as that of computing the correlation matrix for the standard BAM.
In this paper, a hybrid regularizers model for Poissonian image restoration is introduced. We study existence and uniqueness of minimizer for this model. To solve the resulting minimization problem, we employ the alternating minimization method with rigorous convergence guarantee. Numerical results demonstrate the efficiency and stability of the proposed method for suppressing Poisson noise.
Web Applications have become a critical component of the global information infrastructure, and it is important that they be validated to ensure their reliability. Exploiting user session data is a promising approach to testing Web applications. However, the effectiveness of user session testing technique depends on the set of collected user session data: The wider this set, the greater the capability of the approach to detect failures, but the wider the user session data set, the greater the cost of collecting, analyzing and storing data. In this paper, a technique for reducing a set of user sessions to an equivalent smaller one is implemented. This technique allows reducing of a wider set of user sessions to an equivalent reduced user session and pages, sufficient to test a Web application effectively. Reduction of a user session for several web applications like TCENet Web application, Portal application, Social Networking, Online shopping, Online Library is carried out in order to validate the proposed technique; and our technique is compared with HGS, Random Reduction technique and the Concept Lattice technique to evaluate its efficiency.
The problem of decomposing a given covariance matrix as the sum of a positive semi-definite matrix of given rank and a positive semi-definite diagonal matrix, is considered. We present a projection-type algorithm to address this problem. This algorithm appears to perform extremely well and is extremely fast even when the given covariance matrix has a very large dimension. The effectiveness of the algorithm is assessed through simulation studies and by applications to three real benchmark datasets that are considered. A local convergence analysis of the algorithm is also presented.
The ŁII and ŁII1/2 logics were introduced by Godo, Esteva and Montagna in [4] and further developed in my work [2]. These types of logic unite many other known propositional and predicate logics, including the three mainly investigated ones (Godel, Product and Łukasiewicz logic).
The aim of this paper is to show a tight connection between the ŁII logic and the product involutive logic. This logic was introduced by Esteva, Godo, Hájek and Navara in their paper [3].
We will see that all the connectives of the ŁII logic are definable from the connectives of this logic. In addition we show that the ŁII logic is an schernatic extension of this logic by a single axiom. We also make some simplification of the axiomatic system of this logic.
CD163 is a marker of macrophages with anti-inflammatory properties and its soluble form (sCD163) is considered a prognostic predictor of several diseases including type 2 diabetes mellitus (T2DM). We explored sCD163 levels at baseline and after very low-calorie diet (VLCD) or bariatric surgery in 32 patients with obesity (20 undergoing VLCD and 12 bariatric surgery), 32 obese patients with T2DM (22 undergoing VLCD and 10 bariatric surgery), and 19 control subjects. We also assessed the changes of CD163 positive cells of monocyte-macrophage lineage in peripheral blood and subcutaneous adipose tissue (SAT) in subset of patients. Plasma sCD163 levels were increased in obese and T2DM subjects relative to control subjects (467.2±40.2 and 513.8±37.0 vs. 334.4±24.8 ng/ml, p=0.001) and decreased after both interventions. Obesity decreased percentage of CD163+CD14+ monocytes in peripheral blood compared to controls (78.9±1.48 vs. 86.2±1.31 %, p=0.003) and bariatric surgery decreased CD163+CD14+HLA-DR+ macrophages in SAT (19.4±2.32 vs. 11.3±0.90 %, p=0.004). Our data suggest that increased basal sCD163 levels are related to obesity and its metabolic complications. On the contrary, sCD163 or CD163 positive cell changes do not precisely reflect metabolic improvements after weight loss., A. Cinkajzlová, Z. Lacinová, J. Kloučková, P. Kaválková, P. Trachta, M. Kosák, J. Krátký, M. Kasalický, K. Doležalová, M. Mráz, M. Haluzík., and Obsahuje bibliografii