Loading...
Search for: connectivity
0.015 seconds
Total 438 records

    Spectrum Mobility Analysis in Cognitive Radio Networks

    , M.Sc. Thesis Sharif University of Technology Sheikholeslami, Fatemeh (Author) ; Nasiri Kenari, Masoumeh (Supervisor)
    Abstract
    Opportunistic spectrum access in cognitive radio networks has introduced multiple challenges in the realization of this technology. One of these key challenges is spectrum mobility, in which a secondary user (SU) must be able to vacate channels upon the appearance of a primary user (PU) and reestablish a communication link to avoid service termination, known as spectrum handoff. For a connection-based modeling, multiple interruptions can occur, which lead to multiple handoffs; hence, in a proactive approach, a sequence of target channels, rather than a single target channel must be determined. The first parts of this thesisis dedicated to the analysis of a time-slotted cognitive radio, in... 

    Impact of Temperature on Efficiency of CNT and Copper Interconnects

    , M.Sc. Thesis Sharif University of Technology (Author) ; Sarvari, Reza (Supervisor)
    Abstract
    While digital IC technology scales down, the impact of size effects in copper interconnects become more important because wire dimensions reach the same order of electron mean free path yielding increased resistivity of metal due to surface and grain boundary scatterings. Hence, because of their longer MFP, Carbon nanotubes are proposed as potential candidates for replacing copper interconnects. Furthermore, wires, especially power and ground lines, are becoming more and more vulnerable to electromigration because of rapid grows in current densities which increases the temperature of IC and interconnects as well. Sub-ambient cooling has long been suggested for improving the performance of... 

    Riemann-Hilbert Correspondence Theorem

    , M.Sc. Thesis Sharif University of Technology Yousefzadehfard, Aydin (Author) ; Jafari, Amir (Supervisor)
    Abstract
    The Riemann- Hilbert correspondence theorem is a higher dimensional generalization of Hilbert’s 21st problem. The main problem was about existence of differential equations with regular singularities on Riemann sphere with a specific monodromy group. Deligne generalized the problem to algebraic connections with regular singularities. Kashiwara and Mebkhout independently generalized the theorem for derived category of D-modules. In this thesis, we will begin by studying this theorem in simple cases.In chapter 3 generalized version of the theorem by Deligne,will be introduced. At the end of the third chapter a proof of Riemann-Hilbert correspondence for the special case of projective curves... 

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

    Hemispheric asymmetry of electroencephalography-based functional brain networks

    , Article NeuroReport ; Volume 25, Issue 16 , 12 November , 2014 , Pages 1266-1271 ; ISSN: 09594965 Jalilia, M ; Sharif University of Technology
    Abstract
    Electroencephalography (EEG)-based functional brain networks have been investigated frequently in health and disease. It has been shown that a number of graph theory metrics are disrupted in brain disorders. EEG-based brain networks are often studied in the whole-brain framework, where all the nodes are grouped into a single network. In this study, we studied the brain networks in two hemispheres and assessed whether there are any hemispheric-specific patterns in the properties of the networks. To this end, resting state closed-eyes EEGs from 44 healthy individuals were processed and the network structures were extracted separately for each hemisphere. We examined neurophysiologically... 

    Performance of circular opening in beam web connections

    , Article Life Science Journal ; Volume 9, Issue 3 , 2012 , Pages 1377-1383 ; 10978135 (ISSN) Momenzadeh, S. B ; Sharif University of Technology
    Abstract
    Fragile behavior in the area around the connections which is tangent on beam to column and also incidence of brittle cracks and failures in this area, in the event of severe ground shaking, are the main problems and disadvantages that have negative effect on the performance of steel bending frames and would have restrictions effect on the of the frame's plasticity behavior. To solve the problem of bending the frame, two methods have been proposed. In the first method, the connection will be strengthened so that has enough resistance and sufficient strength to prevent cracks and failures to non-elastic deformation of the frame in the inner part of beams be answered. In the second method,... 

    On the cayley graph of a commutative ring with respect to its zero-divisors

    , Article Communications in Algebra ; Volume 44, Issue 4 , 2016 , Pages 1443-1459 ; 00927872 (ISSN) Aalipour, G ; Akbari, S ; Sharif University of Technology
    Taylor and Francis Inc 
    Abstract
    Let R be a commutative ring with unity and R+ and Z*(R) be the additive group and the set of all nonzero zero-divisors of R, respectively. We denote by ℂ𝔸𝕐(R) the Cayley graph Cay(R+, Z*(R)). In this article, we study ℂ𝔸𝕐(R). Among other results, it is shown that for every zero-dimensional nonlocal ring R, ℂ𝔸𝕐(R) is a connected graph of diameter 2. Moreover, for a finite ring R, we obtain the vertex connectivity and the edge connectivity of ℂ𝔸𝕐(R). As a result, ℂ𝔸𝕐(R) gives an algebraic construction for vertex transitive graphs of maximum connectivity. In addition, we characterize all zero-dimensional semilocal... 

    Evaluation of PR steel frame connection with torsional plate and its optimal placement

    , Article Scientia Iranica ; Volume 25, Issue 3A , 2018 , Pages 1025-1038 ; 10263098 (ISSN) Moghadam, A ; Estekanchi, H.E ; Yekrangnia, M ; Sharif University of Technology
    Sharif University of Technology  2018
    Abstract
    Characteristics of connections in steel moment-resisting frames are of utmost importance in determining the seismic performance of these structural systems. The results of several previous experimental studies have indicated that Partially Restrained (PR) connections possess excellent properties, which make them a reliable substitution for Fully Restrained (FR) connections. These properties include needing less base shear, being more economic, and, in many cases, being able to absorb more energy. In this study, the behavior of two proposed PR connections with torsional plate is studied through finite element simulations. The results of the numerical studies regarding initial stiffness and... 

    A set of particle locating algorithms not requiring face belonging to cell connectivity data

    , Article Journal of Computational Physics ; Volume 228, Issue 19 , 2009 , Pages 7357-7367 ; 00219991 (ISSN) Sani, M ; Saidi, M. S ; Sharif University of Technology
    2009
    Abstract
    Existing efficient directed particle locating (host determination) algorithms rely on the face belonging to cell relationship (F2C) to find the next cell on the search path and the cell in which the target is located. Recently, finite volume methods have been devised which do not need F2C. Therefore, existing search algorithms are not directly applicable (unless F2C is included). F2C is a major memory burden in grid description. If the memory benefit from these finite volume methods are desirable new search algorithms should be devised. In this work two new algorithms (line of sight and closest cell) are proposed which do not need F2C. They are based on the structure of the sparse... 

    Conditions for regularity and for 2-connectivity of Toeplitz graphs

    , Article Utilitas Mathematica ; Volume 110 , 2019 , Pages 305-314 ; 03153681 (ISSN) Akbari, S ; Ghorban, S. H ; Malik, S ; Qajar, S ; Sharif University of Technology
    Utilitas Mathematica Publishing Inc  2019
    Abstract
    Let 1 < ti < t2 < ••• < th < n. A Toeplitz graph G = (V,E) denoted by Tn(tiy ..., f) is a graph where V = {1,. .. ,n} and E = {(m) I i-JI. • • >}}•this paper, we classify all regular Toeplitz graphs. Here, we present some conditions under which a Toeplitz graph has no cut-edge and cut-vertex  

    Planar maximally entangled states

    , Article Physical Review A ; Volume 102, Issue 1 , 2020 Doroudiani, M ; Karimipour, V ; Sharif University of Technology
    American Physical Society  2020
    Abstract
    We construct a large family of planar maximally entangled (PME) states, which are a wider class of multipartite entangled states than absolutely maximally entangled (AME) states. These are states in which any half of the qudits are in a maximally mixed state, provided that they form a connected subset. We show that in contrast to AMEs, PMEs are easier to find and there are various PMEs for any even number of qudits. In particular, while it is known that no AME state of four qubits exists, we show that there are two distinct multiparameter classes of four-qubit PMEs. We also give explicit families of PMEs for any even number of particles and for any dimension. We also briefly mention the... 

    Effective brain connectivity estimation between active brain regions in autism using the dual Kalman-based method

    , Article Biomedizinische Technik ; Volume 65, Issue 1 , 2020 , Pages 23-32 Rajabioun, M ; Motie Nasrabadi, A ; Shamsollahi, M. B ; Coben, R ; Sharif University of Technology
    De Gruyter  2020
    Abstract
    Brain connectivity estimation is a useful method to study brain functions and diagnose neuroscience disorders. Effective connectivity is a subdivision of brain connectivity which discusses the causal relationship between different parts of the brain. In this study, a dual Kalman-based method is used for effective connectivity estimation. Because of connectivity changes in autism, the method is applied to autistic signals for effective connectivity estimation. For method validation, the dual Kalman based method is compared with other connectivity estimation methods by estimation error and the dual Kalman-based method gives acceptable results with less estimation errors. Then, connectivities... 

    Efficient parallel routing algorithms for cartesian and composition networks

    , Article 13th International Computer Society of Iran Computer Conference on Advances in Computer Science and Engineering, CSICC 2008, Kish Island, 9 March 2008 through 11 March 2008 ; Volume 6 CCIS , 2008 , Pages 299-307 ; 18650929 (ISSN); 3540899847 (ISBN); 9783540899846 (ISBN) Bakhshi, M ; Bakhshi, S ; Sarbazi Azad, H ; Sharif University of Technology
    2008
    Abstract
    The Cartesian and Composition products are two well known graph products, also applied to interconnection networks area. The Cartesian and Composition network products possess great characteristics of fault resilience according to their high connectivity. In this paper, we study the existence and construction of parallel routing paths in these two well-known product networks. To prove the existence of certain number of parallel paths in these product networks, we need to compute their connectivity. By assuming the availability of certain number of faulty nodes, we propose some new shortest-path parallel routing algorithms. These algorithms can be used both in faulty networks and to route... 

    Estimating data hiding capacity of gray scale images based on its bitplanes structure

    , Article 2008 4th International Conference on Intelligent Information Hiding and Multiedia Signal Processing, IIH-MSP 2008, Harbin, 15 August 2008 through 17 August 2008 ; 2008 , Pages 261-264 ; 9780769532783 (ISBN) Yagmaee, F ; Jamzad, M ; Sharif University of Technology
    2008
    Abstract
    Determining the capacity of image for data hiding is a complex task. This capacity may be influenced by many factors such as the content of image and also Human Visual System (HVS). A few works on this topic are reported. In this paper we propose a new method for calculating capacity in gray scale images. Our method is based on measuring Smoothness and Connectivity of neighbors of a specific pixel in image bitplanes. This method can produce a signed integer for each pixel capacity such that the sign shows the modification in pixel value must be increasing or decreasing. Comparison with the existing methods showed that the proposed method gave better estimation for capacity of data hiding in... 

    A novel approach to determine minimal tie-sets of complex network

    , Article IEEE Transactions on Reliability ; Volume 53, Issue 1 , 2004 , Pages 61-70 ; 00189529 (ISSN) Fotuhi Firuzabad, M ; Billinton, R ; Munian, T. S ; Vinayagam, B ; Sharif University of Technology
    2004
    Abstract
    Network reliability analysis is usually based on minimal path or cut enumeration from which the associated reliability expressions are deduced. The cut-set method is a popular approach in the reliability analysis of many systems from simple to complex configurations. The computational requirements necessary to determine the minimal cut-sets of a network depend mainly on the number of minimal paths between the source and the sink. A technique designated as the "Path Tracing Algorithm" is presented in this paper, which can handle both simple and complex networks, and considers both unidirectional and bi-directional branches. A step by step procedure is explained using a bridge-network. The... 

    Accurate fault location algorithm for power transmission lines

    , Article European Transactions on Electrical Power ; Volume 10, Issue 5 , 2000 , Pages 313-318 ; 1430144X (ISSN) Sadeh, J ; Ranjbar, A. M ; Hadjsaid, N ; Feuillet, R ; Sharif University of Technology
    John Wiley and Sons Ltd  2000
    Abstract
    In this paper we propose a new fault location algorithm for power transmission lines based on one terminal voltage and current data. A distributed time domain model of the line is used as a basis for algorithm development. The suggested technique only takes advantage of post-fault voltage and current samples taken at one end of the line and does not require filtering of DC offset and high-frequency components of the recorded signals, which are present during transient conditions. Another advantage of the proposed method is the application of a very narrow window of data i. e. less than 1/4 of a cycle. The paper also proposes two different algorithms for lossless and lossy line models.... 

    Analytical Evaluation of Moment Resisting Precast Concrete Beam to Column Connections by Finite Element Method

    , M.Sc. Thesis Sharif University of Technology Bakhtiari Doost, Roohollah (Author) ; Khalu, Alireza (Supervisor)
    Abstract
    In this thesis, the behavior of proposed moment resisting precast beam-column concrete connection under cyclic and monotonic loads is investigated. In this study, the finite element models of precast and monolithic middle and corner connections are created. The results of finite element analysis under cyclic loading is verified with existing experimental results based on failure mode, ductility, energy dissipation capacity and flexural strength. Based on the results of nonlinear finite element analysis, the analytical behavior of samples is in good agreement with experimental results and finite element analysis of proposed precast connection can be replaced with supplementary tests. Then the... 

    Ductility Analysis of L & T Shaped Wall to Wall Connections of 3D Panels Subjected to Lateral & Gravity Loading

    , M.Sc. Thesis Sharif University of Technology Sangaki, Amir Hossein (Author) ; Vafaei, Abolhassan (Supervisor) ; Kabir, Mohammad Zaman (Supervisor)
    Abstract
    Iran requires basic changes in using construction materials and industrial system of house production due to its particular climatic conditions such as being located on the earthquake belt and social conditions such as lack of house. 3D panel is one of the best options for industrial construction and especially mass building.
    In this thesis, different suggested designs for L & T shaped wall to wall connections of 3D panel under lateral-cyclic and gravity loading were modeled and analyzed by ANSYS software. Numerical analysis indicates that concrete perpendicular hank and welded wire mesh WWF 3/3/50/50 have positive effect on the ultimate strength and ductility of the connection. Hence,... 

    An Investigation on the Behavior of Bolted Connections using Friction Drilling in Shear and Tension

    , M.Sc. Thesis Sharif University of Technology Ashrafi, Abolfazl (Author) ; Ahmadizadeh, Mehdi (Supervisor)
    Abstract
    Friction drilling or flow drilling is a method of making holes in metal sheets, in which the material is pushed with the aid of heat from friction. This procedure allows making holes in sheet metal, with a sleeve formed as the hole is created. This sleeve is then threaded and used as the nut, thus eliminating the need for access to the interior faces of hollow steel sections. On the other hand, with the development of advanced manufacturing techniques, larger and thicker hollow structural sections are becoming more popular in mid-rise and multistory structures. onsequently, flow drilling can be considered as a viable alternative for traditional drilling techniques, where the material is... 

    A Parametric Study on Application and Analysis of Beam to Column "Reversed Channel" Connection in Tubular Systems

    , M.Sc. Thesis Sharif University of Technology Kokabi, Sina (Author) ; Mofid, Massoud (Supervisor)
    Abstract
    Today steel tubular systems are used more than before, especially in recent years. A difficulty with this type of systems is making beam to column connections using bolts due to no access to holes of bolts from the inside of tube or hollow circular column. Reverse channel connection is devised and introduced to prevail this problem. Access to holes in this connection is from the inside of channel. In this connection, the web of the channel is connected to steel beam using bolts and the two legs of channel is welded to face of tube column.
    This type of connection does include some innovations; not too many researchers work on different versions of this connection. This thesis provides an...