全文获取类型
收费全文 | 2042篇 |
免费 | 166篇 |
国内免费 | 155篇 |
专业分类
化学 | 72篇 |
力学 | 28篇 |
综合类 | 29篇 |
数学 | 2014篇 |
物理学 | 220篇 |
出版年
2023年 | 27篇 |
2022年 | 47篇 |
2021年 | 39篇 |
2020年 | 52篇 |
2019年 | 62篇 |
2018年 | 61篇 |
2017年 | 75篇 |
2016年 | 72篇 |
2015年 | 57篇 |
2014年 | 122篇 |
2013年 | 191篇 |
2012年 | 98篇 |
2011年 | 86篇 |
2010年 | 86篇 |
2009年 | 125篇 |
2008年 | 124篇 |
2007年 | 134篇 |
2006年 | 112篇 |
2005年 | 97篇 |
2004年 | 86篇 |
2003年 | 89篇 |
2002年 | 86篇 |
2001年 | 83篇 |
2000年 | 68篇 |
1999年 | 48篇 |
1998年 | 44篇 |
1997年 | 39篇 |
1996年 | 26篇 |
1995年 | 18篇 |
1994年 | 13篇 |
1993年 | 9篇 |
1992年 | 7篇 |
1991年 | 4篇 |
1990年 | 4篇 |
1989年 | 8篇 |
1988年 | 4篇 |
1987年 | 5篇 |
1985年 | 11篇 |
1984年 | 9篇 |
1983年 | 5篇 |
1982年 | 4篇 |
1981年 | 5篇 |
1980年 | 3篇 |
1979年 | 3篇 |
1978年 | 2篇 |
1977年 | 3篇 |
1976年 | 4篇 |
1970年 | 1篇 |
1957年 | 1篇 |
1936年 | 1篇 |
排序方式: 共有2363条查询结果,搜索用时 15 毫秒
21.
22.
Bernard Bialecki 《Numerical Algorithms》1994,8(2):167-184
Cyclic reduction and Fourier analysis-cyclic reduction (FACR) methods are presented for the solution of the linear systems which arise when orthogonal spline collocation with piecewise Hermite bicubics is applied to boundary value problems for certain separable partial differential equations on a rectangle. On anN×N uniform partition, the cyclic reduction and Fourier analysis-cyclic reduction methods requireO(N
2log2
N) andO(N
2log2log2
N) arithmetic operations, respectively. 相似文献
23.
本文主要根据τ与μ的不同取值分三种情况刻划了Cn中单位球上Dirichlet 型空间上的点乘子空间M(Dτ,Dμ),并通过两个函数的构造表明:当τ≤n时,包含 关系M(Dτ)(?)Dτ和当τ>μ,τ>n-1时,包含关系M(Dτ)(?) M(Dμ)是严格的. 相似文献
24.
This paper proposes a perturbation-based heuristic for the capacitated multisource Weber problem. This procedure is based on an effective use of borderline customers. Several implementations are considered and the two most appropriate are then computationally enhanced by using a reduced neighbourhood when solving the transportation problem. Computational results are presented using data sets from the literature, originally used for the uncapacitated case, with encouraging results. 相似文献
25.
Estimating market shares in each market segment using the information entropy concept 总被引:3,自引:0,他引:3
Sales data of a certain product for the various competitors are usually available at the aggregate level. However these data give no clue to the heterogeneities in the sales pattern across different market segments. Heterogeneities are caused by different purchasing behavior in each market segment; as a purchaser in a segment will be attracted to the attributes of the product most important to that segment. This concept can be formalized via a simple attraction model that utilizes an elasticity measure for each quality or price attribute [G.S. Carpenter, L.G. Cooper, D.M. Hanssens, D.F. Midgley, Modeling asymmetric competition, Marketing Science 7 (4) (1998) 393–412]. Assessment of these elasticities is not difficult since customer response – in each market segment – to perception of quality and price is tracked by most firms [J. Ross, D. Georgoff, A survey of productive and quality issues in manufacturing. The state of the industry, Industrial Management 3 (5) (1991) 22–25]. This paper attempts to formulate a generic framework based on the information entropy concept that utilizes such an attraction model to estimate competitors’ sales in each market segment. 相似文献
26.
This paper studied the cost allocation for the unfunded liability in a defined benefit pension scheme incorporating the stochastic phenomenon of its returns. In the recent literature represented by Cairns and Parker [Insurance: Mathematics and Economics 21 (1997) 43], Haberman [Insurance: Mathematics and Economics 11 (1992) 179; Insurance: Mathematics and Economics 13 (1993) 45; Insurance: Mathematics and Economics 14 (1994) 219; Insurance: Mathematics and Economics 14 (1997) 127], Owadally and Haberman [North American Actuarial Journal 3 (1999) 105], the fund level is modeled based on the plan dynamics and the returns are generated through several stochastic processes to reflect the current realistic economic perspective to see how the contribution changed as the cost allocation period increased. In this study, we generalize the previous constant value assumption in cost amortization by modeling the returns and valuation rates simultaneously. Taylor series expansion is employed to approximate the unconditional and conditional moments of the plan contribution and fund level. Hence the stability of the plan contribution and the fund size under different allocation periods could be estimated, which provide valuable information adding to the previous works. 相似文献
27.
Robert S. Maier 《Random Structures and Algorithms》1991,2(4):379-420
We analyze the performance of a prototypical scheme for shared storage allocation: two initially empty stacks evolving in a contiguous block of memory of size m. We treat the case in which the stacks are more likely to shrink than grow, but with the probabilities of insertion and deletion allowed to depend arbitrarily on stack height as a fraction of m. New results are obtained on the m → ∞ asymptotics of the stack collision time, and of the final stack heights. The results of Wentzell and Freidlin on the large deviations of Markov chains are used, and the relation of their formalism to the Hamiltonian formulation of classical mechanics is emphasized. Certain results on higher-order asymptotics follow from WKB expansions. 相似文献
28.
Pedro Freitas 《Journal of Functional Analysis》2007,251(1):376-398
We study the asymptotic expansion of the first Dirichlet eigenvalue of certain families of triangles and of rhombi as a singular limit is approached. In certain cases, which include isosceles and right triangles, we obtain the exact value of all the coefficients of the unbounded terms in the asymptotic expansion as the angle opening approaches zero, plus the constant term and estimates on the remainder. For rhombi and other triangle families such as isosceles triangles where now the angle opening approaches π, we have the first two terms plus bounds on the remainder. These results are based on new upper and lower bounds for these domains whose asymptotic expansions coincide up to the orders mentioned. Apart from being accurate near the singular limits considered, our lower bounds for the rhombus improve upon the bound by Hooker and Protter for angles up to approximately 22° and in the range (31°,54°). These results also show that the asymptotic expansion around the degenerate case of the isosceles triangle with vanishing angle opening depends on the path used to approach it. 相似文献
29.
We consider the semilinear Cauchy problem for a class of pseudo-differential operators generating sub-Markovian semigroups.
Solutions of such problems with negative definite nonlinearity play an important role in constructing branching measure-valued
processes. We establish local existence and uniqueness of solutions in the context of the Dirichlet space associated to the
problem. Comparison and global properties of solutions are also studied.
Accepted 29 August 2001. Online publication 17 December 2001. 相似文献
30.
We introducegeneral starvation and consider cyclic networks withgeneral blocking and starvation (GBS). The mechanism of general blocking allows the server to process a limited number of jobs when the buffer downstream is full, and that of general starvation allows the server to perform a limited number of services in anticipation of jobs that are yet to arrive. The two main goals of this paper are to investigate how the throughput of cyclic GBS networks is affected by varying (1) the total number of jobsJ, and (2) the buffer allocationk=(k1..., km) subject to a fixed total buffer capacityK=k
1 +... + km. In particular, we obtain sufficient conditions for the throughput to be symmetric inJ and to be maximized whenJ=K/2. We also show that the equal buffer allocation is optimal under the two regimes of light or heavy usage. In order to establish these results, we obtain several intermediate structural properties of the throughput, using duality, reversibility, and concavity, which are of independent interest.Research supported in part by NSF Grant No. ECS-8919818. 相似文献