全文获取类型
收费全文 | 1094篇 |
免费 | 211篇 |
国内免费 | 40篇 |
专业分类
化学 | 387篇 |
力学 | 23篇 |
综合类 | 51篇 |
数学 | 673篇 |
物理学 | 211篇 |
出版年
2024年 | 2篇 |
2023年 | 22篇 |
2022年 | 48篇 |
2021年 | 51篇 |
2020年 | 55篇 |
2019年 | 47篇 |
2018年 | 38篇 |
2017年 | 56篇 |
2016年 | 68篇 |
2015年 | 38篇 |
2014年 | 93篇 |
2013年 | 76篇 |
2012年 | 68篇 |
2011年 | 83篇 |
2010年 | 87篇 |
2009年 | 79篇 |
2008年 | 54篇 |
2007年 | 63篇 |
2006年 | 58篇 |
2005年 | 38篇 |
2004年 | 23篇 |
2003年 | 29篇 |
2002年 | 26篇 |
2001年 | 27篇 |
2000年 | 17篇 |
1999年 | 13篇 |
1998年 | 21篇 |
1997年 | 6篇 |
1996年 | 8篇 |
1995年 | 2篇 |
1994年 | 5篇 |
1993年 | 4篇 |
1992年 | 5篇 |
1991年 | 5篇 |
1990年 | 8篇 |
1989年 | 4篇 |
1988年 | 5篇 |
1987年 | 2篇 |
1986年 | 4篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1982年 | 1篇 |
1979年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有1345条查询结果,搜索用时 15 毫秒
1.
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. 相似文献
2.
3.
Ross Anderson Cunsheng Ding Tor Helleseth Torleiv Klove 《Designs, Codes and Cryptography》1998,15(2):111-124
Previous researchers have designed shared control schemes with a view to minimising the likelihood that participants will conspire to perform an unauthorised act. But, human nature being what it is, systems inevitably fail; so shared control schemes should also be designed so that the police can identify conspirators after the fact. This requirement leads us to search for schemes with sparse access structures. We show how this can be done using ideas from coding theory. In particular, secret sharing schemes based on geometric codes whose dual [n,k,d] codes have d and n as their only nonzero weights are suitable. We determine their access structures and analyse their properties. We have found almost all of them, and established some relations among codes, designs and secret-sharing schemes. 相似文献
4.
In this paper we consider the (t, n)-threshold visual secret sharing scheme (VSSS) in which black pixels in a secret black-white images is reproduced perfectly
as black pixels when we stack arbitrary t shares. This paper provides a new characterization of the (t, n)-threshold visual secret sharing scheme with such a property (hereafter, we call such a VSSS the (t, n)-PBVSSS for short). We use an algebraic method to characterize basis matrices of the (t, n)-PBVSSS in a certain class of matrices. We show that the set of all homogeneous polynomials each element of which yields
basis matrices of the (t, n)-PBVSSS becomes a set of lattice points in an (n−t+1)-dimensional linear space. In addition, we prove that the optimal basis matrices in the sense of maximizing the relative
difference among all the basis matrices in the class coincides with the basis matrices given by Blundo, Bonis and De Santis
[3] for all n≥ t ≥ 2. 相似文献
5.
We provide an approximate analysis of the transient sojourn time for a processor sharing queue with time varying arrival and
service rates, where the load can vary over time, including periods of overload. Using the same asymptotic technique as uniform
acceleration as demonstrated in [12] and [13], we obtain fluid and diffusion limits for the sojourn time of the Mt/Mt/1 processor-sharing queue. Our analysis is enabled by the introduction of a “virtual customer” which differs from the notion
of a “tagged customer” in that the former has no effect on the processing time of the other customers in the system. Our analysis
generalizes to non-exponential service and interarrival times, when the fluid and diffusion limits for the queueing process
are known. 相似文献
6.
J. A. Morrison 《Queueing Systems》1991,9(1-2):191-213
In this paper the steady-state behavior of a closed queueing network with multiple classes and large populations is investigated. One of the two nodes of the network simply introduces random delays and the discipline in the other node is discriminatory processor sharing. The network is not product-form, so not even the steady-state behavior is known. We assume that the usage is moderately heavy, and obtain two-term asymptotic approximations to the mean number of jobs, and the mean sojourn time, of each class of jobs in the processor node. We also obtain the leading term in the asymptotic approximation to the joint distribution of the number of jobs in the processor node, which is a zero-mean multivariate Gaussian distribution around a line through the origin. 相似文献
7.
A uniqueness theorem for two distinct non-constant meromorphic functions that share three values of finite weights is proved, which generalizes two previous results by H.X. Yi, and X.M. Li and H.X. Yi. As applications of it, many known results by H.X. Yi and P. Li, etc. could be improved. Furthermore, with the concept of finite-weight sharing, extensions on Osgood-Yang's conjecture and Mues' conjecture, and a generalization of some prevenient results by M. Ozawa and H. Ueda, ect. could be obtained. 相似文献
8.
依据多媒体教育资源各层次特征及其关系,通过定义资源媒体特征空间,构建了教育资源库层次索引模型,各层次特征间的映射规则将资源的高层语义特征映射到低层媒体特征,达到了扩充描述语义的目的,提高了查全率;结合学科本体,规范了资源标注内容和用户查询条件的描述,减少了人为因素对查询项和索引项匹配相似度计算的影响,提高了查准率. 相似文献
9.
Optimal production and rationing decisions in supply chains with information sharing 总被引:1,自引:0,他引:1
Boray Huang 《Operations Research Letters》2007,35(5):669-676
This paper considers a two-echelon capacitated supply chain with two non-identical retailers and information sharing. We characterize the optimal inventory policies. We also study the benefits of the optimal stock rationing policy over the first come first served (FCFS) and the modified echelon-stock rationing (MESR) policies. 相似文献
10.
Siaw-Lynn Ng 《Designs, Codes and Cryptography》2003,30(1):5-19
Deciding whether a matroid is secret sharing or not is a well-known open problem. In Ng and Walker [6] it was shown that a matroid decomposes into uniform matroids under strong connectivity. The question then becomes as follows: when is a matroid m with N uniform components secret sharing? When N = 1, m corresponds to a uniform matroid and hence is secret sharing. In this paper we show, by constructing a representation using projective geometry, that all connected matroids with two uniform components are secret sharing 相似文献