全文获取类型
收费全文 | 1571篇 |
免费 | 100篇 |
国内免费 | 47篇 |
专业分类
化学 | 85篇 |
晶体学 | 1篇 |
力学 | 221篇 |
综合类 | 11篇 |
数学 | 1139篇 |
物理学 | 261篇 |
出版年
2023年 | 17篇 |
2022年 | 21篇 |
2021年 | 29篇 |
2020年 | 27篇 |
2019年 | 28篇 |
2018年 | 18篇 |
2017年 | 34篇 |
2016年 | 33篇 |
2015年 | 44篇 |
2014年 | 75篇 |
2013年 | 107篇 |
2012年 | 81篇 |
2011年 | 65篇 |
2010年 | 52篇 |
2009年 | 80篇 |
2008年 | 83篇 |
2007年 | 98篇 |
2006年 | 94篇 |
2005年 | 64篇 |
2004年 | 62篇 |
2003年 | 49篇 |
2002年 | 56篇 |
2001年 | 48篇 |
2000年 | 32篇 |
1999年 | 48篇 |
1998年 | 42篇 |
1997年 | 38篇 |
1996年 | 28篇 |
1995年 | 28篇 |
1994年 | 28篇 |
1993年 | 19篇 |
1992年 | 17篇 |
1991年 | 15篇 |
1990年 | 15篇 |
1989年 | 16篇 |
1988年 | 10篇 |
1987年 | 9篇 |
1986年 | 19篇 |
1985年 | 18篇 |
1984年 | 5篇 |
1983年 | 2篇 |
1982年 | 9篇 |
1981年 | 5篇 |
1980年 | 11篇 |
1979年 | 11篇 |
1978年 | 10篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1974年 | 5篇 |
1971年 | 1篇 |
排序方式: 共有1718条查询结果,搜索用时 15 毫秒
1.
Mikhail Andramonov 《Journal of Global Optimization》2002,24(2):115-132
We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency. 相似文献
2.
3.
Annegret K. Wagler 《4OR: A Quarterly Journal of Operations Research》2005,3(4):329-336
Shepherd95 proved that the stable set polytopes of near-bipartite graphs are given by constraints associated with the complete
join of antiwebs only. For antiwebs, the facet set reduces to rank constraints associated with single antiwebs by Wagler2004.
We extend this result to a larger graph class, the complements of fuzzy circular interval graphs, recently introduced in ChudnovskySeymour2004.
Received: November 2004 / Revised version: June 2005 相似文献
4.
Y. Yavin 《Journal of Optimization Theory and Applications》1993,78(1):77-91
Stochastic optimal control techniques are applied to compare the performance of identical medium-range air-to-air missiles which have different thrust-mass profiles. The measure of the performance is the probability of reaching a lock-on-point with a favorable range of guidance and flight parameters, during a fixed time interval [0,t
f
], given that, during the flight, the trajectories of the missile are subjected to a variety of constraints including dynamic pressure constraints. 相似文献
5.
We present a new generic problem solving approach for over-constrained problems based on Max-SAT. We first define a Boolean
clausal form formalism, called soft CNF formulas, that deals with blocks of clauses instead of individual clauses, and that allows one to declare each block either as hard (i.e., must be satisfied by any solution) or soft (i.e., can be violated by some solution). We then present two Max-SAT solvers that find a truth assignment that satisfies
all the hard blocks of clauses and the maximum number of soft blocks of clauses. Our solvers are branch and bound algorithms
equipped with original lazy data structures, powerful inference techniques, good quality lower bounds, and original variable
selection heuristics. Finally, we report an experimental investigation on a representative sample of instances (random 2-SAT,
Max-CSP, graph coloring, pigeon hole and quasigroup completion) which provides experimental evidence that our approach is
very competitive compared with the state-of-the-art approaches developed in the CSP and SAT communities.
Research partially supported by projects TIN2004-07933-C03-03 and TIC2003-00950 funded by the Ministerio de Educación y Ciencia. The second author is supported by a grant Ramón y Cajal. 相似文献
6.
Whilst the space volume of muffler in noise control system is often constrained for maintenance in practical engineering work, the maximization on muffler’s performance becomes important and essential. In this paper, a novel approach genetic algorithms (GAs) based on the principles of natural biological evolution will be used to tackle this optimization of muffler design [M. Mitchell, An Introduction to Genetic Algorithms, The MIT Press, Cambridge, MA, 1996]. Here, the shape optimization of multi-segments muffler coupled with the GA searching technique is presented. The techniques of binary genetic algorithms (BGA) together with the commercial MATLAB package [G. Lindfield, J. Penny, Numerical Method Using Matlab, second ed., Prentice Hall, Englewood Cliffs, NJ, 2000] are applied in GA searching. In addition, a numerical case of pure tone elimination with 2-5 segments on muffler is introduced and fully discussed. To achieve the best optimization in GA, several GA parameters are on trial in various values. Results show that the GA operators, including crossover mutation and elitism, are essential in accuracy. Consequently, results verify that the optimal sound transmission loss at the designed frequency of 500 Hz is exactly maximized. The GA optimization on multi-segments muffler proposed in this study surely provides a quick and correct approach. 相似文献
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.
9.
Meghan Griffith 《Acta Analytica》2007,22(1):16-28
In this paper, I argue that trying is the locus of freedom and moral responsibility. Thus, any plausible view of free and
responsible action must accommodate and account for free tryings. I then consider a version of agent causation whereby the
agent directly causes her tryings. On this view, the agent is afforded direct control over her efforts and there is no need
to posit—as other agent-causal theorists do—an uncaused event. I discuss the potential advantages of this sort of view, and
its challenges. 相似文献
10.
Ronald H. Nickel Igor Mikolic-Torreira Jon W. Tolle 《Computational Optimization and Applications》2006,35(1):109-126
Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked
on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready
to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the
cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the
Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements
of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear
and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization
viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions
are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives
are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult
to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation
and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this
problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed
version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern
search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned
as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous
computers in an office environment, thus, drastically reducing the time required to find the solution. 相似文献