全文获取类型
收费全文 | 1863篇 |
免费 | 291篇 |
国内免费 | 174篇 |
专业分类
电工技术 | 94篇 |
综合类 | 192篇 |
化学工业 | 12篇 |
金属工艺 | 7篇 |
机械仪表 | 59篇 |
建筑科学 | 7篇 |
矿业工程 | 6篇 |
能源动力 | 2篇 |
轻工业 | 15篇 |
水利工程 | 8篇 |
石油天然气 | 16篇 |
武器工业 | 9篇 |
无线电 | 622篇 |
一般工业技术 | 82篇 |
冶金工业 | 177篇 |
原子能技术 | 6篇 |
自动化技术 | 1014篇 |
出版年
2024年 | 4篇 |
2023年 | 38篇 |
2022年 | 34篇 |
2021年 | 50篇 |
2020年 | 38篇 |
2019年 | 26篇 |
2018年 | 37篇 |
2017年 | 38篇 |
2016年 | 48篇 |
2015年 | 62篇 |
2014年 | 110篇 |
2013年 | 115篇 |
2012年 | 151篇 |
2011年 | 153篇 |
2010年 | 136篇 |
2009年 | 127篇 |
2008年 | 145篇 |
2007年 | 167篇 |
2006年 | 123篇 |
2005年 | 147篇 |
2004年 | 139篇 |
2003年 | 87篇 |
2002年 | 68篇 |
2001年 | 52篇 |
2000年 | 36篇 |
1999年 | 33篇 |
1998年 | 25篇 |
1997年 | 14篇 |
1996年 | 18篇 |
1995年 | 20篇 |
1994年 | 16篇 |
1993年 | 14篇 |
1992年 | 12篇 |
1991年 | 8篇 |
1990年 | 7篇 |
1989年 | 3篇 |
1988年 | 8篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 3篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 4篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1978年 | 1篇 |
排序方式: 共有2328条查询结果,搜索用时 19 毫秒
1.
2.
Reducing the complexity of distance measurement methods for circular turbo codes that use structured interleavers 下载免费PDF全文
Youssouf Ould‐Cheikh‐Mouhamedou 《International Journal of Communication Systems》2015,28(9):1572-1579
The knowledge of turbo code's minimum Hamming distance (dmin) and its corresponding codeword multiplicity (Amin) is of a great importance because the error correction capability of a code is strongly tied to the values of dmin and Amin. Unfortunately, the computational complexity associated with the search for dmin and Amin can be very high, especially for a turbo code that has high dmin value. This paper introduces some useful properties of turbo codes that use structured interleavers together with circular encoding. These properties allow for a significant reduction of search space and thus reduce significantly the computational complexity associated with the determination of dmin and Amin values. © 2014 The Authors. International Journal of Communication Systems published by John Wiley & Sons, Ltd. 相似文献
3.
ABSTRACTIn recent times, the applications of multimedia are rising in a greedy mode and hence the amount of video transactions is also increasing exponentially. This has shouted great demands on effective models on video encoding and also for reducing the transmission channel congestion. This research work introduces a managing technique termed weighted encoding for High-Efficiency Video Coding (HEVC). HEVC, also termed as MPEG-H Part 2 and H.265 is a video compression standard that is widely utilized AVC (H.264 or MPEG-4 Part 10). When compared to AVC, HEVC grants double the ratio of data compression at a similar level of quality of the video or considerably enhanced video quality at a similar bit rate. This work intends to optimize the weight that adopted in HEVC for encoding. For this, this paper proposes a new Iterative based propagation update in the water wave Optimization Algorithm (IPU-WWO), which is the improved form of Water wave Optimization (WWO). The performance of proposed IPU-WWO is compared over other conventional methods like Artificial Bee Colony (ABC), Firefly (FF), Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) with respect to Peak Signal to Noise Ratio (PSNR). By doing the encoding process, it minimizes the video size with perceptually better quality video or PSNR. 相似文献
4.
5.
目的 快速响应矩阵码(quick response code,QR code)简称二维码,是一种由深色和浅色模块组成的正方形符号。给定输入数据,不同编码算法可能输出不同的位流。位流长度决定了二维码的版本,进而决定了二维码每条边上的模块数量。减小二维码的版本能够在不减小模块大小的前提下节省面积,或者在不改变面积的前提下增大模块大小。为了减小二维码面积、提高二维码识读率,本文提出了位流长度最小化算法。方法 首先,根据二维码位流可以分段切换编码模式的特点,归纳了6种编码状态;然后,根据二维码位流编码标准推导了状态转移关系,从而将位流长度最小化问题转换成动态规划问题;最后,通过求解动态规划问题,计算出最短位流。针对统一资源定位符(uniform resource locator,URL)类型数据,利用其部分字段对大小写不敏感、部分字段可以转义的性质,提出了统一资源定位符的最短位流计算算法,进一步缩短位流。结果 本文构建了一个测试集,包含603个编码了非URL数据的二维码,以及1 679个编码了URL数据的二维码。实验结果表明,本文算法与二维码标准相比,对于非URL测试集,位流长度减小的二维码占比9.1%,版本减小的二维码占比1.2%;对于URL测试集,位流长度减小的二维码占比98.4%,版本减小的二维码占比31.7%。结论 二维码位流长度最小化算法输出的位流长度最短,输出的二维码版本最小,能在兼容标准二维码解码器且不影响纠错能力的前提下提升二维码的数据容量。同时,本文算法运行速度快,易于使用,没有需要调节的参数。 相似文献
6.
This paper considers the state‐dependent interference relay channel (SIRC) in which one of the two users may operate as a secondary user and the relay has a noncausal access to the signals from both users. For discrete memoryless SIRC, we first establish the achievable rate region by carefully merging Han‐Kobayashi rate splitting encoding technique, superposition encoding, and Gelfand‐Pinsker encoding technique. Then, based on the achievable rate region that we derive, the capacity of the SIRC is established in many different scenarios including (a) the weak interference regime, (b) the strong interference regime, and (c) the very strong interference regime. This means that our capacity results contain all available known results in the literature. Next, the achievable rate region and the associated capacity results are also evaluated in the case of additive Gaussian noise. Additionally, many numerical examples are investigated to show the value of our theoretical derivations. 相似文献
7.
This paper shows a secured key-based (k, n) threshold cryptography scheme, where key as well as secret data is shared among set of participants. In this scheme, each share has some bytes missing and these missing bytes can be recovered from a set of exactly k shares, but not less than k. Therefore, each share contains partial secret information which is also encrypted by DNA encoding scheme. Additionally, this paper introduces a concept, where each share information size is varied. More precisely, each share contains a different percentage of secret information and which is strongly dependent on the key. Moreover key sensitivity analysis and statistical analysis prove the robustness against different cryptanalysis attacks and thus ensures high acceptability for information security requirements. 相似文献
8.
9.
High Efficiency Video Coding (HEVC) is a new video coding standard achieving about a 50% bit rate reduction compared to the popular H.264/AVC High Profile with the same subjective reproduced video quality. Better coding efficiency is attained, however, at the cost of significantly increased encoding complexity. Therefore, fast encoding algorithms with little loss in coding efficiency is necessary for HEVC to be successfully adopted for real applications. In this paper we propose a fast encoding technique applicable to HEVC all intra encoding. The proposed fast encoding technique consists of coding unit (CU) search depth prediction, early CU splitting termination, and fast mode decision. In CU search depth prediction, the depth of encoded CU in the current coding tree unit (CTU) is limited to predicted range, which is mostly narrower than the full depth range. Early CU splitting skips mode search of its sub-CUs when rate distortion (RD) cost of current CU is below the estimated RD cost at the current CU depth. RD cost and encoded CU depth distribution of the collocated CTU of the previous frame are utilized both to predict the encoding CU depth search range and to estimate the RD cost for CU splitting termination. Fast mode decision reduces the number of candidate modes for full rate distortion optimized quantization on the basis of the low complexity costs computed in the preceding rough mode decision step. When all these three methods are applied, proposed fast HEVC intra encoding technique reduces the encoding time of the reference encoder by 57% on the average, with only 0.6% of coding efficiency loss in terms of Bjontegaard delta (BD) rate increase under the HEVC common test conditions. 相似文献
10.
In this paper, a strength-based optimum signal detection scheme for binary concentration-encoded molecular communication (CEMC) system has been presented. In CEMC, a single type of information molecule is assumed to carry the information from the transmitting nanomachine (TN), through the propagation medium, to the receiving nanomachine (RN) in the form of received concentration of information molecules at the location of the RN. We consider a pair of nanomachines communicating by means of on–off keying (OOK) transmission protocol in a three-dimensional ideal (i.e. free) diffusion-based unbounded propagation environment. First, based on stochastic chemical kinetics of the reaction events between ligand molecules and receptors, we develop a mathematical receiver model of strength-based detection scheme for OOK CEMC system. Using an analytical approach, we explain the receiver operating characteristic (ROC) curves of the receiver thus developed. Finally, we propose a variable threshold-based detection scheme and explain its communication range and rate dependent characteristics. We show that it provides an improvement in the communication ranges compared to fixed threshold-based detection scheme. (Part of this paper has been peer-reviewed and published in BWCCA-2012 conference in Victoria, BC, 12–14 November, 2012 [20].) 相似文献