Sharif Digital Repository

This thesis contributes two separate predictive direct torque control methods; based on hysteresis and fuzzy logic for Brushless Doubly Fed Induction Machine (BDFM). Initially Chapter 1, focuses on BDFM history and concept of this machine and after that a short review about the development of BDFM and the Field Oriented Control will be studied. Chapter 2 introduces the d-q-0 state transformation matrix, dynamic equation of BDFM and represents its steady-state equivalent. Furthermore, in this chapter the bond graph model of BDFM is studied and via distinguishing all energy ports the bond graph model of this motor is introduced and validated, finally the result of this model is compared with... 

Computational complexity of graph problems is an important branch in the-oretical computer science. We introduce to some of ideas for computing the complexity of graph problems with some kind and beautiful examples. Next, we show hardness and inapproximability of some problems. Representation number of graphs has been introduce by Pavel Erdos by Number theory. We prove n1−ϵ inapproximability of that. Lucky number η has been studied by Grytczuk et.al . We show for planar and 3-colorable graphs, it is NP-Complete whether η = 2. Note that since a conjecture, for those graphs, 2 ≤ η ≤ 3. Also for each k ≥ 2, we show NP-completeness of η ≤ k for the graphs. Proper orientation number −→ is a... 

In this thesis we review several arithmetical questions about the diophantine equation φ[x]=q where φ is a nondegenerate symmetric bilinear form on a finite dimensional vector space, φ[x] is the corresponding quadratic form and q is a nonzero element of the ground field. We obtain class number and mass formulae for the orthogonal group associated to φ in a number field utilizing the concept of quadratic forms, lattices and adelic language  

In this thesis, we analyze and compare switching and CPSP cryptography systems. CPSP is a dynamic system which can act as synchronized or self-synchronized stream cipher under specific conditions. To do the comparison, first we have a brief review of cryptography fundamentals like stream cipher systems, synchronized stream ciphers, and self-synchronized ones. Then, we consider chaos systems in general form and then we present their role in cryptography systems, and in continue by introducing switching cryptography systems and also CPSP cryptography systems, and analyzing their relation with self-synchronized stream ciphers, we do our statistical tests on them  

In this thesis, first we will have a thorough review on problems and models presented in the field of contagion in networks (spread of diseases, spread of computer viruses,etc.). Then we will investigate the basic model of virus inoculation game with purely selfish players and the modified version of it which takes into account a factor of friendship. We will discuss the results of these models including computing and comparing Nash Equilibria  

The Mordell–Weil theorem states that for an abelian variety A over a number field k, the group A(k) of k-rational points of A is a finitely-generated abelian group, called the Mordell-Weil group. The case with A an elliptic curve E and k the rational number field Q is Mordell’s theorem, answering a question apparently posed by Poincare around 1908; it was proved by Louis Mordell in 1922. The tangent-chord process (one form of addition theorem on a cubic curve) had been known as far back as the seventeenth century. The process of infinite descent of Fermat was well known, but Mordell succeeded in establishing the finiteness of the quotient group E(Q)=2E(Q) which forms a major step in the... 

Injury severity is one of the most important measures of accident costs. Pedestrian injury severity has been modeled with several methods. Model specification directly affects the results and recommended policies. Using inappropriate model may lead policy makers to apply misleading policies. Using police-reported collision data from 2008 to 2011 from the state of North Carolina, Unites States, several discrete choice models were developed to investigate the effect of different variables on pedestrian injury severity. These models include Multinomial Logit(MNL) and different Generalized Extreme Value(GEV) structures. Several factors were found to increase pedestrian injury severity, including... 

Let G be a simple graph. A harmonious coloring of G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number, h(G), is the least number of colors in such a coloring. In this project, first we discuss about complexity of harmonious coloring. Then we find some bounds for harmonious chromatic number  

The PCP theorem is the result of a line of work on interactive proofs and probabilistically checkable proofs. The first theorem relating standard proofs and probabilistically checkable proofs is NEXP?PCP[poly(n),poly(n)] . Subsequently, the method used in the proof of this statement were extended to yield a proof of the PCP theorem. However, this proof is relatively long and complicated. The PCP theorem is equivalent to hardness of approximation of some optimization problems. In 2006, Irit Dinur discovered a different proof of the PCP theorem. Dinur’s proof is a rather shorter and simpler than original proof. The main purpose of this survey is to present the main concepts and tools used in... 

We consider a network creation game in which, each player(vertex) has bounded budget to draw edges to other vertices. Each player wants to minimize its local diameter in MAX version, and its sum of distances to other vertices in SUM version.
In this thesis, we first prove that the problem of finding the best response for each player in this network creation game, is NP-Hard. But we show that always there exists a Pure Nash Equilibria for each of the versions. Then we focus on the diameter of equilibrium graphs. In Unit Budget case (when each player’s budget is one) we show that the diameter of each equilibrium graph in O(1), and always there exists a Mixed Nash Equilibirum. For each n,... 

Auto insurance premiums are currently part of car ownership fixed costs in Iran. As driver behavior and driven distance, in spite of their significant impact on driver’s risk, are not considered in these costs. Distance-based models are introduced to enter usage costs to premium calculations and affect drivers’ behavior. Achieving benefits of this plan demands evaluation of profits and implementing costs of it. This research aims to provide guidelines to influence drivers’ behavior alongside with studying the distance-based insurance market in Iran. Required data collected using a field survey in Tehran car technical inspection centers, by representing four different plans to 980... 

” The story of the "Weil conjectures" is a marvelous example of mathematical imagination, and one of the most striking instances exhibiting the fundamental unity of mathematics.”In 1949,Andre Weil stated some conjectures on the zeta function of Algebraic varieties over finite fields .These conjectures were analogue of the properties of Riemann zeta function ,in particular Riemann hypothesis.In fact ,Weil built a bridge between Diophantine structure on varieties over finite fields (Counting of rational points on varieties) and cohomological structure of them over the field of complex numbers(topology of variety).In this thesis, first we state Weil’s motivations for these conjectures and state... 

This thesis is about one of the newest attractive theories in mathematics and theoretical physics; Topological Quantum Field Theory (TQFT) has some basic algebraic requirements called tensor categories, after introducing them and describing axioms of the theory which has suggested by Atiyah in 1988, we will see that the category of 2d-TQFT is equivalent to the category of commutative frobenius algebras over an arbitrary field .In the last part we focus on some topological aspects of theory in dimension 3 and some invariants of 3d manifolds , we will see these invariants are the main tool for construction a 3d-TQFT  

In the year 2004 when the first instance of graphen was built in laboratory, entice the attraction of many research groups. Because in spite of absence of graphen to that time, physicists given the unique properties for it. So it was the time to use that marvel properties which only theoretically available, to design and built one atom thick circuits. In this dissertation for the first time, we want by using method of moment and multilayer green functions in spectral domain, analyze graphene-based ribbon and stepped electrical conductivity distribution waveguides and calculate their characteristics such as propagation constant, surface currents and characteristics impedance with external... 

The fratar model that is one of the most common models of travel distribution has some weak points. Due to its strong tendency to existing distribution and disregarding the zonal characteristics, this model is unable to consider sudden changes in plan on the horizon. In order to identify the variables affecting the distribution of travel, using the behavioral approach is vital. For this purpose, Multinomial Logit model is used for distribution of shopping trips in the city of Shiraz. The city of Shiraz is divided into 156 zones. If all zones be considered as the choice set for each traveler, the results of model won't be efficient. To address this problem, sampling should be done based on... 

Axon is an important part of the neuronal cells and axonal microtubules are bundles in axons.In axons, microtubules are coated with microtubule-associated protein tau, a natively unfolded filamentous protein in the central nervous system. These proteins are responsible for cross-linking axonal microtubule bundles. Through complimentary dimerization with other tau proteins, bridges are formed between nearby microtubules creating bundles. Formation of bundles of microtubules causes their transverse reinforcement and has been shown to enhance their ability to bear compressive loads. Though microtubules are conventionally regarded as bearing compressive loads, in certain circumstances such as in... 

The running time of almost every algorithm in the graph theory depend on the number of edges. Thus, these algorithms are often too slow when the input graphs are dense. Therefore, it is useful to reduce the number of edges by sparsification. In fact, sparsification is the task of approximating a graph G = (V;E) by another graph ~G = (V; ~E) so that ~E E (j~Ej jEj) and ~G maintain a main prefixed property of G. Depending on these properties several notions of graph sparsification have been proposed. In this thesis we study a notion of sparsification that is called spectral sparsification which is based on the contributions of Daniel A. Spielman et.al..In this notion of sparsification... 

Separating cells from a mixed sample is a required task in biotechnology and modern medicine, for example to isolate CTC’s that are of interest for doing therapy and diagnosing or doing research. A minute percentage of target cells must be separated from a large amount of unwanted cells. These target cells like CTC’s could be as rare as 1 target cell per millions of unwanted background cells. Hence Microfluidic cell sorting schemes based upon fluorescent labelling, electrophoresis, dielectrophoresis and magnetophoresis have been devised. Microfluidic magnetically-activated cell sorting (MACS) does not need any optical instrument or current source and electrode. By using an electromagnet or... 

One important way to discover patterns in data is clustering. Due to the limited human ability to solve problems in terms of volume and range of computing a viable solution for processing large amounts of data is using parallel processing. In this project, it is proposed some modification on Daneshgar-Javadi ‘s algorithm for data clustering using parallel processing. In this new algorithm , data will be divided among different processors to cluster them independently and in a parallel manner. Then results of each processor will be gathered and a final clustering will be performed on the gathered results. It is shown that the proposed modified algorithm along its high speed processing can... 

Let M be a closed manifold, oriented manifold of dimension -d. Let be the space of smooth loops in M. Chas and Sullivan defined a product on the homology H⋆(LM) of degree -d. They then investigated other structure that this product induces including a Batalin-Vilkovisky structure, and a lie algebra structure, and a lie algebra structure on the S1 equivariant homology HS1 ⋆ (LM). This algebraic structure as well as the others came under the general heading of the string topology of M