全文获取类型
收费全文 | 9188篇 |
免费 | 318篇 |
国内免费 | 279篇 |
专业分类
化学 | 678篇 |
晶体学 | 5篇 |
力学 | 296篇 |
综合类 | 82篇 |
数学 | 8329篇 |
物理学 | 395篇 |
出版年
2023年 | 47篇 |
2022年 | 74篇 |
2021年 | 104篇 |
2020年 | 103篇 |
2019年 | 133篇 |
2018年 | 128篇 |
2017年 | 158篇 |
2016年 | 165篇 |
2015年 | 132篇 |
2014年 | 363篇 |
2013年 | 510篇 |
2012年 | 485篇 |
2011年 | 385篇 |
2010年 | 373篇 |
2009年 | 556篇 |
2008年 | 557篇 |
2007年 | 631篇 |
2006年 | 429篇 |
2005年 | 411篇 |
2004年 | 341篇 |
2003年 | 302篇 |
2002年 | 333篇 |
2001年 | 240篇 |
2000年 | 274篇 |
1999年 | 234篇 |
1998年 | 209篇 |
1997年 | 182篇 |
1996年 | 204篇 |
1995年 | 188篇 |
1994年 | 144篇 |
1993年 | 143篇 |
1992年 | 138篇 |
1991年 | 127篇 |
1990年 | 106篇 |
1989年 | 77篇 |
1988年 | 90篇 |
1987年 | 61篇 |
1986年 | 86篇 |
1985年 | 114篇 |
1984年 | 82篇 |
1983年 | 26篇 |
1982年 | 52篇 |
1981年 | 46篇 |
1980年 | 36篇 |
1979年 | 31篇 |
1978年 | 52篇 |
1977年 | 51篇 |
1976年 | 27篇 |
1975年 | 12篇 |
1974年 | 12篇 |
排序方式: 共有9785条查询结果,搜索用时 31 毫秒
111.
J. Kogan 《Journal of Optimization Theory and Applications》1989,63(2):225-260
In this paper, we study intersections of extremals in a linear-quadratic Bolza problem of optimal control. The structure of the inter-sections is described. We show that this structure implies the semipositive definiteness of the quadratic cost functional. In addition, we derive necessary and sufficient conditions for the existence of minimizers. 相似文献
112.
In this paper we characterize the local maxima of a continuous global optimization formulation for finding the independence
number of a graph. Classical Karush-Kuhn-Tucker conditions and simple combinatorial arguments are found sufficient to deduce
several interesting properties of the local and global maxima. These properties can be utilized in developing new approaches
to the maximum independent set problem. 相似文献
113.
对于线性型多目标半定规划问题,引进加权中心路径的概念,并利用单目标半定规划的中心路径法,提出了求解多目标半定规划问题的加权中心路径法,先得型对一个叔向量的有效解,然后在此基础上,提出了通过一次迭代得到对应一定范围内其他任意权向量的有效解的一步修正方法. 相似文献
114.
The feature selection consists of obtaining a subset of these features to optimally realize the task without the irrelevant
ones. Since it can provide faster and cost-effective learning machines and also improve the prediction performance of the
predictors, it is a crucial step in machine learning. The feature selection methods using support machines have obtained satisfactory
results, but the noises and outliers often reduce the performance. In this paper, we propose a feature selection approach
using fuzzy support vector machines and compare it with the previous work, the results of experiments on the UCI data sets
show that feature selection using fuzzy SVM obtains better results than using SVM. 相似文献
115.
Parking Capacity and Pricing in Park'n Ride Trips: A Continuous Equilibrium Network Design Problem 总被引:2,自引:0,他引:2
In this paper we consider the problem of designing parking facilities for park'n ride trips. We present a new continuous equilibrium network design problem to decide the capacity and fare of these parking lots at a tactical level. We assume that the parking facilities have already been located and other topological decisions have already been taken.The modeling approach proposed is mathematical programming with equilibrium constraints. In the outer optimization problem, a central Authority evaluates the performance of the transport network for each network design decision. In the inner problem a multimodal traffic assignment with combined modes, formulated as a variational inequality problem, generates the share demand for modes of transportation, and for parking facilities as a function of the design variables of the parking lots. The objective is to make optimal parking investment and pricing decisions in order to minimize the total travel cost in a subnetwork of the multimodal transportation system.We present a new development in model formulation based on the use of generalized parking link cost as a design variable.The bilevel model is solved by a simulated annealing algorithm applied to the continuous and non-negative design decision variables. Numerical tests are reported in order to illustrate the use of the model, and the ability of the approach to solve applications of moderate size. 相似文献
116.
Pure adaptive search constructs a sequence of points uniformly distributed within a corresponding sequence of nested regions of the feasible space. At any stage, the next point in the sequence is chosen uniformly distributed over the region of feasible space containing all points that are equal or superior in value to the previous points in the sequence. We show that for convex programs the number of iterations required to achieve a given accuracy of solution increases at most linearly in the dimension of the problem. This compares to exponential growth in iterations required for pure random search. 相似文献
117.
??We study the linear quadratic optimal stochastic control problem which is jointly driven by Brownian motion and L\'{e}vy processes. We prove that the new affine stochastic differential adjoint equation exists an inverse process by applying the profound section theorem. Applying for the Bellman's principle of quasilinearization and a monotone iterative convergence method, we prove the existence and uniqueness of the solution of the backward Riccati differential equation. Finally, we prove that the optimal feedback control exists, and the value function is composed of the initial value of the solution of the related backward Riccati differential equation and the related adjoint equation. 相似文献
118.
E. Alper Yildirim Xiaofei Fan-Orzechowski 《Computational Optimization and Applications》2006,33(2-3):229-247
We study the maximum stable set problem. For a given graph, we establish several transformations among feasible solutions
of different formulations of Lovász's theta function. We propose reductions from feasible solutions corresponding to a graph
to those corresponding to its induced subgraphs. We develop an efficient, polynomial-time algorithm to extract a maximum stable
set in a perfect graph using the theta function. Our algorithm iteratively transforms an approximate solution of the semidefinite
formulation of the theta function into an approximate solution of another formulation, which is then used to identify a vertex
that belongs to a maximum stable set. The subgraph induced by that vertex and its neighbors is removed and the same procedure
is repeated on successively smaller graphs. We establish that solving the theta problem up to an adaptively chosen, fairly
rough accuracy suffices in order for the algorithm to work properly. Furthermore, our algorithm successfully employs a warm-start
strategy to recompute the theta function on smaller subgraphs. Computational results demonstrate that our algorithm can efficiently
extract maximum stable sets in comparable time it takes to solve the theta problem on the original graph to optimality.
This work was supported in part by NSF through CAREER Grant DMI-0237415. Part of this work was performed while the first author
was at the Department of Applied Mathematics and Statisticsat Stony Brook University, Stony Brook, NY, USA. 相似文献
119.
C. R. Bector S. Chandra M. K. Bector 《Journal of Optimization Theory and Applications》1989,60(2):243-260
Using a parametric approach, duality is presented for a minimax fractional programming problem that involves several ratios in the objective function.The first author is thankful to Natural Science and Engineering Research Council of Canada for financial support through Grant A-5319, and the authors are thankful to the anonymous referees for useful suggestions. 相似文献
120.
In this paper, a locally computed suboptimal control strategy for a class of interconnected systems is introduced. First, optimal statefeedback control equations are derived for a finite-horizon quadratic cost. Then, the control for each subsystem is separated into two portions. The first portion stabilizes the isolated subsystem, and the second portion corresponds to the interactions. To achieve a locally calculable control, an approximation to the optimal control equations is introduced, and two iterative suboptimal control algorithms are developed. In the first algorithm, the initial conditions of subsystems are assumed to be known; in the second algorithm, this information is replaced by statistical distributions. The orders of errors in the iterations of the algorithm and in the suboptimality are given in terms of interconnections. An example with comparisons is also included to show the performance of the approach. 相似文献