全文获取类型
收费全文 | 20895篇 |
免费 | 2327篇 |
国内免费 | 1015篇 |
专业分类
化学 | 4658篇 |
晶体学 | 77篇 |
力学 | 2382篇 |
综合类 | 493篇 |
数学 | 11834篇 |
物理学 | 4793篇 |
出版年
2024年 | 47篇 |
2023年 | 228篇 |
2022年 | 555篇 |
2021年 | 717篇 |
2020年 | 547篇 |
2019年 | 558篇 |
2018年 | 556篇 |
2017年 | 778篇 |
2016年 | 908篇 |
2015年 | 646篇 |
2014年 | 1136篇 |
2013年 | 1376篇 |
2012年 | 1262篇 |
2011年 | 1181篇 |
2010年 | 1025篇 |
2009年 | 1250篇 |
2008年 | 1265篇 |
2007年 | 1333篇 |
2006年 | 1097篇 |
2005年 | 960篇 |
2004年 | 810篇 |
2003年 | 776篇 |
2002年 | 657篇 |
2001年 | 577篇 |
2000年 | 539篇 |
1999年 | 436篇 |
1998年 | 417篇 |
1997年 | 393篇 |
1996年 | 292篇 |
1995年 | 290篇 |
1994年 | 227篇 |
1993年 | 204篇 |
1992年 | 177篇 |
1991年 | 135篇 |
1990年 | 130篇 |
1989年 | 95篇 |
1988年 | 88篇 |
1987年 | 68篇 |
1986年 | 74篇 |
1985年 | 82篇 |
1984年 | 80篇 |
1983年 | 27篇 |
1982年 | 41篇 |
1981年 | 26篇 |
1980年 | 23篇 |
1979年 | 39篇 |
1978年 | 22篇 |
1977年 | 35篇 |
1976年 | 20篇 |
1957年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 421 毫秒
71.
A new approach to the robust handling of non‐linear constraints for GAs (genetic algorithms) optimization is proposed. A specific feature of the approach consists of the change in the conventional search strategy by employing search paths which pass through both feasible and infeasible points (contrary to the traditional approach where only feasible points may be included in a path). The method (driven by full Navier–Stokes computations) was applied to the problem of multiobjective optimization of aerodynamic shapes subject to various geometrical and aerodynamic constraints. The results demonstrated that the method retains high robustness of conventional GAs while keeping CFD computational volume to an acceptable level, which allowed the algorithm to be used in a demanding engineering environment. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
72.
73.
Grigor'ev S. A. Kalinnikov A. A. Porembskii V. I. Baranov I. E. Borisova E. V. Fateev V. N. 《Russian Journal of Electrochemistry》2004,40(11):1188-1192
A two-dimensional mathematical model for the transport of reactants in a fuel cell with a solid polymer electrolyte is developed. The model is used for analyzing spatial distributions of the concentration of reactants and current density over the cell. The effect of the catalytic-layer activity, reactant speed, bipolar-plate geometry, thickness and porosity of current collector and/or gas-diffusion sublayer, and the reaction mixture composition on the fuel cell efficiency is estimated theoretically and experimentally. 相似文献
74.
We introduce extensions of the Mangasarian-Fromovitz and Abadie constraint qualifications to nonsmooth optimization problems with feasibility given by means of lower-level sets. We do not assume directional differentiability, but only upper semicontinuity of the defining functions. By deriving and reviewing primal first-order optimality conditions for nonsmooth problems, we motivate the formulations of the constraint qualifications. Then, we study their interrelation, and we show how they are related to the Slater condition for nonsmooth convex problems, to nonsmooth reverse-convex problems, to the stability of parametric feasible set mappings, and to alternative theorems for the derivation of dual first-order optimality conditions.In the literature on general semi-infinite programming problems, a number of formally different extensions of the Mangasarian-Fromovitz constraint qualification have been introduced recently under different structural assumptions. We show that all these extensions are unified by the constraint qualification presented here. 相似文献
75.
By extracting combinatorial structures in well-solved nonlinear combinatorial optimization problems, Murota (1996,1998) introduced the concepts of M-convexity and L-convexity to functions defined over the integer lattice. Recently, Murota–Shioura (2000, 2001) extended these concepts to polyhedral convex functions and quadratic functions in continuous variables. In this paper, we consider a further extension to more general convex functions defined over the real space, and provide a proof for the conjugacy relationship between general M-convex and L-convex functions.Mathematics Subject Classification (1991): 90C10, 90C25, 90C27, 90C35This work is supported by Grant-in-Aid of the Ministry of Education, Culture, Sports, Science and Technology of Japan 相似文献
76.
In this paper we focus on the problem of identifying the index sets P(x):=i|xi>0, N(x):={i|Fi(x)>0 and C(x):=i|xi=Fi(x)=0} for a solution x of the monotone nonlinear complementarity problem NCP(F). The correct identification of these sets is important from both theoretical and practical points of view. Such an identification enables us to remove complementarity conditions from the NCP and locally reduce the NCP to a system which can be dealt with more easily. We present a new technique that utilizes a sequence generated by the proximal point algorithm (PPA). Using the superlinear convergence property of PPA, we show that the proposed technique can identify the correct index sets without assuming the nondegeneracy and the local uniqueness of the solution.This work was supported in part by a Grant-in-Aid for Scientific Research from the Ministry of Education, Science, Sports and Culture of Japan.Mathematics Subject Classification (2000): 90C33, 65K10 相似文献
77.
Clemens Heuberger 《Periodica Mathematica Hungarica》2004,49(2):65-89
We study digit expansions with arbitrary integer digits in base q (q integer) and the Fibonacci base such that the sum of the absolute values of the digits is minimal. For the Fibonacci case, we describe a unique minimal expansion and give a greedy algorithm to compute it. Additionally, transducers to calculate minimal expansions from other expansions are given. For the case of even integer bases q, similar results are given which complement those given in [6]. 相似文献
78.
Periodica Mathematica Hungarica - In our paper we study the usage of partially defined Boolean functions (PDBFs) for generating cryptographically strong Boolean functions. A PDBF can be considered... 相似文献
79.
Many real problems can be modelled as robust shortest path problems on interval digraphs, where intervals represent uncertainty about real costs and a robust path is not too far from the shortest path for each possible configuration of the arc costs.A branch and bound algorithm for this problem is presented. 相似文献
80.
Robust linear optimization under general norms 总被引:1,自引:0,他引:1
We explicitly characterize the robust counterpart of a linear programming problem with uncertainty set described by an arbitrary norm. Our approach encompasses several approaches from the literature and provides guarantees for constraint violation under probabilistic models that allow arbitrary dependencies in the distribution of the uncertain coefficients. 相似文献