全文获取类型
收费全文 | 9642篇 |
免费 | 1223篇 |
国内免费 | 704篇 |
专业分类
化学 | 721篇 |
晶体学 | 8篇 |
力学 | 471篇 |
综合类 | 129篇 |
数学 | 5300篇 |
物理学 | 3018篇 |
无线电 | 1922篇 |
出版年
2024年 | 12篇 |
2023年 | 83篇 |
2022年 | 120篇 |
2021年 | 160篇 |
2020年 | 204篇 |
2019年 | 208篇 |
2018年 | 199篇 |
2017年 | 251篇 |
2016年 | 304篇 |
2015年 | 278篇 |
2014年 | 459篇 |
2013年 | 736篇 |
2012年 | 496篇 |
2011年 | 604篇 |
2010年 | 465篇 |
2009年 | 604篇 |
2008年 | 677篇 |
2007年 | 658篇 |
2006年 | 636篇 |
2005年 | 497篇 |
2004年 | 429篇 |
2003年 | 421篇 |
2002年 | 405篇 |
2001年 | 344篇 |
2000年 | 300篇 |
1999年 | 316篇 |
1998年 | 266篇 |
1997年 | 194篇 |
1996年 | 200篇 |
1995年 | 122篇 |
1994年 | 118篇 |
1993年 | 98篇 |
1992年 | 76篇 |
1991年 | 65篇 |
1990年 | 55篇 |
1989年 | 39篇 |
1988年 | 54篇 |
1987年 | 41篇 |
1986年 | 36篇 |
1985年 | 44篇 |
1984年 | 47篇 |
1983年 | 27篇 |
1982年 | 39篇 |
1981年 | 21篇 |
1980年 | 26篇 |
1979年 | 35篇 |
1978年 | 22篇 |
1977年 | 21篇 |
1976年 | 14篇 |
1974年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
2.
提供了一种简便易行的靶面激光光斑尺寸原位测量的方法。从高斯光束的横向光强分布特性出发,建立了激光烧蚀斑半径与辐照激光能量、光斑尺寸、烧蚀阈值间的关系式,模拟分析发现辐照激光光斑尺寸对烧蚀斑半径随辐照能量变化曲线有较大影响。对于脉宽为2 ms,波长为1064 nm的激光,实验测量了不同能量激光辐照下相纸烧蚀斑半径,并用推导出的关系式拟合测量数据,获得了靶面处光斑尺寸和样品烧蚀阈值。同时,也测量了不同位置处的光斑尺寸和样品烧蚀阈值,对高斯光束束腰位置和样品烧蚀阈值的光斑尺寸效应进行了验证。研究结果表明该技术结果可靠,简单高效。该技术可以为高能激光与固体物质相互作用的基础研究和激光加工等应用领域中实现简单方便地测量靶面光斑尺寸提供帮助。 相似文献
3.
4.
Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a
given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred
to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional
(resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional
(resp., unidirectional) topology is k-edge connected.
The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied
by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18],
which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19],
which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity.
In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity,
and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity
and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for
distributed implementation.
A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless
(Adhoc-Now 2003).
Research performed in part while visiting the Max-Plank-Institut fur Informatik.
Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting
researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University
of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms.
Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor
since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and
Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990.
His research interests include optical networks and wireless networks. 相似文献
5.
We employ a first-principles plane wave method with the
relativistic analytic pseudopotential of Hartwigsen, Goedecker and Hutter
(HGH) scheme in the frame of DFT to calculate
the equilibrium lattice parameters and the thermodynamic properties of
AlB2 compound with hcp structure. The obtained lattice parameters are in
good agreement with the available experimental data and those calculated by
others. Through the quasi-harmonic Debye model, obtained successfully are
the dependences of the
normalized lattice parameters a/a0 and c/c0 on pressure P, the normalized
primitive cell volume V/V0 on pressure P, the variation of the thermal
expansion α with pressure P and temperature T, as well as the Debye
temperature \ThetaD and the heat capacity CV on pressure P and
temperature T. 相似文献
6.
Zhong-Qing Wang 《Journal of Mathematical Analysis and Applications》2002,274(1):374-403
An orthogonal system of rational functions is discussed. Some inverse inequalities, imbedding inequalities and approximation results are obtained. Two model problems are considered. The stabilities and convergences of proposed rational spectral schemes and rational pseudospectral schemes are proved. The techniques used in this paper are also applicable to other problems on the whole line. Numerical results show the efficiency of this approach. 相似文献
7.
Formalization for problems of multicriteria decision making under uncertainty is constructed in terms of guaranteed and weak
estimates. A relevant definition of the vector maximinimax value is given. Parameterization and approximation of maximum,
minimax, and maximinimax values based on the inverse logical convolution are suggested. An application for multicommodity
networks is considered.
Received: December 13, 2000 / Accepted: August 21, 2001?Published online May 8, 2002 相似文献
8.
9.
10.
Rakhim Aitbayev 《Numerical Methods for Partial Differential Equations》2006,22(4):847-866
Efficient multilevel preconditioners are developed and analyzed for the quadrature finite element Galerkin approximation of the biharmonic Dirichlet problem. The quadrature scheme is formulated using the Bogner–Fox–Schmit rectangular element and the product two‐point Gaussian quadrature. The proposed additive and multiplicative preconditioners are uniformly spectrally equivalent to the operator of the quadrature scheme. The preconditioners are implemented by optimal algorithms, and they are used to accelerate convergence of the preconditioned conjugate gradient method. Numerical results are presented demonstrating efficiency of the preconditioners. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2006 相似文献