全文获取类型
收费全文 | 114362篇 |
免费 | 5423篇 |
国内免费 | 3446篇 |
专业分类
化学 | 49682篇 |
晶体学 | 1100篇 |
力学 | 8695篇 |
综合类 | 217篇 |
数学 | 36218篇 |
物理学 | 27319篇 |
出版年
2024年 | 116篇 |
2023年 | 665篇 |
2022年 | 1167篇 |
2021年 | 1235篇 |
2020年 | 1310篇 |
2019年 | 1209篇 |
2018年 | 11265篇 |
2017年 | 10983篇 |
2016年 | 7525篇 |
2015年 | 2373篇 |
2014年 | 2116篇 |
2013年 | 2892篇 |
2012年 | 6899篇 |
2011年 | 13669篇 |
2010年 | 7599篇 |
2009年 | 7832篇 |
2008年 | 8887篇 |
2007年 | 10842篇 |
2006年 | 2364篇 |
2005年 | 3189篇 |
2004年 | 2966篇 |
2003年 | 3140篇 |
2002年 | 2045篇 |
2001年 | 881篇 |
2000年 | 913篇 |
1999年 | 878篇 |
1998年 | 809篇 |
1997年 | 765篇 |
1996年 | 804篇 |
1995年 | 666篇 |
1994年 | 547篇 |
1993年 | 513篇 |
1992年 | 401篇 |
1991年 | 376篇 |
1990年 | 335篇 |
1989年 | 278篇 |
1988年 | 246篇 |
1987年 | 214篇 |
1986年 | 171篇 |
1985年 | 222篇 |
1984年 | 154篇 |
1983年 | 120篇 |
1982年 | 151篇 |
1981年 | 117篇 |
1980年 | 105篇 |
1979年 | 93篇 |
1978年 | 76篇 |
1977年 | 56篇 |
1976年 | 47篇 |
1975年 | 51篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
We shall answer several questions concerning additive or multiplicative commutators in a division ring which are algebraic of bounded degree over its center. 相似文献
62.
Panos M. Pardalos Wanpracha Chaovalitwongse Leonidas D. Iasemidis J. Chris Sackellares Deng-Shan Shiau Paul R. Carney Oleg A. Prokopyev Vitaliy A. Yatsenko 《Mathematical Programming》2004,101(2):365-385
There is growing evidence that temporal lobe seizures are preceded by a preictal transition, characterized by a gradual dynamical change from asymptomatic interictal state to seizure. We herein report the first prospective analysis of the online automated algorithm for detecting the preictal transition in ongoing EEG signals. Such, the algorithm constitutes a seizure warning system. The algorithm estimates STLmax, a measure of the order or disorder of the signal, of EEG signals recorded from individual electrode sites. The optimization techniques were employed to select critical brain electrode sites that exhibit the preictal transition for the warning of epileptic seizures. Specifically, a quadratically constrained quadratic 0-1 programming problem is formulated to identify critical electrode sites. The automated seizure warning algorithm was tested in continuous, long-term EEG recordings obtained from 5 patients with temporal lobe epilepsy. For individual patient, we use the first half of seizures to train the parameter settings, which is evaluated by ROC (Receiver Operating Characteristic) curve analysis. With the best parameter setting, the algorithm applied to all cases predicted an average of 91.7% of seizures with an average false prediction rate of 0.196 per hour. These results indicate that it may be possible to develop automated seizure warning devices for diagnostic and therapeutic purposes.Mathematics Subject Classification (1991):20E28, 20G40, 20C20 相似文献
63.
Harish Seshadri 《Mathematische Zeitschrift》2004,247(3):487-503
We study closed Einstein 4-manifolds which admit S1 actions of a certain type, i.e., warped products. In particular, we classify them up to isometry when the fixed point of the S1 action satisfies certain natural geometric conditions. The proof uses the Bochner-Weitzenböck formula for 1-forms and the theory of minimal surfaces in 3-manifolds.in final form: 22 January 2003 相似文献
64.
65.
Fabio A. C. C. Chalub Peter A. Markowich Benoît Perthame Christian Schmeiser 《Monatshefte für Mathematik》2004,142(1-2):123-141
Kinetic models for chemotaxis, nonlinearly coupled to a Poisson equation for the chemo-attractant density, are considered. Under suitable assumptions on the turning kernel (including models introduced by Othmer, Dunbar and Alt), convergence in the macroscopic limit to a drift-diffusion model is proven. The drift-diffusion models derived in this way include the classical Keller-Segel model. Furthermore, sufficient conditions for kinetic models are given such that finite-time-blow-up does not occur. Examples are given satisfying these conditions, whereas the macroscopic limit problem is known to exhibit finite-time-blow-up. The main analytical tools are entropy techniques for the macroscopic limit as well as results from potential theory for the control of the chemo-attractant density.Present address: Centro de Matemática e Aplicações Fundamentais, Universidade de Lisboa, Av. Prof. Gama Pinto 2, 1649-003, Lisboa, Portugal 相似文献
66.
Zhaoyang Yin 《Monatshefte für Mathematik》2004,141(4):337-344
We prove under quite general assumptions the existence of a bounded positive solution to the semilinear Schrödinger equation in a two-dimensional exterior domain. 相似文献
67.
Shea-Ming Oon 《Periodica Mathematica Hungarica》2004,49(2):107-118
In this paper we study some pseudo-random properties related to the prime factors of integers. We prove some results concerning the well distribution of the greatest prime factor modulo 4, and give some computational insight on the correlations, which seem to be beyond reach of proof. 相似文献
68.
Clemens Heuberger 《Periodica Mathematica Hungarica》2004,49(2):65-89
We study digit expansions with arbitrary integer digits in base q (q integer) and the Fibonacci base such that the sum of the absolute values of the digits is minimal. For the Fibonacci case, we describe a unique minimal expansion and give a greedy algorithm to compute it. Additionally, transducers to calculate minimal expansions from other expansions are given. For the case of even integer bases q, similar results are given which complement those given in [6]. 相似文献
69.
Karin Cvetko-Vah 《Semigroup Forum》2004,68(2):268-279
Given a ring $R$, let $S\subseteq R$ be a pure multiplicative band that is
closed under the cubic join operation $x\nabla y = x+y+yx-xyx-yxy.$ We show that
$\left( S,\cdot,\nabla\right) $ forms a pure skew lattice if and only if $S$
satisfies the polynomial identity $\left(xy-yx\right)^{2}z = z\left(xy-yx\right)^{2}$.
We also examine properties of pure skew lattices
in rings. 相似文献
70.
New heuristics for over-constrained flight to gate assignments 总被引:1,自引:0,他引:1
We consider the over-constrained Airport Gate Assignment Problem where the number of flights exceed the number of gates available, and where the objectives are to minimize the number of ungated flights and the total walking distances. The problem is formulated as a binary quadratic programming problem. We design a greedy algorithm and use a Tabu Search meta-heuristic to solve the problem. The greedy algorithm minimizes ungated flights while we devise a new neighbourhood search technique, the Interval Exchange Move, which allows us flexibility in seeking good solutions, especially when flight schedules are dense in time. Experiments conducted give good results. 相似文献