Sharif Digital Repository

We propose an observer for attitude and position estimation of a rigid body using translational and angular velocity measurements together with a single landmark. Under an observability condition depending on landmark position, global and asymptotic convergence of attitude and position estimation errors to zero is achieved. We extend the observer for the case of nonideal velocity measurements. Simulation examples demonstrate convergence properties of the observer in the face of noise and bias in velocity measurements  

Pore network modeling of porous media has this advantage that can consider the pore structure incorporating any desired details, but it has not been studied sufficiently. In addition, most studies are limited to mathematical modeling only which need validation. In the present study, this approach was applied to hydrogen separation from syngas by nanoporous ceramic membrane to predict the membrane permeance theoretically based on its pore structure. Gas transport through nanoporous membrane was modeled with the aim of a 2D network model. A dusty gas model was used for gas transport in the individual pores. Model validation showed that the model predictions are in good agreement with the... 

Structural behavior of ring stiffened thick walled cylinders made of functionally graded materials (FGMs) is investigated in this paper. Functionally graded materials are inhomogeneous composites which are usually made from a mixture of metal and ceramic. The gradient compositional variation of the constituents from one surface to the other provides an elegant solution to the problem of high transverse shear stresses that are induced when two dissimilar materials with large differences in material properties are bonded. FGM formation of the cylinder is modeled by power-law exponent and the variation of characteristics is supposed to be in radial direction. A finite element formulation is... 

The neutron velocity selector is a device used to produce a monochromatic neutron beam with continuous flux. The purpose of the present study is to investigate the sensitivity of the transmission factor and resolution of a multiblade neutron velocity selector to the various parameters using the McStas software. To this end, two instruments were created using the Arm, Progress_bar, Source_simple, DivMonitor, L_monitor, Guide_channeled and V_selector components of the McStas software. The used V_selector component to simulate the multiblade neutron velocity selector was created by considering three assumptions: 1. The absorption of colliding neutrons to selector blades, 2. No interaction of... 

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  

Motivated by numerous applications in Monte Carlo techniques and as of late, in deriving non dominated solutions in multi-objective optimization problems, this article addresses generating uniform random variables (λi, λi ≥ 0, i = 1,..., n) over a simplex in ℝ2 (n ≥ 2), i.e., Σi=1 n λi = 1. In this article, first, conditional distribution of λi where Σi=1 n λi = 1 is derived and then inverse method is applied to generate random variables