全文获取类型
收费全文 | 8359篇 |
免费 | 480篇 |
国内免费 | 9篇 |
专业分类
电工技术 | 114篇 |
综合类 | 23篇 |
化学工业 | 2189篇 |
金属工艺 | 242篇 |
机械仪表 | 147篇 |
建筑科学 | 591篇 |
矿业工程 | 98篇 |
能源动力 | 282篇 |
轻工业 | 592篇 |
水利工程 | 50篇 |
石油天然气 | 20篇 |
武器工业 | 1篇 |
无线电 | 661篇 |
一般工业技术 | 1728篇 |
冶金工业 | 463篇 |
原子能技术 | 48篇 |
自动化技术 | 1599篇 |
出版年
2024年 | 15篇 |
2023年 | 117篇 |
2022年 | 208篇 |
2021年 | 330篇 |
2020年 | 199篇 |
2019年 | 210篇 |
2018年 | 231篇 |
2017年 | 267篇 |
2016年 | 351篇 |
2015年 | 293篇 |
2014年 | 377篇 |
2013年 | 596篇 |
2012年 | 533篇 |
2011年 | 717篇 |
2010年 | 506篇 |
2009年 | 475篇 |
2008年 | 484篇 |
2007年 | 424篇 |
2006年 | 379篇 |
2005年 | 303篇 |
2004年 | 252篇 |
2003年 | 186篇 |
2002年 | 165篇 |
2001年 | 102篇 |
2000年 | 96篇 |
1999年 | 114篇 |
1998年 | 123篇 |
1997年 | 95篇 |
1996年 | 86篇 |
1995年 | 51篇 |
1994年 | 59篇 |
1993年 | 37篇 |
1992年 | 47篇 |
1991年 | 26篇 |
1990年 | 39篇 |
1989年 | 23篇 |
1988年 | 28篇 |
1987年 | 27篇 |
1986年 | 23篇 |
1985年 | 20篇 |
1984年 | 29篇 |
1983年 | 17篇 |
1982年 | 18篇 |
1981年 | 15篇 |
1980年 | 20篇 |
1978年 | 12篇 |
1977年 | 16篇 |
1976年 | 26篇 |
1975年 | 13篇 |
1969年 | 11篇 |
排序方式: 共有8848条查询结果,搜索用时 31 毫秒
91.
92.
Ville T. Heikkilä Maria Paasivaara Casper Lasssenius Daniela Damian Christian Engblom 《Empirical Software Engineering》2017,22(6):2892-2936
In a large organization, informal communication and simple backlogs are not sufficient for the management of requirements and development work. Many large organizations are struggling to successfully adopt agile methods, but there is still little scientific knowledge on requirements management in large-scale agile development organizations. We present an in-depth study of an Ericsson telecommunications node development organization which employs a large scale agile method to develop telecommunications system software. We describe how the requirements flow from strategy to release, and related benefits and problems. Data was collected by 43 interviews, which were analyzed qualitatively. The requirements management was done in three different processes, each of which had a different process model, purpose and planning horizon. The release project management process was plan-driven, feature development process was continuous and implementation management process was agile. The perceived benefits included reduced development lead time, increased flexibility, increased planning efficiency, increased developer motivation and improved communication effectiveness. The recognized problems included difficulties in balancing planning effort, overcommitment, insufficient understanding of the development team autonomy, defining the product owner role, balancing team specialization, organizing system-level work and growing technical debt. The study indicates that agile development methods can be successfully employed in organizations where the higher level planning processes are not agile. Combining agile methods with a flexible feature development process can bring many benefits, but large-scale software development seems to require specialist roles and significant coordination effort. 相似文献
93.
94.
95.
Marco Tiloca Christian Gehrmann Ludwig Seitz 《International Journal of Information Security》2017,16(2):173-193
DTLS is a transport layer security protocol designed to provide secure communication over unreliable datagram protocols. Before starting to communicate, a DTLS client and server perform a specific handshake in order to establish a secure session and agree on a common security context. However, the DTLS handshake is affected by two relevant issues. First, the DTLS server is vulnerable to a specific Denial of Service (DoS) attack aimed at forcing the establishment of several half-open sessions. This may exhaust memory and network resources on the server, so making it less responsive or even unavailable to legitimate clients. Second, although it is one of the most efficient key provisioning approaches adopted in DTLS, the pre-shared key provisioning mode does not scale well with the number of clients, it may result in scalability issues on the server side, and it complicates key re-provisioning in dynamic scenarios. This paper presents a single and efficient security architecture which addresses both issues, by substantially limiting the impact of DoS, and reducing the number of keys stored on the server side to one unit only. Our approach does not break the existing standard and does not require any additional message exchange between DTLS client and server. Our experimental results show that our approach requires a shorter amount of time to complete a handshake execution and consistently reduces the time a DTLS server is exposed to a DoS instance. We also show that it considerably improves a DTLS server in terms of service availability and robustness against DoS attack. 相似文献
96.
Christian Lyzell Torkel Glad Martin Enqvist Lennart LjungAuthor vitae 《Automatica》2011,47(9):1896-1904
The framework of differential algebra, especially Ritt’s algorithm, has turned out to be a useful tool when analyzing the identifiability of certain nonlinear continuous-time model structures. This framework provides conceptually interesting means to analyze complex nonlinear model structures via the much simpler linear regression models. One difficulty when working with continuous-time signals is dealing with white noise in nonlinear systems. In this paper, difference algebraic techniques, which mimic the differential-algebraic techniques, are presented. Besides making it possible to analyze discrete-time model structures, this opens up the possibility of dealing with noise. Unfortunately, the corresponding discrete-time identifiability results are not as conclusive as in continuous time. In addition, an alternative elimination scheme to Ritt’s algorithm will be formalized and the resulting algorithm is analyzed when applied to a special form of the nfir model structure. 相似文献
97.
We describe an implementation to solve Poisson?s equation for an isolated system on a unigrid mesh using FFTs. The method solves the equation globally on mesh blocks distributed across multiple processes on a distributed-memory parallel computer. Test results to demonstrate the convergence and scaling properties of the implementation are presented. The solver is offered to interested users as the library PSPFFT.
Program summary
Program title: PSPFFTCatalogue identifier: AEJK_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEJK_v1_0.htmlProgram obtainable from: CPC Program Library, Queen?s University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 110 243No. of bytes in distributed program, including test data, etc.: 16 332 181Distribution format: tar.gzProgramming language: Fortran 95Computer: Any architecture with a Fortran 95 compiler, distributed memory clustersOperating system: Linux, UnixHas the code been vectorized or parallelized?: Yes, using MPI. An arbitrary number of processors may be used (subject to some constraints). The program has been tested on from 1 up to ∼ 13 000 processors. RAM: Depends on the problem size, approximately 170 MBytes for 483 cells per process.Classification: 4.3, 6.5External routines: MPI (http://www.mcs.anl.gov/mpi/), FFTW (http://www.fftw.org), Silo (https://wci.llnl.gov/codes/silo/) (only necessary for running test problem).Nature of problem: Solving Poisson?s equation globally on unigrid mesh distributed across multiple processes on distributed memory system.Solution method: Numerical solution using multidimensional discrete Fourier Transform in a parallel Fortran 95 code.Unusual features: This code can be compiled as a library to be readily linked and used as a blackbox Poisson solver with other codes.Running time: Depends on the size of the problem, but typically less than 1 second per solve. 相似文献98.
In this paper we revisit the computation and visualization of equivalents to isocontours in uncertain scalar fields. We model uncertainty by discrete random fields and, in contrast to previous methods, also take arbitrary spatial correlations into account. Starting with joint distributions of the random variables associated to the sample locations, we compute level crossing probabilities for cells of the sample grid. This corresponds to computing the probabilities that the well‐known symmetry‐reduced marching cubes cases occur in random field realizations. For Gaussian random fields, only marginal density functions that correspond to the vertices of the considered cell need to be integrated. We compute the integrals for each cell in the sample grid using a Monte Carlo method. The probabilistic ansatz does not suffer from degenerate cases that usually require case distinctions and solutions of ill‐conditioned problems. Applications in 2D and 3D, both to synthetic and real data from ensemble simulations in climate research, illustrate the influence of spatial correlations on the spatial distribution of uncertain isocontours. 相似文献
99.
100.
Aigner W Miksch S Müller W Schumann H Tominski C 《IEEE transactions on visualization and computer graphics》2008,14(1):47-60
Providing appropriate methods to facilitate the analysis of time-oriented data is a key issue in many application domains. In this paper, we focus on the unique role of the parameter time in the context of visually driven data analysis. We will discuss three major aspects - visualization, analysis, and the user. It will be illustrated that it is necessary to consider the characteristics of time when generating visual representations. For that purpose we take a look at different types of time and present visual examples. Integrating visual and analytical methods has become an increasingly important issue. Therefore, we present our experiences in temporal data abstraction, principal component analysis, and clustering of larger volumes of time-oriented data. The third main aspect we discuss is supporting user-centered visual analysis. We describe event-based visualization as a promising means to adapt the visualization pipeline to needs and tasks of users. 相似文献