全文获取类型
收费全文 | 6981篇 |
免费 | 569篇 |
国内免费 | 3篇 |
专业分类
电工技术 | 41篇 |
综合类 | 4篇 |
化学工业 | 1675篇 |
金属工艺 | 126篇 |
机械仪表 | 144篇 |
建筑科学 | 295篇 |
矿业工程 | 21篇 |
能源动力 | 155篇 |
轻工业 | 1854篇 |
水利工程 | 81篇 |
石油天然气 | 40篇 |
无线电 | 356篇 |
一般工业技术 | 1476篇 |
冶金工业 | 150篇 |
原子能技术 | 25篇 |
自动化技术 | 1110篇 |
出版年
2024年 | 25篇 |
2023年 | 92篇 |
2022年 | 118篇 |
2021年 | 244篇 |
2020年 | 207篇 |
2019年 | 235篇 |
2018年 | 353篇 |
2017年 | 367篇 |
2016年 | 344篇 |
2015年 | 251篇 |
2014年 | 341篇 |
2013年 | 748篇 |
2012年 | 492篇 |
2011年 | 500篇 |
2010年 | 392篇 |
2009年 | 361篇 |
2008年 | 388篇 |
2007年 | 368篇 |
2006年 | 292篇 |
2005年 | 151篇 |
2004年 | 154篇 |
2003年 | 156篇 |
2002年 | 148篇 |
2001年 | 125篇 |
2000年 | 105篇 |
1999年 | 86篇 |
1998年 | 71篇 |
1997年 | 49篇 |
1996年 | 46篇 |
1995年 | 53篇 |
1994年 | 44篇 |
1993年 | 25篇 |
1992年 | 24篇 |
1991年 | 18篇 |
1990年 | 15篇 |
1989年 | 15篇 |
1988年 | 17篇 |
1987年 | 5篇 |
1986年 | 11篇 |
1985年 | 16篇 |
1984年 | 23篇 |
1983年 | 20篇 |
1982年 | 14篇 |
1981年 | 6篇 |
1980年 | 8篇 |
1979年 | 6篇 |
1978年 | 4篇 |
1976年 | 5篇 |
1973年 | 4篇 |
1967年 | 2篇 |
排序方式: 共有7553条查询结果,搜索用时 15 毫秒
91.
92.
Hossein Karshenas Roberto Santana Concha Bielza Pedro Larrañaga 《Applied Soft Computing》2013,13(5):2412-2432
Regularization is a well-known technique in statistics for model estimation which is used to improve the generalization ability of the estimated model. Some of the regularization methods can also be used for variable selection that is especially useful in high-dimensional problems. This paper studies the use of regularized model learning in estimation of distribution algorithms (EDAs) for continuous optimization based on Gaussian distributions. We introduce two approaches to the regularized model estimation and analyze their effect on the accuracy and computational complexity of model learning in EDAs. We then apply the proposed algorithms to a number of continuous optimization functions and compare their results with other Gaussian distribution-based EDAs. The results show that the optimization performance of the proposed RegEDAs is less affected by the increase in the problem size than other EDAs, and they are able to obtain significantly better optimization values for many of the functions in high-dimensional settings. 相似文献
93.
Gabriela Ramírez-de-la-Rosa Manuel Montes-y-Gómez Thamar Solorio Luis Villaseñor-Pineda 《Language Resources and Evaluation》2013,47(1):127-149
During the last decades the Web has become the greatest repository of digital information. In order to organize all this information, several text categorization methods have been developed, achieving accurate results in most cases and in very different domains. Due to the recent usage of Internet as communication media, short texts such as news, tweets, blogs, and product reviews are more common every day. In this context, there are two main challenges; on the one hand, the length of these documents is short, and therefore, the word frequencies are not informative enough, making text categorization even more difficult than usual. On the other hand, topics are changing constantly at a fast rate, causing the lack of adequate amounts of training data. In order to deal with these two problems we consider a text classification method that is supported on the idea that similar documents may belong to the same category. Mainly, we propose a neighborhood consensus classification method that classifies documents by considering their own information as well as information about the category assigned to other similar documents from the same target collection. In particular, the short texts we used in our evaluation are news titles with an average of 8 words. Experimental results are encouraging; they indicate that leveraging information from similar documents helped to improve classification accuracy and that the proposed method is especially useful when labeled training resources are limited. 相似文献
94.
Enrique Alfonseca Guillermo Garrido Jean-Yves Delort Anselmo Peñas 《Language Resources and Evaluation》2013,47(4):1163-1190
This paper describes the generation of temporally anchored infobox attribute data from the Wikipedia history of revisions. By mining (attribute, value) pairs from the revision history of the English Wikipedia we are able to collect a comprehensive knowledge base that contains data on how attributes change over time. When dealing with the Wikipedia edit history, vandalic and erroneous edits are a concern for data quality. We present a study of vandalism identification in Wikipedia edits that uses only features from the infoboxes, and show that we can obtain, on this dataset, an accuracy comparable to a state-of-the-art vandalism identification method that is based on the whole article. Finally, we discuss different characteristics of the extracted dataset, which we make available for further study. 相似文献
95.
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. 相似文献
96.
The main purpose of a gene interaction network is to map the relationships of the genes that are out of sight when a genomic study is tackled. DNA microarrays allow the measure of gene expression of thousands of genes at the same time. These data constitute the numeric seed for the induction of the gene networks. In this paper, we propose a new approach to build gene networks by means of Bayesian classifiers, variable selection and bootstrap resampling. The interactions induced by the Bayesian classifiers are based both on the expression levels and on the phenotype information of the supervised variable. Feature selection and bootstrap resampling add reliability and robustness to the overall process removing the false positive findings. The consensus among all the induced models produces a hierarchy of dependences and, thus, of variables. Biologists can define the depth level of the model hierarchy so the set of interactions and genes involved can vary from a sparse to a dense set. Experimental results show how these networks perform well on classification tasks. The biological validation matches previous biological findings and opens new hypothesis for future studies. 相似文献
97.
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: |
98.
Jan Rosell Carlos Vázquez Alexander Pérez Pedro Iñiguez 《Journal of Intelligent and Robotic Systems》2008,53(3):223-245
Haptic devices allow a user to feel either reaction forces from virtual interactions or reaction forces reflected from a remote
site during a bilateral teleoperation task. Also, guiding forces can be exerted to train the user in the performance of a
virtual task or to assist him/her to safely teleoperate a robot. The generation of guiding forces relies on the existence
of a motion plan that provides the direction to be followed to reach the goal from any free configuration of the configuration
space (-space). This paper proposes a method to obtain such a plan that interleaves a sampling-based exploration of -space with an efficient computation of harmonic functions. A deterministic sampling sequence (with a bias based on harmonic
function values) is used to obtain a hierarchical cell decomposition model of -space. A harmonic function is iteratively computed over the partially known model using a novel approach. The harmonic function
is the navigation function used as motion plan. The approach has been implemented in a planner (called the Kautham planner) that, given an initial and a goal configuration, provides: (a) a channel of cells connecting the cell that contains
the initial configuration with the cell that contains the goal configuration; (b) two harmonic functions over the whole -space, one that guides motions towards the channel and another that guides motions within the channel towards the goal; and
(c) a path computed over a roadmap built with the free samples of the channel. The harmonic functions and the solution path
are then used to generate the guiding forces for the haptic device. The planning approach is illustrated with examples on
2D and 3D workspaces.
This work was partially supported by the CICYT projects DPI2005-00112 and DPI2007-63665. 相似文献
99.
M. Lozano P. Morillo J.M. Orduña V. Cavero G. Vigueras 《Journal of Network and Computer Applications》2009,32(2):474-482
Crowd simulation requires both rendering visually plausible images and managing the behavior of autonomous agents. Therefore, these applications need an efficient design that allows them to simultaneously handle these two requirements. Although several proposals have focused on the software architectures for these systems, no proposals have focused on the computer systems supporting them.In this paper, we analyze the computer architectures used in the literature to support distributed virtual environments. Also, we propose a distributed computer architecture which is efficient enough to support simulations of thousand of autonomous agents. This proposal consists of a cluster of interconnected computers in order to improve flexibility and robustness, as well as a hierarchical software architecture that efficiently provides consistency. Performance evaluation results show that the trade-off between flexibility and consistency allows to efficiently manage thousands of autonomous agents. Therefore, this network-based system architecture can provide the required scalability for large-scale crowd simulations. 相似文献
100.
Robert M. Hierons Mercedes G. Merayo Manuel Núñez 《The Journal of Logic and Algebraic Programming》2009,78(2):98-115
In this paper we present a method for testing a system against a non-deterministic stochastic finite state machine. As usual, we assume that the functional behaviour of the system under test (SUT) is deterministic but we allow the timing to be non-deterministic. We extend the state counting method of deriving tests, adapting it to the presence of temporal requirements represented by means of random variables. The notion of conformance is introduced using an implementation relation considering temporal aspects and the limitations imposed by a black-box framework. We propose a new group of implementation relations and an algorithm for generating a test suite that determines the conformance of a deterministic SUT with respect to a non-deterministic specification. We show how previous work on testing from stochastic systems can be encoded into the framework presented in this paper as an instantiation of our parameterized implementation relation. In this setting, we use a notion of conformance up to a given confidence level. 相似文献