Yingtao Jiang

Yingtao Jiang

Auto-generated profile, based on publicly available information

Yingtao Jiang

Department of Electrical and Computer Engineering, Howard R. Hughes College of Engineering University of Nevada, Las Vegas Las Vegas Nevada USA

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2013 in Journal of Computer Science and Technology
Verified
Journal Article
Closed access
PDF file
XWXiao-Hang Wang
Xiao-Hang Wang
PLPeng Liu
Peng Liu
MYMei Yang
Mei Yang
MPMaurizio Palesi
Maurizio Palesi
YJYing-Tao Jiang
Ying-Tao Jiang
MHMichael C Huang
Michael C Huang

15 February 2021 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
HHHengli Huang
Hengli Huang
Xiaohang WangXiaohang Wang
Xiaohang Wang
YJYingtao Jiang
Yingtao Jiang
Amit Kumar SinghAmit Kumar Singh
Amit Kumar Singh
MYMei Yang
Mei Yang
LHLetian Huang
Letian Huang
The thermal covert channels (TCCs) in many-core systems can cause detrimental data breaches. In this article, we present a three-step scheme to detect and fight against such TCC attacks. Specifically, in the detection step, each core calculates the spectrum of its own CPU workload traces that are collected over a few fixed time intervals, and then it applies a frequency scanning method to detect if there exists any TCC attack. In the next positioning step, the logical cores running the transmitter threads are located. In the last step, the physical CPU cores suspiciously engaging in a TCC attack have to undertake dynamic voltage frequency scaling (DVFS) such that any possible TCC trace will be essentially wiped out. Our experiments have confirmed that on average 97% of the TCC attacks can be detected, and with the proposed defense, the packet error rate (PER) of a TCC attack can soar to more than 70%, literally shutting down the attack in practical terms. The performance penalty caused by the inclusion of the proposed DVFS countermeasures is found to be only 3% for an $8\times 8$ many-core system.

14 November 2022 in Bioinformatics
Verified
Journal Article
Open access
PDF file
YJYang Jiao
Yang Jiao
LGLingkun Gu
Lingkun Gu
YJYingtao Jiang
Yingtao Jiang
MWMo Weng
Mo Weng
MYMei Yang
Mei Yang
While multi-channel fluorescence microscopy is a vital imaging method in biological studies, the number of channels that can be imaged simultaneously is limited by technical and hardware limitations such as emission spectra cross-talk. One solution is using deep neural networks to model the localization relationship between two proteins so that the localization of one protein can be digitally predicted. Furthermore, the input and predicted localization implicitly reflect the modeled relationship. Accordingly, observing the response of the prediction via manipulating input localization could provide an informative way to analyze the modeled relationships between the input and the predicted proteins. We propose a protein localization prediction (PLP) method using a cGAN named 4D Reslicing Generative Adversarial Network (4DR-GAN) to digitally generate additional channels. 4DR-GAN models the joint probability distribution of input and output proteins by simultaneously incorporating the protein localization signals in four dimensions including space and time. Because protein localization often correlates with protein activation state, based on accurate PLP, we further propose two novel tools: digital activation (DA) and digital inactivation (DI) to digitally activate and inactivate a protein, in order to observing the response of the predicted protein localization. Compared with genetic approaches, these tools allow precise spatial and temporal control. A comprehensive experiment on six pairs of proteins shows that 4DR-GAN achieves higher-quality PLP than Pix2Pix, and the DA and DI responses are consistent with the known protein functions. The proposed PLP method helps simultaneously visualize additional proteins, and the developed DA and DI tools provide guidance to study localization-based protein functions. The open-source code is available at https://github.com/YangJiaoUSA/4DR-GAN. Supplementary data are available at Bioinformatics online.

1 November 2009 in Computers and Electrical Engineering
Verified
Journal Article
Closed access
LZLei Zhang
Lei Zhang
MYMei Yang
Mei Yang
YJYingtao Jiang
Yingtao Jiang
EREmma Regentova
Emma Regentova

1 January 2012 in Journal of Materials Chemistry
Verified
Journal Article
Closed access
PDF file
LQLihua Qian
Lihua Qian
SZShengjie (Patrick) Zhai
Shengjie (Patrick) Zhai
YJYingtao Jiang
Yingtao Jiang
BDBiswajit Das
Biswajit Das
Micron and sub-micron particles tend to be self-organized into well-defined arrays during conventional convective assembly, however this technique hardly works for the assembly of tiny nanoparticles smaller than 10 nm into monolayered arrays. The intrinsic difficulty is mainly related to the evaporation and convections occurring at a much larger volume than nanoparticle size. As a result, multilayered nanoparticle arrays are usually created. In this paper, we report that solvent evaporation and nanoparticle convection are artificially confined in nanoscale grooves near a pipette's periphery and the grooves can help assemble parallel strips because of the uni-directional translation of the pipette. The stacking layer of each strip is correlated with the grooves' diameter, thus the nanoparticle monolayer is fabricated in the tiny grooves. The narrowest strip width observed experimentally is geometrically limited by the effective diameter of the charged nanoparticles in gold colloid because nanoparticle convections from the inner chamber to the pipette's periphery will not occur within the grooves finer than the effective diameters.

18 November 2024 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
Xiaohang WangXiaohang Wang
Xiaohang Wang
YWYifan Wang
Yifan Wang
YJYingtao Jiang
Yingtao Jiang
Amit Kumar SinghAmit Kumar Singh
Amit Kumar Singh
MYMei Yang
Mei Yang
Multi-chiplet system design, by integrating multiple chiplets/dielets within a single package, has emerged as a promising paradigm in the post-Moore era. This paper introduces a novel task mapping algorithm for multi-chiplet based many-core systems, addressing the unique challenges posed by intra- and inter-chiplet communications under power and thermal constraints. Traditional task mapping algorithms fail to account for the latency and bandwidth differences between these communications, leading to sub-optimal performance in multi-chiplet systems. Our proposed algorithm employs a two-step process: (1) task assignment to chiplets using binary linear programming, leveraging a totally unimodular constraint matrix, and (2) intra-chiplet mapping that minimizes communication latency while considering both thermal and power constraints. This method strategically positions tasks with extensive inter-chiplet communication near interface nodes and centralizes those with predominant intra-chiplet communication. Experimental results demonstrate that the proposed algorithm outperforms existing methods (DAR and IOA) with a 37.5% and 24.7% reduction in execution time, respectively. Communication latency is also reduced by up to 43.2% and 32.9%, compared to DAR and IOA. These findings affirm that the proposed task mapping algorithm aligns well with the characteristics of multi-chiplet based many-core systems, and thus improves optimal performance.