全文获取类型
收费全文 | 5795篇 |
免费 | 176篇 |
国内免费 | 29篇 |
学科分类
工业技术 | 6000篇 |
出版年
2023年 | 46篇 |
2022年 | 62篇 |
2021年 | 128篇 |
2020年 | 110篇 |
2019年 | 108篇 |
2018年 | 146篇 |
2017年 | 137篇 |
2016年 | 118篇 |
2015年 | 96篇 |
2014年 | 136篇 |
2013年 | 399篇 |
2012年 | 205篇 |
2011年 | 275篇 |
2010年 | 229篇 |
2009年 | 237篇 |
2008年 | 251篇 |
2007年 | 210篇 |
2006年 | 203篇 |
2005年 | 201篇 |
2004年 | 158篇 |
2003年 | 142篇 |
2002年 | 115篇 |
2001年 | 120篇 |
2000年 | 93篇 |
1999年 | 98篇 |
1998年 | 222篇 |
1997年 | 175篇 |
1996年 | 113篇 |
1995年 | 85篇 |
1994年 | 113篇 |
1993年 | 109篇 |
1992年 | 91篇 |
1991年 | 70篇 |
1990年 | 61篇 |
1989年 | 48篇 |
1988年 | 65篇 |
1987年 | 54篇 |
1986年 | 55篇 |
1985年 | 73篇 |
1984年 | 59篇 |
1983年 | 49篇 |
1982年 | 42篇 |
1981年 | 52篇 |
1980年 | 41篇 |
1979年 | 38篇 |
1978年 | 41篇 |
1977年 | 46篇 |
1976年 | 48篇 |
1975年 | 38篇 |
1973年 | 34篇 |
排序方式: 共有6000条查询结果,搜索用时 15 毫秒
131.
The non-isothermal oxidation behavior of electrolytic-grade iron and Fe-Cr alloys in dry air has been studied using linear heating rates of 6 K/min, 10 K/ min, and 15 K/min up to a final temperature of 1273–1473 K. Some of the iron and iron-chromium alloy samples were given a surface treatment by dipping them in an aqueous solution containing both Cr and Al ions before their oxidation studies. This pretreatment has resulted in improved oxidation resistance and scale adherence as depicted by no scale rupture even after a second thermal cycle. Mass changes were recorded gravimetrically, and scales have been characterized by SEM, EPMA, and x-ray diffraction analyses. 相似文献
132.
133.
134.
Finite mixture models are widely used to perform model-based clustering of multivariate data sets. Most of the existing mixture models work with linear data; whereas, real-life applications may involve multivariate data having both circular and linear characteristics. No existing mixture models can accommodate such correlated circular–linear data. In this paper, we consider designing a mixture model for multivariate data having one circular variable. In order to construct a circular–linear joint distribution with proper inclusion of correlation terms, we use the semi-wrapped Gaussian distribution. Further, we construct a mixture model (termed SWGMM) of such joint distributions. This mixture model is capable of approximating the distribution of multi-modal circular–linear data. An unsupervised learning of the mixture parameters is proposed based on expectation maximization method. Clustering is performed using maximum a posteriori criterion. To evaluate the performance of SWGMM, we choose the task of color image segmentation in LCH space. We present comprehensive results and compare SWGMM with existing methods. Our study reveals that the proposed mixture model outperforms the other methods in most cases. 相似文献
135.
136.
A goal of network tomography is to infer the status (e.g. delay) of congested links internal to a network, through end-to-end measurements at boundary nodes (end-hosts) via insertion of probe signals. Because (a) probing constitutes traffic overhead, and (b) in any typical scenario, the number of congested links is a small fraction of the total number in the network, a desirable design objective is to identify those (few) congested links using a minimum number of probes. In this paper, we make a contribution to solving this problem, by proposing a new two-stage approach for this problem. First, we develop a binary observation model linking end-to-end observations with individual link statuses and derive necessary and sufficient conditions for whether at least one link in the network is congested. Stage I of the proposed method shows that achieving 1-identifiability with a minimum number of probes is equivalent to the familiar minimum set covering problem that can be efficiently solved via a greedy heuristic. A sequential algorithm is described, leading to a significantly lowered computational complexity vis-a-vis a batch algorithm. Next, a binary splitting algorithm originally developed in group testing is used to identify the location of the congested links. The proposed scheme is evaluated by simulations in OPNET and experiments on the PlanetLab testbed to validate the advantages of our 2-stage approach vis-a-vis a conventional (batch) algorithm. 相似文献
137.
138.
The deluge of data that future applications must process—in domains ranging from science to business informatics—creates a compelling argument for substantially increased R&D targeted at discovering scalable hardware and software solutions for data-intensive problems. 相似文献
139.
Michael Herbst Swen Gottschalk Martin Reißel Horst Hardelauf Roy Kasteel Matthieu Javaux Jan Vanderborght Harry Vereecken 《Computers & Geosciences》2008,34(12):1958-1963
In this paper, we present a class of preconditioning methods for a parallel solution of the three-dimensional Richards equation. The preconditioning methods Jacobi scaling, block-Jacobi, incomplete lower–upper, incomplete Cholesky and algebraic multigrid were applied in combination with a parallel conjugate gradient solver and tested for robustness and convergence using two model scenarios. The first scenario was an infiltration into initially dry, sandy soil discretised in 500,000 nodes. The second scenario comprised spatially distributed soil properties using 275,706 numerical nodes and atmospheric boundary conditions. Computational results showed a high efficiency of the nonlinear parallel solution procedure for both scenarios using up to 64 processors. Using 32 processors for the first scenario reduced the wall clock time to slightly more than 1% of the single processor run. For scenario 2 the use of 64 processors reduces the wall clock time to slightly more than 20% of the 8 processors wall clock time. The difference in the efficiency of the various preconditioning methods is moderate but not negligible. The use of the multigrid preconditioning algorithm is recommended, since on average it performed best for both scenarios. 相似文献
140.
Automatic Construction and Verification of Isotopy Invariants 总被引:1,自引:0,他引:1
Volker Sorge Andreas Meier Roy McCasland Simon Colton 《Journal of Automated Reasoning》2008,40(2-3):221-243
We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by
considering the isotopy equivalence relation. Isotopism is an important generalisation of isomorphism, and is studied by mathematicians in domains
such as loop theory. This extension was not straightforward, and we had to solve two major technical problems, namely, generating
and verifying isotopy invariants. Concentrating on the domain of loop theory, we have developed three novel techniques for
generating isotopic invariants, by using the notion of universal identities and by using constructions based on subblocks.
In addition, given the complexity of the theorems that verify that a conjunction of the invariants form an isotopy class,
we have developed ways of simplifying the problem of proving these theorems. Our techniques employ an interplay of computer
algebra, model generation, theorem proving, and satisfiability-solving methods. To demonstrate the power of the approach,
we generate isotopic classification theorems for loops of size 6 and 7, which extend the previously known enumeration results.
This work was previously beyond the capabilities of automated reasoning techniques.
The author’s work was supported by EPSRC MathFIT grant GR/S31099. 相似文献