全文获取类型
收费全文 | 109948篇 |
免费 | 3295篇 |
国内免费 | 1468篇 |
学科分类
工业技术 | 114711篇 |
出版年
2024年 | 140篇 |
2023年 | 530篇 |
2022年 | 880篇 |
2021年 | 1242篇 |
2020年 | 978篇 |
2019年 | 771篇 |
2018年 | 15124篇 |
2017年 | 14275篇 |
2016年 | 10733篇 |
2015年 | 1709篇 |
2014年 | 1525篇 |
2013年 | 1795篇 |
2012年 | 4801篇 |
2011年 | 11191篇 |
2010年 | 9788篇 |
2009年 | 6974篇 |
2008年 | 8142篇 |
2007年 | 9058篇 |
2006年 | 1420篇 |
2005年 | 2449篇 |
2004年 | 1909篇 |
2003年 | 1831篇 |
2002年 | 1121篇 |
2001年 | 591篇 |
2000年 | 711篇 |
1999年 | 685篇 |
1998年 | 639篇 |
1997年 | 494篇 |
1996年 | 552篇 |
1995年 | 422篇 |
1994年 | 358篇 |
1993年 | 273篇 |
1992年 | 216篇 |
1991年 | 195篇 |
1990年 | 124篇 |
1989年 | 102篇 |
1988年 | 108篇 |
1987年 | 66篇 |
1986年 | 45篇 |
1985年 | 33篇 |
1968年 | 43篇 |
1967年 | 33篇 |
1966年 | 42篇 |
1965年 | 44篇 |
1959年 | 38篇 |
1958年 | 38篇 |
1957年 | 36篇 |
1956年 | 34篇 |
1955年 | 63篇 |
1954年 | 68篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
991.
Benjamin Aziz 《Journal of Grid Computing》2016,14(3):477-493
This paper presents an abstract specification of an enforcement mechanism of usage control for Grids, and verifies formally that such mechanism enforces UCON policies. Our technique is based on KAOS, a goal-oriented requirements engineering methodology with a formal LTL-based language and semantics. KAOS is used in a bottom-up form. We abstract the specification of the enforcement mechanism from current implementations of usage control for Grids. The result of this process is agent and operation models that describe the main components and operations of the enforcement mechanism. KAOS is used in top-down form by applying goal-refinement in order to refine UCON policies. The result of this process is a goal-refinement tree, which shows how a goal (policy) can be decomposed into sub-goals. Verification that a policy can be enforced is then equivalent to prove that a goal can be implemented by the enforcement mechanism represented by the agent and operation models. 相似文献
992.
Juan Gutierrez-Aguado Jose M. Alcaraz Calero Wladimiro Diaz Villanueva 《Journal of Grid Computing》2016,14(2):283-297
Monitoring of cloud computing infrastructures is an imperative necessity for cloud providers and administrators to analyze, optimize and discover what is happening in their own infrastructures. Current monitoring solutions do not fit well for this purpose mainly due to the incredible set of new requirements imposed by the particular requirements associated to cloud infrastructures. This paper describes in detail the main reasons why current monitoring solutions do not work well. Also, it provides an innovative monitoring architecture that enables the monitoring of the physical and virtual machines available within a cloud infrastructure in a non-invasive and transparent way making it suitable not only for private cloud computing but also for public cloud computing infrastructures. This architecture has been validated by means of a prototype integrating an existing enterprise-class monitoring solution, Nagios, with the control and data planes of OpenStack, a well-known stack for cloud infrastructures. As a result, our new monitoring architecture is able to extend the exiting Nagios functionalities to fit in the monitoring of cloud infrastructures. The proposed architecture has been designed, implemented and released as open source to the scientific community. The proposal has also been empirically validated in a production-level cloud computing infrastructure running a test bed with up to 128 VMs where overhead and responsiveness has been carefully analyzed. 相似文献
993.
Yongsheng Tang Shixin Zhu Xiaoshan Kai Jian Ding 《Quantum Information Processing》2016,15(11):4489-4500
Let \(R=\mathbb {F}_{2^{m}}+u\mathbb {F}_{2^{m}}+\cdots +u^{k}\mathbb {F}_{2^{m}}\), where \(\mathbb {F}_{2^{m}}\) is the finite field with \(2^{m}\) elements, m is a positive integer, and u is an indeterminate with \(u^{k+1}=0.\) In this paper, we propose the constructions of two new families of quantum codes obtained from dual-containing cyclic codes of odd length over R. A new Gray map over R is defined, and a sufficient and necessary condition for the existence of dual-containing cyclic codes over R is given. A new family of \(2^{m}\)-ary quantum codes is obtained via the Gray map and the Calderbank–Shor–Steane construction from dual-containing cyclic codes over R. In particular, a new family of binary quantum codes is obtained via the Gray map, the trace map and the Calderbank–Shor–Steane construction from dual-containing cyclic codes over R. 相似文献
994.
David Hocker Yicong Zheng Robert Kosut Todd Brun Herschel Rabitz 《Quantum Information Processing》2016,15(11):4361-4390
There is a rich variety of physics underlying the fundamental gating operations for quantum information processing (QIP). A key aspect of a QIP system is how noise may enter during quantum operations and how suppressing or correcting its effects can best be addressed. Quantum control techniques have been developed to specifically address this effort, although a detailed classification of the compatibility of controls schemes with noise sources found in common quantum systems has not yet been performed. This work numerically examines the performance of modern control methods for suppressing decoherence in the presence of noise forms found in viable quantum systems. The noise-averaged process matrix for controlled one-qubit and two-qubit operations are calculated across noise found in systems driven by Markovian open quantum dynamics. Rather than aiming to describe the absolute best control scheme for a given physical circumstance, this work serves instead to classify quantum control behavior across a large class of noise forms so that opportunities for improving QIP performance may be identified. 相似文献
995.
In this work, we present a method of decomposition of arbitrary unitary matrix \(U\in \mathbf {U}(2^k)\) into a product of single-qubit negator and controlled-\(\sqrt{\text{ NOT }}\) gates. Since the product results with negator matrix, which can be treated as complex analogue of bistochastic matrix, our method can be seen as complex analogue of Sinkhorn–Knopp algorithm, where diagonal matrices are replaced by adding and removing an one-qubit ancilla. The decomposition can be found constructively, and resulting circuit consists of \(O(4^k)\) entangling gates, which is proved to be optimal. An example of such transformation is presented. 相似文献
996.
In quantum key distribution (QKD), the information theoretically secure authentication is necessary to guarantee the integrity and authenticity of the exchanged information over the classical channel. In order to reduce the key consumption, the authentication scheme with key recycling (KR), in which a secret but fixed hash function is used for multiple messages while each tag is encrypted with a one-time pad (OTP), is preferred in QKD. Based on the assumption that the OTP key is perfect, the security of the authentication scheme has be proved. However, the OTP key of authentication in a practical QKD system is not perfect. How the imperfect OTP affects the security of authentication scheme with KR is analyzed thoroughly in this paper. In a practical QKD, the information of the OTP key resulting from QKD is partially leaked to the adversary. Although the information leakage is usually so little to be neglected, it will lead to the increasing degraded security of the authentication scheme as the system runs continuously. Both our theoretical analysis and simulation results demonstrate that the security level of authentication scheme with KR, mainly indicated by its substitution probability, degrades exponentially in the number of rounds and gradually diminishes to zero. 相似文献
997.
We explore an efficient scheme for transferring quantum state between an optomechanical cavity and nuclear spins of nitrogen-vacancy centers in diamond, where quantum information can be efficiently stored (retrieved) into (from) the nuclear spin ensemble assisted by a mechanical resonator in a dispersive regime. Our scheme works for a broad range of cavity frequencies and might have potential applications in employing the nuclear spin ensemble as a memory in quantum information processing. The feasibility of our protocol is analyzed using currently available parameters. 相似文献
998.
Hiromichi Ohno 《Quantum Information Processing》2016,15(9):3599-3617
This study investigates unitary equivalent classes of one-dimensional quantum walks. We prove that one-dimensional quantum walks are unitary equivalent to quantum walks of Ambainis type and that translation-invariant one-dimensional quantum walks are Szegedy walks. We also present a necessary and sufficient condition for a one-dimensional quantum walk to be a Szegedy walk. 相似文献
999.
1000.
Sibang Liu Shuzhi Sam Ge Zhongliang Tang 《International Journal of Control, Automation and Systems》2016,14(4):924-938
This paper presents a modular designed autonomous bolt tightening shaft system with an adaptive fuzzy backstepping control approach developed for it. The bolt tightening shaft is designed for the autonomous bolt tightening operation, which has huge potential for industry application. Due to the inherent nonlinear and uncertain properties, the bolt tightening shaft and the bolt tightening process are mathematically modeled as an uncertain strict feedback system. With the adaptive backstepping and approximation property of fuzzy logic system, the controller is recursively designed. Based on the Lyapunov stability theorem, all signals in the closed-loop system are proved to be uniformly ultimately bounded and the torque tracking error exponentially converges to a small residue. And the effectiveness and performance of the proposed autonomous system are verified by the simulation and experiment results on the bolt tightening shaft system. 相似文献