Loading...
Search for:
parsaei--moin
0.091 seconds
Bug localization using revision log analysis and open bug repository text categorization
, Article 6th International IFIP WG 2.13 Conference on Open Source Systems, OSS 2010, Notre Dame, IN, 30 May 2010 through 2 June 2010 ; Volume 319 AICT , 2010 , Pages 188-199 ; 18684238 (ISSN) ; 9783642132438 (ISBN) ; Khansari, M ; Sharif University of Technology
2010
Abstract
In this paper, we present a new approach to localize a bug in the software source file hierarchy. The proposed approach uses log files of the revision control system and bug reports information in open bug repository of open source projects to train a Support Vector Machine (SVM) classifier. Our approach employs textual information in summary and description of bugs reported to the bug repository, in order to form machine learning features. The class labels are revision paths of fixed issues, as recorded in the log file of the revision control system. Given an unseen bug instance, the trained classifier can predict which part of the software source file hierarchy (revision path) is more...
Dynamic Pricing on Services in Electronic Markets under Competition and Incomplete Information
, M.Sc. Thesis Sharif University of Technology ; Modarres-Yazdi, Mohammad (Supervisor)
Abstract
The present study investigates dynamic pricing in case of urban transportation operators competing on an identical network. Game theory has been adopted as an approach to the modeling and solutions.Game theory is a mathematical theory widely applied in competitive situations.The proposed model takes the players’ interdependency problems into account to predict their decisions as well as the displacement on the network about equilibrium point. The problem is modeled in no-cooperation state using the dynamic Nash equilibrium; Gauss-Seidel algorithm is used for the solutions considering the discontinuity of the decision space. A comprehensive sensitivity analysis has also been conducted on the...
A machine learning model for predicting favorable outcome in severe traumatic brain injury patients after 6 months
, Article Acute and Critical Care ; Volume 37, Issue 1 , 2022 , Pages 45-52 ; 25866052 (ISSN) ; Dadboud, F ; Khalili, H ; Niakan, A ; Parsaei, H ; Sharif University of Technology
Korean Society of Critical Care Medicine
2022
Abstract
Background: Traumatic brain injury (TBI), which occurs commonly worldwide, is among the more costly of health and socioeconomic problems. Accurate prediction of favorable outcomes in severe TBI patients could assist with optimizing treatment procedures, predicting clinical outcomes, and result in substantial economic savings. Methods: In this study, we examined the capability of a machine learning-based model in predicting “favorable” or “unfavorable” outcomes after 6 months in severe TBI patients using only parameters measured on admission. Three models were developed using logistic regression, random forest, and support vector machines trained on parameters recorded from 2,381 severe TBI...
Signed graphs cospectral with the path
, Article Linear Algebra and Its Applications ; Volume 553 , 2018 , Pages 104-116 ; 00243795 (ISSN) ; Haemers, W. H ; Maimani, H. R ; Parsaei Majd, L ; Sharif University of Technology
Elsevier Inc
2018
Abstract
A signed graph Γ is said to be determined by its spectrum if every signed graph with the same spectrum as Γ is switching isomorphic with Γ. Here it is proved that the path Pn, interpreted as a signed graph, is determined by its spectrum if and only if n≡0,1, or 2 (mod 4), unless n∈{8,13,14,17,29}, or n=3. © 2018 Elsevier Inc
Zero-sum flows for Steiner systems
, Article Discrete Mathematics ; Volume 343, Issue 11 , 2020 ; Maimani, H. R ; Parsaei Majd, L ; Wanless, I. M ; Sharif University of Technology
Elsevier B.V
2020
Abstract
Given a t-(v,k,λ) design, D=(X,B), a zero-sum n-flow of D is a map f:B⟶{±1,…,±(n−1)} such that for any point x∈X, the sum of f over all blocks incident with x is zero. For a positive integer k, we find a zero-sum k-flow for an STS(uw) and for an STS(2v+7) for v≡1(mod4), if there are STS(u), STS(w) and STS(v) such that the STS(u) and STS(v) both have a zero-sum k-flow. In 2015, it was conjectured that for v>7 every STS(v) admits a zero-sum 3-flow. Here, it is shown that many cyclic STS(v) have a zero-sum 3-flow. Also, we investigate the existence of zero-sum flows for some Steiner quadruple systems. © 2020 Elsevier B.V