全文获取类型
收费全文 | 5276篇 |
免费 | 398篇 |
国内免费 | 9篇 |
专业分类
电工技术 | 67篇 |
综合类 | 3篇 |
化学工业 | 1493篇 |
金属工艺 | 59篇 |
机械仪表 | 149篇 |
建筑科学 | 215篇 |
矿业工程 | 10篇 |
能源动力 | 229篇 |
轻工业 | 866篇 |
水利工程 | 70篇 |
石油天然气 | 25篇 |
无线电 | 361篇 |
一般工业技术 | 843篇 |
冶金工业 | 200篇 |
原子能技术 | 27篇 |
自动化技术 | 1066篇 |
出版年
2024年 | 13篇 |
2023年 | 57篇 |
2022年 | 193篇 |
2021年 | 249篇 |
2020年 | 161篇 |
2019年 | 188篇 |
2018年 | 225篇 |
2017年 | 195篇 |
2016年 | 249篇 |
2015年 | 188篇 |
2014年 | 256篇 |
2013年 | 456篇 |
2012年 | 365篇 |
2011年 | 437篇 |
2010年 | 287篇 |
2009年 | 323篇 |
2008年 | 295篇 |
2007年 | 252篇 |
2006年 | 204篇 |
2005年 | 166篇 |
2004年 | 144篇 |
2003年 | 110篇 |
2002年 | 112篇 |
2001年 | 51篇 |
2000年 | 44篇 |
1999年 | 39篇 |
1998年 | 63篇 |
1997年 | 38篇 |
1996年 | 38篇 |
1995年 | 34篇 |
1994年 | 32篇 |
1993年 | 28篇 |
1992年 | 19篇 |
1991年 | 20篇 |
1990年 | 19篇 |
1989年 | 14篇 |
1988年 | 12篇 |
1987年 | 16篇 |
1986年 | 8篇 |
1985年 | 10篇 |
1984年 | 18篇 |
1983年 | 8篇 |
1982年 | 10篇 |
1980年 | 10篇 |
1979年 | 4篇 |
1978年 | 2篇 |
1977年 | 3篇 |
1976年 | 6篇 |
1975年 | 5篇 |
1974年 | 4篇 |
排序方式: 共有5683条查询结果,搜索用时 17 毫秒
91.
Luis Martí Jesús García Antonio Berlanga José M. Molina 《Annals of Mathematics and Artificial Intelligence》2013,68(4):247-273
The introduction of learning to the search mechanisms of optimization algorithms has been nominated as one of the viable approaches when dealing with complex optimization problems, in particular with multi-objective ones. One of the forms of carrying out this hybridization process is by using multi-objective optimization estimation of distribution algorithms (MOEDAs). However, it has been pointed out that current MOEDAs have an intrinsic shortcoming in their model-building algorithms that hamper their performance. In this work, we put forward the argument that error-based learning, the class of learning most commonly used in MOEDAs is responsible for current MOEDA underachievement. We present adaptive resonance theory (ART) as a suitable learning paradigm alternative and present a novel algorithm called multi-objective ART-based EDA (MARTEDA) that uses a Gaussian ART neural network for model-building and a hypervolume-based selector as described for the HypE algorithm. In order to assert the improvement obtained by combining two cutting-edge approaches to optimization an extensive set of experiments are carried out. These experiments also test the scalability of MARTEDA as the number of objective functions increases. 相似文献
92.
In this article, the authors compare offshore outsourcing and the internal offshoring of software development. Empirical evidence is presented from a case study conducted in five companies. Based on a detailed literature review, a framework was developed that guided the authors' analysis of the differences in the challenges faced by companies and the patterns of evolution in the practice of software development in each business model. 相似文献
93.
The provision of support for holistic operations in the scope of a horizontal digital administration requires the fulfillment of a number of previous steps that guarantee the viability of services in the domain. One of these tasks is the proper management of documents. Documents are a key element of any democratic administration and their digital management is a clear pre-requisite for the arrival of digital government. This article tackles how this service can be provided using the support of semantics as a technological cornerstone. The implementation of such a tool is made through the so-called cPortfolio. This platform is deeply discussed and details about its design and implementation are provided. This system is designed to manage both the personal information from the citizen and the documents they possess. Tests on the prototype showed interesting features regarding the simplicity of use and the interoperability support provided to third party agents. 相似文献
94.
Sultan Aldirmaz Lutfiye Durak-Ata Aydin Akan Luis F. Chaparro 《Digital Signal Processing》2013,23(5):1747-1755
Discrete evolutionary transform (DET) has usually been applied to signals in a blind-way without using any parameters to characterize the signal. For this reason, it is not optimal and needs improvement by using some information about the signal. In this paper, we propose an improvement for the discrete evolutionary transform in order to obtain a sparse representation and redefine the generalized time-bandwidth product optimal short-time Fourier transform as a special case of it. In case of linear FM-type signals, the optimized kernel function of the transform is determined according to signal parameters including the instantaneous frequency. The performance of the adaptive-DET is illustrated on three distinct cases. In case of multi-component LFM signals, when the concentration of the proposed distribution is compared to the ordinary sinusoidal-DET, the improvement is computed as 28% in terms of the ratio of norms. Furthermore we define a new and a general class of distribution functions named as the short-time generalized discrete Fourier transform (ST-GDFT) which is a larger set of signal representations including the adaptive-DET. 相似文献
95.
The concentrations of polycyclic aromatic hydrocarbons (PAHS) in water and sediments of seven wet detention ponds receiving urban stormwater were investigated. The ponds comprised traditional wet detention ponds with a permanent wet volume and a storage volume as well as ponds that were expanded with sand filters and other means to improve the removal of micropollutants. The concentrations of sigmaPAH in the sediments varied between 6 +/- 5 and 2,222 +/- 603 ng g(-1) dry weight (mean +/- standard deviation), and were highest in the ponds with lower pond volume per catchment area and did not clearly reflect different activities in the catchments. In general, the concentrations of PAHS in the sediments decreased from inlet to outlet, especially in the systems with good conditions for sedimentation such as systems with flow perpendicular sand dikes and extensive submerged vegetation. High molecular weight PAHs were predominant in the sediments indicating the pyrogenic origin of the PAHS. There was no correlation between PAH species concentrations in water or sediments and their hydrophobicity (log K(ow)). PAH concentrations in water fluctuated in response to intensity and frequency of rain events, whereas concentrations in the sediments integrated the pollutant load over time. Pond systems expanded with sand filters and other technologies to enhance removal of micropollutants consistently had concentrations of PAHS in the effluents below the detection level. 相似文献
96.
Automated airborne collision‐detection systems are a key enabling technology for facilitating the integration of unmanned aerial vehicles (UAVs) into the national airspace. These safety‐critical systems must be sensitive enough to provide timely warnings of genuine airborne collision threats, but not so sensitive as to cause excessive false alarms. Hence, an accurate characterization of detection and false‐alarm sensitivity is essential for understanding performance tradeoffs, and system designers can exploit this characterization to help achieve a desired balance in system performance. In this paper, we experimentally evaluate a sky‐region, image‐based, aircraft collision‐detection system that is based on morphological and temporal processing techniques. (Note that the examined detection approaches are not suitable for the detection of potential collision threats against a ground clutter background.) A novel collection methodology for collecting realistic airborne collision‐course target footage in both head‐on and tail‐chase engagement geometries is described. Under (hazy) blue sky conditions, our proposed system achieved detection ranges greater than 1540 m in three flight test cases with no false‐alarm events in 14.14 h of nontarget data (under cloudy conditions, the system achieved detection ranges greater than 1170 m in four flight test cases with no false‐alarm events in 6.63 h of nontarget data). Importantly, this paper is the first documented presentation of detection range versus false‐alarm curves generated from airborne target and nontarget image data. © 2012 Wiley Periodicals, Inc. 相似文献
97.
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. 相似文献
98.
Jorge M Santos Joaquim Marques de Sa Luis A Alexandre 《IEEE transactions on pattern analysis and machine intelligence》2008,30(1):62-75
Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity measures are distance measures. The derived proximity matrices can be used to build graphs, which provide the basic structure for some clustering methods. We present here a new proximity matrix based on an entropic measure and also a clustering algorithm (LEGClust) that builds layers of subgraphs based on this matrix, and uses them and a hierarchical agglomerative clustering technique to form the clusters. Our approach capitalizes on both a graph structure and a hierarchical construction. Moreover, by using entropy as a proximity measure we are able, with no assumption about the cluster shapes, to capture the local structure of the data, forcing the clustering method to reflect this structure. We present several experiments on artificial and real data sets that provide evidence on the superior performance of this new algorithm when compared with competing ones. 相似文献
99.
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G=(V,E) with node set V={0,1,…,n} and edge set E, two integer weights, a cost ce and a delay we associated with each edge e of E, and a natural (time limit) number H, we wish to find a spanning tree T of the graph with minimum total cost and such that the unique path from a specified root node, node 0, to any other node has total delay not greater than H. This problem generalizes the well known hop-constrained spanning tree problem and arises in the design of centralized networks with quality of service constraints and also in package shipment with service guarantee constraints. We present three theoretically equivalent modeling approaches, a column generation scheme, a Lagrangian relaxation combined with subgradient optimization procedure, both based on a path formulation of the problem, and a shortest path (compact) reformulation of the problem which views the underlying subproblem as defined in a layered extended graph. We present results for complete graph instances with up to 40 nodes. Our results indicate that the layered graph path reformulation model is still quite good when the arc weights are reasonably small. Lagrangian relaxation combined with subgradient optimization procedure appears to work much better than column generation and seems to be a quite reasonable approach to the problem for large weight, and even small weight, instances. 相似文献
100.
This research introduces a new optimality criterion for motion planning of wheeled mobile robots based on a cost index that assesses the nearness to singularity of forward and
inverse kinematic models. Slip motions, infinite estimation error and impossible control actions are avoided escaping from singularities. In addition, high amplification of wheel velocity errors and high wheel velocity values are
also avoided by moving far from the singularity. The proposed cost index can be used directly to complement path-planning and motion-planning techniques (e.g. tree graphs, roadmaps, etc.) in order to select the optimal collision-free path or trajectory among several possible solutions. To illustrate the applications of the proposed
approach, an industrial forklift, equivalent to a tricycle-like mobile robot, is considered in a simulated environment. In particular, several results are
validated for the proposed optimality criterion, which are extensively compared to those obtained with other classical optimality criteria, such as shortest-path, time-optimal and minimum-energy. 相似文献