全文获取类型
收费全文 | 5344篇 |
免费 | 408篇 |
国内免费 | 3篇 |
专业分类
电工技术 | 16篇 |
综合类 | 1篇 |
化学工业 | 1897篇 |
金属工艺 | 38篇 |
机械仪表 | 104篇 |
建筑科学 | 201篇 |
矿业工程 | 10篇 |
能源动力 | 133篇 |
轻工业 | 1755篇 |
水利工程 | 48篇 |
石油天然气 | 37篇 |
无线电 | 179篇 |
一般工业技术 | 639篇 |
冶金工业 | 131篇 |
原子能技术 | 7篇 |
自动化技术 | 559篇 |
出版年
2024年 | 17篇 |
2023年 | 90篇 |
2022年 | 346篇 |
2021年 | 387篇 |
2020年 | 206篇 |
2019年 | 230篇 |
2018年 | 229篇 |
2017年 | 230篇 |
2016年 | 265篇 |
2015年 | 194篇 |
2014年 | 287篇 |
2013年 | 425篇 |
2012年 | 400篇 |
2011年 | 425篇 |
2010年 | 314篇 |
2009年 | 312篇 |
2008年 | 265篇 |
2007年 | 236篇 |
2006年 | 170篇 |
2005年 | 130篇 |
2004年 | 110篇 |
2003年 | 86篇 |
2002年 | 77篇 |
2001年 | 39篇 |
2000年 | 45篇 |
1999年 | 47篇 |
1998年 | 29篇 |
1997年 | 25篇 |
1996年 | 19篇 |
1995年 | 12篇 |
1994年 | 14篇 |
1993年 | 11篇 |
1992年 | 9篇 |
1991年 | 4篇 |
1990年 | 3篇 |
1989年 | 18篇 |
1988年 | 7篇 |
1987年 | 11篇 |
1986年 | 4篇 |
1985年 | 6篇 |
1984年 | 6篇 |
1983年 | 2篇 |
1982年 | 3篇 |
1981年 | 1篇 |
1980年 | 3篇 |
1978年 | 4篇 |
1977年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有5755条查询结果,搜索用时 9 毫秒
41.
Matjaz B. Juric Author Vitae Ana Sasa Author Vitae Author Vitae Ivan Rozman Author Vitae 《Journal of Systems and Software》2009,82(8):1326-1343
Versioning is an important aspect of web service development, which has not been adequately addressed so far. In this article, we propose extensions to WSDL and UDDI to support versioning of web service interfaces at development-time and run-time. We address service-level and operation-level versioning, service endpoint mapping, and version sequencing. We also propose annotation extensions for developing versioned web services in Java. We have tested the proposed solution for versioning in two real-world environments and identified considerable improvements in service development and maintenance efficiency, improved service reuse, and simplified governance. 相似文献
42.
Most real‐coded genetic algorithm research has focused on developing effective crossover operators, and as a result, many different types of crossover operators have been proposed. Some forms of crossover operators are more suitable to tackle certain problems than others, even at the different stages of the genetic process in the same problem. For this reason, techniques that combine multiple crossovers, called hybrid crossover operators, have been suggested as alternative schemes to the common practice of applying only one crossover model to all the elements in the population. On the other hand, there are operators with multiple offsprings, more than two descendants from two parents, which present a better behavior than the operators with only two descendants, and achieve a good balance between exploration and exploitation. © 2009 Wiley Periodicals, Inc. 相似文献
43.
In an adaptive and intelligent educational system (AIES), the process of learning pedagogical policies according the students needs fits as a Reinforcement Learning (RL) problem. Previous works have demonstrated that a great amount of experience is needed in order for the system to learn to teach properly, so applying RL to the AIES from scratch is unfeasible. Other works have previously demonstrated in a theoretical way that seeding the AIES with an initial value function learned with simulated students reduce the experience required to learn an accurate pedagogical policy. In this paper we present empirical results demonstrating that a value function learned with simulated students can provide the AIES with a very accurate initial pedagogical policy. The evaluation is based on the interaction of more than 70 Computer Science undergraduate students, and demonstrates that an efficient and useful guide through the contents of the educational system is obtained. 相似文献
44.
Ana Serrano Felix Heide Diego Gutierrez Gordon Wetzstein Belen Masia 《Computer Graphics Forum》2016,35(2):153-163
Current HDR acquisition techniques are based on either (i) fusing multibracketed, low dynamic range (LDR) images, (ii) modifying existing hardware and capturing different exposures simultaneously with multiple sensors, or (iii) reconstructing a single image with spatially‐varying pixel exposures. In this paper, we propose a novel algorithm to recover high‐quality HDRI images from a single, coded exposure. The proposed reconstruction method builds on recently‐introduced ideas of convolutional sparse coding (CSC); this paper demonstrates how to make CSC practical for HDR imaging. We demonstrate that the proposed algorithm achieves higher‐quality reconstructions than alternative methods, we evaluate optical coding schemes, analyze algorithmic parameters, and build a prototype coded HDR camera that demonstrates the utility of convolutional sparse HDRI coding with a custom hardware platform. 相似文献
45.
Iuliana Armaş Mihaela Gheorghe Ana Maria Lendvai Paul Daniel Dumitru Octavian Bădescu Alexandru Călin 《International journal of remote sensing》2016,37(23):5565-5580
This research aims to complex validate radar displacement products over Bucharest based on Global Navigation Satellite System or GNSS. Validation was represented by the comparison of the recent TerraSAR-X (TSX) displacement results with field GNSS data. For this purpose, 24 and 27 high-resolution images acquired from the TSX satellite between 2011 and 2014 were processed by Permanent Scatterer Inteferometry (PSI) and Small BASeline Subset (SBAS) – interferometric techniques using synthetic aperture radar (SAR) images. The images were selected from a larger pool of SAR images, after consulting weather databases, which helped eliminate the images acquired under adverse weather conditions. GNSS locations were cross-checked on high-resolution optical images and 21 ground points (including three permanent stations) were selected. All these points were (1) characterized by high coherence on radar images; (2) were on the ground; (3) were situated in large vacant spaces; and (4) far away from radar obstacles such as trees. A major challenge in achieving the research goal was to overcome the lack of permanent stations at the ground level within the area of Bucharest. Instead of permanent stations, our team designed and installed forced centring systems that remained stable over time, eliminating the instalment errors of GNSS receivers. The line-of-site (LOS) components derived from GNSS data have been compared with those of the SAR scatterers closest to the GNSS markers (never coinciding). For each location, the vertical reading was projected in the LOS of the SAR sensor. These readings were compared with the displacement values determined at the locations of permanent scatterers (PSs) within 100 m from the GNSS nodes, by eliminating all scatterers on buildings. The comparison has shown a good agreement. 相似文献
46.
47.
48.
Rita A. RibeiroAuthor Vitae Ana M. MoreiraAuthor VitaePim van den BroekAuthor Vitae Afonso PimentelAuthor Vitae 《Decision Support Systems》2011,51(1):208-219
During software development, many decisions need to be made to guarantee the satisfaction of the stakeholders' requirements and goals. The full satisfaction of all of these requirements and goals may not be possible, requiring decisions over conflicting human interests as well as technological alternatives, with an impact on the quality and cost of the final solution. This work aims at assessing the suitability of multi-criteria decision making (MCDM) methods to support software engineers' decisions. To fulfil this aim, a HAM (Hybrid Assessment Method) is proposed, which gives its user the ability to perceive the influence different decisions may have on the final result. HAM is a simple and efficient method that combines one single pairwise comparison decision matrix (to determine the weights of criteria) with one classical weighted decision matrix (to prioritize the alternatives). To avoid consistency problems regarding the scale and the prioritization method, HAM uses a geometric scale for assessing the criteria and the geometric mean for determining the alternative ratings. 相似文献
49.
Ana Gàl 《Computational Complexity》2001,10(4):277-296
We give a characterization of span program size by a
combinatorial-algebraic measure. The measure we consider is a generalization
of a measure on covers which has been used to prove lower
bounds on formula size and has also been studied with respect to communication
complexity.?In the monotone case our new methods yield lower bounds for
the monotone span program complexity of explicit Boolean functions in
n variables over arbitrary fields, improving the previous lower bounds
on monotone span program size. Our characterization of span program
size implies that any matrix with superpolynomial separation between
its rank and cover number can be used to obtain superpolynomial lower
bounds on monotone span program size. We also identify a property
of bipartite graphs that is suficient for constructing Boolean functions
with large monotone span program complexity.
Received: September 30, 2000. 相似文献
50.
António V. Sousa Ana Maria Mendonça Aurélio Campilho 《Pattern Analysis & Applications》2008,11(3-4):409-423
This paper proposes a non-parametric method for the classification of thin-layer chromatographic (TLC) images from patterns represented in a dissimilarity space. Each pattern corresponds to a mixture of Gaussian approximation of the intensity profile. The methodology comprises various phases, including image processing and analysis steps to extract the chromatographic profiles and a classification phase to discriminate among two groups, one corresponding to normal cases and the other to three pathological classes. We present an extensive study of several dissimilarity-based approaches analysing the influence of the dissimilarity measure and the prototype selection method on the classification performance. The main conclusions of this paper are that, Match and Profile-difference dissimilarity measures present better results, and a new prototype selection methodology achieves a performance similar or even better than conventional methods. Furthermore, we also concluded that simplest classifiers, such as k-NN and linear discriminant classifiers (LDCs), present good performance being the overall classification error less than 10% for the four-class problem. 相似文献