全文获取类型
收费全文 | 55854篇 |
免费 | 5094篇 |
国内免费 | 3143篇 |
专业分类
电工技术 | 3733篇 |
技术理论 | 1篇 |
综合类 | 3602篇 |
化学工业 | 7133篇 |
金属工艺 | 3113篇 |
机械仪表 | 3172篇 |
建筑科学 | 3729篇 |
矿业工程 | 1420篇 |
能源动力 | 1407篇 |
轻工业 | 3729篇 |
水利工程 | 1188篇 |
石油天然气 | 2158篇 |
武器工业 | 507篇 |
无线电 | 6236篇 |
一般工业技术 | 5122篇 |
冶金工业 | 1789篇 |
原子能技术 | 844篇 |
自动化技术 | 15208篇 |
出版年
2024年 | 248篇 |
2023年 | 811篇 |
2022年 | 1599篇 |
2021年 | 2263篇 |
2020年 | 1650篇 |
2019年 | 1401篇 |
2018年 | 1397篇 |
2017年 | 1587篇 |
2016年 | 1486篇 |
2015年 | 2036篇 |
2014年 | 2799篇 |
2013年 | 3021篇 |
2012年 | 4199篇 |
2011年 | 5943篇 |
2010年 | 4507篇 |
2009年 | 4153篇 |
2008年 | 3648篇 |
2007年 | 3493篇 |
2006年 | 3196篇 |
2005年 | 2736篇 |
2004年 | 2166篇 |
2003年 | 2024篇 |
2002年 | 1847篇 |
2001年 | 1270篇 |
2000年 | 1014篇 |
1999年 | 868篇 |
1998年 | 520篇 |
1997年 | 463篇 |
1996年 | 361篇 |
1995年 | 280篇 |
1994年 | 242篇 |
1993年 | 179篇 |
1992年 | 148篇 |
1991年 | 109篇 |
1990年 | 108篇 |
1989年 | 85篇 |
1988年 | 67篇 |
1987年 | 28篇 |
1986年 | 29篇 |
1985年 | 14篇 |
1984年 | 16篇 |
1983年 | 5篇 |
1982年 | 10篇 |
1981年 | 5篇 |
1980年 | 7篇 |
1979年 | 12篇 |
1978年 | 9篇 |
1977年 | 4篇 |
1959年 | 12篇 |
1951年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
201.
202.
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. 相似文献
203.
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. 相似文献
204.
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. 相似文献
205.
Fairly exchanging digital content is an everyday problem. It has been shown that fair exchange cannot be achieved without a trusted third party (called the Arbiter). Yet, even with a trusted party, it is still non-trivial to come up with an efficient solution, especially one that can be used in a p2p file sharing system with a high volume of data exchanged.We provide an efficient optimistic fair exchange mechanism for bartering digital files, where receiving a payment in return for a file (buying) is also considered fair. The exchange is optimistic, removing the need for the Arbiter’s involvement unless a dispute occurs. While the previous solutions employ costly cryptographic primitives for every file or block exchanged, our protocol employs them only once per peer, therefore achieving an O(n) efficiency improvement when n blocks are exchanged between two peers. Our protocol uses very efficient cryptography, making it perfectly suitable for a p-2-p file sharing system where tens of peers exchange thousands of blocks and they do not know beforehand which ones they will end up exchanging. Therefore, our system yields up to one-to-two orders of magnitude improvement in terms of both computation and communication (40 s vs. 42 min, 1.6 MB vs. 200 MB). Thus, for the first time, a provably secure (and privacy-respecting when payments are made using e-cash) fair exchange protocol can be used in real bartering applications (e.g., BitTorrent) [14] without sacrificing performance. 相似文献
206.
M. MoessnerAuthor VitaeGul N. KhanAuthor Vitae 《Computer Networks》2012,56(1):273-286
Privacy and security concerns inhibit the fast adaption of RFID technology for many applications. A number of authentication protocols that address these concerns have been proposed but real-world solutions that are secure, maintain low communication cost and can be integrated into the ubiquitous EPCglobal Class 1 Generation 2 tag protocol (C1G2) are still needed and being investigated. We present a novel authentication protocol, which offers a high level of security through the combination of a random key scheme with a strong cryptography. The protocol is applicable to resource, power and computationally constraint platforms such as RFID tags. Our investigation shows that it can provide mutual authentication, untraceability, forward and backward security as well as resistance to replay, denial-ofth-service and man-in-the-middle attacks, while retaining a competitive communication cost. The protocol has been integrated into the EPCglobal C1G2 tag protocol, which assures low implementation cost. We also present a successful implementation of our protocol on real-world components such as the INTEL WISP UHF RFID tag and a C1G2 compliant reader. 相似文献
207.
Hyuntae ParkAuthor VitaeHyejeong HongAuthor Vitae Sungho KangAuthor Vitae 《Computer Networks》2012,56(1):231-243
Due to a tremendous increase in internet traffic, backbone routers must have the capability to forward massive incoming packets at several gigabits per second. IP address lookup is one of the most challenging tasks for high-speed packet forwarding. Some high-end routers have been implemented with hardware parallelism using ternary content addressable memory (TCAM). However, TCAM is much more expensive in terms of circuit complexity as well as power consumption. Therefore, efficient algorithmic solutions are essentially required to be implemented using network processors as low cost solutions.Among the state-of-the-art algorithms for IP address lookup, a binary search based on a balanced tree is effective in providing a low-cost solution. In order to construct a balanced search tree, the prefixes with the nesting relationship should be converted into completely disjointed prefixes. A leaf-pushing technique is very useful to eliminate the nesting relationship among prefixes [V. Srinivasan, G. Varghese, Fast address lookups using controlled prefix expansion, ACM Transactions on Computer Systems 17 (1) (1999) 1-40]. However, it creates duplicate prefixes, thus expanding the search tree.This paper proposes an efficient IP address lookup algorithm based on a small balanced tree using entry reduction. The leaf-pushing technique is used for creating the completely disjointed entries. In the leaf-pushed prefixes, there are numerous pairs of adjacent prefixes with similarities in prefix strings and output ports. The number of entries can be significantly reduced by the use of a new entry reduction method which merges pairs with these similar prefixes. After sorting the reduced disjointed entries, a small balanced tree is constructed with a very small node size. Based on this small balanced tree, a native binary search can be effectively used in address lookup issue. In addition, we propose a new multi-way search algorithm to improve a binary search for IPv4 address lookup. As a result, the proposed algorithms offer excellent lookup performance along with reduced memory requirements. Besides, these provide good scalability for large amounts of routing data and for the address migration toward IPv6. Using both various IPv4 and IPv6 routing data, the performance evaluation results demonstrate that the proposed algorithms have better performance in terms of lookup speed, memory requirement and scalability for the growth of entries and IPv6, as compared with other algorithms based on a binary search. 相似文献
208.
We propose an approach for dependence tree structure learning via copula. A nonparametric algorithm for copula estimation is presented. Then a Chow-Liu like method based on dependence measure via copula is proposed to estimate maximum spanning bivariate copula associated with bivariate dependence relations. The main advantage of the approach is that learning with empirical copula focuses on dependence relations among random variables, without the need to know the properties of individual variables as well as without the requirement to specify parametric family of entire underlying distribution for individual variables. Experiments on two real-application data sets show the effectiveness of the proposed method. 相似文献
209.
Xi‐Sheng Zhan Zhi‐Hong Guan Rui‐Quan Liao Fu‐Shun Yuan 《Asian journal of control》2012,14(6):1608-1616
The analysis method of optimal tracking performance is proposed for multiple‐input multiple‐output (MIMO) linear time‐invariant (LTI) systems under disturbance rejection. An H2 criterion of the error signal between the output of the plant and the reference signal is used as a measure for the tracking performance. Spectral factorization is applied to obtain the optimal solution of the system tracking error. The explicit expressions are derived for this minimal tracking error with respect to random reference signals under disturbance rejection. It is shown that the nonminimum phase zeros, the zero direction, the unstable poles, the pole direction of a given plant, statistical characteristics of the reference input signal, and disturbance signal have a negative effect on a feedback system's ability to reduce the system error with disturbance rejection. The results show that the optimal tracking performance will further be damaged because of disturbance rejection. Some typical examples are given to illustrate the theoretical results. 相似文献
210.