全文获取类型
收费全文 | 3652篇 |
免费 | 289篇 |
国内免费 | 5篇 |
专业分类
电工技术 | 27篇 |
综合类 | 4篇 |
化学工业 | 817篇 |
金属工艺 | 66篇 |
机械仪表 | 88篇 |
建筑科学 | 161篇 |
矿业工程 | 10篇 |
能源动力 | 97篇 |
轻工业 | 498篇 |
水利工程 | 30篇 |
石油天然气 | 6篇 |
无线电 | 307篇 |
一般工业技术 | 757篇 |
冶金工业 | 395篇 |
原子能技术 | 11篇 |
自动化技术 | 672篇 |
出版年
2024年 | 6篇 |
2023年 | 51篇 |
2022年 | 51篇 |
2021年 | 123篇 |
2020年 | 96篇 |
2019年 | 89篇 |
2018年 | 155篇 |
2017年 | 174篇 |
2016年 | 186篇 |
2015年 | 125篇 |
2014年 | 175篇 |
2013年 | 343篇 |
2012年 | 284篇 |
2011年 | 241篇 |
2010年 | 215篇 |
2009年 | 199篇 |
2008年 | 180篇 |
2007年 | 159篇 |
2006年 | 121篇 |
2005年 | 107篇 |
2004年 | 77篇 |
2003年 | 88篇 |
2002年 | 82篇 |
2001年 | 39篇 |
2000年 | 30篇 |
1999年 | 36篇 |
1998年 | 87篇 |
1997年 | 68篇 |
1996年 | 37篇 |
1995年 | 38篇 |
1994年 | 33篇 |
1993年 | 28篇 |
1992年 | 13篇 |
1991年 | 8篇 |
1990年 | 8篇 |
1989年 | 7篇 |
1988年 | 15篇 |
1987年 | 12篇 |
1986年 | 15篇 |
1985年 | 13篇 |
1984年 | 9篇 |
1983年 | 9篇 |
1982年 | 12篇 |
1981年 | 7篇 |
1980年 | 10篇 |
1979年 | 8篇 |
1978年 | 6篇 |
1976年 | 12篇 |
1974年 | 6篇 |
1973年 | 8篇 |
排序方式: 共有3946条查询结果,搜索用时 46 毫秒
61.
Lourenço André Rota Bulò Samuel Rebagliati Nicola Fred Ana L. N. Figueiredo Mário A. T. Pelillo Marcello 《Machine Learning》2015,98(1-2):331-357
Machine Learning - Clustering ensemble methods produce a consensus partition of a set of data points by combining the results of a collection of base clustering algorithms. In the evidence... 相似文献
62.
Bit commitment schemes are at the basis of modern cryptography. Since information-theoretic security is impossible both in the classical and in the quantum regime, we examine computationally secure commitment schemes. In this paper we study worst-case complexity assumptions that imply quantum bit commitment schemes. First, we show that QSZK \({\not\subseteq}\) QMA implies a computationally hiding and statistically binding auxiliary-input quantum commitment scheme. We then extend our result to show that the much weaker assumption QIP \({\not\subseteq}\) QMA (which is weaker than PSPACE \({\not\subseteq}\) PP) implies the existence of auxiliary-input commitment schemes with quantum advice. Finally, to strengthen the plausibility of the separation QSZK \({\not\subseteq}\) QMA, we find a quantum oracle relative to which honest-verifier QSZK is not contained in QCMA, the class of languages that can be verified using a classical proof in quantum polynomial time. 相似文献
63.
André J. Torii Rafael H. Lopez Leandro F. F. Miguel 《Structural and Multidisciplinary Optimization》2016,54(2):289-299
Truss optimization based on the ground structure approach often leads to designs that are too complex for practical purposes. In this paper we present an approach for design complexity control in truss optimization. The approach is based on design complexity measures related to the number of bars (similar to Asadpoure et al. Struct Multidisc Optim 51(2):385–396 2015) and a novel complexity measure related to the number of nodes of the structure. Both complexity measures are continuously differentiable and thus can be used together with gradient based optimization algorithms. The numerical examples show that the proposed approach is able to reduce design complexity, leading to solutions that are more fit for engineering practice. Besides, the examples also indicate that in some cases it is possible to significantly reduce design complexity with little impact on structural performance. Since the complexity measures are non convex, a global gradient based optimization algorithm is employed. Finally, a detailed comparison to a classical approach is presented. 相似文献
64.
André M. Eberle 《International Journal of Parallel, Emergent and Distributed Systems》2016,31(5):405-419
Traditionally, computer programs have been developed using the sequential programming paradigm. With the advent of parallel computing systems, such as multicore processors and distributed environments, the sequential paradigm became a barrier to the utilisation of the available resources, since the program is restricted to a single processing unit. To address this issue, we propose a transparent automatic parallelisation tool with a binary rewriter. The steps of our approach are: the disassembly of the Intel x86 application, its transformation into an intermediary language; the analysis of this intermediary representation to obtain the flow and dependency graphs; the partitioning of the application into parallel units, using the obtained graphs; and, finally, the reassembly of the application back into the original Intel x86 architecture. By transforming the compiled application software, we aim at obtaining a program which can better explore the parallel resources, with no extra effort required from users or developers. 相似文献
65.
Air‐ground Matching: Appearance‐based GPS‐denied Urban Localization of Micro Aerial Vehicles
下载免费PDF全文
![点击此处可从《野外机器人技术杂志》网站下载免费的PDF全文](/ch/ext_images/free.gif)
András L. Majdik Damiano Verda Yves Albers‐Schoenberg Davide Scaramuzza 《野外机器人技术杂志》2015,32(7):1015-1039
In this paper, we address the problem of globally localizing and tracking the pose of a camera‐equipped micro aerial vehicle (MAV) flying in urban streets at low altitudes without GPS. An image‐based global positioning system is introduced to localize the MAV with respect to the surrounding buildings. We propose a novel air‐ground image‐matching algorithm to search the airborne image of the MAV within a ground‐level, geotagged image database. Based on the detected matching image features, we infer the global position of the MAV by back‐projecting the corresponding image points onto a cadastral three‐dimensional city model. Furthermore, we describe an algorithm to track the position of the flying vehicle over several frames and to correct the accumulated drift of the visual odometry whenever a good match is detected between the airborne and the ground‐level images. The proposed approach is tested on a 2 km trajectory with a small quadrocopter flying in the streets of Zurich. Our vision‐based global localization can robustly handle extreme changes in viewpoint, illumination, perceptual aliasing, and over‐season variations, thus outperforming conventional visual place‐recognition approaches. The dataset is made publicly available to the research community. To the best of our knowledge, this is the first work that studies and demonstrates global localization and position tracking of a drone in urban streets with a single onboard camera. 相似文献
66.
This article addresses the output feedback control for discrete‐time Markov jump linear systems. With fully known transition probability, sufficient conditions for an internal model based controller design are obtained. For the case where the transition probabilities are uncertain and belong to a convex polytope with known vertices, we provide a sufficient LMI condition that guarantees the norm of the closed‐loop system is below a prescribed level. That condition can be improved through an iterative procedure. Additionally, we are able to deal with the case of cluster availability of the Markov mode, provided that some system matrices do not vary within a given cluster, an assumption that is suitable to deal with packet dropout models for networked control systems. A numerical example shows the applicability of the design and compares it with previous results. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
67.
Jesús M. Hermida Santiago Meliá Andrés Montoyo Jaime Gómez 《Information Systems Frontiers》2013,15(3):411-431
Business Intelligence (BI) applications have been gradually ported to the Web in search of a global platform for the consumption and publication of data and services. On the Internet, apart from techniques for data/knowledge management, BI Web applications need interfaces with a high level of interoperability (similar to the traditional desktop interfaces) for the visualisation of data/knowledge. In some cases, this has been provided by Rich Internet Applications (RIA). The development of these BI RIAs is a process traditionally performed manually and, given the complexity of the final application, it is a process which might be prone to errors. The application of model-driven engineering techniques can reduce the cost of development and maintenance (in terms of time and resources) of these applications, as they demonstrated by other types of Web applications. In the light of these issues, the paper introduces the Sm4RIA-B methodology, i.e., a model-driven methodology for the development of RIA as BI Web applications. In order to overcome the limitations of RIA regarding knowledge management from the Web, this paper also presents a new RIA platform for BI, called RI@BI, which extends the functionalities of traditional RIAs by means of Semantic Web technologies and B2B techniques. Finally, we evaluate the whole approach on a case study—the development of a social network site for an enterprise project manager. 相似文献
68.
Lu??s Antunes Armando Matos Alexandre Pinto Andr?? Souto Andreia Teixeira 《Theory of Computing Systems》2013,52(1):162-178
We prove several results relating injective one-way functions, time-bounded conditional Kolmogorov complexity, and time-bounded conditional entropy. First we establish a connection between injective, strong and weak one-way functions and the expected value of the polynomial time-bounded Kolmogorov complexity, denoted here by?E(K t (x|f(x))). These results are in both directions. More precisely, conditions on?E(K t (x|f(x))) that imply that?f is a weak one-way function, and properties of?E(K t (x|f(x))) that are implied by the fact that?f is a strong one-way function. In particular, we prove a separation result: based on the concept of time-bounded Kolmogorov complexity, we find an interval in which every function?f is a necessarily weak but not a strong one-way function. Then we propose an individual approach to injective one-way functions based on Kolmogorov complexity, defining Kolmogorov one-way functions and prove some relationships between the new proposal and the classical definition of one-way functions, showing that a Kolmogorov one-way function is also a deterministic one-way function. A relationship between Kolmogorov one-way functions and the conjecture of polynomial time symmetry of information is also proved. Finally, we relate?E(K t (x|f(x))) and two forms of time-bounded entropy, the unpredictable entropy?H unp, in which ??one-wayness?? of a function can be easily expressed, and the Yao+ entropy, a measure based on compression/decompression schema in which only the decompressor is restricted to be time-bounded. 相似文献
69.
70.
Francisco P. Romero Pascual Julián-Iranzo Andrés Soto Mateus Ferreira-Satler Juan Gallardo-Casero 《Language Resources and Evaluation》2013,47(1):151-178
Web 2.0 provides user-friendly tools that allow persons to create and publish content online. User generated content often takes the form of short texts (e.g., blog posts, news feeds, snippets, etc). This has motivated an increasing interest on the analysis of short texts and, specifically, on their categorisation. Text categorisation is the task of classifying documents into a certain number of predefined categories. Traditional text classification techniques are mainly based on word frequency statistical analysis and have been proved inadequate for the classification of short texts where word occurrence is too small. On the other hand, the classic approach to text categorization is based on a learning process that requires a large number of labeled training texts to achieve an accurate performance. However labeled documents might not be available, when unlabeled documents can be easily collected. This paper presents an approach to text categorisation which does not need a pre-classified set of training documents. The proposed method only requires the category names as user input. Each one of these categories is defined by means of an ontology of terms modelled by a set of what we call proximity equations. Hence, our method is not category occurrence frequency based, but highly depends on the definition of that category and how the text fits that definition. Therefore, the proposed approach is an appropriate method for short text classification where the frequency of occurrence of a category is very small or even zero. Another feature of our method is that the classification process is based on the ability of an extension of the standard Prolog language, named Bousi~Prolog , for flexible matching and knowledge representation. This declarative approach provides a text classifier which is quick and easy to build, and a classification process which is easy for the user to understand. The results of experiments showed that the proposed method achieved a reasonably useful performance. 相似文献