Sharif Digital Repository

Based on author Siavash Shahshahani's extensive teaching experience, this volume presents a thorough, rigorous course on the theory of differentiable manifolds. Geared toward advanced undergraduates and graduate students in mathematics, the treatment's prerequisites include a strong background in undergraduate mathematics, including multivariable calculus, linear algebra, elementary abstract algebra, and point set topology. More than 200 exercises offer students ample opportunity to gauge their skills and gain additional insights.
The four-part treatment begins with a single chapter devoted to the tensor algebra of linear spaces and their mappings. Part II brings in neighboring points to... 

We investigate the second quantization form of the entanglement Hamiltonian (EH) of various subregions for the ground state of several interacting lattice fermions and spin models. The relation between the EH and the model Hamiltonian itself is an unsolved problem for the ground state of generic local Hamiltonians. In this paper, we demonstrate that the EH is practically local and its dominant components are related to the terms present in the model Hamiltonian up to a smooth spatially varying temperature even for (a) discrete lattice systems, (b) systems with no emergent conformal or Lorentz symmetry, and (c) subsystems with nonflat boundaries, up to relatively strong interactions. We show... 

Abstract Elastic optical networking has recently been proposed for use in optical transport networks to cope with increasingly heterogeneous and dynamic demand patterns. In this paper, we study the blocking performance of a multi-class elastic optical link for which a demand needs to be allocated a contiguous subset of the entire spectrum. This problem is different than the well-known blocking problem in multi-class multi-server loss systems due to the contiguous allocation constraint. We first propose a non-work-conserving aligned spectrum allocation policy which is shown to outperform the conventional first fit-based work-conserving allocation policy without alignment. Subsequently, for... 

Given a simple polygon P with n vertices, the visibility polygon (V P) of a point q (V P(q)), or a segment (formula present) (V P(pq)) inside P can be computed in linear time. We propose a linear time algorithm to extend V P of a viewer (point or segment), by converting some edges of P into mirrors, such that a given non-visible segment (formula present) can also be seen from the viewer. Various definitions for the visibility of a segment, such as weak, strong, or complete visibility are considered. Our algorithm finds every edge such that, when converted to a mirror, makes (formula present) visible to our viewer. We find out exactly which interval of (formula present) becomes visible, by... 

Drawing on a modified version of Delphi technique, the researchers in this study tried to develop a rubric comprising the main criteria to be considered in the evaluation of works of fiction. Review of the related literature, as well as the administration of a Likert scale questionnaire, and a series of unstructured interviews with experts in the fields of literature and creative writing, led to the identification of ten elements which were used in the construction of the first version of the rubric. To ensure its validity, a number of distinguished creative writing professors were asked to review this assessment tool and comment on its appropriateness for measuring the intended construct.... 

Given a simple polygon P with n vertices, the visibility polygon (VP) of a point q, or a segment pq‾ inside P can be computed in linear time. We propose a linear time algorithm to extend the VP of a viewer (point or segment), by converting some edges of P into mirrors, such that a given non-visible segment uw‾ can also be seen from the viewer. Various definitions for the visibility of a segment, such as weak, strong, or complete visibility are considered. Our algorithm finds every edge that, when converted to a mirror, makes uw‾ visible to our viewer. We find out exactly which interval of uw‾ becomes visible, by every edge middling as a mirror, all in linear time. In other words, in this... 

Drawing on a modified version of Delphi technique, the researchers in this study tried to develop a rubric comprising the main criteria to be considered in the evaluation of works of fiction. Review of the related literature, as well as the administration of a Likert scale questionnaire, and a series of unstructured interviews with experts in the fields of literature and creative writing, led to the identification of ten elements which were used in the construction of the first version of the rubric. To ensure its validity, a number of distinguished creative writing professors were asked to review this assessment tool and comment on its appropriateness for measuring the intended construct.... 

We consider a slotted Aloha-based wireless communication network comprising a source and an active relay, both transmitting to a common destination. The relay node is able to relay the unsuccessfully transmitted packets of the source node, if it can detect them. We find the analytical closed form optimal static relaying policy in order to minimize the average transmission delay (ATD) of source packets, while ATD of its own packets is constrained. A static relaying policy is determined by acceptance and relaying probabilities of the relay node. According to acceptance probability, the relay node decides whether to accept an unsuccessfully transmitted packet from source or not, while the... 

We consider a cooperative wireless communication network comprising two full-duplex (FD) nodes transmitting to a common destination based on slotted Aloha protocol. Each node has exogenous arrivals and also may relay some of the unsuccessfully transmitted packets of the other node. In this article, we find the optimal static policies of nodes in order to minimize the sum of the average transmission delays, while the average transmission delay of each node is constrained. The static policy of each node specifies the probability of accepting an unsuccessfully transmitted packet of the other node and how the node prioritizes its transmissions. We show that in the optimal policies, just the node... 

While many-body effects in flat-band systems are receiving renewed hot interest in condensed-matter physics for superconducting and topological properties as well as for magnetism, studies have primarily been restricted to multiband systems (with coexisting flat and dispersive bands). Here we focus on one-band systems where a band is "partially flat," comprising flat and dispersive portions in k space to reveal whether intriguing correlation effects can already arise on the simplest possible one-band level. For that, the two-dimensional repulsive Hubbard model is studied for two models having different flat areas in an intermediate-coupling regime with the dynamical mean-field theory... 

In recent years, the active learning algorithms have focused on combining correlation criterion and uncertainty criterion for evaluating instances. Although these criteria might be useful, applying these measures on whole input space globally may lead to inefficient selected instances for active learning. The proposed method takes advantage of clustering to partition input space to subspaces. Then it exploits both labeled and unlabeled data locally for selection of instances by using a graph-based active learning. We define a novel utility score for selecting clusters by combining uncertainty criterion, local entropy of clusters and the factor of contribution of each cluster in queries....