全文获取类型
收费全文 | 1774篇 |
免费 | 117篇 |
国内免费 | 64篇 |
专业分类
化学 | 281篇 |
力学 | 70篇 |
综合类 | 26篇 |
数学 | 394篇 |
物理学 | 303篇 |
无线电 | 881篇 |
出版年
2024年 | 3篇 |
2023年 | 9篇 |
2022年 | 20篇 |
2021年 | 31篇 |
2020年 | 41篇 |
2019年 | 22篇 |
2018年 | 26篇 |
2017年 | 52篇 |
2016年 | 44篇 |
2015年 | 48篇 |
2014年 | 92篇 |
2013年 | 94篇 |
2012年 | 108篇 |
2011年 | 111篇 |
2010年 | 75篇 |
2009年 | 95篇 |
2008年 | 120篇 |
2007年 | 104篇 |
2006年 | 117篇 |
2005年 | 108篇 |
2004年 | 69篇 |
2003年 | 77篇 |
2002年 | 59篇 |
2001年 | 42篇 |
2000年 | 37篇 |
1999年 | 31篇 |
1998年 | 37篇 |
1997年 | 27篇 |
1996年 | 26篇 |
1995年 | 33篇 |
1994年 | 22篇 |
1993年 | 36篇 |
1992年 | 33篇 |
1991年 | 16篇 |
1990年 | 17篇 |
1989年 | 11篇 |
1988年 | 7篇 |
1987年 | 4篇 |
1986年 | 8篇 |
1985年 | 8篇 |
1984年 | 7篇 |
1983年 | 2篇 |
1982年 | 7篇 |
1981年 | 6篇 |
1979年 | 5篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1972年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有1955条查询结果,搜索用时 0 毫秒
111.
L. T. Ashchepkov 《Computational Mathematics and Mathematical Physics》2008,48(4):531-538
Criteria for symmetry and boundedness are found for the combined solution set of a system of linear algebraic equations with interval coefficients. It is shown that the problem of the best inner interval estimation of a symmetric solution set can be exactly solved by linear programming methods. 相似文献
112.
爱因斯坦坚持场纲领的原因 总被引:5,自引:0,他引:5
探讨了爱因斯坦坚持场纲领的物理学认识基础和思想发展过程,分析了其坚持场纲领的目的及未获成功的原因。 相似文献
113.
In this paper, a unified algorithm is proposed for solving a class of convex separable nonlinear knapsack problems, which are characterized by positive marginal cost (PMC) and increasing marginal loss–cost ratio (IMLCR). By taking advantage of these two characteristics, the proposed algorithm is applicable to the problem with equality or inequality constraints. In contrast to the methods based on Karush–Kuhn–Tucker (KKT) conditions, our approach has linear computation complexity. Numerical results are reported to demonstrate the efficacy of the proposed algorithm for different problems. 相似文献
114.
M. Fampa L. A. Barroso D. Candal L. Simonetti 《Computational Optimization and Applications》2008,39(2):121-142
In this paper, we present a bilevel programming formulation for the problem of strategic bidding under uncertainty in a wholesale
energy market (WEM), where the economic remuneration of each generator depends on the ability of its own management to submit
price and quantity bids. The leader of the bilevel problem consists of one among a group of competing generators and the follower
is the electric system operator. The capability of the agent represented by the leader to affect the market price is considered
by the model. We propose two solution approaches for this non-convex problem. The first one is a heuristic procedure whose
efficiency is confirmed through comparisons with the optimal solutions for some instances of the problem. These optimal solutions
are obtained by the second approach proposed, which consists of a mixed integer reformulation of the bilevel model. The heuristic
proposed is also compared to standard solvers for nonlinearly constrained optimization problems. The application of the procedures
is illustrated in case studies with configurations derived from the Brazilian power system. 相似文献
115.
A. G. Chentsov 《Russian Mathematics (Iz VUZ)》2008,52(10):46-59
We consider an abstract guidance control problem with elements of uncertainty, where the control procedures are identified with set-valued quasistrategies. The goal of the control consists in the guidance to the objective set under phase constraints.We construct the solvability set by the method of program iterations which is well known in the theory of differential games. We prove that the limit of the iterative procedure has the sense of the set of positional absorption (the stable bridge) introduced by N. N. Krasovskii. This limit coincides with the solvability set in the class of quasistrategies. 相似文献
116.
In this paper, we propose an approximate optimization model for the robust second-order-cone programming problem with a single-ellipsoid uncertainty set for which the computational complexity is not known yet. We prove that this approximate robust model can be equivalently reformulated as a finite convex optimization problem. 相似文献
117.
结合吴江数字电视建设,介绍了业务信息表中插入自定义私有描述符,实现数字电视节目相关控制的可行性解决方案。 相似文献
118.
Kazuhiro Kobayashi Sunyoung Kim Masakazu Kojima 《Applied Mathematics and Optimization》2008,58(1):69-88
Exploiting sparsity has been a key issue in solving large-scale optimization problems. The most time-consuming part of primal-dual
interior-point methods for linear programs, second-order cone programs, and semidefinite programs is solving the Schur complement
equation at each iteration, usually by the Cholesky factorization. The computational efficiency is greatly affected by the
sparsity of the coefficient matrix of the equation which is determined by the sparsity of an optimization problem (linear
program, semidefinite program or second-order cone program). We show if an optimization problem is correlatively sparse, then the coefficient matrix of the Schur complement equation inherits the sparsity, and a sparse Cholesky factorization
applied to the matrix results in no fill-in.
S. Kim’s research was supported by Kosef R01-2005-000-10271-0 and KRF-2006-312-C00062. 相似文献
119.
A general framework for modeling and solving cyclic scheduling problems is presented. The objective is to minimize the cycle time. The model covers different cyclic versions of the job-shop problem found in the literature, robotic cell problems, the single hoist scheduling problem and tool transportation between the machines.It is shown that all these problems can be formulated as mixed integer linear programs which have a common structure. Small instances are solved with CPLEX. For larger instances tabu search procedures have been developed. The main ideas of these methods are indicated. 相似文献
120.
There are infinitely many ways of representing a d.c. function as a difference of convex functions. In this paper we analyze
how the computational efficiency of a d.c.optimization algorithm depends on the representation we choose for the objective
function, and we address the problem of characterizing and obtaining a computationally optimal representation. We introduce
some theoretical concepts which are necessary for this analysis and report some numerical experiments.
相似文献