全文获取类型
收费全文 | 1897篇 |
免费 | 134篇 |
国内免费 | 69篇 |
专业分类
电工技术 | 75篇 |
综合类 | 99篇 |
化学工业 | 363篇 |
金属工艺 | 51篇 |
机械仪表 | 68篇 |
建筑科学 | 85篇 |
矿业工程 | 28篇 |
能源动力 | 51篇 |
轻工业 | 433篇 |
水利工程 | 41篇 |
石油天然气 | 30篇 |
武器工业 | 2篇 |
无线电 | 215篇 |
一般工业技术 | 167篇 |
冶金工业 | 41篇 |
原子能技术 | 35篇 |
自动化技术 | 316篇 |
出版年
2024年 | 4篇 |
2023年 | 19篇 |
2022年 | 38篇 |
2021年 | 71篇 |
2020年 | 32篇 |
2019年 | 24篇 |
2018年 | 34篇 |
2017年 | 35篇 |
2016年 | 37篇 |
2015年 | 60篇 |
2014年 | 54篇 |
2013年 | 137篇 |
2012年 | 86篇 |
2011年 | 202篇 |
2010年 | 85篇 |
2009年 | 132篇 |
2008年 | 143篇 |
2007年 | 149篇 |
2006年 | 117篇 |
2005年 | 88篇 |
2004年 | 68篇 |
2003年 | 94篇 |
2002年 | 71篇 |
2001年 | 58篇 |
2000年 | 42篇 |
1999年 | 37篇 |
1998年 | 23篇 |
1997年 | 28篇 |
1996年 | 26篇 |
1995年 | 21篇 |
1994年 | 11篇 |
1993年 | 11篇 |
1992年 | 9篇 |
1991年 | 12篇 |
1990年 | 9篇 |
1989年 | 11篇 |
1988年 | 2篇 |
1987年 | 4篇 |
1986年 | 5篇 |
1985年 | 4篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1982年 | 1篇 |
1981年 | 3篇 |
排序方式: 共有2100条查询结果,搜索用时 31 毫秒
51.
Elections are a central model in a variety of areas. This paper studies parameterized computational complexity of five control problems in the Maximin election. We obtain the following results: constructive control by adding candidates is W[2]-hard with respect to the parameter “number of added candidates”; both constructive and destructive control by adding/deleting voters are W[1]-hard with respect to the parameter “number of added/deleted voters”. 相似文献
52.
In this paper we prove that, under suitable conditions, Atanassov’s Kα operators, which act on intervals, provide the same numerical results as OWA operators of dimension two. On one hand, this allows us to recover OWA operators from Kα operators. On the other hand, by analyzing the properties of Atanassov’s operators, we can generalize them. In this way, we introduce a class of aggregation functions - the generalized Atanassov operators - that, in particular, include two-dimensional OWA operators. We investigate under which conditions these generalized Atanassov operators satisfy some properties usually required for aggregation functions, such as bisymmetry, strictness, monotonicity, etc. We also show that if we apply these aggregation functions to interval-valued fuzzy sets, we obtain an ordered family of fuzzy sets. 相似文献
53.
Djamel Bouchaffra Author Vitae 《Pattern recognition》2010,43(7):2590-2607
Current extensions of hidden Markov models such as structural, hierarchical, coupled, and others have the power to classify complex and highly organized patterns. However, one of their major limitations is the inability to cope with topology: When applied to a visible observation (VO) sequence, the traditional HMM-based techniques have difficulty predicting the n-dimensional shape formed by the symbols of the VO sequence. To fulfill this need, we propose a novel paradigm named “topological hidden Markov models” (THMMs) that classifies VO sequences by embedding the nodes of an HMM state transition graph in a Euclidean space. This is achieved by modeling the noise embedded in the shape generated by the VO sequence. We cover the first and second level topological HMMs. We describe five basic problems that are assigned to a second level topological hidden Markov model: (1) sequence probability evaluation, (2) statistical decoding, (3) structural decoding, (4) topological decoding, and (5) learning. To show the significance of this research, we have applied the concept of THMMs to: (i) predict the ASCII class assigned to a handwritten numeral, and (ii) map protein primary structures to their 3D folds. The results show that the second level THMMs outperform the SHMMs and the multi-class SVM classifiers significantly. 相似文献
54.
T. Hoang Ngan Le Chia-Chen Lin Chin-Chen Chang Hoai Bac LeAuthor vitae 《Digital Signal Processing》2011,21(6):734-745
Many secret sharing schemes for digital images have been developed in recent decades. Traditional schemes typically must deal with the problem of computational complexity, and other visual secret sharing schemes come with a higher transmission cost and storage cost; that is, each shadow size is m times as big as the original secret image. The new (2,n) secret sharing scheme for grayscale images proposed in this paper is based a combination of acceptable image quality using block truncation coding (BTC), high compression ratio discrete wavelet transform (DWT) and good subjective performance of the vector quantization (VQ) technique. Experimental results confirm that our proposed scheme not only generates a high quality reconstructed original image but also generates small, random-like grayscale shadows. 相似文献
55.
Marco Riani 《Computational statistics & data analysis》2010,54(12):3300-3312
The forward search provides data-driven flexible trimming of a Cp statistic for the choice of regression models that reveals the effect of outliers on model selection. An informed robust model choice follows. Even in small samples, the statistic has a null distribution indistinguishable from an F distribution. Limits on acceptable values of the Cp statistic follow. Two examples of widely differing size are discussed. A powerful graphical tool is the generalized candlestick plot, which summarizes the information on all forward searches and on the choice of models. A comparison is made with the use of M-estimation in robust model choice. 相似文献
56.
It is an open problem in the area of effective (algorithmic) randomness whether Kolmogorov-Loveland randomness coincides with Martin-Löf randomness. Joe Miller and André Nies suggested some variations of Kolmogorov-Loveland randomness to approach this problem and to provide a partial solution. We show that their proposed notion of injective randomness is still weaker than Martin-Löf randomness. Since in this proof some of the ideas we use are clearer, we also show the weaker theorem that permutation randomness is weaker than Martin-Löf randomness. 相似文献
57.
58.
In this paper, we investigate global uniqueness results for fractional functional differential equations with infinite delay in Fréchet spaces. We shall rely on a nonlinear alternative of Leray-Schauder type in Fréchet spaces due to Frigon and Granas. The results are obtained by using the α-resolvent family (Sα(t))t≥0 on a complex Banach space X combined with the above-mentioned fixed point theorem. As an application, a controllability result with one parameter is also provided to illustrate the theory. 相似文献
59.
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. 相似文献
60.