Loading...
Search for:
alishahi--k
0.105 seconds
Total 2733 records
Generalized differential transfer matrix for fast and efficient analysis of arbitrary-shaped nonlinear distributed feedback structures
, Article IEEE Journal of Quantum Electronics ; Volume 45, Issue 2 , 2009 , Pages 125-131 ; 00189197 (ISSN) ; Mehrany, K ; Sharif University of Technology
2009
Abstract
A new, fast, and efficient approach based on the differential transfer matrix idea, is proposed for analysis of nonuniform nonlinear distributed feedback structures. The a priori knowledge of the most-likely electromagnetic field distribution within the distributed feedback region is exploited to speculate and factor out the rapidly varying portion of the electromagnetic fields. In this fashion, the transverse electromagnetic fields are transformed into a new set of envelope functions, whereupon the numerical difficulty of solving the nonlinear coupled differential equations is partly imparted to the analytical factorization of the fields. This process renders a new set of well-behaved...
Analysis of k-Neigh topology control protocol for wireless networks
, Article 22nd International Conference on Advanced Information Networking and Applications Workshops/Symposia, AINA 2008, Gino-wan, Okinawa, 25 March 2008 through 28 March 2008 ; 2008 , Pages 904-909 ; 1550445X (ISSN) ; 0769530966 (ISBN); 9780769530963 (ISBN) ; Sarbazi Azad, H ; Alishahi, K ; Sharif University of Technology
2008
Abstract
k-Neigh is a basic neighbor-based topology control protocol based on the construction of k-neighbor graph as logical communication graph. Although k-Neigh is based on a connectivity theory, several topological aspects of the constructed topology are not yet analytically investigated. In this paper, several topological properties of the constructed topology after execution of the protocol, including probability density function of the distance between each node to its ith neighbor, probability of unidirectional links after execution of the first phase of the protocol, average logical degree, and average final transmission range, are investigated analytically. Moreover, an extensive simulation...
A class of errorless codes for overloaded synchronous wireless and optical CDMA systems
, Article IEEE Transactions on Information Theory ; Volume 55, Issue 6 , 2009 , Pages 2705-2715 ; 00189448 (ISSN) ; Marvasti, F ; Alishahi, K ; Akbari, S ; Sharif University of Technology
2009
Abstract
In this paper, we introduce a new class of codes for overloaded synchronous wireless and optical code-division multiple-access (CDMA) systems which increases the number of users for fixed number of chips without introducing any errors. Equivalently, the chip rate can be reduced for a given number of users, which implies bandwidth reduction for downlink wireless systems. An upper bound for the maximum number of users for a given number of chips is derived. Also, lower and upper bounds for the sum channel capacity of a binary overloaded CDMA are derived that can predict the existence of such overloaded codes. We also propose a simplified maximum likelihood method for decoding these types of...
Capacity achieving linear codes with random binary sparse generating matrices over the binary symmetric channel
, Article IEEE International Symposium on Information Theory - Proceedings ; 2012 , Pages 621-625 ; 9781467325790 (ISBN) ; Abadi, H. K ; Pad, P ; Saeedi, H ; Marvasti, F ; Alishahi, K ; Sharif University of Technology
IEEE
2012
Abstract
In this paper, we prove the existence of capacity achieving linear codes with random binary sparse generating matrices over the Binary Symmetric Channel (BSC). The results on the existence of capacity achieving linear codes in the literature are limited to the random binary codes with equal probability generating matrix elements and sparse parity-check matrices. Moreover, the codes with sparse generating matrices reported in the literature are not proved to be capacity achieving for channels other than Binary Erasure Channel. As opposed to the existing results in the literature, which are based on optimal maximum a posteriori decoders, the proposed approach is based on a different decoder...
Dependency of codon usage on protein sequence patterns: A statistical study
, Article Theoretical Biology and Medical Modelling ; Vol. 11, issue. 1 , 2014 ; ISSN: 17424682 ; Goliaei, B ; Alishahi, K ; Sadeghi, M ; Sharif University of Technology
2014
Abstract
Background: Codon degeneracy and codon usage by organisms is an interesting and challenging problem. Researchers demonstrated the relation between codon usage and various functions or properties of genes and proteins, such as gene regulation, translation rate, translation efficiency, mRNA stability, splicing, and protein domains. Researchers usually represent segments of proteins responsible for specific functions or structures in a family of proteins as sequence patterns or motifs. We asked the question if organisms use the same codons in pattern segments as compared to the rest of the sequence. Methods. We used the likelihood ratio test, Pearson's chi-squared test, and mutual information...
Approximate expressions for resonant shifts in the reflection of Gaussian wave packets from two-dimensional photonic crystal waveguides
, Article Journal of the Optical Society of America B: Optical Physics ; Volume 29, Issue 4 , 2012 , Pages 683-690 ; 07403224 (ISSN) ; Khavasi, A ; Alishahi, F ; Mehrany, K ; Rashidian, B ; Sharif University of Technology
Optical Society of American (OSA)
2012
Abstract
In this paper, enhanced spatial and temporal shifts in the reflection of Gaussian wave packets from twodimensional photonic crystal waveguides supporting above-the-light-line leaky modes are studied, for the first time to our best knowledge. Particular attention is given to two important special cases, namely, harmonic Gaussian beams and Gaussian-pulse uniform plane waves. Analytical expressions are given for enhanced spatial and temporal shifts when the stationary phase approximation holds and the incident wave excites above-the-light-line leaky modes. The enhanced spatial and temporal shifts of Gaussian wave packets are thereby related to each other via the group velocity of the excited...
Data quality improvement using fuzzy association rules
, Article ICEIE 2010 - 2010 International Conference on Electronics and Information Engineering, Proceedings, 1 August 2010 through 3 August 2010 ; Volume 1 , August , 2010 , Pages V1468-V1472 ; 9781424476800 (ISBN) ; Pedram, M. M ; Alishahi, M ; Badie, K ; Sharif University of Technology
2010
Abstract
The activities and decisions of organizations and companies are based on data and the information obtained from data analysis. Data quality plays a crucial role in data analysis, because the incorrect data leads to wrong decisions. Nowadays, improving the data quality manually is very difficult and in many cases is impossible as data quality is one of the complicated and non-structured concepts and data refinement process can not be done without the help of professional domain experts, and detection and correction of errors require a thorough knowledge in the related domain of the data. Thus, the necessity of using (semi-)automatic methods is discussed to find data defects and errors and...
One-hop throughput of wireless networks with random connections
, Article IEEE Wireless Communications Letters ; Volume 1, Issue 3 , 2012 , Pages 205-208 ; 21622337 (ISSN) ; Khalaj, B. H ; Alishahi, K ; Shah Mansouri, H ; Sharif University of Technology
2012
Abstract
We consider one-hop communication in wireless networks with random connections. In the random connection model, the channel powers between different nodes are drawn from a common distribution in an i.i.d. manner. In a wireless network with n nodes, a simple one-hop scheme achieving the throughput scaling of order n 1/3-δ, for any arbitrarily small δ > 0, is proposed. This scheme is based on maximizing the number of successful concurrent transmissions. Such achievable throughput, along with the order n 1/3 upper bound derived by Cui et al., characterizes the throughput of one-hop schemes for the class of connection models with distribution having finite mean and variance
Throughput of Large One-Hop Ad Hoc Wireless Networks With General Fading
, Article IEEE Transactions on Vehicular Technology ; Volume 64, Issue 7 , 2015 , Pages 3304-3310 ; 00189545 (ISSN) ; Khalaj, B. H ; Alishahi, K ; Shah Mansouri, H ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2015
Abstract
We consider the problem of determining throughput of one-hop unicast transmissions in ad hoc wireless networks. We consider an interference-limited scenario in which wireless links between different nodes are modeled by independently and identically distributed random variables. The main decoding challenge for receive nodes is due to interference of nonintended concurrent transmissions. In this scenario, we consider a heuristic one-hop transmission strategy based on activating source-destination pairs with strongest direct links and forcing other pairs to be silent. We present a closed-form expression for throughput scaling of such strategy, for a completely general channel power...
Mapping dispersion fluctuations along optical fibers using brillouin probing and a fast analytic calculation
, Article 2013 Conference on Lasers and Electro-Optics, CLEO ; 2013 ; 9781557529725 (ISBN) ; Vedadi, A ; Denisov, A ; Soto, M. A ; Mehrany, K ; Bres, C. S ; Thevenaz, L
2013
Abstract
A simple analytic formula is derived to extract tiny dispersion fluctuations along highly nonlinear fibers from distributed measurements of parametric gain. A refined BOTDA scheme, suitable to track Kerr processes, enables low noise measurements
Sensitive and accurate dispersion map extraction of HNLFs by frequency tuning of a degenerate FWM
, Article Journal of Lightwave Technology ; Volume 34, Issue 18 , 2016 , Pages 4197-4204 ; 07338724 (ISSN) ; Vedadi, A ; Shoaie, M. A ; Bres, C. S ; Mehrany, K ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2016
Abstract
A sensitive and accurate method for dispersion map extraction along an arbitrarily profiled highly nonlinear fiber (HNLF) is proposed. High sensitivity is achieved by positioning the wavelength of a signal at the band edge of the modulation instability (MI) spectrum generated by an intense degenerate four wave mixing (FWM) pump. In doing so, the to-be-extracted dispersion fluctuations leave a more drastic effect on the FWM-generated power since they either inflate or deflate the MI spectrum. The accuracy of the method is increased by monitoring the distribution of power along the fiber. Once the power distribution is measured along the fiber, dispersion map of the HNLF is extracted using an...
Codon usage and protein sequence pattern dependency in different organisms: A Bioinformatics approach
, Article Journal of Bioinformatics and Computational Biology ; Volume 13, Issue 2 , April , 2015 ; 02197200 (ISSN) ; Goliaei, B ; Alishahi, K ; Sadeghi, M ; Goliaei, S ; Sharif University of Technology
World Scientific Publishing Co. Pte Ltd
2015
Abstract
Although it is known that synonymous codons are not chosen randomly, the role of the codon usage in gene regulation is not clearly understood, yet. Researchers have investigated the relation between the codon usage and various properties, such as gene regulation, translation rate, translation efficiency, mRNA stability, splicing, and protein domains. Recently, a universal codon usage based mechanism for gene regulation is proposed. We studied the role of protein sequence patterns on the codons usage by related genes. Considering a subsequence of a protein that matches to a pattern or motif, we showed that, parts of the genes, which are translated to this subsequence, use specific ratios of...
The spherical ensemble and uniform distribution of points on the sphere
, Article Electronic Journal of Probability ; Volume 20 , 2015 , 23, 27 pp ; 10836489 (ISSN) ; Zamani, M ; Sharif University of Technology
University of Washington
2015
Abstract
The spherical ensemble is a well-studied determinantal process with a fixed number of points on $2. The points of this process correspond to the generalized eigenvalues of two appropriately chosen random matrices, mapped to the surface of the sphere by stereographic projection. This model can be considered as a spherical analogue for other random matrix models on the unit circle and complex plane such as the circular unitary ensemble or the Ginibre ensemble, and is one of the most natural constructions of a (statistically) rotation invariant point process with repelling property on the sphere. In this paper we study the spherical ensemble and its local repelling property by investigating the...
Volume degeneracy of the typical cell and the chord length distribution for Poisson-Voronoi tessellations in high dimensions
, Article Advances in Applied Probability ; Volume 40, Issue 4 , July , 2008 , Pages 919-938 ; 00018678 (ISSN) ; Sharifitabar, M ; Sharif University of Technology
2008
Abstract
This paper is devoted to the study of some asymptotic behaviors of Poisson-Voronoi tessellation in the Euclidean space as the space dimension tends to ∞. We consider a family of homogeneous Poisson-Voronoi tessellations with constant intensity λ in Euclidean spaces of dimensions n = 1, 2, 3,... First we use the Blaschke-Pètkantschin formula to prove that the variance of the volume of the typical cell tends to 0 exponentially in dimension. It is also shown that the volume of intersection of the typical cell with the co-centered ball of volume u converges in distribution to the constant λ-1 (1-e-λu). Next we consider the linear contact distribution function of the Poisson-Voronoi tessellation...
Using Data Mining in Production Information Systems
, M.Sc. Thesis Sharif University of Technology ; Hooshmand, Mahmoud (Supervisor)
Abstract
Nowadays, because of high volume and growth of data in industrial organizations and productive factories, registration and storing of data have forgotten manual and tradition styles for which using automation and mechanized machinery and systems has been a necessary task. In order to reach to this revolution, need to some tools, facilities and methods which can fulfill this requirement is felt strongly. Therefore, high volume of data is considered as an advantage because based on precise analysis it is possible to make logical management decisions with less risk. During last years, statistical and numerical methods and simulation were used to discover knowledge and information when one of...
Random Polytopes
, M.Sc. Thesis Sharif University of Technology ; Alishahi, Kasra (Supervisor)
Abstract
Random Polytopes, the first occurrence of which dates back to the famous Sylvester’s four points problem in the 1860s, is a branch of geometric probability, typically concerning the convex hull of some random points chosen from a convex subset of Rd. In this thesis we have studied some special kind of random polytopes; the one that is the convex hull of some independent random points chosen from a convex body (a convex, compact set with interior point) according to the uniform distribution. It was a new approach from A. Rényi and R. Sulanke in 1963 to consider this type when the number of random points tends to infinity.This thesis consists of three main parts: The first part is devoted to...
Generating Random Points in a Convex Body in High Dimensions
, M.Sc. Thesis Sharif University of Technology ; Alishahi, Kasra (Supervisor)
Abstract
“How can we generate a random point with uniform distribution over a convex body ?” According to it’s applications, it’s important for a solution to this problem to be applicable in high dimensions. Here, we are interested in algorithms with polynomial order with respect to the dimension. All existing methods for dealing with this problem are based on the Markov chain Monte Carlo method, i.e. a random walk is constructed in such that its stationary distribution is the uniform distribution over. Then, after simulating “enough” steps of this random walk, the distribution of the resulting point is “approximately” uniform. The real problem in Monte Carlo method is analyzing its “mixing time”,...
Simultaneous Hypothesis Testing and False Discovery Rate
, M.Sc. Thesis Sharif University of Technology ; Alishahi, Kasra (Supervisor)
Abstract
The purpose of this thesis is to introduce and review a recent methods in simultaneous hypothesis testing. False discovery rates, Benjamini and Hochberg’s FDR Control Algorithm, is the great success story of the new methodology. Much of what follows is an attempt to explain that success in empirical Bayes terms.The later chapters are at pains to show the limitations of current largescale statistical practice: Which cases should be combined in a single analysis? How do we account for notions of relevance between cases? What is the correct null hypothesis? How do we handle correlations? Some helpful theory is provided in answer, but much of the argumentation is by example, with graphs and...
Determinantal Processes
, M.Sc. Thesis Sharif University of Technology ; Alishahi, Kasra (Supervisor)
Abstract
Determinantal processes are a special family of stochastic processes that arise in physics (fermions), random matrices (eigenvalues), and in combinatorics (random spanning trees and non-intersecting paths). These processes have repelling property (points close to each other are chosen with low probability). Because of this repelling property, determinantal processes are approporiat for modeling some physical quantities (e.g. the position of electrons). Their probabilistic structure is described by operators on complex vector spaces and their eigenvalues. Determinantal processes have interesting properties, e.g. number of points in a region is a sum of independent Bernoulli random variables....
Cramér’s Model for Random Primes
, M.Sc. Thesis Sharif University of Technology ; Alishahi, Kasra (Supervisor)
Abstract
With Cramer’s model we have a probability measure on the power set of N. This probability measure is concentrated on the set that its elements are that subsets of N which number of their elements up to a certain natural number is asymptotically equal with the number of primes up to the same number. Let Pc be a sample obtained from this probability measure and consider 8n 2 N, an counts the number of ways that ncan be represented as a multiplication of some elements of Pc, such that changing the arrangement of factors in a representation does not introduce a new one. In this thesis, we prove that limn!1 a1++an n almost surely exists and is positive