全文获取类型
收费全文 | 16037篇 |
免费 | 1619篇 |
国内免费 | 841篇 |
专业分类
化学 | 2073篇 |
晶体学 | 87篇 |
力学 | 1679篇 |
综合类 | 390篇 |
数学 | 9193篇 |
物理学 | 5075篇 |
出版年
2024年 | 17篇 |
2023年 | 135篇 |
2022年 | 275篇 |
2021年 | 327篇 |
2020年 | 283篇 |
2019年 | 300篇 |
2018年 | 307篇 |
2017年 | 472篇 |
2016年 | 584篇 |
2015年 | 406篇 |
2014年 | 722篇 |
2013年 | 1047篇 |
2012年 | 735篇 |
2011年 | 878篇 |
2010年 | 781篇 |
2009年 | 1367篇 |
2008年 | 1388篇 |
2007年 | 1269篇 |
2006年 | 1113篇 |
2005年 | 804篇 |
2004年 | 650篇 |
2003年 | 627篇 |
2002年 | 587篇 |
2001年 | 485篇 |
2000年 | 405篇 |
1999年 | 380篇 |
1998年 | 340篇 |
1997年 | 280篇 |
1996年 | 228篇 |
1995年 | 187篇 |
1994年 | 165篇 |
1993年 | 138篇 |
1992年 | 121篇 |
1991年 | 88篇 |
1990年 | 77篇 |
1989年 | 56篇 |
1988年 | 63篇 |
1987年 | 44篇 |
1986年 | 52篇 |
1985年 | 50篇 |
1984年 | 57篇 |
1983年 | 27篇 |
1982年 | 47篇 |
1981年 | 23篇 |
1980年 | 17篇 |
1979年 | 21篇 |
1978年 | 15篇 |
1977年 | 16篇 |
1976年 | 12篇 |
1975年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
1.
2.
Here we propose and analyze a mathematical model that aims to describe the marble sulphation process occurring in a given material. The model accounts for rugosity as well as for damaging effects. This model is characterized by some technical difficulties that seem hard to overcome from a theoretical viewpoint. Therefore, we introduce some physically reasonable modifications in order to establish the existence of a suitable notion of solution on a given time interval. Numerical simulations are presented and discussed, also in view of further research. 相似文献
3.
Shi-Jie Pan 《中国物理 B》2022,31(6):60304-060304
Neighborhood preserving embedding (NPE) is an important linear dimensionality reduction technique that aims at preserving the local manifold structure. NPE contains three steps, i.e., finding the nearest neighbors of each data point, constructing the weight matrix, and obtaining the transformation matrix. Liang et al. proposed a variational quantum algorithm (VQA) for NPE [Phys. Rev. A 101 032323 (2020)]. The algorithm consists of three quantum sub-algorithms, corresponding to the three steps of NPE, and was expected to have an exponential speedup on the dimensionality n. However, the algorithm has two disadvantages: (i) It is not known how to efficiently obtain the input of the third sub-algorithm from the output of the second one. (ii) Its complexity cannot be rigorously analyzed because the third sub-algorithm in it is a VQA. In this paper, we propose a complete quantum algorithm for NPE, in which we redesign the three sub-algorithms and give a rigorous complexity analysis. It is shown that our algorithm can achieve a polynomial speedup on the number of data points m and an exponential speedup on the dimensionality n under certain conditions over the classical NPE algorithm, and achieve a significant speedup compared to Liang et al.'s algorithm even without considering the complexity of the VQA. 相似文献
4.
5.
《Operations Research Letters》2021,49(6):855-861
This letter studies the problem of minimizing increasing set functions, equivalently, maximizing decreasing set functions, over the base matroid. This setting has received great interest, since it generalizes several applied problems including actuator and sensor placement problems in control, task allocation problems, video summarization, and many others. We study two greedy heuristics, namely, the forward and reverse greedy. We provide two novel performance guarantees for the approximate solutions obtained by them depending on both submodularity ratio and curvature. 相似文献
6.
In this article, we construct and analyze a residual-based a posteriori error estimator for a quadratic finite volume method (FVM) for solving nonlinear elliptic partial differential equations with homogeneous Dirichlet boundary conditions. We shall prove that the a posteriori error estimator yields the global upper and local lower bounds for the norm error of the FVM. So that the a posteriori error estimator is equivalent to the true error in a certain sense. Numerical experiments are performed to illustrate the theoretical results. 相似文献
7.
本文针对求矩阵方程AXB+CXD=F唯一解的参数迭代法,分析当矩阵A,B,C,D均是Hermite正(负)定矩阵时,迭代矩阵的特征值表达式,给出了最优参数的确定方法,并提出了相应的加速算法. 相似文献
8.
Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to or . Let and be the path on vertices and the cycle on vertices, respectively. In this paper we show that for any -free graph it holds that , where and are the chromatic number and clique number of , respectively. Our bound is attained by several graphs, for instance, the 5-cycle, the Petersen graph, the Petersen graph with an additional universal vertex, and all -critical -free graphs other than (see Hell and Huang [Discrete Appl. Math. 216 (2017), pp. 211–232]). The new result unifies previously known results on the existence of linear -binding functions for several graph classes. Our proof is based on a novel structure theorem on -free graphs that do not contain clique cutsets. Using this structure theorem we also design a polynomial time -approximation algorithm for coloring -free graphs. Our algorithm computes a coloring with colors for any -free graph in time. 相似文献
9.
10.
研究采用有误差的数值计算来获得无误差的准确值具有重要的理论价值和应用价值.这种通过近似的数值方法获得准确结果的计算被称为零误差计算.本文首先指出,只有一致离散集合中的数才能够开展零误差计算,即有非零隔离界的数集,这也是"数"可以进行零误差计算的一个充要条件.以此为基本出发点,本文分析代数数零误差计算的最低理论精度,该精度对应于恢复近似代数数的准确值时必要的误差控制条件,但由于所采用恢复算法的局限性,这一理论精度往往不能保证成功恢复出代数数的准确值.为此,本文给出采用PSLQ (partial-sum-LQ-decomposition)算法进行代数数零误差计算所需的精度控制条件,与基于LLL (Lenstra-Lenstra-Lovász)算法相比,该精度控制条件关于代数数次数的依赖程度由二次降为拟线性,从而可降低相应算法的复杂度.最后探讨零误差计算未来的发展趋势. 相似文献