全文获取类型
收费全文 | 3258篇 |
免费 | 144篇 |
国内免费 | 137篇 |
专业分类
电工技术 | 64篇 |
综合类 | 165篇 |
化学工业 | 178篇 |
金属工艺 | 43篇 |
机械仪表 | 146篇 |
建筑科学 | 272篇 |
矿业工程 | 293篇 |
能源动力 | 162篇 |
轻工业 | 77篇 |
水利工程 | 50篇 |
石油天然气 | 147篇 |
武器工业 | 6篇 |
无线电 | 306篇 |
一般工业技术 | 92篇 |
冶金工业 | 132篇 |
原子能技术 | 6篇 |
自动化技术 | 1400篇 |
出版年
2024年 | 6篇 |
2023年 | 19篇 |
2022年 | 48篇 |
2021年 | 62篇 |
2020年 | 57篇 |
2019年 | 48篇 |
2018年 | 59篇 |
2017年 | 68篇 |
2016年 | 85篇 |
2015年 | 116篇 |
2014年 | 196篇 |
2013年 | 189篇 |
2012年 | 176篇 |
2011年 | 246篇 |
2010年 | 161篇 |
2009年 | 203篇 |
2008年 | 197篇 |
2007年 | 249篇 |
2006年 | 253篇 |
2005年 | 232篇 |
2004年 | 151篇 |
2003年 | 159篇 |
2002年 | 96篇 |
2001年 | 80篇 |
2000年 | 80篇 |
1999年 | 51篇 |
1998年 | 55篇 |
1997年 | 43篇 |
1996年 | 21篇 |
1995年 | 26篇 |
1994年 | 18篇 |
1993年 | 10篇 |
1992年 | 14篇 |
1991年 | 5篇 |
1990年 | 6篇 |
1989年 | 5篇 |
1988年 | 7篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 4篇 |
1984年 | 8篇 |
1983年 | 3篇 |
1982年 | 3篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1978年 | 3篇 |
1977年 | 4篇 |
1976年 | 4篇 |
1975年 | 1篇 |
1974年 | 1篇 |
排序方式: 共有3539条查询结果,搜索用时 31 毫秒
51.
网络教育(E-Learning)为人们提供了一种全新的学习方式,使得教育资源共享变为现实。为了实现共享的需求,基于采用Java语言开发的开源平台Aglet,提出一种资源共享模型,并介绍它的建立、描述和实现。 相似文献
52.
53.
本文基于对制造资源调度和发现过程的分析研究,建立实用的制造资源调度器模型和调度策略,然后采用蚂蚁算法对制造资源的调度快表做出优化,并做出有关的实验和数据分析。该方法能够有效地实现制造资源的作业的合理调度和实现分布式系统的负载平衡,提高了制造资源搜索的成功率。 相似文献
54.
We present algorithms, methods, and software for a Grid resource manager, that performs resource brokering and job scheduling in production Grids. This decentralized broker selects computational resources based on actual job requirements, job characteristics, and information provided by the resources, with the aim to minimize the total time to delivery for the individual application. The total time to delivery includes the time for program execution, batch queue waiting, and transfer of executable and input/output data to and from the resource. The main features of the resource broker include two alternative approaches to advance reservations, resource selection algorithms based on computer benchmark results and network performance predictions, and a basic adaptation facility. The broker is implemented as a built-in component of a job submission client for the NorduGrid/ARC middleware. 相似文献
55.
Abstract. We investigate server scheduling policies to minimize average user perceived latency in pull-based client-server systems
(systems where multiple clients request data from a server) where the server answers requests on a multicast/ broadcast channel. We first show that there is no O(1) -competitive algorithm for this problem. We then give a method to convert any nonclairvoyant unicast scheduling algorithm
A to nonclairvoyant multicast scheduling algorithm B . We show that if A works well, when jobs can have parallel and sequential phases, then B works well if it is given twice the resources. More formally, if A is an s -speed c -approximation unicast algorithm, then its counterpart algorithm B is a 2s -speed c -approximation multicast algorithm. It is already known [5] that Equi-partition, which devotes an equal amount of processing
power to each job, is a (2 + ε) -speed O(1 + 1/ε) -approximation algorithm for unicast scheduling of such jobs. Hence, it follows that the algorithm {BEQUI}, which broadcasts
all requested files at a rate proportional to the number of outstanding requests for that file, is a (4 + ε) -speed O(1 + 1/ε) -approximation algorithm. We give another algorithm BEQUI-EDF and show that BEQUI-EDF is also a (4 + ε) -speed O(1 + 1/ε) -approximation algorithm. However, BEQUI-EDF has the advantage that the maximum number of preemptions is linear in the number
of requests, and the advantage that no preemptions occur if the data items have unit size. 相似文献
56.
The goal of service differentiation is to provide different service quality levels to meet changing system configuration and resource availability and to satisfy different requirements and expectations of applications and users. In this paper, we investigate the problem of quantitative service differentiation on cluster-based delay-sensitive servers. The goal is to support a system-wide service quality optimization with respect to resource allocation on a computer system while provisioning proportionality fairness to clients. We first propose and promote a square-root proportional differentiation model. Interestingly, both popular delay factors, queueing delay and slowdown, are reciprocally proportional to the allocated resource usage. We formulate the problem of quantitative service differentiation as a generalized resource allocation optimization towards the minimization of system delay, defined as the sum of weighted delay of client requests. We prove that the optimization-based resource allocation scheme essentially provides square-root proportional service differentiation to clients. We then study the problem of service differentiation provisioning from an important relative performance metric, slowdown. We give a closed-form expression of the expected slowdown of a popular heavy-tailed workload model with respect to resource allocation on a server cluster. We design a two-tier resource management framework, which integrates a dispatcher-based node partitioning scheme and a server-based adaptive process allocation scheme. We evaluate the resource allocation framework with different models via extensive simulations. Results show that the square-root proportional model provides service differentiation at a minimum cost of system delay. The two-tier resource allocation framework can provide fine-grained and predictable service differentiation on cluster-based servers. 相似文献
57.
A scalable data structure for real-time estimation of resource availability in build-to-order environments 总被引:1,自引:0,他引:1
Scott A. Moses Le Gruenwald Khushru Dadachanji 《Journal of Intelligent Manufacturing》2008,19(5):611-622
This paper defines a highly scalable interval index structure called the Temporal Bin tree (TB-tree) that can be embedded
in any resource planning application whose algorithms require efficiently estimating either the time that a resource will
be available to process a specific task of known length or the net availability of a resource during a specified period of
time. It is specifically engineered to meet the real-time response and space efficiency requirements of large-scale resource
planning applications that are required for mass customization. Basically, the TB-tree is a binary tree structure that represents
availability of a resource across a planning horizon. Representing intervals of availability hierarchically using a tree structure
increases the efficiency of search for resource availability when the discretization of time is fine-grained or the planning
horizon is long. The tree forms a backbone structure that does not require disruptive rebalancing during update operations,
which would mitigate the ability of the tree to respond to queries in real time. Its specific implementation allows for random
access at any level of the tree to further improve scalability. An application of planning to real-time promising of order
due dates for custom built products provides the context for empirical evaluation. Results of analytical evaluations and simulation
experiments clearly demonstrate the scalability of the TB-tree relative to existing index structures in terms of both time
and space. 相似文献
58.
在相控阵雷达跟踪加搜索(TAS)工作方式下,为跟踪较大的机动目标,提出一种目标机动检测器设计方法,得到归一化的目标机动系数.基于该方法,给出了一种动态计算优先级的调度算法,较好地解决了机动多目标跟踪的资源调度问题.与几种常用机动检测器相比较,结果表明了这种机动检测器具有更高的检测概率.最后在多目标环境下进行机动目标跟踪的蒙特卡罗仿真,仿真结果显示了多目标机动检测器和资源调度算法的有效性. 相似文献
59.
Internet拥塞控制系统在不同源控制算法作用下的资源竞争分析 总被引:1,自引:1,他引:0
在未来的Internet拥塞控制协议中,不同的用户群根据不同的QoS需求,可以实现不同的控制算法.系统地研究了拥塞控制系统在AIMD和MIMD两类源算法共同作用下的稳态和动态特性,这些特性揭示了配置不同源控制算法的用户群对网络资源的竞争.内容包括AIMD,MIMD算法共同作用下的系统模型、系统稳态分析、系统稳定性分析等.基于NS2系统的仿真结果,证实了给出的分析方法的有效性,并揭示了不同源算法对网络资源的竞争情况. 相似文献
60.
Measuring robustness of computing systems 总被引:1,自引:0,他引:1
System builders are becoming increasingly interested in robust design. We believe that a methodology for generating robustness metrics will help the robust design research efforts and, in general, is an important step in the efforts to create robust computing systems. The purpose of the research in this paper is to quantify the robustness of a resource allocation, with the eventual objective of setting a standard that could easily be instantiated for a particular computing system to generate a robustness metric. The paper exposes how not considering the uncertainties can result in gross overestimation of the system capacity, and shows a method for reducing the impact of uncertainty, and even use it to our advantage if the uncertainties are correlated. We present our theoretical foundation for a robustness metric and give its instantiation for a particular system. 相似文献