Loading...
Search for: mathematical-operators
0.006 seconds
Total 51 records

    Wireless multicasting using network coding

    , Article 2006 1st Workshop on Operator-Assisted (Wireless-Mesh) Community Networks, OpComm 2006, Berlin, 18 September 2006 through 19 September 2006 ; 2006 ; 1424406927 (ISBN); 9781424406920 (ISBN) Eslami, A ; Khalaj, B. H ; Sharif University of Technology
    2006
    Abstract
    In this paper, we consider the network coding in networks with broadcast channels (called hypernetworks) as the first step for applying network coding to wireless networks. We first prove a Max-Flow Min-Cut theorem for such networks. While we propose an algorithm to achieve this bound, we will introduce new definitions and provide sufficient tools to extend many of the theorems stated for flows in wireline networks to the case of hypernetworks. As an example, we will extend the Max-Flow Min-Cut condition for feasibility of the point-to-point connection in wireline networks to the case of hypernetworks. Then, we will extend the algebraic approach of Koetter and Medard in [3] to the... 

    A non-linear mapping representing human action recognition under missing modality problem in video data

    , Article Measurement: Journal of the International Measurement Confederation ; Volume 186 , 2021 ; 02632241 (ISSN) Gharahdaghi, A ; Razzazi, F ; Amini, A ; Sharif University of Technology
    Elsevier B.V  2021
    Abstract
    Human action recognition by using standard video files is a well-studied problem in the literature. In this study, we assume to have access to single modality standard data of some actions (training data). Based on this data, we aim at identifying the actions that are present in a target modality video data without any explicit source–target relationship information. In this case, the training and test phases of the recognition task are based on different imaging modalities. Our goal in this paper is to introduce a mapping (a nonlinear operator) on both modalities such that the outcome shares some common features. These common features were then used to recognize the actions in each domain.... 

    Quantum CDMA communication systems

    , Article IEEE Transactions on Information Theory ; Volume 67, Issue 8 , 2021 , Pages 5526-5547 ; 00189448 (ISSN) Rezai, M ; Salehi, J. A ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2021
    Abstract
    Barcoding photons, atoms, and any quantum states can provide a host of functionalities that could benefit future quantum communication systems and networks beyond today's imagination. As a significant application of barcoding photons, we introduce code division multiple-access (CDMA) communication systems for various applications. In this context, we introduce and discuss the fundamental principles of a novel quantum CDMA (QCDMA) technique based on spectrally encoding and decoding of continuous-mode quantum light pulses. In particular, we present the mathematical models of various QCDMA modules that are fundamental in describing an ideal and typical QCDMA system, such as quantum signal... 

    A recursive approach for analysis of snake robots using Kane's equations

    , Article DETC2005: ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conference, Long Beach, CA, 24 September 2005 through 28 September 2005 ; Volume 7 B , 2005 , Pages 855-861 ; 0791847446 (ISBN) Tavakoli Nia, H ; Pishkenari, H. N ; Meghdari, A ; Sharif University of Technology
    2005
    Abstract
    This paper presents a recursive approach for solving kinematic and dynamic problem in snake-like robots using Kane's equations. An n-link model with n-nonholonomic constraints is used as the snake robot model in our analysis. The proposed algorithm which is used to derive kinematic and dynamic equations recursively enhances the computational efficiency of our analysis. Using this method we can determine the number of additions and multiplications as a function of n. The proposed method is compared with the Lagrange and Newton-Euler's method in three different aspects: Number of operations, CPU time and error in the computational procedures. Copyright © 2005 by ASME  

    On the computational complexity of defining sets

    , Article Discrete Applied Mathematics ; Volume 149, Issue 1-3 , 2005 , Pages 101-110 ; 0166218X (ISSN) Hatami, H ; Maserrat, H ; Sharif University of Technology
    2005
    Abstract
    Suppose we have a family F of sets. For every S∈F, a set D⊆S is a defining set for (F,S) if S is the only element of F that contains D as a subset. This concept has been studied in numerous cases, such as vertex colorings, perfect matchings, dominating sets, block designs, geodetics, orientations, and Latin squares. In this paper, first, we propose the concept of a defining set of a logical formula, and we prove that the computational complexity of such a problem is Σ2-complete. We also show that the computational complexity of the following problem about the defining set of vertex colorings of graphs is Σ2-complete: INSTANCE: A graph G with a vertex coloring c and an integer k.QUESTION: If... 

    Characterization of two-qubit perfect entanglers

    , Article Physical Review A - Atomic, Molecular, and Optical Physics ; Volume 70, Issue 5 A , 2004 , Pages 052313-1-052313-9 ; 10502947 (ISSN) Rezakhani, A. T ; Sharif University of Technology
    2004
    Abstract
    The problem of the characterization of perfect entanglers was investigated. Perfect entanglers have been defined as unitary operators that can generate maximally entangled states from some suitably chosen separable states. Some well defined tools have also been used to measure the entangling properties of quantum operators and two-qubit states. It was found that such tools help to analyze perfect entanglers and also have the unique property of maximally entangling a complete set of orthonormal product vectors. The results show that the qubit gates provided minimum universal gate construction and two of them were necessary and sufficient in implementation of a generic two-qubit gate  

    Thermal entanglement of spins in the Heisenberg model at low temperatures

    , Article Physical Review A - Atomic, Molecular, and Optical Physics ; Volume 70, Issue 5 A , 2004 , Pages 052307-1-052307-5 ; 10502947 (ISSN) Asoudeh, M ; Karimipour, V ; Sharif University of Technology
    2004
    Abstract
    The entanglement between two spins in the ferromagnetic Heisenberg chain at low temperatures was calculated. It was shown that if a magnetic field is applied to a ferromagnetic Heisenberg chain, then pairwise entanglement develops between spins at arbitrary given states. It was also shown that the entanglement profile is a Gaussian with a characteristic length depending on the temperature and the coupling between spins only when the ground state and the one-particle states are populated. The magnetic field was shown to affect only the amplitude of the profile and not its characteristic length  

    Exact solutions for universal holonomic quantum gates

    , Article Physical Review A - Atomic, Molecular, and Optical Physics ; Volume 70, Issue 1 , 2004 , Pages 012320-1-012320-5 ; 10502947 (ISSN) Karimipour, V ; Majd, N ; Sharif University of Technology
    American Physical Society  2004
    Abstract
    Implementation of local quantum gate on specific qubits in an array of qubits by carrying a Hamiltonian around a closed loop is discussed. A family of isospectral Hamiltonians with the same spectrum of the projection operator on the main array is constructed by choice of a suitable curve. For every single qubit gate acting on the k-th qubit, a local operator Xk acts nontrivially on the ancilla and the qubit. Imbedding appropriate operators for a suitable set of qubit gates comprises of a universal set of quantum gates. In tensor product of the array one can enact holonomically any set of gates on any subset of qubits  

    Stochastic analysis and regeneration of rough surfaces

    , Article Physical Review Letters ; Volume 91, Issue 22 , 2003 ; 00319007 (ISSN) Jafari, G.R ; Fazeli, S. M ; Ghasemi, F ; Vaez Allaei, S. M ; Rahimi Tabar, M ; Iraji zad, A ; Kavei, G ; Sharif University of Technology
    2003
    Abstract
    We investigate the Markov property of rough surfaces. Using stochastic analysis, we characterize the complexity of the surface roughness by means of a Fokker-Planck or Langevin equation. The obtained Langevin equation enables us to regenerate surfaces with similar statistical properties compared with the observed morphology by atomic force microscopy. © 2003 The American Physical Society  

    Stability analysis of the Euler-Bernoulli beam with multi-delay controller

    , Article Control Theory and Technology ; Volume 20, Issue 3 , 2022 , Pages 338-348 ; 20956983 (ISSN) Jalili Rahmtati, A ; Xu, G ; Effati, S ; Sharif University of Technology
    South China University of Technology  2022
    Abstract
    In this paper, we investigate the stabilization of an Euler-Bernoulli beam with time delays in the boundary controller. The boundary velocity feedback law is applied to obtain the closed-loop system. It is shown that this system generates a C-semigroup of linear operators. Moreover, the stability of the closed-loop system is discussed for different values of the controller constants and time delays via using spectral analysis and a suitable Lyapunov function. © 2022, The Author(s), under exclusive licence to South China University of Technology and Academy of Mathematics and Systems Science, Chinese Academy of Sciences  

    Multiscale modeling of coupled thermo-hydro-mechanical analysis of heterogeneous porous media

    , Article Computer Methods in Applied Mechanics and Engineering ; Volume 391 , 2022 ; 00457825 (ISSN) Saeedmonir, S ; Khoei, A. R ; Sharif University of Technology
    Elsevier B.V  2022
    Abstract
    This paper presents a numerical multiscale formulation for analysis of the transient heat and fluid flow in deformable heterogeneous porous media. Due to the heterogeneity of the media, the direct numerical simulation of the micro-structures leads to high computational costs. Hence, the multi-scale method can provide an efficient computational procedure. To this end, the first-order computational homogenization is adopted for two-scale simulation of THM problems. The governing equations of the problem contain a stress equilibrium equation, a mass continuity equation and an advection–diffusion equation in a fully coupled manner. Accordingly, the proper virtual power relations are defined as a...