全文获取类型
收费全文 | 364840篇 |
免费 | 4077篇 |
国内免费 | 1195篇 |
专业分类
化学 | 196607篇 |
晶体学 | 5368篇 |
力学 | 15544篇 |
综合类 | 9篇 |
数学 | 40658篇 |
物理学 | 111926篇 |
出版年
2020年 | 2698篇 |
2019年 | 3031篇 |
2018年 | 3672篇 |
2017年 | 3607篇 |
2016年 | 5813篇 |
2015年 | 3880篇 |
2014年 | 5878篇 |
2013年 | 16352篇 |
2012年 | 12025篇 |
2011年 | 14984篇 |
2010年 | 10081篇 |
2009年 | 9965篇 |
2008年 | 13521篇 |
2007年 | 13711篇 |
2006年 | 12619篇 |
2005年 | 11750篇 |
2004年 | 10501篇 |
2003年 | 9274篇 |
2002年 | 9246篇 |
2001年 | 10477篇 |
2000年 | 7939篇 |
1999年 | 6247篇 |
1998年 | 5308篇 |
1997年 | 5303篇 |
1996年 | 4844篇 |
1995年 | 4638篇 |
1994年 | 4445篇 |
1993年 | 4383篇 |
1992年 | 4860篇 |
1991年 | 4981篇 |
1990年 | 4642篇 |
1989年 | 4581篇 |
1988年 | 4618篇 |
1987年 | 4431篇 |
1986年 | 4258篇 |
1985年 | 5742篇 |
1984年 | 5943篇 |
1983年 | 4920篇 |
1982年 | 5411篇 |
1981年 | 5197篇 |
1980年 | 5047篇 |
1979年 | 5208篇 |
1978年 | 5539篇 |
1977年 | 5316篇 |
1976年 | 5489篇 |
1975年 | 5034篇 |
1974年 | 5209篇 |
1973年 | 5493篇 |
1972年 | 3467篇 |
1971年 | 2838篇 |
排序方式: 共有10000条查询结果,搜索用时 187 毫秒
991.
R A Forder 《The Journal of the Operational Research Society》2004,55(4):319-332
The paper presents a survey of operational research (OR) as it is currently used in the UK Ministry of Defence (MoD). After a short historical introduction summarising developments since 1945, it identifies the impact which the end of the Cold War has had on defence operational analysis (OA), as the discipline is generally called within MoD, in terms of the problems studied, the technical challenges presented and the techniques employed. The factors, both external and internal, that have led to the MoD maintaining and indeed expanding its OA activity against a background of falling defence budgets are discussed in the context of previously reported research on the survival and success of OR groups. 相似文献
992.
M F Anjos R C H Cheng C S M Currie 《The Journal of the Operational Research Society》2004,55(5):535-541
The paper describes a methodology that has been implemented in a major British airline to find the optimal price to charge for airline tickets under one-way pricing. An analytical model has been developed to describe the buying behaviour of customers for flights over the selling period. Using this model and a standard analytical method for constrained optimization, we can find an expression for the optimal price structure for a flight. The expected number of bookings made on each day of the selling period and in each fare class given these prices can then be easily calculated. A simulation model is used to find the confidence ranges on the numbers of bookings and these ranges can be used to regulate the sale of tickets. A procedure to update the price structure based on the remaining capacity has also been developed. 相似文献
993.
Azuelos G. Benslama K. Costanzo D. Couture G. Garcia J.E. Hinchliffe I. Kanaya N. Lechowski M. Mehdiyev R. Polesello G. Ros E. Rousseau D. 《The European Physical Journal C - Particles and Fields》2004,39(2):13-24
The European Physical Journal C - We discuss possible searches for the new particles predicted by Little Higgs Models at the LHC. By using a simulation of the ATLAS detector, we demonstrate how the... 相似文献
994.
A band-dominant function on the Euclidean sphere embedded in R q+1 is the restriction to this sphere of an entire function of q+1 complex variables having a finite exponential type in each of its variables. We develop a method to represent such a function using finitely many bits, using the values of the function at scattered sites on the sphere. The number of bits required in our representation is asymptotically the same as the metric entropy of the class of such functions with respect to any of the L p norms on the sphere. 相似文献
995.
In this paper, three new direct Mutually Orthogonal Latin Squares (MOLS) constructions are presented for 7 MOLS(24), 7 MOLS(75) and 8 MOLS(36); then using recursive methods, several new constructions for 7 and 8 MOLS are obtained. These reduce the largest value for which 7 MOLS are unknown from 780 to 570, and the largest odd value for which 8 MOLS are unknown from 1935 to 419. © 2003 Wiley Periodicals, Inc. 相似文献
996.
R. Hildebrand 《Journal of Mathematical Sciences》2004,121(2):2178-2220
997.
Sean D. Brooks M. F. Mahmood J. A. Donaldson 《Journal of Mathematical Modelling and Algorithms》2004,3(1):19-29
A numerical investigation, based on the split-step Fourier transform algorithm of all optical switching of solitons in a low
birefringent optical fiber is presented. The numerical algorithm is described in detail.
This revised version was published online in August 2006 with corrections to the Cover Date. 相似文献
998.
In this paper, we examine a variant of the uncapacitated lot-sizing model of Wagner–Whitin that includes fixed charges on the stocks. Such a model is natural in a production environment where stocking is a complex operation, and appears as a subproblem in more general network design problems.
Linear-programming formulations, a dynamic program, the convex hull of integer solutions and a separation algorithm are presented. All these turn out to be very natural extensions of the corresponding results of Barany et al. (Math. Programming Stud. 22 (1984) 32) for the uncapacitated lot-sizing problem. The convex hull proof is based on showing that an extended facility location formulation is tight and by projecting it onto the original space of variables. 相似文献
999.
R. Milson 《Proceedings of the American Mathematical Society》2004,132(10):2825-2831
Chevalley's theorem and its converse, the Sheppard-Todd theorem, assert that finite reflection groups are distinguished by the fact that the ring of invariant polynomials is freely generated. We show that, in the Euclidean case, a weaker condition suffices to characterize finite reflection groups, namely, that a freely-generated polynomial subring is closed with respect to the gradient product.
1000.
In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics. 相似文献