全文获取类型
收费全文 | 515555篇 |
免费 | 49756篇 |
国内免费 | 30434篇 |
专业分类
电工技术 | 36634篇 |
技术理论 | 75篇 |
综合类 | 62063篇 |
化学工业 | 53685篇 |
金属工艺 | 19453篇 |
机械仪表 | 29527篇 |
建筑科学 | 63267篇 |
矿业工程 | 26122篇 |
能源动力 | 16335篇 |
轻工业 | 29964篇 |
水利工程 | 22846篇 |
石油天然气 | 22077篇 |
武器工业 | 6365篇 |
无线电 | 42794篇 |
一般工业技术 | 37062篇 |
冶金工业 | 25565篇 |
原子能技术 | 4277篇 |
自动化技术 | 97634篇 |
出版年
2024年 | 2233篇 |
2023年 | 6291篇 |
2022年 | 12046篇 |
2021年 | 14697篇 |
2020年 | 15064篇 |
2019年 | 12095篇 |
2018年 | 11540篇 |
2017年 | 14225篇 |
2016年 | 16860篇 |
2015年 | 18834篇 |
2014年 | 32460篇 |
2013年 | 29251篇 |
2012年 | 36617篇 |
2011年 | 39310篇 |
2010年 | 30564篇 |
2009年 | 31409篇 |
2008年 | 29823篇 |
2007年 | 36762篇 |
2006年 | 33429篇 |
2005年 | 29027篇 |
2004年 | 24308篇 |
2003年 | 21352篇 |
2002年 | 17287篇 |
2001年 | 14430篇 |
2000年 | 12177篇 |
1999年 | 9773篇 |
1998年 | 7317篇 |
1997年 | 6357篇 |
1996年 | 5517篇 |
1995年 | 4573篇 |
1994年 | 4029篇 |
1993年 | 2978篇 |
1992年 | 2587篇 |
1991年 | 1844篇 |
1990年 | 1654篇 |
1989年 | 1451篇 |
1988年 | 1061篇 |
1987年 | 714篇 |
1986年 | 579篇 |
1985年 | 531篇 |
1984年 | 461篇 |
1983年 | 366篇 |
1982年 | 293篇 |
1981年 | 237篇 |
1980年 | 211篇 |
1979年 | 148篇 |
1978年 | 94篇 |
1977年 | 97篇 |
1976年 | 74篇 |
1975年 | 78篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
鲁宏伟 《计算机工程与应用》2001,(2)
UDP是互联网上多媒体数据传输采用的主要传输协议。其主要特点是网络开销低但传输不可靠,易产生包丢失或失序。为了对失序数据包进行重排序,应用程序需要预留一个适当的缓冲区以存储期望包到达之前的数据包。该文分析了数据包丢失或失序情况下,缓冲区大小对系统性能的影响,给出了缓冲区大小的一个估计值,并对失序或数据包丢失情况下数据处理的策略进行了讨论。 相似文献
992.
993.
蒙古文整词计算机生成理论研究 总被引:1,自引:0,他引:1
采用面向对象方法,模拟传统蒙古文整词各种形式构成机理,提出了几种蒙古语整词计算机生成数据模型。文章主要依据整词计算机生成三种模型,探讨了传统蒙古文整词计算机最优化生成理论所涉及的精确度、时间复杂度、空间复杂度三项基本要素以及最优化生成必须考虑的整词复杂特征载荷与一体化合一计算知识表示方法和计算结构,证明了“B - J - T= W”数据模型是传统蒙古文整词计算与生成最优化对象模型。 相似文献
994.
995.
996.
An Internet-based negotiation server for e-commerce 总被引:6,自引:0,他引:6
Stanley Y.W. Su Chunbo Huang Joachim Hammer Yihua Huang Haifei Li Liu Wang Youzhong Liu Charnyote Pluempitiwiriyawej Minsoo Lee Herman Lam 《The VLDB Journal The International Journal on Very Large Data Bases》2001,10(1):72-90
This paper describes the design and implementation of a replicable, Internet-based negotiation server for conducting bargaining-type
negotiations between enterprises involved in e-commerce and e-business. Enterprises can be buyers and sellers of products/services
or participants of a complex supply chain engaged in purchasing, planning, and scheduling. Multiple copies of our server can
be installed to complement the services of Web servers. Each enterprise can install or select a trusted negotiation server
to represent his/her interests. Web-based GUI tools are used during the build-time registration process to specify the requirements,
constraints, and rules that represent negotiation policies and strategies, preference scoring of different data conditions,
and aggregation methods for deriving a global cost-benefit score for the item(s) under negotiation. The registration information
is used by the negotiation servers to automatically conduct bargaining type negotiations on behalf of their clients. In this
paper, we present the architecture of our implementation as well as a framework for automated negotiations, and describe a
number of communication primitives which are used in the underlying negotiation protocol. A constraint satisfaction processor
(CSP) is used to evaluate a negotiation proposal or counterproposal against the registered requirements and constraints of
a client company. In case of a constraint violation, an event is posted to trigger the execution of negotiation strategic
rules, which either automatically relax the violated constraint, ask for human intervention, invoke an application, or perform
other remedial operations. An Event-Trigger-Rule (ETR) server is used to manage events, triggers, and rules. Negotiation strategic
rules can be added or modified at run-time. A cost-benefit analysis component is used to perform quantitative analysis of
alternatives. The use of negotiation servers to conduct automated negotiation has been demonstrated in the context of an integrated
supply chain scenario.
Received: 30 October 2000 / Accepted: 12 January 2001 Published online: 2 August 2001 相似文献
997.
Evolving Teams of Predictors with Linear Genetic Programming 总被引:1,自引:0,他引:1
This paper applies the evolution of GP teams to different classification and regression problems and compares different methods for combining the outputs of the team programs. These include hybrid approaches where (1) a neural network is used to optimize the weights of programs in a team for a common decision and (2) a realnumbered vector (the representation of evolution strategies) of weights is evolved with each term in parallel. The cooperative team approach results in an improved training and generalization performance compared to the standard GP method. The higher computational overhead of team evolution is counteracted by using a fast variant of linear GP. 相似文献
998.
Comparison of image reconstruction by using near‐field and far‐field data for an imperfect conductor
Image reconstruction by using near‐field and far‐field data for an imperfectly conducting cylinder is investigated. A conducting cylinder of unknown shape and conductivity scatters the incident wave in free space and the scattered near and far fields are measured. By using measured fields, the imaging problem is reformulated into an optimization problem and solved by the genetic algorithm. Numerical results show that the convergence speed and final reconstructed results by using near‐field data are better than those obtained by using far‐field data. This work provides both comparative and quantitative information. © 2001 John Wiley & Sons, Inc. Int J RF and Microwave CAE 11: 69–73, 2001. 相似文献
999.
基于资源优化的QoS路径选择模糊算法 总被引:6,自引:0,他引:6
文中讨论了在IP网络中支持QoS路径时优化网络资源的模糊方法,对QoS路径选择中出现的多目标路径费用函数进行了合理的描述。该方法综合考虑了径路中的带宽、时延和路径条数,从初选出来的若干条路径中选择更安全,又节约网络资源的路径。仿真结果表明,模糊算法既兼容普通方法,又比普通方法更合理。同时,模糊方法计算简单迅速,用VLSI(very large scale integration)硬件很容易实现。 相似文献
1000.