全文获取类型
收费全文 | 7934篇 |
免费 | 484篇 |
国内免费 | 18篇 |
专业分类
电工技术 | 227篇 |
综合类 | 35篇 |
化学工业 | 1942篇 |
金属工艺 | 224篇 |
机械仪表 | 206篇 |
建筑科学 | 251篇 |
矿业工程 | 38篇 |
能源动力 | 269篇 |
轻工业 | 1177篇 |
水利工程 | 54篇 |
石油天然气 | 46篇 |
武器工业 | 1篇 |
无线电 | 485篇 |
一般工业技术 | 1819篇 |
冶金工业 | 249篇 |
原子能技术 | 73篇 |
自动化技术 | 1340篇 |
出版年
2023年 | 82篇 |
2022年 | 115篇 |
2021年 | 240篇 |
2020年 | 196篇 |
2019年 | 186篇 |
2018年 | 332篇 |
2017年 | 319篇 |
2016年 | 365篇 |
2015年 | 276篇 |
2014年 | 385篇 |
2013年 | 790篇 |
2012年 | 514篇 |
2011年 | 609篇 |
2010年 | 460篇 |
2009年 | 402篇 |
2008年 | 314篇 |
2007年 | 272篇 |
2006年 | 194篇 |
2005年 | 207篇 |
2004年 | 121篇 |
2003年 | 152篇 |
2002年 | 155篇 |
2001年 | 127篇 |
2000年 | 87篇 |
1999年 | 77篇 |
1998年 | 103篇 |
1997年 | 94篇 |
1996年 | 88篇 |
1995年 | 60篇 |
1994年 | 65篇 |
1993年 | 55篇 |
1992年 | 45篇 |
1991年 | 44篇 |
1990年 | 38篇 |
1989年 | 39篇 |
1987年 | 28篇 |
1986年 | 31篇 |
1985年 | 60篇 |
1984年 | 68篇 |
1983年 | 58篇 |
1982年 | 51篇 |
1981年 | 57篇 |
1980年 | 57篇 |
1979年 | 46篇 |
1978年 | 38篇 |
1977年 | 39篇 |
1976年 | 41篇 |
1975年 | 31篇 |
1974年 | 27篇 |
1973年 | 32篇 |
排序方式: 共有8436条查询结果,搜索用时 15 毫秒
91.
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. 相似文献
92.
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. 相似文献
93.
94.
Sustainable supply chain management (SSCM) provides economic, social end environmental requirements in material and service flows occurring between suppliers, manufacturers and customers. SSCM structure is considered as a prerequisite for a sustainable success. Thus designing an effective SCM structure provides competitive advantages for the companies. In order to achieve an effective design of this structure, it is possible to apply quality function deployment (QFD) approach which is successfully applied as an effective product and system development tool. This study presents a decision framework where analytic network process (ANP) integrated QFD and zero-one goal programming (ZOGP) models are used in order to determine the design requirements which are more effective in achieving a sustainable supply chain (SSC). The first phase of the QFD is the house of quality (HOQ) which transforms customer requirements into product design requirements. In this study, after determining the sustainability requirements named customer requirements (CRs) and design requirements (DRs) of a SSC, ANP is employed to determine the importance levels in the HOQ considering the interrelationships among the DRs and CRs. Furthermore ZOGP approach is used to take into account different objectives of the problem. The proposed method is applied through a case study and obtained results are discussed. 相似文献
95.
In this study, a novel OFF-set based direct-cover Exact Minimization Algorithm (EMA) is proposed for single-output Boolean functions represented in a sum-of-products form. To obtain the complete set of prime implicants covering the given Target Minterm (ON-minterm), the proposed method uses OFF-cubes (OFF-minterms) expanded by this Target Minterm. The amount of temporary results produced by this method does not exceed the size of the OFF-set. In order to achieve the goal of this study, which is to make faster computations, logic operations were used instead of the standard operations. Expansion OFF-cubes, commutative absorption operations and intersection operations are realized by logic operations for fast computation. The proposed minimization method is tested on several classes of benchmarks and then compared with the ESPRESSO algorithm. The results show that the proposed algorithm obtains more accurate and faster results than ESPRESSO does. 相似文献
96.
97.
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.
We present a theoretical model for self-assembling DNA tiles with flexible branches. We encode an instance of a “problem” as a pot of such tiles for which a “solution” is an assembled complete complex without any free sticky ends. Using the number of tiles in an assembled complex as a measure of complexity we show how NTIME classes (such as NP and NEXP) can be represented with corresponding classes of the model. 相似文献
100.