Bo Jiang

Bo Jiang

Auto-generated profile, based on publicly available information

Bo Jiang

School of Mathematical Sciences, Nanjing Normal University, Nanjing, China

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
9 October 2020 in Information
Verified
Journal Article
Open access
PDF file
YHYanbai He
Yanbai He
RCRui Chen
Rui Chen
XLxinya li
xinya li
Chunyan HaoChunyan Hao
Chunyan Hao
SLSijiang Liu
Sijiang Liu
Bo JiangBo Jiang
Bo Jiang
Although online learning platforms are gradually becoming commonplace in modern society, learners’ high dropout rates and serious academic performance require more attention within the virtual learning environment (VLE). This study aims to predict students’ performance in a specific course as it is continuously running, using the statistic personal biographical information and sequential behavior data with VLE. To achieve this goal, a novel recurrent neural network (RNN)-gated recurrent unit (GRU) joint neural network is proposed to fit both static and sequential data, where the data completion mechanism is also adopted to fill the missing stream data. To incorporate the sequential relationship of learning data, three kinds of time-series deep neural network algorithms: simple RNN, GRU, and LSTM are first taken into consideration as baseline models. Their performances are compared in identifying at-risk students. Experimental results on Open University Learning Analytics Dataset (OULAD) show that simple methods like GRU and simple RNN have better results than the relatively complex LSTM model. The results also reveal that different models have different peak performance time, which results in the proposed joint model that achieves over 80% prediction accuracy of at-risk students at the end of the semester.

22 February 2017 in Biometrika
Verified
Journal Article
Open access
PDF file
XWX. Wang
X. Wang
BJB. Jiang
B. Jiang
JLJun Liu
Jun Liu
SUMMARY: Detecting dependence between two random variables is a fundamental problem. Although the Pearson correlation coefficient is effective for capturing linear dependence, it can be entirely powerless for detecting nonlinear and/or heteroscedastic patterns. We introduce a new measure, G-squared, to test whether two univariate random variables are independent and to measure the strength of their relationship. The G-squared statistic is almost identical to the square of the Pearson correlation coefficient, R-squared, for linear relationships with constant error variance, and has the intuitive meaning of the piecewise R-squared between the variables. It is particularly effective in handling nonlinearity and heteroscedastic errors. We propose two estimators of G-squared and show their consistency. Simulations demonstrate that G-squared estimators are among the most powerful test statistics compared with several state-of-the-art methods.

14 April 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
Bo JiangBo Jiang
Bo Jiang
XLxinya li
xinya li
SYShuhao Yang
Shuhao Yang
YKYaqi Kong
Yaqi Kong
WCWei Cheng
Wei Cheng
QLQiaomin Lin
Qiaomin Lin
Personalized learning paths aim to save learning time and improve learning achievements by providing the most appropriate learning sequence for heterogeneous students. Most existing methods that construct personalized learning paths focus on students’ characteristics or knowledge structure, while ignoring the critical roles of learning states. This study describes a dynamic personalized learning path planning algorithm to recommend appropriate knowledge points for online students based on their learning states and the difficulty of each knowledge point. The proposed method first calculates the difficulty of knowledge points automatically and constructs a knowledge difficulty model. Then, a dynamic knowledge mastery model is built based on learning behavior and normalized test scores. Finally, a path that satisfies students’ personalized changing states is generated. To achieve the aforementioned goal, a novel method that calculates the difficulty of knowledge points automatically is proposed. Moreover, the personalized learning path planning method proposed in this research is not limited to a particular course. To evaluate the method, we use a series of approaches to verify the impact of the personalized path on student learning. The experimental results demonstrate that the proposed algorithm can effectively generate personalized learning paths. Results demonstrate that the personalized path proposed by the algorithm can improve effective behavior rates, course completion rates and learning efficiency. Results also show that the personalized learning paths based on student states would help students to master knowledge.

1 May 2012 in The American Journal of Pathology
Verified
Journal Article
Open access
YCYufang Che
Yufang Che
FYFei Ye
Fei Ye
RXRuliang Xu
Ruliang Xu
HQHaitao Qing
Haitao Qing
XWXinying Wang
Xinying Wang
DZDavid Y. Zhang
David Y. Zhang
Hepatocellular carcinoma (HCC) is one of the most common malignant tumors in the world. Despite improved diagnosis and treatment, the prognosis for HCC patients remains poor. The goal of this study was to identify key regulatory proteins and signaling pathways important for cell apoptosis and proliferation as biomarkers for prognostication and targeted therapy. Protein Pathway Array was applied to screen 38 signaling proteins and phosphoproteins in 12 paired HCC tumors and surrounding benign tissues and found that 20 of them, including XIAP, CDK4, CDK6, and Cyclin D1, were overexpressed in HCC tissues. Immunostaining results of XIAP, CDK4, and Cyclin D1 in an additional 59 HCC tissues showed that the expression of XIAP correlated with the expression of CDK4/Cyclin D1, and that the increased expression of these proteins correlated with poor overall survival in these patients. Further studies using the HCC Huh7 cell line transfected with XIAP siRNA or expression vector demonstrated that XIAP regulated the expression of CDK4, CDK6, and Cyclin D1 via NF-êB and PTEN pathways. Finally, inhibition of XIAP using embelin, a XIAP-specific small molecule, leads to an increased apoptosis and decreased cell proliferation via arrest at G1 phase. Taken together, XIAP is a central modulator regulating cell apoptosis and cell cycle progression. Therefore, XIAP together with cell cycle regulatory proteins can be used as prognostic markers and therapeutic targets.

24 February 2023 in Remote Sensing
Verified
Journal Article
Open access
PDF file
HZHao Zhang
Hao Zhang
Chunyan HaoChunyan Hao
Chunyan Hao
WSwanru song
wanru song
Bo JiangBo Jiang
Bo Jiang
BLBaozhu Li
Baozhu Li
In the field of object detection, deep learning models have achieved great success in recent years. Despite these advances, detecting small objects remains difficult. Most objects in aerial images have features that are a challenge for traditional object detection techniques, including small size, high density, high variability, and varying orientation. Previous approaches have used slicing methods on high-resolution images or feature maps to improve performance. However, existing slicing methods inevitably lead to redundant computation. Therefore, in this article we present a novel adaptive slicing method named ASAHI (Adaptive Slicing Aided Hyper Inference), which can dramatically reduce redundant computation using an adaptive slicing size. Specifically, ASAHI focuses on the number of slices rather than the slicing size, that is, it adaptively adjusts the slicing size to control the number of slices according to the image resolution. Additionally, we replace the standard non-maximum suppression technique with Cluster-DIoU-NMS due to its improved accuracy and inference speed in the post-processing stage. In extensive experiments, ASAHI achieves competitive performance on the VisDrone and xView datasets. The results show that the mAP50 is increased by 0.9% and the computation time is reduced by 20–25% compared with state-of-the-art slicing methods on the TPH-YOLOV5 pretrained model. On the VisDrone2019-DET-val dataset, our mAP50 result is 56.4% higher, demonstrating the superiority of our approach.
1

3 April 2015 in Journal of the American Statistical Association
Verified
Journal Article
Closed access
BJBo Jiang
Bo Jiang
CYChao Ye
Chao Ye
JLJun Liu
Jun Liu
K-sample testing problems arise in many scientific applications and have attracted statisticians’ attention for many years. We propose an omnibus nonparametric method based on an optimal discretization (aka “slicing”) of continuous random variables in the test. The novelty of our approach lies in the inclusion of a term penalizing the number of slices (i.e., the resolution of the discretization) so as to regularize the corresponding likelihood-ratio test statistic. An efficient dynamic programming algorithm is developed to determine the optimal slicing scheme. Asymptotic and finite-sample properties such as power and null distribution of the resulting test statistic are studied. We compare the proposed testing method with some existing well-known methods and demonstrate its statistical power through extensive simulation studies as well as a real data example. A dynamic slicing method for the one-sample testing problem is further developed and studied under the same framework. Supplementary materials including technical derivations and proofs are available online.