全文获取类型
收费全文 | 16571篇 |
免费 | 2397篇 |
国内免费 | 735篇 |
专业分类
化学 | 2108篇 |
晶体学 | 47篇 |
力学 | 2342篇 |
综合类 | 280篇 |
数学 | 9981篇 |
物理学 | 4945篇 |
出版年
2024年 | 32篇 |
2023年 | 210篇 |
2022年 | 370篇 |
2021年 | 443篇 |
2020年 | 442篇 |
2019年 | 394篇 |
2018年 | 424篇 |
2017年 | 652篇 |
2016年 | 733篇 |
2015年 | 601篇 |
2014年 | 823篇 |
2013年 | 1408篇 |
2012年 | 857篇 |
2011年 | 855篇 |
2010年 | 775篇 |
2009年 | 893篇 |
2008年 | 960篇 |
2007年 | 946篇 |
2006年 | 836篇 |
2005年 | 704篇 |
2004年 | 627篇 |
2003年 | 664篇 |
2002年 | 575篇 |
2001年 | 503篇 |
2000年 | 501篇 |
1999年 | 436篇 |
1998年 | 392篇 |
1997年 | 312篇 |
1996年 | 271篇 |
1995年 | 248篇 |
1994年 | 195篇 |
1993年 | 151篇 |
1992年 | 137篇 |
1991年 | 140篇 |
1990年 | 119篇 |
1989年 | 91篇 |
1988年 | 104篇 |
1987年 | 84篇 |
1986年 | 70篇 |
1985年 | 114篇 |
1984年 | 81篇 |
1983年 | 45篇 |
1982年 | 69篇 |
1981年 | 48篇 |
1980年 | 69篇 |
1979年 | 65篇 |
1978年 | 44篇 |
1977年 | 62篇 |
1976年 | 58篇 |
1974年 | 19篇 |
排序方式: 共有10000条查询结果,搜索用时 62 毫秒
1.
Plasma-assisted flow control is of high industrial interest, but practical applications at full scale require a large surface of interaction. Nanosecond pulsed Dielectric Barrier Discharge (DBD) have demonstrated promising results of flow control, but their interacting region is limited to only a few cm2. In this paper, the conditions to extend a surface nanosecond DBD are documented. It is shown that a sliding discharge regime can fully fill an inter-electrode distance of 40 mm. This discharge regime promotes the formation of two hemispheric pressure waves originating from both air-exposed electrodes while an horizontal region of pressure gradient is also observed. 相似文献
2.
Y. Wardi 《Journal of Optimization Theory and Applications》1989,61(3):473-485
A stochastic algorithm for finding stationary points of real-valued functions defined on a Euclidean space is analyzed. It is based on the Robbins-Monro stochastic approximation procedure. Gradient evaluations are done by means of Monte Carlo simulations. At each iteratex
i
, one sample point is drawn from an underlying probability space, based on which the gradient is approximated. The descent direction is against the approximation of the gradient, and the stepsize is 1/i. It is shown that, under broad conditions, w.p.1 if the sequence of iteratesx
1,x
2,...generated by the algorithm is bounded, then all of its accumulation points are stationary. 相似文献
3.
William J. Reed 《Natural Resource Modeling》1989,3(4):463-480
It is assumed that the probability of destruction of a biological asset by natural hazards can be reduced through investment in protection. Specifically a model, in which the hazard rate depends on both the age of the asset and the accumulated invested protection capital, is assumed. The protection capital depreciates through time and its effectiveness in reducing the hazard rate is subject to diminishing returns. It is shown how the investment schedule to maximize the expected net present value of the asset can be determined using the methods of deterministic optimal control, with the survival probability regarded as a state variable. The optimal investment pattern involves “bang-bang-singular” control. A numerical scheme for determining jointly the optimal investment policy and the optimal harvest (or replacement) age is outlined and a numerical example involving forest fire protection is given. 相似文献
4.
LYNDA D. RODWELL EDWARD B. BARBIER CALLUM M. ROBERTS TIM R. McCLANAHAN 《Natural Resource Modeling》2002,15(4):453-486
ABSTRACT. The excessive and unsustainable exploitation of our marine resources has led to the promotion of marine reserves as a fisheries management tool. Marine reserves, areas in which fishing is restricted or prohibited, can offer opportunities for the recovery of exploited stock and fishery enhancement. In this paper we examine the contribution of fully protected tropical marine reserves to fishery enhancement by modeling marine reserve‐fishery linkages. The consequences of reserve establishment on the long‐run equilibrium fish biomass and fishery catch levels are evaluated. In contrast to earlier models this study highlights the roles of both adult (and juvenile) fish migration and larval dispersal between the reserve and fishing grounds by employing a spawner‐recruit model. Uniform larval dispersal, uniform larval retention and complete larval retention combined with zero, moderate and high fish migration scenarios are analyzed in turn. The numerical simulations are based on Mombasa Marine National Park, Kenya, a fully protected coral reef marine reserve comprising approximately 30% of former fishing grounds. Simulation results suggest that the establishment of a fully protected marine reserve will always lead to an increase in total fish biomass. If the fishery is moderately to heavily exploited, total fishery catch will be greater with the reserve in all scenarios of fish and larval movement. If the fishery faces low levels of exploitation, catches can be optimized without a reserve but with controlled fishing effort. With high fish migration from the reserve, catches are optimized with the reserve. The optimal area of the marine reserve depends on the exploitation rate in the neighboring fishing grounds. For example, if exploitation is maintained at 40%, the ‘optimal’ reserve size would be 10%. If the rate increases to 50%, then the reserve needs to be 30% of the management area in order to maximize catches. However, even in lower exploitation fisheries (below 40%), a small reserve (up to 20%) provides significantly higher gains in fish biomass than losses in catch. Marine reserves are a valuable fisheries management tool. To achieve maximum fishery benefits they should be complemented by fishing effort controls. 相似文献
5.
A (w,r) cover‐free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as the concept of key distribution pattern. In the present paper, we give some new results on superimposed codes. First we construct superimposed codes from super‐simple designs which give us results better than superimposed codes constructed by other known methods. Next we prove the uniqueness of the (1,2) superimposed code of size 9 × 12, the (2,2) superimposed code of size 14 × 8, and the (2,3) superimposed code of size 30 × 10. Finally, we improve numerical values of upper bounds for the asymptotic rate of some (w,r) superimposed codes. © 2004 Wiley Periodicals, Inc. 相似文献
6.
We consider the optimal service control of a multiclass M/G/1 queueing system in which customers are served nonpreemptively and the system cost rate is additive across classes and increasing convex in the numbers present in each class. Following Whittle's approach to a class of restless bandit problems, we develop a Langrangian relaxation of the service control problem which serves to motivate the development of a class of index heuristics. The index for a particular customer class is characterised as a fair charge for service of that class. The paper develops these indices and reports an extensive numerical investigation which exhibits strong performance of the index heuristics for both discounted and average costs. 相似文献
7.
Geng Sheng WANG 《数学学报(英文版)》2005,21(5):1005-1014
This work is concerned with Pontryagin's maximum principle of optimal control problems governed by some non-well-posed semilinear heat equations. A type of approach to the non-well-posed optimal control problem is given. 相似文献
8.
We introduce here some Itô calculus for non-continuous Dirichlet processes. Such calculus extends what was known for continuous Dirichlet processes or for semimartingales. In particular we prove that non-continuous Dirichlet processes are stable under C
1 transformation. 相似文献
9.
基于CSCW的协同编著系统的设计 总被引:3,自引:0,他引:3
讨论了计算机支持的协同工作(CSCW)的主要技术,其中重点讨论了协同编著系统设计中的并发控制技术,指出了其与传统的并发控制技术的区别。根据CSCW的基本原理设计出了一个基于Browse/Server结构的协同编著系统的系统模型。该系统模型比传统的模型更加方便了用户之间通过Internet的浏览器进行协作。 相似文献
10.
Burn‐in is a widely used method to improve the quality of products or systems after they have been produced. In this paper, we consider the problem of determining the optimal burn‐in time and optimal work size maximizing the long‐run average amount of work saved per time unit in the computer applications. Assuming that the underlying lifetime distribution of the computer has an initially decreasing or/and eventually increasing failure rate function, an upper bound for the optimal burn‐in time is derived for each fixed work size and a uniform (with respect to the burn‐in time) upper bound for the optimal work size is also obtained. Furthermore, it is shown that a non‐trivial lower bound for the optimal burn‐in time can be derived if the underlying lifetime distribution has a large initial failure rate. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献