scispace - formally typeset
Search or ask a question
Institution

Nanjing University of Science and Technology

EducationNanjing, China
About: Nanjing University of Science and Technology is a education organization based out in Nanjing, China. It is known for research contribution in the topics: Catalysis & Computer science. The organization has 31581 authors who have published 36390 publications receiving 525474 citations. The organization is also known as: Nánjīng Lǐgōng Dàxué & Nánlǐgōng.


Papers
More filters
Proceedings ArticleDOI
01 Jun 2019
TL;DR: SKNet as discussed by the authors proposes a dynamic selection mechanism in CNNs that allows each neuron to adaptively adjust its receptive field size based on multiple scales of input information, which can capture target objects with different scales.
Abstract: In standard Convolutional Neural Networks (CNNs), the receptive fields of artificial neurons in each layer are designed to share the same size. It is well-known in the neuroscience community that the receptive field size of visual cortical neurons are modulated by the stimulus, which has been rarely considered in constructing CNNs. We propose a dynamic selection mechanism in CNNs that allows each neuron to adaptively adjust its receptive field size based on multiple scales of input information. A building block called Selective Kernel (SK) unit is designed, in which multiple branches with different kernel sizes are fused using softmax attention that is guided by the information in these branches. Different attentions on these branches yield different sizes of the effective receptive fields of neurons in the fusion layer. Multiple SK units are stacked to a deep network termed Selective Kernel Networks (SKNets). On the ImageNet and CIFAR benchmarks, we empirically show that SKNet outperforms the existing state-of-the-art architectures with lower model complexity. Detailed analyses show that the neurons in SKNet can capture target objects with different scales, which verifies the capability of neurons for adaptively adjusting their receptive field sizes according to the input. The code and models are available at https://github.com/implus/SKNet.

1,401 citations

Journal ArticleDOI
TL;DR: Novel 2D mono-elemental semiconductors, namely monolayered arsenene and antimonene, with wide band gaps and high stability were now developed based on first-principles calculations, which could pave the way for transistors with high on/off ratios, optoelectronic devices working under blue or UV light, and mechanical sensors based on new 2D crystals.
Abstract: The typical two-dimensional (2D) semiconductors MoS2, MoSe2, WS2, WSe2 and black phosphorus have garnered tremendous interest for their unique electronic, optical, and chemical properties. However, all 2D semiconductors reported thus far feature band gaps that are smaller than 2.0 eV, which has greatly restricted their applications, especially in optoelectronic devices with photoresponse in the blue and UV range. Novel 2D mono-elemental semiconductors, namely monolayered arsenene and antimonene, with wide band gaps and high stability were now developed based on first-principles calculations. Interestingly, although As and Sb are typically semimetals in the bulk, they are transformed into indirect semiconductors with band gaps of 2.49 and 2.28 eV when thinned to one atomic layer. Significantly, under small biaxial strain, these materials were transformed from indirect into direct band-gap semiconductors. Such dramatic changes in the electronic structure could pave the way for transistors with high on/off ratios, optoelectronic devices working under blue or UV light, and mechanical sensors based on new 2D crystals.

1,376 citations

Proceedings ArticleDOI
01 Oct 2017
TL;DR: A very deep persistent memory network (MemNet) is proposed that introduces a memory block, consisting of a recursive unit and a gate unit, to explicitly mine persistent memory through an adaptive learning process.
Abstract: Recently, very deep convolutional neural networks (CNNs) have been attracting considerable attention in image restoration. However, as the depth grows, the longterm dependency problem is rarely realized for these very deep models, which results in the prior states/layers having little influence on the subsequent ones. Motivated by the fact that human thoughts have persistency, we propose a very deep persistent memory network (MemNet) that introduces a memory block, consisting of a recursive unit and a gate unit, to explicitly mine persistent memory through an adaptive learning process. The recursive unit learns multi-level representations of the current state under different receptive fields. The representations and the outputs from the previous memory blocks are concatenated and sent to the gate unit, which adaptively controls how much of the previous states should be reserved, and decides how much of the current state should be stored. We apply MemNet to three image restoration tasks, i.e., image denosing, super-resolution and JPEG deblocking. Comprehensive experiments demonstrate the necessity of the MemNet and its unanimous superiority on all three tasks over the state of the arts. Code is available at https://github.com/tyshiwo/MemNet.

1,289 citations

Posted ContentDOI
Spyridon Bakas1, Mauricio Reyes, Andras Jakab2, Stefan Bauer3  +435 moreInstitutions (111)
TL;DR: This study assesses the state-of-the-art machine learning methods used for brain tumor image analysis in mpMRI scans, during the last seven instances of the International Brain Tumor Segmentation (BraTS) challenge, i.e., 2012-2018, and investigates the challenge of identifying the best ML algorithms for each of these tasks.
Abstract: Gliomas are the most common primary brain malignancies, with different degrees of aggressiveness, variable prognosis and various heterogeneous histologic sub-regions, i.e., peritumoral edematous/invaded tissue, necrotic core, active and non-enhancing core. This intrinsic heterogeneity is also portrayed in their radio-phenotype, as their sub-regions are depicted by varying intensity profiles disseminated across multi-parametric magnetic resonance imaging (mpMRI) scans, reflecting varying biological properties. Their heterogeneous shape, extent, and location are some of the factors that make these tumors difficult to resect, and in some cases inoperable. The amount of resected tumoris a factor also considered in longitudinal scans, when evaluating the apparent tumor for potential diagnosis of progression. Furthermore, there is mounting evidence that accurate segmentation of the various tumor sub-regions can offer the basis for quantitative image analysis towards prediction of patient overall survival. This study assesses thestate-of-the-art machine learning (ML) methods used for brain tumor image analysis in mpMRI scans, during the last seven instances of the International Brain Tumor Segmentation (BraTS) challenge, i.e., 2012-2018. Specifically, we focus on i) evaluating segmentations of the various glioma sub-regions in pre-operative mpMRI scans, ii) assessing potential tumor progression by virtue of longitudinal growth of tumor sub-regions, beyond use of the RECIST/RANO criteria, and iii) predicting the overall survival from pre-operative mpMRI scans of patients that underwent gross tota lresection. Finally, we investigate the challenge of identifying the best ML algorithms for each of these tasks, considering that apart from being diverse on each instance of the challenge, the multi-institutional mpMRI BraTS dataset has also been a continuously evolving/growing dataset.

1,165 citations

Journal ArticleDOI
TL;DR: In GNMF, an affinity graph is constructed to encode the geometrical information and a matrix factorization is sought, which respects the graph structure, and the empirical study shows encouraging results of the proposed algorithm in comparison to the state-of-the-art algorithms on real-world problems.
Abstract: Recently, multiple graph regularizer based methods have shown promising performances in data representation However, the parameter choice of the regularizer is crucial to the performance of clustering and its optimal value changes for different real datasets To deal with this problem, we propose a novel method called Parameter-less Auto-weighted Multiple Graph regularized Nonnegative Matrix Factorization (PAMGNMF) in this paper PAMGNMF employs the linear combination of multiple simple graphs to approximate the manifold structure of data as previous methods do Moreover, the proposed method can automatically learn an optimal weight for each graph without introducing an additive parameter Therefore, the proposed PAMGNMF method is easily applied to practical problems Extensive experimental results on different real-world datasets have demonstrated that the proposed method achieves better performance than the state-of-the-art approaches

1,082 citations


Authors

Showing all 31818 results

NameH-indexPapersCitations
Jian Yang1421818111166
Liming Dai14178182937
Hui Li1352982105903
Jian Zhou128300791402
Shuicheng Yan12381066192
Zidong Wang12291450717
Xin Wang121150364930
Xuan Zhang119153065398
Zhenyu Zhang118116764887
Xin Li114277871389
Zeshui Xu11375248543
Xiaoming Li113193272445
Chunhai Fan11270251735
H. Vincent Poor109211667723
Qian Wang108214865557
Network Information
Related Institutions (5)
Harbin Institute of Technology
109.2K papers, 1.6M citations

96% related

South China University of Technology
69.4K papers, 1.2M citations

94% related

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

94% related

Tsinghua University
200.5K papers, 4.5M citations

93% related

Tianjin University
79.9K papers, 1.2M citations

93% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
2023107
2022594
20214,309
20203,990
20193,920
20183,211