Loading...
Search for:
bygi--m--n
0.137 seconds
Total 21656 records
Weak visibility queries in simple polygons
, Article Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011 ; 2011 ; Ghodsi, M ; Sharif University of Technology
2011
Abstract
In this paper, we consider the problem of computing the weak visibility (WV ) of a query line segment in- side a simple polygon. Our algorithm first preprocesses the polygon and creates data structures from which any WV query is answered efficiently in an output sensitive manner. In our solution, the preprocessing is performed in time O(n3 log n) and the size of the constructed data structure is O(n3). It is then possible to report the WV polygon of any query line segment in time O(log n+k), where k is the size of the output. Our algorithm im- proves the current results for this problem
Near optimal line segment queries in simple polygons
, Article Journal of Discrete Algorithms ; Volume 35 , November , 2015 , Pages 51-61 ; 15708667 (ISSN) ; Ghodsi, M ; Sharif University of Technology
Elsevier
2015
Abstract
This paper considers the problem of computing the weak visibility polygon (WVP) of any query line segment pq (or WVP(pq)) inside a given simple polygon P. We present an algorithm that preprocesses P and creates a data structure from which WVP(pq) is efficiently reported in an output sensitive manner. Our algorithm needs O(n2log n) time and O(n2) space in the preprocessing phase to report WVP(pq) of any query line segment pq in time O(|WVP(pq)|+log2 n+κlog2 (nκ)), where κ is an input and output sensitive parameter of at most |WVP(pq)|. We improve the preprocessing time and space of current results for this problem [11,6] at the expense of more query time
Visibility of a moving segment observer
, Article 2009 14th International CSI Computer Conference, CSICC 2009, 20 October 2009 through 21 October 2009 ; 2009 , Pages 152-157 ; 9781424442621 (ISBN) ; Ghodsi, M ; Sharif University of Technology
2009
Abstract
In this paper we study combinatorial segment visibility, and show how to compute and maintain it as the observer moves in the plane. There are n non-overlapping convex objects in the plane, and we have a segment observer among them. We first consider static case of the problem, in which the observer and objects are static, and then we study dynamic case of the problem, in which the observer can move among obstacles. ©2009 IEEE
Visibility of a moving segment
, Article Proceedings of the 2009 International Conference on Computational Science and Its Applications, ICCSA 2009, 29 June 2009 through 2 July 2009, Yongin ; 2009 , Pages 169-176 ; 9780769537016 (ISBN) ; Ghodsi, M ; Sharif University of Technology
2009
Abstract
In this paper we define topological segment visibility, and show how to compute and maintain it as the observer moves in the plane. There are n non-intersecting line segment objects in the plane, and we have a segment observer among them. As the topological visibility of a line segment has not been studied before, we first consider static case of the problem, in which the observer and objects are static, and then we study dynamic case of the problem, in which the observer can move among obstacles
Weak visibility queries of line segments in simple polygons and polygonal domains
, Article International Journal of Computer Mathematics ; Volume 95, Issue 4 , 2018 , Pages 721-738 ; 00207160 (ISSN) ; Ghodsi, M ; Sharif University of Technology
Taylor and Francis Ltd
2018
Abstract
In this paper we consider the problem of computing the weak visibility polygon of a query line segment pq (or WVP(pq)) inside a given polygon P. Our first algorithm runs in simple polygons and needs O(n3 log n) time and O(n3) space in the preprocessing phase to report WVP(pq) of any query line segment pq in time O(log n + |WVP(pq)|).. We also give an algorithm to compute the weak visibility polygon of a query line segment in a non-simple polygon with h ≥ 1 pairwise-disjoint polygonal obstacles with a total of n vertices. Our algorithm needs O(n2 log n) time and O(n2) space in the preprocessing phase and WVP(pq) in query time of O(nh’ log n + k), in which h’ is an output sensitive parameter...
Weak visibility queries of line segments in simple polygons and polygonal domains
, Article International Journal of Computer Mathematics ; 2017 , Pages 1-18 ; 00207160 (ISSN) ; Ghodsi, M ; Sharif University of Technology
Taylor and Francis Ltd
2017
Abstract
In this paper we consider the problem of computing the weak visibility polygon of a query line segment pq (or (Formula presented.)) inside a given polygon (Formula presented.). Our first algorithm runs in simple polygons and needs (Formula presented.) time and (Formula presented.) space in the preprocessing phase to report (Formula presented.) of any query line segment pq in time (Formula presented.). We also give an algorithm to compute the weak visibility polygon of a query line segment in a non-simple polygon with (Formula presented.) pairwise-disjoint polygonal obstacles with a total of n vertices. Our algorithm needs (Formula presented.) time and (Formula presented.) space in the...
Polar diagram of moving objects
, Article 20th Annual Canadian Conference on Computational Geometry, CCCG 2008, Montreal, QC, 13 August 2008 through 15 August 2008 ; August , 2008 , Pages 51-54 ; Ghodsi, M ; Sharif University of Technology
2008
Abstract
Many important problems in Computational Geometry needs to perform some kind of angle processing. The Polar Diagram [4] is a locus approach for problems processing angles. Using this structure as preprocessing, one can eliminate exhaustive searches to find objects with smallest angle. Handling data in change is a significant concept in Computer Science. One of the design and analysis tools used in the modeling of moving geometric objects is the kinetic data structure (or KDS) framework Kinetic Data Structure is a framework for maintaining a certain attribute of a set of objects while moving in a continuous manner. In this paper, we use the notion of kinetic data structure to model the...
Kinetic polar diagram
, 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 283-290 ; 18650929 (ISSN); 3540899847 (ISBN); 9783540899846 (ISBN) ; Chitforoush, F ; Yazdandoost, M ; Ghodsi, M ; Sharif University of Technology
2008
Abstract
Polar Diagram [4] is a new locus approach for problems processing angles. The solution to many important problems in Computational Geometry requires some kind of angle processing of the data input. Using the Polar Diagrma as preprocessing, exhaustive searches to find those sites with smallest angle become unnecessary. In this paper, we use the notion of kinetic data structure [1][2] to model the dynamic case of polar diagram, i.e we maintain the polar diagram of a set of continuously moving objects in the scene. We show that our proposed structure meets the main criteria of a good KDS. © 2008 Springer-Verlag
Weak visibility counting in simple polygons
, Article Journal of Computational and Applied Mathematics ; Volume 288 , November , 2015 , Pages 215-222 ; 03770427 (ISSN) ; Daneshpajouh, S ; Alipour, S ; Ghodsi, M ; Sharif University of Technology
Elsevier
2015
Abstract
For a simple polygon P of size n, we define weak visibility counting problem (WVCP) as finding the number of visible segments of P from a query line segment pq. We present different algorithms to compute WVCP in sub-linear time. In our first algorithm, we spend O(n7) time to preprocess the polygon and build a data structure of size O(n6), so that we can optimally answer WVCP in O(logn) time. Then, we reduce the preprocessing costs to O(n4+ε) time and space at the expense of more query time of O(log5n). We also obtain a trade-off between preprocessing and query time costs. Finally, we propose an approximation method to reduce the preprocessing costs to O(n2) time and space and O(n1/2+ε) query...
Weak Visibility of Line Segments in Different Environments
, Ph.D. Dissertation Sharif University of Technology ; Ghodsi, Mohammad (Supervisor)
Abstract
Visibility is an important topic in computational geometry, computer graphics, and motion planning. Two points inside a polygon are visible to each other if their connecting segment remains completely inside the polygon. Visibility polygon of a point in a simple polygon P is the set of points inside P that are visible from the point. The visibility problem has also been considered for line segments. A point v is said to be weakly visible to a line segment pq if there exists a point w 2 pq, such that w and v are visible to each other. The problem of computing the weak visibility polygon (or WVP) of pq inside a polygon P is to compute all points of P that are weakly visible from pq. In this...
H2 Production Via Cu2O Nanostructured on TNA in Water Splitting Reaction under Visible Photo-irradiation
, M.Sc. Thesis Sharif University of Technology ; Moshfegh, Alireza (Supervisor) ; Saboohi, Yadollah (Co-Advisor)
Abstract
In this research, initially, thin film of TiO2 nanotube arrays (TNA) was deposited on Titanium foil (Ti), using anodization technique under an optimized applied voltage of 60 V, for 200 minutes. Highly smooth and ordered TNA formed by effective two-step anodization method. The TNA synthesized by this procedure, showed a better surface smoothness and tube order as compared with the TNA prepared in one-step anodization process. The electrolyte which was utilized for the anodization process, contained 90% of Ethylene Glycol (EG) in volume, 10% de-ionized water (DI) in volume, 0.1M Ammonium Fluoride (NH4F), and 0.5 ml Phosphoric Acid (H3PO4) 1M in order to adjust the pH about 5.6. Moreover, the...
Fabrication of high conductivity TiO2/Ag fibrous electrode by the electrophoretic deposition method
, Article Journal of Physical Chemistry C ; Volume 112, Issue 47 , 2008 , Pages 18686-18689 ; 19327447 (ISSN) ; Taghavinia, N ; Sharifi, N ; Chavoshi, M ; Rahman, M ; Sharif University of Technology
2008
Abstract
TiO2 deposited on a membrane of Ag fibers was prepared as a photoelectrochemical cell electrode. Ag fibers were made by reduction of Ag complexes on cellulose fibers, followed by burning out the template. TiO 2 photocatalyst layers were grown on the fibers by electrophoretic deposition of TiO2 nanoparticles. Ag fibers could be uniformly deposited. Photocatalytic tests by dye decomposition and electrochemical impedance spectroscopy (EIS) under UV illumination demonstrate that Ag fibers act as a good substrate that provides both high surface area and good separation of photogenerated electron-hole pairs and causes the enhancement of photocatalytic activity in comparison with a thin film of...
The air quality of Tehran underground railway transit system
, Article BHR Group - 14th International Symposium on Aerodynamics and Ventilation of Tunnels, 11 May 2011 through 13 May 2011 ; May , 2011 , Pages 551-561 ; 9781855981232 (ISBN) ; Abbasspour, M ; Mansoori, N ; Moattar, F ; Nouri, N ; Allahyari, M ; Sharif University of Technology
2011
Abstract
This study examines the air quality on line 1 and 2 of Tehran underground metro. The total suspended particulate (TSP), PM10, PM2.5, PM1, CO2, NO, NO2, SO2, relative humidity and air temperature were measured. An integrated air quality index was also calculated for each location. The results revealed that, PMlO, PM2.5, and SO2 concentrations are higher than their environmental standard levels. The in station CO2 levels are higher while its' in train levels are lower than environmental permissible level. The air quality index showed that the in-train air quality is more acceptable than the instation air quality
Autonomous vision-based robotic grasping of household objects: a practical case study
, Article 11th RSI International Conference on Robotics and Mechatronics, ICRoM 2023 ; 2023 , Pages 918-924 ; 979-835030810-5 (ISBN) ; Dalvand, M ; Pasiar, N ; Asadi, N ; Yousefi, M ; Masouleh, M. T ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2023
Abstract
Autonomous robotic grasping has emerged as a valuable capability for automating everyday household tasks like table setting (bossing), cleaning, and meal preparation. Still, accurately detecting and manipulating diverse everyday objects in unstructured home environments remains a significant challenge. In this study, an integrated robotic system combining YOLOv8s-seg deep learning for object detection and segmentation with computer vision techniques to determine optimal grasping points is proposed. The accuracy of this model has also been compared with other models through their mAP0.5, mAP.05-.95, precision and recall. A custom dataset of over 1000 images containing common household objects...
The metabolome profiling of obese and non-obese individuals: Metabolically healthy obese and unhealthy non-obese paradox
, Article Iranian Journal of Basic Medical Sciences ; Volume 23, Issue 2 , 2020 , Pages 186-194 ; Madani, N. H ; Ghoochani, B. F. N. M ; Safari Alighiarloo, N ; Khamseh, M. E ; Sharif University of Technology
Mashhad University of Medical Sciences
2020
Abstract
Objective(s): The molecular basis of “metabolically healthy obese” and “metabolically unhealthy non-obese” phenotypes is not fully understood. Our objective was to identify metabolite patterns differing in obese (metabolically healthy vs unhealthy (MHO vs MUHO)) and non-obese (metabolically healthy vs unhealthy (MHNO vs MUHNO)) individuals. Materials and Methods: This case-control study was performed on 86 subjects stratified into four groups using anthropometric and clinical measurements: MHO (21), MUHO (21), MHNO (22), and MUHNO (22). Serum metabolites were profiled using nuclear magnetic resonance (NMR). Multivariate analysis was applied to uncover discriminant metabolites, and enrichment...
Analysis of the bio-environmental advantages using two types of activated carbon at a petro-chemical water treatment plant
, Article 18th International Congress of Chemical and Process Engineering, CHISA 2008, Prague, 24 August 2008 through 28 August 2008 ; 2008 ; Mansouri, M ; Badry, N
2008
Abstract
Activated carbon powder was analyzed at one of the petro-chemical units in Iran, to determine the usefulness of this material in waste water treatment. Two types of commercial activated carbon powder were used giving different results, attributed to different constituents. For every experiment, 4 kg of activated carbon was used in the pilot plant column. Analysis results on the effect of parameters, e.g., inlet volumetric flow rate of waste water and activated carbon structure, on the plant performance were presented. This is an abstract of a paper presented at the 18th International Congress of Chemical and Process Engineering (Prague, Czech Republic 8/24-28/2008)
Hexyltriphenylphosphonium bromide as an absolutely chemoselective ionic liquid catalyst in the three-component reaction of aryl aldehydes, acetophenones and malononitrile
, Article ChemistrySelect ; Volume 4, Issue 20 , 2019 , Pages 6190-6193 ; 23656549 (ISSN) ; Khodaei, M. M ; Batooie, N ; Hosseinzadeh, N ; Foroumadi, A ; Sharif University of Technology
Wiley-Blackwell
2019
Abstract
Hexyltriphenylphosphonium bromide (HTPB) is used as an efficient ionic liquid catalyst in the chemoselective addition of malononitrile to carbonyl group moiety of chalcones through the three-component reaction of aryl aldehydes, acetophenone derivatves, and malononitrile to produce (E)-2-(1,3-diarylallylidene)malononitriles at ambient temperature. The method is simple, solvent-free, environmentally friendly, and gives excellent yields in a short reaction times. © 2019 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim
Simvastatin-loaded nano-niosomes confer cardioprotection against myocardial ischemia/reperfusion injury
, Article Drug Delivery and Translational Research ; 2021 ; 2190393X (ISSN) ; Niri, N. M ; Akbarzade, I ; Sharifi, M ; Aboutaleb, N ; Sharif University of Technology
Springer
2021
Abstract
Although simvastatin (SIM) has been proven to be a powerful agent against myocardial ischemia/reperfusion (MI/R) injury, poor water solubility, short half-life, and low bioavailability have made it futile while using conventional drug delivery system. Hence, this study aims to investigate therapeutic efficacy of SIM-loaded nano-niosomes on MI/R injury. Surface active agent film hydration method was used to synthesize nano-niosomes. The physicochemical properties of nano-niosomes were characterized using dynamic light scattering (DLS) and transmission electron microscopy (TEM). Moreover, niosomes were characterized in entrapment efficiency (EE) and releasing pattern. Male Wistar rats were...
Optimization of selenization process to remove Ga-induced pin-holes in CIGS thin films
, Article Solar Energy ; Volume 236 , 2022 , Pages 175-181 ; 0038092X (ISSN) ; Dehghani, M ; Tehrani, N. A ; Taghavinia, N ; Bagherzadeh, M ; Sharif University of Technology
Elsevier Ltd
2022
Abstract
In thin-film solar cells, deposition of pinhole and the crack-free absorber layer, with the right chemical stoichiometry is highly important for high-performance solar cell devices. In solution-based CIGS solar cell technology, a nanoparticle ink approach provides phase stability of the final chalcogenide absorber layer. However, the sintering of small nanoparticles to form large grains with reduced grain boundaries is an important challenge in the fabrication process. This is usually realized by annealing in the Se atmosphere, i.e. selenization process. However, the presence of Ga in CIGS films leads to pinholes after selenization. In this study, the synthesis and deposition of high-quality...
Modeling superconductive fault current limiter using constructive neural networks
, Article 2007 IEEE International Symposium on Industrial Electronics, ISIE 2007, Caixanova - Vigo, 4 June 2007 through 7 June 2007 ; 2007 , Pages 2859-2863 ; 1424407559 (ISBN); 9781424407552 (ISBN) ; Sadati, N ; Hosseini, M. N ; Sharif University of Technology
2007
Abstract
Although so many advances have been proposed in the field of artificial intelligence and superconductivity, there are few reports on their combination. On the other hand, because of the nonlinear and multivariable characteristics of the superconductive elements and capabilities of neural networks in this field, it seems useful to apply the neural networks to model and control the superconductive phenomena or devices. In this paper, a new constructive neural network (CNN) trained by two different optimization algorithms; back-propagation and genetic algorithm, is proposed which models the behavior of the superconductive fault current limiters (SFCLs). Simulation results show that the proposed...