全文获取类型
收费全文 | 5697篇 |
免费 | 398篇 |
国内免费 | 4篇 |
专业分类
电工技术 | 29篇 |
综合类 | 2篇 |
化学工业 | 2016篇 |
金属工艺 | 44篇 |
机械仪表 | 117篇 |
建筑科学 | 203篇 |
矿业工程 | 5篇 |
能源动力 | 142篇 |
轻工业 | 1847篇 |
水利工程 | 30篇 |
石油天然气 | 42篇 |
无线电 | 176篇 |
一般工业技术 | 702篇 |
冶金工业 | 223篇 |
原子能技术 | 18篇 |
自动化技术 | 503篇 |
出版年
2024年 | 13篇 |
2023年 | 87篇 |
2022年 | 330篇 |
2021年 | 362篇 |
2020年 | 184篇 |
2019年 | 177篇 |
2018年 | 222篇 |
2017年 | 211篇 |
2016年 | 229篇 |
2015年 | 180篇 |
2014年 | 286篇 |
2013年 | 456篇 |
2012年 | 417篇 |
2011年 | 421篇 |
2010年 | 285篇 |
2009年 | 309篇 |
2008年 | 311篇 |
2007年 | 284篇 |
2006年 | 189篇 |
2005年 | 187篇 |
2004年 | 118篇 |
2003年 | 119篇 |
2002年 | 100篇 |
2001年 | 71篇 |
2000年 | 70篇 |
1999年 | 54篇 |
1998年 | 71篇 |
1997年 | 59篇 |
1996年 | 58篇 |
1995年 | 47篇 |
1994年 | 29篇 |
1993年 | 19篇 |
1992年 | 14篇 |
1991年 | 18篇 |
1990年 | 5篇 |
1989年 | 13篇 |
1988年 | 11篇 |
1987年 | 14篇 |
1986年 | 3篇 |
1985年 | 6篇 |
1984年 | 11篇 |
1983年 | 4篇 |
1982年 | 13篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 4篇 |
1978年 | 5篇 |
1976年 | 6篇 |
1964年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有6099条查询结果,搜索用时 10 毫秒
31.
Fernández-Miyakawa ME Dorr R Fernández LE Uzal FA Ibarra C 《Computer methods and programs in biomedicine》2007,85(2):95-100
This paper describes the development of a simple system for measurement of net water movement through biological membrane barriers. The system is based on the detection of a water meniscus inside a polyethylene tube, which reflects the water movement inside one hemichamber of a modified Ussing chamber containing a membrane barrier. The detection device consists of a commercial computer-controlled flat bed scanner and specifically developed software. This system allows one to perform a relatively high number of individual experiments per physical unit. It is a flexible and affordable device, which allows comparatively more information per unit to be obtained than previously described methods. 相似文献
32.
33.
Cristina Pignotti 《Systems & Control Letters》2012,61(1):92-97
In this paper, we consider the wave equation with internal distributed time delay and local damping in a bounded and smooth domain Ω⊂Rn. When the local damping acts on a neighborhood of a suitable part of the boundary of Ω, we show that an exponential stability result holds if the coefficient of the delay term is sufficiently small. 相似文献
34.
Lorella Fatone Marco Giacinti Francesca Mariani Maria Cristina Recchioni Francesco Zirilli 《The Journal of supercomputing》2012,62(3):1480-1501
This paper shows two examples of how the analysis of option pricing problems can lead to computational methods efficiently implemented in parallel. These computational methods outperform ??general purpose?? methods (i.e., for example, Monte Carlo, finite differences methods). The GPU implementation of two numerical algorithms to price two specific derivatives (continuous barrier options and realized variance options) is presented. These algorithms are implemented in CUDA subroutines ready to run on Graphics Processing Units (GPUs) and their performance is studied. The realization of these subroutines is motivated by the extensive use of the derivatives considered in the financial markets to hedge or to take risk and by the interest of financial institutions in the use of state of the art hardware and software to speed up the decision process. The performance of these algorithms is measured using the (CPU/GPU) speed up factor, that is using the ratio between the (wall clock) times required to execute the code on a CPU and on a GPU. The choice of the reference CPU and GPU used to evaluate the speed up factors presented is stated. The outstanding performance of the algorithms developed is due to the mathematical properties of the pricing formulae used and to the ad hoc software implementation. In the case of realized variance options when the computation is done in single precision the comparisons between CPU and GPU execution times gives speed up factors of the order of a few hundreds. For barrier options, the corresponding speed up factors are of about fifteen, twenty. The CUDA subroutines to price barrier options and realized variance options can be downloaded from the website http://www.econ.univpm.it/recchioni/finance/w13. A?more general reference to the work in mathematical finance of some of the authors and of their coauthors is the website http://www.econ.univpm.it/recchioni/finance/. 相似文献
35.
José D. Martín Guerrero Daniele Marcelli Emilio Soria-Olivas Flavio Mari José María Martínez-Martínez Isabel Soley Bech Marcelino Martínez-Sober Laura Scatizzi Juan Gómez-Sanchis Andrea Stopper Antonio José Serrano-López Emanuele Gatti 《Expert systems with applications》2012,39(10):8793-8798
Evaluation of patient satisfaction has become an important indicator for assessing health care quality. Fresenius Medical Care (FME) as a global provider of dialysis services through its NephroCare network has a strong interest in monitoring patient satisfaction.The aim of the paper is to test and validate a methodology for detecting a residual area of low satisfaction in dialysis patients.The FME Patient Satisfaction Programme questionnaire was distributed to haemodialysis (HD) patients treated in 335 centers of its network. It contained 79 questions covering various satisfaction aspects regarding Dialysis Unit, Dialysis Arrangement, Nurses, Doctors, etc.To analyse the data provided by the questionnaire, the Self-Organising Map (SOM) method was used. SOM is a neural network model for clustering and projecting high-dimensional data into a low-dimensional space, preserving topological relationships of original high-dimensional data spaces.10,632 HD patients completed the questionnaire. Mean age was 63.05 ± 14.93 years with 56.69% males. Response rate was 66%. Overall level of satisfaction was 1.99 (range from ?3 to +3). On average patients were very satisfied with all issues. Nevertheless, a group of patients, around 60 years old, balanced gender ratio, whose level of satisfaction was lower than 1, were highlighted.In the NephroCare clinics patient satisfaction with service is rather high. While traditional analysis usually stops here, the SOM method allows identification of areas of potential improvement for specific patient groups. 相似文献
36.
This note proposes a model predictive control (MPC) algorithm for the solution of a robust control problem for continuous-time systems. Discontinuous feedback strategies are allowed in the solution of the min-max problems to be solved. The use of such strategies allows MPC to address a large class of nonlinear systems, including among others nonholonomic systems. Robust stability conditions to ensure steering to a certain set under bounded disturbances are established. The use of bang-bang feedbacks described by a small number of parameters is proposed, reducing considerably the computational burden associated with solving a differential game. The applicability of the proposed algorithm is tested to control a unicycle mobile robot. 相似文献
37.
38.
A survey of QoS architectures 总被引:14,自引:0,他引:14
Over the past several years there has been a considerable amount of research within the field of quality-of-service (QoS)
support for distributed multimedia systems. To date, most of the work has been within the context of individual architectural
layers such as the distributed system platform, operating system, transport subsystem and network layers. Much less progress
has been made in addressing the issue of overall end-to-end support for multimedia communications. In recognition of this,
a number of research teams have proposed the development of QoS architectures which incorporate QoS-configurable interfaces
and QoS driven control and management mechanisms across all architectural layers. This paper examines the state-of-the-art
in the development of QoS architectures. The approach taken is to present QoS terminology and a generalized QoS framework
for understanding and discussing QoS in the context of distributed multimedia systems. Following this, we evaluate a number
of QoS architectures that have emerged in the literature. 相似文献
39.
A Peer-to-Peer Approach to Web Service Discovery 总被引:9,自引:0,他引:9
Web Services are emerging as a dominant paradigm for constructing and composing distributed business applications and enabling enterprise-wide interoperability. A critical factor to the overall utility of Web Services is a scalable, flexible and robust discovery mechanism. This paper presents a Peer-to-Peer (P2P) indexing system and associated P2P storage that supports large-scale, decentralized, real-time search capabilities. The presented system supports complex queries containing partial keywords and wildcards. Furthermore, it guarantees that all existing data elements matching a query will be found with bounded costs in terms of number of messages and number of nodes involved. The key innovation is a dimension reducing indexing scheme that effectively maps the multidimensional information space to physical peers. The design and an experimental evaluation of the system are presented. 相似文献
40.
Scheduling problems can be viewed as a set of temporal metric and disjunctive constraints and so they can be formulated in terms of CSP techniques. In the literature, there are CSP-based methods which sequentially interleave search efforts with the application of consistency enforcing mechanisms and variable/ordering heuristics. Therefore, the number of backtrackings needed to obtain a solution is reduced. In this paper, we propose a new method that effectively integrates the CSP process into a limited closure process: not by interleaving them but rather as a part of the same process. Such an integration allows us to define more informed heuristics. These heuristics are used to limit the complete closure process to a maximum number of disjunctions, thereby reducing its complexity while at the same time reducing the search space. Some open disjunctive solutions can be maintained in the CSP process, limiting the number of backtrackings necessary, and avoiding having to know all the problem constraints in advance. Our experiments with flow-shop and job-shop instances show that this approach obtains a feasible solution/optimal solution without having to use backtracking in most cases. We also analyze the behaviour of our algorithm when some constraints are known dynamically and we demonstrate that it can provide better results than a pure CSP process. 相似文献