全文获取类型
收费全文 | 73198篇 |
免费 | 5665篇 |
国内免费 | 2762篇 |
专业分类
电工技术 | 3918篇 |
技术理论 | 6篇 |
综合类 | 4446篇 |
化学工业 | 12618篇 |
金属工艺 | 3965篇 |
机械仪表 | 4841篇 |
建筑科学 | 5194篇 |
矿业工程 | 2395篇 |
能源动力 | 2243篇 |
轻工业 | 4879篇 |
水利工程 | 1007篇 |
石油天然气 | 5264篇 |
武器工业 | 464篇 |
无线电 | 7646篇 |
一般工业技术 | 9417篇 |
冶金工业 | 3801篇 |
原子能技术 | 759篇 |
自动化技术 | 8762篇 |
出版年
2024年 | 228篇 |
2023年 | 1217篇 |
2022年 | 1958篇 |
2021年 | 2916篇 |
2020年 | 2186篇 |
2019年 | 1948篇 |
2018年 | 2297篇 |
2017年 | 2525篇 |
2016年 | 2097篇 |
2015年 | 2746篇 |
2014年 | 3472篇 |
2013年 | 4245篇 |
2012年 | 4410篇 |
2011年 | 4920篇 |
2010年 | 4213篇 |
2009年 | 3991篇 |
2008年 | 3864篇 |
2007年 | 3719篇 |
2006年 | 3799篇 |
2005年 | 3433篇 |
2004年 | 2283篇 |
2003年 | 2084篇 |
2002年 | 1869篇 |
2001年 | 1640篇 |
2000年 | 1799篇 |
1999年 | 2036篇 |
1998年 | 1758篇 |
1997年 | 1408篇 |
1996年 | 1400篇 |
1995年 | 1178篇 |
1994年 | 939篇 |
1993年 | 709篇 |
1992年 | 540篇 |
1991年 | 420篇 |
1990年 | 324篇 |
1989年 | 249篇 |
1988年 | 220篇 |
1987年 | 138篇 |
1986年 | 102篇 |
1985年 | 90篇 |
1984年 | 59篇 |
1983年 | 35篇 |
1982年 | 42篇 |
1981年 | 28篇 |
1980年 | 22篇 |
1979年 | 13篇 |
1977年 | 7篇 |
1976年 | 8篇 |
1975年 | 5篇 |
1945年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 437 毫秒
171.
172.
Exploring spatial datasets with histograms 总被引:2,自引:0,他引:2
Chengyu Sun Nagender Bandi Divyakant Agrawal Amr El Abbadi 《Distributed and Parallel Databases》2006,20(1):57-88
As online spatial datasets grow both in number and sophistication, it becomes increasingly difficult for users to decide whether
a dataset is suitable for their tasks, especially when they do not have prior knowledge of the dataset. In this paper, we
propose browsing as an effective and efficient way to explore the content of a spatial dataset. Browsing allows users to view the size of
a result set before evaluating the query at the database, thereby avoiding zero-hit/mega-hit queries and saving time and resources.
Although the underlying technique supporting browsing is similar to range query aggregation and selectivity estimation, spatial
dataset browsing poses some unique challenges. In this paper, we identify a set of spatial relations that need to be supported
in browsing applications, namely, the contains, contained and the overlap relations. We prove a lower bound on the storage required to answer queries about the contains relation accurately at a given resolution. We then present three storage-efficient approximation algorithms which we believe
to be the first to estimate query results about these spatial relations. We evaluate these algorithms with both synthetic
and real world datasets and show that they provide highly accurate estimates for datasets with various characteristics.
Recommended by: Sunil Prabhakar
Work supported by NSF grants IIS 02-23022 and CNF 04-23336. An earlier version of this paper appeared in the 17th International
Conference on Data Engineering (ICDE 2001). 相似文献
173.
174.
Effect of deformation route on microstructural development in aluminum processed by equal channel angular extrusion 总被引:3,自引:0,他引:3
Pei-Ling Sun Po-We Kao Chih-Pu Chang 《Metallurgical and Materials Transactions A》2004,35(4):1359-1368
Aluminum has been deformed by equal channel angular extrusion (ECAE) to obtain submicron-grained structures under different
deformation routes. The deformation routes were varied by rotating billets through 0, 90, and 180 deg between each extrusion
pass, and were designated as route A, BC, and C, respectively. Based on quantitative microstructural analysis, the effectiveness of the deformation route is shown
to depend upon the different definition used. The order of effectiveness is (a) A > BC > C for both 90 and 120 deg dies, in terms of the generation of high-angle grain boundaries (HAGBs); (b) BC > C > A for both 90 and 120 deg dies, in terms of the formation of equiaxed shape of grains; and (c) BC > A > C for 90 deg die and BC ∼ A > C for 120 die, in terms of reducing grain size. It is suggested that the generation of HAGBs can be related to the
accumulation of nonredundant strain, while the shape and orientation of grains may be linked to the shearing patterns of the
deformation route. 相似文献
175.
高分子量丙烯酰胺-DAC共聚物的研制 总被引:7,自引:0,他引:7
采用复合引发体系 ,以丙烯酰胺 (AM)和阳离子单体丙烯酰氧乙基三甲基氯化铵(DAC)为共聚体 ,进行水溶液绝热聚合 ,研制了一种DAC单体含量为 4 0 %~ 5 0 %、相对分子质量大于 1× 10 7的阳离子型聚丙烯酰胺。 相似文献
176.
Perturbation analysis and control of two-class stochastic fluid models for communication networks 总被引:2,自引:0,他引:2
Cassandras C.G. Gang Sun Panayiotou C.G. Wardi Y. 《Automatic Control, IEEE Transactions on》2003,48(5):770-782
This paper uses stochastic fluid models (SFMs) for the control and optimization (rather than performance analysis) of communication network nodes processing two classes of traffic: one is uncontrolled and the other is subject to threshold-based buffer control. We derive gradient estimators for packet loss and workload related performance metrics with respect to threshold parameters. These estimators are shown to be unbiased and directly observable from a sample path without any knowledge of underlying stochastic characteristics of the traffic processes. This renders them computable in online environments and easily implementable for network management and control. We further demonstrate their use in buffer control problems where our SFM-based estimators are evaluated based on data from an actual system. 相似文献
177.
A 1 GHz CMOS analog front-end for general partial response maximum likelihood (GPRML) read channel in hard disk drive application has been implemented in 0.35 /spl mu/m CMOS. A continuous time analog filter fulfills the relaxed equalization for GPRML detection and can save up to 35% power consumption for the whole read channel. An analog DFE-based timing recovery loop is implemented to avoid the extremely long latency in the digital signal processing path (Viterbi decoder). The measured performances is 1.1 dB off simulations at 800 MHz and 1.6 dB off at 1GHz. The chip draws 240 mW from a 3.3 V supply at 800MHz clock and 380 mW from a 3.6 V supply at 1 GHz clock. 相似文献
178.
Zhishou Zhang Qibin Sun Wai-Choong Wong John Apostolopoulos Susie Wee 《Multimedia, IEEE Transactions on》2007,9(2):320-331
This paper proposes an optimized content-aware authentication scheme for JPEG-2000 streams over lossy networks, where a received packet is consumed only when it is both decodable and authenticated. In a JPEG-2000 codestream, some packets are more important than others in terms of coding dependency and image quality. This naturally motivates allocating more redundant authentication information for the more important packets in order to maximize their probability of authentication and thereby minimize the distortion at the receiver. Towards this goal, with the awareness of its corresponding image content, we formulate an optimization framework to compute an authentication graph to maximize the expected media quality at the receiver, given specific authentication overhead and knowledge of network loss rate. System analysis and experimental results demonstrate that the proposed scheme achieves our design goal in that the rate-distortion (R-D) curve of the authenticated image is very close to the R-D curve when no authentication is required 相似文献
179.
Mining process models with non-free-choice constructs 总被引:6,自引:0,他引:6
Lijie Wen Wil M. P. van der Aalst Jianmin Wang Jiaguang Sun 《Data mining and knowledge discovery》2007,15(2):145-180
Process mining aims at extracting information from event logs to capture the business process as it is being executed. Process
mining is particularly useful in situations where events are recorded but there is no system enforcing people to work in a
particular way. Consider for example a hospital where the diagnosis and treatment activities are recorded in the hospital
information system, but where health-care professionals determine the “careflow.” Many process mining approaches have been
proposed in recent years. However, in spite of many researchers’ persistent efforts, there are still several challenging problems
to be solved. In this paper, we focus on mining non-free-choice constructs, i.e., situations where there is a mixture of choice
and synchronization. Although most real-life processes exhibit non-free-choice behavior, existing algorithms are unable to
adequately deal with such constructs. Using a Petri-net-based representation, we will show that there are two kinds of causal
dependencies between tasks, i.e., explicit and implicit ones. We propose an algorithm that is able to deal with both kinds
of dependencies. The algorithm has been implemented in the ProM framework and experimental results shows that the algorithm
indeed significantly improves existing process mining techniques. 相似文献
180.