首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   9873篇
  免费   105篇
  国内免费   4篇
电工技术   142篇
综合类   6篇
化学工业   867篇
金属工艺   111篇
机械仪表   142篇
建筑科学   166篇
矿业工程   33篇
能源动力   104篇
轻工业   697篇
水利工程   43篇
石油天然气   23篇
武器工业   1篇
无线电   796篇
一般工业技术   985篇
冶金工业   5031篇
原子能技术   109篇
自动化技术   726篇
  2021年   47篇
  2019年   45篇
  2018年   50篇
  2017年   57篇
  2016年   75篇
  2015年   51篇
  2014年   83篇
  2013年   190篇
  2012年   165篇
  2011年   228篇
  2010年   194篇
  2009年   206篇
  2008年   229篇
  2007年   233篇
  2006年   199篇
  2005年   203篇
  2004年   190篇
  2003年   172篇
  2002年   144篇
  2001年   149篇
  2000年   164篇
  1999年   264篇
  1998年   1364篇
  1997年   823篇
  1996年   575篇
  1995年   342篇
  1994年   322篇
  1993年   395篇
  1992年   160篇
  1991年   173篇
  1990年   162篇
  1989年   184篇
  1988年   166篇
  1987年   140篇
  1986年   149篇
  1985年   140篇
  1984年   87篇
  1983年   91篇
  1982年   84篇
  1981年   77篇
  1980年   79篇
  1979年   78篇
  1978年   83篇
  1977年   155篇
  1976年   251篇
  1975年   59篇
  1974年   56篇
  1973年   53篇
  1972年   37篇
  1971年   36篇
排序方式: 共有9982条查询结果,搜索用时 15 毫秒
131.
This paper reports the successful use of ZnSe/ZnS/ZnMgS/ZnS/ZnSe as a gate insulator stack for an InGaAs-based metal–oxide–semiconductor (MOS) device, and demonstrates the threshold voltage shift required in nonvolatile memory devices using a floating gate quantum dot layer. An InGaAs-based nonvolatile memory MOS device was fabricated using a high-κ II–VI tunnel insulator stack and self-assembled GeO x -cladded Ge quantum dots as the charge storage units. A Si3N4 layer was used as the control gate insulator. Capacitance–voltage data showed that, after applying a positive voltage to the gate of a MOS device, charges were being stored in the quantum dots. This was shown by the shift in the flat-band/threshold voltage, simulating the write process of a nonvolatile memory device.  相似文献   
132.
As displays become less expensive and are incorporated into more and more devices, there has been an increased focus on image resizing techniques to fill an image to an arbitrary screen size. Traditional methods such as cropping or resampling can introduce undesirable losses in information or distortion in perception. Recently, content-aware image retargeting methods have been proposed (Avidan and Shamir, ACM Trans Graphics 26(3), 2007; Guo et al., IEEE Trans Multimedia 11(5):856–867, 2009; Shamir and Avidan, Commun ACM 52(1), 2009; Simakov et al. 2008; Wolf et al. 2007), which produce exceptional results. In particular, seam carving, proposed by Avidan and Shamir, has gained attention as an effective solution. However, there are many cases where it can fail. In this paper we propose a distortion-sensitive seam carving algorithm for content-aware image resizing that improves edge preservation and decreases aliasing artifacts. In the proposed approach, we use local gradient information along with a thresholding technique to guide the seam selection process and provide a mechanism to halt seam carving when further processing would introduce unacceptable visual distortion in the resized image. Furthermore, anti-aliasing filter is used to reduce the aliasing artifacts caused by seam removal. Experiments have demonstrated superior performance over the current seam carving methods.  相似文献   
133.
The penetration of boron into and through the gate oxides of PMOS devices which employ p+ doped polysilicon gates is studied. Boron penetration results in large positive shifts in VFB , increased PMOS subthreshold slope and electron trapping rate, and decreased low-field mobility and interface trap density. Fluorine-related effects caused by BF2 implantations into the polysilicon gate are shown to result in PMOS threshold voltage instabilities. Inclusion of a phosphorus co-implant or TiSi2 salicide prior to gate implantation is shown to minimize this effect. The boron penetration phenomenon is modeled by a very shallow, fully-depleted p-type layer in the silicon substrate close to the SiO 2/Si interface  相似文献   
134.
Monolithic integration of a monitoring detector with an optical amplifier simplifies the use of an amplifier in lightwave systems. The structure and performance are described of a monolithically integrated semiconductor optical amplifier with low-loss Y-branching waveguides and a monitoring p-i-n detector. The photocurrent of the integrated detector can be used as a single control parameter for amplifier output leveling, gain optimization, and in situ monitoring of facet antireflective coatings  相似文献   
135.
Using the Foreman effective mass Hamiltonian, the electronic structure of the valence band and the interband dipole matrix elements in In/sub x/Ga/sub 1-x/As-In/sub y/Ga/sub 1-y/As/sub z/P/sub 1-z/ quantum-well optical amplifiers are calculated, taking into account the valence band mixing and the biaxial strain. The optical field of the amplified pulse is calculated by solving the wave equation with the computed polarization as a source term. A novel wavelet transform is introduced in analyzing the pulse chirp imposed by the optical amplifier. In the linear propagation regime, the spectrum of the amplified pulse can be either red-shifted or blue-shifted with respect to its initial center frequency, depending on the local gain dispersion spanned by the pulse spectrum. The output pulse shape can be retarded or advanced, depending on the local gain and group velocity dispersion. Furthermore, an initially unchirped pulse centered in the tail of the gain spectrum is significantly reshaped after propagating 600 /spl mu/m, and its spectrum is broadened and distorted considerably. In the spectral region where both gain and group velocity change rapidly, the frequency chirp for a linearly chirped input pulse is significantly weakened after propagation.  相似文献   
136.
137.
We present herein a decoupled multiuser acquisition (DEMA) algorithm for code-timing estimation in asynchronous code-division multiple-access (CDMA) communication systems. The DEMA estimator is an asymptotic (for large data samples) maximum-likelihood method that models the channel parameters as deterministic unknowns. By evoking the mild assumption that the transmitted data bits for all users are independently and identically distributed, we show that the multiuser timing estimation problem that usually requires a search over a multidimensional parameter space decouples into a set of noniterative one-dimensional problems. Hence, the proposed algorithm is computationally efficient. DEMA has the desired property that, in the absence of noise, it obtains the exact parameter estimates even with a finite number of data samples which can be heavily correlated. Another important feature of DEMA is that it exploits the structure of the receiver vectors and, therefore, is near-far resistant. Numerical examples are included to demonstrate and compare the performances of DEMA and a few other standard code-timing estimators  相似文献   
138.
This paper discusses research on scalable VLSI implementations of feed-forward and recurrent neural networks. These two families of networks are useful in a wide variety of important applications—classification tasks for feed-forward nets and optimization problems for recurrent nets—but their differences affect the way they should be built. We find that analog computation with digitally programmable weights works best for feed-forward networks, while stochastic processing takes advantage of the integrative nature of recurrent networks. We have shown early prototypes of these networks which compute at rates of 1–2 billion connections per second. These general-purpose neural building blocks can be coupled with an overall data transmission framework that is electronically reconfigured in a local manner to produce arbitrarily large, fault-tolerant networks.  相似文献   
139.
140.
We investigate the inherent scalability problem of ad hoc networks originated from the nature of multihop networks. First, the expected packet traffic at the center of a network is analyzed. The result shows that the expected packet traffic at the center of a network is linearly related with the network size, that is, the expected packet traffic at the center of a network is O(k), where k is the radius of a network. From the result, the upper bound of the diameter of a network D=2k, that guarantees the network is scalable, is obtained. The upper bound is given by C/r-1, where C is the channel capacity available to each node and r is the packet arrival rate at each node.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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