Sharif Digital Repository

This paper presents a novel heat based measurement model for attitude determination (AD) using temperature data via two filtering techniques. Within the space environment, the Sun and Earth are considered as the major sources of external radiation that affect satellite surface temperature. In order to perform the required AD task, the satellite surface temperatures are related to its attitude via a proposed heat model (HM), assuming that the satellite navigational data is available. The proposed HM relates the net heat flux of three satellite orthogonal surfaces to its attitude. Filtering implementation of the proposed HM using the Unscented Kalman Filter (UKF) for AD is the key contribution... 

This paper is focused on the development and verification of a heat attitude model (HAM) for satellite attitude determination. Within this context, the Sun and the Earth are considered as the main external sources of radiation that could effect the satellite surface temperature changes. Assuming that the satellite orbital position (navigational data) is known, the proposed HAM provides the satellite surface temperature with acceptable accuracy and also relates the net heat flux (NHF) of three orthogonal satellite surfaces to its attitude via the inertial to satellite transformation matrix. The proposed HAM simulation results are verified through comparison with commercial thermal analysis... 

Attitude Determination (AD) is one of the key requirements of many current and emerging remote sensing missions. As such AD has been traditionally accomplished through a variety of algorithms and measurement models pertinent to sensing mechanisms. The current paper addresses conceptual validation and utility of a novel radiation based heat (measurement) model for space application. The proposed new Heat Attitude (HA) model utilizes temperature data to relate the Satellite Surfaces’ (SS) Net Heat Flux (NHF) to attitude assuming that the satellite navigational data are available. As Sun and the Earth are considered the main external sources of radiation, their effects are modeled for the SS... 

The basic goal of this article is to present an abstract system-theoretic approach to morphological filtering and the theory of translation invariant systems which is mainly based on residuated semigroups. Some new results as well as a number of basic questions are also introduced  

In a previous paper we introduced a generalized model for translation invariant (TI) operators. In this model we considered the space, φ of all maps from an abelian group G to ω U {-∞}, called LG-fuzzy sets, where ω is a complete lattice-ordered group; and we defined TI operators on this space. Also, in that paper, we proved strong reconstruction theorem to show the consistency of this model. This theorem states that for an order-preserving TI operator Y one can explicitly compute Y(A), for any A, from a specific subset of φ called the base of Y. In this paper duality is considered in the same general framework, and in this regard, continuous TI operators are studied. This kind of operators... 

We consider translation invariant (TI) operators on Φ, the set of maps from an abelian group G to Ω ∪ {−∞} , called LG-fuzzy sets, where 0 is a complete lattice ordered group. By defining Minkowski and morphological operations on Φ and considering order preserving operators, we prove a reconstruction theorem. This theorem, which is called the Strong Reconstruction Theorem (SRT), is similar to the Convolution Theorem in the theory of linear and shift invariant systems and states that for an order preserving TI operator Y one can explicitly compute Y ( A ), for any A , from a specific subset of Φ called the base of Y . The introduced framework is a general model for the theory of translation... 

The main goal of this paper is to verify classical properties of morphological operators within the general model of translation invariant (TI) systems. In this model, TI operators are defined on the space of LG-fuzzy sets Φ i.e. Φ = {A: G → Ω ∪ {− ∞}} in which G is an abelian group and Ω is a complete lattice ordered group. A TI operator Y is an operator on Φ which is invariant under translation on G and Ω as groups. We consider the generalization of Minkowski addition (D on Φ and we emphasize that (Φ,⊛) is an involutive residuated topological monoid. We verify all properties of traditional (set-theoretic) morphological operators as well as classical representations (Matheron, 1967) for... 

Let G be a simple undirected uniquely vertex k-colorable graph, or a k-UCG for short. M. Truszczyński [Some results on uniquely colorable graphs, in Finite and Infinite Sets, North-Holland, Amsterdam, 1984, pp. 733--748] introduced $e^{^{*}}(G)=|V(G)|(k-1)-{k \choose 2}$ as the minimum number of edges for a k-UCG and S. J. Xu [J. Combin. Theory Ser. B, 50 (1990), pp. 319--320] conjectured that any minimal k-UCG contains a Kk as a subgraph. In this paper, first we introduce a technique called forcing. Then by applying this technique in conjunction with a feedback structure we construct a k-UCG with clique number k-t, for each $t \geq 1$ and each k, when k is large enough. This also... 

In this paper, we derive some necessary spectral conditions for the existence of graph homomorphisms in which we also consider some parameters related to the corresponding eigenspaces such as nodal domains. In this approach, we consider the combinatorial Laplacian and co-Laplacian as well as the adjacency matrix. Also, we present some applications in graph decompositions where we prove a general version of Fisher’s inequality for G-designs  

Let d(σ)d(σ) stand for the defining number of the colouring σσ. In this paper we consider View the MathML sourcedmin=minγd(γ) and View the MathML sourcedmax=maxγd(γ) for the onto χχ-colourings γγ of the circular complete graph Kn,dKn,d. In this regard we obtain a lower bound for dmin(Kn,d)dmin(Kn,d) and we also prove that this parameter is asymptotically equal to χ-1χ-1. Also, we show that when χ⩾4χ⩾4 and s≠0s≠0 then dmax(Kχd-s,d)=χ+2s-3dmax(Kχd-s,d)=χ+2s-3, and, moreover, we prove an inequality relating this parameter to the circular chromatic number for any graph G  

Consider the parameter Λ(G) = |E(G)| - |V(G)|(k - 1) + (k2) for a k-chromatic graph G, on the set of vertices V(G) and with the set of edges E(G). It is known that Λ(G)≥0 for any k-chromatic uniquely vertex-colourable graph G (k-UCG), and, S.J. Xu has conjectured that for any k-UCG, G, Λ(G) = 0 implies that cl(G) = k; in which cl(G) is the clique number of G. In this paper, first, we introduce the concept of the core of a k-UCG as an induced subgraph without any colour-class of size one, and without any vertex of degree k - 1. Considering (k, n)-cores as k-UCGs on n vertices, we show that edge-minimal (k, 2k)-cores do not exist when k ≥ 3, which shows that for any edge-minimal k-UCG on 2k... 

In this paper we introduce some general necessary conditions for the existence of graph homomorphisms, which hold in both directed and undirected cases. Our method is a combination of Diaconis and Saloff–Coste comparison technique for Markov chains and a generalization of Haemers interlacing theorem. As some applications, we obtain a necessary condition for the spanning subgraph problem, which also provides a generalization of a theorem of Mohar (1992) as a necessary condition for Hamiltonicity. In particular, in the case that the range is a Cayley graph or an edge-transitive graph, we obtain theorems with a corollary about the existence of homomorphisms to cycles. This, specially, provides... 

This paper is aimed at investigating some computational aspects of different isoperimetric problems on weighted trees. In this regard, we consider different connectivity parameters called minimum normalized cuts/isoperimetric numbers defined through taking the minimum of the maximum or the mean of the normalized outgoing flows from a set of subdomains of vertices, where these subdomains constitute a partition/subpartition. We show that the decision problem for the case of taking k-partitions and the maximum (called the max normalized cut problem NCP^M), and the other two decision problems for the mean version (referred to as IPP^m and NCP^m) are NP-complete problems for weighted trees. On...