全文获取类型
收费全文 | 725篇 |
免费 | 54篇 |
国内免费 | 53篇 |
专业分类
化学 | 207篇 |
力学 | 59篇 |
综合类 | 26篇 |
数学 | 388篇 |
物理学 | 152篇 |
出版年
2023年 | 7篇 |
2022年 | 11篇 |
2021年 | 15篇 |
2020年 | 14篇 |
2019年 | 12篇 |
2018年 | 19篇 |
2017年 | 21篇 |
2016年 | 20篇 |
2015年 | 22篇 |
2014年 | 29篇 |
2013年 | 38篇 |
2012年 | 38篇 |
2011年 | 35篇 |
2010年 | 25篇 |
2009年 | 34篇 |
2008年 | 45篇 |
2007年 | 41篇 |
2006年 | 32篇 |
2005年 | 31篇 |
2004年 | 26篇 |
2003年 | 19篇 |
2002年 | 27篇 |
2001年 | 25篇 |
2000年 | 15篇 |
1999年 | 26篇 |
1998年 | 20篇 |
1997年 | 16篇 |
1996年 | 16篇 |
1995年 | 15篇 |
1994年 | 16篇 |
1993年 | 25篇 |
1992年 | 21篇 |
1991年 | 10篇 |
1990年 | 14篇 |
1989年 | 7篇 |
1988年 | 2篇 |
1987年 | 4篇 |
1986年 | 8篇 |
1985年 | 6篇 |
1984年 | 3篇 |
1982年 | 6篇 |
1981年 | 4篇 |
1980年 | 1篇 |
1979年 | 4篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1972年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有832条查询结果,搜索用时 328 毫秒
1.
It is long known that the Fokker-Planck equation with prescribed constant coefficients of diffusion and linear friction describes
the ensemble average of the stochastic evolutions in velocity space of a Brownian test particle immersed in a heat bath of
fixed temperature. Apparently, it is not so well known that the same partial differential equation, but now with constant
coefficients which are functionals of the solution itself rather than being prescribed, describes the kinetic evolution (in
the N→∞ limit) of an
isolated
N-particle system with certain stochastic interactions. Here we discuss in detail this recently discovered interpretation.
An erratum to this article can be found at 相似文献
2.
MC模式下顾客需求与厂商供应的纳什均衡 总被引:3,自引:0,他引:3
在大规模定制(MC,Mass Customization)模式下,基于市场需求的复杂化,厂商对个性化的顾客需求很难做出及时准确的反应,而且由于其自身生产能力的限制,不可能对所有的个性化用户进行一一地满足,只可能对已经存在的个性化需求,根据自身的生产能力和规模,以利润最大化及顾客对产品的满意度为目标,对个性化需求进行较准确地预测,从而正确指导生产。本通过博弈论的方法,提出了一个基于顾客对产品的满意度及企业的利润的一个非合作博弈模型,并给出求解纳什均衡的方法。 相似文献
3.
J.-L. Hainaut V. Englebert J. Henrard J.-M. Hick D. Roland 《Applied Categorical Structures》1996,3(1-2):9-45
This paper analyzes the requirements that CASE tools should meet for effective database reverse engineering (DBRE), and proposes
a general architecture for data-centered applications reverse engineering CASE environments. First, the paper describes a
generic DBMS-independent DBRE methodology, then it analyzes the main characteristics of DBRE activities in order to collect
a set of desirable requirements. Finally, it describes DB-MAIN, an operational CASE tool developed according to these requirements.
The main features of this tool that are described in this paper are its unique generic specification model, its repository,
its transformation toolkit, its user interface, the text processors, the assistants, the methodological control and its functional
extensibility. Finally, the paper describes five real-world projects in which the methodology and the CASE tool were applied.
This is a heavily revised and extended version of “Requirements for Information System Reverse Engineering Support” by J.-L.
Hainaut, V. Englebert, J. Henrard, J.-M. Hick, D. Roland, which first appeared in the Proceedings of the Second Working Conference
on Reverse Engineering, IEEE Computer Society Press, pp. 136–145, July 1995. This paper presents some results of the DB-MAIN
project. This project is partially supported by the Région Wallonne, the European Union, and by a consortium comprising ACEC-OSI (Be), ARIANE-II (Be), Banque UCL (Lux), BBL (Be), Centre de recherche public H.
Tudor (Lux), CGER (Be), Cockerill-Sambre (Be), CONCIS (Fr), D'Ieteren (Be), DIGITAL, EDF (Fr), EPFL (CH), Groupe S (Be), IBM,
OBLOG Software (Port), ORIGIN (Be), Ville de Namur (Be), Winterthur (Be), 3 Suisses (Be). The DB-Process subproject is supported
by the Communauté Fran?aise de Belgique. 相似文献
4.
A BRANCH BOUND METHOD FOR SUBSET SUM PROBLEM 总被引:1,自引:0,他引:1
吴士泉 《应用数学学报(英文版)》1994,10(3):302-314
ABRANCHBOUNDMETHODFORSUBSETSUMPROBLEMWUSHIQUAN(吴士泉)(InstituteofAppliedMathematics,theChineseAcademyofSciences,Beijing100080,C... 相似文献
5.
K. C. Kiwiel 《Journal of Optimization Theory and Applications》2007,134(3):549-554
We give a linear time algorithm for the continuous quadratic knapsack problem which is simpler than existing methods and competitive
in practice. Encouraging computational results are presented for large-scale problems.
The author thanks the Associate Editor and an anonymous referee for their helpful comments. 相似文献
6.
Charles Blair 《Mathematical Programming》1995,71(2):127-136
We identify a class of formulas computable in polynomial time such that the functions defined by these formulas are precisely the value functions of mixed-integer programs with rational constraint coefficients. 相似文献
7.
Lai-Jiu Lin 《Journal of Global Optimization》2007,38(1):21-39
In this paper, we study an existence theorem of systems of generalized quasivariational inclusions problem. By this result,
we establish the existence theorems of solutions of systems of generalized equations, systems of generalized vector quasiequilibrium
problem, collective variational fixed point, systems of generalized quasiloose saddle point, systems of minimax theorem, mathematical
program with systems of variational inclusions constraints, mathematical program with systems of equilibrium constraints and
systems of bilevel problem and semi-infinite problem with systems of equilibrium problem constraints.
This research was supported by the National Science Council of the Republic of China. 相似文献
8.
通过分析双层线性规划可行域的结构特征和全局最优解在约束域的极点上达到这一特性,对单纯形方法中进基变量的选取法则进行适当修改后,给出了一个求解双层线性规划局部最优解方法,然后引进上层目标函数对应的一种割平面约束来修正当前局部最优解,直到求得双层线性规划的全局最优解.提出的算法具有全局收敛性,并通过算例说明了算法的求解过程. 相似文献
9.
We introduce the concept of partially strictly monotone functions and apply it to construct a class of nonlinear penalty functions for a constrained optimization problem. This class of nonlinear penalty functions includes some (nonlinear) penalty functions currently used in the literature as special cases. Assuming that the perturbation function is lower semi-continuous, we prove that the sequence of optimal values of nonlinear penalty problems converges to that of the original constrained optimization problem. First-order and second-order necessary optimality conditions of nonlinear penalty problems are derived by converting the optimality of penalty problems into that of a smooth constrained vector optimization problem. This approach allows for a concise derivation of optimality conditions of nonlinear penalty problems. Finally, we prove that each limit point of the second-order stationary points of the nonlinear penalty problems is a second-order stationary point of the original constrained optimization problem. 相似文献
10.