全文获取类型
收费全文 | 1368篇 |
免费 | 19篇 |
国内免费 | 52篇 |
专业分类
化学 | 86篇 |
晶体学 | 1篇 |
力学 | 8篇 |
综合类 | 4篇 |
数学 | 1283篇 |
物理学 | 57篇 |
出版年
2023年 | 31篇 |
2022年 | 28篇 |
2021年 | 24篇 |
2020年 | 36篇 |
2019年 | 59篇 |
2018年 | 31篇 |
2017年 | 26篇 |
2016年 | 12篇 |
2015年 | 20篇 |
2014年 | 39篇 |
2013年 | 114篇 |
2012年 | 32篇 |
2011年 | 98篇 |
2010年 | 89篇 |
2009年 | 145篇 |
2008年 | 138篇 |
2007年 | 77篇 |
2006年 | 77篇 |
2005年 | 31篇 |
2004年 | 36篇 |
2003年 | 42篇 |
2002年 | 31篇 |
2001年 | 27篇 |
2000年 | 24篇 |
1999年 | 15篇 |
1998年 | 24篇 |
1997年 | 13篇 |
1996年 | 16篇 |
1995年 | 14篇 |
1994年 | 7篇 |
1993年 | 8篇 |
1992年 | 9篇 |
1991年 | 7篇 |
1990年 | 5篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1987年 | 1篇 |
1986年 | 12篇 |
1985年 | 6篇 |
1984年 | 6篇 |
1983年 | 3篇 |
1982年 | 6篇 |
1981年 | 5篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1978年 | 3篇 |
1977年 | 2篇 |
1972年 | 1篇 |
排序方式: 共有1439条查询结果,搜索用时 31 毫秒
41.
Physicochemical and Graph Theoretical Descriptors in Developmental Toxicity SAR: A Comparative Study
O. T. Macina N. B. Sussman H. G. Claycamp S. G. Grant 《SAR and QSAR in environmental research》2013,24(5-6):345-362
Abstract Chemical insults to the developing fetus can lead to growth retardation, malformation, death, and functional deficits. The present study seeks to determine if physicochemical and/or graph theoretical parameters can be used to determine a structure-activity relationship (SAR) for developmental toxicity, and if consistency is observed among the selected features. The biological data utilized consists of a diverse series of compounds evaluated within the Chernoff-Kavlock in vivo mouse assay. Physicochemical parameters calculated correspond to electronic, steric, and transport properties. Graph theoretical parameters calculated include the simple, valence, and kappa indices. Both sets of parameters were independently applied to derive SARs in order to compare the quality of the respective models. Multiple random sampling, without replacement, was utilized to obtain ten training/test partitions. Models were built by linear discriminant analysis, decision trees, and neural networks respectively. Comparisons on identical sets of data were carried out to determine if any of the model building procedures had a significant advantage in terms of predictive performance. Furthermore, comparison of the features selected within and across the model building processes led to the determination of model consistency. Our results indicate that consistent features related to developmental toxicity are observed and that both physicochemical and graph theoretical parameters have equal utility. 相似文献
42.
For every , we present a set of points in the plane such that every planar 3-tree with n vertices has a straight-line embedding in the plane in which the vertices are mapped to a subset of . This is the first subquadratic upper bound on the cardinality of universal point sets for planar 3-trees, as well as for the class of 2-trees and serial parallel graphs. 相似文献
43.
预测材料异质结的界面原子结构对于理解界面对性能的影响至关重要. 目前, 从理论上预测材料界面结构仍具有极大挑战, 主要是缺乏普适有效的理论计算方法. 本文介绍了本课题组在异质结界面结构预测方面取得的最新进展. 结合马氏体相变唯象理论、 图论和随机表面行走算法, 提出了界面结构的一种有效预测方法, 可以实现自动化的计算预测. 通过GaP/TiO2半导体异质结等展示了该方法的有效性和在催化等领域的应用前景. 相似文献
44.
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. 相似文献
45.
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. 相似文献
46.
(mg+k,mf—k)—图中正交于r个不相交子图的边不变的(g,f)—因子 总被引:3,自引:0,他引:3
设m,k和r为正整数,且使l≤k<m.设G是一个具有顶点集合V(G)和边集合E(G)的图,并设g和f是定义在V(G)上的使对每个x∈V(G)有r≤g(x)≤f(x)的整数值函数.设H1,H2,…,Hr是G的r个顶点不相交的子图且|E(Hi)|=k,1≤i≤r.本文证明了每个(mg+k,mf-k)-图有k个边不相交的(g,f)-因子正交于Hi,1≤i≤r. 相似文献
47.
Let G=(V,E) be a graph.A set S■V is a restrained dominating set if every vertex in V-S is adjacent to a vertex in S and to a vertex in V-S.The restrained domination number of G,denoted γr(G),is the smallest cardinality of a restrained dominating set of G.In this paper,we show that if G is a graph of order n≥4,then γr(G)γr(G)≤2n.We also characterize the graphs achieving the upper bound. 相似文献
49.
With the rapid development of DNA microarray technology and next-generation technology, a large number of genomic data were generated. So how to extract more differentially expressed genes from genomic data has become a matter of urgency. Because Low-Rank Representation (LRR) has the high performance in studying low-dimensional subspace structures, it has attracted a chunk of attention in recent years. However, it does not take into consideration the intrinsic geometric structures in data.In this paper, a new method named Laplacian regularized Low-Rank Representation (LLRR) has been proposed and applied on genomic data, which introduces graph regularization into LRR. By taking full advantages of the graph regularization, LLRR method can capture the intrinsic non-linear geometric information among the data. The LLRR method can decomposes the observation matrix of genomic data into a low rank matrix and a sparse matrix through solving an optimization problem. Because the significant genes can be considered as sparse signals, the differentially expressed genes are viewed as the sparse perturbation signals. Therefore, the differentially expressed genes can be selected according to the sparse matrix. Finally, we use the GO tool to analyze the selected genes and compare the P-values with other methods.The results on the simulation data and two real genomic data illustrate that this method outperforms some other methods: in differentially expressed gene selection. 相似文献
50.