首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   168139篇
  免费   7035篇
  国内免费   3319篇
电工技术   5115篇
技术理论   9篇
综合类   6796篇
化学工业   26602篇
金属工艺   9099篇
机械仪表   8151篇
建筑科学   9151篇
矿业工程   2538篇
能源动力   3551篇
轻工业   8414篇
水利工程   2688篇
石油天然气   4861篇
武器工业   488篇
无线电   19396篇
一般工业技术   27147篇
冶金工业   7258篇
原子能技术   1072篇
自动化技术   36157篇
  2024年   324篇
  2023年   1314篇
  2022年   2280篇
  2021年   3118篇
  2020年   2339篇
  2019年   2033篇
  2018年   16320篇
  2017年   15527篇
  2016年   12053篇
  2015年   3524篇
  2014年   4231篇
  2013年   5248篇
  2012年   8286篇
  2011年   14706篇
  2010年   12961篇
  2009年   10099篇
  2008年   11066篇
  2007年   12016篇
  2006年   4753篇
  2005年   5320篇
  2004年   3873篇
  2003年   3643篇
  2002年   2714篇
  2001年   2110篇
  2000年   2455篇
  1999年   2614篇
  1998年   2434篇
  1997年   1911篇
  1996年   1786篇
  1995年   1454篇
  1994年   1227篇
  1993年   888篇
  1992年   666篇
  1991年   565篇
  1990年   409篇
  1989年   367篇
  1988年   327篇
  1987年   175篇
  1986年   165篇
  1985年   112篇
  1984年   98篇
  1983年   63篇
  1982年   60篇
  1981年   54篇
  1980年   38篇
  1968年   45篇
  1966年   43篇
  1965年   45篇
  1955年   63篇
  1954年   68篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
991.
In this work, we present a method of decomposition of arbitrary unitary matrix \(U\in \mathbf {U}(2^k)\) into a product of single-qubit negator and controlled-\(\sqrt{\text{ NOT }}\) gates. Since the product results with negator matrix, which can be treated as complex analogue of bistochastic matrix, our method can be seen as complex analogue of Sinkhorn–Knopp algorithm, where diagonal matrices are replaced by adding and removing an one-qubit ancilla. The decomposition can be found constructively, and resulting circuit consists of \(O(4^k)\) entangling gates, which is proved to be optimal. An example of such transformation is presented.  相似文献   
992.
In quantum key distribution (QKD), the information theoretically secure authentication is necessary to guarantee the integrity and authenticity of the exchanged information over the classical channel. In order to reduce the key consumption, the authentication scheme with key recycling (KR), in which a secret but fixed hash function is used for multiple messages while each tag is encrypted with a one-time pad (OTP), is preferred in QKD. Based on the assumption that the OTP key is perfect, the security of the authentication scheme has be proved. However, the OTP key of authentication in a practical QKD system is not perfect. How the imperfect OTP affects the security of authentication scheme with KR is analyzed thoroughly in this paper. In a practical QKD, the information of the OTP key resulting from QKD is partially leaked to the adversary. Although the information leakage is usually so little to be neglected, it will lead to the increasing degraded security of the authentication scheme as the system runs continuously. Both our theoretical analysis and simulation results demonstrate that the security level of authentication scheme with KR, mainly indicated by its substitution probability, degrades exponentially in the number of rounds and gradually diminishes to zero.  相似文献   
993.
We explore an efficient scheme for transferring quantum state between an optomechanical cavity and nuclear spins of nitrogen-vacancy centers in diamond, where quantum information can be efficiently stored (retrieved) into (from) the nuclear spin ensemble assisted by a mechanical resonator in a dispersive regime. Our scheme works for a broad range of cavity frequencies and might have potential applications in employing the nuclear spin ensemble as a memory in quantum information processing. The feasibility of our protocol is analyzed using currently available parameters.  相似文献   
994.
This study investigates unitary equivalent classes of one-dimensional quantum walks. We prove that one-dimensional quantum walks are unitary equivalent to quantum walks of Ambainis type and that translation-invariant one-dimensional quantum walks are Szegedy walks. We also present a necessary and sufficient condition for a one-dimensional quantum walk to be a Szegedy walk.  相似文献   
995.
996.
This paper presents a modular designed autonomous bolt tightening shaft system with an adaptive fuzzy backstepping control approach developed for it. The bolt tightening shaft is designed for the autonomous bolt tightening operation, which has huge potential for industry application. Due to the inherent nonlinear and uncertain properties, the bolt tightening shaft and the bolt tightening process are mathematically modeled as an uncertain strict feedback system. With the adaptive backstepping and approximation property of fuzzy logic system, the controller is recursively designed. Based on the Lyapunov stability theorem, all signals in the closed-loop system are proved to be uniformly ultimately bounded and the torque tracking error exponentially converges to a small residue. And the effectiveness and performance of the proposed autonomous system are verified by the simulation and experiment results on the bolt tightening shaft system.  相似文献   
997.
This paper is concerned with improved stability criteria for uncertain T-S fuzzy systems with interval time-varying delay by means of a new (m,N)-delay-partitioning approach. Based on an appropriate augmented LKF established in the framework of state vector augmentation, some tighter bounding inequalities (Seuret-Wirtinger’s integral inequality, Peng-Park’s integral inequality and the reciprocally convex approach) have been employed to deal with (time-varying) delay-dependent integral items of the derivative of LKF, therefore, less conservative delaydependent stability criteria can be obtained on account of none of any useful time-varying items are arbitrarily ignored. It’s worth mentioning that, when the delay-partitioning number m is fixed, less conservatism can be achieved by increase of another delay-partitioning number N, but without increasing any computing burden. Finally, one numerical example is provided to show that the proposed conditions are less conservative than existing ones.  相似文献   
998.
In this paper, an Integrated Guidance and Control (IGC) algorithm based on a reference model is proposed for a side-jet missile. First, a IGC structure is introduced, incorporating the response characteristics of the missile control loop into the guidance loop. To describe the response characteristics, then a reference model is built. Next, with the back stepping scheme and sliding mode control algorithm, the reference model is adopted to derive a novel guidance law, which contains response parameters of missile control system to formulate the IGC design. Finally, simulations and comparisons with the time-scale separation design and an existing IGC design, are conducted to verify the proposed IGC algorithm. It can be shown that the proposed algorithm performs better against highly maneuvering target in different missile-target initial position and heading scenarios.  相似文献   
999.
This paper studies a rigid body attitude tracking control problem with attitude measurements only, when angular velocity measurements are not available. An angular velocity observer is constructed such that the estimated angular velocity is guaranteed to converge to the true angular velocity asymptotically from almost all initial estimates. As it is developed directly on the special orthogonal group, which completely avoids singularities, complexities, or discontinuities caused by minimal attitude representations or quaternions. Then, the presented observer is integrated with a proportional-derivative attitude tracking controller to show a separation type property, where exponential stability is guaranteed for the combined observer and attitude control system.  相似文献   
1000.
The tensor-product (TP) model transformation was proposed recently as a numerical and automatically executable method which is capable of transforming linear parameter varying (LPV) state-space models into the higher order singular value decomposition (HOSVD) based canonical form of polytopic models. The crucial disadvantage of the TP model transformation is that its computational load explodes with the density of discretization and the dimensionality of the parameter vector of the parameter-varying state-space model. In this paper we propose a new algorithm that leads to considerable reduction of the computation in the TP model transformation. The main idea behind the modified algorithm is to minimize the number of discretized points to acquire as much information as possible. The modified TP model transformation can readily be executed on a regular computer efficiently and concisely, especially in higher dimensional cases when the original TP model transformation fails. The paper also presents numerical examples to show the effectiveness of the new algorithm.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号