全文获取类型
收费全文 | 4571篇 |
免费 | 155篇 |
国内免费 | 21篇 |
专业分类
电工技术 | 293篇 |
综合类 | 15篇 |
化学工业 | 1408篇 |
金属工艺 | 124篇 |
机械仪表 | 132篇 |
建筑科学 | 120篇 |
矿业工程 | 5篇 |
能源动力 | 213篇 |
轻工业 | 405篇 |
水利工程 | 19篇 |
石油天然气 | 6篇 |
无线电 | 339篇 |
一般工业技术 | 928篇 |
冶金工业 | 154篇 |
原子能技术 | 137篇 |
自动化技术 | 449篇 |
出版年
2023年 | 32篇 |
2022年 | 62篇 |
2021年 | 131篇 |
2020年 | 61篇 |
2019年 | 74篇 |
2018年 | 86篇 |
2017年 | 67篇 |
2016年 | 113篇 |
2015年 | 86篇 |
2014年 | 131篇 |
2013年 | 255篇 |
2012年 | 259篇 |
2011年 | 293篇 |
2010年 | 244篇 |
2009年 | 268篇 |
2008年 | 286篇 |
2007年 | 218篇 |
2006年 | 219篇 |
2005年 | 145篇 |
2004年 | 153篇 |
2003年 | 172篇 |
2002年 | 148篇 |
2001年 | 77篇 |
2000年 | 81篇 |
1999年 | 74篇 |
1998年 | 88篇 |
1997年 | 72篇 |
1996年 | 74篇 |
1995年 | 62篇 |
1994年 | 58篇 |
1993年 | 69篇 |
1992年 | 63篇 |
1991年 | 59篇 |
1990年 | 37篇 |
1989年 | 54篇 |
1988年 | 23篇 |
1987年 | 37篇 |
1986年 | 24篇 |
1985年 | 42篇 |
1984年 | 26篇 |
1983年 | 31篇 |
1982年 | 31篇 |
1981年 | 33篇 |
1980年 | 18篇 |
1979年 | 25篇 |
1978年 | 23篇 |
1977年 | 18篇 |
1976年 | 8篇 |
1975年 | 9篇 |
1974年 | 8篇 |
排序方式: 共有4747条查询结果,搜索用时 0 毫秒
51.
We consider two complementary operations: Hairpin completion introduced in [D. Cheptea, C. Martin-Vide, V. Mitrana, A new operation on words suggested by DNA biochemistry: Hairpin completion, in: Proc. Transgressive Computing, 2006, pp. 216–228] with motivations coming from DNA biochemistry and hairpin reduction as the inverse operation of the hairpin completion. Both operations are viewed here as formal operations on words and languages. We settle the closure properties of the classes of regular and linear context-free languages under hairpin completion in comparison with hairpin reduction. While the class of linear context-free languages is exactly the weak-code image of the class of the hairpin completion of regular languages, rather surprisingly, the weak-code image of the class of the hairpin completion of linear context-free languages is a class of mildly context-sensitive languages. The closure properties with respect to the hairpin reduction of some time and space complexity classes are also studied. We show that the factors found in the general cases are not necessary for regular and context-free languages. This part of the paper completes the results given in the earlier paper, where a similar investigation was made for hairpin completion. Finally, we briefly discuss the iterated variants of these operations. 相似文献
52.
Shunji Umetani Mutsunori Yagiura Shinji Imahori Takashi Imamichi Koji Nonobe Toshihide Ibaraki 《International Transactions in Operational Research》2009,16(6):661-683
The irregular strip-packing problem (ISP) requires a given set of non-convex polygons to be placed without overlap within a rectangular container having a fixed width and a variable length, which is to be minimized. As a core sub-problem to solve ISP, we consider an overlap minimization problem (OMP) whose objective is to place all polygons into a container with given width and length so that the total amount of overlap between polygons is made as small as possible. We propose to use directional penetration depths to measure the amount of overlap between a pair of polygons, and present an efficient algorithm to find a position with the minimum overlap for each polygon when it is translated in a specified direction. Based on this, we develop a local search algorithm for OMP that translates a polygon in horizontal and vertical directions alternately. Then we incorporate it in our algorithm for OMP, which is a variant of the guided local search algorithm. Computational results show that our algorithm improves the best-known values of some well-known benchmark instances. 相似文献
53.
54.
This paper is concerned with model-based isolation and estimation of additive faults in discrete-time linear Gaussian systems. The isolation problem is stated as a multiple composite hypothesis testing on the innovation sequence of the Kalman filter (KF) that considers the system operating under fault-free conditions. Fault estimation is carried out, after isolating a fault mode, by using the Maximum a Posteriori (MAP) criterion. An explicit solution is presented for both fault isolation and estimation when the parameters of the fault modes are assumed to be realizations of specific random variables (RV). 相似文献
55.
Block sorting in the Burrows-Wheeler transformation is to sort all of the n circular shifts of a string of length n lexicographically. We introduce a notion called the width of a sequence of n strings of length n and show that the values of widths are very different between the two types of sequences of strings; (1) a sequence of n randomly generated strings of length n, and (2) the sequence of n circular shifts of a randomly generated string of length n. 相似文献
56.
57.
Boosting is known as a gradient descent algorithm over loss functions. It is often pointed out that the typical boosting algorithm, Adaboost, is highly affected by outliers. In this letter, loss functions for robust boosting are studied. Based on the concept of robust statistics, we propose a transformation of loss functions that makes boosting algorithms robust against extreme outliers. Next, the truncation of loss functions is applied to contamination models that describe the occurrence of mislabels near decision boundaries. Numerical experiments illustrate that the proposed loss functions derived from the contamination models are useful for handling highly noisy data in comparison with other loss functions. 相似文献
58.
Investigations were made of varistor microstructure, the morphology of Bi2O3 at multiple ZnO grain junctions, Bi2O3/ZnO grain boundaries and ZnO/ZnO grain boundaries (especially whether Bi2O3 is present or not at the ZnO/ZnO grain boundary) by means of high-resolution transmission electron microscopy and X-ray microanalysis in the scanning transmission electron microscope. Bi2O3 at multiple ZnO grain junctions consists of small particles of 0.1m in diameter, and they are vitrified to some extent. It is suggested that bismuth ions dissolve into ZnO grains over a 30 nm range from a Bi2O3/ZnO grain boundary; however, there is no bismuth at ZnO/ZnO grain boundaries. 相似文献
59.
The basic constructs of SIMPOS (Sequential Inference Machine Programming and Operating System) are explained. SIMPOS is an operating system for a super-personal computer (SIM), based on logic programming language (a modified Prolog, called KL0). Our design principle is simplicity both in concept and structure. The entire system will be constructed using these basic constructs. 相似文献
60.
An Extension of the Receiver Operating Characteristic Curve and AUC-Optimal Classification 总被引:1,自引:0,他引:1
While most proposed methods for solving classification problems focus on minimization of the classification error rate, we are interested in the receiver operating characteristic (ROC) curve, which provides more information about classification performance than the error rate does. The area under the ROC curve (AUC) is a natural measure for overall assessment of a classifier based on the ROC curve. We discuss a class of concave functions for AUC maximization in which a boosting-type algorithm including RankBoost is considered, and the Bayesian risk consistency and the lower bound of the optimum function are discussed. A procedure derived by maximizing a specific optimum function has high robustness, based on gross error sensitivity. Additionally, we focus on the partial AUC, which is the partial area under the ROC curve. For example, in medical screening, a high true-positive rate to the fixed lower false-positive rate is preferable and thus the partial AUC corresponding to lower false-positive rates is much more important than the remaining AUC. We extend the class of concave optimum functions for partial AUC optimality with the boosting algorithm. We investigated the validity of the proposed method through several experiments with data sets in the UCI repository. 相似文献