全文获取类型
收费全文 | 44304篇 |
免费 | 5526篇 |
国内免费 | 4319篇 |
专业分类
化学 | 11905篇 |
晶体学 | 963篇 |
力学 | 9862篇 |
综合类 | 583篇 |
数学 | 16661篇 |
物理学 | 14175篇 |
出版年
2024年 | 106篇 |
2023年 | 495篇 |
2022年 | 903篇 |
2021年 | 1032篇 |
2020年 | 1260篇 |
2019年 | 1120篇 |
2018年 | 1122篇 |
2017年 | 1589篇 |
2016年 | 1785篇 |
2015年 | 1411篇 |
2014年 | 2300篇 |
2013年 | 3218篇 |
2012年 | 2723篇 |
2011年 | 3084篇 |
2010年 | 2622篇 |
2009年 | 2926篇 |
2008年 | 2840篇 |
2007年 | 2841篇 |
2006年 | 2548篇 |
2005年 | 2360篇 |
2004年 | 1997篇 |
2003年 | 1804篇 |
2002年 | 1651篇 |
2001年 | 1330篇 |
2000年 | 1253篇 |
1999年 | 1141篇 |
1998年 | 1056篇 |
1997年 | 888篇 |
1996年 | 729篇 |
1995年 | 617篇 |
1994年 | 566篇 |
1993年 | 460篇 |
1992年 | 462篇 |
1991年 | 354篇 |
1990年 | 284篇 |
1989年 | 217篇 |
1988年 | 187篇 |
1987年 | 134篇 |
1986年 | 94篇 |
1985年 | 122篇 |
1984年 | 115篇 |
1983年 | 58篇 |
1982年 | 77篇 |
1981年 | 55篇 |
1980年 | 31篇 |
1979年 | 48篇 |
1978年 | 33篇 |
1977年 | 38篇 |
1976年 | 14篇 |
1957年 | 11篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
M. A. Posypkin I. Kh. Sigal 《Computational Mathematics and Mathematical Physics》2006,46(12):2187-2202
The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered. 相似文献
102.
用三个关系式与Mathematica软件求第二类自然数幂和公式 总被引:1,自引:1,他引:0
首先介绍三个第二类自然数幂和关系式并对其中的两式给出证明,接着利用这些关系式与数学软件M athem atica4.0,给出求解第二类自然数幂和公式的若干机械计算方法. 相似文献
103.
Jian‐guo Tang 《Mathematical Methods in the Applied Sciences》2006,29(11):1327-1338
An implicit iterative method is applied to solving linear ill‐posed problems with perturbed operators. It is proved that the optimal convergence rate can be obtained after choosing suitable number of iterations. A generalized Morozov's discrepancy principle is proposed for the problems, and then the optimal convergence rate can also be obtained by an a posteriori strategy. The convergence results show that the algorithm is a robust regularization method. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
104.
Boniface Nkemzi 《Mathematical Methods in the Applied Sciences》2006,29(9):1053-1080
This paper is concerned with the structure of the singular and regular parts of the solution of time‐harmonic Maxwell's equations in polygonal plane domains and their effective numerical treatment. The asymptotic behaviour of the solution near corner points of the domain is studied by means of discrete Fourier transformation and it is proved that the solution of the boundary value problem does not belong locally to H2 when the boundary of the domain has non‐acute angles. A splitting of the solution into a regular part belonging to the space H2, and an explicitly described singular part is presented. For the numerical treatment of the boundary value problem, we propose a finite element discretization which combines local mesh grading and the singular field methods and derive a priori error estimates that show optimal convergence as known for the classical finite element method for problems with regular solutions. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
105.
J. J. EGOZCUE J. L. DIAZ-BARRERO V. PAWLOWSKY-GLAHN 《数学学报(英文版)》2006,22(4):1175-1182
The set of probability functions is a convex subset of L1 and it does not have a linear space structure when using ordinary sum and multiplication by real constants. Moreover, difficulties arise when dealing with distances between densities. The crucial point is that usual distances are not invariant under relevant transformations of densities. To overcome these limitations, Aitchison's ideas on compositional data analysis are used, generalizing perturbation and power transformation, as well as the Aitchison inner product, to operations on probability density functions with support on a finite interval. With these operations at hand, it is shown that the set of bounded probability density functions on finite intervals is a pre-Hilbert space. A Hilbert space of densities, whose logarithm is square-integrable, is obtained as the natural completion of the pre-Hilbert space. 相似文献
106.
Ledzewicz U. Nowakowski A. Schättler H. 《Journal of Optimization Theory and Applications》2004,122(2):345-370
It is shown that, if a parametrized fämily of extremals F can be stratified in a way compatible with the flow map generated by F, then those trajectories of the family which realize the minimal values of the cost in F are indeed optimal in comparison with all trajectories which lie in the region R covered by the trajectories of F. It is not assumed that F is a field covering the state space injectively. As illustration, an optimal synthesis is constructed for a system where the flow of extremals exhibits a simple cusp singularity. 相似文献
107.
This paper has demonstrated that the Schwartz alternating process must converge if D-N alternating process has converged. Its technique is that the overlapping regions in Schwartz alternating process are considered as independent domains, then Schwartz alternating process could be transformed into D-N alter-nating process. Finally the convergence estimation of Schwartz alternating process could be obtained. The results show that its convergence rate is same as that of D-N alternating process. 相似文献
108.
We study the asymptotic distribution of the fill‐up level in a binary trie built over n independent strings generated by a biased memoryless source. The fill‐up level is the number of full levels in a tree. A level is full if it contains the maximum allowable number of nodes (e.g., in a binary tree level k can have up to 2k nodes). The fill‐up level finds many interesting applications, e.g., in the internet IP lookup problem and in the analysis of level compressed tries (LC tries). In this paper, we present a complete asymptotic characterization of the fill‐up distribution. In particular, we prove that this distribution concentrates on one or two points around the most probably value k = ?log1/qn ? log log log n + 1 + log log(p/q)?, where p > q = 1 ? p is the probability of generating the more likely symbol (while q = 1 ? p is the probability of the less likely symbol). We derive our results by analytic methods such as generating functions, Mellin transform, the saddle point method, and analytic depoissonization. We also present some numerical verification of our results. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004 相似文献
109.
A new parallel storm surge model, the Parallel Environmental Model (PEM), is developed and tested by comparisons with analytic solutions. The PEM is a 2‐D vertically averaged, wetting and drying numerical model and can be operated in explicit, semi‐implicit and fully implicit modes. In the implicit mode, the propagation, Coriolis and bottom friction terms can all be treated implicitly. The advection and diffusion terms are solved with a parallel Eulerian–Lagrangian scheme developed for this study. The model is developed specifically for use on parallel computer systems and will function accordingly in either explicit of implicit modes. Storm boundary conditions are based on a simple exponential decay of pressure from the centre of a storm. The simulated flooding caused by a major Category 5 hurricane making landfall in the Indian River Lagoon, Florida is then presented as an example application of the PEM. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献
110.
In this paper, an interior point cutting plane method (IPCPM)is applied to solve optimal power flow (OPF) problems. Comparedwith the simplex cutting plane method (SCPM), the IPCPM is simpler,and efficient because of its polynomial-time characteristic.Issues in implementing IPCPM for OPF problems are addressed,including (1) how to generate cutting planes without using thesimplex tableau, (2) how to identify the basis variables inIPCPM, and (3) how to generate mixed integer cutting planes.The calculation speed of the proposed algorithm is further enhancedby utilizing the sparsity features of the OPF formulation. Numericalsimulations on IEEE 14-300-bus test systems have shown thatthe proposed method is effective. 相似文献