全文获取类型
收费全文 | 7737篇 |
免费 | 1104篇 |
国内免费 | 446篇 |
专业分类
化学 | 4014篇 |
晶体学 | 30篇 |
力学 | 777篇 |
综合类 | 188篇 |
数学 | 1956篇 |
物理学 | 2322篇 |
出版年
2024年 | 9篇 |
2023年 | 102篇 |
2022年 | 214篇 |
2021年 | 310篇 |
2020年 | 388篇 |
2019年 | 253篇 |
2018年 | 239篇 |
2017年 | 342篇 |
2016年 | 403篇 |
2015年 | 346篇 |
2014年 | 465篇 |
2013年 | 463篇 |
2012年 | 485篇 |
2011年 | 459篇 |
2010年 | 388篇 |
2009年 | 472篇 |
2008年 | 434篇 |
2007年 | 452篇 |
2006年 | 422篇 |
2005年 | 363篇 |
2004年 | 329篇 |
2003年 | 279篇 |
2002年 | 232篇 |
2001年 | 185篇 |
2000年 | 188篇 |
1999年 | 148篇 |
1998年 | 158篇 |
1997年 | 112篇 |
1996年 | 99篇 |
1995年 | 104篇 |
1994年 | 83篇 |
1993年 | 70篇 |
1992年 | 60篇 |
1991年 | 34篇 |
1990年 | 29篇 |
1989年 | 25篇 |
1988年 | 14篇 |
1987年 | 16篇 |
1986年 | 16篇 |
1985年 | 26篇 |
1984年 | 16篇 |
1983年 | 5篇 |
1982年 | 8篇 |
1981年 | 3篇 |
1980年 | 6篇 |
1979年 | 14篇 |
1978年 | 5篇 |
1977年 | 6篇 |
1976年 | 5篇 |
1971年 | 2篇 |
排序方式: 共有9287条查询结果,搜索用时 359 毫秒
941.
942.
Ana M. Martínez-Rodríguez Jerrold H. May Luis G. Vargas 《Mathematical and Computer Modelling》2008,48(7-8):1265-1278
Bayesian networks model conditional dependencies among the domain variables, and provide a way to deduce their interrelationships as well as a method for the classification of new instances. One of the most challenging problems in using Bayesian networks, in the absence of a domain expert who can dictate the model, is inducing the structure of the network from a large, multivariate data set. We propose a new methodology for the design of the structure of a Bayesian network based on concepts of graph theory and nonlinear integer optimization techniques. 相似文献
943.
This paper examines a multi-period capacity expansion problem for rapid transit network design. The capacity expansion is realized through the location of train alignments and stations in an urban traffic context by selecting the time periods. The model maximizes the public transportation demand using a limited budget and designing lines for each period. The location problem incorporates the user decisions about mode and route. The network capacity expansion is a long-term planning problem because the network is built over several periods, in which the data (demand, resource price, etc.) are changing like the real problem changes. This complex problem cannot be solved by branch and bound, and for this reason, a heuristic approach has been defined in order to solve it. Both methods have been experimented in test networks. 相似文献
944.
Victor Schneider 《BIT Numerical Mathematics》1971,11(1):84-93
The question of how many temporary storage registers are needed to evaluate compiled arithmetic and masking expressions is discussed. It is assumed that any combination of left-to-right, right-to-left, top-to-bottom, and bottom-to-top techniques may be used to evaluate an expression, but that no factoring or re-arranging of the expression may occur. On this basis, the maximum number of registers needed to evaluate nonparenthesized expressions isN+1, withN the number of dyadic operator precedence levels. For parenthesized expressions with a maximum ofK nested parenthetical subexpressions, the maximum number of registers needed is (K+1)N+1. 相似文献
945.
Some general existence results for optimal shape design problems for systems governed by elliptic variational inequalities are established by the mapping method and variational convergence theory. Then, an existence theorem is given for the optimal shape for an electrochemical machining problem, in which the cost functional is not lower semicontinuous, by extending the general results to this case. Furthermore, this problem is approximated by a set of optimal shape design problems which have more smooth cost functionals and are easier to handle computationally.The authors with to express their sincere thanks to the reviewers for supplying additional references and for their valuable comments, which made the paper more readable. 相似文献
946.
The minimal-weight design of sandwich plates whose rigidplastic face sheets obey the Tresca yield condition and which are subjected to two alternative loads is systematically determined by the method of stress variation. It is shown that, when the loads are unidirectional, the general solution for a certain class of edge conditions consists of five fundamentally different designs. The totality of optimal design solutions is depicted in the form of a design chart. A comprehensive example is presented to illustrate the method.This paper is based in part upon a dissertation submitted by the first author to The University of Iowa in partial fulfillment of requirements for the PhD Degree. 相似文献
947.
A constrained minimax problem is converted to minimization of a sequence of unconstrained and continuously differentiable functions in a manner similar to Morrison's method for constrained optimization. One can thus apply any efficient gradient minimization technique to do the unconstrained minimization at each step of the sequence. Based on this approach, two algorithms are proposed, where the first one is simpler to program, and the second one is faster in general. To show the efficiency of the algorithms even for unconstrained problems, examples are taken to compare the two algorithms with recent methods in the literature. It is found that the second algorithm converges faster with respect to the other methods. Several constrained examples are also tried and the results are presented. 相似文献
948.
Michael G. Neubauer William Watkins Joel Zeitlin 《Linear algebra and its applications》1998,280(2-3):109-127
The purpose of this paper is to exhibit new infinite families of D-optimal (0, 1)-matrices. We show that Hadamard designs lead to D-optimal matrices of size (j, mj) and (j − 1, mj), for certain integers j ≡ 3 (mod 4) and all positive integers m. For j a power of a prime and j ≡ 1 (mod 4), supplementary difference sets lead to D-optimal matrices of size (j, 2mj) and (j − 1, 2mj), for all positive integers m. We also show that for a given j and d sufficiently large, about half of the entries in each column of a D-optimal matrix are ones. This leads to a new relationship between D-optimality for (0, 1)-matrices and for (±1)-matrices. Known results about D-optimal (±1)-matrices are then used to obtain new D-optimal (0, 1)-matrices. 相似文献
949.
本文以基于 Buchadhl 象差系数得到的点列图为目标函数,只需追迹少许光线就可得到近似点列图,大大减少了计算量;同时采用了目标函数对结构参数偏导数解析求导原理并应用于光学自动设计,这样得到的解析偏导数不仅不存在原理误差,同时极大地减少了求得所需的时间;最后给出了使用 DFP-BFGS 优化方法设计一个双高斯物镜的实例. 相似文献
950.
Summary We describe the simplest system which shows stochastic resonance. A linear(ized) theory for white and (almost) arbitrarily
coloured noise is presented. The presented new system has new, unique properties which originate from itsnon-dynamical character; for example, the strength and phase shift of periodic response of the system is independent of the frequency.
Experiments have been carried out with the following noise processes: (physical) white noise, (physical) Lorentzian noise
and (physical) 1/f noise. With a small extension of the system, its linear-response regime can be significantly increased. As the system is
similar to some simple models of neurones, the new results might have not only physical but also biological importance.
Paper presented at the International Workshop “Fluctuations in Physics and Biology: Stochastic Resonance, Signal Processing
and Related Phenomena”, Elba, 5–10 June 1994. 相似文献