全文获取类型
收费全文 | 10192篇 |
免费 | 739篇 |
国内免费 | 294篇 |
专业分类
化学 | 1330篇 |
晶体学 | 28篇 |
力学 | 1087篇 |
综合类 | 146篇 |
数学 | 7153篇 |
物理学 | 1481篇 |
出版年
2024年 | 18篇 |
2023年 | 103篇 |
2022年 | 332篇 |
2021年 | 335篇 |
2020年 | 202篇 |
2019年 | 224篇 |
2018年 | 244篇 |
2017年 | 326篇 |
2016年 | 306篇 |
2015年 | 232篇 |
2014年 | 471篇 |
2013年 | 596篇 |
2012年 | 630篇 |
2011年 | 514篇 |
2010年 | 475篇 |
2009年 | 584篇 |
2008年 | 581篇 |
2007年 | 629篇 |
2006年 | 509篇 |
2005年 | 435篇 |
2004年 | 347篇 |
2003年 | 322篇 |
2002年 | 296篇 |
2001年 | 281篇 |
2000年 | 275篇 |
1999年 | 206篇 |
1998年 | 218篇 |
1997年 | 203篇 |
1996年 | 147篇 |
1995年 | 164篇 |
1994年 | 144篇 |
1993年 | 114篇 |
1992年 | 108篇 |
1991年 | 90篇 |
1990年 | 76篇 |
1989年 | 61篇 |
1988年 | 48篇 |
1987年 | 40篇 |
1986年 | 40篇 |
1985年 | 54篇 |
1984年 | 51篇 |
1983年 | 14篇 |
1982年 | 22篇 |
1981年 | 21篇 |
1980年 | 18篇 |
1979年 | 32篇 |
1978年 | 20篇 |
1977年 | 29篇 |
1976年 | 18篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
《Annales de l'Institut Henri Poincaré (C) Analyse Non Linéaire》2021,38(5):1337-1371
In this paper we consider minimizers of the functional where is a bounded open set and where are the first k eigenvalues on Ω of an operator in divergence form with Dirichlet boundary condition and with Hölder continuous coefficients. We prove that the optimal sets have finite perimeter and that their free boundary is composed of a regular part, which is locally the graph of a -regular function, and a singular part, which is empty if , discrete if and of Hausdorff dimension at most if , for some . 相似文献
2.
Sze-Jack Tan Chee-Keong Lee Chee-Yuen Gan Olusegun Abayomi Olalere 《Molecules (Basel, Switzerland)》2021,26(7)
In this study, the combination of parameters required for optimal extraction of anti-oxidative components from the Chinese lotus (CLR) and Malaysian lotus (MLR) roots were carefully investigated. Box–Behnken design was employed to optimize the pH (X1: 2–3), extraction time (X2: 0.5–1.5 h) and solvent-to-sample ratio (X3: 20–40 mL/g) to obtain a high flavonoid yield with high % DPPHsc free radical scavenging and Ferric-reducing power assay (FRAP). The analysis of variance clearly showed the significant contribution of quadratic model for all responses. The optimal conditions for both Chinese lotus (CLR) and Malaysian lotus (MLR) roots were obtained as: CLR: X1 = 2.5; X2 = 0.5 h; X3 = 40 mL/g; MLR: X1 = 2.4; X2 = 0.5 h; X3 = 40 mL/g. These optimum conditions gave (a) Total flavonoid content (TFC) of 0.599 mg PCE/g sample and 0.549 mg PCE/g sample, respectively; (b) % DPPHsc of 48.36% and 29.11%, respectively; (c) FRAP value of 2.07 mM FeSO4 and 1.89 mM FeSO4, respectively. A close agreement between predicted and experimental values was found. The result obtained succinctly revealed that the Chinese lotus exhibited higher antioxidant and total flavonoid content when compared with the Malaysia lotus root at optimum extraction condition. 相似文献
3.
4.
Simulating numerically the sound radiation of a rolling tire requires the solution of a very large and sparse gyroscopic eigenvalue problem. Taking advantage of the automated multi-level substructuring (AMLS) method it can be projected to a much smaller gyroscopic problem, the solution of which however is still quite costly since the eigenmodes are non-real and complex arithmetic is necessary. This paper discusses the application of AMLS to huge gyroscopic problems and the numerical solution of the AMLS reduction. A numerical example demonstrates the efficiency of AMLS. 相似文献
5.
Ji-Ming Peng 《Mathematical Programming》1997,78(3):347-355
In this paper we propose a class of merit functions for variational inequality problems (VI). Through these merit functions,
the variational inequality problem is cast as unconstrained minimization problem. We estimate the growth rate of these merit
functions and give conditions under which the stationary points of these functions are the solutions of VI.
This work was supported by the state key project “Scientific and Engineering Computing”. 相似文献
6.
Jinchao Xu 《应用数学学报(英文版)》2002,18(2):185-200
Abstract Some new local and parallel finite element algorithms are proposed and analyzed in this paper foreigenvalue problems.With these algorithms, the solution of an eigenvalue problem on a fine grid is reduced tothe solution of an eigenvalue problem on a relatively coarse grid together with solutions of some linear algebraicsystems on fine grid by using some local and parallel procedure.A theoretical tool for analyzing these algorithmsis some local error estimate that is also obtained in this paper for finite element approximations of eigenvectorson general shape-regular grids. 相似文献
7.
8.
Well-Posedness by Perturbations of Variational Problems 总被引:3,自引:0,他引:3
Lemaire B. Ould Ahmed Salem C. Revalski J. P. 《Journal of Optimization Theory and Applications》2002,115(2):345-368
In this paper, we consider the extension of the notion of well-posedness by perturbations, introduced by Zolezzi for optimization problems, to other related variational problems like inclusion problems and fixed-point problems. Then, we study the conditions under which there is equivalence of the well-posedness in the above sense between different problems. Relations with the so-called diagonal well-posedness are also given. Finally, an application to staircase iteration methods is presented. 相似文献
9.
This paper presents an adaptive memory-based method for solving the Capacitated Vehicle Routing Problem (CVRP), called BoneRoute. The CVRP deals with the problem of finding the optimal sequence of deliveries conducted by a fleet of homogeneous vehicles, based at one depot, to serve a set of customers. The computational performance of the BoneRoute was found to be very efficient, producing high quality solutions over two sets of well known case studies examined. 相似文献
10.
In this paper, we will propose algorithms for calculating a minimal ellipsoid circumscribing a polytope defined by a system
of linear inequalities. If we know all vertices of the polytope and its cardinality is not very large, we can solve the problem
in an efficient manner by a number of existent algorithms. However, when the polytope is defined by linear inequalities, these
algorithms may not work since the cardinality of vertices may be huge. Based on a fact that vertices determining an ellipsoid
are only a fraction of these vertices, we propose algorithms which iteratively calculate an ellipsoid which covers a subset
of vertices. Numerical experiment shows that these algorithms perform well for polytopes of dimension up to seven. 相似文献