全文获取类型
收费全文 | 5983篇 |
免费 | 807篇 |
国内免费 | 708篇 |
专业分类
电工技术 | 441篇 |
综合类 | 726篇 |
化学工业 | 141篇 |
金属工艺 | 49篇 |
机械仪表 | 210篇 |
建筑科学 | 279篇 |
矿业工程 | 87篇 |
能源动力 | 110篇 |
轻工业 | 39篇 |
水利工程 | 231篇 |
石油天然气 | 147篇 |
武器工业 | 73篇 |
无线电 | 1035篇 |
一般工业技术 | 283篇 |
冶金工业 | 98篇 |
原子能技术 | 39篇 |
自动化技术 | 3510篇 |
出版年
2024年 | 10篇 |
2023年 | 84篇 |
2022年 | 78篇 |
2021年 | 116篇 |
2020年 | 137篇 |
2019年 | 147篇 |
2018年 | 120篇 |
2017年 | 162篇 |
2016年 | 164篇 |
2015年 | 209篇 |
2014年 | 297篇 |
2013年 | 343篇 |
2012年 | 387篇 |
2011年 | 458篇 |
2010年 | 369篇 |
2009年 | 434篇 |
2008年 | 471篇 |
2007年 | 558篇 |
2006年 | 450篇 |
2005年 | 399篇 |
2004年 | 332篇 |
2003年 | 300篇 |
2002年 | 247篇 |
2001年 | 171篇 |
2000年 | 145篇 |
1999年 | 133篇 |
1998年 | 108篇 |
1997年 | 117篇 |
1996年 | 105篇 |
1995年 | 71篇 |
1994年 | 89篇 |
1993年 | 58篇 |
1992年 | 40篇 |
1991年 | 43篇 |
1990年 | 19篇 |
1989年 | 23篇 |
1988年 | 20篇 |
1987年 | 14篇 |
1986年 | 4篇 |
1985年 | 13篇 |
1984年 | 9篇 |
1983年 | 6篇 |
1982年 | 6篇 |
1981年 | 7篇 |
1980年 | 5篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1976年 | 3篇 |
1974年 | 3篇 |
1962年 | 2篇 |
排序方式: 共有7498条查询结果,搜索用时 31 毫秒
1.
Oblivious polynomial evaluation (OPE) is a two-party protocol that allows a receiver, R to learn an evaluation f(α), of a sender, S's polynomial f(x), whilst keeping both α and f(x) private. This protocol has attracted a lot of attention recently, as it has wide ranging applications in the field of cryptography.
In this article we review some of these applications and, additionally, take an in-depth look at the special case of information theoretic OPE. Specifically, we provide a current and critical review of the existing information theoretic OPE protocols in the literature. We divide these protocols into two distinct cases (three-party and distributed OPE) allowing for the easy distinction and classification of future information theoretic OPE protocols. In addition to this work, we also develop several modifications and extensions to existing schemes, resulting in increased security, flexibility and efficiency. Lastly, we also identify a security flaw in a previously published OPE scheme. 相似文献
2.
本文介绍了无证书签名的基本工作原理,介绍并分析了Hashimoto等人提出的一种无证书签名方案,对该方案进行了Ⅰ类型攻击,证明了该方案是不安全的,不能抵御超Ⅰ类型对手的攻击,对该方案提出了改进措施。 相似文献
3.
In this paper, we first re-examine the previous protocol of controlled quantum secure direct communication of Zhang et al.’s scheme, which was found insecure under two kinds of attacks, fake entangled particles attack and disentanglement attack. Then, by changing the party of the preparation of cluster states and using unitary operations, we present an improved protocol which can avoid these two kinds of attacks. Moreover, the protocol is proposed using the three-qubit partially entangled set of states. It is more efficient by only using three particles rather than four or even more to transmit one bit secret information. Given our using state is much easier to prepare for multiqubit states and our protocol needs less measurement resource, it makes this protocol more convenient from an applied point of view. 相似文献
4.
随着无源光网络的发展,光纤-无线网络能同时支持集中式云和边缘云计算技术,成为一种具有发展前景的网络结构。但是,现有的基于光纤-无线网络的任务协同计算卸载研究主要以最小化移动设备的能耗为目标,忽略了实时性高的任务的需求。针对实时性高的任务,提出了以最小化任务的总处理时间为目标的集中式云和边缘云协同计算卸载问题,并对其进行形式化描述。同时,通过将该问题归约为装箱问题,从而证明其为NP难解问题。提出一个启发式协同计算卸载算法,该算法通过比较不同卸载策略的任务处理时间,优先选择时间最短的任务卸载策略。同时,提出一个定制的遗传算法,获得一个更优的任务卸载策略。实验结果表明,与现有的算法相比,本文提出的启发式算法得到的任务卸载策略平均减少4.34%的任务总处理时间,而定制的遗传算法的卸载策略平均减少18.41%的任务总处理时间。同时,定制的遗传算法的卸载策略与本文提出的启发式算法相比平均减少14.49%的任务总处理时间。 相似文献
5.
6.
智能感知技术是数字化的关键技术之一,是能源互联网的基础技术。在当前数字化进程深入推动能源革命的背景下,智能感知技术已成为能源互联网建设与发展的数字引擎。文章总结了能源互联网框架下智能感知技术的战略背景、业务需求及重要意义,通过分析当前存在的问题,详细阐述了智能感知技术理论及发展趋势,梳理智能感知核心技术框架,提出系统性技术标准体系,并给出了能源互联网“源-网-荷-储”智能感知应用布局,最后结合我国能源互联网发展现状,对智能感知建设路径与发展方向进行了探讨与展望。 相似文献
7.
8.
Colors can be characterized by three main attributes: hue, value, and saturation. But colors also exhibit other phenomenological qualities. In this study, we identify one such secondary attribute of color: perceived density. We discuss the prevalence of dense colors in Japan starting from the “48 Teas and 100 Mice” colors of the Edo period, and develop the concept of perceived density through this aspect of Japanese color preference. When vivid colors were forbidden to commoners during the Edo period, subtle variations of brownish and grayish colors were created. These colors with base tones were not salient, yet they looked dense. Muted colors with paradoxical richness are still common in Japan today. Japanese commodity design often uses muddy colors with white or gray undertones, and deep colors with black undertones. Together they form distinct groupings of relatively dense color. The perceived density of color corresponds to how dense and filled, or thin and airy a color appears. Colors of higher perceived density appear to be more packed and to have mass. Perceived density of color is unusual in that it does not have a monotonic relationship with one of the primary perceptual attributes. High apparent density is observed in a central region of an equi‐hue plane where value or saturation are at intermediate values. We consider two possible explanations of how high values of density can coincide with middling values of value and saturation: characteristics of the spectral reflectance curves, or the complexity of the neural signals that underlie the emergent property. 相似文献
9.
Bingbing JIANG 《Frontiers of Computer Science》2022,16(1):161809
López-Alt et al.(STOC12)put forward a primitive called multi-key fully homomorphic encryption(MKFHE),in which each involved party encrypts their own data using keys that are independently and randomly chosen whereby arbitrary computations can be performed on these encrypted data by a final collector.Subsequently,several superior schemes based on the standard assumption(LWE)were proposed.Most of these schemes were constructed by expanding a fresh GSW-ciphertext or BGV-ciphertext under a single key to a new same-type ciphertext of the same message under a combination of associated parties’keys.Therefore,the new ciphertext’s size grew more or less linearly with an increase in the number of parties.In this paper,we proposed a novel and simple scheme of MKFHE based on LWE without increasing the size of the ciphertext in the two non-collusion server model.In other words,each party first independently shares their own data between two servers and each server only needs a one-round communication with another to construct a ciphertext of the same plaintext under a sum of associated parties’keys.Our new ciphertext under multiple keys has the same size as that of the original one with only one-round communication between two servers.The communication complexity is O(kmlogq)-bit,where k is the number of input ciphertexts involved,m is the size of a GSW-ciphertext and q is a modulus.In conclusion,we proved that our scheme is CPA-secure against semi-honest adversaries. 相似文献
10.