全文获取类型
收费全文 | 3684篇 |
免费 | 258篇 |
国内免费 | 2篇 |
专业分类
电工技术 | 112篇 |
综合类 | 4篇 |
化学工业 | 873篇 |
金属工艺 | 73篇 |
机械仪表 | 116篇 |
建筑科学 | 123篇 |
矿业工程 | 8篇 |
能源动力 | 137篇 |
轻工业 | 527篇 |
水利工程 | 17篇 |
石油天然气 | 13篇 |
无线电 | 293篇 |
一般工业技术 | 909篇 |
冶金工业 | 64篇 |
原子能技术 | 11篇 |
自动化技术 | 664篇 |
出版年
2023年 | 28篇 |
2022年 | 43篇 |
2021年 | 102篇 |
2020年 | 89篇 |
2019年 | 99篇 |
2018年 | 143篇 |
2017年 | 127篇 |
2016年 | 168篇 |
2015年 | 119篇 |
2014年 | 185篇 |
2013年 | 379篇 |
2012年 | 263篇 |
2011年 | 278篇 |
2010年 | 217篇 |
2009年 | 176篇 |
2008年 | 180篇 |
2007年 | 156篇 |
2006年 | 124篇 |
2005年 | 85篇 |
2004年 | 59篇 |
2003年 | 68篇 |
2002年 | 52篇 |
2001年 | 39篇 |
2000年 | 40篇 |
1999年 | 41篇 |
1998年 | 38篇 |
1997年 | 18篇 |
1996年 | 37篇 |
1995年 | 25篇 |
1994年 | 33篇 |
1993年 | 25篇 |
1992年 | 25篇 |
1991年 | 20篇 |
1990年 | 21篇 |
1989年 | 20篇 |
1988年 | 15篇 |
1985年 | 37篇 |
1984年 | 35篇 |
1983年 | 28篇 |
1982年 | 25篇 |
1981年 | 38篇 |
1980年 | 33篇 |
1979年 | 26篇 |
1978年 | 24篇 |
1977年 | 18篇 |
1976年 | 20篇 |
1975年 | 13篇 |
1974年 | 12篇 |
1973年 | 15篇 |
1972年 | 14篇 |
排序方式: 共有3944条查询结果,搜索用时 31 毫秒
91.
92.
Waser J Fuchs R Ribicić H Schindler B Blöschl G Gröller E 《IEEE transactions on visualization and computer graphics》2010,16(6):1458-1467
In this paper we present World Lines as a novel interactive visualization that provides complete control over multiple heterogeneous simulation runs. In many application areas, decisions can only be made by exploring alternative scenarios. The goal of the suggested approach is to support users in this decision making process. In this setting, the data domain is extended to a set of alternative worlds where only one outcome will actually happen. World Lines integrate simulation, visualization and computational steering into a single unified system that is capable of dealing with the extended solution space. World Lines represent simulation runs as causally connected tracks that share a common time axis. This setup enables users to interfere and add new information quickly. A World Line is introduced as a visual combination of user events and their effects in order to present a possible future. To quickly find the most attractive outcome, we suggest World Lines as the governing component in a system of multiple linked views and a simulation component. World Lines employ linking and brushing to enable comparative visual analysis of multiple simulations in linked views. Analysis results can be mapped to various visual variables that World Lines provide in order to highlight the most compelling solutions. To demonstrate this technique we present a flooding scenario and show the usefulness of the integrated approach to support informed decision making. 相似文献
93.
Aleksandar Kovačević Branko Milosavljević Zora Konjović Milan Vidaković 《Multimedia Tools and Applications》2010,47(3):525-544
This paper presents a tunable content-based music retrieval (CBMR) system suitable the for retrieval of music audio clips. The audio clips are represented as extracted feature vectors. The CBMR system is expert-tunable by altering the feature space. The feature space is tuned according to the expert-specified similarity criteria expressed in terms of clusters of similar audio clips. The main goal of tuning the feature space is to improve retrieval performance, since some features may have more impact on perceived similarity than others. The tuning process utilizes our genetic algorithm. The R-tree index for efficient retrieval of audio clips is based on the clustering of feature vectors. For each cluster a minimal bounding rectangle (MBR) is formed, thus providing objects for indexing. Inserting new nodes into the R-tree is efficiently performed because of the chosen Quadratic Split algorithm. Our CBMR system implements the point query and the n-nearest neighbors query with the O(logn) time complexity. Different objective functions based on cluster similarity and dissimilarity measures are used for the genetic algorithm. We have found that all of them have similar impact on the retrieval performance in terms of precision and recall. The paper includes experimental results in measuring retrieval performance, reporting significant improvement over the untuned feature space. 相似文献
94.
Tatjana Davidović Dušan Ramljak Milica Šelmić Dušan Teodorović 《Computers & Operations Research》2011
Bee colony optimization (BCO) is a relatively new meta-heuristic designed to deal with hard combinatorial optimization problems. It is biologically inspired method that explores collective intelligence applied by the honey bees during nectar collecting process. In this paper we apply BCO to the p-center problem in the case of symmetric distance matrix. On the contrary to the constructive variant of the BCO algorithm used in recent literature, we propose variant of BCO based on the improvement concept (BCOi). The BCOi has not been significantly used in the relevant BCO literature so far. In this paper it is proved that BCOi can be a very useful concept for solving difficult combinatorial problems. The numerical experiments performed on well-known benchmark problems show that the BCOi is competitive with other methods and it can generate high-quality solutions within negligible CPU times. 相似文献
95.
96.
97.
Dario Alfè 《Computer Physics Communications》2009,180(12):2622-2633
The program phon calculates force constant matrices and phonon frequencies in crystals. From the frequencies it also calculates various thermodynamic quantities, like the Helmholtz free energy, the entropy, the specific heat and the internal energy of the harmonic crystal. The procedure is based on the small displacement method, and can be used in combination with any program capable to calculate forces on the atoms of the crystal. In order to examine the usability of the method, I present here two examples: metallic Al and insulating MgO. The phonons of these two materials are calculated using density functional theory. The small displacement method results are compared with those obtained using the linear response method. In the case of Al the method provides accurate phonon frequencies everywhere in the Brillouin Zone (BZ). In the case of MgO the longitudinal branch of the optical phonons near the centre of the BZ is incorrectly described as degenerate with the two transverse branches, because the non-analytical part of the dynamical matrix is ignored here; however, thermodynamic properties like the Helmholtz free are essentially unaffected.
Program summary
Program title: PHONCatalogue identifier: AEDP_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEDP_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.: 19 580No. of bytes in distributed program, including test data, etc.: 612 193Distribution format: tar.gzProgramming language: Fortran 90Computer: Any Unix, LinuxOperating system: UnixRAM: Depends on super-cell size, but usually negligibleClassification: 7.8External routines: Subprograms ZHEEV and DSYEV (Lapack); needs BLAS. A tutorial is provided with the distribution which requires the installation of the quantum-espresso package (http://www.quantum-espresso.org)Nature of problem: Stable crystals at low temperature can be well described by expanding the potential energy around the atomic equilibrium positions. The movements of the atoms around their equilibrium positions can then be described using harmonic theory, and is characterised by global vibrations called phonons, which can be identified by vectors in the Brillouin zone of the crystal, and there are 3 phonon branches for each atom in the primitive cell. The problem is to calculate the frequencies of these phonons for any arbitrary choice of q-vector in the Brillouin zone.Solution method: The small displacement method: each atom in the primitive cell is displaced by a small amount, and the forces induced on all the other atoms in the crystal are calculated and used to construct the force constant matrix. Supercells of ∼100 atoms are usually large enough to describe the force constant matrix up to the range where its elements have fallen to negligibly small values. The force constant matrix is then used to compute the dynamical matrix at any chosen q-vector in the Brillouin zone, and the diagonalisation of the dynamical matrix provides the squares of the phonon frequencies. The PHON code needs external programs to calculate these forces, and it can be used with any program capable of calculating forces in crystals. The most useful applications are obtained with codes based on density functional theory, but there is no restriction on what can be used.Running time: Negligible, typically a few seconds (or at most a few minutes) on a PC. It can take longer if very dense meshes of q-points are needed, for example, to compute very accurate phonon density of states. 相似文献98.
Analysis of low‐level usage data collected in empirical studies of user interaction is well known as a demanding task. Existing techniques for data collection and analysis are either application specific or data‐driven. This paper presents a workspace for data cleaning, transformation and analysis of low‐level usage data that we have developed and reports our experience with it. By its five‐level architecture, the workspace makes a distinction between more general data that typically can be used in initial data analysis and the data answering a specific research question. The workspace was used in four studies and in total 6.5M user actions were collected from 238 participants. The collected data have been proven to be useful for: (i) validating solution times, (ii) validating process conformances, (iii) exploratory studies on program comprehension for understanding use of classes and documents and (iv) testing hypotheses on keystroke latencies. We have found workspace creation to be demanding in time. Particularly demanding were determining the context of actions and dealing with deficiencies. However, once these processes were understood, it was easy to reuse the workspace for different experiments and to extend it to answer new research questions. Based on our experience, we give a set of guidelines that might help in setting up studies, collecting and preparing data. We recommend that designers of data collection instruments add context to each action. Furthermore, we recommend rapid iterations starting early in the process of data preparation and analysis, and covering both general and specific data. Copyright © 2009 John Wiley & Sons, Ltd. 相似文献
99.
Enhancing a dependable multiserver operating system with temporal protection via resource reservations 总被引:1,自引:0,他引:1
Antonio Mancina Dario Faggioli Giuseppe Lipari Jorrit N. Herder Ben Gras Andrew S. Tanenbaum 《Real-Time Systems》2009,43(2):177-210
Nowadays, microkernel-based systems are getting studied and adopted with a renewed interest in a wide number of IT scenarios. Their advantages over classical monolithic solutions mainly concern the dependability domain. By being capable of dynamically detect and solve non-expected behaviours within its core components, a microkernel-based OS would eventually run forever with no need to be restarted. Dependability in this context mainly aims at isolating components from a spatial point of view: a microkernel-based system may definitely not be adopted in the context of real-time environments, simply basing on this kind of protection only. One of the most active real-time research areas concerns adding temporal protection mechanisms to general purpose operating systems. By making use of such mechanisms, these systems become suitable for being adopted in the context of time-sensitive domains. Microkernel-based systems have always been thought of as a kind of platform not suited to real-time contexts, due to the high latencies introduced by the message passing technique as the only inter-process communication (IPC) facility within the system. With computer performances growing at a fairly high rate, this overhead becomes negligible with respect to the typical real-time processing times. In the last years, many algorithms belonging to the class of the so-called Resource Reservations (RRES) have been devised in order to provide the systems with the needed temporal isolation. By introducing a RRES-aware scheduler in the context of a microkernel-based system, we may enrich it with the temporal benefits it needs in order to be deployed within domains with real-time requirements. In this paper we propose a generic way to implement these mechanisms, dependent for a very small part on the underlying OS mechanisms. In order to show the generality of our RRES framework we implemented it in the context of Minix 3, a highly dependable microkernel-based OS with an impressive users base. 相似文献
100.
Lena Cibulski Denis Gračanin Alexandra Diehl Rainer Splechtna Mai Elshehaly Claudio Delrieux Krešimir Matković 《The Visual computer》2016,32(6-8):847-857
Widespread use of GPS and similar technologies makes it possible to collect extensive amounts of trajectory data. These data sets are essential for reasonable decision making in various application domains. Additional information, such as events taking place along a trajectory, makes data analysis challenging, due to data size and complexity. We present an integrated solution for interactive visual analysis and exploration of events along trajectories data. Our approach supports analysis of event sequences at three different levels of abstraction, namely spatial, temporal, and events themselves. Customized views as well as standard views are combined to form a coordinated multiple views system. In addition to trajectories and events, we include on-the-fly derived data in the analysis. We evaluate our integrated solution using the IEEE VAST 2015 Challenge data set. A successful detection and characterization of malicious activity indicate the usefulness and efficiency of the presented approach. 相似文献