全文获取类型
收费全文 | 18242篇 |
免费 | 1417篇 |
国内免费 | 1043篇 |
专业分类
化学 | 3827篇 |
晶体学 | 121篇 |
力学 | 1575篇 |
综合类 | 285篇 |
数学 | 11180篇 |
物理学 | 3714篇 |
出版年
2024年 | 29篇 |
2023年 | 170篇 |
2022年 | 528篇 |
2021年 | 545篇 |
2020年 | 480篇 |
2019年 | 451篇 |
2018年 | 479篇 |
2017年 | 551篇 |
2016年 | 615篇 |
2015年 | 453篇 |
2014年 | 852篇 |
2013年 | 1234篇 |
2012年 | 969篇 |
2011年 | 902篇 |
2010年 | 817篇 |
2009年 | 1021篇 |
2008年 | 1066篇 |
2007年 | 1173篇 |
2006年 | 932篇 |
2005年 | 819篇 |
2004年 | 706篇 |
2003年 | 702篇 |
2002年 | 595篇 |
2001年 | 538篇 |
2000年 | 506篇 |
1999年 | 413篇 |
1998年 | 407篇 |
1997年 | 359篇 |
1996年 | 303篇 |
1995年 | 286篇 |
1994年 | 248篇 |
1993年 | 192篇 |
1992年 | 167篇 |
1991年 | 146篇 |
1990年 | 128篇 |
1989年 | 103篇 |
1988年 | 99篇 |
1987年 | 77篇 |
1986年 | 65篇 |
1985年 | 99篇 |
1984年 | 85篇 |
1983年 | 35篇 |
1982年 | 56篇 |
1981年 | 42篇 |
1980年 | 29篇 |
1979年 | 59篇 |
1978年 | 39篇 |
1977年 | 52篇 |
1976年 | 38篇 |
1973年 | 10篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
71.
本文研究了由目标函数扰动的集值优化问题的有效点集所定义的集值映射的半连续性.讨论了目标函数扰动的集值优化问题在上半连续意义下的稳定性.特别地,在广义适定性条件下,证明了集值优化问题在上半连续意义下的稳定性. 相似文献
72.
We study a variation of the knapsack problem in which each item has a profit, a weight and a penalty; the sum of profits of the selected items minus the largest penalty associated with the selected items must be maximized. We present an ILP formulation and an exact optimization algorithm. 相似文献
73.
We consider a multiperiod mean-variance model where the model parameters change according to a stochastic market. The mean
vector and covariance matrix of the random returns of risky assets all depend on the state of the market during any period
where the market process is assumed to follow a Markov chain. Dynamic programming is used to solve an auxiliary problem which,
in turn, gives the efficient frontier of the mean-variance formulation. An explicit expression is obtained for the efficient
frontier and an illustrative example is given to demonstrate the application of the procedure. 相似文献
74.
R. N. Miroshin 《Mathematical Notes》2007,82(3-4):357-365
Multiple integrals generalizing the iterated kernels of integral operators are expressed as single integrals in the case of a special representation of the kernel (this is our theorem). Besides integral equations, Markov processes involve these integrals as well. As a consequence of the theorem, we obtain transition probability densities of certain Markov processes. As an illustration, we consider nine examples. 相似文献
75.
Supply Chain Management (SCM) is an important activity in all producing facilities and in many organizations to enable vendors,
manufacturers and suppliers to interact gainfully and plan optimally their flow of goods and services. To realize this, a
dynamic modelling approach for characterizing supply chain activities is opportune, so as to plan efficiently the set of activities
over a distributed network in a formal and scientific way. The dynamical system will result so complex that it is not generally
possible to specify the functional forms and the parameters of interest, relating outputs to inputs, states and stochastic
terms by experiential specification methods. Thus the algorithm that will presented is Data Driven, determining simultaneously
the functional forms, the parameters and the optimal control policy from the data available for the supply chain. The aim
of this paper is to present this methodology, by considering dynamical aspects of the system, the presence of nonlinear relationships
and unbiased estimation procedures to quantify these relations, leading to a nonlinear and stochastic dynamical system representation
of the SCM problem. Moreover, the convergence of the algorithm will be proved and the satisfaction of the required statistical
conditions demonstrated. Thus SCM problems may be formulated as formal scientific procedures, with well defined algorithms
and a precise calculation sequence to determine the best alternative to enact. A “Certainty equivalent principle” will be
indicated to ensure that the effects of the inevitable uncertainties will not lead to indeterminate results, allowing the
formulation of demonstrably asymptotically optimal management plans. 相似文献
76.
Satya Prakash 《Pramana》1989,33(1):109-131
This article summarizes the recent radiochemical investigations on mass, charge kinetic energy and fragment angular distributions
in low energy fission of actinides. 相似文献
77.
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. 相似文献
78.
We construct random locally compact real trees called Lévy trees that are the genealogical trees associated with continuous-state
branching processes. More precisely, we define a growing family of discrete Galton–Watson trees with i.i.d. exponential branch
lengths that is consistent under Bernoulli percolation on leaves; we define the Lévy tree as the limit of this growing family
with respect to the Gromov–Hausdorff topology on metric spaces. This elementary approach notably includes supercritical trees
and does not make use of the height process introduced by Le Gall and Le Jan to code the genealogy of (sub)critical continuous-state
branching processes. We construct the mass measure of Lévy trees and we give a decomposition along the ancestral subtree of
a Poisson sampling directed by the mass measure.
T. Duquesne is supported by NSF Grants DMS-0203066 and DMS-0405779. M. Winkel is supported by Aon and the Institute of Actuaries,
EPSRC Grant GR/T26368/01, le département de mathématique de l’Université d’Orsay and NSF Grant DMS-0405779. 相似文献
79.
刘国志 《数学的实践与认识》2006,36(12):1-5
提出一个新的具有积压定单的关于模糊订购量的模糊存储模型.在模糊函数原理下,给出了模糊总存储成本.为了寻找最优解,把最优模糊存储模型转化为双目标最优化模型,利用L ingo8.0求解不等式约束问题,我们发现最优解都是确定的实数.此外,当模糊订购量和模糊总需求都是三角形(或权重均为1/2梯形)模糊数时,我们提出模型的最优解与经典的具有积压定单存储模型具有相同的结果. 相似文献
80.
In single-objective optimization it is possible to find a global optimum, while in the multi-objective case no optimal solution is clearly defined, but several that simultaneously optimize all the objectives. However, the majority of this kind of problems cannot be solved exactly as they have very large and highly complex search spaces. Recently, meta-heuristic approaches have become important tools for solving multi-objective problems encountered in industry as well as in the theoretical field. Most of these meta-heuristics use a population of solutions, and hence the runtime increases when the population size grows. An interesting way to overcome this problem is to apply parallel processing. This paper analyzes the performance of several parallel paradigms in the context of population-based multi-objective meta-heuristics. In particular, we evaluate four alternative parallelizations of the Pareto simulated annealing algorithm, in terms of quality of the solutions, and speedup. 相似文献