全文获取类型
收费全文 | 85840篇 |
免费 | 1028篇 |
国内免费 | 407篇 |
专业分类
电工技术 | 798篇 |
综合类 | 2316篇 |
化学工业 | 11885篇 |
金属工艺 | 4846篇 |
机械仪表 | 3052篇 |
建筑科学 | 2282篇 |
矿业工程 | 586篇 |
能源动力 | 1150篇 |
轻工业 | 3782篇 |
水利工程 | 1282篇 |
石油天然气 | 354篇 |
无线电 | 9359篇 |
一般工业技术 | 16622篇 |
冶金工业 | 3071篇 |
原子能技术 | 293篇 |
自动化技术 | 25597篇 |
出版年
2020年 | 26篇 |
2019年 | 33篇 |
2018年 | 14477篇 |
2017年 | 13407篇 |
2016年 | 9984篇 |
2015年 | 646篇 |
2014年 | 279篇 |
2013年 | 365篇 |
2012年 | 3204篇 |
2011年 | 9490篇 |
2010年 | 8351篇 |
2009年 | 5606篇 |
2008年 | 6856篇 |
2007年 | 7849篇 |
2006年 | 203篇 |
2005年 | 1277篇 |
2004年 | 1203篇 |
2003年 | 1247篇 |
2002年 | 588篇 |
2001年 | 134篇 |
2000年 | 220篇 |
1999年 | 98篇 |
1998年 | 93篇 |
1997年 | 59篇 |
1996年 | 81篇 |
1995年 | 33篇 |
1994年 | 42篇 |
1993年 | 48篇 |
1992年 | 44篇 |
1991年 | 42篇 |
1988年 | 37篇 |
1986年 | 26篇 |
1985年 | 33篇 |
1984年 | 35篇 |
1981年 | 33篇 |
1977年 | 32篇 |
1976年 | 26篇 |
1969年 | 38篇 |
1968年 | 50篇 |
1967年 | 47篇 |
1966年 | 48篇 |
1965年 | 50篇 |
1963年 | 41篇 |
1960年 | 33篇 |
1959年 | 47篇 |
1958年 | 41篇 |
1957年 | 43篇 |
1956年 | 35篇 |
1955年 | 70篇 |
1954年 | 68篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
851.
The original measurement device-independent quantum key distribution is reviewed, and a modified protocol using heralded pair coherent state (HPCS) is proposed to overcome the quantum bit error rate associated with the dark count rate of the detectors in long-distance quantum key distribution. Our simulation indicates that the secure transmission distance can be improved evidently with HPCS owing to the lower probability of vacuum events when compared with weak coherent source scenario, while the secure key rate can be increased with HPCS due to the higher probability of single-photon events when compared with heralded single-photon source scenario. Furthermore, we apply the finite key analysis to the decoy state MDI-QKD with HPCS and obtain a practical key rate. 相似文献
852.
Andrei Tchernykh Luz Lozano Uwe Schwiegelshohn Pascal Bouvry Johnatan E. Pecero Sergio Nesmachnow Alexander Yu. Drozdov 《Journal of Grid Computing》2016,14(1):5-22
This paper focuses on a bi-objective experimental evaluation of online scheduling in the Infrastructure as a Service model of Cloud computing regarding income and power consumption objectives. In this model, customers have the choice between different service levels. Each service level is associated with a price per unit of job execution time, and a slack factor that determines the maximal time span to deliver the requested amount of computing resources. The system, via the scheduling algorithms, is responsible to guarantee the corresponding quality of service for all accepted jobs. Since we do not consider any optimistic scheduling approach, a job cannot be accepted if its service guarantee will not be observed assuming that all accepted jobs receive the requested resources. In this article, we analyze several scheduling algorithms with different cloud configurations and workloads, considering the maximization of the provider income and minimization of the total power consumption of a schedule. We distinguish algorithms depending on the type and amount of information they require: knowledge free, energy-aware, and speed-aware. First, to provide effective guidance in choosing a good strategy, we present a joint analysis of two conflicting goals based on the degradation in performance. The study addresses the behavior of each strategy under each metric. We assess the performance of different scheduling algorithms by determining a set of non-dominated solutions that approximate the Pareto optimal set. We use a set coverage metric to compare the scheduling algorithms in terms of Pareto dominance. We claim that a rather simple scheduling approach can provide the best energy and income trade-offs. This scheduling algorithm performs well in different scenarios with a variety of workloads and cloud configurations. 相似文献
853.
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. 相似文献
854.
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. 相似文献
855.
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. 相似文献
856.
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. 相似文献
857.
We derive a dynamical bound on the propagation of correlations in local random quantum circuits—lattice spin systems where piecewise quantum operations—in space and time—occur with classical probabilities. Correlations are quantified by the Frobenius norm of the commutator of two positive operators acting on disjoint regions of a one-dimensional circular chain of length L. For a time \(t=O(L)\), correlations spread ballistically to spatial distances \(\mathcal {D}=t\), growing at best, diffusively with time for any distance within that radius with extensively suppressed distance- dependent corrections. For \(t=\varOmega (L^2)\), all parts of the system get almost equally correlated with exponentially suppressed distance- dependent corrections and approach the maximum amount of correlations that may be established asymptotically. 相似文献
858.
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. 相似文献
859.
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. 相似文献
860.
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. 相似文献