@article{ author = {}, title = {A NEW APPROACH TO THE SOLUTION OF SENSITIVITY MINIMIZATION IN LINEAR STATE FEEDBACK CONTROL}, abstract ={In this paper, it is shown that by exploiting the explicit parametric state feedback solution, it is feasible to obtain the ultimate solution to minimum sensitivity problem. A numerical algorithm for construction of a robust state feedback in eigenvalue assignment problem for a controllable linear system is presented. By using a generalized parametric vector companion form, the problem of eigenvalue assignment with minimum sensitivity is re-formulated as an unconstrained minimization problem. The derived explicit expressions of the solutions allow minimization of the sensitivity problem by using a powerful search technique}, Keywords = {State Feedback, Control Theory, Matrix Algebra, Sensitivity Min‌imization, Robustness.}, volume = {2}, Number = {1}, pages = {1-13}, publisher = {ACECR at Tarbiat Modares University}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, doi = {10.7508/ijmsi.2007.01.001}, url = {http://ijmsi.ir/article-1-55-en.html}, eprint = {http://ijmsi.ir/article-1-55-en.pdf}, journal = {Iranian Journal of Mathematical Sciences and Informatics}, issn = {1735-4463}, eissn = {2008-9473}, year = {2007} } @article{ author = {A.R.Ashrafi, and S.Yousefi,}, title = {A NOTE ON THE EQUISEPARABLE TREES}, abstract ={Let T be a tree and n_{l}(eIT) and n_{2}(eIT) denote the number of vertices of T, lying on the two sides of the edge e. Suppose T_{l} and T_{2} are two trees with equal number of vertices, e in T_{1} and f in T_{2}. The edges e and f are said to be equiseparable if either n_{l}(eIT_{I}) = n_{l}(fIT_{2}) or n_{l}(eIT_{I}) = n_{2}(fIT_{2}). If there is an one-to-one correspondence between the vertices of T_{l} and T_{2} such that the corresponding edges are equisep arable, then T_{ }and T_{2} are called equiseparable trees. Recently, Gutman, Arsic and Furtula investigated some equiseparable alkanes and obtained some useful rules (see J. Serb. Chem. Soc. (68)7 (2003), 549-555). In this paper, we use a combinatorial argument to find an equivalent def inition for equiseparability and then prove some results about relation of equiseparability and isomorphism of trees. We also obtain an exact expression for the number of distinct alkanes on n vertices which three of them has degree one.}, Keywords = {Equiseparable trees, Alkanes, Partitions.}, volume = {2}, Number = {1}, pages = {15-20}, publisher = {ACECR at Tarbiat Modares University}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, doi = {10.7508/ijmsi.2007.01.002}, url = {http://ijmsi.ir/article-1-25-en.html}, eprint = {http://ijmsi.ir/article-1-25-en.pdf}, journal = {Iranian Journal of Mathematical Sciences and Informatics}, issn = {1735-4463}, eissn = {2008-9473}, year = {2007} } @article{ author = {F.Samavati, and H.R.Pakdel, and C.Smith,}, title = {REVERSE LOOP SUBDIVISION FOR GEOMETRY AND TEXTURES}, abstract ={Reverse subdivision aims at constructing a coarser representation of an object given by a fine polygon mesh. In this paper, we first derive a mask for reverse Loop subdivision that can be applied to both regular and extraordinary vertices. The mask is parameterized, and thus can also be used in reversing variants of Loop subdivision, such as those proposed by Warren and Litke. We apply this mask not only to mesh geometry, but also to texture coordinates. This reverses the texture-mapping process described by DeRose, Kass and Truong, in which a texture originally defined for a coarse mesh was carried to the finer meshes obtained by ubdivision. Combined with the forward subdivision, the proposed technique constitutes a multiresolution representation of textured subdivision surfaces. We illustrate its use with a set of examples.}, Keywords = {Subdivision, Texture mapping, Multiresolution, Meshes.}, volume = {2}, Number = {1}, pages = {21-37}, publisher = {ACECR at Tarbiat Modares University}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, doi = {10.7508/ijmsi.2007.01.003}, url = {http://ijmsi.ir/article-1-57-en.html}, eprint = {http://ijmsi.ir/article-1-57-en.pdf}, journal = {Iranian Journal of Mathematical Sciences and Informatics}, issn = {1735-4463}, eissn = {2008-9473}, year = {2007} } @article{ author = {R.M.S.Mahmood,}, title = {ON QUASI UNIVERSAL COVERS FOR GROUPS ACTING ON TREES WITH INVERSIONS}, abstract ={Abstract. In this paper we show that if G is a group acting on a tree X with inversions and if (T Y ) is a fundamental domain for the action of G on X, then there exist a group ;tildeG and a tree ;tildeX induced by (T Y ) such that ;tildeG acts on ;tildeX with inversions, G is isomorphic to ;tilde G, and X is isomorphic to ;tildeX. The pair (;tilde G ;tildeX) is called the quasi universal cover of (GX) induced by the (T Y ).}, Keywords = {Groups acting on trees with inversions, Fundamental domains,Quasi universal cover, Isomorphic trees.}, volume = {2}, Number = {1}, pages = {39-45}, publisher = {ACECR at Tarbiat Modares University}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, doi = {10.7508/ijmsi.2007.01.004}, url = {http://ijmsi.ir/article-1-56-en.html}, eprint = {http://ijmsi.ir/article-1-56-en.pdf}, journal = {Iranian Journal of Mathematical Sciences and Informatics}, issn = {1735-4463}, eissn = {2008-9473}, year = {2007} } @article{ author = {A.Gholami,}, title = {AUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS}, abstract ={An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexity indices of them (1973, 2001). In this paper, with a simple method, we calculate the automorphism group of some weighted graphs.}, Keywords = {Weighted graph, Euclidean graph, Automorphism group.}, volume = {2}, Number = {1}, pages = {47-54}, publisher = {ACECR at Tarbiat Modares University}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, doi = {10.7508/ijmsi.2007.01.005}, url = {http://ijmsi.ir/article-1-58-en.html}, eprint = {http://ijmsi.ir/article-1-58-en.pdf}, journal = {Iranian Journal of Mathematical Sciences and Informatics}, issn = {1735-4463}, eissn = {2008-9473}, year = {2007} } @article{ author = {G.White, and D.Sun, and M.Schootman,}, title = {AN ADDITIVE MODEL FOR SPATIO-TEMPORAL SMOOTHING OF CANCER MORTALITY RATES}, abstract ={In this paper, a Bayesian hierarchical model is used to anaylze the female breast cancer mortality rates for the State of Missouri from 1969 through 2001. The logit transformations of the mortality rates are assumed to be linear over the time with additive spatial and age effects as intercepts and slopes. Objective priors of the hierarchical model are explored. The Bayesian estimates are quite robustness in terms change of the hyperparamaters. The spatial correlations are appeared in both intercepts and slopes.}, Keywords = {Bayesian analysis, Spatial statistics, Cancer mortality, Poisson distri butions.}, volume = {2}, Number = {1}, pages = {55-70}, publisher = {ACECR at Tarbiat Modares University}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, doi = {10.7508/ijmsi.2007.01.006}, url = {http://ijmsi.ir/article-1-59-en.html}, eprint = {http://ijmsi.ir/article-1-59-en.pdf}, journal = {Iranian Journal of Mathematical Sciences and Informatics}, issn = {1735-4463}, eissn = {2008-9473}, year = {2007} } @article{ author = {W.HUSSAIN,}, title = {THE EFFECT OF PURE SHEAR ON THE REFLECTION OF PLANE WAVES AT THE BOUNDARY OF AN ELASTIC HALF-SPACE}, abstract ={This paper is concerned with the effect of pure shear on the reflection from a plane boundary of infinitesimal plane waves propagating in a half-space of incompressible isotropic elastic material. For a special class of constitutive laws it is shown that an incident plane harmonic wave propagating in the considered plane gives rise to a surface wave in addition to a reflected wave (with angle of reflection equal to the angle of incidence) although its amplitude may vanish at certain discrete angles but is independent of the state of deformation. Reflected wave amplitude is exactly equal to one in this case.For a second class of constitutive laws similar behavior is found for certain combinations of angle of incidence, material properties and deformations, but additional possibilities also arise. In particular, there may be two reflected waves instead of one reflected wave and a surface wave. Here surface wave amplitude depends upon the pure shear and the reflected wave amplitude is not equal to one in general.The dependence of the amplitudes of the reflected, and surface waves on the angle of incidence, the states of deformation is illustrated graphically.}, Keywords = {ELASTIC WAVES, PURE SHEAR, REFLECTION, NON,LINEAR ELASTICITY}, volume = {2}, Number = {2}, pages = {1-16}, publisher = {ACECR at Tarbiat Modares University}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, doi = {10.7508/ijmsi.2007.02.001}, url = {http://ijmsi.ir/article-1-19-en.html}, eprint = {http://ijmsi.ir/article-1-19-en.pdf}, journal = {Iranian Journal of Mathematical Sciences and Informatics}, issn = {1735-4463}, eissn = {2008-9473}, year = {2007} } @article{ author = {M.GHORBANI, and M.JALALI,}, title = {A SIMPLE ALGORITHM FOR COMPUTING TOPOLOGICAL INDICES OF DENDRIMERS}, abstract ={Dendritic macromolecules’ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.}, Keywords = {DENDRIMER, WIENER INDEX, HYPER WIENER INDEX, GAP}, volume = {2}, Number = {2}, pages = {17-23}, publisher = {ACECR at Tarbiat Modares University}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, doi = {10.7508/ijmsi.2007.02.002}, url = {http://ijmsi.ir/article-1-20-en.html}, eprint = {http://ijmsi.ir/article-1-20-en.pdf}, journal = {Iranian Journal of Mathematical Sciences and Informatics}, issn = {1735-4463}, eissn = {2008-9473}, year = {2007} } @article{ author = {B.MANOUCHEHRIAN, and A.R.ASHRAFI,}, title = {A SIMPLE ALGORITHM FOR COMPUTING DETOUR INDEX OF NANOCLUSTERS}, abstract ={Let G be the chemical graph of a molecule. The matrix D = [dij ] is called the detour matrix of G, if dij is the length of longest path between atoms i and j. The sum of all entries above the main diagonal of D is called the detour index of G. In this paper, a new algorithm for computing the detour index of molecular graphs is presented. We apply our algorithm on copper and silver nanoclusters to find their detour index.}, Keywords = {DETOUR INDEX, SILVER AND COPPER NANOCLUSTERS, NOINDENT}, volume = {2}, Number = {2}, pages = {25-28}, publisher = {ACECR at Tarbiat Modares University}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, doi = {10.7508/ijmsi.2007.02.003}, url = {http://ijmsi.ir/article-1-21-en.html}, eprint = {http://ijmsi.ir/article-1-21-en.pdf}, journal = {Iranian Journal of Mathematical Sciences and Informatics}, issn = {1735-4463}, eissn = {2008-9473}, year = {2007} } @article{ author = {G.H.FATHTABAR,}, title = {THE AUTOMORPHISM GROUP OF FINITE GRAPHS}, abstract ={Let G = (V,E) be a simple graph with exactly n vertices and m edges. The aim of this paper is a new method for investigating nontriviality of the automorphism group of graphs. To do this, we prove that if |E| >=[(n - 1)2/2] then |Aut(G)|>1 and |Aut(G)| is even number.}, Keywords = {FINITE GRAPH, GRAPH AUTOMORPHISM, BIPARTITE GRAPH}, volume = {2}, Number = {2}, pages = {29-33}, publisher = {ACECR at Tarbiat Modares University}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, doi = {10.7508/ijmsi.2007.02.004}, url = {http://ijmsi.ir/article-1-22-en.html}, eprint = {http://ijmsi.ir/article-1-22-en.pdf}, journal = {Iranian Journal of Mathematical Sciences and Informatics}, issn = {1735-4463}, eissn = {2008-9473}, year = {2007} } @article{ author = {P.RAJA, and S.M.VAEZPOUR,}, title = {NORMED HYPERVECTOR SPACES}, abstract ={The main purpose of this paper is to study normed hypervector spaces. We generalize some definitions such as basis, convexity, operator norm, closed set, Cauchy sequences, and continuity in such spaces and prove some theorems about them.}, Keywords = {NORM, LINEAR FORM, HYPERVECTOR SPACE, BASIS}, volume = {2}, Number = {2}, pages = {35-44}, publisher = {ACECR at Tarbiat Modares University}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, doi = {10.7508/ijmsi.2007.02.005}, url = {http://ijmsi.ir/article-1-23-en.html}, eprint = {http://ijmsi.ir/article-1-23-en.pdf}, journal = {Iranian Journal of Mathematical Sciences and Informatics}, issn = {1735-4463}, eissn = {2008-9473}, year = {2007} } @article{ author = {M.ABADI, and B.SADEGHIAN, and A.GHAEMI, and M.A.ALIPOUR,}, title = {FINDING HIGHLY PROBABLE DIFFERENTIAL CHARACTERISTICS OF SUBSTITUTION-PERMUTATION NETWORKS USING GENETIC ALGORITHMS}, abstract ={In this paper, we propose a genetic algorithm, called GenSPN, for finding highly probable differential characteristics of substitution permutation networks (SPNs). A special fitness function and a heuristic mutation operator have been used to improve the overall performance of the algorithm. We report our results of applying GenSPN for finding highly probable differential characteristics of Serpent block cipher. A comparison of the resultant characteristics with the previously published works shows that GenSPN can find differential characteristics of higher probabilities.}, Keywords = {DIFFERENTIAL CHARACTERISTIC, DIFFERENTIAL CRYPTANALYSIS, GENETIC ALGORITHMS, SUBSTITUTION,PERMUTATION NETWORK, SERPENT}, volume = {2}, Number = {2}, pages = {45-56}, publisher = {ACECR at Tarbiat Modares University}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, doi = {10.7508/ijmsi.2007.02.006}, url = {http://ijmsi.ir/article-1-24-en.html}, eprint = {http://ijmsi.ir/article-1-24-en.pdf}, journal = {Iranian Journal of Mathematical Sciences and Informatics}, issn = {1735-4463}, eissn = {2008-9473}, year = {2007} } @article{ author = {C.Adiga, and Z.Khoshbakht, and I.Gutman,}, title = {MORE GRAPHS WHOSE ENERGY EXCEEDS THE NUMBER OF VERTICES}, abstract ={The energy E(G) of a graph G is equal to the sum of the absolute values of the eigenvalues of G. Several classes of graphs are known that satisfy the condition E(G) > n , where n is the number of vertices. We now show that the same property holds for (i) biregular graphs of degree a b , with q quadrangles, if q<= abn/4 and 5<=a < b = 0 (iii) triregular graphs of degree 1, a, b that are quadrangle-free, whose average vertex degree exceeds a , that have not more than 12n/13 pendent vertices, if 5<= a < b<=((a - 1)^2)/2 .}, Keywords = {Energy of graph, Spectral graph theory, Biregular graphs, Triregular graphs.}, volume = {2}, Number = {2}, pages = {57-62}, publisher = {ACECR at Tarbiat Modares University}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, doi = {10.7508/ijmsi.2007.02.007}, url = {http://ijmsi.ir/article-1-77-en.html}, eprint = {http://ijmsi.ir/article-1-77-en.pdf}, journal = {Iranian Journal of Mathematical Sciences and Informatics}, issn = {1735-4463}, eissn = {2008-9473}, year = {2007} }