Loading...
Search for:
voronoi-cell
0.006 seconds
Extended hexagonal constellations as a means of multicarrier PAPR reduction
, Article 1st EurAsian Conference on Advances in Information and Communication Technology, EurAsia-ICT 2002, Shiraz, 29 October 2002 through 31 October 2002 ; Volume 2510 LNCS , 2002 , Pages 926-936 ; 03029743 (ISSN); 3540000283 (ISBN); 9783540000280 (ISBN) ; Khalaj, B. H ; Sharif University of Technology
Springer Verlag
2002
Abstract
An efficient, easy to implement method for OFDM and DMT Peak to Average Power Ratio (PAPR) reduction is proposed based on constellation extension. A PAPR reduction of more than 5 dB at clip rate of 10-5, is achieved with no rate loss and improved noise margin with low complexity. Various versions of the proposed method have been studied and compared in terms of PAPR reduction, complexity and average power, with each other and earlier methods. © Springer-Verlag Berlin Heidelberg 2002
Microstructure generation of severely deformed materials using Voronoi diagram in Laguerre geometry: Full algorithm
, Article Computational Materials Science ; Volume 50, Issue 9 , July , 2011 , Pages 2698-2705 ; 09270256 (ISSN) ; Kazeminezhad, M ; Sharif University of Technology
2011
Abstract
A new Voronoi diagram in Laguerre geometry based on closed-pack non-overlapping circles was proposed. This diagram was used to simulate microstructure of severely deformed materials at different applied strains. Grains size and their fractions were introduced by controlling the size and distribution of nuclei. Edge number distribution and neighboring cells edge number along with area distribution of the simulated Voronoi cells were determined. The edge number distribution was observed to fit gamma distribution more accurately. However, due to high inhomogeneity in the microstructure of the deformed samples at low strains, edge number distribution could not be matched by any distribution...
Deployment of multi-agent robotic systems in presence of obstacles
, Article ASME 2010 10th Biennial Conference on Engineering Systems Design and Analysis, ESDA2010, 12 July 2010 through 14 July 2010, Istanbul ; Volume 5 , 2010 , Pages 7-12 ; 9780791849194 (ISBN) ; Sayyaadi, H ; Sharif University of Technology
2010
Abstract
The deployment of multi-agent systems in presence of obstacle deals with autonomous motion of agents toward a specified target by sensing each other and boundaries of obstacles. In this paper, asynchronous, scalable, distributed algorithm is used to deploy agents. Boundaries of obstacles are modeled by virtual agents. Algorithm was implemented by solving continuous n-median problem called generalized Fermat-Weber problem. It is shown that deployment is performed when position of real agents are the geometric median of their Voronoi cells. Simulation results show the validity of the proposed algorithm very well
Facility location optimization via multi-agent robotic systems
, Article 2008 IEEE International Conference on Networking, Sensing and Control, ICNSC, Sanya, 6 April 2008 through 8 April 2008 ; 2008 , Pages 287-292 ; 9781424416851 (ISBN) ; Sayyaadi, H ; Sharif University of Technology
2008
Abstract
A facility location problem deals with locating the best place for a group of facilities, among distinct demand points, minimizing a certain locational optimization function. In this paper, distributed, asynchronous, and scalable algorithms are presented for solving a facility location problem known as continuous n-median problem (generalized Fermat-Weber problem) via multi-agent robotic systems. The algorithms are discussed both in continuous and discrete time domain, and their validity is proved. It is also shown that the solution of this facility location problem is the set of points that are the geometric medians of their corresponding Voronoi cells