Loading...
Search for: forestry
0.006 seconds
Total 50 records

    Semi-supervised dependency parsing using lexical affinities

    , Article 50th Annual Meeting of the Association for Computational Linguistics, ACL 2012 - Proceedings of the Conference ; Volume 1 , 2012 , Pages 777-785 ; 9781937284244 (ISBN) Mirroshandel, S. A ; Nasr, A ; Le Roux, J ; Baidu; Google; Elsevier; Microsoft Research; Korea Advanced Institute of Science and Technology (KAIST) ; Sharif University of Technology
    2012
    Abstract
    Treebanks are not large enough to reliably model precise lexical phenomena. This deficiency provokes attachment errors in the parsers trained on such data. We propose in this paper to compute lexical affinities, on large corpora, for specific lexico-syntactic configurations that are hard to disambiguate and introduce the new information in a parser. Experiments on the French Treebank showed a relative decrease of the error rate of 7.1% Labeled Accuracy Score yielding the best parsing results on this treebank  

    Developing a model for citizens' satisfaction with public sector services based on rough sets theory: A case study of Tehran municipality

    , Article Tehnicki Vjesnik ; Volume 20, Issue 5 , 2013 , Pages 795-802 ; 13303651 (ISSN) Alizadeh, A ; Kianfar, F ; Sharif University of Technology
    2013
    Abstract
    Original scientific paper Developing a model for citizens' satisfaction with public services is one of the effective factors for improvement of service quality. In recent years, many studies have been carried out to identify a model for citizens' satisfaction with public sector services. In the structure of the presented models in the literature, one of the most important issues regarding organizations giving public services is identification of service scopes that have the most impact on citizens' satisfaction. This paper aims to develop a model to identify citizens' satisfaction status with public services. To do so, first, key factors influencing citizens' satisfaction with public... 

    Numerical and 1-D modeling of pulmonary circulation along with lumped parameter modeling of the heart

    , Article 2013 20th Iranian Conference on Biomedical Engineering, ICBME 2013 ; December , 2013 , Pages 93-97 Salehi, S. S ; Firoozabadi, B ; Saidi, M. S ; Sharif University of Technology
    IEEE Computer Society  2013
    Abstract
    A one dimensional model of the pulmonary arterial network along with systemic circulation was introduced to quantify the human pulmonary artery hemodynamics. A lumped parameter model of the right ventricle was used as the inlet boundary condition. A time varying elastance related the volume and pressure of the right ventricle was imposed in the model. By using a four element Windkessel model, blood flow rate throughout the right ventricle was in hand. An asymmetric structured tree was chosen as the outlet boundary conditions. Simulation was based on solving one-dimensional equations of conservation of mass and momentum by using finite volume method. Blood flow rate, pressure and velocity... 

    On the complexity of isoperimetric problems on trees

    , Article Discrete Applied Mathematics ; Volume 160, Issue 1-2 , January , 2012 , Pages 116-131 ; 0166218X (ISSN) Daneshgar, A ; Javadi, R ; Sharif University of Technology
    2012
    Abstract
    This paper is aimed at investigating some computational aspects of different isoperimetric problems on weighted trees. In this regard, we consider different connectivity parameters called minimum normalized cuts/isoperimetric numbers defined through taking the minimum of the maximum or the mean of the normalized outgoing flows from a set of subdomains of vertices, where these subdomains constitute a partition/subpartition. We show that the decision problem for the case of taking k-partitions and the maximum (called the max normalized cut problem NCPM), and the other two decision problems for the mean version (referred to as IPPm and NCPm) are NP-complete problems for weighted trees. On the... 

    Statistical physics of loopy interactions: Independent-loop approximation and beyond

    , Article Physical Review E - Statistical, Nonlinear, and Soft Matter Physics ; Volume 92, Issue 3 , September , 2015 ; 15393755 (ISSN) Ramezanpour, A ; Moghimi Araghi, S ; Sharif University of Technology
    American Physical Society  2015
    Abstract
    We consider an interacting system of spin variables on a loopy interaction graph, identified by a tree graph and a set of loopy interactions. We start from a high-temperature expansion for loopy interactions represented by a sum of non-negative contributions from all the possible frustration-free loop configurations. We then compute the loop corrections using different approximations for the nonlocal loop interactions induced by the spin correlations in the tree graph. For distant loopy interactions, we can exploit the exponential decay of correlations in the tree interaction graph to compute loop corrections within an independent-loop approximation. Higher orders of the approximation are... 

    A real-time grid-based method for estimating nearest neighbors in euclidean space

    , Article 10th Iranian Conference on Machine Vision and Image Processing, MVIP 2017, 22 November 2017 through 23 November 2017 ; Volume 2017-November , April , 2018 , Pages 176-181 ; 21666776 (ISSN) ; 9781538644041 (ISBN) Zamani, Y ; Shirzad, H ; Kasaei, S ; Sharif University of technology
    IEEE Computer Society  2018
    Abstract
    The problem of finding nearest neighbors in a certain distance is well defined in machine learning area. There are well-known and exact solutions for it. However, in real world problems, especially in machine vision area, where we have a moving sensor and we want to know which objects of the scene are in the measurement range of it, two issues are important. First, usually in these problems, the time cost is more important than accuracy. It means they can tolerate some measurements error if they can do the process in real-time. Second, the location of an object can be described in the three-dimensional space and does not require the higher dimensions. According to these issues, we introduced... 

    Automatic extraction of key-poses and key-joints for action recognition using 3D skeleton data

    , Article 10th Iranian Conference on Machine Vision and Image Processing, MVIP 2017 ; Volume 2017-November , 19 April , 2018 , Pages 164-170 ; 21666776 (ISSN) ; 9781538644041 (ISBN) Ghojogh, B ; Mohammadzade, H ; Sharif University of Technology
    IEEE Computer Society  2018
    Abstract
    In action recognition, a body pose, or simply pose, is defined as a state of the 3D position of skeleton joints which varies while an action is performed. Then an action can be defined as a sequence of specific poses, called key-poses in this paper. Key-poses are contained in the so called key-frames, which are surrounded by several other frames. Key-frames can be selected using minimum energy criterion. In this paper, a method is proposed to automatically extract key-poses out of key-frames. Furthermore, a novel learning method, named Fisher forest, is proposed which enables action recognition methods to use different types and even various number of joints for different actions, poses, or... 

    Trees with a large Laplacian eigenvalue multiplicity

    , Article Linear Algebra and Its Applications ; Volume 586 , 2020 , Pages 262-273 Akbari, S ; van Dam, E. R ; Fakharan, M. H ; Sharif University of Technology
    Elsevier Inc  2020
    Abstract
    In this paper, we study the multiplicity of the Laplacian eigenvalues of trees. It is known that for trees, integer Laplacian eigenvalues larger than 1 are simple and also the multiplicity of Laplacian eigenvalue 1 has been well studied before. Here we consider the multiplicities of the other (non-integral) Laplacian eigenvalues. We give an upper bound and determine the trees of order n that have a multiplicity that is close to the upper bound [Formula presented], and emphasize the particular role of the algebraic connectivity. © 2019 Elsevier Inc  

    Unsupervised grammar induction using a parent based constituent context model

    , Article 18th European Conference on Artificial Intelligence, ECAI 2008, 21 July 2008 through 25 July 2008 ; Volume 178 , 2008 , Pages 293-297 ; 09226389 (ISSN); 978158603891 (ISBN) Mirroshandel, S. A ; Ghassem Sani, G ; Sharif University of Technology
    IOS Press  2008
    Abstract
    Grammar induction is one of attractive research areas of natural language processing. Since both supervised and to some extent semi-supervised grammar induction methods require large treebanks, and for many languages, such treebanks do not currently exist, we focused our attention on unsupervised approaches. Constituent Context Model (CCM) seems to be the state of the art in unsupervised grammar induction. In this paper, we show that the performance of CCM in free word order languages (FWOLs) such as Persian is inferior to that of fixed order languages such as English. We also introduce a novel approach, called parent-based constituent context model (PCCM), and show that by using some... 

    A strategic model for location selection of wood industry: An application of ANP

    , Article Journal of Applied Sciences ; Volume 7, Issue 3 , 2007 , Pages 326-333 ; 18125654 (ISSN) Azizi, M ; Modarres, M ; Sharif University of Technology
    Asian Network for Scientific Information  2007
    Abstract
    The objective of this research is to design a method for selection of an appropriate location to establish plywood and veneer plants in Iran. Due to the climate of this region as well as the destruction of the forests and lack of proper plantation, the supporting forests to feed this industry are limited. Thus, it is vital to optimize the other strategically factors in order to make these plants capable of competing with the foreign plants which have access to less expensive input materials. In case of improper utilization of the resources, this industry can not compete with the imported products. The decision is made within the framework of benefits, opportunities, costs and risks (BOCR).... 

    Feature-based no-reference video quality assessment using Extra Trees

    , Article IET Image Processing ; Volume 16, Issue 6 , 2022 , Pages 1531-1543 ; 17519659 (ISSN) Otroshi Shahreza, H ; Amini, A ; Behroozi, H ; Sharif University of Technology
    John Wiley and Sons Inc  2022
    Abstract
    With the emergence of social networks and improvements in the internet speed, the video data has become an ever-increasing portion of the global internet traffic. Besides the content, the quality of a video sequence is an important issue at the user end which is often affected by various factors such as compression. Therefore, monitoring the quality is crucial for the video content and service providers. A simple monitoring approach is to compare the raw video content (uncompressed) with the received data at the receiver. In most practical scenarios, however, the reference video sequence is not available. Consequently, it is desirable to have a general reference-less method for assessing the... 

    Integrated impacts of vegetation and soil type on slope stability: A case study of Kheyrud Forest, Iran

    , Article Ecological Modelling ; Volume 446 , 2021 ; 03043800 (ISSN) Emadi Tafti, M ; Ataie Ashtiani, B ; Hosseini, S. M ; Sharif University of Technology
    Elsevier B.V  2021
    Abstract
    In this study, an integrated 2D numerical model is applied to investigate the mechanical effects of the vegetation and soil type on slope stability. The developed model can assess the mechanical aspects of vegetation in slope stabilization. For this purpose, a case study of the Kheyrud forest located in northern Iran is considered as a real case site. Different scenarios including; three soil types (fine grain with low-, medium-, and high-strength) and two vegetation types (Maple and Common-ash) are assessed in the stability analysis (based on safety factor). The results confirm that the considered vegetation can prevent shallow landslide occasions, but has a limited impact on deep landslide... 

    A multistage stochastic programming approach in project selection and scheduling

    , Article International Journal of Advanced Manufacturing Technology ; Vol. 70, issue. 9-12 , 2014 , pp. 2125-2137 ; ISSN: 02683768 Rafiee, M ; Kianfar, F ; Farhadkhani, M ; Sharif University of Technology
    Abstract
    In this paper, the joint problem of project selection and project scheduling under uncertain environment is formulated, analyzed, and solved by multistage stochastic programs. First of all, a general mathematical formulation which can address several versions of the problem is presented. A multi-period project selection and scheduling problem is introduced and modeled by multistage stochastic programs, which are effective for solving long-term planning problems under uncertainty. A set of scenarios and corresponding probabilities is applied to model the multivariate random data process (costs or revenues, available budget, chance of success). Then, due to computational complexity, a scenario... 

    Optimal strategy for walking in streets with minimum number of turns for a simple robot

    , Article Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Vol. 8881, issue , 2014 , p. 101-112 Tabatabaei, A ; Ghodsi, M ; Sharif University of Technology
    Abstract
    We consider the problem of walking a simple robot in an unknown street. The robot that cannot infer any geometric properties of the street traverses the environment to reach a target t, starting from a point s. The robot has a minimal sensing capability that can only report the discontinuities in the depth information (gaps), and location of the target point once it enters in its visibility region. Also, the robot can only move towards the gaps while moving along straight lines is cheap, but rotation is expensive for the robot. We maintain the location of some gaps in a tree data structure of constant size. The tree is dynamically updated during the movement. Using the data structure, we... 

    A web-based methodology for convergent product fuzzy networks using the Steiner tree

    , Article Journal of Industrial and Production Engineering ; Volume 30, Issue 7 , 2013 , Pages 415-432 ; 21681015 (ISSN) Hassanzadeh, R ; Mahdavi, I ; Mahdavi Amiri, N ; Sharif University of Technology
    2013
    Abstract
    An important manufacturing technology spectrum is to consider rapid and sensitive assemblies through convergent product (CP) in digital environment. We integrate functions and sub-functions using a comprehensive mathematical optimization process. To form the CP, a web-based fuzzy network is considered in which a collection of base functions and sub-functions configure the nodes and each arc in the network is to be a link between two nodes. The aim is to find an optimal tree of functionalities in the network adding value to the product in the web environment. First, a purification process is performed in the product network to assign the links among bases and sub-functions. Then, fuzzy... 

    An adaptive regression tree for non-stationary data streams

    , Article Proceedings of the ACM Symposium on Applied Computing ; March , 2013 , Pages 815-816 ; 9781450316569 (ISBN) Gholipour, A ; Hosseini, M. J ; Beigy, H ; Sharif University of Technology
    2013
    Abstract
    Data streams are endless flow of data produced in high speed, large size and usually non-stationary environments. The main property of these streams is the occurrence of concept drifts. Using decision trees is shown to be a powerful approach for accurate and fast learning of data streams. In this paper, we present an incremental regression tree that can predict the target variable of newly incoming instances. The tree is updated in the case of occurring concept drifts either by altering its structure or updating its embedded models. Experimental results show the effectiveness of our algorithm in speed and accuracy aspects in comparison to the best state-of-the-art methods  

    Numerical and 1-D modeling of systemic circulation along with cerebral vasculature

    , Article 2012 19th Iranian Conference of Biomedical Engineering, ICBME 2012 ; 2012 , Pages 17-21 ; 9781467331302 (ISBN) Salehi, S. S ; Firoozabadi, B ; Saidi, M. S ; Sharif University of Technology
    Abstract
    The brain is one of the vital organs in the body. The main cerebral distribution center of blood flow in the brain is the circle of Willis (CoW). In more than 50% of healthy brains and in more than 80% of dysfunctional ones, at least one artery of the circle of Willis is absent or underdeveloped. These variations reduce the collateral flow availability and increase the risk of stroke and transient ischemic attack in patients with atherosclerosis. Thus it is essential to simulate the circle of Willis and investigate the effects of stenosis. In this work the systemic arteries along with the circle of Willis are simulated using the finite volume method and one-dimensional equations of... 

    Application of the WEPP model to determine sources of run-off and sediment in a forested watershed

    , Article Hydrological Processes ; Volume 29, Issue 4 , 2015 , Pages 481-497 ; 08856087 (ISSN) Saghafian, B ; Meghdadi, A. R ; Sima, S ; Sharif University of Technology
    John Wiley and Sons Ltd  2015
    Abstract
    This study investigates critical run-off and sediment production sources in a forested Kasilian watershed located in northern Iran. The Water Erosion Prediction Project (WEPP) watershed model was set up to simulate the run-off and sediment yields. WEPP was calibrated and validated against measured rainfall-run-off-sediment data. Results showed that simulated run-off and sediment yields of the watershed were in agreement with the measured data for the calibration and validation periods. While low and medium values of run-off and sediment yields were adequately simulated by the WEPP model, high run-off and sediment yield values were underestimated. Performance of the model was evaluated as... 

    Video event recognition leveraging hierarchy of semantic concepts

    , Article 2017 25th Iranian Conference on Electrical Engineering, ICEE 2017, 2 May 2017 through 4 May 2017 ; 2017 , Pages 1549-1553 ; 9781509059638 (ISBN) Soltanian, M ; Ghaemmaghami, S ; Sharif University of Technology
    Abstract
    A new method for exploiting the semantic hierarchical structure of visual concepts in video event recognition task is proposed in this paper. The visual concepts are detected using the readily available Convolutional Neural Network (CNN) structures which make the recognition system extremely efficient in cases with limited hardware resources. The employed CNNs assign scores to each of the predetermined visual concepts in each video frame and the resulting concept scores are fed to the proposed hierarchical post-processing scheme. Our post-processing module takes advantage of the semantic hierarchy of the concepts to enhance the recognition accuracy of event recognition. The hierarchical... 

    1 + ϵ approximation of tree edit distance in quadratic time

    , Article 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, 23 June 2019 through 26 June 2019 ; 2019 , Pages 709-720 ; 07378017 (ISSN); 9781450367059 (ISBN) Boroujeni, M ; Ghodsi, M ; Hajiaghayi, M ; Seddighin, S ; Sharif University of Technology
    Association for Computing Machinery  2019
    Abstract
    Edit distance is one of the most fundamental problems in computer science. Tree edit distance is a natural generalization of edit distance to ordered rooted trees. Such a generalization extends the applications of edit distance to areas such as computational biology, structured data analysis (e.g., XML), image analysis, and compiler optimization. Perhaps the most notable application of tree edit distance is in the analysis of RNA molecules in computational biology where the secondary structure of RNA is typically represented as a rooted tree. The best-known solution for tree edit distance runs in cubic time. Recently, Bringmann et al. show that an O(n2.99) algorithm for weighted tree edit...