Loading...
Search for: akbari--zohre
0.168 seconds

    On the Finiteness of Noetherian Rings with Finitely Many Regular Elements

    , Article Communications in Algebra ; Vol. 42, issue. 7 , 2014 , pp. 2869-2870 ; ISSN: 00927872 Akbari, S ; Heydari, F
    2014
    Abstract
    Let R be a left Noetherian ring and ZD(R) be the set of all zero-divisors of R. In this paper, it is shown that if RZD(R) is finite, then R is finite  

    Multicolored spanning subgraphs in G-colorings of complete graphs

    , Article Ars Combinatoria ; Volume 111 , 2013 , Pages 145-159 ; 03817032 (ISSN) Akbari, S ; Zare, S
    2013
    Abstract
    Let G = {g1,...,gn} be a finite abelian group. Consider the complete graph with the vertex set {g1.....,.....g n}. The G-coloring of Kn is a proper edge coloring in which the color of edge {gi,gj} gi g i + gj, 1 ≤ i < 3 ≤ n. We prove that in the G-coloring of the complete graph Kn, there exists a multicolored Hamilton path if G is not an elementary abelian 2-group. Furthermore, we show that if n is odd, then the G-coloring of Kn can be decomposed into multicolored 2-factors and there are exactly lr/2 multicolored r-uniform 2-factors in this decomposition where lr is the number of elements of order r in G, 3 ≤ r ≤ n. This provides a generalization of a recent result due to Constantine which... 

    Left artinian algebraic algebras

    , Article Algebra Colloquium ; Volume 8, Issue 4 , 2001 , Pages 463-470 ; 10053867 (ISSN) Akbari, S ; Sharif University of Technology
    2001
    Abstract
    Let R be a left artinian central F-algebra, T(R) = J(R) + [R,R], and U(R) the group of units of R. As one of our results, we show that, if R is algebraic and char F = 0, then the number of simple components of R = R/J(R) is greater than or equal to dimF R/T(R). We show that, when char F = 0 or F is uncountable, R is algebraic over F if and only if [R, R] is algebraic over F. As another approach, we prove that R is algebraic over F if and only if the derived subgroup of U(R) is algebraic over F. Also, we present an elementary proof for a special case of an old question due to Jacobson. © Inst. Math. CAS 2001  

    Two conjectures on uniquely totally colorable graphs

    , Article Discrete Mathematics ; Volume 266, Issue 1-3 , 2003 , Pages 41-45 ; 0012365X (ISSN) Akbari, S ; Sharif University of Technology
    2003
    Abstract
    In this paper we investigate two conjectures proposed in (Graphs Combin. 13 (1997) 305-314). The first one is uniquely totally colorable (UTC) conjecture which states: Empty graphs, paths, and cycles of order 3k, k a natural number, are the only UTC graphs. We show that if G is a UTC graph of order n, then Δn/2+1, where Δ is the maximum degree of G. Also there is another question about UTC graphs that appeared in (Graphs Combin. 13 (1997) 305-314) as follows: If a graph G is UTC, is it true that in the proper total coloring of G, each color is used for at least one vertex? We prove that if G is a UTC graph of order n and in the proper total coloring of G, there exists a color which did not... 

    Sum Coloring of Graphs

    , M.Sc. Thesis Sharif University of Technology Heydari, Asrin (Author) ; Akbari, Saeed (Supervisor)

    Design and Simulation (& Manufacturing) of A Micro-Gyroscope

    , M.Sc. Thesis Sharif University of Technology Soltani, Arman (Author) ; Akbari, Javad (Supervisor)
    Abstract
    Nowadays, microgyroscopes are among the most important products of MEMS. The production of small, precise and inexpensive gyroscopes has become possible as the result of recent developments in fabrication technology. In this thesis it is intended to introduce a new method for manufacturing more precise microgyroscopes regarding manufacture facilities. Using this new method, sensitivity and resistance of microgyroscopes are increased against noises which are primarily caused by vibration and rotation about undesirable axes. The rotational movement imposed on the gyro is detected through fluid flow within its torus channel. This transformation facilitates the measurement of the initial motion.... 

    On the Domination Polynomial of Graphs

    , M.Sc. Thesis Sharif University of Technology Ebrahimi, Zeinab (Author) ; Akbari, Saeed (Supervisor)

    Ultrasonic-Assisted Drilling of Glass Fiber Reinforced Composites

    , M.Sc. Thesis Sharif University of Technology Forouzan, Ali (Author) ; Akbari, Javad (Supervisor)
    Abstract
    The fiber-reinforced composite materials possess advantage for structural purpose in various industries. Delamination is recognized as one of the major causes of damage during drilling of fiber reinforced composites, which not only reduces the structural integrity, but also has the potential for long-term performance deterioration. It is difficult to produce precise quality holes with high efficiency by conventional drilling method. Drilling is frequently applied in production cycle while the anisotropy and nonhomogeneity of composite materials affect the chip deformation and machining behavior during drilling. In this thesis, a new non-traditional drilling technology is presented for solve... 

    Some Applications of Combinatorial Nullstellensatz in Graph Theory and Combinatorics

    , M.Sc. Thesis Sharif University of Technology Fakhari, Amin (Author) ; Akbari, Saeed (Supervisor)

    Energy of Graphs

    , Ph.D. Dissertation Sharif University of Technology Ghorbani, Ebrahim (Author) ; Akbari, Saeid (Supervisor)
    Abstract
    Let G be a graph with adjacency matrix A and Δ be a diagonal matrix whose diagonal entries are the degree sequence of G. Then the matrices L = Δ− A and Q = Δ+A are called Laplacian matrix and signless Laplacian matrix of G, respectively. The eigenvalues of A, L, and Q are arranged decreasingly and denoted by λ1 ≥ · · · ≥ λn, μ1 ≥ · · · ≥ μn ≥ 0, and q1 ≥ · · · ≥ qn ≥ 0, respectively. The energy of a graph G is defined as E(G) :=
    n
    i=1
    |λi|.
    Furthermore, the incidence energy, the signed incidence energy, and the H¨uckel energy of G are
    defined as
    IE(G) :=
    n
    i=1

    qi, LE(G) :=
    n
    i=1

    μi, HE(G) :=

    2
    r
    i=1 λi, n=... 

    A Locality Aware P2P Overlay Architecture for Video Streaming

    , M.Sc. Thesis Sharif University of Technology Bayat, Navid (Author) ; Akbari, Behzad (Supervisor)
    Abstract
    Internet video networks have already attracted millions of Internet users, and Internet video is one of the fast growing Internet services. The peer-to-peer (P2P) network is an efficient solution to supporting large scale video streaming on the Internet. P2P networks can deliver live multimedia content to millions of users with low cost at any time, and at anywhere they want. In this thesis, we investigate solutions to enhancing the performance of the unstructured mesh-based. Locality awareness or network proximity is one of the essential characteristics of P2P networks. In live P2P video streaming we face to some challenges like bandwidth heterogeneity of peers, and peer churn. In the P2P... 

    Probabilistic Methods in Graph Coloring

    , M.Sc. Thesis Sharif University of Technology Ahadi, Arash (Author) ; Akbari, Saeed (Supervisor)
    Abstract
    Graph Theory and Combinatorial Analysis like the other branches of science use the probability for solving their problems. At the first , we will introduce the most common tools from probability used in Discrete Mathematics, such as “The Lovasz Local Lemma”. Most of them are based on Linearity of Expectation, Concentration Theorems and some other innovative methods such as Deletation Method. We will present different examples for these techniques. Also we will introduce “Random Graphs” and their importance. Specially we will explain how to use “Threshold Functions” to obtain different properties about the majority of graphs. Rainbow Connection, is a natural and interesting quantifiable way... 

    Intersection Graph

    , M.Sc. Thesis Sharif University of Technology Yaghoobian, Maysam (Author) ; Akbari, Saeed (Supervisor)
    Abstract
    Let R be a ring with unity, M be a unitary left R-module and I(M)* be the set of all non-trivial submodules of M. The intersection graph of submodules of M, denoted by G(M), is a graph with the vertex set I(M)* and two distinct vertices N and K are adjacent if and only if N\K ̸= 0. We investigate the interplay between the module-theoretic properties of M and the graph-theoretic properties of G(M). We characterize all modules for which the intersection graph of submodules is connected. Also the diameter and the girth of G(M) are determined. We study the clique number and the chromatic number of G(M). Among other results, it is shown that if G(M) is a bipartite graph, then G(M) is a star... 

    Data Mining Application in Customer Relationship Management: Case study in Saipa Yadak Co.

    , M.Sc. Thesis Sharif University of Technology Akbari, Amin (Author) ; Salmasi, Naser (Supervisor)
    Abstract
    One of the most applicable fields in data mining is customer relationship management (CRM). CRM process includes four aspects: Customer identification, Customer attraction, Customer retention, and Customer development. Data mining can be a supportive tool for decision making in each of these CRM aspects. Huge volume of data and information corresponding to CRM that exists in companies' databases, has made sufficient potential for data mining process and discovering hidden knowledge. Importance of concepts like customer needs identification, customer retention, and increasing customer value for companies has made the need to use of data mining techniques more valuable. Saipa Yadak Co., as a... 

    From-Focused Second Language Vocabulary Learning: A Case for Translation and Dictionary Search

    , M.Sc. Thesis Sharif University of Technology Akbari, Somayeh (Author) ; Jahangard, Ali (Supervisor)
    Abstract
    The purpose of the study was four-fold: first to investigate the predictive adequacy of the Task-Induced Involvement Load Hypothesis which contends that higher-load inducing tasks yield better retention rates in incidental learning situations, second, to examine whether type of dictionary search could affect vocabulary retention, third, to investigate the effect of translation direction on retention rate, and finally to determine the most effective tasks. To meet these ends, six groups of EFL learners - all male, aging 19-25, majoring in various fields of engineering sciences were assigned to the study. Each one of the groups performed distinct tasks which were as follow: reading... 

    Zero-Sum Flows in Designs and Hypergraphs

    , M.Sc. Thesis Sharif University of Technology Bahmani, Asghar (Author) ; Akbari, Saieed (Supervisor)
    Abstract
    Let X = fx1; : : : ; xng be the set of vertices of a hypergraph H and E = fe1; : : : ; emg be the set of its edges. The incidence matrix of hypergraph H is an n m and (0; 1)-matrix, N, such that nij = 1 if xi 2 ej and nij = 0, otherwise. A zero-sum flow for H is a vector with non-zero entries that is in the null space of N. A zero-sum k-flow is a flow with non-zero integer entries that absolue value of each entry is at
    most k 1. In this thesis we study the existence of zero-sum flows for designs and hypergraphs. Also we consider zero-sum 3-flows in 2-Steiner designs  

    Experimental Study of Pendulum Grinding of Superalloys

    , M.Sc. Thesis Sharif University of Technology Yazdani, Majid (Author) ; Akbari, Javad (Supervisor)
    Abstract
    Superalloys are widely used in aerospace and power industries due to the good performance at high temperatures for examples gas turbines, steam turbines and aircraft components. In addition to the turbines cobalt-base superalloys are used in medical implants such as knee and hip joints. The main strengths of the superalloys are heat-resistant, retaining their high mechanical and chemical properties at high temperatures, high melting temperatures, high corrosion resistance, resistance to thermal fatigue, thermal shock, creep, and erosion. Because of difficult to machine properties of superalloys, grinding is one of the effective methods for machining superalloys. The surface integrity of the... 

    U-Shaped Assembly Line Rebalancing With Cost Minimization Objectives

    , M.Sc. Thesis Sharif University of Technology Khoshnood, Sara (Author) ; Akbari, Javad (Supervisor)
    Abstract
    U-shaped assembly lines usually are more effective than straight lines. Therefore special attention has been paid to u-shaped line balancing problem in recent years. On the other hand most articles on the line balancing problems are investigated for the first time. However, within the lifetime of an ALB, the balancing problems do not occur only once prior to its construction, but rather continuously as rebalancing. For example whenever the demand structure or production technology changes or producing seasonal products, the ALB needs to be reconfigured. So many balancing issues in the real world are related to re-balancing of production lines.
    Therefore in this study, U-shaped assembly... 

    Design and Implementation of a Soft Switched Bidirectional Charger for Vehicle-to-grid (V2G) Applications

    , M.Sc. Thesis Sharif University of Technology Akbari, Rasoul (Author) ; Tahami, farzad (Supervisor)
    Abstract
    Due to the growing oil price and environmental considerations, tendency to use local and environmentally friendly energy sources has increased.Bidirectional transmission can be one of the key features of the smart grid,so the use of car battery connected to the grid as local energy sources makes sense. This can provide network stability, especially during peak load times. Vehicles connected to grid (V2G) is an electric vehicle or a plug-in hybrid electric vehicles can delivered the electricity to the grid. These systems require either two separate power electronic converters can be used for transmission in either directions or a two-way transfer charger. The aim of this project is to design... 

    Co-maximal Graph of Algebraic Structures

    , M.Sc. Thesis Sharif University of Technology Miraftab, Babak (Author) ; Akbari, Saieed (Supervisor)
    Abstract
    In this thesis, we study some connections between the graph-theoretic and algebraic properties of co-maximal graph of algebraic structures. We follow two purposes. First, what properties of algebraic structures can be found from co-maximal graph of algebraic structures. Second, what geometric or graph theoretical properties of co-maximal graph of algebraic structures can be found from specefic algebraic structures. Let G be a group and I(G)∗be the set of all non-trivial sub-groups of G. The co-maximal graph of subgroups of G, denoted byΓ(G), is a graph with the vertex set I(G)∗and two distinct vertices H and K are adjacent if and only if HK=G. We char-acterize all groups whose co-maximal...