全文获取类型
收费全文 | 14692篇 |
免费 | 305篇 |
国内免费 | 155篇 |
专业分类
电工技术 | 197篇 |
综合类 | 10篇 |
化学工业 | 1160篇 |
金属工艺 | 545篇 |
机械仪表 | 144篇 |
建筑科学 | 148篇 |
矿业工程 | 9篇 |
能源动力 | 292篇 |
轻工业 | 490篇 |
水利工程 | 62篇 |
石油天然气 | 28篇 |
无线电 | 929篇 |
一般工业技术 | 1007篇 |
冶金工业 | 603篇 |
原子能技术 | 122篇 |
自动化技术 | 9406篇 |
出版年
2024年 | 9篇 |
2023年 | 55篇 |
2022年 | 93篇 |
2021年 | 181篇 |
2020年 | 122篇 |
2019年 | 154篇 |
2018年 | 217篇 |
2017年 | 219篇 |
2016年 | 199篇 |
2015年 | 119篇 |
2014年 | 394篇 |
2013年 | 537篇 |
2012年 | 997篇 |
2011年 | 3339篇 |
2010年 | 1334篇 |
2009年 | 1206篇 |
2008年 | 828篇 |
2007年 | 732篇 |
2006年 | 589篇 |
2005年 | 670篇 |
2004年 | 624篇 |
2003年 | 664篇 |
2002年 | 339篇 |
2001年 | 58篇 |
2000年 | 56篇 |
1999年 | 103篇 |
1998年 | 224篇 |
1997年 | 135篇 |
1996年 | 112篇 |
1995年 | 80篇 |
1994年 | 65篇 |
1993年 | 58篇 |
1992年 | 60篇 |
1991年 | 55篇 |
1990年 | 45篇 |
1989年 | 39篇 |
1988年 | 40篇 |
1987年 | 47篇 |
1986年 | 33篇 |
1985年 | 35篇 |
1984年 | 49篇 |
1983年 | 40篇 |
1982年 | 26篇 |
1981年 | 28篇 |
1980年 | 22篇 |
1978年 | 18篇 |
1977年 | 17篇 |
1976年 | 20篇 |
1974年 | 13篇 |
1973年 | 10篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
151.
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. 相似文献
152.
153.
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. 相似文献
154.
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. 相似文献
155.
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. 相似文献
156.
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. 相似文献
157.
In this paper, a new approximation to off-line signature verification is proposed based on two-class classifiers using an
expert decisions ensemble. Different methods to extract sets of local and a global features from the target sample are detailed.
Also a normalization by confidence voting method is used in order to decrease the final equal error rate (EER). Each set of
features is processed by a single expert, and on the other approach proposed, the decisions of the individual classifiers
are combined using weighted votes. Experimental results are given using a subcorpus of the large MCYT signature database for
random and skilled forgeries. The results show that the weighted combination outperforms the individual classifiers significantly.
The best EER obtained were 6.3 % in the case of skilled forgeries and 2.31 % in the case of random forgeries. 相似文献
158.
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. 相似文献
159.
Many P2P applications require security services such as privacy, anonymity, authentication, and non-repudiation. Such services could be provided through a hierarchical Public Key Infrastructure. However, P2P networks are usually Internet-scale distributed systems comprised of nodes with an undetermined trust level, thus making hierarchical solutions unrealistic. In this paper, we propose Chord-PKI, a distributed PKI architecture which is build upon the Chord overlay network, in order to provide security services for P2P applications. Our solution distributes the functionality of a PKI across the peers by using threshold cryptography and proactive updating. We analyze the security of the proposed infrastructure and through simulations we evaluate its performance for various scenarios of untrusted node distributions. 相似文献
160.
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. 相似文献