全文获取类型
收费全文 | 426篇 |
免费 | 12篇 |
国内免费 | 31篇 |
专业分类
化学 | 61篇 |
晶体学 | 2篇 |
力学 | 81篇 |
综合类 | 5篇 |
数学 | 234篇 |
物理学 | 86篇 |
出版年
2024年 | 1篇 |
2023年 | 7篇 |
2022年 | 11篇 |
2021年 | 11篇 |
2020年 | 10篇 |
2019年 | 8篇 |
2018年 | 6篇 |
2017年 | 8篇 |
2016年 | 16篇 |
2015年 | 8篇 |
2014年 | 26篇 |
2013年 | 28篇 |
2012年 | 23篇 |
2011年 | 25篇 |
2010年 | 25篇 |
2009年 | 23篇 |
2008年 | 28篇 |
2007年 | 44篇 |
2006年 | 21篇 |
2005年 | 14篇 |
2004年 | 14篇 |
2003年 | 13篇 |
2002年 | 13篇 |
2001年 | 8篇 |
2000年 | 8篇 |
1999年 | 5篇 |
1998年 | 11篇 |
1997年 | 13篇 |
1996年 | 12篇 |
1995年 | 4篇 |
1994年 | 5篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1986年 | 2篇 |
1985年 | 3篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
排序方式: 共有469条查询结果,搜索用时 468 毫秒
1.
根据生产任务选择加工设备进行制造资源重组是实现可重构制造系统的关键问题之一,由于设备的选择涉及到多种因素,既有定量指标,又有定性指标,传统的依靠人工经验的方法显得力不从心。本文首先结合实际情况,提出了一套设备选择评价体系,通过对模糊判断矩阵采用最小对数二乘法确定各评价因素的权重系数,针对定性指标和定量指标采用不同的方法确定其性能指标值,通过模糊积分对评判指标进行综合评判,最后进行了实例研究。所提出的方法有效地简化了决策过程,为可重构制造系统设备选择提供了一套行之有效的方法。 相似文献
2.
Jocelyn Sabatier Serge Poullain Patrick Latteux Jean Luc Thomas Alain Oustaloup 《Nonlinear dynamics》2004,38(1-2):383-400
Robust speed control of a low damped electromechanical system with backlash is studied, controlled load angular speed being not measured. The proposed control strategy combines a Luenberger observer (load angular speed and load torque disturbance estimations) and a robust CRONE controller. The observer provides estimation of the load angular speed and of the disturbance torque applied on the load. Through the computation of only three independent parameters (as many as a PID controller), the CRONE controller permits to ensure the robust speed control of the load in spite of plant parametric variations and speed observation errors. The proposed control strategy is applied to a four mass experimental test bench. 相似文献
3.
Juan Pablo Vielma 《Operations Research Letters》2007,35(1):29-35
Two independent proofs of the polyhedrality of the split closure of mixed integer linear program have been previously presented. Unfortunately neither of these proofs is constructive. In this paper, we present a constructive version of this proof. We also show that split cuts dominate a family of inequalities introduced by Köppe and Weismantel. 相似文献
4.
M.Z. Arslanov 《Operations Research Letters》2007,35(5):636-644
We consider the problem of guillotine cutting a rectangular sheet into two rectangular pieces without rotations. The question is whether there exists a cutting pattern with given numbers of occurrences of both rectangular pieces. A polynomial time algorithm is described to construct the convex hull of solutions to this problem. 相似文献
5.
Yaodong Cui 《Operations Research Letters》2006,34(6):630-638
This paper presents branch-and-bound algorithms that can guarantee the simplest optimal cutting patterns of equal rectangles. An existing linear algorithm determines the global upper bound exactly. The branching process ends when a branch of a lower bound equal to the global upper bound is found. 相似文献
6.
通过分析双层线性规划可行域的结构特征和全局最优解在约束域的极点上达到这一特性,对单纯形方法中进基变量的选取法则进行适当修改后,给出了一个求解双层线性规划局部最优解方法,然后引进上层目标函数对应的一种割平面约束来修正当前局部最优解,直到求得双层线性规划的全局最优解.提出的算法具有全局收敛性,并通过算例说明了算法的求解过程. 相似文献
7.
This paper proposes a two step algorithm for solving a large scale semi-definite logit model, which is appreciated as a powerful
model in failure discriminant analysis. This problem has been successfully solved by a cutting plane (outer approximation)
algorithm. However, it requires much more computation time than the corresponding linear logit model. A two step algorithm
to be proposed in this paper is intended to reduce the amount of computation time by eliminating a certain portion of the
data based on the information obtained by solving an associated linear logit model. It will be shown that this algorithm can
generate a solution with almost the same quality as the solution obtained by solving the original large scale semi-definite
model within a fraction of computation time. 相似文献
8.
In this paper we address a two-dimensional (2D) orthogonal packing problem, where a fixed set of small rectangles has to be placed on a larger stock rectangle in such a way that the amount of trim loss is minimized. The algorithm we propose hybridizes a placement procedure with a genetic algorithm based on random keys. The approach is tested on a set of instances taken from the literature and compared with other approaches. The computation results validate the quality of the solutions and the effectiveness of the proposed algorithm. 相似文献
9.
S. Küppers 《Accreditation and quality assurance》1997,2(1):30-35
Any analytical data is used to provide information about a sample. The "possible error" of the measurement can be of extreme
importance in order to have complete information. The measurement uncertainty concept is a way to achieve quantitative information
about this "possible error" using an estimation procedure. On the basis of the analytical result, the chemist makes a decision
on the next step of the development process. If the uncertainty is unknown, the information is not complete; therefore this
decision might be impossible. The major problem for the in-process control (IPC) procedure is that not only the repeatability
but also the intermediate precision (which expresses the variations within laboratories related to different days, different
analysts, different equipment, etc.) has to be good enough to make a decision. Unfortunately, the statistical information
achieved from one single analytical run only gives information about the repeatability. This paper shows that the estimation
of the measurement uncertainty for IPC is a way to solve the problem and gives the necessary information about the quality
of the procedure. An example demonstrates that an estimate of uncertainty based on the standard deviations of an analytical
method gives a value similar to one based on the standard deviations obtained from a control chart. Therefore, the estimation
is both a very useful and also a very cost-effective tool. Though measurement uncertainty cannot replace validation in general,
it is a viable alternative to validation for all methods that will never be used routinely.
Received: 24 May 1996 Accepted: 10 August 1996 相似文献
10.
《Operations Research Letters》2022,50(2):122-128
The max-cut problem is a fundamental combinatorial optimisation problem, with many applications. Poljak and Turzik found some facet-defining inequalities for the associated polytope, which we call 2-circulant inequalities. We present a more general family of facet-defining inequalities, an exact separation algorithm that runs in polynomial time, and some computational results. 相似文献