全文获取类型
收费全文 | 4177篇 |
免费 | 234篇 |
国内免费 | 16篇 |
专业分类
化学 | 3461篇 |
晶体学 | 16篇 |
力学 | 67篇 |
数学 | 425篇 |
物理学 | 458篇 |
出版年
2023年 | 50篇 |
2022年 | 138篇 |
2021年 | 177篇 |
2020年 | 141篇 |
2019年 | 120篇 |
2018年 | 59篇 |
2017年 | 56篇 |
2016年 | 175篇 |
2015年 | 179篇 |
2014年 | 163篇 |
2013年 | 236篇 |
2012年 | 337篇 |
2011年 | 371篇 |
2010年 | 210篇 |
2009年 | 172篇 |
2008年 | 291篇 |
2007年 | 257篇 |
2006年 | 254篇 |
2005年 | 181篇 |
2004年 | 189篇 |
2003年 | 148篇 |
2002年 | 125篇 |
2001年 | 27篇 |
2000年 | 29篇 |
1999年 | 26篇 |
1998年 | 19篇 |
1997年 | 21篇 |
1996年 | 24篇 |
1995年 | 20篇 |
1994年 | 16篇 |
1993年 | 5篇 |
1991年 | 6篇 |
1990年 | 6篇 |
1989年 | 9篇 |
1988年 | 5篇 |
1987年 | 8篇 |
1986年 | 10篇 |
1985年 | 19篇 |
1984年 | 18篇 |
1983年 | 16篇 |
1982年 | 17篇 |
1981年 | 18篇 |
1980年 | 10篇 |
1979年 | 8篇 |
1978年 | 7篇 |
1977年 | 13篇 |
1976年 | 7篇 |
1975年 | 6篇 |
1974年 | 7篇 |
1973年 | 4篇 |
排序方式: 共有4427条查询结果,搜索用时 31 毫秒
11.
Laura Bader Nicola Durante Maska Law Guglielmo Lunardon Tim Penttila 《Designs, Codes and Cryptography》2003,29(1-3):41-50
We do the tentative beginnings of a study of BLT-sets of generalised quadrangles via their symmetries. In particular, the study of whorls about a line leads us to hyperbolic reflections preserving a BLT-set of Q(4, q). 相似文献
12.
13.
Laura Montanaro K. Belgacem P. Llewellyn F. Rouquerol F. Merlo Paola Palmero 《Journal of Thermal Analysis and Calorimetry》2007,88(3):789-793
Wet chemical synthesis of precursor oxide ceramics is a method to obtain small particulate powders. Such powders are far more
prone to ageing in air than more traditional precursors. Thermogravimetric analysis is used to highlight the species responsible
for the ageing of ceramic precursors. Indeed water and carbon dioxide are observed to evolve from aged powders. Ceramics obtained
from aged precursors can reach a very low final density with respect to the theoretical value. A large degree of the original
sintering properties can be recovered after washing the aged powders with ethanol in a basic medium. 相似文献
14.
Supply Chain Management (SCM) is an important activity in all producing facilities and in many organizations to enable vendors,
manufacturers and suppliers to interact gainfully and plan optimally their flow of goods and services. To realize this, a
dynamic modelling approach for characterizing supply chain activities is opportune, so as to plan efficiently the set of activities
over a distributed network in a formal and scientific way. The dynamical system will result so complex that it is not generally
possible to specify the functional forms and the parameters of interest, relating outputs to inputs, states and stochastic
terms by experiential specification methods. Thus the algorithm that will presented is Data Driven, determining simultaneously
the functional forms, the parameters and the optimal control policy from the data available for the supply chain. The aim
of this paper is to present this methodology, by considering dynamical aspects of the system, the presence of nonlinear relationships
and unbiased estimation procedures to quantify these relations, leading to a nonlinear and stochastic dynamical system representation
of the SCM problem. Moreover, the convergence of the algorithm will be proved and the satisfaction of the required statistical
conditions demonstrated. Thus SCM problems may be formulated as formal scientific procedures, with well defined algorithms
and a precise calculation sequence to determine the best alternative to enact. A “Certainty equivalent principle” will be
indicated to ensure that the effects of the inevitable uncertainties will not lead to indeterminate results, allowing the
formulation of demonstrably asymptotically optimal management plans. 相似文献
15.
16.
Demetrio Pitea Laura Bonati Elena Collina Ugo Cosentino Marina Lasagni Giorgio Moro Roberto Todeschini 《Fresenius' Journal of Analytical Chemistry》1994,348(1-2):111-120
Summary The role of multivariate analysis methods in evaluating, rationalizing, and working out complex environmental problems is discussed. The discussion is organized in two sections; a literature analysis of the application of chemometric methods to PCDD/PCDF data interpretation and source correlation and a review of the role of chemometric methods in analysing the results obtained by the Authors studying PCDD/PCDF formation and destruction mechanisms in MSW combustion processes. 相似文献
17.
In a recent paper [17] we proposed a stochastic algorithm which generates optimal probabilities for the decompression of
an image represented by the fixed point of an IFS system (SAOP). We show here that such an algorithm is in fact a non trivial
example of Generalized Random System with Complete Connections. We also exhibit a generalization which could represent the
solution to the inverse problem for an image with grey levels, if a fixed set of contraction maps is available.
Received: 1 July 2002 相似文献
18.
19.
A q × n array with entries from 0, 1,…,q − 1 is said to form a difference matrix if the vector difference (modulo q) of each pair of columns consists of a permutation of [0, 1,… q − 1]; this definition is inverted from the more standard one to be found, e.g., in Colbourn and de Launey (1996). The following idea generalizes this notion: Given an appropriate δ (-[−1, 1]t, a λq × n array will be said to form a (t, q, λ, Δ) sign-balanced matrix if for each choice C1, C2,…, Ct of t columns and for each choice = (1,…,t) Δ of signs, the linear combination ∑j=1t jCj contains (mod q) each entry of [0, 1,…, q − 1] exactly λ times. We consider the following extremal problem in this paper: How large does the number k = k(n, t, q, λ, δ) of rows have to be so that for each choice of t columns and for each choice (1, …, t) of signs in δ, the linear combination ∑j=1t jCj contains each entry of [0, 1,…, q t- 1] at least λ times? We use probabilistic methods, in particular the Lovász local lemma and the Stein-Chen method of Poisson approximation to obtain general (logarithmic) upper bounds on the numbers k(n, t, q, λ, δ), and to provide Poisson approximations for the probability distribution of the number W of deficient sets of t columns, given a random array. It is proved, in addition, that arithmetic modulo q yields the smallest array - in a sense to be described. 相似文献
20.