全文获取类型
收费全文 | 5377篇 |
免费 | 424篇 |
国内免费 | 337篇 |
专业分类
化学 | 210篇 |
晶体学 | 2篇 |
力学 | 26篇 |
综合类 | 144篇 |
数学 | 5442篇 |
物理学 | 314篇 |
出版年
2024年 | 23篇 |
2023年 | 102篇 |
2022年 | 181篇 |
2021年 | 132篇 |
2020年 | 205篇 |
2019年 | 231篇 |
2018年 | 219篇 |
2017年 | 205篇 |
2016年 | 125篇 |
2015年 | 90篇 |
2014年 | 180篇 |
2013年 | 471篇 |
2012年 | 193篇 |
2011年 | 297篇 |
2010年 | 301篇 |
2009年 | 449篇 |
2008年 | 391篇 |
2007年 | 279篇 |
2006年 | 323篇 |
2005年 | 227篇 |
2004年 | 205篇 |
2003年 | 176篇 |
2002年 | 165篇 |
2001年 | 157篇 |
2000年 | 141篇 |
1999年 | 141篇 |
1998年 | 117篇 |
1997年 | 81篇 |
1996年 | 47篇 |
1995年 | 53篇 |
1994年 | 42篇 |
1993年 | 29篇 |
1992年 | 28篇 |
1991年 | 15篇 |
1990年 | 12篇 |
1989年 | 16篇 |
1988年 | 16篇 |
1987年 | 10篇 |
1986年 | 5篇 |
1985年 | 14篇 |
1984年 | 13篇 |
1983年 | 3篇 |
1982年 | 13篇 |
1981年 | 4篇 |
1980年 | 3篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有6138条查询结果,搜索用时 62 毫秒
181.
该文研究了以下高阶Yamabe型方程Lm,pu - g|u|p-2 u = λ f|u|α-2 u在有限图上的非平凡正解的存在性,其中Lm,p是一个2m阶差分算子,它是一种p次(-Δ)m算子更一般化,α≥p≥2,g>0和f >0是定义在G的所有顶点上的实函数,m≥1是一个整数. 相似文献
182.
With the increasing application of deep-learning-based generative models for de novo molecule design, the quantitative estimation of molecular synthetic accessibility (SA) has become a crucial factor for prioritizing the structures generated from generative models. It is also useful for helping in the prioritization of hit/lead compounds and guiding retrosynthesis analysis. In this study, based on the USPTO and Pistachio reaction datasets, a chemical reaction network was constructed for the identification of the shortest reaction paths (SRP) needed to synthesize compounds, and different SRP cut-offs were then used as the threshold to distinguish a organic compound as either an easy-to-synthesize (ES) or hard-to-synthesize (HS) class. Two synthesis accessibility models (DNN-ECFP model and graph-based CMPNN model) were built using deep learning/machine learning algorithms. Compared to other existing synthesis accessibility scoring schemes, such as SYBA, SCScore, and SAScore, our results show that CMPNN (ROC AUC: 0.791) performs better than SYBA (ROC AUC: 0.76), albeit marginally, and outperforms SAScore and SCScore. Our prediction models based on historical reaction knowledge could be a potential tool for estimating molecule SA. 相似文献
183.
《Physics letters. A》2020,384(18):126390
We examine quantum transport in periodic quantum graphs with a vertex coupling non-invariant with respect to time reversal. It is shown that the graph topology may play a decisive role in the conductivity properties illustrating this claim with two examples. In the first, the transport is possible at high energies in the bulk only being suppressed at the sample edges, while in the second one the situation is opposite, the transport is possible at the edge only. 相似文献
184.
Machine learning is currently the most active interdisciplinary field having numerous applications;additionally,machine-learning techniques are used to research quantum many-body problems.In this study,we first propose neural network quantum states(NNQSs)with general input observables and explore a few related properties,such as the tensor product and local unitary operation.Second,we determine the necessary and sufficient conditions for the representability of a general graph state using normalized NNQS.Finally,to quantify the approximation degree of a given pure state,we define the best approximation degree using normalized NNQSs.Furthermore,we observe that some 7V-qubit states can be represented by a normalized NNQS,such as separable pure states,Bell states and GHZ states. 相似文献
185.
朱晓颖 《纯粹数学与应用数学》2013,(6):609-614
寻找平面图是3-或者4-可选择的充分条件是图的染色理论中一个重要研究课题,本文研究了围长至少是4的特殊平面图的选择数,通过权转移的方法证明了每个围长至少是4且不合8-圈,9-圈和10-圈的平面图是3-可选择的. 相似文献
186.
The data clustering problem consists in dividing a data set into prescribed groups of homogeneous data. This is an NP-hard problem that can be relaxed in the spectral graph theory, where the optimal cuts of a graph are related to the eigenvalues of graph 1-Laplacian. In this paper, we first give new notations to describe the paths, among critical eigenvectors of the graph 1-Laplacian, realizing sets with prescribed genus. We introduce the pseudo-orthogonality to characterize m3(G), a special eigenvalue for the graph 1-Laplacian. Furthermore, we use it to give an upper bound for the third graph Cheeger constant h3(G), that is, h3(G) 6 m3(G). This is a first step for proving that the k-th Cheeger constant is the minimum of the 1-Laplacian Raylegh quotient among vectors that are pseudo-orthogonal to the vectors realizing the previous k - 1 Cheeger constants. Eventually, we apply these results to give a method and a numerical algorithm to compute m3(G), based on a generalized inverse power method. 相似文献
187.
Ludwin A.BASILIO-HERNáNDEZ Walter CARBALLOSA Jesús LEA?OS José M.SIGARRETA 《数学学报(英文版)》2019,35(3):338-354
We introduce the differential polynomial of a graph. The differential polynomial of a graph G of order n is the polynomial B(G; x) :=∑?(G)k=-nB_k(G) x~(n+k), where B_k(G) denotes the number of vertex subsets of G with differential equal to k. We state some properties of B(G;x) and its coefficients.In particular, we compute the differential polynomial for complete, empty, path, cycle, wheel and double star graphs. We also establish some relationships between B(G; x) and the differential polynomials of graphs which result by removing, adding, and subdividing an edge from G. 相似文献
188.
189.
Models based on sparse graphs are of interest to many communities: they appear as basic models in combinatorics, probability theory, optimization, statistical physics, information theory, and more applied fields of social sciences and economics. Different notions of similarity (and hence convergence) of sparse graphs are of interest in different communities. In probability theory and combinatorics, the notion of Benjamini‐Schramm convergence, also known as left‐convergence, is used quite frequently. Statistical physicists are interested in the the existence of the thermodynamic limit of free energies, which leads naturally to the notion of right‐convergence. Combinatorial optimization problems naturally lead to so‐called partition convergence, which relates to the convergence of optimal values of a variety of constraint satisfaction problems. The relationship between these different notions of similarity and convergence is, however, poorly understood. In this paper we introduce a new notion of convergence of sparse graphs, which we call Large Deviations or LD‐convergence, and which is based on the theory of large deviations. The notion is introduced by “decorating” the nodes of the graph with random uniform i.i.d. weights and constructing corresponding random measures on and . A graph sequence is defined to be converging if the corresponding sequence of random measures satisfies the Large Deviations Principle with respect to the topology of weak convergence on bounded measures on . The corresponding large deviations rate function can be interpreted as the limit object of the sparse graph sequence. In particular, we can express the limiting free energies in terms of this limit object. We then establish that LD‐convergence implies the other three notions of convergence discussed above, and at the same time establish several previously unknown relationships between the other notions of convergence. In particular, we show that partition‐convergence does not imply left‐ or right‐convergence, and that right‐convergence does not imply partition‐convergence. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 51, 52–89, 2017 相似文献
190.