全文获取类型
收费全文 | 42803篇 |
免费 | 3148篇 |
国内免费 | 2560篇 |
专业分类
电工技术 | 2147篇 |
技术理论 | 3篇 |
综合类 | 3315篇 |
化学工业 | 3672篇 |
金属工艺 | 2223篇 |
机械仪表 | 3092篇 |
建筑科学 | 2533篇 |
矿业工程 | 918篇 |
能源动力 | 1041篇 |
轻工业 | 4428篇 |
水利工程 | 570篇 |
石油天然气 | 1249篇 |
武器工业 | 409篇 |
无线电 | 4821篇 |
一般工业技术 | 3344篇 |
冶金工业 | 1891篇 |
原子能技术 | 225篇 |
自动化技术 | 12630篇 |
出版年
2024年 | 174篇 |
2023年 | 548篇 |
2022年 | 923篇 |
2021年 | 1063篇 |
2020年 | 1272篇 |
2019年 | 1037篇 |
2018年 | 1084篇 |
2017年 | 1237篇 |
2016年 | 1260篇 |
2015年 | 1547篇 |
2014年 | 2424篇 |
2013年 | 2594篇 |
2012年 | 2801篇 |
2011年 | 3262篇 |
2010年 | 2429篇 |
2009年 | 2642篇 |
2008年 | 2712篇 |
2007年 | 3057篇 |
2006年 | 2641篇 |
2005年 | 2544篇 |
2004年 | 2067篇 |
2003年 | 1711篇 |
2002年 | 1379篇 |
2001年 | 1061篇 |
2000年 | 970篇 |
1999年 | 764篇 |
1998年 | 604篇 |
1997年 | 505篇 |
1996年 | 444篇 |
1995年 | 336篇 |
1994年 | 324篇 |
1993年 | 236篇 |
1992年 | 181篇 |
1991年 | 130篇 |
1990年 | 110篇 |
1989年 | 88篇 |
1988年 | 76篇 |
1987年 | 47篇 |
1986年 | 47篇 |
1985年 | 32篇 |
1984年 | 35篇 |
1983年 | 21篇 |
1982年 | 21篇 |
1981年 | 15篇 |
1980年 | 7篇 |
1979年 | 9篇 |
1977年 | 6篇 |
1973年 | 4篇 |
1956年 | 3篇 |
1955年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
991.
Roberto Canonico Maurizio D'Arienzo Simon Pietro Romano Giorgio Ventre 《Software》2003,33(10):901-911
A number of distributed applications require communication services with quality of service (QoS) guarantees. Building global‐scale distributed systems with predictable properties is one of the great challenges for computer systems engineering in the new century. Work undertaken within the Internet Engineering Task Force has led to the definition of novel architectural models for the Internet with QoS support. According to these models, the network has to be appropriately configured in order to provide applications with the required performance guarantees. In next‐generation networks, enabling applications to interact with the underlying QoS services is of primary importance. Hence, several special‐purpose application programming interfaces (APIs) have been defined to let applications negotiate QoS parameters across QoS‐capable networks. However, so far, none of these APIs are available in different operating environments. We believe that such features should be embedded in programming environments for distributed applications. In this work we present how we included QoS control features in Tcl, a programming language that has been widely adopted for the development of distributed multimedia applications. Our work has led to the implementation of QTcl, an extended Tcl interpreter that provides programmers with a new set of primitives, in full compliance with the standard SCRAPI programming interface for the RSVP protocol. QTcl in highly portable, in that it enables standard QoS negotiation to be performed in a seamless fashion on the most common operating systems. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献
992.
Web信息集成技术研究 总被引:24,自引:0,他引:24
孟小峰 《计算机应用与软件》2003,20(11):32-36,63
信息系统集成技术已经历了二十多年的发展,研究者已提出了很多信息集成的体系结构和实现方案,然而这些方法研究的主要集成对象是传统的异构数据库系统。随着Internet的飞速发展,网络迅速成为一种重要的信息传播和交换的手段,尤其是Web上,有着及其丰富的数据来源。如何获取Web上的有用数据并加以综合利用,即构建Web信息集成系统,成为一个引起广泛关注的研究领域。本文结合自己的研究工作,对这一领域的研究做了简单的综述,对有关的研究问题给出了分析。 相似文献
993.
994.
Based on the dynamic anti-windup strategy, an alternative control methodology for state constrained systems is presented. The proposed method is an a posteriori approach for state constrained systems, which is differentiated from the usual a priori approach. That is, first a linear controller is designed to show a desirable nominal performance by ignoring state constraints. Then, an additional compensator is introduced to account for state constraints. By minimizing a reasonable performance index, a dynamic compensator is derived explicitly, which is expressed in plant and controller parameters. The proposed method not only provides a graceful performance degradation, but it also guarantees the total stability of the resulting systems. An illustrative example is given to show the effectiveness of the proposed method. 相似文献
995.
The constrained longest common subsequence problem 总被引:1,自引:0,他引:1
Yin-Te Tsai 《Information Processing Letters》2003,88(4):173-176
This paper considers a constrained version of longest common subsequence problem for two strings. Given strings S1, S2 and P, the constrained longest common subsequence problem for S1 and S2 with respect to P is to find a longest common subsequence lcs of S1 and S2 such that P is a subsequence of this lcs. An O(rn2m2) time algorithm based upon the dynamic programming technique is proposed for this new problem, where n, m and r are lengths of S1, S2 and P, respectively. 相似文献
996.
园区网建设及有关技术分析 总被引:2,自引:0,他引:2
从系统工程方法出发,阐述园区网工程规划、设计、实施的一般性方法及各阶段目标和任务;分析了园区网建设中若干技术问题。 相似文献
997.
分布式搜索引擎的设计与实现 总被引:5,自引:0,他引:5
在一个分布各地的网站群组成的大系统中,不设立中心数据库的情况下,各网站对等协调工作,实现数据库级共享与搜索是一个难题。文中阐述了用Web Service技术实现分布式搜索的基本原理,并对Web Service代理模式、异地数据存取、大结果集处理、查询数据本地化等关键技术进行了详细介绍。 相似文献
998.
999.
基于LabWindows/CVI的计算机图形动态模拟技术 总被引:2,自引:0,他引:2
计算机图形动态模拟是动态测试CAT系统的重要组成部分,本文提出了利用Labwindows/CVI实现动态模拟的基本原理与方法,并给出了拖拉机动态测试系统中仿真控制的实例,动态模拟功能设计成为相对独立的模块,有利于实现测试系统的自动化监控和操纵。 相似文献
1000.
This paper studies the use of multicast together with proxy nodes for reliably disseminating data from a single source to a large number of receivers. In order to achieve reliability, data must be retransmitted in case of loss either by the source or by special network nodes, called proxies. Each proxy is responsible for reliably delivering the data to a subgroup it is assigned. The multicast tree is partitioned into subgroups that form a hierarchy rooted at the source, hence the term hierarchical reliable multicast. The performance of this approach strongly depends on the topology and the loss characteristics of the underlying tree and the location of proxies. In the first part of the paper, we study the processing and bandwidth performance of such a reliable multicast dissemination given the tree and the placement of proxies. In the second part of the paper, we develop dynamic programming algorithms that give a placement of a fixed number of proxies on an arbitrary tree that minimizes the bandwidth used for reliable transfer. The first algorithm provides an optimal solution to the multicast proxies location problem in polynomial time, in the number of nodes and proxies. The second is an approximation algorithm that gives a solution with cost within a chosen precision from the optimal, in an improved running time. An optimal and an approximate solution are also provided for the proxies location problem if unicast is used for transmissions. Applications of this dynamic programming approach to related problems are discussed. 相似文献