全文获取类型
收费全文 | 15734篇 |
免费 | 2949篇 |
国内免费 | 2577篇 |
专业分类
电工技术 | 754篇 |
综合类 | 1988篇 |
化学工业 | 486篇 |
金属工艺 | 199篇 |
机械仪表 | 753篇 |
建筑科学 | 496篇 |
矿业工程 | 166篇 |
能源动力 | 170篇 |
轻工业 | 192篇 |
水利工程 | 205篇 |
石油天然气 | 146篇 |
武器工业 | 358篇 |
无线电 | 2471篇 |
一般工业技术 | 1322篇 |
冶金工业 | 197篇 |
原子能技术 | 64篇 |
自动化技术 | 11293篇 |
出版年
2024年 | 230篇 |
2023年 | 623篇 |
2022年 | 864篇 |
2021年 | 880篇 |
2020年 | 728篇 |
2019年 | 613篇 |
2018年 | 563篇 |
2017年 | 682篇 |
2016年 | 726篇 |
2015年 | 804篇 |
2014年 | 1064篇 |
2013年 | 1134篇 |
2012年 | 1229篇 |
2011年 | 1382篇 |
2010年 | 1093篇 |
2009年 | 1132篇 |
2008年 | 1169篇 |
2007年 | 1162篇 |
2006年 | 980篇 |
2005年 | 797篇 |
2004年 | 571篇 |
2003年 | 529篇 |
2002年 | 348篇 |
2001年 | 310篇 |
2000年 | 259篇 |
1999年 | 223篇 |
1998年 | 167篇 |
1997年 | 168篇 |
1996年 | 119篇 |
1995年 | 124篇 |
1994年 | 92篇 |
1993年 | 74篇 |
1992年 | 69篇 |
1991年 | 59篇 |
1990年 | 56篇 |
1989年 | 43篇 |
1988年 | 46篇 |
1987年 | 10篇 |
1986年 | 15篇 |
1985年 | 15篇 |
1984年 | 19篇 |
1983年 | 9篇 |
1982年 | 12篇 |
1981年 | 10篇 |
1980年 | 15篇 |
1979年 | 8篇 |
1978年 | 5篇 |
1977年 | 7篇 |
1976年 | 8篇 |
1974年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
52.
Energy minimization and design for testability 总被引:6,自引:0,他引:6
Srimat T. Chakradhar Vishwani D. Agrawal Michael L. Bushnell 《Journal of Electronic Testing》1994,5(1):57-66
The problem of fault detection in general combinational circuits is NP-complete. The only previous result on identifying easily testable circuits is due to Fujiwara who gave a polynomial time algorithm for detecting any single stuck fault inK-bounded circuits. Such circuits may only contain logic blocks with no more thanK input lines and the blocks are so connected that there is no reconvergent fanout among them. We introduce a new class of combinational circuits called the (k, K)-circuits and present a polynomial time algorithm to detect any single or multiple stuck fault in such circuits. We represent the circuit as an undirected graphG with a vertex for each gate and an edge between a pair of vertices whenever the corresponding gates have a connection. For a (k, K)-circuit,G is a subgraph of ak-tree, which, by definition, cannot have a clique of size greater thank+1. Basically, this is a restriction on gate interconnections rather than on the function of gates comprising the circuit. The (k, K)-circuits are a generalization of Fujiwara'sK-bounded circuits. Using the bidirectional neural network model of the circuit and the energy function minimization formulation of the fault detection problem, we present a test generation algorithm for single and multiple faults in (k, K)-circuits. This polynomial time aggorithm minimizes the energy function by recursively eliminating the variables. 相似文献
53.
54.
Optimal solutions of several variants of the probabilistic reasoning problem were found by a new technique that integrates
integer programming and probabilistic deduction graphs (PDG). PDGs are extended from deduction graphs of the and-type via
normal deduction graphs. The foregoing variants to be solved can involve multiple hypotheses and multiple evidences where
the former is given and the latter is unknown and being found or vice versa. The relationship among these hypotheses and evidences
with possible intermediaries is represented by a causal graph. The proposed method can handle a large causal graph of any
type and find an optimal solution by invoking a linear integer programming package. In addition, formulating the reasoning
problem to fit integer programming takes a polynomial time.
H.-L. Li was visiting the Department of Computer Sciences, University of North Texas in 1988–1989. He is with the Institute
of Information Management, National Chiao Tung University, Hsinchu, Taiwan, R.O.C. 相似文献
55.
本文给出了一种椭圆弧长的作图求解方法,即由作图求得椭圆弧长的近似值。通过对100个椭圆弧长的求解结果表明,由此方法求得的椭圆弧长的误差甚小,从而在相当高的精度范围内,提供了一种工程中适用并且简单易行的求解椭圆弧长的方法。 相似文献
56.
A stochastic model is proposed for a basic mechanism in the formation of uncertainties in physical quantity measurements.
__________
Translated from Izmeritel'naya Tekhnika, No. 1, pp. 12–17, January, 2006. 相似文献
57.
58.
We propose a simulation-based algorithm for inference in stochastic volatility models with possible regime switching in which the regime state is governed by a first-order Markov process. Using auxiliary particle filters we developed a strategy to sequentially learn about states and parameters of the model. The methodology is tested against a synthetic time series and validated with a real financial time series: the IBOVESPA stock index (São Paulo Stock Exchange). 相似文献
59.
Eddie Cheng 《Information Sciences》2007,177(22):4877-4882
We prove that when linearly many vertices are deleted in a Cayley graph generated by a transposition tree, the resulting graph has a large connected component containing almost all remaining vertices. 相似文献
60.
Nowadays, the complex manufacturing processes have to be dynamically modelled and controlled to optimise the diagnosis and the maintenance policies. This article presents a methodology that will help developing Dynamic Object Oriented Bayesian Networks (DOOBNs) to formalise such complex dynamic models. The goal is to have a general reliability evaluation of a manufacturing process, from its implementation to its operating phase. The added value of this formalisation methodology consists in using the a priori knowledge of both the system's functioning and malfunctioning. Networks are built on principles of adaptability and integrate uncertainties on the relationships between causes and effects. Thus, the purpose is to evaluate, in terms of reliability, the impact of several decisions on the maintenance of the system. This methodology has been tested, in an industrial context, to model the reliability of a water (immersion) heater system. 相似文献