全文获取类型
收费全文 | 8854篇 |
免费 | 270篇 |
国内免费 | 383篇 |
专业分类
化学 | 668篇 |
晶体学 | 40篇 |
力学 | 1006篇 |
综合类 | 18篇 |
数学 | 5276篇 |
物理学 | 2499篇 |
出版年
2024年 | 9篇 |
2023年 | 159篇 |
2022年 | 89篇 |
2021年 | 86篇 |
2020年 | 160篇 |
2019年 | 166篇 |
2018年 | 156篇 |
2017年 | 183篇 |
2016年 | 181篇 |
2015年 | 202篇 |
2014年 | 494篇 |
2013年 | 765篇 |
2012年 | 417篇 |
2011年 | 638篇 |
2010年 | 549篇 |
2009年 | 631篇 |
2008年 | 662篇 |
2007年 | 691篇 |
2006年 | 423篇 |
2005年 | 294篇 |
2004年 | 297篇 |
2003年 | 250篇 |
2002年 | 214篇 |
2001年 | 179篇 |
2000年 | 199篇 |
1999年 | 178篇 |
1998年 | 152篇 |
1997年 | 144篇 |
1996年 | 123篇 |
1995年 | 122篇 |
1994年 | 92篇 |
1993年 | 65篇 |
1992年 | 56篇 |
1991年 | 30篇 |
1990年 | 38篇 |
1989年 | 27篇 |
1988年 | 18篇 |
1987年 | 25篇 |
1986年 | 30篇 |
1985年 | 42篇 |
1984年 | 35篇 |
1983年 | 31篇 |
1982年 | 34篇 |
1981年 | 29篇 |
1980年 | 41篇 |
1979年 | 36篇 |
1978年 | 24篇 |
1977年 | 24篇 |
1976年 | 8篇 |
1974年 | 3篇 |
排序方式: 共有9507条查询结果,搜索用时 78 毫秒
141.
We consider three known bounds for the quadratic assignment problem (QAP): an eigenvalue, a convex quadratic programming (CQP), and a semidefinite programming (SDP) bound. Since the last two bounds were not compared directly before, we prove that the SDP bound is stronger than the CQP bound. We then apply these to improve known bounds on a discrete energy minimization problem, reformulated as a QAP, which aims to minimize the potential energy between repulsive particles on a toric grid. Thus we are able to prove optimality for several configurations of particles and grid sizes, complementing earlier results by Bouman et al. (2013). The semidefinite programs in question are too large to solve without pre-processing, and we use a symmetry reduction method by Permenter and Parrilo (2020) to make computation of the SDP bounds possible. 相似文献
142.
In this paper we establish the existence of the minimal large positive solution for a general class of nonlinear cooperative systems including the simplest prototype of García-Melián et al. (2016). Precisely, based on the existence of a large positive supersolution, we can infer the existence of the minimal large positive solution. Moreover, we also give some sufficient easily computable conditions for the existence of a large positive supersolution. Our results generalize, very substantially, some of the findings of García-Melián et al. (2016) adopting a rather novel methodology. 相似文献
143.
Formal methods are becoming favorable for control and verification of safety-critical systems because of the rigorous model-based computation. Relying on an over-approximated model of the original system behaviors, formal control synthesis algorithms are not often complete, which means that a controller cannot necessarily be synthesized even if there exists one. The main result of this paper shows that, for continuous-time nonlinear systems, a sample-and-hold control strategy for a reach-and-stay specification can be synthesized whenever such a strategy exists for the same system with its dynamics perturbed by small disturbances. Control synthesis is carried out by a fixed-point algorithm that adaptively partitions the system state space into a finite number of cells. In each iteration, the reachable set from each cell after one sampling time is over-approximated within a precision determined by the bound of the disturbances. To meet such a requirement, we integrate validated high-order Taylor expansion of the system solution over one sampling period into every fixed-point iteration and provide a criterion for choosing the Taylor order and the partition precision. Two nonlinear system examples are given to illustrate the effectiveness of the proposed method. 相似文献
144.
Kojima's strong stability of stationary solutions can be characterized by means of first and second order terms. We treat the problem whether there is a characterization of the stability concept allowing perturbations of the objective function only, keeping the feasible set unchanged. If the feasible set is a convex polyhedron, then there exists a characterization which is in fact weaker than that one of strong stability. However, in general it appears that data of first and second order do not characterize that kind of stability. As an interpretation we have that the strong stability is the only concept of stability which both admits a characterization and works for large problem classes.Supported by the Deutsche Forschungsgemeinschaft, Graduiertenkolleg Analyse und Konstruktion in der Mathematik.Partial support under Support Center for Advanced Telecommunications Technology Research. 相似文献
145.
We are concerned with defining new globalization criteria for solution methods of nonlinear equations. The current criteria used in these methods require a sufficient decrease of a particular merit function at each iteration of the algorithm. As was observed in the field of smooth unconstrained optimization, this descent requirement can considerably slow the rate of convergence of the sequence of points produced and, in some cases, can heavily deteriorate the performance of algorithms. The aim of this paper is to show that the global convergence of most methods proposed in the literature for solving systems of nonlinear equations can be obtained using less restrictive criteria that do not enforce a monotonic decrease of the chosen merit function. In particular, we show that a general stabilization scheme, recently proposed for the unconstrained minimization of continuously differentiable functions, can be extended to methods for the solution of nonlinear (nonsmooth) equations. This scheme includes different kinds of relaxation of the descent requirement and opens up the possibility of describing new classes of algorithms where the old monotone linesearch techniques are replace with more flexible nonmonotone stabilization procedures. As in the case of smooth unconstrained optimization, this should be the basis for defining more efficient algorithms with very good practical rates of convergence.This material is partially based on research supported by the Air Force Office of Scientific Research Grant AFOSR-89-0410, National Science Foundation Grant CCR-91-57632, and Istituto di Analisi dei Sistemi ed Informatica del CNR. 相似文献
146.
P. N. Müller K. -D. Reinsch R. Bulirsch 《Journal of Optimization Theory and Applications》1994,80(2):367-372
In Ref. 1, the author claimed that the problem y=y
3 is soluble only for a certain range of the parameter . An analytic approach, as adopted in the following contribution, reveals that a unique solution exists for any positive value of . The solution is given in closed form by means of Jacobian elliptic functions, which can be numerically computed very efficiently. In the limit 0+, the solutions exhibit boundary-layer behavior at both endpoints. An easily interpretable approximate solution for small is obtained using a three-variable approach. 相似文献
147.
On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds 总被引:11,自引:0,他引:11
We consider a new algorithm, an interior-reflective Newton approach, for the problem of minimizing a smooth nonlinear function of many variables, subject to upper and/or lower bounds on some of the variables. This approach generatesstrictly feasible iterates by using a new affine scaling transformation and following piecewise linear paths (reflection paths). The interior-reflective approach does not require identification of an activity set. In this paper we establish that the interior-reflective Newton approach is globally and quadratically convergent. Moreover, we develop a specific example of interior-reflective Newton methods which can be used for large-scale and sparse problems.Research partially supported by the Applied Mathematical Sciences Research Program (KC-04-02) of the Office of Energy Research of the U.S. Department of Energy under grant DE-FG02-86ER25013.A000, and in part by NSF, AFOSR, and ONR through grant DMS-8920550, and by the Advanced Computing Research Institute, a unit of the Cornell Theory Center which receives major funding from the National Science Foundation and IBM Corporation, with additional support from New York State and members of its Corporate Research Institute.Corresponding author. 相似文献
148.
A time-parallel simulation obtains parallelism by partitioning the time domain of the simulation. An approximate time-parallel simulation algorithm named GG1K is developed for acyclic networks of loss FCFSG/G/1/K queues. The GG1K algorithm requires two phases. In the first phase, a similar system (i.e. aG/G/1/ queue) is simulated using the GLM algorithm. Then the resultant trajectory is transformed into an approximateG/G/1/K trajectory in the second phase. The closeness of the approximation is investigated theoretically and experimentally. Our results show that the approximation is highly accurate except whenK is very small (e.g. 5) in certain models. The algorithm exploits unbounded parallelism and can achieve near-linear speedup when the number of arrivals simulated is sufficiently large. 相似文献
149.
Sharon E. Navard John W. Seaman Jr. Dean M. Young 《Annals of the Institute of Statistical Mathematics》1993,45(4):603-614
Bertin and Theodorescu (1984,Statist. Probab. Lett.,2, 23–30) developed a characterization of discrete unimodality based on convexity properties of a discretization of distribution functions. We offer a new characterization of discrete unimodality based on convexity properties of a piecewise linear extension of distribution functions. This reliance on functional convexity, as in Khintchine's classic definition, leads to variance dilations and upper bounds on variance for a large class of discrete unimodal distributions. These bounds are compared to existing inequalities due to Muilwijk (1966,Sankhy, Ser. B,28, p. 183), Moors and Muilwijk (1971,Sankhy, Ser. B,33, 385–388), and Rayner (1975,Sankhy, Ser. B,37, 135–138), and are found to be generally tighter, thus illustrating the power of unimodality assumptions. 相似文献
150.
A smooth method for the finite minimax problem 总被引:2,自引:0,他引:2
We consider unconstrained minimax problems where the objective function is the maximum of a finite number of smooth functions. We prove that, under usual assumptions, it is possible to construct a continuously differentiable function, whose minimizers yield the minimizers of the max function and the corresponding minimum values. On this basis, we can define implementable algorithms for the solution of the minimax problem, which are globally convergent at a superlinear convergence rate. Preliminary numerical results are reported.This research was partially supported by the National Research Program on Metodi di ottimizzazione per le decisioni, Ministero dell'Università e della Ricerca Scientifica e Tecnologica, Italy. 相似文献