Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Zarrin Langari

dblp:39/2391 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
1since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2 · 2 first-authorTheory of computation · 2 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Graph algorithms and graph theory · 50% Automata and formal languages · 50%
Artificial intelligence
1 paper
Information extraction and text analysis · 100%
Computer networks
1 paper
Internet architecture and protocols · 100%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory › graph theory
graph transformation
0.112006
Formal Modeling of Communication Protocols by Graph Transformation · FM 2006
Automata and formal languages
protocol modeling
0.112006
Formal Modeling of Communication Protocols by Graph Transformation · FM 2006
Natural language and speech › Information extraction and text analysis
text classification
0.012001
Subject Classification in the Oxford English Dictionary · ICDM 2001
Internet architecture and protocols
protocol specification
0.012006
Formal Modeling of Communication Protocols by Graph Transformation · FM 2006

Methods — techniques the papers use, named apart from their topics

term weighting · 0.1naive bayes · 0.1expectation-maximization · 0.1k-nearest neighbors · 0.0k-nearest neighbor · 0.0
YearPublicationVenuePosition
2024 An Exploration of Voxel/Connection and Image Segmentation Approaches to Derive High Resolution Rasters of Manning's n
abstract
Manning’s roughness coefficients (Manning’s n) are numerical values which represent the resistance to flows in river channels and floodplains. Field surveys and land use land cover (LULC) maps are commonly used to infer these Manning’s n values. Field surveys can be time and labour intensive while the LULC maps derived from Landsat and RadarSat-2 are often too coarse and may produce inaccurate representations of true surface roughness, leading to errors in the outputs from hydraulic models. In this work we tested two approaches to generate high resolution surfaces depicting Manning’s n. The first is using unclassified LiDAR point clouds and a voxel/connection (VC) based approach in combination with a rule-based table to set the roughness values. In the second method, we created training data for several land use categories and trained an Image Segmentation (IS) U-Net model to predict the category of each pixel and then applied a Manning's n value to each category. Our results indicate the LiDAR based approach is able to label all pixels within the study region, but the reclass table needs more attention. The IS method has the capability to cover a larger area more efficiently, but many pixels did not fit the existing training labels, leaving the output data incomplete. Future work is needed before either of these techniques can be reliably implemented.
Heather McGrath, Mathieu Turgeon-Pelchat, Hospice Houngbo, Lingjun Zhou, Zarrin Langari
IGARSS5
2009 Application of Graph Transformation in Verification of Dynamic Systems
Zarrin Langari, Richard J. Trefler
IFM1
2006 Formal Modeling of Communication Protocols by Graph Transformation
Zarrin Langari, Richard J. Trefler
FM1
2001 Subject Classification in the Oxford English Dictionary
abstract
The Oxford English Dictionary is a valuable source of lexical information and a rich testing ground for mining highly structured text. Each entry is organized into a hierarchy of senses, which include definitions, labels and cited quotations. Subject labels distinguish the subject classification of a sense, for example they signal how a word may be used in anthropology, music or computing. Unfortunately subject labeling in the dictionary is incomplete. To overcome this incompleteness, we attempt to classify the senses (i.e., definitions) in the dictionary by their subjects, using the citations as an information guide. We report on four different approaches: k nearest neighbors, a standard classification technique; term weighting, an information retrieval method dealing with text; naive Bayes, a probabilistic method; and expectation maximization, an iterative probabilistic method. Experimental performance of these methods is compared based on standard classification metrics.
Zarrin Langari, Frank Wm. Tompa
ICDM1