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.

Farhan Rasheed

dblp:214/9904 · DBLP profile ↗
← Back
9ranked-venue papers
4as first author
4since 2021 · last 2026
—ORCID · conflict

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

Systems, architecture and hardware · 5 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 4 · 2 first-author · 4 since 2021Software engineering, systems software and programming languages · 2 · 1 first-author

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.

Computer graphics and multimedia
2 papers
Visualization and visual analytics · 75% Image and video processing · 25%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Integrated circuit design · 46% Processor architecture and microarchitecture · 46% Energy-efficient computing · 7%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

Topics — the 10 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Visualization and visual analytics
topological data analysis
1.722026
Explorative Analysis of Dynamic Force Networks in 2D Photoelastic Disks Ensembles · IEEE Trans. Vis. Comput. Graph. 2026
Geometry-Aware Merge Tree Comparisons for Time-Varying Data With Interleaving Distances · IEEE Trans. Vis. Comput. Graph. 2023
Image and video processing › image segmentation › hierarchical segmentation
multiresolution segmentation
1.012026
Explorative Analysis of Dynamic Force Networks in 2D Photoelastic Disks Ensembles · IEEE Trans. Vis. Comput. Graph. 2026
Visualization and visual analytics › topological data analysis
merge tree comparison
0.712023
Geometry-Aware Merge Tree Comparisons for Time-Varying Data With Interleaving Distances · IEEE Trans. Vis. Comput. Graph. 2023
Visualization and visual analytics › temporal data visualization
time-varying data visualization
0.712023
Geometry-Aware Merge Tree Comparisons for Time-Varying Data With Interleaving Distances · IEEE Trans. Vis. Comput. Graph. 2023
Processor architecture and microarchitecture › instruction set architecture › instruction set extension
application-specific instruction set extension
0.412020
Printed Microprocessors · ISCA 2020
Processor architecture and microarchitecture
instruction set architecture
0.412020
Printed Microprocessors · ISCA 2020
Integrated circuit design › flexible electronics
printed electronics
0.412020
Printed Microprocessors · ISCA 2020
Integrated circuit design › VLSI design
standard cell library
0.412020
Printed Microprocessors · ISCA 2020
Graph algorithms and graph theory
topological descriptors
0.212023
Geometry-Aware Merge Tree Comparisons for Time-Varying Data With Interleaving Distances · IEEE Trans. Vis. Comput. Graph. 2023
Energy-efficient computing
low-power design
0.112020
Printed Microprocessors · ISCA 2020

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

topology-based segmentation · 2.0multiscale analysis · 2.0labeled merge trees · 1.3interleaving distance · 1.3synthesis and physical design · 0.4design space exploration · 0.4
YearPublicationVenuePosition
2026 Explorative Analysis of Dynamic Force Networks in 2D Photoelastic Disks Ensembles
abstract
This paper presents an interactive analysis framework for exploring data from photoelastic disk experiments, which serve as a model for two-dimensional granular materials. Granular materials, composed of discrete particles such as sand or gravel, exhibit behaviors resembling fluid or solid states depending on the system configuration. These behaviors arise from interparticle contact forces, which form complex force networks that govern the material's macroscopic behavior. Our framework is specifically designed to analyze such 2D ensembles of dynamic force networks, enabling the identification and characterization of their underlying structures. The framework is built around a topology-based, multiscale data segmentation in terms of force chains and cycles. The analysis methods are structured across three levels: (1) multiscale analysis of individual instances under specific loading conditions, (2) detailed exploration of single experiments encompassing a series of loading and unloading cycles, and (3) comparative analysis across experiments conducted under similar and differing setups. We demonstrate the capabilities of our framework with a case study for each of these levels.
Farhan Rasheed, Abrar Naseer, Talha Bin Masood, Tejas G. Murthy, Vijay Natarajan, Ingrid Hotz
IEEE Trans. Vis. Comput. Graph.1
2023 Geometry-Aware Merge Tree Comparisons for Time-Varying Data With Interleaving Distances
abstract
Merge trees, a type of topological descriptors, serve to identify and summarize the topological characteristics associated with scalar fields. They have great potential for analyzing and visualizing time-varying data. First, they give compressed and topology-preserving representations of data instances. Second, their comparisons provide a basis for studying the relations among data instances, such as their distributions, clusters, outliers, and periodicities. A number of comparative measures have been developed for merge trees. However, these measures are often computationally expensive since they implicitly consider all possible correspondences between critical points of the merge trees. In this paper, we perform geometry-aware comparisons of merge trees using labeled interleaving distances. The main idea is to decouple the computation of a comparative measure into two steps: a labeling step that generates a correspondence between the critical points of two merge trees, and a comparison step that computes distances between a pair of labeled merge trees by encoding them as matrices. We show that our approach is general, computationally efficient, and practically useful. Our framework makes it possible to integrate geometric information of the data domain in the labeling process. At the same time, the framework reduces the computational complexity since not all possible correspondences have to be considered. We demonstrate via experiments that such geometry-aware merge tree comparisons help to detect transitions, clusters, and periodicities of time-varying datasets, as well as to diagnose and highlight the topological changes between adjacent data instances.
Lin Yan 0003, Talha Bin Masood, Farhan Rasheed, Ingrid Hotz, Bei Wang 0001
IEEE Trans. Vis. Comput. Graph.3
2023 Multi-scale visual analysis of cycle characteristics in spatially-embedded graphs
abstract
We present a visual analysis environment based on a multi-scale partitioning of a 2d domain into regions bounded by cycles in weighted planar embedded graphs. The work has been inspired by an application in granular materials research, where the question of scale plays a fundamental role in the analysis of material properties. We propose an efficient algorithm to extract the hierarchical cycle structure using persistent homology. The core of the algorithm is a filtration on a dual graph exploiting Alexander’s duality. The resulting partitioning is the basis for the derivation of statistical properties that can be explored in a visual environment. We demonstrate the proposed pipeline on a few synthetic and one real-world data set.
Farhan Rasheed, Talha Bin Masood, Tejas G. Murthy, Vijay Natarajan, Ingrid Hotz
Vis. Informatics1
2021 Scalar Field Comparison with Topological Descriptors: Properties and Applications for Scientific Visualization
abstract
Abstract In topological data analysis and visualization, topological descriptors such as persistence diagrams, merge trees, contour trees, Reeb graphs, and Morse–Smale complexes play an essential role in capturing the shape of scalar field data. We present a state‐of‐the‐art report on scalar field comparison using topological descriptors. We provide a taxonomy of existing approaches based on visualization tasks associated with three categories of data: single fields, time‐varying fields, and ensembles. These tasks include symmetry detection, periodicity detection, key event/feature detection, feature tracking, clustering, and structure statistics. Our main contributions include the formulation of a set of desirable mathematical and computational properties of comparative measures, and the classification of visualization tasks and applications that are enabled by these measures.
Lin Yan 0003, Talha Bin Masood, Raghavendra Sridharamurthy, Farhan Rasheed, Vijay Natarajan, Ingrid Hotz, Bei Wang 0001
Comput. Graph. Forum4
2020 Printed Microprocessors
abstract
Printed electronics holds the promise of meeting the cost and conformality needs of emerging disposable and ultra-low cost margin applications. Recent printed circuits technologies also have low supply voltage and can, therefore, be battery-powered. In this paper, we explore the design space of microprocessors implemented in such printing technologies - these printed microprocessors will be needed for battery-powered applications with requirements of low cost, conformality, and programmability. To enable this design space exploration, we first present the standard cell libraries for EGFET and CNT-TFT printed technologies - to the best of our knowledge, these are the first synthesis and physical design ready standard cell libraries for any low voltage printing technology. We then present an area, power, and delay characterization of several off-the-shelf low gate count microprocessors (Z80, light8080, ZPU, and openMSP430) in EGFET and CNT-TFT technologies. Our characterization shows that several printing applications can be feasibly targeted by battery-powered printed microprocessors. However, our results also show the need to significantly reduce area and power of such printed microprocessors. We perform a design space exploration of printed microprocessor architectures over multiple parameters - datawidths, pipeline depth, etc. We show that the best cores outperform pre-existing cores by at least one order of magnitude in terms of power and area. Finally, we show that printing-specific architectural and low-level optimizations further improve area and power characteristics of low voltage battery-compatible printed microprocessors. Program-specific ISA, for example, improves power, and area by up to 4.18x and 1.93x respectively. Crosspoint-based instruction ROM outperforms a RAM-based design by 5.77x, 16.8x, and 2.42x respectively in terms of power, area, and delay.
Nathaniel Bleier, Muhammad Husnain Mubarik, Farhan Rasheed, Jasmin Aghassi-Hagmann, Mehdi Baradaran Tahoori, Rakesh Kumar 0002
ISCA3
2020 Crossover-aware Placement and Routing for Inkjet Printed Circuits
abstract
Printed Electronics technology is a key-enabler for smart sensors, soft robotics, and wearables. The inkjet printed electrolyte-gated field effect transistor (EGFET) technology is a promising candidate for such applications due to its low-power operation, high field-effect mobility, and on-demand fabrication. Unlike conventional silicon-based technologies, inkjet printed electronics technology is an additive manufacturing process where multiple layers are printed on top of each other to realize functional devices such as transistors and their interconnections. Due to the additive manufacturing process, the technology has limited routing layers. For routing of complex circuits, insulating crossovers are printed at the intersection of routing paths to isolate them. The crossover can alter the electrical properties of a circuit based on specific location on a routing path. In this work, we propose a crossover-aware placement and routing (COPnR) methodology for inkjet-printed circuits by integrating the crossover constraints in our design framework. Our proposed placement methodology is based on a state-of-the-art evolutionary algorithm while the routing optimization is done using a genetic algorithm. The proposed methodology is compared with the industrial standard placement and routing (PnR) tools. On average, the proposed methodology has 38% fewer crossovers and 94% fewer failing paths compared to the industrial PnR tools applied to printed circuit designs.
Farhan Rasheed, Michael Hefenbrock, Rajendra Bishnoi, Michael Beigl, Jasmin Aghassi-Hagmann, Mehdi Baradaran Tahoori
ACM J. Emerg. Technol. Comput. Syst.1
2020 A Novel Printed-Lookup-Table-Based Programmable Printed Digital Circuit
abstract
Advances in printed electronics (PE) enables new applications, particularly in ultra-low-cost domains. However, achieving high-throughput printing processes and manufacturing yield is one of the major challenges in the large-scale integration of PE technology. In this article, we present a programmable printed circuit based on an efficient printed lookup table (pLUT) to address these challenges by combining the advantages of the high-throughput advanced printing and maskless point-of-use final configuration printing. We propose a novel pLUT design which is more efficient in PE realization compared to existing LUT designs. The proposed pLUT design is simulated, fabricated, and programmed as different logic functions with inkjet printed conductive ink to prove that it can realize digital circuit functionality with the use of programmability features. The measurements show that the fabricated LUT design is operable at 1 V.
Ahmet Turan Erozan, Dennis Weller, Farhan Rasheed, Rajendra Bishnoi, Jasmin Aghassi-Hagmann, Mehdi Baradaran Tahoori
IEEE Trans. Very Large Scale Integr. Syst.3
2019 Predictive Modeling and Design Automation of Inorganic Printed Electronics
abstract
Printed Electronics is perceived to have a major impact in the fields of smart sensors, Internet of Things and wearables. Especially low power printed technologies such as electrolyte gated field effect transistors (EGFETs) using solution-processed inorganic materials and inkjet printing are very promising in such application domains. In this paper, we discuss a modeling approach to describe the variations of printed devices. Incorporating these models and design flows into our previously developed printed design system allows for robust circuit design. Additionally, we propose a reliability-aware routing solution for printed electronics technology based on the technology constraints in printing crossovers. The proposed methodology was validated on multiple benchmark circuits and can be easily integrated with the design automation tools-set.
Farhan Rasheed, Michael Hefenbrock, Rajendra Bishnoi, Michael Beigl, Jasmin Aghassi-Hagmann, Mehdi Baradaran Tahoori
DATE1
2018 From silicon to printed electronics: A coherent modeling and design flow approach based on printed electrolyte gated FETs
abstract
Printed electronics offers certain technological advantages over its silicon based counterparts, such as mechanical flexibility, low process temperatures, maskless and additive manufacturing process, leading to extremely low cost manufacturing. However, to be exploited in applications such as smart sensors, Internet of Things and wearables, it is essential that the printed devices operate at low supply voltages. Electrolyte gated field effect transistors (EGFETs) using solution-processed inorganic materials which are fully printed using inkjet printers at low temperatures are very promising candidates to provide such solutions. In this paper, we discuss the technology, process, modeling, fabrication, and design aspect of circuits based on EGFETs. We show how the measurements performed in the lab can accurately be modeled in order to be integrated in the design automation tool flow in the form of a Process Design Kit (PDK). We also review some of the remaining challenges in this technology and discuss our future directions to address them.
Gabriel Cadilha Marques, Farhan Rasheed, Jasmin Aghassi-Hagmann, Mehdi Baradaran Tahoori
ASP-DAC2