全文获取类型
收费全文 | 14071篇 |
免费 | 1345篇 |
国内免费 | 593篇 |
专业分类
化学 | 1581篇 |
晶体学 | 35篇 |
力学 | 1101篇 |
综合类 | 351篇 |
数学 | 9482篇 |
物理学 | 3459篇 |
出版年
2024年 | 22篇 |
2023年 | 112篇 |
2022年 | 340篇 |
2021年 | 311篇 |
2020年 | 234篇 |
2019年 | 346篇 |
2018年 | 378篇 |
2017年 | 431篇 |
2016年 | 512篇 |
2015年 | 382篇 |
2014年 | 718篇 |
2013年 | 960篇 |
2012年 | 722篇 |
2011年 | 850篇 |
2010年 | 707篇 |
2009年 | 977篇 |
2008年 | 1008篇 |
2007年 | 934篇 |
2006年 | 768篇 |
2005年 | 616篇 |
2004年 | 546篇 |
2003年 | 466篇 |
2002年 | 449篇 |
2001年 | 390篇 |
2000年 | 341篇 |
1999年 | 363篇 |
1998年 | 300篇 |
1997年 | 239篇 |
1996年 | 241篇 |
1995年 | 199篇 |
1994年 | 174篇 |
1993年 | 153篇 |
1992年 | 123篇 |
1991年 | 80篇 |
1990年 | 82篇 |
1989年 | 66篇 |
1988年 | 53篇 |
1987年 | 45篇 |
1986年 | 45篇 |
1985年 | 55篇 |
1984年 | 56篇 |
1983年 | 20篇 |
1982年 | 38篇 |
1981年 | 38篇 |
1980年 | 28篇 |
1979年 | 21篇 |
1978年 | 12篇 |
1977年 | 13篇 |
1975年 | 9篇 |
1974年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
This paper studies the problem of how changes in the design of the genetic algorithm (GA) have an effect on the results obtained in real-life applications. In this study, focused on the application of a GA to the tuning of technical trading rules in the context of financial markets, our tentative thesis is that the GA is robust with respect to design changes. The optimization of technical trading systems is a suitable area for the application of the GA metaheuristic, as the complexity of the problem grows exponentially as new technical rules are added to the system and as the answer time is crucial when applying the system to real-time data. Up to now, most of GAs applications to this subject obviated the question of possible “design dependence” in their results. The data we report, based on our experiments, do not allow us to refute the hypothesis of robustness of the GA to design implementation, when applying to technical trading systems tuning. 相似文献
82.
This article introduces and analyzes a p-version FEM for variational inequalities resulting from obstacle problems for some quasi-linear elliptic partial differential
operators. We approximate the solution by controlling the obstacle condition in images of the Gauss–Lobatto points. We show
existence and uniqueness for the discrete solution u
p
from the p-version for the obstacle problem. We prove the convergence of u
p
towards the solution with respect to the energy norm, and assuming some additional regularity for the solution we derive
an a priori error estimate. In numerical experiments the p-version turns out to be superior to the h-version concerning the convergence rate and the number of unknowns needed to achieve a certain exactness of the approximation. 相似文献
83.
For a general K3 surface S of genus g, with 2 ≤ g ≤ 10, we prove that the intermediate Jacobians of the family of prime Fano threefolds of genus g containing S as a hyperplane section, form generically an algebraic completely integrable Hamiltonian system.
The first author is partially supported by grant MI1503/2005 of the Bulgarian Foundation for Scientific Research. 相似文献
84.
Tokuzo Shiga 《Probability Theory and Related Fields》1997,108(3):417-439
Summary. We study the exponential decay rate of the survival probability up to time t>0 of a random walker moving in Zopf;
d
in a temporally and spatially fluctuating random environment. When the random walker has a speed parameter κ>0, we investigate
the influence of κ on the exponential decay rate λ(d,κ). In particular we prove that for any fixed d≥1, λ(d,κ) behaves like as logκ as κ↘0.
Received: 21 May 1996 / In revised form: 2 February 1997 相似文献
85.
The parallel version of precondition techniques is developed for matrices arising from the Galerkin boundary element method for two-dimensional domains with Dirichlet boundary conditions. Results were obtained for implementations on a transputer network as well as on an nCUBE-2 parallel computer showing that iterative solution methods are very well suited for a MIMD computer. A comparison of numerical results for iterative and direct solution methods is presented and underlines the superiority of iterative methods for large systems. 相似文献
86.
I.IlltroductionWhenanactiveunderwateracousticalpositioningsystemissearchingforanunderwatertarget,itisnecessaryforittocompleteatransmittingandreceivingcycIewithineachworkingperiodinordertofindoutthelocationofthetargetcorrectly.Forexample,whenanunder-wateracoustica1synchronouspositioningsystemistrackinganunderwatertargetwithagivensynchr0nizingperiod,thepropagati0ntimeofthepositioningsignaltravellingfr0mthetaJrgettothearrayofthesystemshouldbelessthanthesynchronizingperiod0therwisetargetdis-tance… 相似文献
87.
几种约束广义逆矩阵的有限算法 总被引:2,自引:0,他引:2
陈永林 《高等学校计算数学学报》1997,19(3):232-240
1引言与引理众所周知,关于非奇异方阵的正则逆的有限算法是由Faddeev大给在1949年之前提出的,这就是著名的Faddeev算法[1,P…334-336]。自从五十年代中期广义逆矩阵的研究复兴与发展以来,有不少学者提出了关于广义逆矩阵的有限算法。第一个给出关于广义逆矩 相似文献
88.
Dmitrii S. Silvestrov 《Acta Appl Math》1994,34(1-2):109-124
Coupling procedures for Markov renewal processes are described. Applications to ergodic theorems for processes with semi-Markov switchings are considered.This paper was partly prepared with the support of NFR Grant F-UP 10257-300. 相似文献
89.
This paper proposes a floating-point genetic algorithm (FPGA) to solve the unit commitment problem (UCP). Based on the characteristics of typical load demand, a floating-point chromosome representation and an encoding–decoding scheme are designed to reduce the complexities in handling the minimum up/down time limits. Strategic parameters of the FPGA are characterized in detail, i.e., the evaluation function and its constraints, population size, operation styles of selection, crossover operation and probability, mutation operation and probability. A dynamic combination scheme of genetic operators is formulated to explore and exploit the FPGA in the non-convex solution space and multimodal objective function. Experiment results show that the FPGA is a more effective technique among the various styles of genetic algorithms, which can be applied to the practical scheduling tasks in utility power systems. 相似文献
90.
关于可达矩阵的求法探讨 总被引:6,自引:0,他引:6
在《离散数学》、《图论》课程中 ,用矩阵表示图时 ,涉及到一类重要的矩阵——可达矩阵 ,它是判别图中任意两点是否有通路的重要手段 ,也是求强分图的重要方法 ,但是可达矩阵的求法比较复杂 .本文针对这一问题 ,对可达矩阵的求法进行了改进 ,提出了一种简单可行的算法 . 相似文献