Sharif Digital Repository

In majority of the (standalone or grid-connected) PV Systems, predefined rule-based algorithms are utilized in order to manage and control the flow of power. The function of these algorithms is to send the generated energy from solar panels either to load for consumption, or to battery for storage, or to the grid for sale. Their performance is based on predefined instructions and regardless of load change and consumption patterns. Therefore the total efficiency of these systems depend greately upon individual user’s load type and consumption pattern. In current research, an optimum and dynamic energy management algorithm is proposed using dynamic programming (DP) method, in order to increase... 

The Weil group WF is assigne to every local field F. Langlands Correspondence is a bijetion between semisimple two-dimensional Deligne representations of Weil Group WF and irreducible representations of GL2(F) which fixes assigned L-functions and local constants. In this thesis we have classified an important class of irreducible representations of GL(2) over local fields called Principal Series. We also tried to give a taste of Langlands Correspondence to the reader. First we explain preliminaries and introduce locally profinite groups and their smooth representations. Then we classify representations of GL2(F) when F is finite. Then we study GL2(F) when F is a local field. Finally we... 

In this thesis, we investigate constructive measure theory in two schools of constructivism; intuitionistic mathematics and Bishop’s constructive mathematics.In this regard, first, we examine some classical propositions on measurability in both schools. Then we give a comparison between measurability in the two schools  

In real-time semantic segmentation, images are divided into predefined semantic regions at a speed exceeding 30 frames per second, and each point of the image is labeled with a category. The output of this fundamental task is to produce a representation that is comprehensible to computers for further processing in applications such as autonomous vehicles, robotics, and augmented reality. This task pursues two conflicting goals: improving the accuracy of segmentation and increasing its speed. Previous research has enhanced segmentation speed using lightweight and multi-branch structures and improved accuracy using attention mechanisms. Depth map alongside color image can lead to better... 

The k-center problem—covering a set of points using k congruent balls with minimum radius—is a well-known clustering model in computer science with a wide range of applications. The k-center is a well known NP-Hard problem. In this thesis, we focus on the k-center problem with outliers in high dimensional data streams. Due to increase in data size, we focus on the data stream model of the problem. Moreover, in real-world applications, where input points are noisy, it is very important to consider outliers. In this thesis, we study 1-center and 2-center with outliers in high dimensional data streams in Euclidean space. We provide a 1:7-approximation streaming algorithm for 1-center with z... 

In this monograph, we investigate the long-time behavior of stochastic delay equations. Our approach is random dynamical systems, and we solve our equation in the rough path point of view. Namely, we deal with the singular case, i.e., when the delay terms also are appearing in the diffusion part. Although we can solve the equation using the classical tools of stochastic analysis, the main obstacle is the lack of flow property. More precisely, the solution does not depend continuously on the initial value. To solve this problem, we define this property differently. We will show how we can generate a flow property on fields of Banach spaces using rough path theory. As a consequence, we prove...