首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   57971篇
  免费   4807篇
  国内免费   2576篇
电工技术   3590篇
技术理论   3篇
综合类   3960篇
化学工业   9608篇
金属工艺   3345篇
机械仪表   3830篇
建筑科学   4560篇
矿业工程   1824篇
能源动力   1680篇
轻工业   3797篇
水利工程   1041篇
石油天然气   3934篇
武器工业   524篇
无线电   6290篇
一般工业技术   6953篇
冶金工业   2618篇
原子能技术   582篇
自动化技术   7215篇
  2024年   262篇
  2023年   1041篇
  2022年   1772篇
  2021年   2424篇
  2020年   1950篇
  2019年   1574篇
  2018年   1735篇
  2017年   1929篇
  2016年   1669篇
  2015年   2283篇
  2014年   2964篇
  2013年   3302篇
  2012年   3590篇
  2011年   4046篇
  2010年   3502篇
  2009年   3278篇
  2008年   3215篇
  2007年   2975篇
  2006年   3069篇
  2005年   2561篇
  2004年   1839篇
  2003年   1627篇
  2002年   1608篇
  2001年   1390篇
  2000年   1293篇
  1999年   1526篇
  1998年   1286篇
  1997年   1122篇
  1996年   1010篇
  1995年   831篇
  1994年   665篇
  1993年   484篇
  1992年   422篇
  1991年   263篇
  1990年   212篇
  1989年   165篇
  1988年   121篇
  1987年   82篇
  1986年   68篇
  1985年   44篇
  1984年   35篇
  1983年   32篇
  1982年   31篇
  1981年   19篇
  1980年   17篇
  1979年   6篇
  1940年   3篇
  1933年   1篇
  1929年   1篇
  1928年   1篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
911.
In this paper, the short memory principle (SMP) is applied for solving the Abel differential equation with fractional order. We evaluate the approximate solution at the end of required interval, and construct a suitable iteration scheme employing this end point as initial value. Numerical experiments show that our iteration method is simple and efficient, and that a proper length of memory could maintain the validity of the short memory principle.  相似文献   
912.
We have developed a neural-network-based fault diagnosis approach of analog circuits using maximal class separability based kernel principal components analysis (MCSKPCA) as preprocessor. The proposed approach can detect and diagnose faulty components efficiently in the analog circuits by analyzing their time responses. First, using wavelet transform to preprocess the time responses obtains the essential and reduced candidate features of the corresponding response signals. Then, the second preprocessing by MCSKPCA further reduces the dimensionality of candidate features so as to obtain the optimal features with maximal class separability as inputs to the neural networks. This simplifies the architectures reasonably and reduces the computational burden of neural networks drastically. The simulation results show that our resulting diagnostic system can classify the faulty components of analog circuits under test effectively and achieves a competitive classification performance.  相似文献   
913.
Jie Sun  Kai-Yu He  Hui Li 《Knowledge》2011,24(7):1013-1023
Recently, research of financial distress prediction has become increasingly urgent. However, existing static models for financial distress prediction are not able to adapt to the situation that the sample data flows constantly with the lapse of time. Financial distress prediction with static models does not meet the demand of the dynamic nature of business operations. This article explores the theoretical and empirical research of dynamic modeling on financial distress prediction with longitudinal data streams from the view of individual enterprise. Based on enterprise’s longitudinal data streams, dynamic financial distress prediction model is constructed by integrating financial indicator selection by using sequential floating forward selection method, dynamic evaluation of enterprise’s financial situation by using principal component analysis at each longitudinal time point, and dynamic prediction of financial distress by using back-propagation neural network optimized by genetic algorithm. This model’s ex-ante prediction efficiently combines its ex-post evaluation. In empirical study, three listed companies’ half-year longitudinal data streams are used as the sample set. Results of dynamic financial distress prediction show that the longitudinal and dynamic model of enterprise’s financial distress prediction is more effective and feasible than static model.  相似文献   
914.
串口同步采集是工业控制应用的重要环节,为克服由于不准确的数据采集所带来的乘性误差,进而对多串口的同步采集进行了研究。利用VS2005编程环境,设计实现了多串口的上位机数据采集平台,该平台开辟线程对多个串口采取重叠读取方式,实现了对测速系统中大量的串口数据同步读取、保存并实现波形动态显示的功能,满足了智能测速系统的测速算法研究的需要。此平台可以广泛的应用在测速系统之中,也可辅助用于各种工业控制的高级要求。  相似文献   
915.
基于ZigBee的多机器人通信系统的设计   总被引:1,自引:0,他引:1  
为解决多机器人协作的问题,设计了可以让机器人之间基于ZigBee网络进行通信的通信方案。机器人硬件系统中引入了ZigBee节点,多个机器人依赖ZigBee形成一个星型网络,每个机器人可以通过中心节点保持通信。实验结果表明,机器人之间可以可靠地进行通信,能够显著提高机器人的工作效率。  相似文献   
916.
论述了梳理齿条冲齿机的工作原理,控制策略及系统实现,给出了软件编程方法与通信实现.系统采用人机界面和数字通信,实现了冲齿-牵引机构的两轴同步驱动和加工参数的柔性调整.  相似文献   
917.
Purpose : Zilongjin, a complementary Chinese herbal medicine, has been used to alleviate the adverse effects of chemotherapeutic drugs in cancer therapy. However, the mechanisms of anti‐cancer activity of Zilongjin are still largely unkonwn. Experimental design : First, the proteomic approach of combined 2‐DE and ESI‐MS/MS was used to investigate the effect of Zilongjin on the protein expression in MCF‐7 cells. Then, the differential expression of some proteins was confirmed by Western blot, cytoimmunofluoresecnce, and quantitative real‐time RT‐PCR analysis. Results : The identified proteins with differential expression, involved in such events as protein translation, cellular signal transduction, cytoskeleton formation and transportation, include seven downregulating proteins, such as Eukaryotic translation initiation factor 3 subunit I, Eukaryotic translation initiation factor 1A Y‐chromosomal, Ran‐specific GTPase‐activating protein, Ubiquitin‐conjugating enzyme E2 N, Tropomodulin‐3, Macrophage‐capping protein, and Tumor protein D52, as well as two upregulating proteins, HSP β‐1 and keratin18. Moreover, the differential expression of three proteins was confirmed. Conclusions and clinical relevance : (i) These results provide a new insight into the molecular mechanisms of Zilongjin on therapy for breast cancer. (ii) The application of the proteomic approaches will result in the more extended appreciation of Chinese medicine than those known at present.  相似文献   
918.
We give a simple tutorial introduction to the Mathematica package STRINGVACUA, which is designed to find vacua of string-derived or inspired four-dimensional N=1 supergravities. The package uses powerful algebro-geometric methods, as implemented in the free computer algebra system Singular, but requires no knowledge of the mathematics upon which it is based. A series of easy-to-use Mathematica modules are provided which can be used both in string theory and in more general applications requiring fast polynomial computations. The use of these modules is illustrated throughout with simple examples.

Program summary

Program title: STRINGVACUACatalogue identifier: AEBZ_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEBZ_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: GNU GPLNo. of lines in distributed program, including test data, etc.: 31 050No. of bytes in distributed program, including test data, etc.: 163 832Distribution format: tar.gzProgramming language: “Mathematica” syntaxComputer: Home and office spec desktop and laptop machines, networked or stand aloneOperating system: Windows XP (with Cygwin), Linux, Mac OS, running Mathematica V5 or aboveRAM: Varies greatly depending on calculation to be performedClassification: 11.1External routines: Linux: The program “Singular” is called from Mathematica. Windows: “Singular” is called within the Cygwin environment from Mathematica.Nature of problem: A central problem of string-phenomenology is to find stable vacua in the four-dimensional effective theories which result from compactification.Solution method: We present an algorithmic method, which uses techniques of algebraic geometry, to find all of the vacua of any given string-phenomenological system in a huge class.Running time: Varies greatly depending on calculation requested.  相似文献   
919.
In this paper, we study an on-line broadcast scheduling problem with deadlines, in which the requests asking for the same page can be satisfied simultaneously by broadcasting this page, and every request is associated with a release time, deadline and a required page with a unit size. The objective is to maximize the number of requests satisfied by the schedule. In this paper, we focus on an important special case where all the requests have their spans (the difference between release time and deadline) less than 2. We give an optimal online algorithm, i.e., its competitive ratio matches the lower bound of the problem.  相似文献   
920.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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