全文获取类型
收费全文 | 50880篇 |
免费 | 4474篇 |
国内免费 | 2168篇 |
专业分类
电工技术 | 2896篇 |
技术理论 | 8篇 |
综合类 | 3303篇 |
化学工业 | 8557篇 |
金属工艺 | 2999篇 |
机械仪表 | 3309篇 |
建筑科学 | 3626篇 |
矿业工程 | 1628篇 |
能源动力 | 1562篇 |
轻工业 | 3201篇 |
水利工程 | 812篇 |
石油天然气 | 3217篇 |
武器工业 | 471篇 |
无线电 | 5901篇 |
一般工业技术 | 6451篇 |
冶金工业 | 2465篇 |
原子能技术 | 698篇 |
自动化技术 | 6418篇 |
出版年
2024年 | 189篇 |
2023年 | 896篇 |
2022年 | 1383篇 |
2021年 | 2197篇 |
2020年 | 1650篇 |
2019年 | 1359篇 |
2018年 | 1558篇 |
2017年 | 1808篇 |
2016年 | 1605篇 |
2015年 | 2108篇 |
2014年 | 2718篇 |
2013年 | 3253篇 |
2012年 | 3404篇 |
2011年 | 3653篇 |
2010年 | 3085篇 |
2009年 | 2938篇 |
2008年 | 2931篇 |
2007年 | 2766篇 |
2006年 | 2676篇 |
2005年 | 2275篇 |
2004年 | 1605篇 |
2003年 | 1387篇 |
2002年 | 1368篇 |
2001年 | 1189篇 |
2000年 | 1183篇 |
1999年 | 1186篇 |
1998年 | 981篇 |
1997年 | 836篇 |
1996年 | 776篇 |
1995年 | 590篇 |
1994年 | 499篇 |
1993年 | 330篇 |
1992年 | 266篇 |
1991年 | 199篇 |
1990年 | 168篇 |
1989年 | 132篇 |
1988年 | 111篇 |
1987年 | 57篇 |
1986年 | 55篇 |
1985年 | 33篇 |
1984年 | 28篇 |
1983年 | 23篇 |
1982年 | 24篇 |
1981年 | 14篇 |
1980年 | 7篇 |
1979年 | 6篇 |
1976年 | 6篇 |
1973年 | 2篇 |
1970年 | 2篇 |
1959年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 734 毫秒
991.
A new iterative algorithm for solving H∞ control problem of continuous‐time Markovian jumping linear systems based on online implementation 下载免费PDF全文
A new online iterative algorithm for solving the H∞ control problem of continuous‐time Markovian jumping linear systems is developed. For comparison, an available offline iterative algorithm for converging to the solution of the H∞ control problem is firstly proposed. Based on the offline iterative algorithm and a new online decoupling technique named subsystems transformation method, a set of linear subsystems, which implementation in parallel, are obtained. By means of the adaptive dynamic programming technique, the two‐player zero‐sum game with the coupled game algebraic Riccati equation is solved online thereafter. The convergence of the novel policy iteration algorithm is also established. At last, simulation results have illustrated the effectiveness and applicability of these two methods. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
992.
Semi‐global and global containment control of multi‐agent systems with second‐order dynamics and input saturation 下载免费PDF全文
This paper considers both semi‐global and global containment control for a second‐order multi‐agent system that is composed by a network of identical harmonic oscillators or double integrators with multiple leaders and input saturation. A distributed low gain feedback algorithm is proposed to solve the semi‐global containment control problem for the network whose topology is directed and initial condition is taken from any a priori given bounded set. In particular, by using a parametric Lyapunov equation approach, M‐matrix properties and algebraic graph theory, an upper bound of the low gain parameter is estimated such that the low gain feedback matrix can be analytically determined without involving numerical computation. Furthermore, under the assumption that the induced subgraph formed by the followers is strongly connected and detail balanced, two linear feedback protocols are designed for coupled harmonic oscillators and coupled double integrators, respectively, to asymptotically achieve the global containment control of the network with any initial condition. Finally, numerical examples are given to illustrate the effectiveness of the theoretical results. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
993.
Md. Monirul Hoque Gihun Song Kiok Ahn Byungyong Ryu Md. Tauhid Bin Iqbal Oksam Chae 《Multimedia Tools and Applications》2016,75(8):4259-4283
With the rapid development of visual digital media, the demand for better quality of service has increased the pressure on broadcasters to automate their error detection and restoration activities for preserving their archives. Digital dropout is one of the defects that affect archived visual materials and tends to occur in block by block basis (size of 8 × 8). It is well established that human visual system (HVS) is highly adapted to the statistics of its visual natural environment. Consequently, in this paper, we have formulated digital dropout detection as a classification problem which predicts block label based on statistical features. These statistical features are indicative of perceptual quality relevant to human visual perception, and allow pristine images to be distinguished from distorted ones. Here, the idea is to extract discriminant block statistical features based on discrete cosine transform (DCT) coefficients and determine an optimal neighborhood sampling strategy to enhance the discrimination ability of block representation. Since this spatial frame based approach is free from any motion computation dependency, it works perfectly in the presence of fast moving objects. Experiments are performed on video archives to evaluate the efficacy of the proposed technique. 相似文献
994.
995.
Emotional speech feature normalization and recognition based on speaker-sensitive feature clustering
In this paper we propose a feature normalization method for speaker-independent speech emotion recognition. The performance of a speech emotion classifier largely depends on the training data, and a large number of unknown speakers may cause a great challenge. To address this problem, first, we extract and analyse 481 basic acoustic features. Second, we use principal component analysis and linear discriminant analysis jointly to construct the speaker-sensitive feature space. Third, we classify the emotional utterances into pseudo-speaker groups in the speaker-sensitive feature space by using fuzzy k-means clustering. Finally, we normalize the original basic acoustic features of each utterance based on its group information. To verify our normalization algorithm, we adopt a Gaussian mixture model based classifier for recognition test. The experimental results show that our normalization algorithm is effective on our locally collected database, as well as on the eNTERFACE’05 Audio-Visual Emotion Database. The emotional features achieved using our method are robust to the speaker change, and an improved recognition rate is observed. 相似文献
996.
Changbin Shao Xiaoning Song Xibei Yang Xiaojun Wu 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2016,20(8):3177-3187
The changes of face images with poses and polarized illuminations increase data uncertainty in face recognition. In fact, synthesized mirror samples can be recognized as representations of the left–right deflection of poses or illuminations of the face. Symmetrical face images generated from the original face images also provide more observations of the face which is useful for improving the accuracy of face recognition. In this paper, to the best of our knowledge, it is the first time that the well-known minimum squared error classification (MSEC) algorithm is used to perform face recognition on an extended face database using synthesized mirror training samples, which is titled as extended minimum squared error classification (EMSEC). By modifying the MSE classification rule, we append the mirror samples to the training set for gaining better classification performance. First, we merge original training samples and mirror samples synthesized from original training samples per subject as mixed training samples. Second, EMSEC algorithm exploits mixed training samples to obtain the projection matrix that can best transform the mixed training samples into predefined class labels. Third, the projection matrix is exploited to simultaneously obtain transform results of the test sample and its nearest neighbor from the mixed training sample set. Finally, we ultimately classify the test sample by combining the transform results of the test sample and the nearest neighbor. As an extension of MSEC, EMSEC reduces the uncertainty of the face observation by auxiliary mirror samples, so that it has better robustness classification performance than traditional MSEC. Experimental results on the ORL, GT, and FERET databases show that EMSEC has better generalization ability than traditional MSEC. 相似文献
997.
Jin-Lei Wu Chong Song Jing Xu Lin Yu Xin Ji Shou Zhang 《Quantum Information Processing》2016,15(9):3663-3675
An efficient scheme is proposed for generating n-qubit Greenberger–Horne–Zeilinger states of n superconducting qubits separated by (\(n-1\)) coplanar waveguide resonators capacitively via adiabatic passage with the help of quantum Zeno dynamics in one step. In the scheme, it is not necessary to precisely control the time of the whole operation and the Rabi frequencies of classical fields because of the introduction of adiabatic passage. The numerical simulations for three-qubit Greenberger–Horne–Zeilinger state show that the scheme is insensitive to the dissipation of the resonators and the energy relaxation of the superconducting qubits. The three-qubit Greenberger–Horne–Zeilinger state can be deterministically generated with comparatively high fidelity in the current experimental conditions, though the scheme is somewhat sensitive to the dephasing of superconducting qubits. 相似文献
998.
Evgueni T. Filipov Junho Chun Glaucio H. Paulino Junho Song 《Structural and Multidisciplinary Optimization》2016,53(4):673-694
We use versatile polygonal elements along with a multiresolution scheme for topology optimization to achieve computationally efficient and high resolution designs for structural dynamics problems. The multiresolution scheme uses a coarse finite element mesh to perform the analysis, a fine design variable mesh for the optimization and a fine density variable mesh to represent the material distribution. The finite element discretization employs a conforming finite element mesh. The design variable and density discretizations employ either matching or non-matching grids to provide a finer discretization for the density and design variables. Examples are shown for the optimization of structural eigenfrequencies and forced vibration problems. 相似文献
999.
1000.
Internet Data Center (IDC) is one of important emerging cyber-physical systems. To guarantee the quality of service for their worldwide users, large Internet service providers usually operate multiple geographically distributed IDCs. The enormous power consumption of these data centers may lead to both huge electricity bills and considerable carbon emissions. To mitigate these problems, on-site renewable energy plants are emerging in recent years. Since the renewable energy is intermittent, greening geographical load balancing (GGLB for short) has been proposed to reduce both the electricity bills and carbon emissions by following the renewables. However, GGLB is not able to well deal with the wildly fluctuating wind power when applied into IDCs with on-site wind energy plants. It may either fail to minimize the total electricity bills or incur the costly frequent on–off switching of servers. In order to minimize the total electricity bills of geographically distributed IDCs with on-site wind energy plants, we formulate the total electricity bills minimization problem and propose a novel two-time-scale load balancing framework TLB to solve it. First, TLB models the runtime cooling efficiency for each IDC. Then it predicts the future fine-grained (e.g., 10-min) on-site wind power output at the beginning of each scheduling period (e.g., an hour). After that, TLB transforms the primal optimization problem into a typical mixed-integer linear programming problem and solves it to finally obtain the optimal scheduling policy including the open server number as well as the request routing policy. It is worth noting that the open server number of each IDC will remain the same during each scheduling period. As an application instance of TLB, we also design a two-time-scale load balancing algorithm TLB-ARMA for our experimental scenario. Evaluation results based on real-life traces show that TLB-ARMA is able to reduce the total electricity bills by as much as 12.58 % compared with the hourly executed GGLB without incurring the costly repeated on–off switching of servers. 相似文献