Sharif Digital Repository

A novel method for computation of guided mode reflectivity from optical waveguide end-facet is presented. The method is based on the characteristic Green's function (CGF) technique formulation combined with the complex images (CIs) method for dielectric planar waveguides. By separability assumption of the structure, a uniform and closed-form expression of spatial Green's function is obtained. Derived expression consists of discrete and continuous spectrum contributions which denote guided and radiation modes effects, respectively. Having a full-wave solution, efficient optimization procedure is then used to calculate the exact reflection coefficients of guided modes at the end-facets. To... 

A uniform and closed-form spatial Green's function for finite dielectric structures is derived by using a combination of the characteristic Green's function (CGF) and rational function fitting method (RFFM). Employing the concept of quasi leaky waves, CGF-RFFM represents both of the discrete and continuous spectrum contributions efficiently by using the modified VECTFIT algorithm. The method is examined for 2-D truncated dielectric slab while it can be implemented for 3-D structure straightforwardly. An error of less than 0.2% is achieved compared with the direct numerical integration of the spectral integral. The derived Green's function is exact for separable structures while it is... 

A closed-form spatial Green's function for finite dielectric structures is derived by using a combination of the characteristic Green's function (CGF) and rational function fitting method (RFFM). CGF-RFFM represents both of the discrete and continuous spectrum contributions efficiently by using the modified VECTFIT algorithm. To obtain more accurate results, reflection coefficient correction due to the surface waves (SWs) incident on the the end-facet is considered. The main advantage of this method lies in its speed as well as accuracy. Excellent agreements with the rigorous method of moments (MoM) are shown in several examples  

Novel hydrogels based on zwitterionic monomer [3-(methacrylamido)propyl] dimethyl (3-sulfopropyl) ammonium hydroxide (MPDSAH) and a strong acid monomer (2-acrylamido-2-methylpropane sulfonic acid, AMPS) were synthesized through solution polymerization under normal conditions to achieve nearly quantitative gel yield. The structure of the gels was confirmed using infrared spectroscopy. Thermal properties were simultaneously studied by differential scanning calorimetry and thermogravimetric analysis (DSC/TGA). The effects of the polymerization variables on the swelling capacity of the products were investigated. It was found that, in a certain range of the monomers mol ratio, increase of AMPS... 

This study aims at identifying the parameters that govern the environmental costs in oil and gas projects. An initial conceptual model was proposed. Next, the costs of environmental management work packages were estimated, separately and were applied in project control tools (WBS/CBS). Then, an environmental parametric cost model was designed to determine the environmental costs and relevant weighting factors. The suggested model can be considered as an innovative approach to designate the environmental indicators in oil and gas projects. The validity of variables was investigated based on Delphi method. The results indicated that the project environmental management's weighting factor is... 

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