全文获取类型
收费全文 | 137237篇 |
免费 | 10984篇 |
国内免费 | 8466篇 |
专业分类
化学 | 67546篇 |
晶体学 | 1709篇 |
力学 | 10010篇 |
综合类 | 552篇 |
数学 | 38042篇 |
物理学 | 38828篇 |
出版年
2024年 | 214篇 |
2023年 | 1129篇 |
2022年 | 2054篇 |
2021年 | 2350篇 |
2020年 | 2429篇 |
2019年 | 2533篇 |
2018年 | 12104篇 |
2017年 | 11847篇 |
2016年 | 8706篇 |
2015年 | 3772篇 |
2014年 | 3962篇 |
2013年 | 4960篇 |
2012年 | 9269篇 |
2011年 | 15880篇 |
2010年 | 9541篇 |
2009年 | 9853篇 |
2008年 | 10829篇 |
2007年 | 12343篇 |
2006年 | 3904篇 |
2005年 | 4312篇 |
2004年 | 3870篇 |
2003年 | 3812篇 |
2002年 | 2937篇 |
2001年 | 1799篇 |
2000年 | 1584篇 |
1999年 | 1394篇 |
1998年 | 1129篇 |
1997年 | 990篇 |
1996年 | 1049篇 |
1995年 | 854篇 |
1994年 | 684篇 |
1993年 | 600篇 |
1992年 | 487篇 |
1991年 | 459篇 |
1990年 | 370篇 |
1989年 | 314篇 |
1988年 | 234篇 |
1987年 | 195篇 |
1986年 | 223篇 |
1985年 | 175篇 |
1984年 | 117篇 |
1983年 | 118篇 |
1982年 | 96篇 |
1981年 | 86篇 |
1980年 | 68篇 |
1979年 | 64篇 |
1978年 | 43篇 |
1914年 | 45篇 |
1909年 | 41篇 |
1908年 | 40篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
In this paper, we are interested in the regularity estimates of the nonnegative viscosity super solution of the $β$−biased infinity Laplacian equation $$∆^β_∞u = 0,$$ where $β ∈ \mathbb{R}$ is a fixed constant and $∆^β_∞u := ∆^N_∞u + β|Du|,$ which arises from the random game named biased tug-of-war. By studying directly the $β$−biased infinity Laplacian equation, we construct the appropriate exponential cones as barrier functions to establish a key estimate. Based on this estimate, we obtain the Harnack inequality, Hopf boundary point lemma, Lipschitz estimate and the Liouville property etc. 相似文献
992.
Explicit Traveling Wave Solutions and Their Dynamical Behaviors for the Coupled Higgs Field Equation 下载免费PDF全文
In this paper, we focus on the traveling wave solutions of the coupled Higgs field equation from the perspective of dynamical systems. Through the phase portraits, in addition to periodic wave solutions and solitary wave solutions, we also obtain explicit periodic singular wave solutions, singular wave solutions and kink wave solutions, which were not found in the previous works. The dynamical behavior of these solutions and their internal relations are revealed through asymptotic analysis. The results will help supplement the study of field equation. 相似文献
993.
Shengrui Lin Yiting Cai Jiaxi Luo Ziyu Xuan Yicong Zhao 《Journal of Nonlinear Modeling and Analysis》2022,4(2):220-244
In this paper, we investigate the Novikov equation with weak dissipation terms. First, we give the local well-posedness and the blow-up scenario. Then, we discuss the global existence of the solutions under certain conditions. After that, on condition that the compactly supported initial data keeps its sign, we prove the infinite propagation speed of our solutions, and establish the large time behavior. Finally, we also elaborate the persistence property of our solutions in weighted Sobolev space. 相似文献
994.
This paper studies the optimal operation of an M/E k /1 queueing system with a removable service station under steady-state conditions. Analytic closed-form solutions of the controllable M/E k /1 queueing system are derived. This is a generalization of the controllable M/M/1, the ordinary M/E k /1, and the ordinary M/M/1 queueing systems in the literature. We prove that the probability that the service station is busy in the steady-state is equal to the traffic intensity. Following the construction of the expected cost function per unit time, we determine the optimal operating policy at minimum cost. 相似文献
995.
Kun-Jen Chung 《The Journal of the Operational Research Society》1995,46(11):1374-1385
Chiu, in 1976, studied the economic design of np charts for processes subject to a multiplicity of assignable causes. Chiu developed a two-step minimization procedure to obtain the three control variables, namely, the sampling interval, the sample size and the acceptance number. Although Chiu's two-step minimization procedure is simple, applicable and down to earth, it is rather inefficient and has some drawbacks. This paper presents an algorithm to overcome these drawbacks. The results and the execution times of all numerical examples show that the accuracy and the efficiency of the algorithm is reasonably good. 相似文献
996.
Karin Krüger Natalia V. Shakhlevich Yuri N. Sotskov Frank Werner 《The Journal of the Operational Research Society》1995,46(12):1481-1497
We consider a scheduling problem where a set of n jobs has to be processed on a set of m machines and arbitrary precedence constraints between operations are given. Moreover, for any two operations i and j values a ij >0 and a ji >0 may be given where a ij is the minimal difference between the starting times of operations i and j when operation i is processed first. Often, the objective is to minimize the makespan but we consider also arbitrary regular criteria. Even the special cases of the classical job shop problem J//Cmax belong to the set of NP-hard problems. Therefore, approximation or heuristic algorithms are necessary to handle large-dimension problems. Based on the mixed graph model we give a heuristic decomposition algorithm for such a problem, i.e. the initial problem is partitioned into subproblems that can be solved exactly or approximately with a small error bound. These subproblems are obtained by a relaxation of a subset of the set of undirected edges of the mixed graph. The subproblems are successively solved and a proportion of the results obtained for one subproblem is kept for further subproblem definitions. Numerical results of the algorithm presented here are given. 相似文献
997.
Kang Zhao 《Numerical Algorithms》1995,9(1):141-156
Implicit and explicit characterizations of the solutions to the following constrained best interpolation problem $$\min \left\{ {\left\| {Tx - z} \right\|:x \in C \cap A^{ - 1} d} \right\}$$ are presented. Here,T is a densely-defined, closed, linear mapping from a Hilbert spaceX to a Hilbert spaceY, A: X→Z is a continuous, linear mapping withZ a locally, convex linear topological space,C is a closed, convex set in the domain domT ofT, andd∈AC. For the case in whichC is a closed, convex cone, it is shown that the constrained best interpolation problem can generally be solved by finding the saddle points of a saddle function on the whole space, and, if the explicit characterization is applicable, then solving this problem is equivalent to solving an unconstrained minimization problem for a convex function. 相似文献
998.
Adams MR Aïd S Anthony PL Averill DA Baker MD Baller BR Banerjee A Bhatti AA Bratzler U Braun HM Breidung H Busza W Carroll TJ Clark HL Conrad JM Davisson R Derado I Dhawan SK Dietrich FS Dougherty W Dreyer T Eckardt V Ecker U Erdmann M Faller F Fang GY Figiel J Finlay RW Gebauer HJ Geesaman DF Griffioen KA Guo RS Haas J Halliwell C Hantke D Hicks KH Hughes VW Jackson HE Jancso G Jansen DM Jin Z Kaufman S Kennedy RD Kinney ER Kirk T Kobrak HG Kotwal AV Kunori S Lancaster S Lord JJ Lubatti HJ 《Physical review letters》1995,74(9):1525-1529
999.
1000.