全文获取类型
收费全文 | 1469篇 |
免费 | 170篇 |
国内免费 | 103篇 |
专业分类
化学 | 252篇 |
晶体学 | 15篇 |
力学 | 193篇 |
综合类 | 52篇 |
数学 | 681篇 |
物理学 | 549篇 |
出版年
2024年 | 5篇 |
2023年 | 12篇 |
2022年 | 35篇 |
2021年 | 37篇 |
2020年 | 16篇 |
2019年 | 32篇 |
2018年 | 16篇 |
2017年 | 42篇 |
2016年 | 45篇 |
2015年 | 31篇 |
2014年 | 65篇 |
2013年 | 97篇 |
2012年 | 69篇 |
2011年 | 93篇 |
2010年 | 90篇 |
2009年 | 90篇 |
2008年 | 114篇 |
2007年 | 86篇 |
2006年 | 83篇 |
2005年 | 79篇 |
2004年 | 45篇 |
2003年 | 66篇 |
2002年 | 50篇 |
2001年 | 44篇 |
2000年 | 55篇 |
1999年 | 50篇 |
1998年 | 38篇 |
1997年 | 26篇 |
1996年 | 29篇 |
1995年 | 32篇 |
1994年 | 28篇 |
1993年 | 22篇 |
1992年 | 20篇 |
1991年 | 17篇 |
1990年 | 14篇 |
1989年 | 15篇 |
1988年 | 17篇 |
1987年 | 8篇 |
1986年 | 4篇 |
1985年 | 3篇 |
1984年 | 4篇 |
1983年 | 3篇 |
1981年 | 2篇 |
1980年 | 3篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1977年 | 3篇 |
1976年 | 2篇 |
1974年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有1742条查询结果,搜索用时 15 毫秒
1.
An Improved Gradient Projection-based Decomposition Technique for Support Vector Machines 总被引:2,自引:0,他引:2
Luca Zanni 《Computational Management Science》2006,3(2):131-145
In this paper we propose some improvements to a recent decomposition technique for the large quadratic program arising in
training support vector machines. As standard decomposition approaches, the technique we consider is based on the idea to
optimize, at each iteration, a subset of the variables through the solution of a quadratic programming subproblem. The innovative
features of this approach consist in using a very effective gradient projection method for the inner subproblems and a special
rule for selecting the variables to be optimized at each step. These features allow to obtain promising performance by decomposing
the problem into few large subproblems instead of many small subproblems as usually done by other decomposition schemes. We
improve this technique by introducing a new inner solver and a simple strategy for reducing the computational cost of each
iteration. We evaluate the effectiveness of these improvements by solving large-scale benchmark problems and by comparison
with a widely used decomposition package. 相似文献
2.
Eva Lesanska 《Applications of Mathematics》2002,47(5):411-426
The problem is to determine nonsensitiveness regions for threshold ellipsoids within a regular mixed linear model. 相似文献
3.
GLOBAL ATTRACTOR OF A SPATIALLY DISCRETIZED REACTION-DIFFUSION SYSTEM WITH HAMILTONIAN STRUCTURE 总被引:1,自引:0,他引:1
1HamiltonianStructureinReaction-DifusionsystemConsiderasystemofreaction-difusionequationsut=uxx+f(u,v)vt=vxx+g(u,v){(1.1)wher... 相似文献
4.
This paper considers a problem of nonlinear programming in which the objective function is the ratio of two linear functions and the constraints define a bounded and connected feasible region. Using a coordinate transformation, this problem is transformed into a simpler one, whose geometric interpretation is of particular significance. The transformation leads to a characterization of some special vertices of the feasible region from both the theoretical and operational points of view. 相似文献
5.
This paper describes a method and the corresponding algorithms for simplification of large-scale linear programming models. It consists of the elimination of the balance constraints (i.e. constraints with zero RHS term). The idea is to apply some linear transformations to the original problem in order to nullify the balance constraints. These transformations are able to simultaneously eliminate more balance rows. The core of this contribution is the introduction of the reduction matrix and the associated theorems on the equivalent linear programs (original and reduced). The numerical experiments with this method of simplification proved this approach to be beneficial for a large class of LP problems.This research work was done while the first author was at Duisburg University, Mess-, Steuer und Regelungstechnik, Germany, under the greatly appreciated financial assistance given by the Alexander-von-Humboldt Foundation. 相似文献
6.
7.
Lubomír Kubáček 《Mathematica Slovaca》2007,57(6):571-588
The multivariate model, where not only parameters of the mean value of the observation matrix, but also some other parameters
occur in constraints, is considered in the paper. Some basic inference is presented under the condition that the covariance
matrix is either unknown, or partially unknown, or known.
Supported by the grant of the Council of Czech Republic MSM 6 198 959 214. 相似文献
8.
Adam B. Levy 《Mathematical Programming》2007,110(3):615-639
Numerical methods for solving constrained optimization problems need to incorporate the constraints in a manner that satisfies
essentially competing interests; the incorporation needs to be simple enough that the solution method is tractable, yet complex
enough to ensure the validity of the ultimate solution. We introduce a framework for constraint incorporation that identifies
a minimal acceptable level of complexity and defines two basic types of constraint incorporation which (with combinations)
cover nearly all popular numerical methods for constrained optimization, including trust region methods, penalty methods,
barrier methods, penalty-multiplier methods, and sequential quadratic programming methods. The broad application of our framework
relies on addition and chain rules for constraint incorporation which we develop here. 相似文献
9.
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. 相似文献
10.
对于具有周期单元的分层介质材料高反射区的波长范围,提供一种简明的估计分析方法.基于Floquet定理,分析了有限周期单元分层介质的光子带隙特性,给出分层介质的高反射区波长范围.讨论了分层介质高反射区和周期单元禁带之间的关系.计算表明,高反射区和周期单元禁带的中心波长彼此一致.并且,随着分层介质周期单元数的增多,高反射区的深度和带宽就越接近于周期单元禁带的深度和宽度.最后,讨论周期分层介质的光子带隙特性与入射角及其与极化的变化关系.
关键词:
分层介质
带隙特性
周期单元
高反射区 相似文献