首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   6516篇
  免费   74篇
  国内免费   1篇
电工技术   36篇
综合类   2篇
化学工业   498篇
金属工艺   28篇
机械仪表   45篇
建筑科学   144篇
矿业工程   4篇
能源动力   68篇
轻工业   278篇
水利工程   18篇
石油天然气   8篇
无线电   358篇
一般工业技术   435篇
冶金工业   4340篇
原子能技术   40篇
自动化技术   289篇
  2021年   30篇
  2019年   27篇
  2018年   30篇
  2017年   37篇
  2016年   35篇
  2015年   29篇
  2014年   50篇
  2013年   103篇
  2012年   64篇
  2011年   104篇
  2010年   72篇
  2009年   83篇
  2008年   86篇
  2007年   100篇
  2006年   96篇
  2005年   79篇
  2004年   59篇
  2003年   63篇
  2002年   52篇
  2001年   59篇
  2000年   57篇
  1999年   192篇
  1998年   1431篇
  1997年   773篇
  1996年   543篇
  1995年   290篇
  1994年   268篇
  1993年   247篇
  1992年   82篇
  1991年   78篇
  1990年   94篇
  1989年   91篇
  1988年   83篇
  1987年   71篇
  1986年   71篇
  1985年   85篇
  1984年   43篇
  1983年   47篇
  1982年   37篇
  1981年   39篇
  1980年   51篇
  1979年   32篇
  1978年   35篇
  1977年   97篇
  1976年   194篇
  1975年   35篇
  1974年   35篇
  1973年   28篇
  1971年   32篇
  1970年   24篇
排序方式: 共有6591条查询结果,搜索用时 15 毫秒
1.
The problem of designing fibre-optic networks for local-access telecommunications generates (at least) three non-trivial subproblems. In the first of these subproblems one must determine how many fibre-optic cables (fibres) are required at either end of a street. In the next subproblem a minimum-cost network must be designed to support the fibres. The network must also provide distinct paths from either end of the street to the central exchange(s). Finally, the fibre-optic cables must be placed in protective covers. These covers are available in a number of different sizes, allowing some flexibility when covering each section of the network. In this paper we describe a dynamic programming (DP) formulation for finding a minimum-cost (protective) covering for the network (the third of the subproblems). This problem is a generalised set covering problem with side constraints and is further complicated by the introduction of fixed and variable welding costs. The DP formulation selects covers along each arc (in the network), but cannot exactly model the fixed costs and so does not guarantee optimality. We also describe an integer programming (IP) formulation for assessing the quality of the DP solutions. The cost of the networks constructed by the IP model is less than those designed using the DP model, but the saving is not significant for the problems examined (less than 0.1%). This indicates that the DP model will generally give very good solutions. Furthermore, as the problem dimensions grow, DP gives significantly better solution times than IP.  相似文献   
2.
Life is pleasant--and memory helps to keep it that way!   总被引:1,自引:0,他引:1  
People's recollections of the past are often positively biased. This bias has 2 causes. The 1st cause lies in people's perceptions of events. The authors review the results of several studies and present several new comparative analyses of these studies, all of which indicate that people perceive events in their lives to more often be pleasant than unpleasant. A 2nd cause is the fading affect bias: The affect associated with unpleasant events fades faster than the affect associated with pleasant events. The authors review the results of several studies documenting this bias and present evidence indicating that dysphoria (mild depression) disrupts such bias. Taken together, this evidence suggests that autobiographical memory represents an important exception to the theoretical claim that bad is stronger than good. (PsycINFO Database Record (c) 2010 APA, all rights reserved)  相似文献   
3.
This paper focuses on a class of robot manipulators termed "continuum" robots - robots that exhibit behavior similar to tentacles, trunks, and snakes. In previous work, we studied details of the mechanical design, kinematics, path-planning and small-deflection dynamics for continuum robots such as the Clemson "tentacle manipulator". In this paper, we discuss the dynamics of a planar continuum backbone section, incorporating a large-deflection dynamic model. Based on these dynamics, we formulate a vibration-damping setpoint controller, and include experimental results to illustrate the efficacy of the proposed controller.  相似文献   
4.
5.
Antibiotic treatment options for Burkholderia cepacia infection are limited because of high intrinsic resistance. The problem is complicated by development of cross-resistance between antibiotics of different classes. We isolated antibiotic-resistant mutants by stepwise exposure to chloramphenicol (Chlor) and to trimethoprim/sulphamethoxazole (T/S) for four B. cepacia strains: ATCC13945, Per (clinical isolate), Cas and D4 (environmental isolates). Chlor(r) mutants did not produce chloramphenicol acetyl-transferase. Cross-resistance, defined as greater than four-fold increase in MIC by microtitre dilution method, was consistently seen in both types of mutants. For chloramphenicol-resistant (Chlor[r]) and trimethoprim/sulphamethoxazole-resistant (Tr/Sr) mutants of B. cepacia ATCC13945 and Cas, no MIC change was seen for piperacillin, ceftazidime, rifampicin, gentamicin, tobramycin, polymyxin B or azithromycin. B. cepacia-Per and -D4 mutants showed cross-resistance to ceftazidime and to piperacillin. Comparison of outer membrane protein (OMP) profiles of B. cepacia and their mutants by SDS-PAGE revealed Tr/Sr) mutants to be deficient in a major OMP (molecular weight 39-47 kDa). Tr/Sr mutants also expressed additional OMPs not found in wild type strains at 75-77 kDa for B. cepacia-ATCC13945 and -Cas, and 20-21 kDa in B. cepacia-D4 and -Per. No OMP changes occurred in Chlor(r) mutants. Lipopolysaccharide (LPS) profiles of each type of mutant showed new high and low molecular weight LPS bands. Cross-resistance seems to be mediated by alterations in porin and LPS for Tr/Sr mutants, but only by LPS in Chlor(r) mutants.  相似文献   
6.
Vertical phoria (vertical vergence in the absence of binocular feedback) can be trained to vary with non-visual cues such as vertical conjugate eye position, horizontal conjugate eye position and horizontal vergence. These prior studies demonstrated a low-level association or coupling between vertical vergence and several oculomotor cues. As a test of the potential independence of multiple eye-position cues for vertical vergence, context-specific adaptation experiments were conducted in three orthogonal adapting planes (midsagittal, frontoparallel, and transverse). Four vertical disparities in each of these planes were associated with various combinations of two specific components of eye position. Vertical disparities in the plane were associated with horizontal vergence and vertical conjugate eye position; vertical disparities in the frontoparallel plane were associated with horizontal and vertical conjugate eye position; and vertical disparities in the transverse plane were associated with horizontal vergence and horizontal conjugate eye position. The results demonstrate that vertical vergence can be adapted to respond to specific combinations of two different sources of eye-position information. The results are modeled with an association matrix whose inputs are two classes of eye position and whose weighted output is vertical vergence.  相似文献   
7.
8.
9.
K-winner networks.   总被引:2,自引:0,他引:2  
A special class of mutually inhibitory networks is analyzed, and parameters for reliable K-winner performance are presented. The network dynamics are modeled using interactive activation, and results are compared with the sigmoid model. For equal external inputs, network parameters that select the units with the larger initial activations (the network converges to the nearest stable state) are derived. Conversely, for equal initial activations, networks that select the units with larger external inputs (the network converges to the lowest energy stable state) are derived. When initial activations are mixed with external inputs, anomalous behavior results. These discrepancies are analyzed with several examples. Restrictions on initial states are derived which ensure accurate K-winner performance when unequal external inputs are used.  相似文献   
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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