全文获取类型
收费全文 | 8844篇 |
免费 | 538篇 |
国内免费 | 12篇 |
专业分类
电工技术 | 119篇 |
综合类 | 5篇 |
化学工业 | 2283篇 |
金属工艺 | 133篇 |
机械仪表 | 299篇 |
建筑科学 | 326篇 |
矿业工程 | 17篇 |
能源动力 | 374篇 |
轻工业 | 1677篇 |
水利工程 | 118篇 |
石油天然气 | 52篇 |
武器工业 | 2篇 |
无线电 | 486篇 |
一般工业技术 | 1253篇 |
冶金工业 | 857篇 |
原子能技术 | 62篇 |
自动化技术 | 1331篇 |
出版年
2024年 | 28篇 |
2023年 | 82篇 |
2022年 | 310篇 |
2021年 | 396篇 |
2020年 | 249篇 |
2019年 | 279篇 |
2018年 | 336篇 |
2017年 | 358篇 |
2016年 | 386篇 |
2015年 | 264篇 |
2014年 | 360篇 |
2013年 | 689篇 |
2012年 | 571篇 |
2011年 | 700篇 |
2010年 | 469篇 |
2009年 | 499篇 |
2008年 | 437篇 |
2007年 | 375篇 |
2006年 | 317篇 |
2005年 | 216篇 |
2004年 | 185篇 |
2003年 | 176篇 |
2002年 | 161篇 |
2001年 | 112篇 |
2000年 | 110篇 |
1999年 | 113篇 |
1998年 | 307篇 |
1997年 | 220篇 |
1996年 | 139篇 |
1995年 | 98篇 |
1994年 | 60篇 |
1993年 | 58篇 |
1992年 | 26篇 |
1991年 | 20篇 |
1990年 | 22篇 |
1989年 | 24篇 |
1988年 | 19篇 |
1987年 | 12篇 |
1986年 | 18篇 |
1985年 | 21篇 |
1984年 | 24篇 |
1983年 | 22篇 |
1982年 | 14篇 |
1981年 | 15篇 |
1980年 | 14篇 |
1979年 | 9篇 |
1978年 | 7篇 |
1977年 | 15篇 |
1976年 | 26篇 |
1975年 | 6篇 |
排序方式: 共有9394条查询结果,搜索用时 15 毫秒
81.
João Tavares Jorge Barbosa Ismael Cardoso Cristiano Costa Adenauer Yamin Rodrigo Real 《Universal Access in the Information Society》2016,15(4):589-607
This article proposes Hefestos, an intelligent system applied to ubiquitous accessibility. This model uses ubiquitous computing concepts to manage accessibility resources for people with disabilities. Among the concepts employed, context awareness, user profiles and trails management can be highlighted. The paper proposes an ontology for accessibility and delineates scenarios of its application in everyday life of people with disabilities. Moreover, the implementation of a smart wheelchair prototype and its application in a practical experiment is described. Ten users with a range of disability degrees tried the system and filled out a survey based on the technology acceptance model. This experiment demonstrated the main functionalities and the acceptance of the system. The results showed 96 % of acceptance regarding perceived easy of use and 98 % in perceived usefulness. These results were encouraging and show the potential for implementing Hefestos in real life situations. 相似文献
82.
This paper proposes a novel pose (position and orientation) consensus controller for networks of heterogeneous robots modeled in the operational space. The proposed controller is a distributed proportional plus damping scheme that, with a slight modification, solves both the leader–follower and leaderless consensus problems. A singularity‐free representation, unit quaternion, is used to describe the robots orientation, and the network is represented by an undirected and connected interconnection graph. Furthermore, it is shown that the controller is robust to interconnection variable time delays. Experiments with a network of two 6‐degrees‐of‐freedom robots are presented to illustrate the performance of the proposed scheme. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
83.
84.
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. 相似文献
85.
Roberto R. Expósito Guillermo L. Taboada Sabela Ramos Juan Touriño Ramón Doallo 《Personal and Ubiquitous Computing》2013,17(8):1709-1719
Cloud computing is posing several challenges, such as security, fault tolerance, access interface singularity, and network constraints, both in terms of latency and bandwidth. In this scenario, the performance of communications depends both on the network fabric and its efficient support in virtualized environments, which ultimately determines the overall system performance. To solve the current network constraints in cloud services, their providers are deploying high-speed networks, such as 10 Gigabit Ethernet. This paper presents an evaluation of high-performance computing message-passing middleware on a cloud computing infrastructure, Amazon EC2 cluster compute instances, equipped with 10 Gigabit Ethernet. The analysis of the experimental results, confronted with a similar testbed, has shown the significant impact that virtualized environments still have on communication performance, which demands more efficient communication middleware support to get over the current cloud network limitations. 相似文献
86.
Ana Carolina Lorena André C. P. L. F. de Carvalho João M. P. Gama 《Artificial Intelligence Review》2008,30(1-4):19-37
Several real problems involve the classification of data into categories or classes. Given a data set containing data whose classes are known, Machine Learning algorithms can be employed for the induction of a classifier able to predict the class of new data from the same domain, performing the desired discrimination. Some learning techniques are originally conceived for the solution of problems with only two classes, also named binary classification problems. However, many problems require the discrimination of examples into more than two categories or classes. This paper presents a survey on the main strategies for the generalization of binary classifiers to problems with more than two classes, known as multiclass classification problems. The focus is on strategies that decompose the original multiclass problem into multiple binary subtasks, whose outputs are combined to obtain the final prediction. 相似文献
87.
Elizabeth Carvalho Adérito Marcos Maribel Yasmina Santos Jo?o Espregueira-Mendes 《Computer Graphics and Applications, IEEE》2008,28(5):16-21
A cartographic-oriented model uses algebraic map operations to perform spatial analysis of medical data relative to the human body. A prototype system uses 3D visualization techniques to deliver analysis results. A prototype implementation suggests the model might provide the basis for a medical application tool that introduces new information insight. 相似文献
88.
To improve the performance of scientific applications with parallel loops, dynamic loop scheduling methods have been proposed.
Such methods address performance degradations due to load imbalance caused by predictable phenomena like nonuniform data distribution
or algorithmic variance, and unpredictable phenomena such as data access latency or operating system interference. In particular,
methods such as factoring, weighted factoring, adaptive weighted factoring, and adaptive factoring have been developed based
on a probabilistic analysis of parallel loop iterates with variable running times. These methods have been successfully implemented
in a number of applications such as: N-Body and Monte Carlo simulations, computational fluid dynamics, and radar signal processing.
The focus of this paper is on adaptive weighted factoring (AWF), a method that was designed for scheduling parallel loops
in time-stepping scientific applications. The main contribution of the paper is to relax the time-stepping requirement, a
modification that allows the AWF to be used in any application with a parallel loop. The modification further allows the AWF
to adapt to load imbalance that may occur during loop execution. Results of experiments to compare the performance of the
modified AWF with the performance of the other loop scheduling methods in the context of three nontrivial applications reveal
that the performance of the modified method is comparable to, and in some cases, superior to the performance of the most recently
introduced adaptive factoring method.
相似文献
Ioana BanicescuEmail: |
89.
Mag. Dr. René Riedl Dipl.-Wirtsch.-Inf. Univ. Maximilian Kobler o. Univ.-Prof. Mag. Dr. Friedrich Roithmayr 《WIRTSCHAFTSINFORMATIK》2008,50(2):111-128
On the Rate of Board Members with IT Responsibilities in Firms Listed on the Stock Exchange: Results of a Content Analysis: This article reports on a content analysis that investigates the rate of board members with IT responsibilities in firms listed on the stock exchange in the German speaking countries. Furthermore, the study ascertains the correlation of six factors – which become evident through content analysis – with the rate of board members with IT responsibilities. A total of 679 annual reports of German, Austrian, and Swiss corporations have been analyzed. The results show that in Germany and Switzerland 26 percent of the firms investigated have a board member with IT responsibilities, in Austria the rate is 23 percent. Additionally, the results show that turnover and number of employees are highly positively correlated with the rate of board members with IT responsibilities. Furthermore, the data show a correlation between industry and the rate of board members with IT responsibilities. 相似文献
90.
Chen Huanhuan Ti o Peter Yao Xin 《Knowledge and Data Engineering, IEEE Transactions on》2009,21(7):999-1013
An ensemble is a group of learners that work together as a committee to solve a problem. The existing ensemble learning algorithms often generate unnecessarily large ensembles, which consume extra computational resource and may degrade the generalization performance. Ensemble pruning algorithms aim to find a good subset of ensemble members to constitute a small ensemble, which saves the computational resource and performs as well as, or better than, the unpruned ensemble. This paper introduces a probabilistic ensemble pruning algorithm by choosing a set of “sparse” combination weights, most of which are zeros, to prune the ensemble. In order to obtain the set of sparse combination weights and satisfy the nonnegative constraint of the combination weights, a left-truncated, nonnegative, Gaussian prior is adopted over every combination weight. Expectation propagation (EP) algorithm is employed to approximate the posterior estimation of the weight vector. The leave-one-out (LOO) error can be obtained as a by-product in the training of EP without extra computation and is a good indication for the generalization error. Therefore, the LOO error is used together with the Bayesian evidence for model selection in this algorithm. An empirical study on several regression and classification benchmark data sets shows that our algorithm utilizes far less component learners but performs as well as, or better than, the unpruned ensemble. Our results are very competitive compared with other ensemble pruning algorithms. 相似文献