全文获取类型
收费全文 | 119570篇 |
免费 | 3770篇 |
国内免费 | 1829篇 |
专业分类
电工技术 | 2607篇 |
综合类 | 4418篇 |
化学工业 | 17709篇 |
金属工艺 | 6514篇 |
机械仪表 | 5120篇 |
建筑科学 | 5419篇 |
矿业工程 | 1414篇 |
能源动力 | 2234篇 |
轻工业 | 5942篇 |
水利工程 | 1824篇 |
石油天然气 | 2432篇 |
武器工业 | 241篇 |
无线电 | 13472篇 |
一般工业技术 | 20802篇 |
冶金工业 | 4539篇 |
原子能技术 | 721篇 |
自动化技术 | 29761篇 |
出版年
2024年 | 155篇 |
2023年 | 556篇 |
2022年 | 998篇 |
2021年 | 1362篇 |
2020年 | 1042篇 |
2019年 | 882篇 |
2018年 | 15252篇 |
2017年 | 14349篇 |
2016年 | 10847篇 |
2015年 | 1867篇 |
2014年 | 1851篇 |
2013年 | 2261篇 |
2012年 | 5285篇 |
2011年 | 11699篇 |
2010年 | 10202篇 |
2009年 | 7448篇 |
2008年 | 8613篇 |
2007年 | 9572篇 |
2006年 | 2033篇 |
2005年 | 2944篇 |
2004年 | 2306篇 |
2003年 | 2222篇 |
2002年 | 1570篇 |
2001年 | 979篇 |
2000年 | 1147篇 |
1999年 | 1095篇 |
1998年 | 1055篇 |
1997年 | 840篇 |
1996年 | 858篇 |
1995年 | 663篇 |
1994年 | 527篇 |
1993年 | 474篇 |
1992年 | 333篇 |
1991年 | 259篇 |
1990年 | 241篇 |
1989年 | 166篇 |
1988年 | 153篇 |
1987年 | 94篇 |
1986年 | 78篇 |
1985年 | 56篇 |
1984年 | 48篇 |
1968年 | 49篇 |
1966年 | 43篇 |
1965年 | 44篇 |
1959年 | 35篇 |
1958年 | 37篇 |
1957年 | 36篇 |
1956年 | 34篇 |
1955年 | 63篇 |
1954年 | 68篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
971.
Finite‐time asynchronous
filtering for discrete‐time Markov jump systems over a lossy network 下载免费PDF全文
This paper is concerned with the problem of finite‐time asynchronous filtering for a class of discrete‐time Markov jump systems. The communication links between the system and filter are assumed to be unreliable, which lead to the simultaneous occurrences of packet dropouts, time delays, sensor nonlinearity and nonsynchronous modes. The objective is to design a filter that ensures not only the mean‐square stochastic finite‐time bounded but also a prescribed level of performance for the underlying error system over a lossy network. With the help of the Lyapunov–Krasovskii approach and stochastic analysis theory, sufficient conditions are established for the existence of an admissible filter. By using a novel simple matrix decoupling approach, a desired asynchronous filter can be constructed. Finally, a numerical example is presented and a pulse‐width‐modulation‐driven boost converter model is employed to demonstrate the effectiveness of the proposed approach. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
972.
The ideal of Bessel-Fourier moments (BFMs) for image analysis and only rotation invariant image cognition has been proposed recently. In this paper, we extend the previous work and propose a new method for rotation, scaling and translation (RST) invariant texture recognition using Bessel-Fourier moments. Compared with the others moments based methods, the radial polynomials of Bessel-Fourier moments have more zeros and these zeros are more evenly distributed. It makes Bessel-Fourier moments more suitable for invariant texture recognition as a generalization of orthogonal complex moments. In the experiment part, we got three testing sets of 16, 24 and 54 texture images by way of translating, rotating and scaling them separately. The correct classification percentages (CCPs) are compared with that of orthogonal Fourier-Mellin moments and Zernike moments based methods in both noise-free and noisy condition. Experimental results validate the conclusion of theoretical derivation: BFM performs better in recognition capability and noise robustness in terms of RST texture recognition under both noise-free and noisy condition when compared with orthogonal Fourier-Mellin moments and Zernike moments based methods. 相似文献
973.
Ji-Hong Zhu Wei-Hong Zhang Liang Xia 《Archives of Computational Methods in Engineering》2016,23(4):595-622
Topology optimization has become an effective tool for least-weight and performance design, especially in aeronautics and aerospace engineering. The purpose of this paper is to survey recent advances of topology optimization techniques applied in aircraft and aerospace structures design. This paper firstly reviews several existing applications: (1) standard material layout design for airframe structures, (2) layout design of stiffener ribs for aircraft panels, (3) multi-component layout design for aerospace structural systems, (4) multi-fasteners design for assembled aircraft structures. Secondly, potential applications of topology optimization in dynamic responses design, shape preserving design, smart structures design, structural features design and additive manufacturing are introduced to provide a forward-looking perspective. 相似文献
974.
Mickaël Duval Jean-Charles Passieux Michel Salaün Stéphane Guinard 《Archives of Computational Methods in Engineering》2016,23(1):17-38
This paper provides a detailed review of the global/local non-intrusive coupling algorithm. Such method allows to alter a global finite element model, without actually modifying its corresponding numerical operator. We also look into improvements of the initial algorithm (Quasi-Newton and dynamic relaxation), and provide comparisons based on several relevant test cases. Innovative examples and advanced applications of the non-intrusive coupling algorithm are provided, granting a handy framework for both researchers and engineers willing to make use of such process. Finally, a novel nonlinear domain decomposition method is derived from the global/local non-intrusive coupling strategy, without the need to use a parallel code or software. Such method being intended to large scale analysis, we show its scalability. Jointly, an efficient high level Message Passing Interface coupling framework is also proposed, granting an universal and flexible way for easy software coupling. A sample code is also given. 相似文献
975.
976.
Bingqing Wang Lijin Wang Yilong Yin Yunlong Xu Wenting Zhao Yuchun Tang 《Neural Processing Letters》2016,44(1):37-52
This paper proposes a hybrid algorithm by combining backtracking search algorithm (BSA) and a neural network with random weights (NNRWs), called BSA-NNRWs-N. BSA is utilized to optimize the hidden layer parameters of the single layer feed-forward network (SLFN) and NNRWs is used to derive the output layer weights. In addition, to avoid over-fitting on the validation set, a new cost function is proposed to replace the root mean square error (RMSE). In the new cost function, a constraint is added by considering RMSE on both training and validation sets. Experiments on classification and regression data sets show promising performance of the proposed BSA-NNRWs-N. 相似文献
977.
Abdoul Bitar Stéphane Dauzère-Pérès Claude Yugma Renaud Roussel 《Journal of Scheduling》2016,19(4):367-376
In this paper, we propose a metaheuristic for solving an original scheduling problem with auxiliary resources in a photolithography workshop of a semiconductor plant. The photolithography workshop is often a bottleneck, and improving scheduling decisions in this workshop can help to improve indicators of the whole plant. Two optimization criteria are separately considered: the weighted flow time (to minimize) and the number of products that are processed (to maximize). After stating the problem and giving some properties on the solution space, we show how these properties help us to efficiently solve the problem with the proposed memetic algorithm, which has been implemented and tested on large generated instances. Numerical experiments show that good solutions are obtained within a reasonable computational time. 相似文献
978.
Enrico Angelelli Thomas Kalinowski Reena Kapoor Martin W. P. Savelsbergh 《Journal of Scheduling》2016,19(5):563-582
We study a number of variants of an abstract scheduling problem inspired by the scheduling of reclaimers in the stockyard of a coal export terminal. We analyze the complexity of each of the variants, providing complexity proofs for some and polynomial algorithms for others. For one, especially interesting variant, we also develop a constant factor approximation algorithm. 相似文献
979.
An empirical analysis was performed to compare the effectiveness of different approaches to training a set of procedural skills to a sample of novice trainees. Sixty-five participants were randomly assigned to one of the following three training groups: (1) learning-by-doing in a 3D desktop virtual environment, (2) learning-by-observing a video (show-and-tell) explanation of the procedures, and (3) trial-and-error. In each group, participants were trained on two car service procedures. Participants were recalled to perform a procedure either 2 or 4 weeks after the training. The results showed that: (1) participants trained through the virtual approach of learning-by-doing performed both procedures significantly better (i.e. p < .05 in terms of errors and time) than people of non-virtual groups, (2) the virtual training group, after a period of non-use, were more effective than non-virtual training (i.e. p < .05) in their ability to recover their skills, (3) after a (simulated) long period from the training—i.e. up to 12 weeks—people who experienced 3D environments consistently performed better than people who received other kinds of training. The results also suggested that independently from the training group, trainees’ visuospatial abilities were a predictor of performance, at least for the complex service procedure, adj R 2 = .460, and that post-training performances of people trained through virtual learning-by-doing are not affected by learning styles. Finally, a strong relationship (p < .001, R 2 = .441) was identified between usability and trust in the use of the virtual training tool—i.e. the more the system was perceived as usable, the more it was perceived as trustable to acquire the competences. 相似文献
980.
Mihai Burcea Wing-Kai Hon Hsiang-Hsuan Liu Prudence W. H. Wong David K. Y. Yau 《Journal of Scheduling》2016,19(6):687-699
We study an offline scheduling problem arising in demand response management in a smart grid. Consumers send in power requests with a flexible set of timeslots during which their requests can be served. For example, a consumer may request the dishwasher to operate for 1 h during the periods 8am to 11am or 2pm to 4pm. The grid controller, upon receiving power requests, schedules each request within the specified duration. The electricity cost is measured by a convex function of the load in each timeslot. The objective of the problem is to schedule all requests with the minimum total electricity cost. As a first attempt, we consider a special case in which the power requirement and the duration a for which a request needs service are both unit-size. For this problem, we present a polynomial time offline algorithm that gives an optimal solution and shows that the time complexity can be further improved if the given set of timeslots forms a contiguous interval. 相似文献