全文获取类型
收费全文 | 4045篇 |
免费 | 182篇 |
国内免费 | 9篇 |
专业分类
电工技术 | 67篇 |
综合类 | 3篇 |
化学工业 | 757篇 |
金属工艺 | 125篇 |
机械仪表 | 88篇 |
建筑科学 | 191篇 |
矿业工程 | 13篇 |
能源动力 | 68篇 |
轻工业 | 431篇 |
水利工程 | 25篇 |
石油天然气 | 8篇 |
无线电 | 293篇 |
一般工业技术 | 736篇 |
冶金工业 | 800篇 |
原子能技术 | 35篇 |
自动化技术 | 596篇 |
出版年
2023年 | 34篇 |
2022年 | 25篇 |
2021年 | 73篇 |
2020年 | 67篇 |
2019年 | 35篇 |
2018年 | 97篇 |
2017年 | 109篇 |
2016年 | 111篇 |
2015年 | 97篇 |
2014年 | 147篇 |
2013年 | 226篇 |
2012年 | 205篇 |
2011年 | 225篇 |
2010年 | 185篇 |
2009年 | 171篇 |
2008年 | 174篇 |
2007年 | 159篇 |
2006年 | 127篇 |
2005年 | 130篇 |
2004年 | 105篇 |
2003年 | 94篇 |
2002年 | 106篇 |
2001年 | 73篇 |
2000年 | 79篇 |
1999年 | 65篇 |
1998年 | 240篇 |
1997年 | 156篇 |
1996年 | 95篇 |
1995年 | 83篇 |
1994年 | 65篇 |
1993年 | 64篇 |
1992年 | 40篇 |
1991年 | 31篇 |
1990年 | 29篇 |
1989年 | 24篇 |
1988年 | 28篇 |
1987年 | 36篇 |
1986年 | 27篇 |
1985年 | 24篇 |
1984年 | 26篇 |
1983年 | 20篇 |
1982年 | 20篇 |
1981年 | 22篇 |
1980年 | 24篇 |
1979年 | 14篇 |
1977年 | 18篇 |
1976年 | 60篇 |
1975年 | 27篇 |
1974年 | 18篇 |
1973年 | 10篇 |
排序方式: 共有4236条查询结果,搜索用时 31 毫秒
91.
Food allergies are causal factors for atopic dermatitis (AD) in 50% in infancy, in 20 to 30% in childhood, and only in 10 to 15% after puberty and in adulthood. Cow's milk, egg, fish, wheat, soy, nuts and citrus-fruits are the most proven allergens. Pseudoallergens, especially food-additiva, have to be regarded too. For the proof of the clinical relevance that food allergy is causing AD a positive result of elimination and provocation has to be required. When by these diagnostic procedure a special food is found as causing the AD it has to be eliminated in the diet of this patient. In severe cases of AD semi-elementary respectively few foods diets may be necessary. However in most cases of AD the "diet of choice" is an age related normal nutrition. To delay respectively to avoid the manifestation of atopy special recommendations for the nutrition of high risk newborns and infants (especially long breast feeding, late solid feeding) should be considered. 相似文献
92.
Asbjørn Solheim Sverre Rolseth Egil Skybakmoen Lisbet Støen Åsmund Sterten Trond Støre 《Metallurgical and Materials Transactions B》1996,27(5):739-744
Temperatures for primary crystallization of Na3AlF6 in multicomponent electrolyte systems of interest for the aluminum electrolysis process were determined by thermal analysis. The results are presented as binary and quasibinary diagrams and discussed in view of the literature data. An empirical equation describing liquidus temperatures for primary crystallization of Na3AlF6 was derived: $$\begin{gathered} t/(^\circ C) = 1011 + 0.50[AlF_3 ] - 0.13[AIF_3 ] - \frac{{3.45[CaF_2 ]}}{{1 + 0.0173[CaF_2 ]}} \hfill \\ + 0.124[CaF_2 ] \cdot [AlF_3 ] - 0.00542([CaF_2 ] \cdot [AlF_3 ])^{1.5} \hfill \\ - \frac{{7.93[Al_2 O_3 ]}}{{1 + 0.0936[Al_2 O_3 ] - 0.0017[Al_2 O_3 ]^2 - 0.0023[AlF_3 ] \cdot [Al_2 O_3 ]}} \hfill \\ - \frac{{8.90[LiF]}}{{1 + 0.0047[LiF] + 0.0010[AlF3]^2 }} - 3.95[MgF_2 ] - 3.95 \hfill \\ \end{gathered} $$ wheret is the temperature in degree Celsius and the square brackets denote the weight percent of components in the system Na3AlF6-AlF3-CaF2-Al2O3-LiF-MgF2-KF. The composition limitations are [AlF3] ≈ [CaF2] ≈ [LiF] < 20 wt pct, [MgF2] ≈ [KF] < 5 wt pct, and [A12O3] up to saturation. 相似文献
93.
This paper presents an assumption/commitment specification technique and a refinement calculus for networks of agents communicating asynchronously via unbounded FIFO channels in the tradition of Kahn. We define two types of assumption/commitment specifications, namely simple and general specifications. It is shown that semantically, any deterministic agent can be uniquely characterized by a simple specification, and any nondeterministic agent can be uniquely characterized by a general specification. We define two sets of refinement rules, one for simple specifications and one for general specifications. The rules are Hoare-logic inspired. In particular the feedback rules employ invariants in the style of a traditional while-rule. Both sets of rules have been proved to be sound and also (semantic) relative complete. Conversion rules allow the two logics to be combined. This means that general specifications and the rules for general specifications have to be introduced only at the point in a system development where they are really needed. 相似文献
94.
Surrogate modeling approximation using a mixture of experts based on EM joint estimation 总被引:1,自引:1,他引:0
Dimitri Bettebghor Nathalie Bartoli Stéphane Grihon Joseph Morlier Manuel Samuelides 《Structural and Multidisciplinary Optimization》2011,43(2):243-259
An automatic method to combine several local surrogate models is presented. This method is intended to build accurate and
smooth approximation of discontinuous functions that are to be used in structural optimization problems. It strongly relies
on the Expectation−Maximization (EM) algorithm for Gaussian mixture models (GMM). To the end of regression, the inputs are
clustered together with their output values by means of parameter estimation of the joint distribution. A local expert is
then built (linear, quadratic, artificial neural network, moving least squares) on each cluster. Lastly, the local experts
are combined using the Gaussian mixture model parameters found by the EM algorithm to obtain a global model. This method is
tested over both mathematical test cases and an engineering optimization problem from aeronautics and is found to improve
the accuracy of the approximation. 相似文献
95.
本文就目前国际上对以太网基本性能测量的指标进行整理和分析并给出了相应的测试方法。 相似文献
96.
Lars Mönch John W. Fowler Stéphane Dauzère-Pérès Scott J. Mason Oliver Rose 《Journal of Scheduling》2011,14(6):583-599
In this paper, we discuss scheduling problems in semiconductor manufacturing. Starting from describing the manufacturing process,
we identify typical scheduling problems found in semiconductor manufacturing systems. We describe batch scheduling problems,
parallel machine scheduling problems, job shop scheduling problems, scheduling problems with auxiliary resources, multiple
orders per job scheduling problems, and scheduling problems related to cluster tools. We also present important solution techniques
that are used to solve these scheduling problems by means of specific examples, and report on known implementations. Finally,
we summarize some of the challenges in scheduling semiconductor manufacturing operations. 相似文献
97.
Christian Bessiere Stéphane Cardon Romuald Debruyne Christophe Lecoutre 《Constraints》2011,16(1):25-53
In this paper, we propose two original and efficient approaches for enforcing singleton arc consistency. In the first one,
the data structures used to enforce arc consistency are shared between all subproblems where a domain is reduced to a singleton.
This new algorithm is not optimal but it requires far less space and is often more efficient in practice than the optimal
algorithm SAC-Opt. In the second approach, we perform several runs of a greedy search (where at each step, arc consistency
is maintained), possibly detecting the singleton arc consistency of several values in one run. It is an original illustration
of applying inference (i.e., establishing singleton arc consistency) by search. Using a greedy search allows benefiting from
the incrementality of arc consistency, learning relevant information from conflicts and, potentially finding solution(s) during
the inference process. We present extensive experiments that show the benefit of our two approaches. 相似文献
98.
Anne Martens Heiko Koziolek Lutz Prechelt Ralf Reussner 《Empirical Software Engineering》2011,16(5):587-622
Model-based performance evaluation methods for software architectures can help architects to assess design alternatives and save costs for late life-cycle performance fixes. A recent trend is component-based performance modelling, which aims at creating reusable performance models; a number of such methods have been proposed during the last decade. Their accuracy and the needed effort for modelling are heavily influenced by human factors, which are so far hardly understood empirically. Do component-based methods allow to make performance predictions with a comparable accuracy while saving effort in a reuse scenario? We examined three monolithic methods (SPE, umlPSI, Capacity Planning (CP)) and one component-based performance evaluation method (PCM) with regard to their accuracy and effort from the viewpoint of method users. We conducted a series of three experiments (with different levels of control) involving 47 computer science students. In the first experiment, we compared the applicability of the monolithic methods in order to choose one of them for comparison. In the second experiment, we compared the accuracy and effort of this monolithic and the component-based method for the model creation case. In the third, we studied the effort reduction from reusing component-based models. Data were collected based on the resulting artefacts, questionnaires and screen recording. They were analysed using hypothesis testing, linear models, and analysis of variance. For the monolithic methods, we found that using SPE and CP resulted in accurate predictions, while umlPSI produced over-estimates. Comparing the component-based method PCM with SPE, we found that creating reusable models using PCM takes more (but not drastically more) time than using SPE and that participants can create accurate models with both techniques. Finally, we found that reusing PCM models can save time, because effort to reuse can be explained by a model that is independent of the inner complexity of a component. The tasks performed in our experiments reflect only a subset of the actual activities when applying model-based performance evaluation methods in a software development process. Our results indicate that sufficient prediction accuracy can be achieved with both monolithic and component-based methods, and that the higher effort for component-based performance modelling will indeed pay off when the component models incorporate and hide a sufficient amount of complexity. 相似文献
99.
100.
In the context of comparative analysis of protein–protein interaction graphs, we use a graph-based formalism to detect the preservation of a given protein complex (pattern graph) in the protein–protein interaction graph (target graph) of another species with respect to (w.r.t.) orthologous proteins. We give an efficient exponential-time randomized algorithm in case the occurrence of the pattern graph in the target graph is required to be exact. For approximate occurrences, we prove a tight inapproximability result and give four approximation algorithms that deal with bounded degree graphs, small ortholog numbers, linear forests and very simple yet hard instances, respectively. 相似文献