全文获取类型
收费全文 | 6497篇 |
免费 | 699篇 |
国内免费 | 544篇 |
专业分类
电工技术 | 534篇 |
综合类 | 797篇 |
化学工业 | 89篇 |
金属工艺 | 339篇 |
机械仪表 | 1296篇 |
建筑科学 | 203篇 |
矿业工程 | 166篇 |
能源动力 | 25篇 |
轻工业 | 100篇 |
水利工程 | 19篇 |
石油天然气 | 71篇 |
武器工业 | 96篇 |
无线电 | 1317篇 |
一般工业技术 | 270篇 |
冶金工业 | 70篇 |
原子能技术 | 23篇 |
自动化技术 | 2325篇 |
出版年
2024年 | 20篇 |
2023年 | 110篇 |
2022年 | 193篇 |
2021年 | 200篇 |
2020年 | 221篇 |
2019年 | 173篇 |
2018年 | 165篇 |
2017年 | 228篇 |
2016年 | 230篇 |
2015年 | 251篇 |
2014年 | 432篇 |
2013年 | 362篇 |
2012年 | 463篇 |
2011年 | 500篇 |
2010年 | 348篇 |
2009年 | 423篇 |
2008年 | 385篇 |
2007年 | 481篇 |
2006年 | 394篇 |
2005年 | 377篇 |
2004年 | 296篇 |
2003年 | 272篇 |
2002年 | 248篇 |
2001年 | 194篇 |
2000年 | 173篇 |
1999年 | 118篇 |
1998年 | 81篇 |
1997年 | 86篇 |
1996年 | 43篇 |
1995年 | 61篇 |
1994年 | 47篇 |
1993年 | 33篇 |
1992年 | 34篇 |
1991年 | 18篇 |
1990年 | 23篇 |
1989年 | 13篇 |
1988年 | 27篇 |
1987年 | 7篇 |
1986年 | 3篇 |
1984年 | 2篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1977年 | 1篇 |
1972年 | 1篇 |
排序方式: 共有7740条查询结果,搜索用时 578 毫秒
1.
基于传统易碎薄板机械手位置伺服控制系统稳定性低、自动化分拣效率低等不足,设计了一种基于笛卡尔坐标式的气动码垛机器手和位置伺服稳定性控制系统。首先,设计并介绍笛卡尔坐标式码垛机械手的基本组成结构,对机械手末端吸盘气动回路控制系统进行设计和分析;然后分别对机械手X、Y、Z三个方向的伺服电机控制原理进行分析并设计了一种位置伺服系统的前馈自适应控制算法;最后,将传统位置闭环PID算法和前馈自适应控制算法进行位置跟踪稳定性对比试验。实验结果表明该笛卡尔坐标式的气动码垛机器手和位置伺服稳定性控制系统设计合理,满足实际生产要求。 相似文献
2.
3.
4.
Mahmoud Elsisi 《国际智能系统杂志》2020,35(11):1857-1878
The controller design for the robotic manipulator faces different challenges such as the system's nonlinearities and the uncertainties of the parameters. Furthermore, the tracking of different linear and nonlinear trajectories represents a vital role by the manipulator. This paper suggests an optimal design for the nonlinear model predictive control (NLMPC) based on a new improved intelligent technique and it is named modified multitracker optimization algorithm (MMTOA). The proposed modification of the MTOA is carried out based on opposition-based learning (OBL) and quasi OBL approaches. This modification improves the exploration behavior of the MTOA to prevent it from becoming trapped in a local optimum. The proposed method is applied on the robotic manipulator to track different linear and nonlinear trajectories. The NLMPC parameters are tuned by the MMTOA rather than the trial and error method of the designer. The proposed NLMPC based on MMTOA is compared with the original MTOA, genetic algorithm, and cuckoo search algorithm in literature. The superiority and effectiveness of the proposed controller are confirmed to track different linear and nonlinear trajectories. Furthermore, the robustness of the proposed method is emphasized against the uncertainties of the parameters. 相似文献
5.
The existing analytical average bit error rate (ABER) expression of conventional generalised spatial modulation (CGSM) does not agree well with the Monte Carlo simulation results in the low signal‐to‐noise ratio (SNR) region. Hence, the first contribution of this paper is to derive a new and easy way to evaluate analytical ABER expression that improves the validation of the simulation results at low SNRs. Secondly, a novel system termed CGSM with enhanced spectral efficiency (CGSM‐ESE) is presented. This system is realised by applying a rotation angle to one of the two active transmit antennas. As a result, the overall spectral efficiency is increased by 1 bit/s/Hz when compared with the equivalent CGSM system. In order to validate the simulation results of CGSM‐ESE, the third contribution is to derive an analytical ABER expression. Finally, to improve the ABER performance of CGSM‐ESE, three link adaptation algorithms are developed. By assuming full knowledge of the channel at the receiver, the proposed algorithms select a subset of channel gain vector (CGV) pairs based on the Euclidean distance between all CGV pairs, CGV splitting, CGV amplitudes, or a combination of these. 相似文献
6.
针对空空宽带高速通信的需求,设计了小型化机载激光通信系统。仿真分析了300 km、2.5 Gb/s无线激光链路性能,并通过运动仿真台模拟机动环境测试了系统的跟踪与通信性能,其中粗跟踪误差为533.2 μrad(1σ),精跟踪误差为3.6 μrad(1σ),测试数据传输240 s,通信误码率为2.82×10-9。仿真与实验验证了该系统用于远距离空空无线激光通信的可行性。 相似文献
7.
Online configuration of large-scale systems such as networks requires parameter optimization within a limited amount of time, especially when configuration is needed as a response to recover from a failure in the system. To quickly configure such systems in an online manner, we propose a Probabilistic Trans-Algorithmic Search (PTAS) framework which leverages multiple optimization search algorithms in an iterative manner. PTAS applies a search algorithm to determine how to best distribute available experiment budget among multiple optimization search algorithms. It allocates an experiment budget to each available search algorithm and observes its performance on the system-at-hand. PTAS then probabilistically reallocates the experiment budget for the next round proportional to each algorithm’s performance relative to the rest of the algorithms. This “roulette wheel” approach probabilistically favors the more successful algorithm in the next round. Following each round, the PTAS framework “transfers” the best result(s) among the individual algorithms, making our framework a trans-algorithmic one. PTAS thus aims to systematize how to “search for the best search” and hybridize a set of search algorithms to attain a better search. We use three individual search algorithms, i.e., Recursive Random Search (RRS) (Ye and Kalyanaraman, 2004), Simulated Annealing (SA) (Laarhoven and Aarts, 1987), and Genetic Algorithm (GA) (Goldberg, 1989), and compare PTAS against the performance of RRS, GA, and SA. We show the performance of PTAS on well-known benchmark objective functions including scenarios where the objective function changes in the middle of the optimization process. To illustrate applicability of our framework to automated network management, we apply PTAS on the problem of optimizing link weights of an intra-domain routing protocol on three different topologies obtained from the Rocketfuel dataset. We also apply PTAS on the problem of optimizing aggregate throughput of a wireless ad hoc network by tuning datarates of traffic sources. Our experiments show that PTAS successfully picks the best performing algorithm, RRS or GA, and allocates the time wisely. Further, our results show that PTAS’ performance is not transient and steadily improves as more time is available for search. 相似文献
8.
平面结构冗余并联机构的误差敏感度分析 总被引:1,自引:0,他引:1
针对一种含闭环支链的平面结构冗余并联机构进行误差敏感度分析。分析了该机构的逆运动学和正运动学。基于矩阵法建立了机构的误差模型,并通过反解、正解结合的方法对该误差模型进行了验证。基于误差模型,得到了评价机构误差敏感度的指标,绘制了各指标在工作空间内的等值线图。基于误差敏感度指标,定义了低误差敏感性工作空间,绘制了低误差敏感性工作空间在工作空间中的分布图。与平面3-RRR并联机构进行了误差敏感度对比分析。结果表明,该机构的低误差敏感性工作空间占比较大,同时可以通过调节其冗余支链不断扩大低误差敏感性工作空间,使机构在大范围空间中保持低误差敏感性。 相似文献
9.
10.
Uplink scheduling in wireless systems is gaining importance due to arising uplink intensive data services (ftp, image uploads
etc.), which could be hampered by the currently in-built asymmetry in favor of the downlink. In this work, we propose and
study algorithms for efficient uplink packet-data scheduling in a CDMA cell. The algorithms attempt to maximize system throughput
under transmit power limitations on the mobiles assuming instantaneous knowledge of user queues and channels. However no channel
statistics or traffic characterization is necessary. Apart from increasing throughput, the algorithms also improve fairness
of service among users, hence reducing chances of buffer overflows for poorly located users.
The major observation arising from our analysis is that it is advantageous on the uplink to schedule “strong” users one-at-a-time,
and “weak” users in larger groups. This contrasts with the downlink where one-at-a-time transmission for all users has shown
to be the preferred mode in much previous work. Based on the optimal schedules, we propose less complex and more practical
approximate methods, both of which offer significant performance improvement compared to one-at-a-time transmission, and the
widely acclaimed Proportional Fair (PF) algorithm, in simulations. When queue content cannot be fed back, we propose a simple modification of PF, Uplink PF (UPF), that offers similar improvement.
Hereafter, we refer to users with low recieved power at the base even when transmitting at peak transmit power as “weak” users,
and the strongly recieved users at the base as “strong” users.
Krishnan Kumaran is currently a member of the Complex Systems Modeling section in the Corporate Strategic Research of ExxonMobil Corp., Clinton,
NJ. Formerly, he was a Member of Technical Staff in the Mathematics of Networks and Systems Research Department at Bell Labs
in Murray Hill, NJ, where his research interests were in modeling, analysis and simulation of design, resource management
and scheduling issues in telecommunication networks.
Lijun Qian is an assistant professor in the Department of Electrical Engineering at Prairie View A&M University. He received his B.S.
from Tsinghua University in Beijing, M.S. from Technion-Israel Institute of Technology, and Ph.D. from WINLAB, Rutgers University,
all in electrical engineering. Before joining PVAMU, he was a researcher at Networks and Systems Research Department of Bell
Labs in Murray Hill, NJ. His major research interests are in wireless communications and networking technologies, especially
in radio resource management, protocol design, TCP/RLP optimization and MPLS traffic engineering. 相似文献