scispace - formally typeset
Search or ask a question
Institution

Nanjing University of Information Science and Technology

EducationNanjing, China
About: Nanjing University of Information Science and Technology is a education organization based out in Nanjing, China. It is known for research contribution in the topics: Precipitation & Aerosol. The organization has 14129 authors who have published 17985 publications receiving 267578 citations. The organization is also known as: Nan Xin Da.


Papers
More filters
Journal ArticleDOI
TL;DR: The accuracy of state-of-the-art global barotropic tide models is assessed using bottom pressure data, coastal tide gauges, satellite altimetry, various geodetic data on Antarctic ice shelves, and independent tracked satellite orbit perturbations as discussed by the authors.
Abstract: The accuracy of state-of-the-art global barotropic tide models is assessed using bottom pressure data, coastal tide gauges, satellite altimetry, various geodetic data on Antarctic ice shelves, and independent tracked satellite orbit perturbations. Tide models under review include empirical, purely hydrodynamic (“forward”), and assimilative dynamical, i.e., constrained by observations. Ten dominant tidal constituents in the diurnal, semidiurnal, and quarter-diurnal bands are considered. Since the last major model comparison project in 1997, models have improved markedly, especially in shallow-water regions and also in the deep ocean. The root-sum-square differences between tide observations and the best models for eight major constituents are approximately 0.9, 5.0, and 6.5 cm for pelagic, shelf, and coastal conditions, respectively. Large intermodel discrepancies occur in high latitudes, but testing in those regions is impeded by the paucity of high-quality in situ tide records. Long-wavelength components of models tested by analyzing satellite laser ranging measurements suggest that several models are comparably accurate for use in precise orbit determination, but analyses of GRACE intersatellite ranging data show that all models are still imperfect on basin and subbasin scales, especially near Antarctica. For the M2 constituent, errors in purely hydrodynamic models are now almost comparable to the 1980-era Schwiderski empirical solution, indicating marked advancement in dynamical modeling. Assessing model accuracy using tidal currents remains problematic owing to uncertainties in in situ current meter estimates and the inability to isolate the barotropic mode. Velocity tests against both acoustic tomography and current meters do confirm that assimilative models perform better than purely hydrodynamic models.

339 citations

Journal ArticleDOI
TL;DR: A brief review on several key technologies of BMS, including battery modelling, state estimation and battery charging, followed by the introduction of key technologies used in BMS.
Abstract: Batteries have been widely applied in many high-power applications, such as electric vehicles (EVs) and hybrid electric vehicles, where a suitable battery management system (BMS) is vital in ensuring safe and reliable operation of batteries. This paper aims to give a brief review on several key technologies of BMS, including battery modelling, state estimation and battery charging. First, popular battery types used in EVs are surveyed, followed by the introduction of key technologies used in BMS. Various battery models, including the electric model, thermal model and coupled electro-thermal model are reviewed. Then, battery state estimations for the state of charge, state of health and internal temperature are comprehensively surveyed. Finally, several key and traditional battery charging approaches with associated optimization methods are discussed.

338 citations

Journal ArticleDOI
TL;DR: This paper uses two finite mixture models to capture the structural information of the data from binary classification and proposes a structural MPM, which can be interpreted as a large margin classifier and can be transformed to support vector machine and maxi–min margin machine under certain special conditions.
Abstract: Minimax probability machine (MPM) is an interesting discriminative classifier based on generative prior knowledge. It can directly estimate the probabilistic accuracy bound by minimizing the maximum probability of misclassification. The structural information of data is an effective way to represent prior knowledge, and has been found to be vital for designing classifiers in real-world problems. However, MPM only considers the prior probability distribution of each class with a given mean and covariance matrix, which does not efficiently exploit the structural information of data. In this paper, we use two finite mixture models to capture the structural information of the data from binary classification. For each subdistribution in a finite mixture model, only its mean and covariance matrix are assumed to be known. Based on the finite mixture models, we propose a structural MPM (SMPM). SMPM can be solved effectively by a sequence of the second-order cone programming problems. Moreover, we extend a linear model of SMPM to a nonlinear model by exploiting kernelization techniques. We also show that the SMPM can be interpreted as a large margin classifier and can be transformed to support vector machine and maxi–min margin machine under certain special conditions. Experimental results on both synthetic and real-world data sets demonstrate the effectiveness of SMPM.

337 citations

Journal ArticleDOI
TL;DR: A fast image similarity measurement based on random verification is proposed to efficiently implement copy detection and the proposed method achieves higher accuracy than the state-of-the-art methods, and has comparable efficiency to the baseline method based on the BOW quantization.
Abstract: To detect illegal copies of copyrighted images, recent copy detection methods mostly rely on the bag-of-visual-words (BOW) model, in which local features are quantized into visual words for image matching. However, both the limited discriminability of local features and the BOW quantization errors will lead to many false local matches, which make it hard to distinguish similar images from copies. Geometric consistency verification is a popular technology for reducing the false matches, but it neglects global context information of local features and thus cannot solve this problem well. To address this problem, this paper proposes a global context verification scheme to filter false matches for copy detection. More specifically, after obtaining initial scale invariant feature transform (SIFT) matches between images based on the BOW quantization, the overlapping region-based global context descriptor (OR-GCD) is proposed for the verification of these matches to filter false matches. The OR-GCD not only encodes relatively rich global context information of SIFT features but also has good robustness and efficiency. Thus, it allows an effective and efficient verification. Furthermore, a fast image similarity measurement based on random verification is proposed to efficiently implement copy detection. In addition, we also extend the proposed method for partial-duplicate image detection. Extensive experiments demonstrate that our method achieves higher accuracy than the state-of-the-art methods, and has comparable efficiency to the baseline method based on the BOW quantization.

332 citations

Journal ArticleDOI
01 May 2018
TL;DR: A self-adaptive ABC algorithm based on the global best candidate (SABC-GB) for global optimization that is superior to the other algorithms for solving complex optimization problems and validated in real-world application.
Abstract: Intelligent optimization algorithms based on evolutionary and swarm principles have been widely researched in recent years. The artificial bee colony (ABC) algorithm is an intelligent swarm algorithm for global optimization problems. Previous studies have shown that the ABC algorithm is an efficient, effective, and robust optimization method. However, the solution search equation used in ABC is insufficient, and the strategy for generating candidate solutions results in good exploration ability but poor exploitation performance. Although some complex strategies for generating candidate solutions have recently been developed, the universality and robustness of these new algorithms are still insufficient. This is mainly because only one strategy is adopted in the modified ABC algorithm. In this paper, we propose a self-adaptive ABC algorithm based on the global best candidate (SABC-GB) for global optimization. Experiments are conducted on a set of 25 benchmark functions. To ensure a fair comparison with other algorithms, we employ the same initial population for all algorithms on each benchmark function. Besides, to validate the feasibility of SABC-GB in real-world application, we demonstrate its application to a real clustering problem based on the K-means technique. The results demonstrate that SABC-GB is superior to the other algorithms for solving complex optimization problems. It means that it is a new technique to improve the ABC by introducing self-adaptive mechanism.

330 citations


Authors

Showing all 14448 results

NameH-indexPapersCitations
Ashok Kumar1515654164086
Lei Zhang135224099365
Bin Wang126222674364
Shuicheng Yan12381066192
Zeshui Xu11375248543
Xiaoming Li113193272445
Qiang Yang112111771540
Yan Zhang107241057758
Fei Wang107182453587
Yongfa Zhu10535533765
James C. McWilliams10453547577
Zhi-Hua Zhou10262652850
Tao Li102248360947
Lei Liu98204151163
Jian Feng Ma9730532310
Network Information
Related Institutions (5)
Chinese Academy of Sciences
634.8K papers, 14.8M citations

90% related

University of Science and Technology of China
101K papers, 2.4M citations

88% related

City University of Hong Kong
60.1K papers, 1.7M citations

88% related

Harbin Institute of Technology
109.2K papers, 1.6M citations

88% related

Nanjing University
105.5K papers, 2.2M citations

87% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
2023173
2022552
20213,001
20202,492
20192,221
20181,822