全文获取类型
收费全文 | 13639篇 |
免费 | 1183篇 |
国内免费 | 547篇 |
专业分类
化学 | 3434篇 |
晶体学 | 91篇 |
力学 | 1701篇 |
综合类 | 262篇 |
数学 | 7165篇 |
物理学 | 2716篇 |
出版年
2024年 | 38篇 |
2023年 | 147篇 |
2022年 | 495篇 |
2021年 | 502篇 |
2020年 | 377篇 |
2019年 | 347篇 |
2018年 | 349篇 |
2017年 | 484篇 |
2016年 | 515篇 |
2015年 | 374篇 |
2014年 | 641篇 |
2013年 | 947篇 |
2012年 | 784篇 |
2011年 | 625篇 |
2010年 | 598篇 |
2009年 | 715篇 |
2008年 | 705篇 |
2007年 | 806篇 |
2006年 | 647篇 |
2005年 | 588篇 |
2004年 | 479篇 |
2003年 | 475篇 |
2002年 | 409篇 |
2001年 | 360篇 |
2000年 | 362篇 |
1999年 | 275篇 |
1998年 | 283篇 |
1997年 | 280篇 |
1996年 | 225篇 |
1995年 | 245篇 |
1994年 | 202篇 |
1993年 | 171篇 |
1992年 | 139篇 |
1991年 | 111篇 |
1990年 | 95篇 |
1989年 | 79篇 |
1988年 | 57篇 |
1987年 | 46篇 |
1986年 | 45篇 |
1985年 | 64篇 |
1984年 | 54篇 |
1983年 | 15篇 |
1982年 | 30篇 |
1981年 | 21篇 |
1980年 | 23篇 |
1979年 | 35篇 |
1978年 | 25篇 |
1977年 | 33篇 |
1976年 | 21篇 |
1957年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
51.
Q.J. Zhu 《Journal of Mathematical Analysis and Applications》2007,326(1):708-720
Investment systems are studied using a framework that emphasize their profiles (the cumulative probability distribution on all the possible percentage gains of trades) and their log return functions (the expected average return per trade in logarithmic scale as a function of the investment size in terms of the percentage of the available capital). The efficiency index for an investment system, defined as the maximum of the log return function, is proposed as a measure to compare investment systems for their intrinsic merit. This efficiency index can be viewed as a generalization of Shannon's information rate for a communication channel. Applications are illustrated. 相似文献
52.
首先将无线传感器网络的路由问题转化成求解最小Steiner树问题,然后给出了求解无线传感器网络路由的蚁群优化算法,并对算法的收敛性进行了证明.最后对找到最优解后信息素值的变化进行了分析.即在限制信息素取值的条件下,当迭代次数充分大时,该算法能以任意接近于1的概率找到最优解,并且当最优解找到后,最优树边上的信息素单调增加,而最优解以外边上的信息素在有限步达到最小值. 相似文献
53.
E. Hernández L. Rodríguez-Marín 《Journal of Optimization Theory and Applications》2007,134(1):119-134
In this paper, we study optimization problems where the objective function and the binding constraints are set-valued maps
and the solutions are defined by means of set-relations among all the images sets (Kuroiwa, D. in Takahashi, W., Tanaka, T.
(eds.) Nonlinear analysis and convex analysis, pp. 221–228, 1999). We introduce a new dual problem, establish some duality theorems and obtain a Lagrangian multiplier rule of nonlinear type
under convexity assumptions. A necessary condition and a sufficient condition for the existence of saddle points are given.
The authors thank the two referees for valuable comments and suggestions on early versions of the paper. The research of the
first author was partially supported by Ministerio de Educación y Ciencia (Spain) Project MTM2006-02629 and by Junta de Castilla
y León (Spain) Project VA027B06. 相似文献
54.
Madhu V. Nayakkankuppam 《Mathematical Programming》2007,109(2-3):477-504
We describe an approach to the parallel and distributed solution of large-scale, block structured semidefinite programs using
the spectral bundle method. Various elements of this approach (such as data distribution, an implicitly restarted Lanczos
method tailored to handle block diagonal structure, a mixed polyhedral-semidefinite subdifferential model, and other aspects
related to parallelism) are combined in an implementation called LAMBDA, which delivers faster solution times than previously
possible, and acceptable parallel scalability on sufficiently large problems.
This work was supported in part by NSF grants DMS-0215373 and DMS-0238008. 相似文献
55.
Peter Francis Guangming Zhang Karen Smilowitz 《European Journal of Operational Research》2007,180(3):1045-1059
This paper presents modeling and solution method improvements for the Multi-Resource Routing Problem (MRRP) with flexible tasks. The MRRP with flexible tasks is used to model routing and scheduling problems for intermodal drayage operations in which two resources (tractors and trailers) perform tasks to transport loaded and empty equipment. Tasks may be either well defined, in which both the origin and the destination of a movement are given, or flexible, in which the origin or the destination is chosen by the model. This paper proposes methods to effectively manage the number of options considered for flexible tasks (either feasible origins for a known destination or feasible destinations for a known origin). This modeling change generates sufficient options to allow for low-cost solutions while maintaining reasonable computational effort. We also propose a new solution method that uses randomized route generation. Computational results from test cases show that these changes improve the quality of solutions by at least 5% in the test cases as compared to methods from previous studies. 相似文献
56.
B. Ivorra A. M. Ramos B. Mohammadi 《Journal of Optimization Theory and Applications》2007,135(3):549-561
This paper has two objectives. We introduce a new global optimization algorithm reformulating optimization problems in terms
of boundary-value problems. Then, we apply this algorithm to a pointwise control problem of the viscous Burgers equation,
where the control weight coefficient is progressively decreased. The results are compared with those obtained with a genetic
algorithm and an LM-BFGS algorithm in order to check the efficiency of our method and the necessity of using global optimization
techniques. 相似文献
57.
本文研究了由目标函数扰动的集值优化问题的有效点集所定义的集值映射的半连续性.讨论了目标函数扰动的集值优化问题在上半连续意义下的稳定性.特别地,在广义适定性条件下,证明了集值优化问题在上半连续意义下的稳定性. 相似文献
58.
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. 相似文献
59.
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. 相似文献
60.
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. 相似文献