全文获取类型
收费全文 | 6534篇 |
免费 | 269篇 |
国内免费 | 390篇 |
专业分类
电工技术 | 81篇 |
技术理论 | 8篇 |
综合类 | 831篇 |
化学工业 | 664篇 |
金属工艺 | 98篇 |
机械仪表 | 184篇 |
建筑科学 | 517篇 |
矿业工程 | 185篇 |
能源动力 | 127篇 |
轻工业 | 305篇 |
水利工程 | 103篇 |
石油天然气 | 65篇 |
武器工业 | 1025篇 |
无线电 | 630篇 |
一般工业技术 | 681篇 |
冶金工业 | 539篇 |
原子能技术 | 42篇 |
自动化技术 | 1108篇 |
出版年
2024年 | 18篇 |
2023年 | 60篇 |
2022年 | 95篇 |
2021年 | 124篇 |
2020年 | 125篇 |
2019年 | 100篇 |
2018年 | 84篇 |
2017年 | 331篇 |
2016年 | 345篇 |
2015年 | 338篇 |
2014年 | 449篇 |
2013年 | 355篇 |
2012年 | 309篇 |
2011年 | 514篇 |
2010年 | 383篇 |
2009年 | 442篇 |
2008年 | 336篇 |
2007年 | 421篇 |
2006年 | 409篇 |
2005年 | 308篇 |
2004年 | 246篇 |
2003年 | 251篇 |
2002年 | 198篇 |
2001年 | 173篇 |
2000年 | 164篇 |
1999年 | 126篇 |
1998年 | 72篇 |
1997年 | 59篇 |
1996年 | 49篇 |
1995年 | 33篇 |
1994年 | 47篇 |
1993年 | 23篇 |
1992年 | 20篇 |
1991年 | 14篇 |
1990年 | 22篇 |
1989年 | 21篇 |
1988年 | 10篇 |
1986年 | 12篇 |
1985年 | 6篇 |
1984年 | 7篇 |
1982年 | 5篇 |
1970年 | 5篇 |
1967年 | 4篇 |
1966年 | 6篇 |
1965年 | 5篇 |
1964年 | 9篇 |
1963年 | 5篇 |
1961年 | 5篇 |
1960年 | 5篇 |
1955年 | 6篇 |
排序方式: 共有7193条查询结果,搜索用时 15 毫秒
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.
Takeshi Emura 《Computational statistics & data analysis》2010,54(12):3033-3043
A goodness-of-fit testing procedure for Archimedean copula (AC) models is developed based on right-censored data. The proposed approach extends an existing method, which is suitable for the Clayton model, to general AC models. Asymptotic properties of the proposed test statistics under the true model assumption are derived. Simulation analysis shows that the proposed test has reasonable performance. Finally, two real data examples are analyzed for illustrative purposes. 相似文献
56.
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. 相似文献
57.
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. 相似文献
58.
59.
社会的发展和进步需要创新性人才,高校作为人才培育的摇篮,担负着提高学生综合素质、培养学生创新能力的重担。计算机专业作为一个应用性专业,更应改革传统的教学模式和考核方式,着力培养学生的动手能力和创新能力,提高学生的综合素质,以适应社会发展的需要。 相似文献
60.
针对目前国内生物信息学教学现状,借鉴其他学科成熟的教学模式,结合生物信息学的课程特点,探讨我校在计算机专业中开设生物信息学课程的几个问题,并提出基本教学思路和具体应用方法。 相似文献