首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   20873篇
  免费   2669篇
  国内免费   2430篇
电工技术   2361篇
综合类   3245篇
化学工业   1206篇
金属工艺   503篇
机械仪表   1350篇
建筑科学   838篇
矿业工程   325篇
能源动力   361篇
轻工业   721篇
水利工程   412篇
石油天然气   475篇
武器工业   255篇
无线电   3037篇
一般工业技术   2053篇
冶金工业   341篇
原子能技术   208篇
自动化技术   8281篇
  2024年   104篇
  2023年   298篇
  2022年   518篇
  2021年   577篇
  2020年   711篇
  2019年   704篇
  2018年   620篇
  2017年   836篇
  2016年   896篇
  2015年   874篇
  2014年   1248篇
  2013年   1706篇
  2012年   1553篇
  2011年   1622篇
  2010年   1301篇
  2009年   1356篇
  2008年   1280篇
  2007年   1417篇
  2006年   1142篇
  2005年   1067篇
  2004年   915篇
  2003年   767篇
  2002年   680篇
  2001年   564篇
  2000年   518篇
  1999年   429篇
  1998年   313篇
  1997年   324篇
  1996年   259篇
  1995年   215篇
  1994年   194篇
  1993年   151篇
  1992年   133篇
  1991年   134篇
  1990年   102篇
  1989年   82篇
  1988年   59篇
  1987年   47篇
  1986年   31篇
  1985年   24篇
  1984年   36篇
  1983年   41篇
  1982年   26篇
  1981年   23篇
  1980年   17篇
  1979年   10篇
  1978年   10篇
  1977年   14篇
  1975年   4篇
  1959年   4篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
Dimensionality reduction is a big challenge in many areas. A large number of local approaches, stemming from statistics or geometry, have been developed. However, in practice these local approaches are often in lack of robustness, since in contrast to maximum variance unfolding (MVU), which explicitly unfolds the manifold, they merely characterize local geometry structure. Moreover, the eigenproblems that they encounter, are hard to solve. We propose a unified framework that explicitly unfolds the manifold and reformulate local approaches as the semi-definite programs instead of the above-mentioned eigenproblems. Three well-known algorithms, locally linear embedding (LLE), laplacian eigenmaps (LE) and local tangent space alignment (LTSA) are reinterpreted and improved within this framework. Several experiments are presented to demonstrate the potential of our framework and the improvements of these local algorithms.  相似文献   
52.
感知质量和容量一直是图像隐写算法设计中难以折中的两个要素,如何取得更好的综合性能已吸引了很多研究者的兴趣.提出一种基于自适应量化嵌入器的隐写方法.这一方法通过改变某一载体信号所在子空间的索引来调制秘密信息,自适应特性体现在决定着子空间尺寸的分割码本的设计上.将这种隐写方法用于以2×2图像块为单元的数字图像隐写算法设计中,并将分割码本设计得具备HVS特性以取得较好的折中效果.实验表明,算法在感知质量和容量方面具有较好的综合性能.  相似文献   
53.
赵耿  王冰  袁阳  王志刚 《计算机工程》2009,35(21):10-12,1
针对传统密码学中由线性移位寄存器生成的序列在统计特性上的不足,提出一种基于混沌的序列密码生成方法,并在有限精度实现时引入Legendre扰动序列使得输出具有良好的统计特性。用B-M算法对其进行线性复杂度分析,并与等效的线性反馈移位寄存器的复杂度进行比较,结果显示该混沌序列具有良好的非线性特性,保密性好且软件实现简单。  相似文献   
54.
一种改进的步态识别方法   总被引:2,自引:2,他引:0       下载免费PDF全文
步态识别通过人体走路的姿势来识别人的身份。近年来,步态作为一种生物特征识别技术备受计算机视觉研究者的关注。对某个人的一个步态序列利用动态Viterbi算法得到一个样本姿态序列,对其多个步态样本姿态序列的对应姿态取平均得到这个人的特征姿态序列,对特征姿态采用主成分分析法和线性判别分析法处理特征空间,并用最近邻法进行识别。利用CASIA数据库对本文方法进行验证,取得了较高的识别率,并对体形变化具有较强的鲁棒性。  相似文献   
55.
The output feedback robust model predictive control (MPC), for the linear parameter varying (LPV) system with norm-bounded disturbance, is addressed, where the model parametric matrices are only known to be bounded within a polytope. The previous techniques of norm-bounding technique, quadratic boundedness (QB), dynamic output feedback, and ellipsoid (true-state bound; TSB) refreshment formula for guaranteeing recursive feasibility, are fused into the newly proposed approaches. In the notion of QB, the full Lyapunov matrix is applied for the first time in this context. The single-step dynamic output feedback robust MPC, where the infinite-horizon control moves are parameterised as a dynamic output feedback law, is the main topic of this paper, while the multi-step method is also suggested. In order to strictly guarantee the physical constraints, the outer bound of the true state replaces the true state itself, so tightness of this bound has a major effect on the control performance. In order to tighten the TSB, a procedure for refreshing the real-time ellipsoid based on that of the last sampling instant is given. This paper is conclusive for the past results and far-reaching for the future researches. Two benchmark examples are given to show the effectiveness of the novel results.  相似文献   
56.
In the real-world manufacturing/distribution planning decision (MDPD) integration problems in supply chains, the environmental coefficients and parameters are normally imprecise due to incomplete and/or unavailable information. This work presents a fuzzy linear programming approach based on the possibility theory. It applies this approach to solve multi-product and multi-time period MDPD problems with imprecise goals and forecast demand by considering the time value of money of related operating cost categories. The proposed approach attempts to minimize the total manufacturing and distribution costs by considering the levels of inventory, subcontracting and backordering, the available machine capacity and labor levels at each source, forecast demand and available warehouse space at each destination. This study utilizes an industrial case study to demonstrate the feasibility of applying the proposed approach to practical MDPD problems. The primary contribution of this paper is a fuzzy mathematical programming methodology for solving the MDPD integration problems in uncertain environments.  相似文献   
57.
This paper deals with the stability radii of implicit dynamic equations on time scales when the structured perturbations act on both the coefficient of derivative and the right-hand side. Formulas of the stability radii are derived as a unification and generalization of some previous results. A special case where the real stability radius and the complex stability radius are equal is studied. Examples are derived to illustrate results.  相似文献   
58.
Optimizing the orthopaedic screws can greatly improve their biomechanical performances. However, a methodical design optimization approach requires a long time to search the best design. Thus, the surrogate objective functions of the orthopaedic screws should be accurately developed. To our knowledge, there is no study to evaluate the strengths and limitations of the surrogate methods in developing the objective functions of the orthopaedic screws. Three-dimensional finite element models for both the tibial locking screws and the spinal pedicle screws were constructed and analyzed. Then, the learning data were prepared according to the arrangement of the Taguchi orthogonal array, and the verification data were selected with use of a randomized selection. Finally, the surrogate objective functions were developed by using either the multiple linear regression or the artificial neural network. The applicability and accuracy of those surrogate methods were evaluated and discussed. The multiple linear regression method could successfully construct the objective function of the tibial locking screws, but it failed to develop the objective function of the spinal pedicle screws. The artificial neural network method showed a greater capacity of prediction in developing the objective functions for the tibial locking screws and the spinal pedicle screws than the multiple linear regression method. The artificial neural network method may be a useful option for developing the objective functions of the orthopaedic screws with a greater structural complexity. The surrogate objective functions of the orthopaedic screws could effectively decrease the time and effort required for the design optimization process.  相似文献   
59.
传感器输出特性的线性化回归程序设计   总被引:2,自引:1,他引:1  
介绍了用面向对象程序设计方法编制的线性回归数据处理程序 ,该程序用于传感器实验数据的回归处理和特性曲线的绘制  相似文献   
60.
Evolving Teams of Predictors with Linear Genetic Programming   总被引:1,自引:0,他引:1  
This paper applies the evolution of GP teams to different classification and regression problems and compares different methods for combining the outputs of the team programs. These include hybrid approaches where (1) a neural network is used to optimize the weights of programs in a team for a common decision and (2) a realnumbered vector (the representation of evolution strategies) of weights is evolved with each term in parallel. The cooperative team approach results in an improved training and generalization performance compared to the standard GP method. The higher computational overhead of team evolution is counteracted by using a fast variant of linear GP.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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