In this paper we introduce and study the concepts of intuitionistic fuzzy g*continuous mappings and intuitionistic fuzzy g*-irresolute mappings and some of their basic properties are discussed.

A frame $L$ is called {it coz-dense} if $Sigma_{coz(alpha)}=emptyset$ implies $alpha=mathbf 0$. Let $mathcal RL$ be the ring of real-valued continuous functions on a coz-dense and completely regular frame $L$. We present a description of the socle of the ring $mathcal RL$ based on minimal ideals of $mathcal RL$ and zero sets in pointfree topology. We show that socle of $mathcal RL$ is an essent...

This paper presents a useful variation on the moving frame construction, which allows us to use a moving frame for a subgroup A of a Lie group G to produce a moving frame for the entire group G. This algorithm is applicable when G factors as a product of two subgroups G = A · B and automatically produces functional relations among invariants of G and its factors.

let be a locally compact non?abelian group and be a compact subgroup of also let be a ?invariant measure on the homogeneous space . in this article, we extend the linear operator as a bounded surjective linear operator for all ?spaces with . as an application of this extension, we show that each frame for determines a frame for and each frame for arises from a frame in via the linear operator .

A cubic graph H is called a Kotzig graph if H has a circuit double cover consisting of three Hamilton circuits. It was first proved by Goddyn that if a cubic graph G contains a spanning subgraph H which is a subdivision of a Kotzig graph then G has a circuit double cover. A spanning subgraph H of a cubic graph G is called a Kotzig frame if the contracted graph G/H is even and every non-circuit ...

ABSTRACT: The paper presents the discrete dimension optimization of unbraced rigid steel plane frames. The optimization of steel frames was carried out by the Mixed-Integer Non-linear Programming (MINLP) approach. The MINLP is a combined discrete-continuous optimization technique. It performs the discrete optimization of discrete decisions simultaneously with the continuous optimization of cont...

Recall that a continuous function $fcolon Xto Y$ between Tychonoff spaces is proper if and only if the Stone extension $f^{beta}colon beta Xtobeta Y$ takes remainder to remainder, in the sense that $f^{beta}[beta X-X]subseteq beta Y-Y$. We introduce the notion of ``taking remainder to remainder" to frames, and, using it, we define a frame homomorphism $hcolon Lto M$ to be $beta$-proper, $lambd...

It is well-known that the Independent Component Analysis (ICA) model is not identifiable when more than one source is Gaussian (Comon 1993). In this note, we show that the number of continuous degrees of freedom in the " identifiable quotient space " of ICA is max(0, G − 1), where G is the number of Gaussians in the sources. However, since the source distributions are unknown, G is unknown and ...