全文获取类型
收费全文 | 14746篇 |
免费 | 2425篇 |
国内免费 | 1587篇 |
专业分类
电工技术 | 1002篇 |
综合类 | 1661篇 |
化学工业 | 333篇 |
金属工艺 | 311篇 |
机械仪表 | 1913篇 |
建筑科学 | 590篇 |
矿业工程 | 353篇 |
能源动力 | 359篇 |
轻工业 | 268篇 |
水利工程 | 116篇 |
石油天然气 | 456篇 |
武器工业 | 318篇 |
无线电 | 2751篇 |
一般工业技术 | 1598篇 |
冶金工业 | 270篇 |
原子能技术 | 55篇 |
自动化技术 | 6404篇 |
出版年
2024年 | 101篇 |
2023年 | 205篇 |
2022年 | 482篇 |
2021年 | 485篇 |
2020年 | 529篇 |
2019年 | 443篇 |
2018年 | 456篇 |
2017年 | 580篇 |
2016年 | 688篇 |
2015年 | 789篇 |
2014年 | 1132篇 |
2013年 | 1010篇 |
2012年 | 1306篇 |
2011年 | 1253篇 |
2010年 | 1096篇 |
2009年 | 1036篇 |
2008年 | 1019篇 |
2007年 | 1119篇 |
2006年 | 910篇 |
2005年 | 767篇 |
2004年 | 578篇 |
2003年 | 519篇 |
2002年 | 386篇 |
2001年 | 316篇 |
2000年 | 262篇 |
1999年 | 223篇 |
1998年 | 178篇 |
1997年 | 165篇 |
1996年 | 124篇 |
1995年 | 99篇 |
1994年 | 92篇 |
1993年 | 61篇 |
1992年 | 58篇 |
1991年 | 38篇 |
1990年 | 42篇 |
1989年 | 45篇 |
1988年 | 30篇 |
1987年 | 14篇 |
1986年 | 12篇 |
1985年 | 14篇 |
1984年 | 17篇 |
1983年 | 18篇 |
1982年 | 12篇 |
1981年 | 9篇 |
1980年 | 4篇 |
1979年 | 9篇 |
1978年 | 7篇 |
1977年 | 5篇 |
1976年 | 7篇 |
1959年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
41.
Certain tasks, such as formal program development and theorem proving, fundamentally rely upon the manipulation of higher-order objects such as functions and predicates. Computing tools intended to assist in performing these tasks are at present inadequate in both the amount of knowledge they contain (i.e., the level of support they provide) and in their ability to learn (i.e., their capacity to enhance that support over time). The application of a relevant machine learning technique—explanation-based generalization (EBG)—has thus far been limited to first-order problem representations. We extend EBG to generalize higher-order values, thereby enabling its application to higher-order problem encodings.Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out. First-order Horn logics (e.g., Prolog) are not, however, well suited to higher-order applications. Instead, we employ Prolog, a higher-order logic programming language, as our basic framework for realizing higher-order EBG. In order to capture the distinction between domain theory and training instance upon which EBG relies, we extend Prolog with the necessity operator of modal logic. We develop a meta-interpreter realizing EBG for the extended language, Prolog, and provide examples of higher-order EBG. 相似文献
42.
Kosta Došen 《Journal of Logic, Language and Information》1992,1(3):173-201
The goal of this paper is to show how modal logic may be conceived as recording the derived rules of a logical system in the system itself. This conception of modal logic was propounded by Dana Scott in the early seventies. Here, similar ideas are pursued in a context less classical than Scott's.First a family of propositional logical systems is considered, which is obtained by gradually adding structural rules to a variant of the nonassociative Lambek calculus. In this family one finds systems that correspond to the associative Lambek calculus, linear logic, relevant logics, BCK logic and intuitionistic logic. Above these basic systems, sequent systems parallel to the basic systems are constructed, which formalize various notions of derived rules for the basic systems. The deduction theorem is provable for the basic systems if, and only if, they are at least as strong as systems corresponding to linear logic, or BCK logic, depending on the language, and their deductive metalogic is not stronger than they are.However, though we do not always have the deduction theorem, we may always obtain a modal analogue of the deduction theorem for conservative modal extensions of the basic systems. Modal postulates which are necessary and sufficient for that are postulates of S4 plus modal postulates which mimic structural rules. For example, the modal postulates which Girard has recently considered in linear logic are necessary and sufficient for the modal analogue of the deduction theorem.All this may lead towards results about functional completeness in categories. When functional completeness, which is analogous to the deduction theorem, fails, we may perhaps envisage a modal analogue of functional completeness in a modal category, of which our original category is a full subcategory. 相似文献
43.
红外弱小目标的匹配方法研究与仿真 总被引:1,自引:0,他引:1
研究红外图像中的目标匹配问题。针对传统的红外图像中目标匹配效果不理想,匹配不准确。当红外图像中是弱小目标时,背景灰度值与目标灰度值非常相近,灰度直方图均衡化无法实现目标与背景的完整分离,导致漏匹配率较高的问题。为提高目标的匹配精度,提出一种形态学预处理的红外目标匹配方法,通过形态学算法提取出图像中的形状信息,利用形状信息将红外图像中的目标与背景完整分离,避免了只依靠灰度图像信息造成的不能完整分离目标与背景带来的漏匹配问题。进行仿真的结果证明,采用的形态学与处理的匹配方法能够完整将目标与背景分离,成功完成目标匹配,取得了满意的结果。 相似文献
44.
以文本类型教学资源为研究对象,在领域知识可拓信息网模型和CELTS-3的基础上,阐述了基于信息元的教学资源组织系统设计与实现过程,包括信息特征元数据描述框架、特征词获取、信息元距离度量、信息元匹配规则以及匹配算法等.该系统通过有限的信息元描述无限的资源,实现了教学资源的高效组织,支持学习过程中资源自动重组. 相似文献
45.
46.
47.
Chengjun Yao Yixun Liu Jianhua Yao Dongxiao Zhuang Jinsong Wu Zhiyong Qin Ying Mao Liangfu Zhou 《Computer methods and programs in biomedicine》2014
Background
Preoperatively acquired diffusion tensor image (DTI) and blood oxygen level dependent (BOLD) have been proved to be effective in providing more anatomical and functional information; however, the brain deformation induced by brain shift and tumor resection severely impairs the correspondence between the image space and the patient space in image-guided neurosurgery.Method
To address the brain deformation, we developed a hybrid non-rigid registration method to register high-field preoperative MRI with low-field intra-operative MRI in order to recover the deformation induced by brain shift and tumor resection. The registered DTI and BOLD are fused with low-field intra-operative MRI for image-guided neurosurgery.Results
The proposed hybrid registration method was evaluated by comparing the landmarks predicted by the hybrid registration method with the landmarks identified in the low-field intra-operative MRI for 10 patients. The prediction error of the hybrid method is 1.92 ± 0.54 mm, and the compensation accuracy is 74.3 ± 5.0%. Compared to the landmarks far from the resection region, those near the resection region demonstrated a higher compensation accuracy (P-value = .003) although these landmarks had larger initial displacements.Conclusions
The proposed hybrid registration method is able to bring preoperatively acquired BOLD and DTI into the operating room and compensate for the deformation to augment low-field intra-operative MRI with rich anatomical and functional information. 相似文献48.
多尺度空间特征提取的脊柱图像拼接算法 总被引:1,自引:0,他引:1
针对脊柱图像视野有限,提出一种基于优化MSFE的脊柱图像自动拼接算法。设计出一种基于尺度因子变化的高斯卷积模板尺寸自适应调整以及双向配对办法;相似性度量采用城市距离;利用RANSAC算法去除错配,从而确定待拼接图像之间的变换参数,最后利用加权平均对图像融合。对实际取得的多幅脊柱图像拼接结果表明该算法具有很好的实时性和鲁棒性。 相似文献
49.
A hierarchical scheme for elastic graph matching applied to hand gesture recognition is proposed. The proposed algorithm exploits the relative discriminatory capabilities of visual features scattered on the images, assigning the corresponding weights to each feature. A boosting algorithm is used to determine the structure of the hierarchy of a given graph. The graph is expressed by annotating the nodes of interest over the target object to form a bunch graph. Three annotation techniques, manual, semi-automatic, and automatic annotation are used to determine the position of the nodes. The scheme and the annotation approaches are applied to explore the hand gesture recognition performance. A number of filter banks are applied to hand gestures images to investigate the effect of using different feature representation approaches. Experimental results show that the hierarchical elastic graph matching (HEGM) approach classified the hand posture with a gesture recognition accuracy of 99.85% when visual features were extracted by utilizing the Histogram of Oriented Gradient (HOG) representation. The results also provide the performance measures from the aspect of recognition accuracy to matching benefits, node positions correlation and consistency on three annotation approaches, showing that the semi-automatic annotation method is more efficient and accurate than the other two methods. 相似文献
50.
《Pattern recognition》2014,47(2):588-602
Fingerprint matching has emerged as an effective tool for human recognition due to the uniqueness, universality and invariability of fingerprints. Many different approaches have been proposed in the literature to determine faithfully if two fingerprint images belong to the same person. Among them, minutiae-based matchers highlight as the most relevant techniques because of their discriminative capabilities, providing precise results. However, performing a fingerprint identification over a large database can be an inefficient task due to the lack of scalability and high computing times of fingerprint matching algorithms.In this paper, we propose a distributed framework for fingerprint matching to tackle large databases in a reasonable time. It provides a general scheme for any kind of matcher, so that its precision is preserved and its time of response can be reduced.To test the proposed system, we conduct an extensive study that involves both synthetic and captured fingerprint databases, which have different characteristics, analyzing the performance of three well-known minutiae-based matchers within the designed framework. With the available hardware resources, our distributed model is able to address up to 400 000 fingerprints in approximately half a second. Additional details are provided at http://sci2s.ugr.es/ParallelMatching. 相似文献