MingJin Sha

MingJin Sha


Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
17 November 2022 in Ecological Indicators
Verified
Journal Article
Open access
LLLanfang Liu
Lanfang Liu
JLJie Li
Jie Li
Jinliang WangJinliang Wang
Jinliang Wang
FLfang liu
fang liu
JCJanine Cole
Janine Cole
JZJingchun Zhou
Jingchun Zhou

1 July 2021 in Arabian Journal of Geosciences
Verified
Journal Article
Closed access
PDF file
BJBiao Jin
Biao Jin
WYWuheng Yang
Wuheng Yang
XLXuan Li
Xuan Li
MSMingJin Sha
MingJin Sha
XWXing Wang
Xing Wang

28 September 2018 in IEEE Access
Verified
Journal Article
Open access
BJBiao Jin
Biao Jin
MHMei-Huang Hong
Mei-Huang Hong
XLXue Lin
Xue Lin
MSMingJin Sha
MingJin Sha
Mobike is a leader in the bicycle-sharing industry, which commits to solving short-distance travel problems through the Internet. The rapid development of shared bicycles has been bringing very convenient for our travel. However, the problems of parking, high damage rates, and difficulty in reclaim have made many urban public space resources be taken up by these bicycles. In order to help the company maintain and manage its bicycles and service sites, the main contents of this paper focus on selecting the optimal service sites for Mobikes and planning the shortest circuit planning between service sites in each region. Our experimental data are the parking locations of Mobikes in Fuzhou city. The density-based clustering algorithm and an improved ant colony algorithm are adopted in this paper: 1) to divide a large data set into $N$ small uncorrelate data sets, the density-based clustering algorithm reveals the high-density region by finding the low-density region of the dataset, and this type of algorithm is used for selecting the service sites and 2) the problem that starting from the warehouse center, then traversing all the service sites in the region, and finally returning to the warehouse center can be classified as an NP-hard problem. In this paper, an improved ant colony algorithm is used to obtain the optimal solution. The main purpose of finding the shortest circuit traversing all service sites in the region is to provide better support and maintenance for each service site.

8 October 2018 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
BJBiao Jin
Biao Jin
MSMingJin Sha
MingJin Sha
JJJian-Wan Ji
Jian-Wan Ji
YLYi-Su Liu
Yi-Su Liu
WYWu-Heng Yang
Wu-Heng Yang
The study of cyberspace is faced with the challenge of the data shortage and model verification. This paper proposed a method to explore the regional cyberspace by employing Internet sequential information flows crawled from social network platforms. Compared with previous studies which only use one type of data sources for analysis, the main contribution of this manuscript is adopting the scheme that uses one kind of Internet information flow to extract cyberspace feature while relevant data collected from the other network platform is used for verification. Moreover, starting from measuring the informatization level of a region, a modified gravity model is designed by adding the value of informatization level to the traditional method. Then, an information association matrix based on the improved gravity model is constructed for analyzing the characteristics of cyberspace. To demonstrate the efficiency, Fuzhou city is considered as an interesting regional sample in this paper. The reasonable results indicate that the proposed approach is practical for regional cyberspace.