首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   42409篇
  免费   5365篇
  国内免费   3343篇
电工技术   4123篇
技术理论   1篇
综合类   4459篇
化学工业   3822篇
金属工艺   1047篇
机械仪表   2116篇
建筑科学   2644篇
矿业工程   936篇
能源动力   1101篇
轻工业   2021篇
水利工程   875篇
石油天然气   1645篇
武器工业   648篇
无线电   5955篇
一般工业技术   3918篇
冶金工业   1667篇
原子能技术   579篇
自动化技术   13560篇
  2024年   204篇
  2023年   535篇
  2022年   1025篇
  2021年   1178篇
  2020年   1483篇
  2019年   1424篇
  2018年   1258篇
  2017年   1647篇
  2016年   1829篇
  2015年   1898篇
  2014年   2594篇
  2013年   3032篇
  2012年   2966篇
  2011年   3176篇
  2010年   2323篇
  2009年   2518篇
  2008年   2434篇
  2007年   2825篇
  2006年   2613篇
  2005年   2165篇
  2004年   1790篇
  2003年   1676篇
  2002年   1437篇
  2001年   1253篇
  2000年   1059篇
  1999年   808篇
  1998年   658篇
  1997年   553篇
  1996年   441篇
  1995年   370篇
  1994年   318篇
  1993年   254篇
  1992年   188篇
  1991年   179篇
  1990年   127篇
  1989年   103篇
  1988年   79篇
  1987年   74篇
  1986年   53篇
  1985年   72篇
  1984年   61篇
  1983年   50篇
  1982年   55篇
  1981年   47篇
  1980年   46篇
  1979年   50篇
  1978年   22篇
  1977年   17篇
  1976年   14篇
  1964年   17篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
Private information retrieval(PIR) is an important privacy protection issue of secure multi-party computation, but the PIR protocols based on classical cryptography are vulnerable because of new technologies,such as quantum computing and cloud computing. The quantum private queries(QPQ) protocols available, however, has a high complexity and is inefficient in the face of large database. This paper, based on the QKD technology which is mature now, proposes a novel QPQ protocol utilizing the key dilution and auxiliary parameter. Only N quits are required to be sent in the quantum channel to generate the raw key, then the straight k bits in the raw key are added bitwise to dilute the raw key, and a final key is consequently obtained to encrypt the database. By flexible adjusting of auxiliary parameters θ and k, privacy is secured and the query success ratio is improved. Feasibility and performance analyses indicate that the protocol has a high success ratio in first-trial query and is easy to implement, and that the communication complexity of O(N) is achieved.  相似文献   
2.
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.  相似文献   
3.
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.  相似文献   
4.
The pharmacy service requires that some pharmacies are always available and shifts have to be organized: a shift corresponds to a subset of pharmacies that must be open 24 hours a day on a particular week. Under the requirement that each pharmacy belongs to exactly one shift and the assumption that users minimize the distance to the closest open pharmacy during each shift, we want to determine a partition of the pharmacies into a given number of shifts, such that the total distance covered by users is minimized. It may be also required that shift cardinalities are balanced. We discuss different versions and the related computational complexity, showing that the problem is NP-hard in general. A set packing formulation is presented and solved by branch-and-price, together with a fast solution technique based on a tabu search. They have been applied to real and random instances showing that (i) the set packing formulation is very tight and often exhibits no integrality gap; (ii) the branch-and-price solves problems of practical relevance to optimality in a reasonable amount of time (order of minutes); (iii) the tabu search finds optimal or near-optimal solutions in order of seconds.  相似文献   
5.
针对目前量子私有信息检索不能适用与云存储的多数据库问题,基于现在成熟的量子密钥分发方法,提出了一种适合在多数据库环境下,实用的量子私有信息检索协议。对于不同大小的数据库,协议可通过调节参数θ和k,在保证数据库安全及用户隐私的情况下,完成信息的检索。性能分析结果表明,协议的通信复杂度低,检索成功率高、易于实施。  相似文献   
6.
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.  相似文献   
7.
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)  相似文献   
8.
基于承包商预期收益不变的不平衡报价模型   总被引:1,自引:0,他引:1  
在招标实践中,通常采用最低价中标原则,使得投标人不得不压低其投标价格。基于承包商预期收益不变的不平衡报价模型,是在“工程量清单报价”的条件下,考虑到施工中工程量的变化及施工顺序的影响,体现了资金的时间价值,在保持承包商预期收益不变的前提下,通过调整各分项工程的单价,来降低工程报价,以增加中标机会而建立的。所建立的模型简单,易于操作,并配以具体的工程实例,通过计算机求得其最优解,可供承包商投标报价时参考。  相似文献   
9.
为使异构分层无线网络能服务更多的移动用户,提出了一种基于逗留时间的动态流量均衡算法.该算法首先根据用户移动模型计算其在小区内的逗留时间,然后基于小区呼叫到达率和重叠覆盖小区的流量状态来确定一个周期内呼叫转移的数量,最后依据逗留时间门限值将重负载小区中满足条件的呼叫转移到轻负载的重叠覆盖小区中.为降低切换呼叫掉线率,还对异构网间的呼叫切换策略做了改进.仿真实验结果表明,本算法在新呼叫阻塞率和切换呼叫掉线率等性能指标上比传统方法有显著的提高.  相似文献   
10.
针对不同地质目标的叠前时间偏移成像解释评价   总被引:3,自引:0,他引:3  
凌云  高军  孙德胜  林吉祥 《石油物探》2006,45(3):217-229
随着计算机硬件和地震勘探成像技术的发展,叠前时间偏移正逐步替代常规的NMO加DMO加叠后时间偏移成为地震数据成像处理方法的主流。但对于不同的地质目标,叠前时间偏移的成像效果是否优于常规NMO加DMO加叠后时间偏移的成像效果呢?为此,从地震数据成像处理方法、处理流程和处理参数等方面进行了讨论,并基于某地区三维数据常规处理结果和叠前时间偏移处理结果,针对不同地质目标进行了剖析与评价。认为:叠前时间偏移成像的垂向分辨率较常规处理明显降低,但对于空间波阻抗变化明显的河流和断层,叠前时间偏移成像的空间分辨率要高于常规处理;对于小于1/4波长的叠置薄储层,叠前时间偏移成像的垂向和空间分辨率低于常规处理结果。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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