全文获取类型
收费全文 | 105333篇 |
免费 | 1732篇 |
国内免费 | 486篇 |
专业分类
电工技术 | 1041篇 |
综合类 | 2353篇 |
化学工业 | 16351篇 |
金属工艺 | 5192篇 |
机械仪表 | 3454篇 |
建筑科学 | 3832篇 |
矿业工程 | 718篇 |
能源动力 | 1772篇 |
轻工业 | 5653篇 |
水利工程 | 1440篇 |
石油天然气 | 397篇 |
武器工业 | 1篇 |
无线电 | 10630篇 |
一般工业技术 | 20199篇 |
冶金工业 | 5338篇 |
原子能技术 | 391篇 |
自动化技术 | 28789篇 |
出版年
2023年 | 152篇 |
2022年 | 308篇 |
2021年 | 533篇 |
2020年 | 315篇 |
2019年 | 330篇 |
2018年 | 14806篇 |
2017年 | 13680篇 |
2016年 | 10378篇 |
2015年 | 1074篇 |
2014年 | 903篇 |
2013年 | 1685篇 |
2012年 | 4173篇 |
2011年 | 10766篇 |
2010年 | 9239篇 |
2009年 | 6492篇 |
2008年 | 7905篇 |
2007年 | 8753篇 |
2006年 | 1043篇 |
2005年 | 2045篇 |
2004年 | 1877篇 |
2003年 | 1836篇 |
2002年 | 1179篇 |
2001年 | 484篇 |
2000年 | 546篇 |
1999年 | 465篇 |
1998年 | 468篇 |
1997年 | 402篇 |
1996年 | 385篇 |
1995年 | 303篇 |
1994年 | 313篇 |
1993年 | 307篇 |
1992年 | 260篇 |
1991年 | 234篇 |
1990年 | 201篇 |
1989年 | 230篇 |
1988年 | 193篇 |
1987年 | 177篇 |
1986年 | 174篇 |
1985年 | 239篇 |
1984年 | 214篇 |
1983年 | 184篇 |
1982年 | 168篇 |
1981年 | 195篇 |
1980年 | 130篇 |
1979年 | 147篇 |
1978年 | 145篇 |
1977年 | 129篇 |
1976年 | 138篇 |
1975年 | 120篇 |
1974年 | 105篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
81.
Sorin Manolache Petru Eles Zebo Peng 《International journal of parallel programming》2007,35(2):125-156
As feature sizes shrink, transient failures of on-chip network links become a critical problem. At the same time, many applications
require guarantees on both message arrival probability and response time. We address the problem of transient link failures
by means of temporally and spatially redundant transmission of messages, such that designer-imposed message arrival probabilities
are guaranteed. Response time minimisation is achieved by a heuristic that statically assigns multiple copies of each message
to network links, intelligently combining temporal and spatial redundancy. Concerns regarding energy consumption are addressed
in two ways. First, we reduce the total amount of transmitted messages, and, second, we minimise the application response
time such that the resulted time slack can be exploited for energy savings through voltage reduction. The advantages of the
proposed approach are guaranteed message arrival probability and guaranteed worst case application response time. 相似文献
82.
A fully-dense Cu-75 vol pct ZrW2O8 metal matrix composite was fabricated by hot isostatic pressing of Cu-coated ZrW2O8 particles. A small amount of the high-pressure γ-ZrW2O8 phase was created during the cooldown and depressurization following densification; near complete transformation to γ-ZrW2O8 was achieved by subsequent cold isostatic pressing. The thermal expansion behavior of the composite between 25°C and 325°C
was altered by the cold isostatic pressing treatment, and also depended on the length of time that had passed between thermal
cycles. The measured thermal expansion coefficients within specific temperature ranges varied from −6·10−6 K−1 to far above the thermal expansion coefficient of the copper matrix. The complex temperature-dependent expansion/contraction
behavior could be justified by considering the evolution of phase transformations taking place in the ZrW2O8 phase, which were observed by in-situ synchrotron X-ray diffraction measurements. 相似文献
83.
Holly Rushmeier Jason Dykes John Dill Peter Yoon 《Computer Graphics and Applications, IEEE》2007,27(6):12-16
Defining visualization education is still a work in progress. Visualization education is not just a subject within computer science. Computer scientists are not always the appropriate choice to teach visualization courses on their own. Visualization is not just mastering a set of concepts but acquiring skills. Student should learn by doing, either using one tool or a variety of tools, depending on the course's focus. 相似文献
84.
Peter H. Bischoff 《Canadian Metallurgical Quarterly》2007,11(1):4-14
Fundamental concepts of tension stiffening are used to explain why Branson’s equation for the effective moment of inertia Ie does not predict deflection well for fiber reinforced polymer (FRP) reinforced concrete beams. The tension stiffening component in Branson’s equation is shown to depend on the ratio of gross-to-cracked moment of inertia (Ig/Icr), and gives too much tension stiffening for beams with an Ig/Icr ratio greater than 3. FRP beams typically have an Ig/Icr ratio greater than 5, leading to a much stiffer response and underprediction of computed deflections as observed by others in the past. One common approach to computing deflection of FRP reinforced concrete beams has been to use a modified form of the Branson equation. This paper presents a rational development of appropriate modification factors needed to reduce the tension stiffening component in Branson’s original expression to realistic levels. Computed deflections using this approach give reasonable results with the right modification factor, and compare well with a more general unified approach that incorporates a realistic tension stiffening model. Comparison is made with the existing and past correction factors recommended by ACI 440 for predicting deflection of FRP beams. The method presently used by ACI 440 gives reasonable estimates of deflection for glass and carbon FRP reinforced beams. However, this method underestimates deflection of aramid FRP reinforced beams and is restricted to rectangular sections. A proposal is made for adoption of a simple modification factor that works well for all types of FRP bar and beam cross-sectional shape. 相似文献
85.
Nicolas Clauvelin Basile Audoly Sébastien Neukirch 《Scientific Modeling and Simulation》2007,14(1):95-101
The DNA molecule is modeled as an elastic rod with bending and twisting rigidities, subjected to external tension and twist applied at one end, the other end being clamped. We study the plectonemic equilibrium of such a rod, taking into account the impenetrability constraint. Numerical solutions of this boundary value problem have previously shown that purely elastic models can reproduce the supercoiling response of the DNA molecule. Using a variational approach, we derive analytical formulae for the elastic response of the filament, and extend former numerical results. 相似文献
86.
87.
Ready-to-drinks (RTDs) are composed of an alcoholic component and a soft-drink base and are primarily consumed by a youth market. The authors explored whether liking and experience with an RTD soft-drink base predicts liking for the RTD. Participants (N=350) from ages 12 to 30 years sampled 3 RTDs and their respective soft-drink and alcoholic components. For milk- and fruit-based RTDs, liking for and familiarity with their soft-drink base was the best predictor of liking for and familiarity with the RTD itself. For the Coke-based RTD, familiarity with and liking for bourbon best predicted familiarity with and liking for the RTD. All of these effects were consistent across blind and nonblind testing. The authors' results suggest that where there is perceptual similarity between the RTD and its soft-drink base, these beverages may provide an easy transition into alcohol consumption for novice drinkers. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
88.
89.
We show new upper bounds for problems in the W-hierarchy of fixed-parameter complexity. A crucial ingredient of our proofs
is an extension to the W-RAM model, which permits more-powerful operations but remains equivalent to the original. We use
the extended model to give new upper bounds for Subsetsum, Maximum Irredundant Set, and various problems concerning intersection
of finite-state machines. 相似文献
90.
Daniel Meister 《Theory of Computing Systems》2007,41(2):257-289
A finite recurrent system over sets of natural numbers of dimension n is a pair composed of n n-ary functions over sets of
natural numbers and an n-tuple of singleton sets of natural numbers. Every function is applied to the entries of the tuple
and computes a set of natural numbers, that may also be empty. The results are composed into another tuple, and the process
is started anew. Thus, a finite recurrent system defines an infinite sequence of n-tuples containing sets of natural numbers.
The last entry of a generated n-tuple is called the output of a step, and the union of the output sets of all steps is the
set defined by the finite recurrent system. Membership problems ask whether a given number is in a specified output set or
in some output set. We study membership problems for special finite recurrent systems, whose functions are built from the
set operations union, intersection and complementation and the arithmetical operations addition and multiplication. Sum and
product of two sets of natural numbers are defined elementwise. We restrict the set of operations from which functions are
built and determine the impact on the complexity of the membership problems. We focus on PSPACE-decidable membership problems
and show completeness results for the complexity classes NL, NP and PSPACE. 相似文献