全文获取类型
收费全文 | 7237篇 |
免费 | 1002篇 |
国内免费 | 959篇 |
专业分类
电工技术 | 319篇 |
综合类 | 860篇 |
化学工业 | 201篇 |
金属工艺 | 72篇 |
机械仪表 | 265篇 |
建筑科学 | 84篇 |
矿业工程 | 45篇 |
能源动力 | 68篇 |
轻工业 | 55篇 |
水利工程 | 59篇 |
石油天然气 | 86篇 |
武器工业 | 43篇 |
无线电 | 1027篇 |
一般工业技术 | 715篇 |
冶金工业 | 29篇 |
原子能技术 | 95篇 |
自动化技术 | 5175篇 |
出版年
2024年 | 28篇 |
2023年 | 80篇 |
2022年 | 113篇 |
2021年 | 125篇 |
2020年 | 189篇 |
2019年 | 157篇 |
2018年 | 196篇 |
2017年 | 239篇 |
2016年 | 269篇 |
2015年 | 312篇 |
2014年 | 426篇 |
2013年 | 524篇 |
2012年 | 552篇 |
2011年 | 616篇 |
2010年 | 460篇 |
2009年 | 492篇 |
2008年 | 580篇 |
2007年 | 559篇 |
2006年 | 460篇 |
2005年 | 403篇 |
2004年 | 375篇 |
2003年 | 325篇 |
2002年 | 282篇 |
2001年 | 208篇 |
2000年 | 187篇 |
1999年 | 135篇 |
1998年 | 139篇 |
1997年 | 128篇 |
1996年 | 95篇 |
1995年 | 65篇 |
1994年 | 100篇 |
1993年 | 75篇 |
1992年 | 59篇 |
1991年 | 35篇 |
1990年 | 29篇 |
1989年 | 26篇 |
1988年 | 20篇 |
1987年 | 16篇 |
1986年 | 24篇 |
1985年 | 23篇 |
1984年 | 11篇 |
1983年 | 15篇 |
1982年 | 10篇 |
1981年 | 9篇 |
1980年 | 6篇 |
1979年 | 4篇 |
1978年 | 5篇 |
1977年 | 6篇 |
1976年 | 2篇 |
1975年 | 3篇 |
排序方式: 共有9198条查询结果,搜索用时 0 毫秒
1.
针对传统的小区内开环功率控制算法通常以提升本小区的吞吐量性能为目标,忽略了当前小区用户对邻小区用户同频干扰的问题,为提升边缘用户性能的同时兼顾系统整体性能,提出了一种LTE系统小区间上行联合功率控制(UJPC)算法。该算法采用单基站三扇区为系统模型,以最优化系统吞吐量比例公平函数为目标,首先根据最小信干噪比(SINR)约束值和用户最大发射功率这两个约束条件得到相应的数学优化模型,然后采用连续凸近似的方法求解优化问题得出各个基站所管辖的小区内所有用户的最优发射功率。仿真结果表明,与基准的开环功控方案相比,联合功控方案在保证系统平均频谱利用率的情况下能够较大幅度地提高小区边缘频谱利用率,其最佳性能增益能达到50%。 相似文献
2.
Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a
given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred
to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional
(resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional
(resp., unidirectional) topology is k-edge connected.
The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied
by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18],
which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19],
which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity.
In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity,
and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity
and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for
distributed implementation.
A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless
(Adhoc-Now 2003).
Research performed in part while visiting the Max-Plank-Institut fur Informatik.
Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting
researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University
of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms.
Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor
since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and
Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990.
His research interests include optical networks and wireless networks. 相似文献
3.
在探讨了Web查询服务的典型模型后,论文阐述了服务器端会话追踪机制的实现方式,设计了基于服务器端会话追踪的Web查询服务的典型解决方案。该设计方案可以较为安全地保存和维护客户的上下文信息,可靠地跟踪用户查询所处的状态,有效地实现有状态的Web查询服务。 相似文献
4.
It is shown that, for the spectrum analysis of digital quasi-periodic signals, one must use a procedure based on approximating the sequence of data readouts by a first-order trigonometric polynomial with a varying frequency of its harmonic functions. 相似文献
5.
An important feature of database technology of the nineties is the use of parallelism for speeding up the execution of complex queries. This technology is being tested in several experimental database architectures and a few commercial systems for conventional select-project-join queries. In particular, hash-based fragmentation is used to distribute data to disks under the control of different processors in order to perform selections and joins in parallel. With the development of new query languages, and in particular with the definition of transitive closure queries and of more general logic programming queries, the new dimension of recursion has been added to query processing. Recursive queries are complex; at the same time, their regular structure is particularly suited for parallel execution, and parallelism may give a high efficiency gain. We survey the approaches to parallel execution of recursive queries that have been presented in the recent literature. We observe that research on parallel execution of recursive queries is separated into two distinct subareas, one focused on the transitive closure of Relational Algebra expressions, the other one focused on optimization of more general Datalog queries. Though the subareas seem radically different because of the approach and formalism used, they have many common features. This is not surprising, because most typical Datalog queries can be solved by means of the transitive closure of simple algebraic expressions. We first analyze the relationship between the transitive closure of expressions in Relational Algebra and Datalog programs. We then review sequential methods for evaluating transitive closure, distinguishing iterative and direct methods. We address the parallelization of these methods, by discussing various forms of parallelization. Data fragmentation plays an important role in obtaining parallel execution; we describe hash-based and semantic fragmentation. Finally, we consider Datalog queries, and present general methods for parallel rule execution; we recognize the similarities between these methods and the methods reviewed previously, when the former are applied to linear Datalog queries. We also provide a quantitative analysis that shows the impact of the initial data distribution on the performance of methods.
Recommended by: Patrick Valduriez 相似文献
6.
Wesley W. Chu Ph.D. Ion T. leong Ph.D. Ricky K. Taira Ph.D. 《The VLDB Journal The International Journal on Very Large Data Bases》1994,3(4):445-477
We introduce a semantic data model to capture the hierarchical, spatial, temporal, and evolutionary semantics of images in pictorial databases. This model mimics the user's conceptual view of the image content, providing the framework and guidelines for preprocessing to extract image features. Based on the model constructs, a spatial evolutionary query language (SEQL), which provides direct image object manipulation capabilities, is presented. With semantic information captured in the model, spatial evolutionary queries are answered efficiently. Using an object-oriented platform, a prototype medical-image management system was implemented at UCLA to demonstrate the feasibility of the proposed approach. 相似文献
7.
混合Hermite-Lagrange插值之同时逼近 总被引:1,自引:1,他引:0
谢庭藩 《中国计量学院学报》1993,(2)
对于(-1,1)中的结点组{X_k}_(k=1)~n,记l_k(x)为相应的Lagrange插值基本多项式,又记A_n=‖∑(2-x~2-x_k~2)(1-x_k~2)~-1丨l_k(x)‖。对于f∈C_([-1,1)~q与r=[q+2/2],本文证明满足条件H_n(f,x_k)=f(x_k)(k=1,2,…,n),H_n~(s)(f,±1)=f~(s)(±1)(s=0,1,…,n-1)的n+2r-1次代数多项式H_n(f,x)有逼近性质H_n~(s)(f,x)-f~(s)(x)=(?)其中δ_n(x)=n~(-1)(1-x~2)~(1/2),△_n(x)=δ_n(x)+n~(-2).作为证明的重要工具,本文还对n次代数多项式P_n(x),建立了另一形式的Bernstein不等武:若 P_n(x)=O(1)δ_n~q(x)ω(δ_n(x)),则p_n~(S)(X)=O(1)δ_n~(q-2S)(X)ω(δ_n(X))△_n~s(X)。 相似文献
8.
In recent years, constructing a virtual backbone by nodes in a connected dominating set (CDS) has been proposed to improve the performance of ad hoc wireless networks. In general, a dominating set satisfies that every vertex in the graph is either in the set or adjacent to a vertex in the set. A CDS is a dominating set that also induces a connected sub‐graph. However, finding the minimum connected dominating set (MCDS) is a well‐known NP‐hard problem in graph theory. Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a poor approximation ratio, and from high time complexity and message complexity. In this paper, we present a new distributed approximation algorithm that constructs a MCDS for wireless ad hoc networks based on a maximal independent set (MIS). Our algorithm, which is fully localized, has a constant approximation ratio, and O(n) time and O(n) message complexity. In this algorithm, each node only requires the knowledge of its one‐hop neighbours and there is only one shortest path connecting two dominators that are at most three hops away. We not only give theoretical performance analysis for our algorithm, but also conduct extensive simulation to compare our algorithm with other algorithms in the literature. Simulation results and theoretical analysis show that our algorithm has better efficiency and performance than others. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
9.
对称配筋小偏心受压构件的截面设计 总被引:4,自引:1,他引:3
对小偏心受压构件在对称配筋情况下的截面配筋计算,提出用最佳一次逼近多项式简化基本公式,直接按二次方程求解ξ的近似方法,具有精度高,相对误差小,计算方便等优点,可供工程设计人员参考。 相似文献
10.
We consider an integrated scheduling and distribution model in which jobs completed by two different machines must be bundled together for delivery. The objective is to minimize the sum of the delivery cost and customers' waiting costs. Such a model not only attempts to coordinate the job schedules on both machines, but also aims to coordinate the machine schedules with the delivery plan. Polynomial-time heuristics and approximation schemes are developed for the model with only direct shipments as well as the general model with milk-run deliveries. 相似文献