全文获取类型
收费全文 | 2679篇 |
免费 | 272篇 |
国内免费 | 294篇 |
专业分类
电工技术 | 135篇 |
技术理论 | 1篇 |
综合类 | 313篇 |
化学工业 | 49篇 |
金属工艺 | 19篇 |
机械仪表 | 109篇 |
建筑科学 | 61篇 |
矿业工程 | 17篇 |
能源动力 | 17篇 |
轻工业 | 26篇 |
水利工程 | 13篇 |
石油天然气 | 12篇 |
武器工业 | 77篇 |
无线电 | 662篇 |
一般工业技术 | 208篇 |
冶金工业 | 30篇 |
原子能技术 | 8篇 |
自动化技术 | 1488篇 |
出版年
2024年 | 8篇 |
2023年 | 21篇 |
2022年 | 34篇 |
2021年 | 36篇 |
2020年 | 57篇 |
2019年 | 70篇 |
2018年 | 57篇 |
2017年 | 78篇 |
2016年 | 97篇 |
2015年 | 119篇 |
2014年 | 155篇 |
2013年 | 244篇 |
2012年 | 200篇 |
2011年 | 196篇 |
2010年 | 153篇 |
2009年 | 183篇 |
2008年 | 204篇 |
2007年 | 182篇 |
2006年 | 180篇 |
2005年 | 159篇 |
2004年 | 117篇 |
2003年 | 133篇 |
2002年 | 77篇 |
2001年 | 74篇 |
2000年 | 49篇 |
1999年 | 45篇 |
1998年 | 40篇 |
1997年 | 31篇 |
1996年 | 35篇 |
1995年 | 31篇 |
1994年 | 39篇 |
1993年 | 22篇 |
1992年 | 16篇 |
1991年 | 18篇 |
1990年 | 24篇 |
1989年 | 10篇 |
1988年 | 10篇 |
1987年 | 6篇 |
1986年 | 4篇 |
1985年 | 4篇 |
1984年 | 6篇 |
1983年 | 4篇 |
1982年 | 5篇 |
1981年 | 2篇 |
1979年 | 2篇 |
1973年 | 1篇 |
1962年 | 1篇 |
1960年 | 1篇 |
1959年 | 2篇 |
1955年 | 1篇 |
排序方式: 共有3245条查询结果,搜索用时 109 毫秒
71.
针对分段线性控制系统鲁棒极点配置问题,利用IGHS算法对特征向量矩阵条件数优化具有较好的收敛性,限制了特征向量选择的自由度.优化后的控制器使闭环系统矩阵允许有更大的摄动或不确定性.与已有方法相比,本文方法对条件数优化计算既不需要考虑梯度和二次可微信息,也不需要对条件数进行凸转化处理.最后,仿真实验结果验证了本方法的有效性. 相似文献
72.
In this article, we investigate uplink resource allocation in orthogonal frequency division multiple access (OFDMA) systems that use distributed antennas. The multiple distributed receiving antennas motivate us to exploit the spatial diversity to maximize the achievable rate of the system. Given constraints on the subcarrier allocation and the power limit of each user equipment (UE), a mixed-integer optimization problem is formulated. We first propose a centralized greedy algorithm to find the maximum achievable rate of the system. Then a heuristic algorithm is proposed that can be implemented in a distributed manner. Simulation results show that the heuristic algorithm can approximately achieve the maximum achievable rate of the system and result in significant system performance improvement over the approach assigning one user to each subcarrier. 相似文献
73.
探讨了应用最大最小蚁群算法(MMAS)来解决移动通讯系统(GSM)的频率规划问题。基于MMAS提出了一个可方便地控制算法的探索和开发能力并使之平衡的参数。实验结果表明,通过优化该参数,显著提高了算法的性能。 相似文献
74.
当图像中特征点缺失比较严重时,利用特征点S维分配算法和K均值聚类算法的图像匹配性能较差。此外,随着待匹配图像数量的增加,上述两类算法的计算量急剧上升。针对上述问题,提出一种新的图像匹配判决算法——利用特征点序列截断的匹配判决。该算法利用了匹配特征点之间的匹配度量大于非匹配特征点之间的匹配度量,以及同一匹配簇中来源于同一图像的特征点不超过一个的先验知识,一方面对特征点缺失具有较强的鲁棒性,另一方面克服了上述两类算法中的组合爆炸问题。仿真实验证实了所提算法的有效性。 相似文献
75.
目标交接是图像传感系统中的关键技术,针对基于特征融合目标交接算法中特征提取的不准确,提出基于决策级融合的多摄像机目标交接算法。将目标的每个特征作为一个证据,给出每个证据基本置信指派函数的构造方式。利用Dempster组合规则得到融合多个证据后的基本置信指派。利用融合决策规则来判断当前目标是否和辨识框架中的某个目标为同一个目标,完成目标交接,并给出目标在系统中唯一标识。多种场景仿真实验表明该算法可以准确地完成多摄像机目标交接。 相似文献
76.
网络实验环境对于协议和应用的开发具有十分重要的意义,大规模网络拓扑生成技术是构建网络实验环境的关键技术。本文提出了一种新的大规模网络拓扑生成框架VLTGF,该框架将网络拓扑结构分为三层,每一层分别采用不同的拓扑生成方法,并提供了可选的带宽分配机制,使得生成的网络拓扑结构更为完整和准确。 相似文献
77.
In this paper, we propose a distributed agent model that applies belief-desire-intention (BDI) reasoning and negotiation for addressing the linear assignment problem (LAP) collaboratively. In resource allocation, LAP is viewed as seeking a concurrent allocation of one different resource for every task to optimize a linear sum objective function. The proposed model provides a basic agent-based foundation needed for efficient resource allocation in a distributed environment. A distributed agent algorithm that has been developed based on the BDI negotiation model is examined both analytically and experimentally. To improve performance in terms of average negotiation speed and solution quality, two initialization heuristics and two different reasoning control strategies are applied, with the latter yielding different variants of the basic algorithm. Extensive simulations suggest that all the heuristic-algorithm combinations can produce a near optimal solution soon enough in some specific sense. The significance and applicability of the research work are also discussed. 相似文献
78.
Concept assignment identifies units of source code that are functionally related, even if this is not apparent from a syntactic point of view. Until now, the results of concept assignment have only been used for static analysis, mostly of program source code. This paper investigates the possibility of using concept information within a framework for dynamic analysis of programs. The paper presents two case studies involving a small Java program used in a previous research exercise, and a large Java virtual machine (the popular Jikes RVM system). These studies investigate two applications of dynamic concept information: visualization and profiling. The paper demonstrates two different styles of concept visualization, which show the proportion of overall time spent in each concept and the sequence of concept execution, respectively. The profiling study concerns the interaction between runtime compilation and garbage collection in Jikes RVM. For some benchmark cases, we are able to obtain a significant reduction in garbage collection time. We discuss how this phenomenon might be harnessed to optimize the scheduling of garbage collection in Jikes RVM. 相似文献
79.
Consider a directed rooted tree T=(V,E) representing a collection V of n web pages connected via a set E of links all reachable from a source home page, represented by the root of T. Each web page i carries a weight w
i
representative of the frequency with which it is visited. By adding hotlinks, shortcuts from a node to one of its descendants,
we are interested in minimizing the expected number of steps needed to visit pages from the home page. We give the first linear
time algorithm for assigning hotlinks so that the number of steps to access a page i from the root of the tree reaches the entropy bound, i.e. is at most O(log (W/w
i
)) where W=∑
i∈T
w
i
. The best previously known algorithm for this task runs in time O(n
2). We also give the first efficient data structure for maintaining hotlinks when nodes are added, deleted or their weights
modified, in amortized time O(log (W/w
i
)) per update. The data structure can be made adaptive, i.e. reaches the entropy bound in the amortized sense without knowing
the weights w
i
in advance. 相似文献
80.
Assignment of referees to football games is an important problem faced in professional football leagues. Despite its importance, the problem has received limited academic attention. This paper presents a model and analysis of the problem for fair referee assignments, and develops a constructive heuristic and a local search procedure for its solution. Results from an extensive computational study show that the methods are effective in solving the problem in a second of computation time and yielding an excellent solution quality. 相似文献