全文获取类型
收费全文 | 12745篇 |
免费 | 1998篇 |
国内免费 | 892篇 |
专业分类
化学 | 2462篇 |
晶体学 | 90篇 |
力学 | 1144篇 |
综合类 | 199篇 |
数学 | 6839篇 |
物理学 | 4901篇 |
出版年
2024年 | 13篇 |
2023年 | 115篇 |
2022年 | 246篇 |
2021年 | 320篇 |
2020年 | 348篇 |
2019年 | 402篇 |
2018年 | 369篇 |
2017年 | 473篇 |
2016年 | 520篇 |
2015年 | 406篇 |
2014年 | 606篇 |
2013年 | 1172篇 |
2012年 | 693篇 |
2011年 | 784篇 |
2010年 | 700篇 |
2009年 | 772篇 |
2008年 | 849篇 |
2007年 | 793篇 |
2006年 | 715篇 |
2005年 | 624篇 |
2004年 | 520篇 |
2003年 | 571篇 |
2002年 | 505篇 |
2001年 | 408篇 |
2000年 | 378篇 |
1999年 | 351篇 |
1998年 | 290篇 |
1997年 | 294篇 |
1996年 | 216篇 |
1995年 | 173篇 |
1994年 | 127篇 |
1993年 | 102篇 |
1992年 | 90篇 |
1991年 | 72篇 |
1990年 | 70篇 |
1989年 | 62篇 |
1988年 | 58篇 |
1987年 | 53篇 |
1986年 | 47篇 |
1985年 | 71篇 |
1984年 | 41篇 |
1983年 | 26篇 |
1982年 | 37篇 |
1981年 | 31篇 |
1980年 | 14篇 |
1979年 | 24篇 |
1978年 | 18篇 |
1977年 | 16篇 |
1976年 | 17篇 |
1973年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically
by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually
employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be
“close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence
many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report
results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process
can be improved to better reflect the actual properties sought.
In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend
themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms
of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling
approach may possibly lead to algorithms with improved efficiency.
AMS subject classification (2000) 65L05, 65M32, 65N21, 65N22, 65D18 相似文献
52.
53.
In this paper, nonconvex multiobjective optimization problems are studied. New characterizations of a properly efficient solution in the sense of Geoffrion's are established in terms of the stability of one scalar optimization problem and the existence of an exact penalty function of a scalar constrained program, respectively. One of the characterizations is applied to derive necessary conditions for a properly efficient control-parameter pair of a nonconvex multiobjective discrete optimal control problem with linear constraints. 相似文献
54.
A. V. Kel’manov L. V. Mikhailova 《Computational Mathematics and Mathematical Physics》2006,46(1):165-181
The problem of joint a posteriori detection of reference fragments in a quasi-periodic sequence and its partition into segments containing series of recurring fragments from the reference tuple is solved. It is assumed that (i) an ordered reference tuple of sequences to be detected is given, (ii) the number of desired fragments is known, (iii) the index of the sequence term corresponding to the beginning of a fragment is a deterministic (not random) value, and (iv) a sequence distorted by an additive uncorrelated Gaussian noise is available for observation. It is established that the problem consists in testing a set of hypotheses about the mean of a random Gaussian vector. The cardinality of the set grows exponentially as the vector dimension (i.e., the sequence length) increases. An efficient a posteriori algorithm producing a maximum-likelihood optimal solution to the problem is substantiated. Time and space complexity bounds related to the parameters of the problem are derived. The results of numerical simulation are presented. 相似文献
55.
In this paper, we analyze the manufacturing lead time in a production system with BMAP (Batch Markovian Arrival process) input and post-operation operated under the N-policy. We use the factorization principle to derive the waiting time distribution (hence the manufacturing lead time) and the mean performance measures. A numerical example is provided. 相似文献
56.
We employ an agent‐based model to show that memory and the absence of an a priori best strategy are sufficient for self‐segregation and clustering to emerge in a complex adaptive system with discrete agents that do not compete over a limited resource nor contend in a winner‐take‐all scenario. An agent starts from a corner of a two‐dimensional lattice and aims to reach a randomly selected site in the opposite side within the shortest possible time. The agent is isolated during the course of its journey and does not interact with other agents. Time‐bound obstacles appear at random lattice locations and the agent must decide whether to challenge or evade any obstacle blocking its path. The agent is capable of adapting a strategy in dealing with an obstacle. We analyze the dependence of strategy‐retention time with strategy for both memory‐based and memory‐less agents. We derive the equality spectrum to establish the environmental conditions that favor the existence of an a priori best strategy. We found that memory‐less agents do not polarize into two opposite strategy‐retention time distributions nor cluster toward a center distribution. © 2004 Wiley Periodicals, Inc. Complexity 9: 41–46, 2004 相似文献
57.
58.
59.
Hirofumi Tsumura. 《Mathematics of Computation》2004,73(245):251-258
In this paper, we give some evaluation formulas for Tornheim's type of alternating series by an elementary and combinatorial calculation of the uniformly convergent series. Indeed, we list several formulas for them by means of Riemann's zeta values at positive integers.
60.
In this paper, we exhibit a unified treatment of the mixed initial boundary value problem for second order (in time) parabolic linear differential equations in Banach spaces, whose boundary conditions are of a dynamical nature. Results regarding existence, uniqueness, continuous dependence (on initial data) and regularity of classical and strict solutions are established. Moreover, several examples are given as samples for possible applications.