全文获取类型
收费全文 | 11786篇 |
免费 | 1076篇 |
国内免费 | 427篇 |
专业分类
化学 | 1991篇 |
晶体学 | 59篇 |
力学 | 1682篇 |
综合类 | 189篇 |
数学 | 6966篇 |
物理学 | 2402篇 |
出版年
2024年 | 19篇 |
2023年 | 119篇 |
2022年 | 317篇 |
2021年 | 378篇 |
2020年 | 262篇 |
2019年 | 267篇 |
2018年 | 310篇 |
2017年 | 432篇 |
2016年 | 407篇 |
2015年 | 308篇 |
2014年 | 575篇 |
2013年 | 728篇 |
2012年 | 722篇 |
2011年 | 610篇 |
2010年 | 567篇 |
2009年 | 676篇 |
2008年 | 671篇 |
2007年 | 732篇 |
2006年 | 624篇 |
2005年 | 522篇 |
2004年 | 419篇 |
2003年 | 392篇 |
2002年 | 369篇 |
2001年 | 331篇 |
2000年 | 309篇 |
1999年 | 258篇 |
1998年 | 256篇 |
1997年 | 224篇 |
1996年 | 163篇 |
1995年 | 190篇 |
1994年 | 158篇 |
1993年 | 129篇 |
1992年 | 119篇 |
1991年 | 99篇 |
1990年 | 81篇 |
1989年 | 67篇 |
1988年 | 58篇 |
1987年 | 43篇 |
1986年 | 44篇 |
1985年 | 59篇 |
1984年 | 54篇 |
1983年 | 16篇 |
1982年 | 27篇 |
1981年 | 24篇 |
1980年 | 21篇 |
1979年 | 36篇 |
1978年 | 22篇 |
1977年 | 30篇 |
1976年 | 19篇 |
1957年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
Patrick Imrie Jianyong Jin 《Journal of polymer science. Part A, Polymer chemistry》2022,60(2):149-174
4D printing is an exciting branch of additive manufacturing. It relies on established 3D printing techniques to fabricate objects in much the same way. However, structures which fall into the 4D printed category have the ability to change with time, hence the “extra dimension.” The common perception of 4D printed objects is that of macroscopic single-material structures limited to point-to-point shape change only, in response to either heat or water. However, in the area of polymer 4D printing, recent advancements challenge this understanding. A host of new polymeric materials have been designed which display a variety of wonderful effects brought about by unconventional stimuli, and advanced additive manufacturing techniques have been developed to accommodate them. As a result, the horizons of polymer 4D printing have been broadened beyond what was initially thought possible. In this review, we showcase the many studies which evolve the very definition of polymer 4D printing, and reveal emerging areas of research integral to its advancement. 相似文献
2.
《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 . 相似文献
3.
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. 相似文献
4.
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.
Using the continuous shape space formalism, we develop an immune system model involving both B lymphocytes and antibody molecules. The binding and cross-linking of receptors on B cells stimulates the cells to divide and, with a lag, to secrete antibody. Using the method of multiple scales, we show how to correctly formulate long-time-scale equations for the population dynamics of B cells, the total antibody concentration, and rate of antibody secretion. We compare our model with previous phenomenological formulations. 相似文献
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. 相似文献