全文获取类型
收费全文 | 8402篇 |
免费 | 910篇 |
国内免费 | 260篇 |
专业分类
化学 | 1047篇 |
晶体学 | 7篇 |
力学 | 630篇 |
综合类 | 87篇 |
数学 | 2643篇 |
物理学 | 1356篇 |
无线电 | 3802篇 |
出版年
2024年 | 26篇 |
2023年 | 125篇 |
2022年 | 234篇 |
2021年 | 267篇 |
2020年 | 235篇 |
2019年 | 167篇 |
2018年 | 194篇 |
2017年 | 280篇 |
2016年 | 280篇 |
2015年 | 294篇 |
2014年 | 519篇 |
2013年 | 510篇 |
2012年 | 496篇 |
2011年 | 526篇 |
2010年 | 410篇 |
2009年 | 518篇 |
2008年 | 561篇 |
2007年 | 594篇 |
2006年 | 489篇 |
2005年 | 398篇 |
2004年 | 344篇 |
2003年 | 312篇 |
2002年 | 258篇 |
2001年 | 199篇 |
2000年 | 171篇 |
1999年 | 160篇 |
1998年 | 161篇 |
1997年 | 110篇 |
1996年 | 114篇 |
1995年 | 76篇 |
1994年 | 75篇 |
1993年 | 73篇 |
1992年 | 58篇 |
1991年 | 44篇 |
1990年 | 38篇 |
1989年 | 26篇 |
1988年 | 37篇 |
1987年 | 22篇 |
1986年 | 25篇 |
1985年 | 24篇 |
1984年 | 33篇 |
1983年 | 9篇 |
1982年 | 16篇 |
1981年 | 14篇 |
1980年 | 10篇 |
1979年 | 10篇 |
1978年 | 9篇 |
1977年 | 10篇 |
1976年 | 6篇 |
1974年 | 2篇 |
排序方式: 共有9572条查询结果,搜索用时 183 毫秒
1.
This paper introduces the design of a hardware efficient reconfigurable pseudorandom number generator (PRNG) using two different feedback controllers based four-dimensional (4D) hyperchaotic systems i.e. Hyperchaotic-1 and -2 to provide confidentiality for digital images. The parameter's value of these two hyperchaotic systems is set to be a specific value to get the benefits i.e. all the multiplications (except a few multiplications) are performed using hardwired shifting operations rather than the binary multiplications, which doesn't utilize any hardware resource. The ordinary differential equations (ODEs) of these two systems have been exploited to build a generic architecture that fits in a single architecture. The proposed architecture provides an opportunity to switch between two different 4D hyperchaotic systems depending on the required behavior. To ensure the security strength, that can be also used in the encryption process in which encrypt the input data up to two times successively, each time using a different PRNG configuration. The proposed reconfigurable PRNG has been designed using Verilog HDL, synthesized on the Xilinx tool using the Virtex-5 (XC5VLX50T) and Zynq (XC7Z045) FPGA, its analysis has been done using Matlab tool. It has been found that the proposed architecture of PRNG has the best hardware performance and good statistical properties as it passes all fifteen NIST statistical benchmark tests while it can operate at 79.101-MHz or 1898.424-Mbps and utilize only 0.036 %, 0.23 %, and 1.77 % from the Zynq (XC7Z045) FPGA's slice registers, slice LUTs, and DSP blocks respectively. Utilizing these PRNGs, we design two 16 × 16 substitution boxes (S-boxes). The proposed S-boxes fulfill the following criteria: Bijective, Balanced, Non-linearity, Dynamic Distance, Strict Avalanche Criterion (SAC) and BIC non-linearity criterion. To demonstrate these PRNGs and S-boxes, a new three different scheme of image encryption algorithms have been developed: a) Encryption using S-box-1, b) Encryption using S-box-2 and, c) Two times encryption using S-box-1 and S-box-2. To demonstrate that the proposed cryptosystem is highly secure, we perform the security analysis (in terms of the correlation coefficient, key space, NPCR, UACI, information entropy and image encryption quantitatively in terms of (MSE, PSNR and SSIM)). 相似文献
2.
Xiaopo Wu Yangming Shi Weibo Meng Xiaofei Ma Nian Fang 《International Journal of Satellite Communications and Networking》2019,37(3):283-291
Electromagnetic signal emitted by satellite communication (satcom) transmitters are used to identify specific individual uplink satcom terminals sharing the common transponder in real environment, which is known as specific emitter identification (SEI) that allows for early indications and warning (I&W) of the targets carrying satcom furnishment and furthermore the real time electromagnetic situation awareness in military operations. In this paper, the authors are the first to propose the identification of specific transmitters of satcom by using probabilistic neural networks (PNN) to reach the goal of target recognition. We have been devoted to the examination by exploring the feasibility of utilizing the Hilbert transform to signal preprocessing, applying the discrete wavelet transform to feature extraction, and employing the PNN to perform the classification of stationary signals. There are a total of 1000 sampling time series with binary phase shift keying (BPSK) modulation originated by five types of satcom transmitters in the test. The established PNNs classifier implements the data testing and finally yields satisfactory accuracy at 8 dB(±1 dB) carrier to noise ratio, which indicates the feasibility of our method, and even the keen insight of its application in military. 相似文献
3.
当前锂离子动力电池电化学模型存在模型复杂、建模难度大、计算效率低、老化评估效果差的问题,本文提出一种考虑电池衰退老化的机理模型(ADME).本文首先通过有限差分法对伪二维(P2D)电化学模型进行离散降阶处理,得到简化伪二维(SP2D)模型.在SP2D模型的基础上,基于阴阳两极发生的副反应导致的衰退老化现象,提出一种考虑电池衰退老化的机理模型.其次,使用多变量偏差补偿最小二乘法实现模型参数辨识.最后通过动力电池衰退老化性能循环实验,对比分析了恒流、脉冲工况下SP2D模型和ADME模型的终端电压输出.结果表明:ADME模型较为简单、计算效率和估算精度高,可以有效评估电池容量老化衰退,得到理想的锂离子动力电池外特性曲线. 相似文献
4.
The identification rate of UHF RFID system was restricted by multipath propagation effects.The system identification performance was studied considering the correlation coefficient between forward and reverse channels.Based on the generalized Rician fading channel model,the analytical expression of identification rate was derived under independent,full correlation and correlation cases.Compared with the existing analysis,the proposed uniform calculation formula of identification rate was for any correlation coefficient and kinds of channel conditions.The numerical computation and Monte-carlo simulations show that the influences of different correlation coefficients,channel conditions,sensitivity and distance on the identification rate. 相似文献
5.
Studies on metabolism of total glucosides of paeony from Paeoniae Radix Alba in rats by UPLC‐Q‐TOF‐MS/MS
下载免费PDF全文
![点击此处可从《Biomedical chromatography : BMC》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Wenli Cao Xinguo Wang Haojie Li Xuliang Shi Wencheng Fan Shaohua Zhao Minyan Liu Liying Niu 《Biomedical chromatography : BMC》2015,29(11):1769-1779
Total glucosides of paeony are the active constituents of Paeoniae Radix Alba. In this study, a novel strategy was proposed to find more metabolites and the differences between paeoniflorin, albiflorin and total glucosides of paeony (TGP). This strategy was characterized as follows: firstly, the animals were divided into three groups (paeoniflorin, albiflorin and TGP) to identify the source of TGP metabolites from paeoniflorin or albiflorin; secondly, a generic information‐dependent acquisition scan for the low‐level metabolites was triggered by the multiple mass defect filter and dynamic background subtraction; thirdly, the metabolites were identified with a combination of data‐processing methods including mass defect filtering, neutral loss filtering and product ion filtering; finally, a comparative study was used in the metabolism of paeoniflorin, albiflorin and TGP. Based on the strategy, 18 metabolites of TGP, 10 metabolites of paeoniflorin and 13 metabolites of albiflorin were identified respectively. The results indicated that the hydrolysis, conjugation reaction and oxidization were the major metabolic pathways, and the metabolic sites were the glycosidic linkage, the ester bond and the benzene ring. This study is first to explore the metabolism of TGP, and these findings enhance our understanding of the metabolism and the interactions of paeoniflrin and albiflorin in TGP. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
6.
Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a
given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred
to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional
(resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional
(resp., unidirectional) topology is k-edge connected.
The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied
by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18],
which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19],
which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity.
In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity,
and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity
and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for
distributed implementation.
A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless
(Adhoc-Now 2003).
Research performed in part while visiting the Max-Plank-Institut fur Informatik.
Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting
researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University
of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms.
Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor
since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and
Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990.
His research interests include optical networks and wireless networks. 相似文献
7.
论文指出了文献[1]中的零知识证明协议在公钥参数选取上的安全漏洞,并从求解离散对数的角度进行了分析证明。然后吸取了DSA数字签名算法中安全密钥选取高效简单的优点,提出了一种比Schnorr身份识别方案快1/3的简单、安全、高效的零知识证明身份识别方案。 相似文献
8.
论文在对现有一类典型图像混沌加密算法的分析基础上,提出了一种改进的图像混沌加密算法。该算法引入小波变换,可以有效地克服一些混沌加密算法不能抵御已知/选择明文攻击的缺陷。 相似文献
9.
10.
一种基于m序列的图像随机加密与实时传输方案 总被引:1,自引:0,他引:1
提出了一种基于m序列的图像随机加密与实时传输方案。在加密时用m序列构造的相位函数取代了双相位输码方法中用作密钥的随机相位掩模,极大地压缩了密钥的数据量,使密钥的传送更加方便快捷。并在前有基础上加以改进,可以轻松地加密彩色图像。在完成加密后,可实时地在网络上传送加密图像,在接收端进行解密。最后进行了计算机模拟实验,实验结果表明该方案是可行的,并且易于实际应用。 相似文献