全文获取类型
收费全文 | 81110篇 |
免费 | 807篇 |
国内免费 | 646篇 |
专业分类
化学 | 26298篇 |
晶体学 | 802篇 |
力学 | 6858篇 |
综合类 | 22篇 |
数学 | 32395篇 |
物理学 | 16188篇 |
出版年
2023年 | 67篇 |
2022年 | 87篇 |
2021年 | 94篇 |
2020年 | 101篇 |
2019年 | 94篇 |
2018年 | 10486篇 |
2017年 | 10309篇 |
2016年 | 6178篇 |
2015年 | 950篇 |
2014年 | 450篇 |
2013年 | 550篇 |
2012年 | 4072篇 |
2011年 | 10754篇 |
2010年 | 5830篇 |
2009年 | 6205篇 |
2008年 | 6809篇 |
2007年 | 8909篇 |
2006年 | 381篇 |
2005年 | 1451篇 |
2004年 | 1651篇 |
2003年 | 2101篇 |
2002年 | 1123篇 |
2001年 | 337篇 |
2000年 | 355篇 |
1999年 | 214篇 |
1998年 | 236篇 |
1997年 | 201篇 |
1996年 | 257篇 |
1995年 | 162篇 |
1994年 | 120篇 |
1993年 | 129篇 |
1992年 | 79篇 |
1991年 | 82篇 |
1990年 | 77篇 |
1989年 | 75篇 |
1988年 | 74篇 |
1987年 | 71篇 |
1986年 | 71篇 |
1985年 | 64篇 |
1984年 | 64篇 |
1983年 | 49篇 |
1982年 | 54篇 |
1981年 | 46篇 |
1980年 | 60篇 |
1979年 | 58篇 |
1978年 | 41篇 |
1914年 | 45篇 |
1912年 | 40篇 |
1909年 | 41篇 |
1908年 | 40篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
111.
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 相似文献
112.
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. 相似文献
113.
On a Definitizable Analog of the Trigonometric Moment Problem Generating an Indefinite Toeplitz Form
We prove the existence of an integro-polynomial representation for a sequence of numbers such that there exists a difference operator mapping this sequence to a sequence that generates the solvable trigonometric moment problem. A similar result related to the power moment problem was given in [12]. 相似文献
114.
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. 相似文献
115.
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]. 相似文献
116.
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. 相似文献
117.
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. 相似文献
118.
W Y Hung S Kucherenko N J Samsatli N Shah 《The Journal of the Operational Research Society》2004,55(8):801-813
In this paper, we present a new modelling approach for realistic supply chain simulation. The model provides an experimental environment for informed comparison between different supply chain policies. A basic simulation model for a generic node, from which a supply chain network can be built, has been developed using an object-oriented approach. This generic model allows the incorporation of the information and physical systems and decision-making policies used by each node. The object-oriented approach gives the flexibility in specifying the supply chain configuration and operation decisions, and policies. Stochastic simulations are achieved by applying Latin Supercube Sampling to the uncertain variables in descending order of importance, which reduces the number of simulations required. We also present a case study to show that the model is applicable to a real-life situation for dynamic stochastic studies. 相似文献
119.
In the data envelopment analysis (DEA) efficiency literature, qualitative characterizations of returns to scale (increasing, constant, or decreasing) are most common. In economics it is standard to use the scale elasticity as a quantification of scale properties for a production function representing efficient operations. Our contributions are to review DEA practices, apply the concept of scale elasticity from economic multi-output production theory to DEA piecewise linear frontier production functions, and develop formulas for scale elasticity for radial projections of inefficient observations in the relative interior of fully dimensional facets. The formulas are applied to both constructed and real data and show the differences between scale elasticities for the two valid projections (input and output orientations). Instead of getting qualitative measures of returns to scale only as was done earlier in the DEA literature, we now get a quantitative range of scale elasticity values providing more information to policy-makers. 相似文献
120.
We investigate the problem of locating a set of service facilities that need to service customers on a network. To provide service, a server has to visit both the demand node and one of several collection depots. We employ the criterion of minimizing the weighted sum of round trip distances. We prove that there exists a dominating location set for the problem on a general network. The properties of the solution on a tree and on a cycle are discussed. The problem of locating service facilities and collection depots simultaneously is also studied. To solve the problem on a general network, we suggest a Lagrangian relaxation imbedded branch-and-bound algorithm. Computational results are reported. 相似文献