全文获取类型
收费全文 | 8091篇 |
免费 | 473篇 |
国内免费 | 7篇 |
专业分类
电工技术 | 111篇 |
综合类 | 34篇 |
化学工业 | 2169篇 |
金属工艺 | 211篇 |
机械仪表 | 189篇 |
建筑科学 | 450篇 |
矿业工程 | 40篇 |
能源动力 | 257篇 |
轻工业 | 748篇 |
水利工程 | 45篇 |
石油天然气 | 5篇 |
无线电 | 666篇 |
一般工业技术 | 1673篇 |
冶金工业 | 516篇 |
原子能技术 | 55篇 |
自动化技术 | 1402篇 |
出版年
2023年 | 104篇 |
2022年 | 165篇 |
2021年 | 287篇 |
2020年 | 197篇 |
2019年 | 195篇 |
2018年 | 210篇 |
2017年 | 204篇 |
2016年 | 299篇 |
2015年 | 318篇 |
2014年 | 357篇 |
2013年 | 565篇 |
2012年 | 505篇 |
2011年 | 662篇 |
2010年 | 445篇 |
2009年 | 451篇 |
2008年 | 427篇 |
2007年 | 393篇 |
2006年 | 310篇 |
2005年 | 264篇 |
2004年 | 214篇 |
2003年 | 169篇 |
2002年 | 173篇 |
2001年 | 91篇 |
2000年 | 114篇 |
1999年 | 108篇 |
1998年 | 159篇 |
1997年 | 129篇 |
1996年 | 121篇 |
1995年 | 89篇 |
1994年 | 80篇 |
1993年 | 65篇 |
1992年 | 62篇 |
1991年 | 43篇 |
1990年 | 35篇 |
1989年 | 28篇 |
1988年 | 34篇 |
1987年 | 34篇 |
1986年 | 26篇 |
1985年 | 28篇 |
1984年 | 23篇 |
1983年 | 22篇 |
1982年 | 21篇 |
1981年 | 22篇 |
1980年 | 26篇 |
1978年 | 30篇 |
1977年 | 28篇 |
1976年 | 34篇 |
1975年 | 23篇 |
1974年 | 20篇 |
1973年 | 23篇 |
排序方式: 共有8571条查询结果,搜索用时 31 毫秒
231.
232.
Satellite-based estimates of groundwater storage variations in large drainage basins with extensive floodplains 总被引:2,自引:0,他引:2
Frédéric Frappart Fabrice Papa Andreas Güntner Joecila Santos da Silva Frédérique Seyler William B. Rossow Marie-Paule Bonnet 《Remote sensing of environment》2011,115(6):1588-1594
This study presents monthly estimates of groundwater anomalies in a large river basin dominated by extensive floodplains, the Negro River Basin, based on the synergistic analysis using multisatellite observations and hydrological models. For the period 2003-2004, changes in water stored in the aquifer is isolated from the total water storage measured by GRACE by removing contributions of both the surface reservoir, derived from satellite imagery and radar altimetry, and the root zone reservoir simulated by WGHM and LaD hydrological models. The groundwater anomalies show a realistic spatial pattern compared with the hydrogeological map of the basin, and similar temporal variations to local in situ groundwater observations and altimetry-derived level height measurements. Results highlight the potential of combining multiple satellite techniques with hydrological modeling to estimate the evolution of groundwater storage. 相似文献
233.
The K-connected Deployment and Power Assignment Problem (DPAP) in WSNs aims at deciding both the sensor locations and transmit power levels, for maximizing the network coverage and lifetime objectives under K-connectivity constraints, in a single run. Recently, it is shown that the Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) is a strong enough tool for dealing with unconstraint real life problems (such as DPAP), emphasizing the importance of incorporating problem-specific knowledge for increasing its efficiency. In a constrained Multi-objective Optimization Problem (such as K-connected DPAP), the search space is divided into feasible and infeasible regions. Therefore, problem-specific operators are designed for MOEA/D to direct the search into optimal, feasible regions of the space. Namely, a DPAP-specific population initialization that seeds the initial solutions into promising regions, problem-specific genetic operators (i.e. M-tournament selection, adaptive crossover and mutation) for generating good, feasible solutions and a DPAP-specific Repair Heuristic (RH) that transforms an infeasible solution into a feasible one and maintains the MOEA/D’s efficiency simultaneously. Simulation results have shown the importance of each proposed operator and their interrelation, as well as the superiority of the DPAP-specific MOEA/D against the popular constrained NSGA-II in several WSN instances. 相似文献
234.
Jayaraman J. ThiagarajanKarthikeyan N. Ramamurthy Andreas Spanias 《Pattern recognition letters》2011,32(9):1299-1304
K-hyperline clustering is an iterative algorithm based on singular value decomposition and it has been successfully used in sparse component analysis. In this paper, we prove that the algorithm converges to a locally optimal solution for a given set of training data, based on Lloyd’s optimality conditions. Furthermore, the local optimality is shown by developing an Expectation-Maximization procedure for learning dictionaries to be used in sparse representations and by deriving the clustering algorithm as its special case. The cluster centroids obtained from the algorithm are proved to tessellate the space into convex Voronoi regions. The stability of clustering is shown by posing the problem as an empirical risk minimization procedure over a function class. It is proved that, under certain conditions, the cluster centroids learned from two sets of i.i.d. training samples drawn from the same probability space become arbitrarily close to each other, as the number of training samples increase asymptotically. 相似文献
235.
Andreas Bley 《Algorithmica》2011,60(1):21-45
Most data networks nowadays use shortest path protocols to route the traffic. Given administrative routing lengths for the
links of the network, all data packets are sent along shortest paths with respect to these lengths from their source to their
destination. 相似文献
236.
Jaap-Henk Hoepman Andreas Larsson Philippas Tsigas 《Theoretical computer science》2011,412(40):5631-5647
In sensor networks, correct clocks have arbitrary starting offsets and nondeterministic fluctuating skews. We consider an adversary that aims at tampering with the clock synchronization by intercepting messages, replaying intercepted messages (after the adversary’s choice of delay), and capturing nodes (i.e., revealing their secret keys and impersonating them). We present an efficient clock sampling algorithm which tolerates attacks by this adversary, collisions, a bounded amount of losses due to ambient noise, and a bounded number of captured nodes that can jam, intercept, and send fake messages. The algorithm is self-stabilizing, so if these bounds are temporarily violated, the system can efficiently stabilize back to a correct state. Using this clock sampling algorithm, we construct the first self-stabilizing algorithm for secure clock synchronization in sensor networks that is resilient to the aforementioned adversarial attacks. 相似文献
237.
238.
Mauthe Andreas Garcia Francisco Hutchison David Yeadon Nicholas 《Multimedia Tools and Applications》2001,13(3):285-306
Multimedia group applications often operate in an environment where the various participants are located on systems and communication links with different capabilities. Mechanisms are required that ensure full-quality media for high-performance workstations but lower-quality media for playout at low-end systems. QoS filters have been proposed as a way to adapt QoS to the user specified level by changing the structure of a media stream in a well defined way. Resource reservation and QoS filter instantiation should be closely integrated since both represent one particular aspect of the provision of individualistic QoS for heterogeneous users in multipeer communications. The Internet reservation protocol RSVP is receiver oriented and allows each receiver to specify its resource requirements. However, no actual mechanisms are defined that adapt the data stream to the receiver specified QoS requirements.In this paper we present an enhanced version of RSVP (called RSVP++) that integrates resource reservation and QoS filter control. In order to achieve this integration we extend the RSVP functional model and define a new QoS service class. RSVP++ can coexist with common RSVP systems, thus, openness and interoperability of the system are ensured. 相似文献
239.
Constraint-based deductive model checking 总被引:2,自引:0,他引:2
Giorgio Delzanno Andreas Podelski 《International Journal on Software Tools for Technology Transfer (STTT)》2001,3(3):250-270
We show that constraint logic programming (CLP) can serve as a conceptual basis and as a practical implementation platform
for the model checking of infinite-state systems. CLP programs are logical formulas (built up from constraints) that have
both a logical interpretation and an operational semantics. Our contributions are: (1) a translation of concurrent systems
(imperative programs) into CLP programs with the same operational semantics; and (2) a deductive method for verifying safety
and liveness properties of the systems which is based on the logical interpretation of the CLP programs produced by the translation.
We have implemented the method in a CLP system and verified well-known examples of infinite-state programs over integers,
using linear constraints here as opposed to Presburger arithmetic as in previous solutions.
Published online: 18 July 2001 相似文献
240.