首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   799700篇
  免费   70680篇
  国内免费   43434篇
电工技术   106633篇
技术理论   68篇
综合类   80223篇
化学工业   65781篇
金属工艺   30208篇
机械仪表   58183篇
建筑科学   81462篇
矿业工程   33284篇
能源动力   31390篇
轻工业   38914篇
水利工程   28323篇
石油天然气   30739篇
武器工业   10147篇
无线电   66360篇
一般工业技术   53753篇
冶金工业   33664篇
原子能技术   8466篇
自动化技术   156216篇
  2024年   3212篇
  2023年   9229篇
  2022年   17006篇
  2021年   21292篇
  2020年   22766篇
  2019年   17938篇
  2018年   16825篇
  2017年   22375篇
  2016年   26343篇
  2015年   28876篇
  2014年   52034篇
  2013年   47468篇
  2012年   57927篇
  2011年   63263篇
  2010年   47148篇
  2009年   48081篇
  2008年   46609篇
  2007年   56815篇
  2006年   50779篇
  2005年   44142篇
  2004年   36765篇
  2003年   32462篇
  2002年   25875篇
  2001年   21446篇
  2000年   18317篇
  1999年   14691篇
  1998年   11318篇
  1997年   9682篇
  1996年   8195篇
  1995年   6856篇
  1994年   5825篇
  1993年   4170篇
  1992年   3571篇
  1991年   2648篇
  1990年   2153篇
  1989年   1898篇
  1988年   1358篇
  1987年   915篇
  1986年   729篇
  1985年   774篇
  1984年   765篇
  1983年   664篇
  1982年   526篇
  1981年   350篇
  1980年   305篇
  1979年   250篇
  1978年   177篇
  1977年   162篇
  1976年   104篇
  1959年   89篇
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
991.
In this paper, a cold standby repairable system consisting of two dissimilar components and one repairman is studied. When failures occur, the repair of both component 1 and component 2 are not ‘as good as new’. The consecutive operating times of component 1 after repair constitute a decreasing geometric process, while the repair times of component 1 are independent and identically distributed. For component 2, its failure is rectified by minimal repair, and the repair time is negligible. Component 1 has priority in use when both components are good. The replacement policy N is based on the failure number of component 1. Under policy N, we derive the explicit expression of the long-run average cost rate C(N) as well as the average number of repairs of component 2 before the system replaced. The optimal replacement policy N*, which minimises the long-run average cost rate C(N), is obtained theoretically. If the failure rate r(t) of component 2 is increasing, the existence and uniqueness of the optimal policy N* is also proved. Finally, a numerical example is given to validate the developed theoretical model. Some sensitivity analyses are provided to show the influence of some parameters, such as the costs for replacement and repair, and the parameters of the lifetime and repair time distributions of both components, to the optimal replacement policy N* and corresponding average cost rate C(N*).  相似文献   
992.
This paper deals with the leader-follower consensus problem of Lipschitz nonlinear systems under fixed directed communication networks. Both state and output feedback control are proposed based on state and output measurements of neighbouring agents, respectively. Laplacian matrix features are explored for the stability analysis, and the sufficient conditions are derived to solve the consensus problem. Finally, simulation results are included to demonstrate the effectiveness of the output-based consensus controller.  相似文献   
993.
In this paper, we consider finite-time control problems for linear multi-agent systems subject to exogenous constant disturbances and impulses. Some sufficient conditions are obtained to ensure the finite-time boundedness of the multi-agent systems, which could be then reduced to a feasibility problem involving linear matrix inequalities. Numerical examples are given to illustrate the results.  相似文献   
994.
This paper addresses the tracking problem of a class of multi-agent systems under uncertain communication environments which has been modelled by a finite number of constant Laplacian matrices together with their corresponding scheduling functions. Sliding mode control method is applied to solve this nonlinear tracking problem under a time-varying topology. The controller of each tracking agent has been designed by using only its own and neighbours’ information. Sufficient conditions for the existence of a sliding mode control tracking strategy have been provided by the solvability of linear matrix inequalities. At the end of this work, numerical simulations are employed to demonstrate the effectiveness of the proposed sliding mode control tracking strategy.  相似文献   
995.
996.
This paper investigates the influence of goal awareness and IT self-efficacy on job satisfaction based on the motivation sequence model, goal-setting theory, and social cognitive theory. Using a large-scale field survey of healthcare enterprise resource planning (ERP) system users (n?=?352), this study investigates these relationships and provides important insight to healthcare ERP system researchers and managers. Both goal awareness and IT self-efficacy influence positive job satisfaction of healthcare ERP system users, as expected. Furthermore, the influence of goal awareness is stronger when the role of ERP systems is highly perceived for decision-making of the job. There was no interaction effect between goal awareness and IT self-efficacy in the post hoc analysis. The model is significantly supported by the empirical test with the large number of field data from healthcare ERP system users in the healthcare company. Practical and academic implications are discussed in the paper.  相似文献   
997.
Counting independent sets on bipartite graphs (#BIS) is considered a canonical counting problem of intermediate approximation complexity. It is conjectured that #BIS neither has an FPRAS nor is as hard as #Sat to approximate. We study #BIS in the general framework of two-state spin systems on bipartite graphs. We define two notions, nearly-independent phase-correlated spins and unary symmetry breaking. We prove that it is #BIS-hard to approximate the partition function of any 2-spin system on bipartite graphs supporting these two notions. Consequently, we classify the complexity of approximating the partition function of antiferromagnetic 2-spin systems on bounded-degree bipartite graphs.  相似文献   
998.
999.
1000.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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