全文获取类型
收费全文 | 9024篇 |
免费 | 3篇 |
专业分类
电工技术 | 122篇 |
化学工业 | 205篇 |
金属工艺 | 279篇 |
机械仪表 | 44篇 |
建筑科学 | 23篇 |
能源动力 | 26篇 |
轻工业 | 2篇 |
无线电 | 281篇 |
一般工业技术 | 75篇 |
冶金工业 | 36篇 |
原子能技术 | 83篇 |
自动化技术 | 7851篇 |
出版年
2022年 | 2篇 |
2021年 | 2篇 |
2020年 | 1篇 |
2018年 | 1篇 |
2016年 | 1篇 |
2015年 | 1篇 |
2014年 | 207篇 |
2013年 | 163篇 |
2012年 | 758篇 |
2011年 | 2266篇 |
2010年 | 1095篇 |
2009年 | 940篇 |
2008年 | 660篇 |
2007年 | 574篇 |
2006年 | 438篇 |
2005年 | 565篇 |
2004年 | 513篇 |
2003年 | 571篇 |
2002年 | 269篇 |
排序方式: 共有9027条查询结果,搜索用时 15 毫秒
101.
Sheng-Guo Wang Author Vitae 《Automatica》2003,39(3):525-532
This paper presents a general analysis of robust pole clustering in a good ride quality region (GRQR) of aircraft for matrices with structured uncertainties. This region is an intersection of a ring and a horizontal strip, located in the left half-plane, which is a specific non-Ω-transformable region providing good ride quality of aircraft. The paper applies the Rayleigh principle along the norm theory to analyze robust pole clustering within this region since the generalized Lyapunov theory is not valid for non-Ω-transformable regions. Concerned uncertainties are structured/parametric uncertainties, including interval matrices. The results are useful for robust control analysis and design, especially, of robust good ride quality of aircraft, shuttles, vehicles and space station, as well as some industrial systems. An example of the F-16 dynamics for which GRQR is suitable is included to illustrate the results. 相似文献
102.
Marco A. Arteaga Author Vitae 《Automatica》2003,39(1):67-73
Most adaptive control schemes for rigid robots assume velocities measurements to be available. Although it is possible to measure velocities by using tachometers, this increases costs and the signals delivered may be contaminated with noise. Since the use of encoders allows to read joint position pretty accurately, it is desirable to estimate joint velocities through an observer. This paper presents an adaptive scheme designed in conjunction with a linear observer. Boundedness of the estimated parameters and uniform ultimate boundedness for the tracking and observation errors are guaranteed. Experimental results are included to support the developed theory. 相似文献
103.
104.
Tianqi ZhangAuthor Vitae Shaosheng DaiAuthor VitaeWei ZhangAuthor Vitae Guoning MaAuthor VitaeXiangyun GaoAuthor Vitae 《Digital Signal Processing》2012,22(1):106-113
This paper presents a method of singular value decomposition (SVD) plus digital phase lock loop (DPLL) to solve the difficult problem of blind pseudo-noise (PN) sequence estimation in low signal to noise ratios (SNR) direct sequence spread spectrum (DS-SS, DS) signals with residual carrier. Of course, the method needs to know the parameters of DS signal, such as the period and code rate of PN sequence. Firstly, the received signal is sampled and divided into non-overlapping signal vectors according to a temporal window, whose duration is two periods of PN sequence. Then, an autocorrelation matrix is computed and accumulated by the signal vectors one by one. The PN sequence with residual carrier can be estimated by the principal eigenvector of this autocorrelation matrix. Furthermore, a DPLL is used to deal with the estimated PN sequence with residual carrier, it estimates and tracks the residual carrier, removes the residual carrier in the end. Theory analysis and computer simulation results show that this method can effectively realize the PN sequence estimation from the input DS signals with residual carrier in lower SNR. 相似文献
105.
106.
Miguel L. SilvaAuthor Vitae João Canas FerreiraAuthor Vitae 《Journal of Systems Architecture》2012,58(1):24-37
This paper presents and evaluates a method of generating partial bitstreams at run-time for dynamic reconfiguration of sections of an FPGA. The method is intended for use in adaptive embedded systems that employ run-time reconfiguration to achieve high flexibility and performance. The proposed approach combines partial bitstreams of coarse-grained components to produce a new partial bitstream implementing a given circuit netlist. Topological sorting of the netlist is used to determine the initial positions of individual components, whose placement is then improved by simulated annealing. Connection routing is done by a breadth-first search of the reconfigurable area based on a simplified resource model of the reconfigurable fabric. The desired partial bitstream is constructed by merging together the default bitstream of the reconfigurable area, the relocated partial bitstreams of the components, and the configurations of the switch matrices used for routing. The approach is embodied in a code library that applications can use to create new bitstreams at run-time. For the members of a set of 29 benchmarks (both synthetic and application-derived) having between five and 41 components, the complete process of bitstream generation takes between 8 s and 35 s when running on an embedded PowerPC 405 microprocessor clocked at 300 MHz. 相似文献
107.
Register allocation for write activity minimization on non-volatile main memory for embedded systems
Yazhi Huang Author VitaeTiantian Liu Author Vitae Chun Jason XueAuthor Vitae 《Journal of Systems Architecture》2012,58(1):13-23
Non-volatile memories are good candidates for DRAM replacement as main memory in embedded systems and they have many desirable characteristics. Nevertheless, the disadvantages of non-volatile memory co-exist with its advantages. First, the lifetime of some of the non-volatile memories is limited by the number of erase operations. Second, read and write operations have asymmetric speed or power consumption in non-volatile memory. This paper focuses on the embedded systems using non-volatile memory as main memory. We propose register allocation technique with re-computation to reduce the number of store instructions. When non-volatile memory is applied as the main memory, reducing store instructions will reduce write activities on non-volatile memory. To re-compute the spills effectively during register allocation, a novel potential spill selection strategy is proposed. During this process, live range splitting is utilized to split certain long live ranges such that they are more likely to be assigned into registers. In addition, techniques for re-computation overhead reduction is proposed on systems with multiple functional units. With the proposed approach, the lifetime of non-volatile memory is extended accordingly. The experimental results demonstrate that the proposed technique can efficiently reduce the number of store instructions on systems with non-volatile memory by 33% on average. 相似文献
108.
Sara Modarres RazaviAuthor Vitae Di YuanAuthor Vitae Fredrik GunnarssonAuthor VitaeJohan MoeAuthor Vitae 《Computer Networks》2012,56(1):157-168
Tracking Area (TA) design is one of the key tasks in location management of Long Term Evolution (LTE) networks. TA enables to trace and page User Equipments (UEs). As UEs distribution and mobility patterns change over time, TA design may have to undergo revisions. For revising the TA design, the cells to be reconfigured typically have to be temporary torn down. Consequently, this will result in service interruption and “cost”. There is always a trade-off between the performance in terms of the overall signaling overhead of the network and the reconfiguration cost. In this paper, we model this trade-off as a bi-objective optimization problem to which the solutions are characterized by Pareto-optimality. Solving the problem delivers a host of potential trade-offs among which the selection can be based on the preferences of a decision maker. An integer programming model has been developed and applied to the problem. Solving the integer programming model for various cost budget levels leads to an exact scheme for Pareto-optimization. In order to deliver Pareto-optimal solutions for large networks in one single run, a Genetic Algorithm (GA) embedded with Local Search (LS) is applied. Unlike many commonly adopted approaches in multi-objective optimization, our algorithm does not consider any weighted combination of the objectives. Comprehensive numerical results are presented in this study, using large-scale realistic or real-life network scenarios. The experiments demonstrate the effectiveness of the proposed approach. 相似文献
109.
M.C. Lucas-EstañAuthor Vitae J. GozalvezAuthor VitaeJ. Sanchez-SorianoAuthor Vitae 《Computer Networks》2012,56(1):112-126
Wireless systems will be characterized by the coexistence of heterogeneous Radio Access Technologies (RATs) with different, but also complementary, performance and technical characteristics. These heterogeneous wireless networks will provide network operators the possibility to efficiently and coordinately use the heterogeneous radio resources, for which novel Joint Radio Resource Management (JRRM) policies need to be designed. In this context, this work proposes and evaluates a JRRM policy that simultaneously determines for each user an adequate combination of RAT and number of radio resources within such RAT to guarantee the user/service QoS requirements, and efficiently distribute the radio resources considering a user fairness approach aimed at maximizing the system capacity. To this aim, the JRRM algorithm, which takes into account the discrete nature of radio resources, is based on integer linear programming optimization mechanisms. 相似文献
110.
Yiping ChenAuthor Vitae Zhe LiAuthor VitaeYaning LiuAuthor Vitae Gwendal SimonAuthor Vitae 《Computer Networks》2012,56(1):365-377
IPTV systems attracting millions of users are now commonly deployed on peer-to-peer (P2P) infrastructures and provide an appealing alternative to multicast-based systems. Typically, a P2P overlay network is associated with each channel, composed of users who receive, watch and redistribute this channel. Yet, channel surfing (aka as zapping) involves switching overlays and may introduce delays, potentially hurting the user experience when compared to multicast-based IPTV. In this paper, we present a distributed system called OAZE (Overlay Augmentation for Zapping Experience) which speeds up the switching process and reduces the overall cross-domain traffic generated by the IPTV system. In OAZE, each peer maintains connections to other peers, not only in a given channel, but also in a subset of all channels to which the associated user is likely to zap. More specifically, we focus on the channel assignment problem, i.e. determining, in a given P2P overlay, the optimal distribution of the responsibility to maintain contact peers to other channels. We propose an approximate algorithm providing guaranteed performances, and a simpler and more practical one. Our experimental results show that OAZE leads to substantial improvements on the connections between peers, resulting in less switching delay and lower network cost; it then represents an appealing add-on for existing P2P IPTV systems. 相似文献