Loading...
Search for: akbari--elahe
0.116 seconds

    Analyzing the Interplay of Power Management and Communication Reliability of Wireless Networks in Embedded Applications

    , M.Sc. Thesis Sharif University of Technology Hosseini, Elahe Sadat (Author) ; Ejlali, Alireza (Supervisor)
    Abstract
    Due to safety critical applications of the embedded systems, reliability is one of the most important properties of these systems. Wireless networks also have error prone data transmission channels and limited power consumption. Therefore reliability and power conservation are two vital characteristics of the wireless network especially in embedded applications. Since achieving to a desirable level of data reliability is power consuming, we must consider a trade-off between power consumption and data reliability. In wireless networks power consumption can be categorized into: power consumption in wireless devices and power consumption in data transmission. For decrement of wireless devices... 

    Confidential Access to the Outsourced Relational Data

    , M.Sc. Thesis Sharif University of Technology NajmAbadi, Elahe Sadat (Author) ; Jalili, Rasool (Supervisor)
    Abstract
    In recent years, there has been a trend toward outsourcing data to the cloud provider. These companies must tackle the data security challenges. Generally these parties are assumed to be honest but curious. In past years, the research communities have been investigating different solution to ensure confidentiality.
    In addition to data confidentiality access and pattern confidentiality is a high-priority issue in some cases so. potential adversary should be unable to drive information from the observed access pattern to the outsourced data. Despite the fact that there are more investigation in the field of data confidentiality, concern over data security are the rise in outsourcing data,... 

    Centrality-based group formation in group recommender systems

    , Article 26th International World Wide Web Conference, WWW 2017 Companion, 3 April 2017 through 7 April 2017 ; 2019 , Pages 1187-1196 ; 9781450349147 (ISBN) Mahyar, H ; Khalili, S ; Elahe Ghalebi, K ; Grosu, R ; Mojde Morshedi, S ; Movaghar, A ; Sharif University of Technology
    International World Wide Web Conferences Steering Committee  2019
    Abstract
    Recommender Systems have become an attractive field within the recent decade because they facilitate users' selection process within limited time. Conventional recommender systems have proposed numerous methods focusing on recommendations to individual users. Recently, due to a significant increase in the number of users, studies in this field have shifted to properly identify groups of people with similar preferences and provide a list of recommendations for each group. Offering a recommendations list to each individual requires significant computational cost and it is therefore often not efficient. So far, most of the studies impose four restrictive assumptions: (1) limited number of... 

    Investigate Laboratory Production of Hydroxyurea

    , M.Sc. Thesis Sharif University of Technology Nejati, Poorya (Author) ; Bastani, Dariush (Supervisor) ; Seifkordi, Ali Akbar (Supervisor) ; Zegordi, Elahe (Co-Advisor)
    Abstract
    Hydroxyurea is an anticancer drug that is commonly used to treat chronic myeloid leukemia (white blood cell cancer in bone marrow), polycythemia vera (red blood cell cancer), sickle cell anemia, solid tumors, and in particular leukemia. In this research, in addition to analyzing all available methods for synthesis of hydroxyurea, the most economical method for synthesis of hydroxyurea which is Hantzsch method was chosen; then we synthesized hydroxyurea crystals using a precipitation or crystallization process. To do so, two hydroxylamine hydrochloride and potassium cyanate reactants have been used in the semi batch reactor. Since the reaction efficiency and purity of the synthesized... 

    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... 

    Influence of nanoclay on morphology, mechanical properties and deformation mechanism of Polystyrene

    , Article Polymer - Plastics Technology and Engineering ; Vol. 53, issue. 2 , 2014 , p. 156-161 ; ISSN: 03602559 Akbari, B ; Bagheri, R ; Sharif University of Technology
    2014
    Abstract
    Polystyrene/organoclay nanocomposites were prepared by melt intercalation method in this research. Morphology, tensile and impact properties and deformation mechanism of the samples were studied. To study the structure of nanocomposites, X-ray diffraction and transmission electron microscopy techniques are utilized. The deformation mechanisms of different samples were examined via reflected and transmitted optical microscopy. The results reveal that incorporation of organoclay affects structure, mechanical properties and deformation mechanism of nanocomposite. Introduction of organoclay can facilitate initiation and growth of crazing mechanism in polystyrene at both conditions of loadings,... 

    The regular graph of a non-commutative ring

    , Article Electronic Notes in Discrete Mathematics ; Vol. 45, issue , January , 2014 , pp. 79-85 ; ISSN: 15710653 Akbari, S ; Heydari, F ; Sharif University of Technology
    2014
    Abstract
    Let R be a ring and Z(R) be the set of all zero-divisors of R. The total graph of R, denoted by T(Γ(R)) is a graph with all elements of R as vertices, and two distinct vertices x, y∈R are adjacent if and only if x+y∈Z(R). Let the regular graph of R, Reg(Γ(R)), be the induced subgraph of T(Γ(R)) on the regular elements of R. In 2008, Anderson and Badawi proved that the girth of total graph and regular graph of a commutative ring are contained in the set {3, 4, ∞}. In this paper, we extend this result to an arbitrary ring (not necessarily commutative). Also, we prove that if R is a reduced left Noetherian ring and 2∈Z(R), then the chromatic number and the clique number of Reg(Γ(R)) are the... 

    The regular graph of a noncommutative ring

    , Article Bulletin of the Australian Mathematical Society ; Vol. 89, issue. 1 , February , 2014 , pp. 132-140 ; ISSN: 00049727 Akbari, S ; Heydari, F ; Sharif University of Technology
    2014
    Abstract
    Let R be a ring and Z(R) be the set of all zero-divisors of R. The total graph of R, denoted by (TΓ (R)) is a graph with all elements of R as vertices, and two distinct vertices x, y in R are adjacent if and only if x + y Z(R). Let the regular graph of R, Reg (Γ(R)), be the induced subgraph of T(Γ (R)) on the regular elements of R. In 2008, Anderson and Badawi proved that the girth of the total graph and the regular graph of a commutative ring are contained in the set { 3, 4,} . In this paper, we extend this result to an arbitrary ring (not necessarily commutative). We also prove that if R is a reduced left Noetherian ring and 2 Z(R), then the chromatic number and the clique number of Reg... 

    Some results on the intersection graph of ideals of matrix algebras

    , Article Linear and Multilinear Algebra ; Volume 62, Issue 2 , February , 2014 , Pages 195-206 ; ISSN: 03081087 Akbari, S ; Nikandish, R ; Sharif University of Technology
    2014
    Abstract
    Let be a ring and be the set of all non-trivial left ideals of. The intersection graph of ideals of, denoted by, is a graph with the vertex set and two distinct vertices and are adjacent if and only if. In this paper, we classify all rings (not necessarily commutative) whose domination number of the intersection graph of ideals is at least 2. Moreover, some results on the intersection graphs of ideals of matrix algebras over a finite field are given. For instance, we determine the domination number, the clique number and the independence number of. We prove that if is a positive integer and, then the domination number of is. Among other results, we show that if, where is a positive integer... 

    Complete multipartite graphs and their null set

    , Article Electronic Notes in Discrete Mathematics ; Vol. 45 , 2014 , pp. 67-72 ; ISSN: 15710653 Akbari, S ; Bahramian, S ; Sharif University of Technology
    2014
    Abstract
    For every natural number h, a graph G is said to be h-magic if there exists a labelling l:E(G)→Zh{0} such that the induced vertex set labelling l+:V(G)→Zh defined byl+(v)=∑uv∈E(G)l(uv), is a constant map. When this constant is zero, it is said that G admits a zero-sum h-magic labelling. The null set of a graph G, denoted by N(G), is the set of all natural numbers h∈N such that G admits an h-zero-sum magic labelling. In 2007, E. Salehi determined the null set of complete bipartite graphs. In this paper we generalize this result by obtaining the null set of complete multipartite graphs  

    A generalization of hadamard matrices

    , Article Electronic Notes in Discrete Mathematics ; Vol. 45 , 2014 , pp. 23-27 ; ISSN: 15710653 Akbari, S ; Bahmani, A ; Sharif University of Technology
    2014
    Abstract
    Let S⊆C*=C{0} and A∈Mn(C). The matrix A is called an S-GHMn if A∈Mn(S) and AA*=Diag(λ1,... λn), for some positive numbers λi, i=1,... n. In this paper we provide some necessary conditions on n for the existence of an S-GHMn over a finite set S. We conjecture that for every positive integer n, there exists a {±1, ±2, ±3}-GHMn  

    Commutative rings whose cozero-divisor graphs are unicyclic or of bounded degree

    , Article Communications in Algebra ; Vol. 42, Issue. 4 , 2014 , pp. 1594-1605 ; ISSN: 0092-7872 Akbari, S ; Khojasteh, S ; Sharif University of Technology
    2014
    Abstract
    Let R be a commutative ring with unity. The cozero-divisor graph of R, denoted by Γ′(R), is a graph with vertex set W*(R), where W*(R) is the set of all nonzero and nonunit elements of R, and two distinct vertices a and b are adjacent if and only if a ∉ Rb and b ∉ Ra, where Rc is the ideal generated by the element c in R. Recently, it has been proved that for every nonlocal finite ring R, Γ′(R) is a unicyclic graph if and only if R ≅ ℤ2 × ℤ4, ℤ3 × ℤ3, ℤ2 × ℤ2[x]/(x 2). We generalize the aforementioned result by showing that for every commutative ring R, Γ′(R) is a unicyclic graph if and only if R ≅ ℤ2 × ℤ4, ℤ3 × ℤ3, ℤ2 × ℤ2[x]/(x 2), ℤ2[x, y]/(x, y)2, ℤ4[x]/(2x, x 2). We prove that for every... 

    {k, r - k}-Factors of r-Regular Graphs

    , Article Graphs and Combinatorics ; Vol. 30, issue. 4 , 2014 , pp. 821-826 ; ISSN: 0911-0119 Akbari, S ; Kano, M ; Sharif University of Technology
    2014
    Abstract
    For a set S of positive integers, a spanning subgraph F of a graph G is called an S-factor of G if degF(x) ∈ S for all vertices x of G, where degF(x) denotes the degree of x in F. We prove the following theorem on {a, b}-factors of regular graphs. Let r ≥ 5 be an odd integer and k be either an even integer such that 2 ≤ k < r/2 or an odd integer such that r/3 ≤ k < r/2. Then every r-regular graph G has a {k, r-k}-factor. Moreover, for every edge e of G, G has a {k, r-k}-factor containing e and another {k, r-k}-factor avoiding e  

    Some criteria for the finiteness of cozero-divisor graphs

    , Article Journal of Algebra and its Applications ; Volume 12, Issue 8 , 2013 ; 02194988 (ISSN) Akbari, S ; Khojasteh, S ; Sharif University of Technology
    2013
    Abstract
    Let R be a commutative ring with unity. The cozero-divisor graph of R denoted by Γ'(R) is a graph with the vertex set W*(R), where W*(R) is the set of all nonzero and non-unit elements of R, and two distinct vertices a and b are adjacent if and only if a ∉ Rb and b ∉ Ra, where Rc is the ideal generated by the element c in R. Let α(Γ'(R)) and γ(Γ'(R)) denote the independence number and the domination number of Γ'(R), respectively. In this paper, we prove that if α(Γ'(R)) is finite, then R is Artinian if and only if R is Noetherian. Also, we prove that if α(Γ'(R)) is finite, then R/P is finite, for every prime ideal P. Moreover, we prove that if R is a Noetherian ring, γ(Γ'(R)) is finite and... 

    Crosstalk stability analysis in multilayer graphene nanoribbon interconnects

    , Article Circuits, Systems, and Signal Processing ; Volume 32, Issue 6 , 2013 , Pages 2653-2666 ; 0278081X (ISSN) Akbari, L ; Faez, R ; Sharif University of Technology
    2013
    Abstract
    In this paper a time-domain response and Nyquist stability criterion to acquire dependence of degree of crosstalk relative stability based on transmission lines modeling (TLM) is investigated for coupled multilayer graphene nanoribbon (MLGNR) interconnects. This is the first instance that such an analysis has been presented for coupled MLGNR consisting of both capacitive and mutual-inductive couplings. The near-end and far-end outputs of coupled MLGNR individually are compared in two cases, with considering both couplings and without them (single MLGNR). It is observed that the near-end output of the system together with both couplings is more stable and at its far-end output, an induced... 

    The regular graph of a commutative ring

    , Article Periodica Mathematica Hungarica ; Volume 67, Issue 2 , 2013 , Pages 211-220 ; 00315303 (ISSN) Akbari, S ; Heydari, F ; Sharif University of Technology
    2013
    Abstract
    Let R be a commutative ring, let Z(R) be the set of all zero-divisors of R and Reg(R) = RZ(R). The regular graph of R, denoted by G(R), is a graph with all elements of Reg(R) as the vertices, and two distinct vertices x, y ∈ Reg(R) are adjacent if and only if x+y ∈ Z(R). In this paper we show that if R is a commutative Noetherian ring and 2 ∈ Z(R), then the chromatic number and the clique number of G(R) are the same and they are 2n, where n is the minimum number of prime ideals whose union is Z(R). Also, we prove that all trees that can occur as the regular graph of a ring have at most two vertices  

    Influence of compatibilizer and processing conditions on morphology, mechanical properties, and deformation mechanism of PP/clay nanocomposite

    , Article Journal of Nanomaterials ; Volume 2012 , 2012 ; 16874110 (ISSN) Akbari, B ; Bagheri, R ; Sharif University of Technology
    2012
    Abstract
    Polypropylene/montmorillonite nanocomposite was prepared by melt intercalation method using a twin-screw extruder with starve feeding system in this paper. The effects of compatibilizer, extruder rotor speed and feeding rate on properties of nanocomposite were investigated. Structure, tensile, and impact properties and deformation mechanism of the compounds were studied. For investigation of structure and deformation mechanisms, X-ray diffraction (XRD) and transmission optical microscopy (TOM) techniques were utilized, respectively. The results illustrate that introduction of the compatibilizer and also variation of the processing conditions affect structure and mechanical properties of...