首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   49006篇
  免费   6654篇
  国内免费   4487篇
电工技术   4940篇
综合类   5541篇
化学工业   4155篇
金属工艺   1141篇
机械仪表   2587篇
建筑科学   2970篇
矿业工程   1088篇
能源动力   1259篇
轻工业   2122篇
水利工程   1070篇
石油天然气   1770篇
武器工业   769篇
无线电   6930篇
一般工业技术   4901篇
冶金工业   1708篇
原子能技术   670篇
自动化技术   16526篇
  2024年   248篇
  2023年   674篇
  2022年   1240篇
  2021年   1444篇
  2020年   1806篇
  2019年   1751篇
  2018年   1538篇
  2017年   2004篇
  2016年   2224篇
  2015年   2291篇
  2014年   3123篇
  2013年   3685篇
  2012年   3539篇
  2011年   3738篇
  2010年   2767篇
  2009年   2960篇
  2008年   2936篇
  2007年   3332篇
  2006年   3014篇
  2005年   2493篇
  2004年   2048篇
  2003年   1897篇
  2002年   1584篇
  2001年   1405篇
  2000年   1205篇
  1999年   900篇
  1998年   728篇
  1997年   643篇
  1996年   484篇
  1995年   428篇
  1994年   348篇
  1993年   294篇
  1992年   224篇
  1991年   204篇
  1990年   147篇
  1989年   134篇
  1988年   89篇
  1987年   79篇
  1986年   55篇
  1985年   64篇
  1984年   53篇
  1983年   36篇
  1982年   39篇
  1981年   42篇
  1980年   30篇
  1979年   24篇
  1978年   14篇
  1977年   18篇
  1964年   12篇
  1956年   11篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
1.
This paper presents an innovative solution to model distributed adaptive systems in biomedical environments. We present an original TCBR-HMM (Text Case Based Reasoning-Hidden Markov Model) for biomedical text classification based on document content. The main goal is to propose a more effective classifier than current methods in this environment where the model needs to be adapted to new documents in an iterative learning frame. To demonstrate its achievement, we include a set of experiments, which have been performed on OSHUMED corpus. Our classifier is compared with Naive Bayes and SVM techniques, commonly used in text classification tasks. The results suggest that the TCBR-HMM Model is indeed more suitable for document classification. The model is empirically and statistically comparable to the SVM classifier and outperforms it in terms of time efficiency.  相似文献   
2.
The architectural choices underlying Linked Data have led to a compendium of data sources which contain both duplicated and fragmented information on a large number of domains. One way to enable non-experts users to access this data compendium is to provide keyword search frameworks that can capitalize on the inherent characteristics of Linked Data. Developing such systems is challenging for three main reasons. First, resources across different datasets or even within the same dataset can be homonyms. Second, different datasets employ heterogeneous schemas and each one may only contain a part of the answer for a certain user query. Finally, constructing a federated formal query from keywords across different datasets requires exploiting links between the different datasets on both the schema and instance levels. We present Sina, a scalable keyword search system that can answer user queries by transforming user-supplied keywords or natural-languages queries into conjunctive SPARQL queries over a set of interlinked data sources. Sina uses a hidden Markov model to determine the most suitable resources for a user-supplied query from different datasets. Moreover, our framework is able to construct federated queries by using the disambiguated resources and leveraging the link structure underlying the datasets to query. We evaluate Sina over three different datasets. We can answer 25 queries from the QALD-1 correctly. Moreover, we perform as well as the best question answering system from the QALD-3 competition by answering 32 questions correctly while also being able to answer queries on distributed sources. We study the runtime of SINA in its mono-core and parallel implementations and draw preliminary conclusions on the scalability of keyword search on Linked Data.  相似文献   
3.
Computer-Supported Collaborative Learning (CSCL) is concerned with how Information and Communication Technology (ICT) might facilitate learning in groups which can be co-located or distributed over a network of computers such as Internet. CSCL supports effective learning by means of communication of ideas and information among learners, collaborative access of essential documents, and feedback from instructors and peers on learning activities. As the cloud technologies are increasingly becoming popular and collaborative learning is evolving, new directions for development of collaborative learning tools deployed on cloud are proposed. Development of such learning tools requires access to substantial data stored in the cloud. Ensuring efficient access to such data is hindered by the high latencies of wide-area networks underlying the cloud infrastructures. To improve learners’ experience by accelerating data access, important files can be replicated so a group of learners can access data from nearby locations. Since a cloud environment is highly dynamic, resource availability, network latency, and learner requests may change. In this paper, we present the advantages of collaborative learning and focus on the importance of data replication in the design of such a dynamic cloud-based system that a collaborative learning portal uses. To this end, we introduce a highly distributed replication technique that determines optimal data locations to improve access performance by minimizing replication overhead (access and update). The problem is formulated using dynamic programming. Experimental results demonstrate the usefulness of the proposed collaborative learning system used by institutions in geographically distributed locations.  相似文献   
4.
We study a two-agent scheduling problem in a two-machine permutation flowshop with learning effects. The objective is to minimize the total completion time of the jobs from one agent, given that the maximum tardiness of the jobs from the other agent cannot exceed a bound. We provide a branch-and-bound algorithm for the problem. In addition, we present several genetic algorithms to obtain near-optimal solutions. Computational results indicate that the algorithms perform well in either solving the problem or efficiently generating near-optimal solutions.  相似文献   
5.
It is the aim of this paper to examine the effects of conditioning time on the flotation of hematite using three technical grade fatty acid reagents as providing additional evidence on their mechanism of interaction with the hematite surface. Various mechanisms have been postulated as occurring as conditioning time is increased. Both physical (e.g. conditioning time and power input) and chemical (nature, dispersion and solubility of the adsorbing species) contribute to the mechanisms of attachment of collector. In this paper, the mechanism of attachment of oleate to hematite can be readily explained by chemisorption, but the mechanism of attachment of lauric acid appears to be physical adsorption at neutral pH. The flotation of hematite with a mixture of tallow-type fatty acids (palmitic, stearic and oleic acids) is very sensitive to conditioning time, and suggests that, even though flotation is very effective at short conditioning times, it is very susceptible to the presence of fines and their associated high surface areas. It is therefore obvious that both the physical and chemical conditions contribute to the mechanisms of adsorption of fatty acids on iron-containing oxide minerals and must be understood in order to optimise the flotation of these minerals in an industrial situation.  相似文献   
6.
Many models of spoken word recognition posit the existence of lexical and sublexical representations, with excitatory and inhibitory mechanisms used to affect the activation levels of such representations. Bottom-up evidence provides excitatory input, and inhibition from phonetically similar representations leads to lexical competition. In such a system, long words should produce stronger lexical activation than short words, for 2 reasons: Long words provide more bottom-up evidence than short words, and short words are subject to greater inhibition due to the existence of more similar words. Four experiments provide evidence for this view. In addition, reaction-time-based partitioning of the data shows that long words generate greater activation that is available both earlier and for a longer time than is the case for short words. As a result, lexical influences on phoneme identification are extremely robust for long words but are quite fragile and condition-dependent for short words. Models of word recognition must consider words of all lengths to capture the true dynamics of lexical activation. (PsycINFO Database Record (c) 2010 APA, all rights reserved)  相似文献   
7.
基于承包商预期收益不变的不平衡报价模型   总被引:1,自引:0,他引:1  
在招标实践中,通常采用最低价中标原则,使得投标人不得不压低其投标价格。基于承包商预期收益不变的不平衡报价模型,是在“工程量清单报价”的条件下,考虑到施工中工程量的变化及施工顺序的影响,体现了资金的时间价值,在保持承包商预期收益不变的前提下,通过调整各分项工程的单价,来降低工程报价,以增加中标机会而建立的。所建立的模型简单,易于操作,并配以具体的工程实例,通过计算机求得其最优解,可供承包商投标报价时参考。  相似文献   
8.
针对不同地质目标的叠前时间偏移成像解释评价   总被引:3,自引:0,他引:3  
凌云  高军  孙德胜  林吉祥 《石油物探》2006,45(3):217-229
随着计算机硬件和地震勘探成像技术的发展,叠前时间偏移正逐步替代常规的NMO加DMO加叠后时间偏移成为地震数据成像处理方法的主流。但对于不同的地质目标,叠前时间偏移的成像效果是否优于常规NMO加DMO加叠后时间偏移的成像效果呢?为此,从地震数据成像处理方法、处理流程和处理参数等方面进行了讨论,并基于某地区三维数据常规处理结果和叠前时间偏移处理结果,针对不同地质目标进行了剖析与评价。认为:叠前时间偏移成像的垂向分辨率较常规处理明显降低,但对于空间波阻抗变化明显的河流和断层,叠前时间偏移成像的空间分辨率要高于常规处理;对于小于1/4波长的叠置薄储层,叠前时间偏移成像的垂向和空间分辨率低于常规处理结果。  相似文献   
9.
3G Wideband CDMA systems adopt the Orthogonal Variable Spreading Factor code tree as the channelization codes management for achieving high data rate transmission in personal multimedia communications. It assigns a single channelization code for each accepted connection. Nevertheless, it wastes the system capacity when the required rate is not powers of two of the basic rate. One good solution is to assign multiple codes for each accepted connection but it causes two inevitable drawbacks: long handoff delay and new call setup delay due to high complexity of processing with multiple channelization codes, and high cost of using more number of rake combiners. Especially, long handoff delay may result in more call dropping probability and higher Grade of Service, which will degrade significantly the utilization and revenue of the 3G cellular systems. Therefore, we propose herein an adaptive efficient codes determination algorithm based on the Markov Decision Process analysis approach to reduce the waste rate and reassignments significantly while providing fast handoff. Numerical results demonstrate that the proposed approach yields several advantages, including the lowest GOS, the least waste rate, and the least number of reassignments. Meanwhile, the optimal number of rake combiners is also analyzed in this paper. This research was supported in part by the National Science Council of Taiwan, ROC, under contract NSC-93-2213-E-324-018.  相似文献   
10.
涡轮搅拌桨反应器混合过程的数值计算   总被引:1,自引:1,他引:0  
利用CFD方法计算单层涡轮反应器搅拌槽内流体混合过程的速度场和浓度场,研究物料在搅拌槽内的混合过程,以及不同监测点对混合时间的影响。结果表明,搅拌槽内物料的混合主要受槽内流体的流动形式所影响;混合时间的长短与监测点位置有关;在搅拌桨的桨叶附近进行监测所得到的混合时间较短,在液面附近进行监测所得的混合时间较长。在实际生产和试验中,应注意对监测点位置的选取。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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