全文获取类型
收费全文 | 7227篇 |
免费 | 966篇 |
国内免费 | 684篇 |
专业分类
电工技术 | 823篇 |
技术理论 | 1篇 |
综合类 | 785篇 |
化学工业 | 80篇 |
金属工艺 | 37篇 |
机械仪表 | 239篇 |
建筑科学 | 352篇 |
矿业工程 | 84篇 |
能源动力 | 195篇 |
轻工业 | 36篇 |
水利工程 | 661篇 |
石油天然气 | 108篇 |
武器工业 | 75篇 |
无线电 | 2027篇 |
一般工业技术 | 413篇 |
冶金工业 | 124篇 |
原子能技术 | 6篇 |
自动化技术 | 2831篇 |
出版年
2024年 | 82篇 |
2023年 | 177篇 |
2022年 | 235篇 |
2021年 | 298篇 |
2020年 | 304篇 |
2019年 | 287篇 |
2018年 | 258篇 |
2017年 | 331篇 |
2016年 | 361篇 |
2015年 | 415篇 |
2014年 | 575篇 |
2013年 | 586篇 |
2012年 | 628篇 |
2011年 | 614篇 |
2010年 | 432篇 |
2009年 | 443篇 |
2008年 | 449篇 |
2007年 | 466篇 |
2006年 | 348篇 |
2005年 | 297篇 |
2004年 | 240篇 |
2003年 | 228篇 |
2002年 | 150篇 |
2001年 | 115篇 |
2000年 | 95篇 |
1999年 | 69篇 |
1998年 | 72篇 |
1997年 | 53篇 |
1996年 | 43篇 |
1995年 | 36篇 |
1994年 | 32篇 |
1993年 | 34篇 |
1992年 | 15篇 |
1991年 | 10篇 |
1990年 | 11篇 |
1989年 | 13篇 |
1988年 | 7篇 |
1987年 | 5篇 |
1986年 | 6篇 |
1985年 | 11篇 |
1984年 | 5篇 |
1983年 | 6篇 |
1982年 | 5篇 |
1980年 | 5篇 |
1979年 | 4篇 |
1977年 | 2篇 |
1976年 | 4篇 |
1975年 | 2篇 |
1974年 | 3篇 |
1973年 | 3篇 |
排序方式: 共有8877条查询结果,搜索用时 15 毫秒
151.
以浙江省免疫规划信息系统作为8小时工作模式的业务系统实例,阐述了数据中心应用虚拟化技术后在硬件成本、管理强度、资源分配和利用等方面带来的改变。 相似文献
152.
计算机网络中的一个核心问题就是如何在竞争的流之间公平地分配带宽。由于网络是分布式的,因此又要求带宽分配算法可以是分布式的,这样就可以在路由器端和用户端配置,从而分别不停地调节速率以达到网络平衡和最优状态。不同的算法对应不同的公平性标准,其中应用最为广泛的就是最大最小公平性以及效用函数最大最小公平性。本文提出了一种新的方法来实现效用函数最大最小公平性,这种方法基于非线性优化中的向量优化方法和Kuhn-Tucker条件。利用这种方法可以把网络优化问题转化为一系列等价的条件,这些条件的最优解就是原问题的解。而求解这些条件可以运用经典的非线性优化的梯度投影算法,由此产生了一种分布式的用户链路算法并通过案例验证了其正确性及性能。 相似文献
153.
Pilsung Kang Author Vitae Author Vitae 《Pattern recognition》2008,41(11):3507-3518
Instance-based learning (IBL), so called memory-based reasoning (MBR), is a commonly used non-parametric learning algorithm. k-nearest neighbor (k-NN) learning is the most popular realization of IBL. Due to its usability and adaptability, k-NN has been successfully applied to a wide range of applications. However, in practice, one has to set important model parameters only empirically: the number of neighbors (k) and weights to those neighbors. In this paper, we propose structured ways to set these parameters, based on locally linear reconstruction (LLR). We then employed sequential minimal optimization (SMO) for solving quadratic programming step involved in LLR for classification to reduce the computational complexity. Experimental results from 11 classification and eight regression tasks were promising enough to merit further investigation: not only did LLR outperform the conventional weight allocation methods without much additional computational cost, but also LLR was found to be robust to the change of k. 相似文献
154.
Pierre-Emmanuel Hladik Hadrien Cambazard Narendra Jussien 《Journal of Systems and Software》2008,81(1):132-149
In this paper, we present an original approach (CPRTA for “Constraint Programming for solving Real-Time Allocation”) based on constraint programming to solve a static allocation problem of hard real-time tasks. This problem consists in assigning periodic tasks to distributed processors in the context of fixed priority preemptive scheduling. CPRTA is built on dynamic constraint programming together with a learning method to find a feasible processor allocation under constraints. Two efficient new approaches are proposed and validated with experimental results. Moreover, CPRTA exhibits very interesting properties. It is complete (if a problem has no solution, the algorithm is able to prove it); it is non-parametric (it does not require specific tuning) thus allowing a large diversity of models to be easily considered. Finally, thanks to its capacity to explain failures, it offers attractive perspectives for guiding the architectural design process. 相似文献
155.
We define and study an optimization problem that is motivated by bandwidth allocation in radio networks. Because radio transmissions are subject to interference constraints in radio networks, physical space is a common resource that the nodes have to share in such a way, that concurrent transmissions do not interfere. The bandwidth allocation problem we study under these constraints is the following. Given bandwidth (traffic) demands between the nodes of the network, the objective is to schedule the radio transmissions in such a way that the traffic demands are satisfied. The problem is similar to a multicommodity flow problem, where the capacity constraints are replaced by the more complex notion of non-interfering transmissions. We provide a formal specification of the problem that we call round weighting . By modeling non-interfering radio transmissions as independent sets, we relate the complexity of round weighting to the complexity of various independent set problems (e.g. maximum weight independent set, vertex coloring, fractional coloring). From this relation, we deduce that in general, round weighting is hard to approximate within n1−ε (n being the size of the radio network). We also provide polynomial (exact or approximation) algorithms e.g. in the following two cases: (a) when the interference constraints are specific (for instance for a network whose vertices belong to the Euclidean space), or (b) when the traffic demands are directed towards a unique node in the network (also called gathering, analogous to single commodity flow). 相似文献
156.
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. 相似文献
157.
Dynamic memory allocation has been used for decades. However, it has seldom been used in real-time systems since the worst
case of spatial and temporal requirements for allocation and deallocation operations is either unbounded or bounded but with
a very large bound.
In this paper, a new allocator called TLSF (Two Level Segregated Fit) is presented. TLSF is designed and implemented to accommodate
real-time constraints. The proposed allocator exhibits time-bounded behaviour, O(1), and maintains a very good execution time. This paper describes in detail the data structures and functions provided by
TLSF. We also compare TLSF with a representative set of allocators regarding their temporal cost and fragmentation.
Although the paper is mainly focused on timing analysis, a brief study and comparative analysis of fragmentation incurred
by the allocators has been also included in order to provide a global view of the behaviour of the allocators.
The temporal and spatial results showed that TLSF is also a fast allocator and produces a fragmentation close to that caused
by the best existing allocators.
相似文献
Alfons Crespo (Corresponding author)Email: |
158.
159.
介绍了认知无线电的研究现状,对认知无线电系统中已有的动态频谱分配模型进行了分析并结合各种算法进行了比较。在此基础上总结并提出了频谱共享的一些挑战性问题,探讨了动态频谱分配的一些热点问题并构想了未来的发展方向。 相似文献
160.
汪黎 《计算机工程与科学》2009,31(Z1)
在现代计算机体系结构中,对于大容量的片上存储器,越来越多地采用软件来管理,被认为是解决存储墙问题的一个有效途径。本文介绍了片上大容量软件管理存储器分配技术的研究进展,对有代表性的技术进行了概要的介绍和评述,并预测了技术的发展方向。 相似文献