全文获取类型
收费全文 | 5126篇 |
免费 | 427篇 |
国内免费 | 319篇 |
专业分类
化学 | 209篇 |
晶体学 | 2篇 |
力学 | 30篇 |
综合类 | 139篇 |
数学 | 5252篇 |
物理学 | 240篇 |
出版年
2024年 | 5篇 |
2023年 | 100篇 |
2022年 | 140篇 |
2021年 | 114篇 |
2020年 | 198篇 |
2019年 | 223篇 |
2018年 | 216篇 |
2017年 | 196篇 |
2016年 | 124篇 |
2015年 | 82篇 |
2014年 | 183篇 |
2013年 | 447篇 |
2012年 | 184篇 |
2011年 | 301篇 |
2010年 | 305篇 |
2009年 | 441篇 |
2008年 | 395篇 |
2007年 | 284篇 |
2006年 | 324篇 |
2005年 | 227篇 |
2004年 | 208篇 |
2003年 | 180篇 |
2002年 | 167篇 |
2001年 | 146篇 |
2000年 | 111篇 |
1999年 | 97篇 |
1998年 | 96篇 |
1997年 | 67篇 |
1996年 | 46篇 |
1995年 | 53篇 |
1994年 | 40篇 |
1993年 | 28篇 |
1992年 | 25篇 |
1991年 | 14篇 |
1990年 | 12篇 |
1989年 | 14篇 |
1988年 | 15篇 |
1987年 | 10篇 |
1986年 | 4篇 |
1985年 | 12篇 |
1984年 | 12篇 |
1983年 | 3篇 |
1982年 | 10篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有5872条查询结果,搜索用时 31 毫秒
1.
2.
该文研究了以下高阶Yamabe型方程Lm,pu?g|u|^p?2u=λf|u|α?2u在有限图上的非平凡正解的存在性,其中Lm,p是一个2m阶差分算子,它是一种p次(?Δ)^m算子更一般化,α≥p≥2,g>0和f>0是定义在G的所有顶点上的实函数,m≥1是一个整数. 相似文献
3.
4.
5.
Xun Zhang Lanyan Yang Bin Zhang Ying Liu Dong Jiang Xiaohai Qin Mengmeng Hao 《Entropy (Basel, Switzerland)》2021,23(4)
The problem of extracting meaningful data through graph analysis spans a range of different fields, such as social networks, knowledge graphs, citation networks, the World Wide Web, and so on. As increasingly structured data become available, the importance of being able to effectively mine and learn from such data continues to grow. In this paper, we propose the multi-scale aggregation graph neural network based on feature similarity (MAGN), a novel graph neural network defined in the vertex domain. Our model provides a simple and general semi-supervised learning method for graph-structured data, in which only a very small part of the data is labeled as the training set. We first construct a similarity matrix by calculating the similarity of original features between all adjacent node pairs, and then generate a set of feature extractors utilizing the similarity matrix to perform multi-scale feature propagation on graphs. The output of multi-scale feature propagation is finally aggregated by using the mean-pooling operation. Our method aims to improve the model representation ability via multi-scale neighborhood aggregation based on feature similarity. Extensive experimental evaluation on various open benchmarks shows the competitive performance of our method compared to a variety of popular architectures. 相似文献
6.
Hongming Zhu Xiaowen Wang Yizhi Jiang Hongfei Fan Bowen Du Qin Liu 《Entropy (Basel, Switzerland)》2021,23(5)
Instance matching is a key task in knowledge graph fusion, and it is critical to improving the efficiency of instance matching, given the increasing scale of knowledge graphs. Blocking algorithms selecting candidate instance pairs for comparison is one of the effective methods to achieve the goal. In this paper, we propose a novel blocking algorithm named MultiObJ, which constructs indexes for instances based on the Ordered Joint of Multiple Objects’ features to limit the number of candidate instance pairs. Based on MultiObJ, we further propose a distributed framework named Follow-the-Regular-Leader Instance Matching (FTRLIM), which matches instances between large-scale knowledge graphs with approximately linear time complexity. FTRLIM has participated in OAEI 2019 and achieved the best matching quality with significantly efficiency. In this research, we construct three data collections based on a real-world large-scale knowledge graph. Experiment results on the constructed data collections and two real-world datasets indicate that MultiObJ and FTRLIM outperform other state-of-the-art methods. 相似文献
7.
Given a graph sequence denote by T3(Gn) the number of monochromatic triangles in a uniformly random coloring of the vertices of Gn with colors. In this paper we prove a central limit theorem (CLT) for T3(Gn) with explicit error rates, using a quantitative version of the martingale CLT. We then relate this error term to the well-known fourth-moment phenomenon, which, interestingly, holds only when the number of colors satisfies . We also show that the convergence of the fourth moment is necessary to obtain a Gaussian limit for any , which, together with the above result, implies that the fourth-moment condition characterizes the limiting normal distribution of T3(Gn), whenever . Finally, to illustrate the promise of our approach, we include an alternative proof of the CLT for the number of monochromatic edges, which provides quantitative rates for the results obtained in [7]. 相似文献
8.
《Discrete Mathematics》2022,345(10):113028
We prove that every 52-connected line graph of a rank 3 hypergraph is Hamiltonian. This is the first result of this type for hypergraphs of bounded rank other than ordinary graphs. 相似文献
9.
《Discrete Mathematics》2022,345(9):112954
One of the remarkable contributions in the study of symmetric Cayley graphs on nonabelian simple groups is the complete classification of such graphs that are cubic and nonnormal. This naturally motivates the study of cubic (normal and nonnormal) symmetric bi-Cayley graphs on nonabelian simple groups. In this paper, the full automorphism groups of these graphs are determined, and necessary and sufficient conditions are given for a graph being a cubic normal symmetric Cayley or bi-Cayley graph on a nonabelian simple group (one may then find many examples). As an application, we also prove that cubic symmetric Cayley graphs on nonabelian simple groups are stable. 相似文献
10.
《Journal of Pure and Applied Algebra》2022,226(12):107134
The notion of a group action can be extended to the case of gyrogroups. In this article, we examine a digraph and graph associated with a gyrogroup action on a finite nonempty set, called a Schreier digraph and graph. We show that algebraic properties of gyrogroups and gyrogroup actions such as being gyrocommutative, being transitive, and being fixed-point-free are reflected in their Schreier digraphs and graphs. We also prove graph-theoretic versions of the three fundamental theorems involving actions: the Cauchy–Frobenius lemma (also known as the Burnside lemma), the orbit-stabilizer theorem, and the orbit decomposition theorem. Finally, we make a connection between gyrogroup actions and actions of symmetric groups by evaluation via Schreier digraphs and graphs. 相似文献