首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   21484篇
  免费   2866篇
  国内免费   1923篇
电工技术   724篇
综合类   1326篇
化学工业   578篇
金属工艺   521篇
机械仪表   1677篇
建筑科学   412篇
矿业工程   264篇
能源动力   259篇
轻工业   415篇
水利工程   78篇
石油天然气   445篇
武器工业   282篇
无线电   4857篇
一般工业技术   1461篇
冶金工业   264篇
原子能技术   136篇
自动化技术   12574篇
  2024年   56篇
  2023年   259篇
  2022年   488篇
  2021年   618篇
  2020年   615篇
  2019年   505篇
  2018年   522篇
  2017年   727篇
  2016年   900篇
  2015年   966篇
  2014年   1442篇
  2013年   1263篇
  2012年   1481篇
  2011年   1617篇
  2010年   1373篇
  2009年   1412篇
  2008年   1431篇
  2007年   1598篇
  2006年   1415篇
  2005年   1263篇
  2004年   1061篇
  2003年   1032篇
  2002年   775篇
  2001年   571篇
  2000年   485篇
  1999年   438篇
  1998年   386篇
  1997年   337篇
  1996年   219篇
  1995年   182篇
  1994年   145篇
  1993年   103篇
  1992年   81篇
  1991年   59篇
  1990年   58篇
  1989年   47篇
  1988年   43篇
  1987年   16篇
  1986年   29篇
  1985年   40篇
  1984年   36篇
  1983年   45篇
  1982年   26篇
  1981年   31篇
  1980年   19篇
  1979年   17篇
  1978年   13篇
  1977年   6篇
  1976年   8篇
  1973年   5篇
排序方式: 共有10000条查询结果,搜索用时 265 毫秒
1.
Aggregate question answering essentially returns answers for given questions by obtaining query graphs with unique dependencies between values and corresponding objects. Word order dependency, as the key to uniquely identify dependency of the query graph, reflects the dependencies between the words in the question. However, due to the semantic gap caused by the expression difference between questions encoded with word vectors and query graphs represented with logical formal elements, it is not trivial to match the correct query graph for the question. Most existing approaches design more expressive query graphs for complex questions and rank them just by directly calculating their similarities, ignoring the semantic gap between them. In this paper, we propose a novel Structure-sensitive Semantic Matching(SSM) approach that learns aligned representations of dependencies in questions and query graphs to eliminate their gap. First, we propose a cross-structure matching module to bridge the gap between two modalities(i.e., textual question and query graph). Then, we propose an entropy-based gated AQG filter to remove the structural noise caused by the uncertainty of dependencies. Finally, we present a two-channel query graph representation that fuses the semantics of abstract structure and grounding content of the query graph explicitly. Experimental results show that SSM could learn aligned representations of questions and query graphs to eliminate the gaps between their dependencies, and improves up to 12% (F1 score) on aggregation questions of two benchmark datasets.  相似文献   
2.
To save bandwidth and storage space as well as speed up data transmission, people usually perform lossy compression on images. Although the JPEG standard is a simple and effective compression method, it usually introduces various visually unpleasing artifacts, especially the notorious blocking artifacts. In recent years, deep convolutional neural networks (CNNs) have seen remarkable development in compression artifacts reduction. Despite the excellent performance, most deep CNNs suffer from heavy computation due to very deep and wide architectures. In this paper, we propose an enhanced wide-activated residual network (EWARN) for efficient and accurate image deblocking. Specifically, we propose an enhanced wide-activated residual block (EWARB) as basic construction module. Our EWARB gives rise to larger activation width, better use of interdependencies among channels, and more informative and discriminative non-linearity activation features without more parameters than residual block (RB) and wide-activated residual block (WARB). Furthermore, we introduce an overlapping patches extraction and combination (OPEC) strategy into our network in a full convolution way, leading to large receptive field, enforced compatibility among adjacent blocks, and efficient deblocking. Extensive experiments demonstrate that our EWARN outperforms several state-of-the-art methods quantitatively and qualitatively with relatively small model size and less running time, achieving a good trade-off between performance and complexity.  相似文献   
3.
Face aging (FA) for young faces refers to rendering the aging faces at target age for an individual, generally under 20s, which is an important topic of facial age analysis. Unlike traditional FA for adults, it is challenging to age children with one deep learning-based FA network, since there are deformations of facial shapes and variations of textural details. To alleviate the deficiency, a unified FA framework for young faces is proposed, which consists of two decoupled networks to apply aging image translation. It explicitly models transformations of geometry and appearance using two components: GD-GAN, which simulates the Geometric Deformation using Generative Adversarial Network; TV-GAN, which simulates the Textural Variations guided by the age-related saliency map. Extensive experiments demonstrate that our method has advantages over the state-of-the-art methods in terms of synthesizing visually plausible images for young faces, as well as preserving the personalized features.  相似文献   
4.
This paper introduces the design of a hardware efficient reconfigurable pseudorandom number generator (PRNG) using two different feedback controllers based four-dimensional (4D) hyperchaotic systems i.e. Hyperchaotic-1 and -2 to provide confidentiality for digital images. The parameter's value of these two hyperchaotic systems is set to be a specific value to get the benefits i.e. all the multiplications (except a few multiplications) are performed using hardwired shifting operations rather than the binary multiplications, which doesn't utilize any hardware resource. The ordinary differential equations (ODEs) of these two systems have been exploited to build a generic architecture that fits in a single architecture. The proposed architecture provides an opportunity to switch between two different 4D hyperchaotic systems depending on the required behavior. To ensure the security strength, that can be also used in the encryption process in which encrypt the input data up to two times successively, each time using a different PRNG configuration. The proposed reconfigurable PRNG has been designed using Verilog HDL, synthesized on the Xilinx tool using the Virtex-5 (XC5VLX50T) and Zynq (XC7Z045) FPGA, its analysis has been done using Matlab tool. It has been found that the proposed architecture of PRNG has the best hardware performance and good statistical properties as it passes all fifteen NIST statistical benchmark tests while it can operate at 79.101-MHz or 1898.424-Mbps and utilize only 0.036 %, 0.23 %, and 1.77 % from the Zynq (XC7Z045) FPGA's slice registers, slice LUTs, and DSP blocks respectively. Utilizing these PRNGs, we design two 16 × 16 substitution boxes (S-boxes). The proposed S-boxes fulfill the following criteria: Bijective, Balanced, Non-linearity, Dynamic Distance, Strict Avalanche Criterion (SAC) and BIC non-linearity criterion. To demonstrate these PRNGs and S-boxes, a new three different scheme of image encryption algorithms have been developed: a) Encryption using S-box-1, b) Encryption using S-box-2 and, c) Two times encryption using S-box-1 and S-box-2. To demonstrate that the proposed cryptosystem is highly secure, we perform the security analysis (in terms of the correlation coefficient, key space, NPCR, UACI, information entropy and image encryption quantitatively in terms of (MSE, PSNR and SSIM)).  相似文献   
5.
概述了侧围加强内框总成与周边零件的匹配关系,从检具操作的人机工程出发,描述了侧围加强内框总成检具的2种定位方式和结构设计,对比了2种定位方式对于检测结果的影响,总结了其优点和弊端,结果表明侧围加强内框总成检具采用车内方向朝下的定位方式效果更好。  相似文献   
6.
为了探讨在安卓平台上构建医用图像采集系统的开发个案,分析通过以智能手机、平板电脑为核心安卓设备通过拍照获得化验单数据后进行文本识别并提交智慧医疗系统的解决方案。本文首先通过二值化算法形成低阈值图像数据,使用卷积神经元网络算法对文本进行逐一识别,使用K-means算法对识别后的单字文本进行字段记录值的整合并形成元数据库服务于其他智慧医疗系统模块。在使用9000组数据对神经元网络进行前期训练的前提下,该系统的识别准确率达到了99.5%以上。本系统具有一定的可行性,对未来智慧医疗的系统开发有实践意义。  相似文献   
7.
Multi-channel and single-channel image denoising are on two important development fronts. Integrating multi-channel and single-channel image denoisers for further improvement is a valuable research direction. A natural assumption is that using more useful information is helpful to the output results. In this paper, a novel multi-channel and single-channel fusion paradigm (MSF) is proposed. The proposed MSF works by fusing the estimates of a multi-channel image denoiser and a single-channel image denoiser. The performance of recent multi-channel image denoising methods involved in the proposed MSF can be further improved at low additional time-consuming cost. Specifically, the validity principle of the proposed MSF is that the fused single-channel image denoiser can produce auxiliary estimate for the involved multi-channel image denoiser in a designed underdetermined transform domain. Based on the underdetermined transformation, we create a corresponding orthogonal transformation for fusion and better restore the multi-channel images. The quantitative and visual comparison results demonstrate that the proposed MSF can be effectively applied to several state-of-the-art multi-channel image denoising methods.  相似文献   
8.
9.
10.
A method is proposed to generate categorical colour observer functions (individual colour matching functions) for any field size based on the CIE 2006 system of physiological observer functions. The method combines proposed categorical observer techniques of Sarkar et al with a physiologically-based individual observer model of Asano et al and a clustering technique to produce the optimal set of categorical observers. The number of required categorical observers varies depending on an application with as many as 50 required to predict individual observers' matches when a laser projector is viewed. However, 10 categorical observers are sufficient to represent colour-normal populations for personalized colour imaging. The proposed and recommended categorical observers represent a robust and inclusive technique to examine and quantify observer metamerism in any application of colorimetry.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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