全文获取类型
收费全文 | 6097篇 |
免费 | 441篇 |
国内免费 | 340篇 |
专业分类
电工技术 | 270篇 |
综合类 | 274篇 |
化学工业 | 1374篇 |
金属工艺 | 439篇 |
机械仪表 | 246篇 |
建筑科学 | 208篇 |
矿业工程 | 80篇 |
能源动力 | 199篇 |
轻工业 | 325篇 |
水利工程 | 22篇 |
石油天然气 | 331篇 |
武器工业 | 24篇 |
无线电 | 714篇 |
一般工业技术 | 1101篇 |
冶金工业 | 207篇 |
原子能技术 | 74篇 |
自动化技术 | 990篇 |
出版年
2024年 | 26篇 |
2023年 | 138篇 |
2022年 | 258篇 |
2021年 | 250篇 |
2020年 | 172篇 |
2019年 | 150篇 |
2018年 | 143篇 |
2017年 | 165篇 |
2016年 | 169篇 |
2015年 | 220篇 |
2014年 | 281篇 |
2013年 | 288篇 |
2012年 | 321篇 |
2011年 | 457篇 |
2010年 | 283篇 |
2009年 | 377篇 |
2008年 | 410篇 |
2007年 | 416篇 |
2006年 | 331篇 |
2005年 | 318篇 |
2004年 | 259篇 |
2003年 | 255篇 |
2002年 | 164篇 |
2001年 | 159篇 |
2000年 | 205篇 |
1999年 | 106篇 |
1998年 | 92篇 |
1997年 | 58篇 |
1996年 | 42篇 |
1995年 | 46篇 |
1994年 | 36篇 |
1993年 | 44篇 |
1992年 | 42篇 |
1991年 | 34篇 |
1990年 | 21篇 |
1989年 | 18篇 |
1988年 | 22篇 |
1987年 | 26篇 |
1986年 | 25篇 |
1985年 | 11篇 |
1984年 | 5篇 |
1983年 | 6篇 |
1982年 | 2篇 |
1981年 | 4篇 |
1980年 | 5篇 |
1979年 | 3篇 |
1978年 | 2篇 |
1977年 | 6篇 |
1976年 | 2篇 |
1975年 | 2篇 |
排序方式: 共有6878条查询结果,搜索用时 0 毫秒
91.
An obnoxious facility is to be located inside a polygonal region of the plane, maximizing the sum of the k smallest weighted Euclidean distances to n given points, each protected by some polygonal forbidden region. For the unweighted case and k fixed an O(n2logn) time algorithm is presented. For the weighted case a thorough study of the relevant structure of the multiplicatively weighted order-k-Voronoi diagram leads to the design of an O(kn3+n3logn) time algorithm for finding an optimal solution to the anti-t-centrum problem for every t=1,…,k, simultaneously. 相似文献
92.
Khalida Inayat Noor Sarfraz Nawaz Malik 《Computers & Mathematics with Applications》2011,62(1):367-375
The aim of this paper is to generalize the conic domain defined by Kanas and Wisniowska, and define the class of functions which map the open unit disk E onto this generalized conic domain. A brief comparison between these conic domains is the main motivation of this paper. A correction is made in selecting the range interval of order of conic domain. 相似文献
93.
94.
The satisfiability problem is a basic core NP-complete problem. In recent years, a lot of heuristic algorithms have been developed to solve this problem, and many experiments have evaluated and compared the performance of different heuristic algorithms. However, rigorous theoretical analysis and comparison are rare. This paper analyzes and compares the expected runtime of three basic heuristic algorithms: RandomWalk, (1+1) EA, and hybrid algorithm. The runtime analysis of these heuristic algorithms on two 2-SAT instances shows that the expected runtime of these heuristic algorithms can be exponential time or polynomial time. Furthermore, these heuristic algorithms have their own advantages and disadvantages in solving different SAT instances. It also demonstrates that the expected runtime upper bound of RandomWalk on arbitrary k-SAT (k?3) is O(n(k−1)), and presents a k-SAT instance that has Θ(n(k−1)) expected runtime bound. 相似文献
95.
Observer-based networked control for continuous-time systems with random sensor delays 总被引:3,自引:0,他引:3
This paper is concerned with the networked control system design for continuous-time systems with random measurement, where the measurement channel is assumed to subject to random sensor delay. A design scheme for the observer-based output feedback controller is proposed to render the closed-loop networked system exponentially mean-square stable with H∞ performance requirement. The technique employed is based on appropriate delay systems approach combined with a matrix variable decoupling technique. The design method is fulfilled through solving linear matrix inequalities. A numerical example is used to verify the effectiveness and the merits of the present results. 相似文献
96.
We revisit in this paper the concept of decoding binary cyclic codes with Gröbner bases. These ideas were first introduced by Cooper, then Chen, Reed, Helleseth and Truong, and eventually by Orsini and Sala. We discuss here another way of putting the decoding problem into equations: the Newton identities. Although these identities have been extensively used for decoding, the work was done manually, to provide formulas for the coefficients of the locator polynomial. This was achieved by Reed, Chen, Truong and others in a long series of papers, for decoding quadratic residue codes, on a case-by-case basis. It is tempting to automate these computations, using elimination theory and Gröbner bases.Thus, we study in this paper the properties of the system defined by the Newton identities, for decoding binary cyclic codes. This is done in two steps, first we prove some facts about the variety associated with this system, then we prove that the ideal itself contains relevant equations for decoding, which lead to formulas.Then we consider the so-called online Gröbner basis decoding, where the work of computing a Gröbner basis is done for each received word. It is much more efficient for practical purposes than preprocessing and substituting into the formulas. Finally, we conclude with some computational results, for codes of interesting length (about one hundred). 相似文献
97.
This paper presents a novel quadratic optimal neural fuzzy control for synchronization of uncertain chaotic systems via H∞ approach. In the proposed algorithm, a self-constructing neural fuzzy network (SCNFN) is developed with both structure and parameter learning phases, so that the number of fuzzy rules and network parameters can be adaptively determined. Based on the SCNFN, an uncertainty observer is first introduced to watch compound system uncertainties. Subsequently, an optimal NFN-based controller is designed to overcome the effects of unstructured uncertainty and approximation error by integrating the NFN identifier, linear optimal control and H∞ approach as a whole. The adaptive tuning laws of network parameters are derived in the sense of quadratic stability technique and Lyapunov synthesis approach to ensure the network convergence and H∞ synchronization performance. The merits of the proposed control scheme are not only that the conservative estimation of NFN approximation error bound is avoided but also that a suitable-sized neural structure is found to sufficiently approximate the system uncertainties. Simulation results are provided to verify the effectiveness and robustness of the proposed control method. 相似文献
98.
The null controllable set of a system is the largest set of states that can be controlled to the origin. Control systems that have a region of attraction equal to the null controllable set are said to be maximally controllable closed-loop systems. In the case of open-loop unstable plants with amplitude constrained control it is well known that the null controllable set does not cover the entire state-space. Further the combination of input constraints and unstable system dynamics results in a set of state constraints which we call implicit constraints. It is shown that the simple inclusion of implicit constraints in a controller formulation results in a controller that achieves maximal controllability for a class of open-loop unstable systems. 相似文献
99.
Vasile Dragan Author vitae 《Automatica》2011,47(1):122-126
In this paper, the problem of robust H∞ control is investigated for sampled-data systems with probabilistic sampling. The parameter uncertainties are time-varying norm-bounded and appear in both the state and input matrices. For the simplicity of technical development, only two different sampling periods are considered whose occurrence probabilities are given constants and satisfy Bernoulli distribution, which can be further extended to the case with multiple stochastic sampling periods. By applying an input delay approach, the probabilistic sampling system is transformed into a continuous time-delay system with stochastic parameters in the system matrices. By linear matrix inequality (LMI) approach, sufficient conditions are obtained, which guarantee the robust mean-square exponential stability of the system with an H∞ performance. Moreover, an H∞ controller design procedure is then proposed. An illustrative example is included to demonstrate the effectiveness of the proposed techniques. 相似文献
100.
For a positive integer d, an L(d,1)-labeling f of a graph G is an assignment of integers to the vertices of G such that |f(u)−f(v)|?d if uv∈E(G), and |f(u)−f(v)|?1 if u and u are at distance two. The span of an L(d,1)-labeling f of a graph is the absolute difference between the maximum and minimum integers used by f. The L(d,1)-labeling number of G, denoted by λd,1(G), is the minimum span over all L(d,1)-labelings of G. An L′(d,1)-labeling of a graph G is an L(d,1)-labeling of G which assigns different labels to different vertices. Denote by the L′(d,1)-labeling number of G. Georges et al. [Discrete Math. 135 (1994) 103-111] established relationship between the L(2,1)-labeling number of a graph G and the path covering number of Gc, the complement of G. In this paper we first generalize the concept of the path covering of a graph to the t-group path covering. Then we establish the relationship between the L′(d,1)-labeling number of a graph G and the (d−1)-group path covering number of Gc. Using this result, we prove that and for bipartite graphs G can be computed in polynomial time. 相似文献