全文获取类型
收费全文 | 20351篇 |
免费 | 1945篇 |
国内免费 | 1607篇 |
学科分类
工业技术 | 23903篇 |
出版年
2024年 | 109篇 |
2023年 | 215篇 |
2022年 | 396篇 |
2021年 | 412篇 |
2020年 | 506篇 |
2019年 | 506篇 |
2018年 | 453篇 |
2017年 | 691篇 |
2016年 | 754篇 |
2015年 | 912篇 |
2014年 | 1194篇 |
2013年 | 1325篇 |
2012年 | 1290篇 |
2011年 | 1465篇 |
2010年 | 1157篇 |
2009年 | 1350篇 |
2008年 | 1461篇 |
2007年 | 1520篇 |
2006年 | 1380篇 |
2005年 | 1175篇 |
2004年 | 966篇 |
2003年 | 872篇 |
2002年 | 665篇 |
2001年 | 572篇 |
2000年 | 467篇 |
1999年 | 403篇 |
1998年 | 348篇 |
1997年 | 281篇 |
1996年 | 215篇 |
1995年 | 186篇 |
1994年 | 141篇 |
1993年 | 105篇 |
1992年 | 67篇 |
1991年 | 54篇 |
1990年 | 39篇 |
1989年 | 54篇 |
1988年 | 32篇 |
1987年 | 17篇 |
1986年 | 16篇 |
1985年 | 20篇 |
1984年 | 10篇 |
1983年 | 14篇 |
1982年 | 15篇 |
1981年 | 16篇 |
1980年 | 15篇 |
1979年 | 6篇 |
1978年 | 7篇 |
1977年 | 6篇 |
1976年 | 5篇 |
1975年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
1.
带关键字搜索的公钥加密(PEKS)是一种有用的加密原语,它允许用户将在加密数据上搜索的功能委托给不可信的第三方服务器,而不影响原始数据的安全性和隐私性。但是,由于缺乏对于数据的加密以及解密能力,PEKS方案不能单独进行使用,必须与标准的公钥加密方案(PKE)相结合。因此,Baek等人在2006年引入了一种新的加密原语,称为结合PKE和PEKS的加密方案(PKE+PEKS),它同时提供了PKE和PEKS的功能。目前,已有文献提出了几种PKE+PEKS方案。然而,他们都没有考虑关键字猜测攻击的问题。本文提出一个新的高效且能够抵抗关键字猜测攻击的PKE+PEKS方案,与已有方案相比,该方案在性能上有很大的提升,并且在生成关键字和数据密文时,不需要使用双线性对,极大地降低了计算和存储成本。安全性分析表明,本文中所提出的方案能够满足密文隐私安全性、陷门不可区分性和抗关键字猜测攻击的安全性。效率分析表明,本分提出的方案更加高效。 相似文献
2.
3.
陈国龙 《计算机辅助设计与图形学学报》1994,6(2):136-142
本文介绍了一种在微机上实现的印制板自动布线方法──多级线探索法及其编程方法。这种方法是基于完备布线算法的概念,通过分析李氏算法和传统线探索法的不足之处而得到的。虽然它也是一种线探索法,但有较传统线探索法更强的探索能力,不需要结合李氏算法而能单独完成布线任务,是一种较理想的算法,通过实验获得了较为满意的效果。 相似文献
4.
Martin T. P. Azvine B. 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2003,8(2):93-101
With the burgeoning complexity and capabilities of modern information appliances and services, user modelling is becoming an increasingly important research area. Simple user profiles already personalise many software products and consumer goods such as digital TV recorders and mobile phones. A user model should be easy to initialise, and it must adapt in the light of interaction with the user. In many cases, a large amount of training data is needed to generate a user model, and adaptation is equivalent to retraining the system. This paper briefly outlines the user modelling problem and work done at BTexact on an intelligent personal assistant (IPA) which incorporates a user profile. We go on to describe FILUM, a more flexible method of user modelling, and show its application to the telephone assistant and email assistant components of the IPA, with tests to illustrate its usefulness. 相似文献
5.
An efficient algorithm for the random packing of spheres can significantly save the cost of the preparation of an initial configuration often required in discrete element simulations. It is not trivial to generate such random packing at a large scale, particularly when spheres of various sizes and geometric domains of different shapes are present. Motivated by the idea of compression complemented by an efficient physical process to increase packing density, shaking, a new approach, termed compression algorithm, is proposed in this work to randomly fill any arbitrary polyhedral or cylindrical domains with spheres of various sizes. The algorithm features both simplicity and high efficiency. Tests show that it takes 181 s on a 1.4-GHz PC to complete the filling of a cylindrical domain with a total number of 26,787 spheres, achieving a packing density of 52.89%. 相似文献
6.
R. A. Borzooei M. Bakhshi M. Mashinchi 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2008,12(8):739-749
In this paper, we study the lattice structure of some fuzzy algebraic systems such as (G-)fuzzy groups, some fuzzy ordered
algebras and fuzzy hyperstructures. We prove that under suitable conditions, these structures form a distributive or modular
lattice.
This research partially is supported by the “ Fuzzy Systems and its Applications Center of Excelence, Shahid Bahonar University
of Kerman, Iran”. 相似文献
7.
Across 2 experiments, a new experimental procedure was used to investigate attentional capture by animal fear-relevant stimuli. In Experiment 1 (N = 34), unselected participants were slower to detect a neutral target animal in the presence of a spider than a cockroach distractor and in the presence of a snake than a large lizard distractor. This result confirms that phylogenetically fear-relevant animals capture attention specifically and to a larger extent than do non-fear-relevant animals. In Experiment 2 (N = 86), detection of a neutral target animal was slowed more in the presence of a feared fear-relevant distractor (e.g., a snake for snake-fearful participants) than in presence of a not-feared fear-relevant distractor (e.g., a spider for snake-fearful participants). These results indicate preferential attentional capture that is specific to phylogenetically fear-relevant stimuli and is selectively enhanced in individuals who fear these animals. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
8.
J. L. Díez J. L. Navarro A. Sala 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2007,11(10):973-983
In this work, simple modifications on the cost index of particular local-model fuzzy clustering algorithms are proposed in
order to improve the readability of the resulting models. The final goal is simultaneously providing local linear models (reasonably
close to the plant’s Jacobian) and clustering in the input space so that desirable characteristics (regarding final model
accuracy, and convexity and smoothness of the cluster membership functions) are improved with respect to other proposals in
literature. Some examples illustrate the proposed approach. 相似文献
9.
This study examined whether objects are attended in serial or in parallel during a demanding visual search task. A component of the event-related potential waveform, the N2pc wave, was used as a continuous measure of the allocation of attention to possible targets in the search arrays. Experiment 1 demonstrated that the relative allocation of attention shifts rapidly, favoring one item and then another. In Experiment 2, a paradigm was used that made it possible to track the absolute allocation of attention to individual items. This experiment showed that attention was allocated to one object for 100-150 ms before attention began to be allocated to the next object. These findings support models of attention that posit serial processing in demanding visual search tasks. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
10.
Attempts have been made to extend SQL to work with multimedia databases. We are reserved on the representation ability of extended SQL to cope with the richness in content of multimedia data. In this paper we present an example of a multimedia database system, Computer Aided Facial Image Inference and Retrieval system (CAFIIR). The system stores and manages facial images and criminal records, providing necessary functions for crime identification. We would like to demonstrate some core techniques for multimedia database with CAFIIR system. Firstly, CAFIIR is a integrated system. Besides database management, there are image analysis, image composition, image aging, and report generation subsystems, providing means for problem solving. Secondly, the richness of multimedia data urges feature-based database for their management. CAFIIR is feature-based. A indexing mechanism,iconic index, has been proposed for indexing facial images using hierarchical self-organization neural network. The indexing method operates on complex feature measures and provides means for visual navigation. Thirdly, special retrieval methods for facial images have been developed, including visual browsing, similarity retrieval, free text retrieval and fuzzy retrieval. 相似文献