全文获取类型
收费全文 | 3630篇 |
免费 | 461篇 |
国内免费 | 96篇 |
专业分类
电工技术 | 178篇 |
综合类 | 191篇 |
化学工业 | 705篇 |
金属工艺 | 212篇 |
机械仪表 | 201篇 |
建筑科学 | 199篇 |
矿业工程 | 41篇 |
能源动力 | 126篇 |
轻工业 | 506篇 |
水利工程 | 48篇 |
石油天然气 | 126篇 |
武器工业 | 10篇 |
无线电 | 401篇 |
一般工业技术 | 633篇 |
冶金工业 | 161篇 |
原子能技术 | 57篇 |
自动化技术 | 392篇 |
出版年
2024年 | 33篇 |
2023年 | 116篇 |
2022年 | 194篇 |
2021年 | 264篇 |
2020年 | 185篇 |
2019年 | 157篇 |
2018年 | 183篇 |
2017年 | 208篇 |
2016年 | 151篇 |
2015年 | 159篇 |
2014年 | 212篇 |
2013年 | 273篇 |
2012年 | 259篇 |
2011年 | 260篇 |
2010年 | 185篇 |
2009年 | 206篇 |
2008年 | 159篇 |
2007年 | 122篇 |
2006年 | 131篇 |
2005年 | 90篇 |
2004年 | 56篇 |
2003年 | 56篇 |
2002年 | 51篇 |
2001年 | 44篇 |
2000年 | 42篇 |
1999年 | 34篇 |
1998年 | 61篇 |
1997年 | 55篇 |
1996年 | 44篇 |
1995年 | 29篇 |
1994年 | 28篇 |
1993年 | 22篇 |
1992年 | 20篇 |
1991年 | 12篇 |
1990年 | 16篇 |
1989年 | 9篇 |
1988年 | 6篇 |
1987年 | 9篇 |
1986年 | 2篇 |
1985年 | 7篇 |
1984年 | 5篇 |
1983年 | 3篇 |
1981年 | 3篇 |
1980年 | 6篇 |
1978年 | 3篇 |
1977年 | 3篇 |
1976年 | 3篇 |
1974年 | 4篇 |
1951年 | 2篇 |
1944年 | 1篇 |
排序方式: 共有4187条查询结果,搜索用时 469 毫秒
71.
高校教学质量的评价是一个多因素、多变量、模糊的非线性过程。文章运用BP神经网络建立了教学质量评价的数学模型,通过matlab神经网络工具箱学习训练网络,并经测试数据验证。结果表明,基于BP神经网络建立的教学质量评价模型,克服了评价中主观因素的影响,得到了较满意的评价结果,具有广泛的应用前景。 相似文献
72.
Qingqi Hong Yan Li Qingde Li Beizhan Wang Junfeng Yao Qingqiang Wu Yingying She 《The Visual computer》2016,32(10):1251-1262
Due to the high complexity of vascular system network, the geometry reconstruction of vasculatures from raw medical datasets remains a very challenging task. In this paper, we present a novel skeleton-based method for the geometry reconstruction of vascular structures from standard 3D medical datasets. With the proposed techniques, the geometry of vascular structures with high level of smoothness and accuracy can be reconstructed from the raw medical datasets. The experimental results and comparison with other techniques demonstrate that our method can achieve faithful and smooth vascular structures. In addition, quantitative validation has been conducted to evaluate the accuracy and smoothness of the reconstructed vessel geometry based on the proposed method. 相似文献
73.
Hao Chen Juan He Raymond Lanzafame Istvan Stadler Hamid El Hamidi Hui Liu Jonathan Celli Michael R. Hamblin Yingying Huang Emily Oakley Gal Shafirstein Ho‐Kyoon Chung Shin‐Tson Wu Yajie Dong 《Journal of the Society for Information Display》2017,25(3):177-184
While OLEDs have struggled to find a niche lighting application that can fully take advantage of their unique form factors as thin, flexible, lightweight and uniformly large‐area luminaire, photomedical researchers have been in search of low‐cost, effective illumination devices with such form factors that could facilitate widespread clinical applications of photodynamic therapy (PDT) or photobiomodulation (PBM). Although existing OLEDs with either fluorescent or phosphorescent emitters cannot achieve the required high power density at the right wavelength windows for photomedicine, the recently developed ultrabright and efficient deep red quantum dot light emitting devices (QLEDs) can nicely fit into this niche. Here, we report for the first time the in‐vitro study to demonstrate that this QLED‐based photomedical approach could increase cell metabolism over control systems for PBM and kill cancerous cells efficiently for PDT. The perspective of developing wavelength‐specific, flexible QLEDs for two critical photomedical fields (wound repair and cancer treatment) will be presented with their potential impacts summarized. The work promises to generate flexible QLED‐based light sources that could enable the widespread use and clinical acceptance of photomedical strategies including PDT and PBM. 相似文献
74.
基于内容的体育视频分类是高效管理大量体育视频数据的关键步骤之一,为提高体育视频分类方法的正确率及泛化能力,提出一种基于类型标志镜头与视觉词袋模型相结合的体育视频分类方法.首先给出类型标志镜头的定义,并通过类型标志镜头构建该镜头视频帧训练库;然后构建基于视频帧训练库的金字塔视觉词袋模型,将视频帧标志为归一化的词频向量,使用SVM对视频帧进行分类;再通过分析视频帧分类错误的原因及表现形式提出基于时序连续性孤立帧去除算法,以消除视频帧的错误归类.由于体育视频按组合类型可分为单一体育视频与混合体育视频,因此分别提出了单一体育视频及混合体育视频2种分类算法.实验结果表明,文中算法具有实现简单、处理速度快和准确度高的优点. 相似文献
75.
介绍一种本征型强度调制绞合式光纤应变传感器,分析了该传感器的应变传感原理。理论与实验均表明,该传感器既能测量拉应变,又能测量压应变,对应变的响应具有良好的线性和重复性、灵敏度高、无迟滞现象。 相似文献
76.
Efficient Algorithms for Image Template and Dictionary Matching 总被引:3,自引:0,他引:3
Sung-Hyuk Cha 《Journal of Mathematical Imaging and Vision》2000,12(1):81-90
Given a large text image and a small template image, the Template Matching Problem is that of finding every location within the text which looks like the pattern. This problem, which has received attention for low-level image processing, has been formalized by defining a distance metric between arrays of pixels and finding all subarrays of the large image which are within some threshold distance of the template. These so-called metric methods tends to be too slow for many applications, since evaluating the distance function can take too much time. We present a method for quickly eliminating most positions of the text from consideration as possible matches. The remaining candidate positions are then evaluated one by one against the template for a match. We are still guaranteed to find all matching positions, and our method gives significant speed-ups. Finally, we consider the problem of matching a dictionary of templates against a text. We present methods which are much faster than matching the templates individually against the input image. 相似文献
77.
78.
Maximum Likelihood Sound Source Localization and Beamforming for Directional Microphone Arrays in Distributed Meetings 总被引:1,自引:0,他引:1
In distributed meeting applications, microphone arrays have been widely used to capture superior speech sound and perform speaker localization through sound source localization (SSL) and beamforming. This paper presents a unified maximum likelihood framework of these two techniques, and demonstrates how such a framework can be adapted to create efficient SSL and beamforming algorithms for reverberant rooms and unknown directional patterns of microphones. The proposed method is closely related to steered response power-based algorithms, which are known to work extremely well in real-world environments. We demonstrate the effectiveness of the proposed method on challenging synthetic and real-world datasets, including over six hours of recorded meetings. 相似文献
79.
Moon Hoe Cha 《Computer Physics Communications》2007,176(4):318-325
The NearFar program is a package for carrying out an interactive nearside-farside decomposition of heavy-ion elastic scattering amplitude. The program is implemented in Java to perform numerical operations on the nearside and farside angular distributions. It contains a graphical display interface for the numerical results. A test run has been applied to the elastic scattering at Elab=1503 MeV.
Program summary
Title of program: NearFarCatalogue identifier: ADYP_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADYP_v1_0Program obtainable from: CPC Program Library, Queen's University of Belfast, N. IrelandLicensing provisions: noneComputers: designed for any machine capable of running Java, developed on PC-Pentium-4Operating systems under which the program has been tested: Microsoft Windows XP (Home Edition)Program language used: JavaNumber of bits in a word: 64Memory required to execute with typical data: case dependentNo. of lines in distributed program, including test data, etc.: 3484Number of bytes distributed program, including test data, etc.: 142 051Distribution format: tar.gzOther software required: A Java runtime interpreter, or the Java Development Kit, version 5.0Nature of physical problem: Interactive nearside-farside decomposition of heavy-ion elastic scattering amplitude.Method of solution: The user must supply a external data file or PPSM parameters which calculates theoretical values of the quantities to be decomposed.Typical running time: Problem dependent. In a test run, it is about 35 s on a 2.40 GHz Intel P4-processor machine. 相似文献80.
This paper presents a new parallel computing model, called H-BSP, which adds a hierarchical concept to the BSP(Bulk Synchronous Parallel) computing model. An H-BSP program consists of a number of BSP groups which are dynamically created at run time and executed in a hierarchical fashion. H-BSP allows algorithm designers to develop more efficient algorithms by utilizing processor locality in the program. Based on the distributed memory model, H-BSP provides a group-based programming paradigm and supports Divide & Conquer algorithms efficiently. This paper describes the structure of the H-BSP model, complexity analysis and some examples of H-BSP algorithm. Also presented is the performance characteristics of H-BSP algorithms based on the simulation analysis. Simulation results show that H-BSP takes advantages of processor locality and performs well in low bandwidth networks or in a constant-valence architecture such as 2-dimensional mesh. It is also proved that H-BSP can predict algorithm performance better than BSP, due to its locality-preserving nature. 相似文献