首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   24269篇
  免费   3666篇
  国内免费   1029篇
化学   3442篇
晶体学   51篇
力学   1417篇
综合类   364篇
数学   5884篇
物理学   3763篇
无线电   14043篇
  2024年   101篇
  2023年   395篇
  2022年   632篇
  2021年   769篇
  2020年   791篇
  2019年   702篇
  2018年   661篇
  2017年   908篇
  2016年   1145篇
  2015年   1156篇
  2014年   1761篇
  2013年   1737篇
  2012年   1728篇
  2011年   1854篇
  2010年   1327篇
  2009年   1442篇
  2008年   1584篇
  2007年   1627篇
  2006年   1402篇
  2005年   1168篇
  2004年   1001篇
  2003年   921篇
  2002年   746篇
  2001年   576篇
  2000年   509篇
  1999年   369篇
  1998年   353篇
  1997年   310篇
  1996年   256篇
  1995年   201篇
  1994年   142篇
  1993年   131篇
  1992年   113篇
  1991年   63篇
  1990年   69篇
  1989年   45篇
  1988年   50篇
  1987年   29篇
  1986年   36篇
  1985年   36篇
  1984年   34篇
  1983年   15篇
  1982年   20篇
  1981年   8篇
  1980年   6篇
  1979年   7篇
  1978年   4篇
  1977年   7篇
  1959年   6篇
  1957年   2篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
A method for automatically identifying the order of fringe pattern traces is presented. It uses the simplified Otsu algorithm for obtaining the threshold, the angular scan in the range of 45~ for searching the trace positions, and the zone search technique for identifying different traces. Experimental results show that the proposed method may reliably obtain the order of fringe pattern traces orientating from almost 45° to 90°.  相似文献   
992.
Recently, a number of heuristic techniques have been devised in order to overcome some of the limitations of the Blind Source Separation (BSS) algorithms that are rooted in the theory of Independent Component Analysis (ICA). They are usually based on topographic maps and designed to separate mixtures of signals with either sub-Gaussian or super-Gaussian source densities. In the sub-Gaussian case, the coordinates of the winning neurons in the topographic map represent the estimates of the source signal amplitudes. In the super-Gaussian case, one relies on the topographic map's ability to detect the source directions in mixture space which, in turn, correspond to the column vectors of the mixing matrix in the linear case. We will introduce a new topographic map-based heuristic for super-Gaussian BSS. It relies on the tendency of the mixture samples to cluster around the source directions. We will demonstrate its performance on linear and mildly non-linear mixtures of speech signals, including the case where there are less mixtures than sources to be separated (non-square BSS).  相似文献   
993.
1 IntroductionWe consider tlie variational inequality problelll, deuoted by VIP(X, F), wliicli is to find avector x* E X such thatF(X*)"(X -- X-) 2 0, VX E X, (1)where F: R" - R" is any vector-valued f11uction and X is a uonelllpty subset of R'.This problem has important applicatiolls. in equilibriun1 modeIs arising in fields such asecououtics, transportatioll scieuce alld operations research. See [1]. There exist mauy lllethodsfor solviug tlie variational li1equality problem VIP(X. …  相似文献   
994.
We study online bounded space bin packing in the resource augmentation model of competitive analysis. In this model, the online bounded space packing algorithm has to pack a list L of items in (0,1] into a small number of bins of size b1. Its performance is measured by comparing the produced packing against the optimal offline packing of the list L into bins of size 1.We present a complete solution to this problem: For every bin size b1, we design online bounded space bin packing algorithms whose worst case ratio in this model comes arbitrarily close to a certain bound ρ(b). Moreover, we prove that no online bounded space algorithm can perform better than ρ(b) in the worst case.  相似文献   
995.
The multiple knapsack problem denoted by MKP (B,S,rn,n) can be defined as follows. A set B of n items and a set S of rn knapsacks are given such that each item j has a profit pi and weight wj,and each knapsack i has a capacity Ci. The goal is to find a subset of items of maximum profit such that they have a feasible packing in the knapsacks. MKP (B,S,m,n) is strongly NP-Complete and no polynomial time approximation algorithm can have an approximation ratio better than 0.5. In the last ten years,semi-definite programming has been empolyed to solve some combinatorial problems successfully. This paper firstly presents a semi-definite relaxation algorithm (MKPS) for MKP (B,S,rn,n). It is proved that MKPS have a approximation ratio better than 0. 5 for a subclass of MKP (B,S,m,n) with n≤100, m≤5 and max^nj=1{wj}/min^mi=1={Ci}≤2/3.  相似文献   
996.
The state-of-the-art, large-scale numerical simulations of the scattering problem for the Helmholtz equation in two dimensions rely on iterative solvers for the Lippmann–Schwinger integral equation, with an optimal CPU time O(m 3 log(m)) for an m-by-m wavelength problem. We present a method to solve the same problem directly, as opposed to iteratively, with the obvious advantage in efficiency for multiple right-hand sides corresponding to distinct incident waves. Analytically, this direct method is a hierarchical, recursive scheme consisting of the so-called splitting and merging processes. Algebraically, it amounts to a recursive matrix decomposition, for a cost of O(m 3), of the discretized Lippmann–Schwinger operator. With this matrix decomposition, each back substitution requires only O(m 2 log(m)); therefore, a scattering problem with m incident waves can be solved, altogether, in O(m 3 log(m)) flops.  相似文献   
997.
Quincunx fundamental refinable functions and quincunx biorthogonal wavelets   总被引:4,自引:0,他引:4  

We analyze the approximation and smoothness properties of quincunx fundamental refinable functions. In particular, we provide a general way for the construction of quincunx interpolatory refinement masks associated with the quincunx lattice in . Their corresponding quincunx fundamental refinable functions attain the optimal approximation order and smoothness order. In addition, these examples are minimally supported with symmetry. For two special families of such quincunx interpolatory masks, we prove that their symbols are nonnegative. Finally, a general way of constructing quincunx biorthogonal wavelets is presented. Several examples of quincunx interpolatory masks and quincunx biorthogonal wavelets are explicitly computed.

  相似文献   

998.
This paper shows that for unitary Hessenberg matrices the algorithm, with (an exceptional initial-value modification of) the Wilkinson shift, gives global convergence; moreover, the asymptotic rate of convergence is at least cubic, higher than that which can be shown to be quadratic only for Hermitian tridiagonal matrices, under no further assumption. A general mixed shift strategy with global convergence and cubic rates is also presented.

  相似文献   

999.
In this paper we present an algorithm for recursively generating orthogonal bivariate polynomials on a discrete set S 2. For this purpose we employ commuting pairs of real symmetric matrices H, K n×n to obtain, in a certain sense, a two dimensional Hermitian Lanczos method. The resulting algorithm relies on a recurrence having a slowly growing length. Practical implementation issues an applications are considered. The method can be generalized to compute orthogonal polynomials depending on an arbitrary number of variables.  相似文献   
1000.
We study the perturbation theory for the eigenvalue problem of a formal matrix product A 1 s 1 ··· A p s p, where all A k are square and s k {–1, 1}. We generalize the classical perturbation results for matrices and matrix pencils to perturbation results for generalized deflating subspaces and eigenvalues of such formal matrix products. As an application we then extend the structured perturbation theory for the eigenvalue problem of Hamiltonian matrices to Hamiltonian/skew-Hamiltonian pencils.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号