全文获取类型
收费全文 | 15322篇 |
免费 | 1768篇 |
国内免费 | 1439篇 |
专业分类
电工技术 | 1084篇 |
技术理论 | 1篇 |
综合类 | 2445篇 |
化学工业 | 885篇 |
金属工艺 | 216篇 |
机械仪表 | 664篇 |
建筑科学 | 1407篇 |
矿业工程 | 375篇 |
能源动力 | 280篇 |
轻工业 | 457篇 |
水利工程 | 524篇 |
石油天然气 | 418篇 |
武器工业 | 617篇 |
无线电 | 2774篇 |
一般工业技术 | 1135篇 |
冶金工业 | 457篇 |
原子能技术 | 198篇 |
自动化技术 | 4592篇 |
出版年
2024年 | 29篇 |
2023年 | 150篇 |
2022年 | 286篇 |
2021年 | 352篇 |
2020年 | 398篇 |
2019年 | 397篇 |
2018年 | 366篇 |
2017年 | 541篇 |
2016年 | 574篇 |
2015年 | 619篇 |
2014年 | 967篇 |
2013年 | 1099篇 |
2012年 | 1190篇 |
2011年 | 1213篇 |
2010年 | 1023篇 |
2009年 | 1071篇 |
2008年 | 994篇 |
2007年 | 1109篇 |
2006年 | 948篇 |
2005年 | 882篇 |
2004年 | 660篇 |
2003年 | 607篇 |
2002年 | 507篇 |
2001年 | 426篇 |
2000年 | 359篇 |
1999年 | 281篇 |
1998年 | 220篇 |
1997年 | 186篇 |
1996年 | 142篇 |
1995年 | 153篇 |
1994年 | 161篇 |
1993年 | 107篇 |
1992年 | 74篇 |
1991年 | 70篇 |
1990年 | 77篇 |
1989年 | 58篇 |
1988年 | 40篇 |
1987年 | 31篇 |
1986年 | 16篇 |
1985年 | 27篇 |
1984年 | 20篇 |
1983年 | 17篇 |
1982年 | 13篇 |
1981年 | 7篇 |
1980年 | 8篇 |
1979年 | 6篇 |
1978年 | 4篇 |
1975年 | 4篇 |
1959年 | 4篇 |
1955年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
诱导式卫星欺骗干扰可诱导航空器逐渐偏离预定航迹,难以被发现,因此及时有效地检测干扰是飞行安全的保障。在现有紧组合导航体制基础上,设计了一种基于误差估值累加开环校正的紧组合导航结构,并证明了其性能与传统闭环校正紧组合导航性能等效。在此结构中,将紧组合导航系统与自适应序贯概率比检测方法结合,提出了一种基于误差估值累加开环校正的诱导式欺骗检测方法,融合紧组合导航信息与其他不受欺骗影响的导航信息,构建欺骗检测统计量进行诱导式欺骗检测。仿真结果表明,开环校正结构可避免随时间累加的惯性导航系统误差所导致的组合导航滤波器发散问题,同时欺骗检测方法可进一步提高算法对“最坏”情形下微小诱导式欺骗的检测效果。 相似文献
2.
3.
Quadrature spatial modulation (QSM) utilizes the in‐phase and quadrature spatial dimensions to transmit the real and imaginary parts of a single signal symbol, respectively. The improved QSM (IQSM) transmits two signal symbols per channel use through a combination of two antennas for each of the real and imaginary parts. The main contributions of this study can be summarized as follows. First, we derive an upper bound for the error performance of the IQSM. We then design constellation sets that minimize the error performance of the IQSM for several system configurations. Second, we propose a double QSM (DQSM) that transmits the real and imaginary parts of two signal symbols through any available transmit antennas. Finally, we propose a parallel IQSM (PIQSM) that splits the antenna set into equal subsets and performs IQSM within each subset using the same two signal symbols. Simulation results demonstrate that the proposed constellations significantly outperform conventional constellations. Additionally, DQSM and PIQSM provide a performance similar to that of IQSM while requiring a smaller number of transmit antennas and outperform IQSM with the same number of transmit antennas. 相似文献
4.
Journal of Computer Science and Technology - DOACROSS loops are significant parts in many important scientific and engineering applications, which are generally exploited pipeline/wave-front... 相似文献
5.
大坝运行监测易受自然环境和监测条件影响,存在时间和空间上的变异性,监测数据具有不确定性。以云理论的随机性和不确定性分析方法为基础,并与空间数据辐射思想相结合,建立了云滴概率密度分布估计模型,然后导出云概率密度分布函数,依据样本监测数据推求母体空间数据的分布特征,并设计了基于逆向云算法云变换的计算程序。分析陆浑水库1979~1999年测压管监测数据和位移变形数据的云概率密度分布特征和云数字特征,得出了20 a来大坝的数据分布特征和运行状态。监测数据分析结果表明,云概率密度分布估计不仅能有效合理地分析大坝的运行状态,而且能够依据云数字特征来判断监测状态和监测环境的异常变化。
相似文献
6.
Mohamed Becherif 《Asian journal of control》2019,21(4):2137-2154
Induction machines (IM) constitute a theoretically interesting and practically important class of nonlinear systems. They are frequently used as wind generators for their power/cost ratio. They are described by a fifth‐order nonlinear differential equation with two inputs and only three state variables available for measurement. The control task is further complicated by the fact that IM are subject to unknown (load) disturbances and the parameters can be of great uncertainty. One is then faced with the challenging problem of controlling a highly nonlinear system, with unknown time‐varying parameters, where the regulated output, besides being unmeasurable, is perturbed by an unknown additive signal. Passivity‐based control (PBC) is a well‐established structure‐preserving design methodology which has shown to be very powerful to design robust controllers for physical systems described by Euler‐Lagrange equations of motion. PBCs provide a natural procedure to "shape" the potential energy yielding controllers with a clear physical interpretation in terms of interconnection of the system with its environment and are robust vis á vis to unmodeled dissipative effects. One recent approach of PBC is the Interconnection and Damping Assignment Passivity‐Based Control (IDA‐PBC) which is a very useful technique to control nonlinear systems assigning a desired (Port‐Controlled Hamiltonian) structure to the closed‐loop. The aim of this paper is to give a survey on different PBC of IM. The originality of this work is that the author proves that the well known field oriented control of IM is a particular case of the IDA‐PBC with disturbance. 相似文献
7.
Frequency Insertion Strategy for Channel Assignment Problem 总被引:1,自引:0,他引:1
This paper presents a new heuristic method for quickly finding a good feasible solution to the channel assignment problem
(CAP). Like many other greedy-type heuristics for CAP, the proposed method also assigns a frequency to a call, one at a time.
Hence, the method requires computational time that increases only linear to the number of calls. However, what distinguishes
the method from others is that it starts with a narrow enough frequency band so as to provoke violations of constraints that
we need to comply with in order to avoid radio interference. Each violation is then resolved by inserting frequencies at the
most appropriate positions so that the band of frequencies expands minimally. An extensive computational experiment using
a set of randomly generated problems as well as the Philadelphia benchmark instances shows that the proposed method perform
statistically better than existing methods of its kind and even yields optimum solutions to most of Philadelphia benchmark
instances among which two cases are reported for the first time ever, in this paper.
Won-Young Shin was born in Busan, Korea in 1978. He received B.S. in industrial engineering from Pohang University of Science and Technology
(POSTECH) in 2001 and M.S in operation research and applied statistics from POSTECH in 2003. Since 2003 he has been a researcher
of Agency for Defense Development (ADD) in Korea. He is interested in optimization of communication system and applied statistics.
Soo Y. Chang is an associate professor in the Department of Industrial Engineering at Pohang University of Science and Technology (POSTECH),
Pohang, Korea. He teaches linear programming, discrete optimization, network flows and operations research courses. His research
interests include mathematical programming and scheduling. He has published in several journals including Discrete Applied
Mathematics, Computers and Mathematics with Application, IIE Transactions, International Journal of Production Research, and
so on. He is a member of Korean IIE, and ORMSS.
Jaewook Lee is an assistant professor in the Department of Industrial Engineering at Pohang University of Science and Technology (POSTECH),
Pohang, Korea. He received the B.S. degree in mathematics with honors from Seoul National University, and the Ph.D. degree
from Cornell University in applied mathematics in 1993 and 1999, respectively. He is currently an assistant professor in the
department of industrial engineering at the Pohang University of Science and Technology (POSTECH). His research interests
include nonlinear systems, neural networks, nonlinear optimization, and their applications to data mining and financial engineering.
Chi-Hyuck Jun was born in Seoul, Korea in 1954. He received B.S. in mineral and petroleum engineering from Seoul National University in
1977, M.S. in industrial engineering from Korea Advanced Institute of Science and Technology in 1979 and Ph.D. in operations
research from University of California, Berkeley, in 1986. Since 1987 he has been with the department of industrial engineering,
Pohang University of Science and Technology (POSTECH) and he is now a professor and the department head. He is interested
in performance analysis of communication and production systems. He has published in several journals including IIE Transactions,
IEEE Transactions, Queueing Systems and Chemometrics and Intelligent Laboratory Systems. He is a member of IEEE, INFORMS and
ASQ. 相似文献
8.
异构分层无线网络中基于逗留时间的动态流量均衡算法研究 总被引:1,自引:1,他引:0
为使异构分层无线网络能服务更多的移动用户,提出了一种基于逗留时间的动态流量均衡算法.该算法首先根据用户移动模型计算其在小区内的逗留时间,然后基于小区呼叫到达率和重叠覆盖小区的流量状态来确定一个周期内呼叫转移的数量,最后依据逗留时间门限值将重负载小区中满足条件的呼叫转移到轻负载的重叠覆盖小区中.为降低切换呼叫掉线率,还对异构网间的呼叫切换策略做了改进.仿真实验结果表明,本算法在新呼叫阻塞率和切换呼叫掉线率等性能指标上比传统方法有显著的提高. 相似文献
9.
Ben-Jye Chang 《Telecommunication Systems》2006,33(4):333-352
3G Wideband CDMA systems adopt the Orthogonal Variable Spreading Factor code tree as the channelization codes management for
achieving high data rate transmission in personal multimedia communications. It assigns a single channelization code for each
accepted connection. Nevertheless, it wastes the system capacity when the required rate is not powers of two of the basic
rate. One good solution is to assign multiple codes for each accepted connection but it causes two inevitable drawbacks: long
handoff delay and new call setup delay due to high complexity of processing with multiple channelization codes, and high cost
of using more number of rake combiners. Especially, long handoff delay may result in more call dropping probability and higher
Grade of Service, which will degrade significantly the utilization and revenue of the 3G cellular systems. Therefore, we propose
herein an adaptive efficient codes determination algorithm based on the Markov Decision Process analysis approach to reduce
the waste rate and reassignments significantly while providing fast handoff. Numerical results demonstrate that the proposed
approach yields several advantages, including the lowest GOS, the least waste rate, and the least number of reassignments.
Meanwhile, the optimal number of rake combiners is also analyzed in this paper.
This research was supported in part by the National Science Council of Taiwan, ROC, under contract NSC-93-2213-E-324-018. 相似文献
10.
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. 相似文献