全文获取类型
收费全文 | 6634篇 |
免费 | 271篇 |
国内免费 | 390篇 |
专业分类
电工技术 | 81篇 |
技术理论 | 8篇 |
综合类 | 831篇 |
化学工业 | 668篇 |
金属工艺 | 98篇 |
机械仪表 | 192篇 |
建筑科学 | 522篇 |
矿业工程 | 185篇 |
能源动力 | 127篇 |
轻工业 | 305篇 |
水利工程 | 103篇 |
石油天然气 | 66篇 |
武器工业 | 1025篇 |
无线电 | 633篇 |
一般工业技术 | 694篇 |
冶金工业 | 567篇 |
原子能技术 | 43篇 |
自动化技术 | 1147篇 |
出版年
2024年 | 18篇 |
2023年 | 60篇 |
2022年 | 96篇 |
2021年 | 124篇 |
2020年 | 125篇 |
2019年 | 100篇 |
2018年 | 86篇 |
2017年 | 332篇 |
2016年 | 351篇 |
2015年 | 341篇 |
2014年 | 457篇 |
2013年 | 359篇 |
2012年 | 312篇 |
2011年 | 521篇 |
2010年 | 397篇 |
2009年 | 448篇 |
2008年 | 341篇 |
2007年 | 435篇 |
2006年 | 413篇 |
2005年 | 316篇 |
2004年 | 249篇 |
2003年 | 255篇 |
2002年 | 201篇 |
2001年 | 175篇 |
2000年 | 164篇 |
1999年 | 126篇 |
1998年 | 72篇 |
1997年 | 60篇 |
1996年 | 50篇 |
1995年 | 33篇 |
1994年 | 47篇 |
1993年 | 23篇 |
1992年 | 20篇 |
1991年 | 14篇 |
1990年 | 23篇 |
1989年 | 21篇 |
1988年 | 10篇 |
1987年 | 5篇 |
1986年 | 12篇 |
1985年 | 6篇 |
1984年 | 7篇 |
1982年 | 5篇 |
1970年 | 5篇 |
1966年 | 6篇 |
1965年 | 5篇 |
1964年 | 9篇 |
1963年 | 5篇 |
1961年 | 5篇 |
1960年 | 5篇 |
1955年 | 6篇 |
排序方式: 共有7295条查询结果,搜索用时 15 毫秒
81.
李九菊 《郑州大学学报(工学版)》1998,(Z1)
阐述了高校开展科技信息服务的实践和开发渠道,对如何更好地发挥文献资源在教学、科研等方面的作用进行了探讨。 相似文献
82.
In this paper we present several new results in the theory of homogeneous multiprocessor scheduling. We start with some assumptions about the behavior of tasks, with associated precedence constraints, as processor power is applied. We assume that as more processors are applied to a task, the time taken to compute it decreases, yielding some speedup. Because of communication, synchronization, and task scheduling overhead, this speedup increases less than linearly with the number of processors applied. We also assume that the number of processors which can be assigned to a task is a continuous variable, with a view to exploiting continuous mathematics. The optimal scheduling problem is to determine the number of processors assigned to each task, and task sequencing, to minimize the finishing time.These assumptions allow us to recast the optimal scheduling problem in a form which can be addressed by optimal control theory. Various theorems can be proven which characterize the optimal scheduling solution. Most importantly, for the special case where the speedup function of each task isp
, wherep is the amount of processing power applied to the task, we can directly solve our equations for the optimal solution. In this case, for task graphs formed from parallel and series connections, the solution can be derived by inspection. The solution can also be shown to be shortest path from the initial to the final state, as measured by anl
1/
distance metric, subject to obstacle constraints imposed by the precedence constraints.This research has been funded in part by the Advanced Research Project Agency monitored by ONR under Grant No. N00014-89-J-1489, in part by Draper Laboratory, in part by DARPA Contract No. N00014-87-K-0825, and in part by NSF Grant No. MIP-9012773. The first author is now with AT&T Bell Laboratories and the second author is with BBN Incorporated. 相似文献
83.
针对目前高校现行实践教学体制存在的弊端,在分析产生原因的基础上,提出一种科学的实践教学模式,该模式与信息与计算科学专业培养的目标以及社会发展的内在需求相结合,在信息处理和软件开发能力培养方面取得一定效果,增强了学生就业竞争力。 相似文献
84.
计算机科学与技术专业程序设计类课程教学方法研究 总被引:2,自引:0,他引:2
对于计算机科学与技术专业学生,程序设计类课程贯穿专业学习始末。本文结合我校计算机专业目前的课程设置及教学情况加以分析,从提高学生学习兴趣、在课堂及实验中采用案例化教学、丰富考核形式等方面进行课程教学改革,以达到提高学生学习兴趣和实际动手能力的目的。 相似文献
85.
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”. 相似文献
86.
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. 相似文献
87.
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. 相似文献
88.
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. 相似文献
89.
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. 相似文献
90.
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. 相似文献