Institution
Sun Yat-sen University
Education•Guangzhou, Guangdong, China•
About: Sun Yat-sen University is a education organization based out in Guangzhou, Guangdong, China. It is known for research contribution in the topics: Population & Cancer. The organization has 115149 authors who have published 113763 publications receiving 2286465 citations. The organization is also known as: Zhongshan University & SYSU.
Topics: Population, Cancer, Medicine, Cell growth, Metastasis
Papers published on a yearly basis
Papers
More filters
••
TL;DR: The present paper provides comprehensive information on the green extraction technologies of natural antioxidants, assessment of antioxidant activity at chemical and cellular based levels and their main resources from food and medicinal plants.
Abstract: Natural antioxidants are widely distributed in food and medicinal plants. These natural antioxidants, especially polyphenols and carotenoids, exhibit a wide range of biological effects, including anti-inflammatory, anti-aging, anti-atherosclerosis and anticancer. The effective extraction and proper assessment of antioxidants from food and medicinal plants are crucial to explore the potential antioxidant sources and promote the application in functional foods, pharmaceuticals and food additives. The present paper provides comprehensive information on the green extraction technologies of natural antioxidants, assessment of antioxidant activity at chemical and cellular based levels and their main resources from food and medicinal plants.
638 citations
••
TL;DR: Activated carbon cloth is used as an electrode, achieving an excellent areal capacitance of 88mF/cm(2) (8.8 mF/g) without the use of any other capacitive materials; when incorporated as part of a symmetric solid-state supercapacitor device, a remarkable charge/discharge rate capability is observed.
Abstract: Activated carbon cloth is used as an electrode, achieving an excellent areal capacitance of 88 mF/cm(2) (8.8 mF/g) without the use of any other capacitive materials. Significantly, when it is incorporated as part of a symmetric solid-state supercapacitor device, a remarkable charge/discharge rate capability is observed; 50% of the capacitance is retained when the charging rate increases from 10 to 10,000 mV/s.
638 citations
••
TL;DR: TianQin this article is a proposal for a space-borne detector of gravitational waves in the millihertz frequencies, which relies on a constellation of three drag-free spacecraft orbiting the Earth.
Abstract: TianQin is a proposal for a space-borne detector of gravitational waves in the millihertz frequencies. The experiment relies on a constellation of three drag-free spacecraft orbiting the Earth. Inter-spacecraft laser interferometry is used to monitor the distances between the test masses. The experiment is designed to be capable of detecting a signal with high confidence from a single source of gravitational waves within a few months of observing time. We describe the preliminary mission concept for TianQin, including the candidate source and experimental designs. We present estimates for the major constituents of the experiment's error budget and discuss the project's overall feasibility. Given the current level of technology readiness, we expect TianQin to be flown in the second half of the next decade.
634 citations
••
TL;DR: Compared with other PSO algorithms, the comparisons show that OLPSO significantly improves the performance of PSO, offering faster global convergence, higher solution quality, and stronger robustness.
Abstract: Particle swarm optimization (PSO) relies on its learning strategy to guide its search direction. Traditionally, each particle utilizes its historical best experience and its neighborhood's best experience through linear summation. Such a learning strategy is easy to use, but is inefficient when searching in complex problem spaces. Hence, designing learning strategies that can utilize previous search information (experience) more efficiently has become one of the most salient and active PSO research topics. In this paper, we proposes an orthogonal learning (OL) strategy for PSO to discover more useful information that lies in the above two experiences via orthogonal experimental design. We name this PSO as orthogonal learning particle swarm optimization (OLPSO). The OL strategy can guide particles to fly in better directions by constructing a much promising and efficient exemplar. The OL strategy can be applied to PSO with any topological structure. In this paper, it is applied to both global and local versions of PSO, yielding the OLPSO-G and OLPSO-L algorithms, respectively. This new learning strategy and the new algorithms are tested on a set of 16 benchmark functions, and are compared with other PSO algorithms and some state of the art evolutionary algorithms. The experimental results illustrate the effectiveness and efficiency of the proposed learning strategy and algorithms. The comparisons show that OLPSO significantly improves the performance of PSO, offering faster global convergence, higher solution quality, and stronger robustness.
633 citations
••
TL;DR: The proposed sparse correntropy framework is more robust and efficient in dealing with the occlusion and corruption problems in face recognition as compared to the related state-of-the-art methods and the computational cost is much lower than the SRC algorithms.
Abstract: In this paper, we present a sparse correntropy framework for computing robust sparse representations of face images for recognition. Compared with the state-of-the-art l1norm-based sparse representation classifier (SRC), which assumes that noise also has a sparse representation, our sparse algorithm is developed based on the maximum correntropy criterion, which is much more insensitive to outliers. In order to develop a more tractable and practical approach, we in particular impose nonnegativity constraint on the variables in the maximum correntropy criterion and develop a half-quadratic optimization technique to approximately maximize the objective function in an alternating way so that the complex optimization problem is reduced to learning a sparse representation through a weighted linear least squares problem with nonnegativity constraint at each iteration. Our extensive experiments demonstrate that the proposed method is more robust and efficient in dealing with the occlusion and corruption problems in face recognition as compared to the related state-of-the-art methods. In particular, it shows that the proposed method can improve both recognition accuracy and receiver operator characteristic (ROC) curves, while the computational cost is much lower than the SRC algorithms.
633 citations
Authors
Showing all 115971 results
Name | H-index | Papers | Citations |
---|---|---|---|
Yi Chen | 217 | 4342 | 293080 |
Jing Wang | 184 | 4046 | 202769 |
Yang Gao | 168 | 2047 | 146301 |
Yang Yang | 164 | 2704 | 144071 |
Peter Carmeliet | 164 | 844 | 122918 |
Frank J. Gonzalez | 160 | 1144 | 96971 |
Xiang Zhang | 154 | 1733 | 117576 |
Rui Zhang | 151 | 2625 | 107917 |
Seeram Ramakrishna | 147 | 1552 | 99284 |
Joseph J.Y. Sung | 142 | 1240 | 92035 |
Joseph Lau | 140 | 1048 | 99305 |
Bin Liu | 138 | 2181 | 87085 |
Georgios B. Giannakis | 137 | 1321 | 73517 |
Kwok-Yung Yuen | 137 | 1173 | 100119 |
Shu Li | 136 | 1001 | 78390 |