全文获取类型
收费全文 | 4155篇 |
免费 | 468篇 |
国内免费 | 332篇 |
专业分类
电工技术 | 93篇 |
技术理论 | 1篇 |
综合类 | 338篇 |
化学工业 | 83篇 |
金属工艺 | 13篇 |
机械仪表 | 85篇 |
建筑科学 | 142篇 |
矿业工程 | 27篇 |
能源动力 | 35篇 |
轻工业 | 34篇 |
水利工程 | 36篇 |
石油天然气 | 40篇 |
武器工业 | 20篇 |
无线电 | 663篇 |
一般工业技术 | 256篇 |
冶金工业 | 230篇 |
原子能技术 | 21篇 |
自动化技术 | 2838篇 |
出版年
2024年 | 16篇 |
2023年 | 29篇 |
2022年 | 53篇 |
2021年 | 72篇 |
2020年 | 78篇 |
2019年 | 91篇 |
2018年 | 93篇 |
2017年 | 118篇 |
2016年 | 137篇 |
2015年 | 126篇 |
2014年 | 207篇 |
2013年 | 295篇 |
2012年 | 250篇 |
2011年 | 332篇 |
2010年 | 216篇 |
2009年 | 274篇 |
2008年 | 290篇 |
2007年 | 299篇 |
2006年 | 244篇 |
2005年 | 228篇 |
2004年 | 210篇 |
2003年 | 180篇 |
2002年 | 142篇 |
2001年 | 120篇 |
2000年 | 89篇 |
1999年 | 86篇 |
1998年 | 76篇 |
1997年 | 46篇 |
1996年 | 62篇 |
1995年 | 47篇 |
1994年 | 51篇 |
1993年 | 36篇 |
1992年 | 37篇 |
1991年 | 30篇 |
1990年 | 21篇 |
1989年 | 16篇 |
1988年 | 15篇 |
1987年 | 7篇 |
1986年 | 6篇 |
1985年 | 21篇 |
1984年 | 24篇 |
1983年 | 25篇 |
1982年 | 26篇 |
1981年 | 21篇 |
1980年 | 25篇 |
1979年 | 30篇 |
1978年 | 10篇 |
1977年 | 6篇 |
1976年 | 12篇 |
1964年 | 5篇 |
排序方式: 共有4955条查询结果,搜索用时 31 毫秒
1.
2.
Private information retrieval(PIR) is an important privacy protection issue of secure multi-party computation, but the PIR protocols based on classical cryptography are vulnerable because of new technologies,such as quantum computing and cloud computing. The quantum private queries(QPQ) protocols available, however, has a high complexity and is inefficient in the face of large database. This paper, based on the QKD technology which is mature now, proposes a novel QPQ protocol utilizing the key dilution and auxiliary parameter. Only N quits are required to be sent in the quantum channel to generate the raw key, then the straight k bits in the raw key are added bitwise to dilute the raw key, and a final key is consequently obtained to encrypt the database. By flexible adjusting of auxiliary parameters θ and k, privacy is secured and the query success ratio is improved. Feasibility and performance analyses indicate that the protocol has a high success ratio in first-trial query and is easy to implement, and that the communication complexity of O(N) is achieved. 相似文献
3.
The pharmacy service requires that some pharmacies are always available and shifts have to be organized: a shift corresponds to a subset of pharmacies that must be open 24 hours a day on a particular week. Under the requirement that each pharmacy belongs to exactly one shift and the assumption that users minimize the distance to the closest open pharmacy during each shift, we want to determine a partition of the pharmacies into a given number of shifts, such that the total distance covered by users is minimized. It may be also required that shift cardinalities are balanced. We discuss different versions and the related computational complexity, showing that the problem is NP-hard in general. A set packing formulation is presented and solved by branch-and-price, together with a fast solution technique based on a tabu search. They have been applied to real and random instances showing that (i) the set packing formulation is very tight and often exhibits no integrality gap; (ii) the branch-and-price solves problems of practical relevance to optimality in a reasonable amount of time (order of minutes); (iii) the tabu search finds optimal or near-optimal solutions in order of seconds. 相似文献
4.
5.
The present study investigates the impact of different key solutions of mobile phones on users' effectiveness and efficiency using the devices. In the first experiment, 36 children (9 - 14 years) and in the second experiment 45 young adults (19 - 33 years) completed four common phone tasks twice consecutively on three simulated phones that had identical menus, but different key solutions. An approach was undertaken to quantify the complexity of keys in three models, incorporating different factors contributing to the keys' complexity (number of key options, number of modes and number of modes with a semantically dissimilar meaning), in order to predict users' performance decrements. As a further main factor, the degree of the users' locus of control (LOC) was measured and interactions with performance outcomes were studied. As dependent measures, the number of inefficient keystrokes, the number of tasks solved and the processing time were determined. Results showed a significant effect of control key solutions on users' efficiency and effectiveness for both children and young adults. Moreover, children's LOC values significantly interacted with performance: children with low LOC values showed the lowest performance and no learnability, especially when using keys with a high complexity. From the three factors contributing to the complexity of keys, keys exerting different functions with semantically inconsistent meanings had the worst effect on performance. It is concluded that in mobile user interface design keys with semantically inconsistent meanings should be generally avoided. 相似文献
6.
A General Role for Early Onset Cues and Intra-Event Learning; Comment on McDonald and Siegel (2004).
Research on classical conditioning with drug unconditional stimuli has had a profound effect on the understanding of general conditioning processes. The experiment reported by R. V. McDonald and S. Siegel (see record 2004-10475-001) demonstrates that cues coincident with the onset of an event can become associated with the rest of the event. This sort of learning is probably ubiquitous and has been proposed as a mechanism behind the development of panic disorder, in which interoceptive cues coincident with the start of a panic attack can be associated with the rest of the attack and can eventually come to elicit full-blown panic on their own. Evidence that extinction exposure to early onset cues can reduce their power is especially important. Drug conditioning research continues to provide a powerful testing ground for important general principles of learning. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
7.
Recent years have witnessed a rapid growth of interest in the study of the dynamic behavior of replenishment rules of bullwhip effect. We prove that bullwhip effect and butterfly effect share a same the self-oscillation amplifying mechanism that is the ordering decisions the supplier self-oscillation amplify the perturbations brought by the errors in the processing of retailers' demand information. This results as an explicit self-similar structure of the sensitivity of the system to the initial values duty to the nonlinear mechanism. In this paper, the causes process of the bullwhip effect is described as the internal nonlinear mechanism and study on the complexity of bullwhip effect for order-up-to policy under demand signal processing. The methodology is based on fractal and chaotic theory and allows important insights to be gained about the complexity behavior of bullwhip effect. 相似文献
8.
Moshe Koppel 《Machine Learning》1991,7(1):85-99
In this article we present an algorithm that learns to predict non-deterministically generated strings. The problem of learning to predict non-deterministically generated strings was raised by Dietterich and Michalski (1986). While their objective was to give heuristic techniques that could be used to rapidly and effectively learn to predict a somewhat limited class of strings, our objective is to give an algorithm which, though impractical, is capable of learning to predict a very general class. Our algorithm is meant to provide a general framework within which heuristic techniques can be effectively employed. 相似文献
9.
The Label-Cover problem, defined by S. Arora, L. Babai, J. Stern, Z. Sweedyk [Proceedings of 34th IEEE Symposium on Foundations of Computer Science, 1993, pp. 724-733], serves as a starting point for numerous hardness of approximation reductions. It is one of six ‘canonical’ approximation problems in the survey of Arora and Lund [Hardness of Approximations, in: Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, 1996, Chapter 10]. In this paper we present a direct combinatorial reduction from low error-probability PCP [Proceedings of 31st ACM Symposium on Theory of Computing, 1999, pp. 29-40] to Label-Cover showing it NP-hard to approximate to within 2(logn)1−o(1). This improves upon the best previous hardness of approximation results known for this problem.We also consider the Minimum-Monotone-Satisfying-Assignment (MMSA) problem of finding a satisfying assignment to a monotone formula with the least number of 1's, introduced by M. Alekhnovich, S. Buss, S. Moran, T. Pitassi [Minimum propositional proof length is NP-hard to linearly approximate, 1998]. We define a hierarchy of approximation problems obtained by restricting the number of alternations of the monotone formula. This hierarchy turns out to be equivalent to an AND/OR scheduling hierarchy suggested by M.H. Goldwasser, R. Motwani [Lecture Notes in Comput. Sci., Vol. 1272, Springer-Verlag, 1997, pp. 307-320]. We show some hardness results for certain levels in this hierarchy, and place Label-Cover between levels 3 and 4. This partially answers an open problem from M.H. Goldwasser, R. Motwani regarding the precise complexity of each level in the hierarchy, and the place of Label-Cover in it. 相似文献
10.
We study the computational complexity of the qualitative algebra which is a temporal constraint formalism that combines the point algebra, the point-interval algebra and Allen's interval algebra. We identify all tractable fragments and show that every other fragment is NP-complete. 相似文献