Institution
Shanghai University
Education•Shanghai, Shanghai, China•
About: Shanghai University is a education organization based out in Shanghai, Shanghai, China. It is known for research contribution in the topics: Microstructure & Catalysis. The organization has 59583 authors who have published 56840 publications receiving 753549 citations. The organization is also known as: Shànghǎi Dàxué.
Topics: Microstructure, Catalysis, Computer science, Nonlinear system, Graphene
Papers published on a yearly basis
Papers
More filters
••
TL;DR: In this article, the authors examined the impact of energy depletion rate, renewable energy consumption, depletion rate of non-renewable energy, and GDP on CO2 emissions in Thailand from 1980 to 2018.
130 citations
••
TL;DR: It was demonstrated that circRNA_0001178 and circ RNA_0000826 were significantly upregulated in CRC-m tissues, and both of them had the potential for diagnosing liver metastases from colorectal cancer.
Abstract: In this study, the secondary sequencing was used to profile circRNA expression in the tissue samples from three CRC patients with liver metastasis and three matched CRC patients. After verified some candidates in another 40 CRC and CRC-m samples by qRT-PCR, we further demonstrated that circRNA_0001178 and circRNA_0000826 were significantly upregulated in CRC-m tissues, and both of them had the potential for diagnosing liver metastases from colorectal cancer. Finally, the networks of circRNA-miRNA-mRNA base on these two circRNAs were constructed respectively. This study showed that differentially expressed circRNAs were existed between the tissue samples from colorectal cancer patients with and without liver metastasis. And also suggested that circRNA_0001178 and circRNA_0000826 may serve as a potential diagnostic biomarker for liver metastases from colorectal cancer.
130 citations
••
TL;DR: A novel incentive scheme to stimulate selfish nodes to participate in bundle delivery in MSNs through a bargain game and simulation results show that the proposal can improve the performance of the existing schemes significantly.
Abstract: Rapid developments in mobile services and wireless technologies have prompted users to form mobile social networks (MSNs), where bundles can be delivered via opportunistic peer-to-peer links in a store–carry–forward mode. This mode needs all nodes to work in a cooperative way. However, mobile nodes may be selfish and might not be willing to forward data to others due to the limited resources (e.g., buffer and energy), resulting in degraded system performance. To tackle the aforementioned problem, this paper proposes a novel incentive scheme to stimulate selfish nodes to participate in bundle delivery in MSNs. At first, a virtual currency is introduced to pay for the relay service. Then, a bundle carrier selects a relay node from its friends or other strangers based on its status. Next, a bargain game is employed to model the transaction pricing for relay service. In addition, the simulation results show that the proposal can improve the performance of the existing schemes significantly.
130 citations
••
TL;DR: In this article, finite difference methods with non-uniform meshes for solving nonlinear fractional differential equations are presented, where the non-equidistant stepsize is non-decreasing and the rectangle formula and trapezoid formula are proposed based on theNon- uniform meshes.
130 citations
••
TL;DR: An unsupervised salient object segmentation approach based on kernel density estimation (KDE) and two-phase graph cut that efficiently utilizes the information of minimum cut generated using the KDE model based graph cut, and exploits a balancing weight update scheme for convergence of segmentation refinement.
Abstract: In this paper, we propose an unsupervised salient object segmentation approach based on kernel density estimation (KDE) and two-phase graph cut. A set of KDE models are first constructed based on the pre-segmentation result of the input image, and then for each pixel, a set of likelihoods to fit all KDE models are calculated accordingly. The color saliency and spatial saliency of each KDE model are then evaluated based on its color distinctiveness and spatial distribution, and the pixel-wise saliency map is generated by integrating likelihood measures of pixels and saliency measures of KDE models. In the first phase of salient object segmentation, the saliency map based graph cut is exploited to obtain an initial segmentation result. In the second phase, the segmentation is further refined based on an iterative seed adjustment method, which efficiently utilizes the information of minimum cut generated using the KDE model based graph cut, and exploits a balancing weight update scheme for convergence of segmentation refinement. Experimental results on a dataset containing 1000 test images with ground truths demonstrate the better segmentation performance of our approach.
130 citations
Authors
Showing all 59993 results
Name | H-index | Papers | Citations |
---|---|---|---|
Zhong Lin Wang | 245 | 2529 | 259003 |
Yang Yang | 171 | 2644 | 153049 |
Yang Liu | 129 | 2506 | 122380 |
Zhen Li | 127 | 1712 | 71351 |
Xin Wang | 121 | 1503 | 64930 |
Jian Liu | 117 | 2090 | 73156 |
Xin Li | 114 | 2778 | 71389 |
Wei Zhang | 112 | 1189 | 93641 |
Jianjun Liu | 112 | 1040 | 71032 |
Liquan Chen | 111 | 689 | 44229 |
Jin-Quan Yu | 111 | 438 | 43324 |
Jonathan L. Sessler | 111 | 997 | 48758 |
Peng Wang | 108 | 1672 | 54529 |
Qian Wang | 108 | 2148 | 65557 |
Wei Zhang | 104 | 2911 | 64923 |