全文获取类型
收费全文 | 182009篇 |
免费 | 19225篇 |
国内免费 | 11139篇 |
专业分类
化学 | 95796篇 |
晶体学 | 2015篇 |
力学 | 13334篇 |
综合类 | 593篇 |
数学 | 43160篇 |
物理学 | 57475篇 |
出版年
2024年 | 384篇 |
2023年 | 2182篇 |
2022年 | 3755篇 |
2021年 | 4091篇 |
2020年 | 4415篇 |
2019年 | 4298篇 |
2018年 | 13163篇 |
2017年 | 12787篇 |
2016年 | 10985篇 |
2015年 | 5960篇 |
2014年 | 6557篇 |
2013年 | 8384篇 |
2012年 | 13316篇 |
2011年 | 19935篇 |
2010年 | 11949篇 |
2009年 | 12097篇 |
2008年 | 13065篇 |
2007年 | 14589篇 |
2006年 | 5951篇 |
2005年 | 6059篇 |
2004年 | 5021篇 |
2003年 | 4665篇 |
2002年 | 3521篇 |
2001年 | 2340篇 |
2000年 | 2159篇 |
1999年 | 2299篇 |
1998年 | 2086篇 |
1997年 | 1893篇 |
1996年 | 2135篇 |
1995年 | 1647篇 |
1994年 | 1559篇 |
1993年 | 1281篇 |
1992年 | 1156篇 |
1991年 | 1064篇 |
1990年 | 856篇 |
1989年 | 644篇 |
1988年 | 534篇 |
1987年 | 447篇 |
1986年 | 441篇 |
1985年 | 367篇 |
1984年 | 288篇 |
1983年 | 191篇 |
1982年 | 186篇 |
1981年 | 144篇 |
1980年 | 122篇 |
1979年 | 89篇 |
1978年 | 69篇 |
1976年 | 53篇 |
1974年 | 58篇 |
1973年 | 56篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
221.
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. 相似文献
222.
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. 相似文献
223.
V E Krivonozhko O B Utkin A V Volodin I A Sablin M Patrin 《The Journal of the Operational Research Society》2004,55(10):1049-1058
The aim of the paper is to present and substantiate a technique to visualize DEA modelling results without any loss of mathematical rigour. The proposed family of parametric optimization methods allows one to construct an intersection of the multidimensional frontier with a two-dimensional plane determined by any pair of given directions. This approach reduces the efficiency analysis of production units to the investigation of well-known functions in economics. We also propose constructive methods to calculate marginal rates of substitution, marginal rates of transformation and so on. 相似文献
224.
225.
Malmquist indexes can be used to estimate technical change over time. The index generally represents the average effect of technical change on all outputs in a multi-output firm. However, changes in technology do not necessarily affect all outputs involved in the analysis equally. In this paper, a method for estimating the effect of technical change on each of the different outputs is proposed. This estimation is done by a modification of quasi-Malmquist indexes. An artificial data set has been used to validate the method proposed in this paper. 相似文献
226.
Siaw-Lynn Ng 《Order》2004,21(1):1-5
We present a characterisation of posets of size n with linear discrepancy n − 2. These are the posets that are “furthest” from a linear order without being an antichain.
This revised version was published online in September 2006 with corrections to the Cover Date. 相似文献
227.
The rotating flow in the presence of a magnetic field is a problem belonging to hydromagnetics and deserves to be more widely studied than it has been to date. In the non‐linear regime the literature is scarce. We develop the governing equations for the unsteady hydromagnetic rotating flow of a fourth‐order fluid past a porous plate. The steady flow is governed by a boundary value problem in which the order of differential equations is more than the number of available boundary conditions. It is shown that by augmenting the boundary conditions based on asymptotic structures at infinity it is possible to obtain numerical solutions of the nonlinear hydromagnetic equations. Effects of uniform suction or blowing past the porous plate, exerted magnetic field and rotation on the flow phenomena, especially on the boundary layer structure near the plate, are numerically analysed and discussed. The flow behaviours of the Newtonian fluid and second‐, third‐ and fourth‐order non‐Newtonian fluids are compared for the special flow problem, respectively. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
228.
Curtis T. Mcmullen 《Acta Mathematica》2003,191(2):191-223
229.
We will prove a result concerning the inclusion of non-trivial invariant ideals inside non-trivial ideals of a twisted crossed
product. We will also give results concerning the primeness and simplicity of crossed products of twisted actions of locally
compact groups on -algebras.
Received: 25 January 2002; in final form: 22 May 2002/Published online: 2 December 2002
This work is partially supported by Hong Kong RGC Direct Grant. 相似文献
230.
Yoshimi Egawa Mariko Hagita Ken-ichi Kawarabayashi Hong Wang 《Discrete Mathematics》2003,270(1-3):115-125
Let d, k and n be three integers with k3, d4k−1 and n3k. We show that if d(x)+d(y)d for each pair of nonadjacent vertices x and y of a graph G of order n, then G contains k vertex-disjoint cycles converting at least min{d,n} vertices of G. 相似文献