全文获取类型
收费全文 | 8317篇 |
免费 | 429篇 |
国内免费 | 428篇 |
专业分类
化学 | 1956篇 |
晶体学 | 11篇 |
力学 | 601篇 |
综合类 | 69篇 |
数学 | 4763篇 |
物理学 | 1774篇 |
出版年
2024年 | 5篇 |
2023年 | 100篇 |
2022年 | 134篇 |
2021年 | 175篇 |
2020年 | 156篇 |
2019年 | 209篇 |
2018年 | 160篇 |
2017年 | 241篇 |
2016年 | 244篇 |
2015年 | 211篇 |
2014年 | 347篇 |
2013年 | 628篇 |
2012年 | 485篇 |
2011年 | 438篇 |
2010年 | 404篇 |
2009年 | 576篇 |
2008年 | 578篇 |
2007年 | 584篇 |
2006年 | 408篇 |
2005年 | 315篇 |
2004年 | 306篇 |
2003年 | 282篇 |
2002年 | 299篇 |
2001年 | 188篇 |
2000年 | 161篇 |
1999年 | 136篇 |
1998年 | 152篇 |
1997年 | 129篇 |
1996年 | 148篇 |
1995年 | 126篇 |
1994年 | 133篇 |
1993年 | 100篇 |
1992年 | 79篇 |
1991年 | 49篇 |
1990年 | 50篇 |
1989年 | 45篇 |
1988年 | 36篇 |
1987年 | 31篇 |
1986年 | 40篇 |
1985年 | 45篇 |
1984年 | 40篇 |
1983年 | 16篇 |
1982年 | 48篇 |
1981年 | 22篇 |
1980年 | 27篇 |
1979年 | 30篇 |
1978年 | 18篇 |
1977年 | 16篇 |
1976年 | 10篇 |
1975年 | 4篇 |
排序方式: 共有9174条查询结果,搜索用时 125 毫秒
31.
《Electroanalysis》2004,16(9):748-756
A strategy for constructing a global multivariate calibration model that includes calibration samples measured over time on different days is developed and applied in electroanalysis. Both synthetic and real samples (tap, extracted and river water) are analyzed by differential‐pulse anodic stripping voltammetry, showing the suitability of the global model constructed that provides successful results similar to those of the usual multivariate calibration. In addition the capability of discrimination of this model is evaluated in prediction for the mean of three replicates with estimation of probability of false noncompliance, α, and false compliance, β, being found 3.1, 11.2, 6.7 and 64.7 nM for nominal concentrations of zinc, cadmium, lead and copper of 96.0, 40.4, 37.3 and 328.0 nM respectively when α=β=0.05. It has been proven that the use of the global calibration does not imply a loss of multivariate analytical sensitivity, using this parameter as quality index of the analytical procedure. The viability of using calibration maintenance strategies with electroanalytical techniques is shown, providing a way to save time and experimental effort when these techniques are used in routine analysis. 相似文献
32.
A server needs to compute a broadcast schedule for n pages whose request times are known in advance. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. In this paper, we show the equivalence of two apparently different relaxations that have been considered for this problem. 相似文献
33.
Robust linear optimization under general norms 总被引:1,自引:0,他引:1
We explicitly characterize the robust counterpart of a linear programming problem with uncertainty set described by an arbitrary norm. Our approach encompasses several approaches from the literature and provides guarantees for constraint violation under probabilistic models that allow arbitrary dependencies in the distribution of the uncertain coefficients. 相似文献
34.
A new grid‐free upwind relaxation scheme for simulating inviscid compressible flows is presented in this paper. The non‐linear conservation equations are converted to linear convection equations with non‐linear source terms by using a relaxation system and its interpretation as a discrete Boltzmann equation. A splitting method is used to separate the convection and relaxation parts. Least squares upwinding is used for discretizing the convection equations, thus developing a grid‐free scheme which can operate on any arbitrary distribution of points. The scheme is grid free in the sense that it works on any arbitrary distribution of points and it does not require any topological information like elements, faces, edges, etc. This method is tested on some standard test cases. To explore the power of the grid‐free scheme, solution‐based adaptation of points is done and the results are presented, which demonstrate the efficiency of the new grid‐free scheme. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
35.
Yao Ping HOU 《数学学报(英文版)》2005,21(4):955-960
A signed graph is a graph with a sign attached to each edge. This paper extends some fundamental concepts of the Laplacian matrices from graphs to signed graphs. In particular, the relationships between the least Laplacian eigenvalue and the unbalancedness of a signed graph are investigated. 相似文献
36.
37.
The projective method for solving linear matrix inequalities 总被引:2,自引:0,他引:2
Numerous problems in control and systems theory can be formulated in terms of linear matrix inequalities (LMI). Since solving
an LMI amounts to a convex optimization problem, such formulations are known to be numerically tractable. However, the interest
in LMI-based design techniques has really surged with the introduction of efficient interior-point methods for solving LMIs
with a polynomial-time complexity. This paper describes one particular method called the Projective Method. Simple geometrical
arguments are used to clarify the strategy and convergence mechanism of the Projective algorithm. A complexity analysis is
provided, and applications to two generic LMI problems (feasibility and linear objective minimization) are discussed. 相似文献
38.
Lai Chunhui 《东北数学》1997,(1)
SomePropertiesofQuasi┐keep┐rangeOperatorsandTheirApplicationsLaiChunhui(赖春晖)(DepartmentofMathematics,ZhangzhouTeachersColege,... 相似文献
39.
In [5] Phillips proved that one can obtain the additive group of any nonstandard model *? of the ring ? of integers by using a linear mod 1 function h : F ?, where F is the α-dimensional vector space over ? when α is the cardinality of *?. In this connection it arises the question whether there are linear mod 1 functions which are neither addition nor quasi-linear. We prove that this is the case. 相似文献
40.
Kurt M. Anstreicher 《Mathematical Programming》1997,76(1):245-263
We consider the construction of small step path following algorithms using volumetric, and mixed volumetric-logarithmic, barriers.
We establish quadratic convergence of a volumetric centering measure using pure Newton steps, enabling us to use relatively
standard proof techniques for several subsequently needed results. Using a mixed volumetric-logarithmic barrier we obtain
an O(n
1/4
m
1/4
L) iteration algorithm for linear programs withn variables andm inequality constraints, providing an alternative derivation for results first obtained by Vaidya and Atkinson. In addition,
we show that the same iteration complexity can be attained while holding the work per iteration to O(n
2
m), as opposed to O(nm
2), operations, by avoiding use of the true Hessian of the volumetric barrier. Our analysis also provides a simplified proof
of self-concordancy of the volumetric and mixed volumetric-logarithmic barriers, originally due to Nesterov and Nemirovskii.
This paper was first presented at the 1994 Faculty Research Seminar “Optimization in Theory and Practice”, at the University
of Iowa Center for Advanced Studies. 相似文献