首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5527篇
  免费   307篇
  国内免费   36篇
电工技术   73篇
综合类   67篇
化学工业   1267篇
金属工艺   209篇
机械仪表   207篇
建筑科学   272篇
矿业工程   48篇
能源动力   398篇
轻工业   829篇
水利工程   28篇
石油天然气   51篇
武器工业   2篇
无线电   277篇
一般工业技术   900篇
冶金工业   383篇
原子能技术   58篇
自动化技术   801篇
  2024年   29篇
  2023年   62篇
  2022年   121篇
  2021年   193篇
  2020年   194篇
  2019年   169篇
  2018年   267篇
  2017年   235篇
  2016年   278篇
  2015年   172篇
  2014年   269篇
  2013年   634篇
  2012年   275篇
  2011年   318篇
  2010年   306篇
  2009年   311篇
  2008年   256篇
  2007年   243篇
  2006年   165篇
  2005年   104篇
  2004年   125篇
  2003年   126篇
  2002年   183篇
  2001年   134篇
  2000年   77篇
  1999年   64篇
  1998年   139篇
  1997年   73篇
  1996年   62篇
  1995年   33篇
  1994年   30篇
  1993年   18篇
  1992年   14篇
  1991年   18篇
  1990年   14篇
  1989年   10篇
  1988年   7篇
  1987年   11篇
  1986年   11篇
  1985年   18篇
  1984年   16篇
  1983年   14篇
  1982年   8篇
  1981年   15篇
  1980年   9篇
  1979年   4篇
  1978年   6篇
  1976年   9篇
  1974年   5篇
  1973年   5篇
排序方式: 共有5870条查询结果,搜索用时 9 毫秒
931.
932.
Clustering is an important problem in malware research, as the number of malicious samples that appear every day makes manual analysis impractical. Although these samples belong to a limited number of malware families, it is difficult to categorize them automatically as obfuscation is involved. By extracting relevant features we can apply clustering algorithms, then only analyze a couple of representatives from each cluster. However, classic clustering algorithms that compute the similarity between each pair of samples are slow when a large collection is involved. In this paper, the features will be strings of operation codes extracted from the binary code of each sample. With a modified suffix tree data structure we can find long enough substrings that correspond to portions of a program’s code. These substrings must be filtered against a database of known substrings so that common library code will be ignored. The items that have common substrings above a certain threshold will be grouped into the same cluster. Our algorithm was tested with data extracted from real-world malware and constructed quality clusters.  相似文献   
933.
Abstract

Objective: Orally disintegrating tablets (ODTs) recently have gained much attention to fulfill the needs for pediatric, geriatric, and psychiatric patients with dysphagia. Aim of this study was to develop new ODT formulations containing mirtazapine, an antidepressant drug molecule having bitter taste, by using simple and inexpensive preparation methods such as coacervation, direct compression and to compare their characteristics with those of reference product (Remereon SolTab).

Materials and methods: Coacervation method was chosen for taste masking of mirtazapine. In vitro characterization studies such as diameter and thickness, weight variation, tablet hardness, tablet friability and disintegration time were performed on tablet formulations. Wetting time and in vitro dissolution tests of developed ODTs also studied using 900?mL 0.1?N HCl medium, 900?mL pH 6.8 phosphate buffer or 900?mL pH 4.5 acetate buffer at 37?±?0.2?°C as dissolution medium.

Results: Ratio of Eudragit® E-100 was chosen as 6% (w/w) since the dissolution profile of A1 (6% Eudragit® E-100) was found closer to the reference product than A2 (4% Eudragit® E-100) and A3 (8% Eudragit® E-100). Group D, E and F formulations were presented better results in terms of disintegration time. Dissolution results indicated that Group E and F formulations showed optimum properties in all three dissolution media.

Discussion: Formulations D1, D4, D5, E3, E4, F1 and F5 found suitable as ODT formulations due to their favorable disintegration times and dissolution profiles.

Conclusion: Developed mirtazapine ODTs were found promising in terms of showing the similar characteristics to the original formulation.  相似文献   
934.
935.
936.
体数据的分类用于确定体素的可见性,在三维体绘制中起着重要的作用。提出一种基于熵的体数据分类算法。首先根据累计直方图将体数据的直方图进行分段,然后根据熵判别式在每个分段中计算一个阈值作为阻光度传递函数的分段点,再根据阻光度传递函数计算出体素的阻光度值,完成体数据的分类。以工业CT体数据为对象进行实验,其结果表明,所提出的算法较好地实现了体数据的分类,体绘制结果清晰,且能够实现试件的模拟拆卸。  相似文献   
937.
基于多用户多输入多输出(MIMO)有限反馈系统提出了一种收发联合波束成形方法。该方法在发送端采用每个用户酉速率控制(PU2RC)波束成形技术,在接收端采用基于信干噪比(SINR)最大化的天线合并算法。天线合并算法利用用户SINR的广义Rayleigh熵特性寻找最佳的天线合并矢量。仿真结果表明,该方法能充分利用信道信息,不仅改善了传统PU2RC系统的和速率性能,相对于已有的迫零(ZF)联合波束成形方法,对信道状态信息的量化误差的敏感性更低,用户选择算法的复杂度更低,且低速率反馈条件下和速率性能更优。  相似文献   
938.
The use of optimization techniques in production control is discussed. Two optimization problems in relation to typical process industry complexes are formulated. A modified version of Tamura's algorithm is reviewed. The promising performance of the computerised algorithms is illustrated by numerical results. DISPATCHER, a practical operative decision support system, is described.  相似文献   
939.
The Journal of Supercomputing - Deep learning algorithms have yielded remarkable results in medical diagnosis and image analysis, besides their contribution to improvements in a number of fields...  相似文献   
940.
Absorptive capability appears to be an appealing concept in the technology and innovation management literature. Though absorptive capability attracts researchers from a variety of disciplines, team‐level empirical research on it is scant. In this study, we operationalized team absorptive capability as a multidimensional construct involving knowledge acquisition, assimilation and exploitation. This study also explores the moderating effect of project complexity between team absorptive capability and new product success. In studying the data from 239 new product development projects using partial least squares structural equation modelling, we found that team functional diversity is a significant determinant of team absorptive capability. Moreover, regarding the relationships between team absorptive capability and new product success, we uncovered that (i) new product success is dependent on the ability to understand the acquired knowledge, and (ii) the teams appear to be more cautious in putting the assimilated knowledge into practice to the extent that project complexity increases.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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