全文获取类型
收费全文 | 5986篇 |
免费 | 406篇 |
国内免费 | 16篇 |
专业分类
电工技术 | 65篇 |
综合类 | 4篇 |
化学工业 | 1649篇 |
金属工艺 | 84篇 |
机械仪表 | 129篇 |
建筑科学 | 249篇 |
矿业工程 | 7篇 |
能源动力 | 224篇 |
轻工业 | 674篇 |
水利工程 | 40篇 |
石油天然气 | 36篇 |
无线电 | 463篇 |
一般工业技术 | 1030篇 |
冶金工业 | 525篇 |
原子能技术 | 42篇 |
自动化技术 | 1187篇 |
出版年
2024年 | 10篇 |
2023年 | 78篇 |
2022年 | 186篇 |
2021年 | 247篇 |
2020年 | 147篇 |
2019年 | 192篇 |
2018年 | 204篇 |
2017年 | 170篇 |
2016年 | 233篇 |
2015年 | 210篇 |
2014年 | 310篇 |
2013年 | 482篇 |
2012年 | 390篇 |
2011年 | 463篇 |
2010年 | 287篇 |
2009年 | 293篇 |
2008年 | 256篇 |
2007年 | 264篇 |
2006年 | 230篇 |
2005年 | 184篇 |
2004年 | 156篇 |
2003年 | 150篇 |
2002年 | 136篇 |
2001年 | 69篇 |
2000年 | 76篇 |
1999年 | 80篇 |
1998年 | 132篇 |
1997年 | 87篇 |
1996年 | 74篇 |
1995年 | 59篇 |
1994年 | 67篇 |
1993年 | 52篇 |
1992年 | 35篇 |
1991年 | 35篇 |
1990年 | 28篇 |
1989年 | 44篇 |
1988年 | 22篇 |
1987年 | 31篇 |
1986年 | 28篇 |
1985年 | 32篇 |
1984年 | 26篇 |
1983年 | 19篇 |
1982年 | 20篇 |
1981年 | 16篇 |
1980年 | 25篇 |
1977年 | 8篇 |
1976年 | 18篇 |
1975年 | 6篇 |
1973年 | 7篇 |
1969年 | 7篇 |
排序方式: 共有6408条查询结果,搜索用时 15 毫秒
171.
The literature has frequently highlighted the usefulness of podcasting in higher education; however, there is an important gap between the theory on good practice in higher education and empirical studies about podcasting. With this in mind, we carried out an empirical study on an undergraduate degree course in Information Systems Management. The study consisted of the creation and broadcast of 13 podcasts, distributed over four months in which ninety distance students took part. The analysis follows the suggestions proposed in previous literature about the evaluation of technologies in a university learning environment. The findings, discussed within the framework of principles for good practice in higher education, suggest some interesting issues in distance courses, such as: (1) podcasting is a powerful tool as a complement to the traditional resources on a course, but not a substitute for them; (2) the characteristics of podcasting increase the impression of permanent contact between students and teachers, increasing students’ motivation; (3) the use of podcasting allows for a diverse range of student skills and learning methods. Other secondary findings are discussed and some suggestions for future research are proposed at the end of this paper. 相似文献
172.
Guy Redding Marlon Dumas Arthur H. M. ter Hofstede Adrian Iordachescu 《Service Oriented Computing and Applications》2010,4(3):191-201
Mainstream business process modelling techniques often promote a design paradigm wherein the activities that may be performed
within a case, together with their usual execution order, form the backbone on top of which other aspects are anchored. This
Fordist paradigm, while effective in standardised and production-oriented domains, breaks when confronted with processes in
which case-by-case variations and exceptions are the norm. We contend that the effective design of flexible processes calls
for a substantially different modelling paradigm. Motivated by requirements from the human services domain, we explore the
hypothesis that a framework consisting of a small set of coordination concepts, combined with established object-oriented
modelling principles, provides a suitable foundation for designing highly flexible processes. Several human service delivery
processes have been designed using this framework, and the resulting models have been used to realise a system to support
these processes in a pilot environment. 相似文献
173.
This paper constructs multirate linear multistep time discretizations based on Adams-Bashforth methods. These methods are
aimed at solving conservation laws and allow different timesteps to be used in different parts of the spatial domain. The
proposed family of discretizations is second order accurate in time and has conservation and linear and nonlinear stability
properties under local CFL conditions. Multirate timestepping avoids the necessity to take small global timesteps—restricted
by the largest value of the Courant number on the grid—and therefore results in more efficient computations. Numerical results
obtained for the advection and Burgers’ equations confirm the theoretical findings.
This work was supported by the National Science Foundation through award NSF CCF-0515170. 相似文献
174.
175.
Adrian Blumer Jan Novák Ralf Habel Derek Nowrouzezahrai Wojciech Jarosz 《Computer Graphics Forum》2016,35(7):461-473
Aggregate scattering operators (ASOs) describe the overall scattering behavior of an asset (i.e., an object or volume, or collection thereof) accounting for all orders of its internal scattering. We propose a practical way to precompute and compactly store ASOs and demonstrate their ability to accelerate path tracing. Our approach is modular avoiding costly and inflexible scene‐dependent precomputation. This is achieved by decoupling light transport within and outside of each asset, and precomputing on a per‐asset level. We store the internal transport in a reduced‐dimensional subspace tailored to the structure of the asset geometry, its scattering behavior, and typical illumination conditions, allowing the ASOs to maintain good accuracy with modest memory requirements. The precomputed ASO can be reused across all instances of the asset and across multiple scenes. We augment ASOs with functionality enabling multi‐bounce importance sampling, fast short‐circuiting of complex light paths, and compact caching, while retaining rapid progressive preview rendering. We demonstrate the benefits of our ASOs by efficiently path tracing scenes containing many instances of objects with complex inter‐reflections or multiple scattering. 相似文献
176.
Francisco Gomez‐Donoso Miguel Cazorla Alberto Garcia‐Garcia Jose Garcia‐Rodriguez 《Expert Systems》2016,33(5):480-488
Schaeffer's sign language consists of a reduced set of gestures designed to help children with autism or cognitive learning disabilities to develop adequate communication skills. Our automatic recognition system for Schaeffer's gesture language uses the information provided by an RGB‐D camera to capture body motion and recognize gestures using dynamic time warping combined with k‐nearest neighbors methods. The learning process is reinforced by the interaction with the proposed system that accelerates learning itself thus helping both children and educators. To demonstrate the validity of the system, a set of qualitative experiments with children were carried out. As a result, a system which is able to recognize a subset of 11 gestures of Schaeffer's sign language online was achieved. 相似文献
177.
Jose Hoyos Flavio Prieto Guillem Alenyà Carme Torras 《Journal of Intelligent and Robotic Systems》2016,82(1):81-99
Programming by demonstration techniques facilitate the programming of robots. Some of them allow the generalization of tasks through parameters, although they require new training when trajectories different from the ones used to estimate the model need to be added. One of the ways to re-train a robot is by incremental learning, which supplies additional information of the task and does not require teaching the whole task again. The present study proposes three techniques to add trajectories to a previously estimated task-parameterized Gaussian mixture model. The first technique estimates a new model by accumulating the new trajectory and the set of trajectories generated using the previous model. The second technique permits adding to the parameters of the existent model those obtained for the new trajectories. The third one updates the model parameters by running a modified version of the Expectation-Maximization algorithm, with the information of the new trajectories. The techniques were evaluated in a simulated task and a real one, and they showed better performance than that of the existent model. 相似文献
178.
Liangjun Chen Hua Qu Jihong Zhao Badong Chen Jose C. Principe 《Neural computing & applications》2016,27(4):1019-1031
Deep learning systems aim at using hierarchical models to learning high-level features from low-level features. The progress in deep learning is great in recent years. The robustness of the learning systems with deep architectures is however rarely studied and needs further investigation. In particular, the mean square error (MSE), a commonly used optimization cost function in deep learning, is rather sensitive to outliers (or impulsive noises). Robust methods are needed to improve the learning performance and immunize the harmful influences caused by outliers which are pervasive in real-world data. In this paper, we propose an efficient and robust deep learning model based on stacked auto-encoders and Correntropy-induced loss function (CLF), called CLF-based stacked auto-encoders (CSAE). CLF as a nonlinear measure of similarity is robust to outliers and can approximate different norms (from \(l_0\) to \(l_2\)) of data. Essentially, CLF is an MSE in reproducing kernel Hilbert space. Different from conventional stacked auto-encoders, which use, in general, the MSE as the reconstruction loss and KL divergence as the sparsity penalty term, the reconstruction loss and sparsity penalty term in CSAE are both built with CLF. The fine-tuning procedure in CSAE is also based on CLF, which can further enhance the learning performance. The excellent and robust performance of the proposed model is confirmed by simulation experiments on MNIST benchmark dataset. 相似文献
179.
Marie‐Laure Bougnol Jose H. Dulá 《International Transactions in Operational Research》2016,23(4):655-668
This paper treats the problem of how to determine weights in a ranking, which will cause a selected entity to attain the highest possible position. We establish that there are two types of entities in a ranking scheme: those which can be ranked as number one and those which cannot. These two types of entities can be identified using the “ranking hull” of the data; a polyhedral set that envelops the data. Only entities with data points on the boundary of this hull can attain the number one position. There are no weights that will make an entity whose data point is in the interior of the hull to ever attain the number one position. We deal with these two types of entities separately. In the first case, we propose an approach for finding a set of weights that, under special conditions, will result in a selected entity achieving the top of the ranking without ties and without ignoring any of the attributes. For the second category of entities, we devise a procedure to guarantee that these entities will attain their highest possible position in the ranking. The first case will require using interior point methods to solve a linear program (LP). The second case involves a binary mixed integer formulation. These two mathematical programs were tested on data from a well‐known university ranking. 相似文献
180.