全文获取类型
收费全文 | 5827篇 |
免费 | 321篇 |
国内免费 | 6篇 |
专业分类
电工技术 | 76篇 |
综合类 | 13篇 |
化学工业 | 1494篇 |
金属工艺 | 138篇 |
机械仪表 | 115篇 |
建筑科学 | 402篇 |
矿业工程 | 29篇 |
能源动力 | 146篇 |
轻工业 | 451篇 |
水利工程 | 50篇 |
石油天然气 | 8篇 |
无线电 | 452篇 |
一般工业技术 | 1236篇 |
冶金工业 | 249篇 |
原子能技术 | 37篇 |
自动化技术 | 1258篇 |
出版年
2024年 | 11篇 |
2023年 | 102篇 |
2022年 | 140篇 |
2021年 | 230篇 |
2020年 | 150篇 |
2019年 | 128篇 |
2018年 | 190篇 |
2017年 | 165篇 |
2016年 | 248篇 |
2015年 | 242篇 |
2014年 | 301篇 |
2013年 | 400篇 |
2012年 | 379篇 |
2011年 | 462篇 |
2010年 | 356篇 |
2009年 | 340篇 |
2008年 | 342篇 |
2007年 | 318篇 |
2006年 | 240篇 |
2005年 | 211篇 |
2004年 | 159篇 |
2003年 | 149篇 |
2002年 | 127篇 |
2001年 | 81篇 |
2000年 | 80篇 |
1999年 | 66篇 |
1998年 | 75篇 |
1997年 | 45篇 |
1996年 | 51篇 |
1995年 | 57篇 |
1994年 | 34篇 |
1993年 | 33篇 |
1992年 | 29篇 |
1991年 | 20篇 |
1990年 | 18篇 |
1989年 | 18篇 |
1988年 | 15篇 |
1987年 | 13篇 |
1986年 | 8篇 |
1985年 | 5篇 |
1984年 | 23篇 |
1983年 | 9篇 |
1982年 | 9篇 |
1981年 | 7篇 |
1980年 | 7篇 |
1979年 | 5篇 |
1978年 | 6篇 |
1976年 | 9篇 |
1975年 | 6篇 |
1974年 | 5篇 |
排序方式: 共有6154条查询结果,搜索用时 15 毫秒
51.
Zhengxiong Yang Stefan Kollmannsberger Alexander Düster Martin Ruess Eduardo Grande Garcia Rainer Burgkart Ernst Rank 《Computing and Visualization in Science》2011,14(5):207-216
Numerous numerical methods have been developed in an effort to accurately predict stresses in bones. The largest group are variants of the h-version of the finite element method (h-FEM), where low order Ansatz functions are used. By contrast, we3 investigate a combination of high order FEM and a fictitious domain approach, the finite cell method (FCM). While the FCM has been verified and validated in previous publications, this article proposes methods on how the FCM can be made computationally efficient to the extent that it can be used for patient specific, interactive bone simulations. This approach is called computational steering and allows to change input parameters like the position of an implant, material or loads and leads to an almost instantaneous change in the output (stress lines, deformations). This direct feedback gives the user an immediate impression of the impact of his actions to an extent which, otherwise, is hard to obtain by the use of classical non interactive computations. Specifically, we investigate an application to pre-surgical planning of a total hip replacement where it is desirable to select an optimal implant for a specific patient. Herein, optimal is meant in the sense that the expected post-operative stress distribution in the bone closely resembles that before the operation. 相似文献
52.
Mike Espig Wolfgang Hackbusch Stefan Handschuh Reinhold Schneider 《Computing and Visualization in Science》2011,14(6):271-285
We discuss the calculus of variations in tensor representations with a special focus on tensor networks and apply it to functionals of practical interest. The survey provides all necessary ingredients for applying minimization methods in a general setting. The important cases of target functionals which are linear and quadratic with respect to the tensor product are discussed, and combinations of these functionals are presented in detail. As an example, we consider the representation rank compression in tensor networks. For the numerical treatment, we use the nonlinear block Gauss?CSeidel method. We demonstrate the rate of convergence in numerical tests. 相似文献
53.
Veronika Šoltészová Daniel Patel Stefan Bruckner Ivan Viola 《Computer Graphics Forum》2010,29(3):883-891
In this paper, we present a novel technique which simulates directional light scattering for more realistic interactive visualization of volume data. Our method extends the recent directional occlusion shading model by enabling light source positioning with practically no performance penalty. Light transport is approximated using a tilted cone‐shaped function which leaves elliptic footprints in the opacity buffer during slice‐based volume rendering. We perform an incremental blurring operation on the opacity buffer for each slice in front‐to‐back order. This buffer is then used to define the degree of occlusion for the subsequent slice. Our method is capable of generating high‐quality soft shadowing effects, allows interactive modification of all illumination and rendering parameters, and requires no pre‐computation. 相似文献
54.
Consider a rooted tree T of arbitrary maximum degree d representing a collection of n web pages connected via a set of links, all reachable from a source home page represented by the root of T. Each web page i carries a probability p
i
representative of the frequency with which it is visited. By adding hotlinks—shortcuts from a node to one of its descendents—we
wish to minimize the expected number of steps l needed to visit pages from the home page, expressed as a function of the entropy H(p) of the access probabilities p. This paper introduces several new strategies for effectively assigning hotlinks in a tree. For assigning exactly one hotlink
per node, our method guarantees an upper bound on l of 1.141H(p)+1 if d>2 and 1.08H(p)+2/3 if d=2. We also present the first efficient general methods for assigning at most k hotlinks per node in trees of arbitrary maximum degree, achieving bounds on l of at most
\frac2H(p)log(k+1)+1\frac{2H(p)}{\log(k+1)}+1
and
\fracH(p)log(k+d)-logd+1\frac{H(p)}{\log(k+d)-\log d}+1
, respectively. All our methods are strong, i.e., they provide the same guarantees on all subtrees after the assignment. We also present an algorithm implementing these
methods in O(nlog n) time, an improvement over the previous O(n
2) time algorithms. Finally we prove a Ω(nlog n) lower bound on the running time of any strong method that guarantee an average access time strictly better than 2H(p). 相似文献
55.
Jianhan Zhu Xiangji Huang Dawei Song Stefan Rüger 《Knowledge and Information Systems》2010,23(1):29-54
We argue that expert finding is sensitive to multiple document features in an organizational intranet. These document features
include multiple levels of associations between experts and a query topic from sentence, paragraph, up to document levels,
document authority information such as the PageRank, indegree, and URL length of documents, and internal document structures
that indicate the experts’ relationship with the content of documents. Our assumption is that expert finding can largely benefit
from the incorporation of these document features. However, existing language modeling approaches for expert finding have
not sufficiently taken into account these document features. We propose a novel language modeling approach, which integrates
multiple document features, for expert finding. Our experiments on two large scale TREC Enterprise Track datasets, i.e., the
W3C and CSIRO datasets, demonstrate that the natures of the two organizational intranets and two types of expert finding tasks,
i.e., key contact finding for CSIRO and knowledgeable person finding for W3C, influence the effectiveness of different document
features. Our work provides insights into which document features work for certain types of expert finding tasks, and helps
design expert finding strategies that are effective for different scenarios. Our main contribution is to develop an effective
formal method for modeling multiple document features in expert finding, and conduct a systematic investigation of their effects.
It is worth noting that our novel approach achieves better results in terms of MAP than previous language model based approaches
and the best automatic runs in both the TREC2006 and TREC2007 expert search tasks, respectively. 相似文献
56.
57.
Stefan Wagner 《Information and Software Technology》2010,52(11):1230-1241
ContextSoftware quality is a complex concept. Therefore, assessing and predicting it is still challenging in practice as well as in research. Activity-based quality models break down this complex concept into concrete definitions, more precisely facts about the system, process, and environment as well as their impact on activities performed on and with the system. However, these models lack an operationalisation that would allow them to be used in assessment and prediction of quality. Bayesian networks have been shown to be a viable means for this task incorporating variables with uncertainty.ObjectiveThe qualitative knowledge contained in activity-based quality models are an abundant basis for building Bayesian networks for quality assessment. This paper describes a four-step approach for deriving systematically a Bayesian network from an assessment goal and a quality model.MethodThe four steps of the approach are explained in detail and with running examples. Furthermore, an initial evaluation is performed, in which data from NASA projects and an open source system is obtained. The approach is applied to this data and its applicability is analysed.ResultsThe approach is applicable to the data from the NASA projects and the open source system. However, the predictive results vary depending on the availability and quality of the data, especially the underlying general distributions.ConclusionThe approach is viable in a realistic context but needs further investigation in case studies in order to analyse its predictive validity. 相似文献
58.
Stefan WilhelmAuthor VitaeOtto S. WolfbeisAuthor Vitae 《Sensors and actuators. B, Chemical》2011,153(1):199-204
Absorption-based opto-chemical sensors for oxygen are presented that consist of leuco dyes (leuco indigo and leuco thioindigo) incorporated into two kinds of polymer matrices. An irreversible and visible color change (to red or blue) is caused by a chromogenic chemistry involving the oxidation of the (virtually colorless) leuco dyes by molecular oxygen. The moderately gas permeable copolymer poly(styrene-co-acrylonitrile) and a highly oxygen-permeable polyurethane hydrogel, respectively, are used in order to increase the effective dynamic range for visualizing and detecting oxygen. We describe the preparation and properties of four different types of such oxygen sensors that are obtained by dip-coating a gas impermeable foil made from poly(ethylene terephthalate) with a sensor layer composed of leuco dye and polymer. 相似文献
59.
On the purpose of Event-B proof obligations 总被引:2,自引:2,他引:0
Stefan Hallerstede 《Formal Aspects of Computing》2011,23(1):133-150
Event-B is a formal modelling method which is claimed to be suitable for diverse modelling domains, such as reactive systems
and sequential program development. This claim hinges on the fact that any particular model has an appropriate semantics.
In Event-B, this semantics is provided implicitly by proof obligations associated with a model. There is no fixed semantics
though. In this article we argue that this approach is beneficial to modelling because we can use similar proof obligations
across a variety of modelling domains. By way of two examples we show how similar proof obligations are linked to different
semantics. A small set of proof obligations is thus suitable for a whole range of modelling problems in diverse modelling
domains. 相似文献
60.
Markus Haas Stefan Mittnik Marc S. Paolella 《Computational statistics & data analysis》2009,53(6):2129-2154
An asymmetric multivariate generalization of the recently proposed class of normal mixture GARCH models is developed. Issues of parametrization and estimation are discussed. Conditions for covariance stationarity and the existence of the fourth moment are derived, and expressions for the dynamic correlation structure of the process are provided. In an application to stock market returns, it is shown that the disaggregation of the conditional (co)variance process generated by the model provides substantial intuition. Moreover, the model exhibits a strong performance in calculating out-of-sample Value-at-Risk measures. 相似文献