全文获取类型
收费全文 | 124251篇 |
免费 | 14004篇 |
国内免费 | 8889篇 |
专业分类
电工技术 | 11187篇 |
技术理论 | 8篇 |
综合类 | 11378篇 |
化学工业 | 16631篇 |
金属工艺 | 7883篇 |
机械仪表 | 8317篇 |
建筑科学 | 10178篇 |
矿业工程 | 4480篇 |
能源动力 | 3639篇 |
轻工业 | 11297篇 |
水利工程 | 3547篇 |
石油天然气 | 5113篇 |
武器工业 | 1577篇 |
无线电 | 13917篇 |
一般工业技术 | 12239篇 |
冶金工业 | 4905篇 |
原子能技术 | 2015篇 |
自动化技术 | 18833篇 |
出版年
2024年 | 739篇 |
2023年 | 2313篇 |
2022年 | 5081篇 |
2021年 | 6511篇 |
2020年 | 4828篇 |
2019年 | 3535篇 |
2018年 | 3920篇 |
2017年 | 4337篇 |
2016年 | 3993篇 |
2015年 | 5840篇 |
2014年 | 7232篇 |
2013年 | 8612篇 |
2012年 | 10020篇 |
2011年 | 10513篇 |
2010年 | 9315篇 |
2009年 | 8984篇 |
2008年 | 8831篇 |
2007年 | 8447篇 |
2006年 | 7571篇 |
2005年 | 6187篇 |
2004年 | 4384篇 |
2003年 | 3034篇 |
2002年 | 2786篇 |
2001年 | 2368篇 |
2000年 | 2077篇 |
1999年 | 1365篇 |
1998年 | 843篇 |
1997年 | 659篇 |
1996年 | 632篇 |
1995年 | 455篇 |
1994年 | 372篇 |
1993年 | 293篇 |
1992年 | 247篇 |
1991年 | 159篇 |
1990年 | 141篇 |
1989年 | 109篇 |
1988年 | 88篇 |
1987年 | 59篇 |
1986年 | 50篇 |
1985年 | 40篇 |
1984年 | 20篇 |
1983年 | 22篇 |
1982年 | 24篇 |
1981年 | 17篇 |
1980年 | 19篇 |
1979年 | 16篇 |
1976年 | 9篇 |
1975年 | 3篇 |
1959年 | 20篇 |
1951年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
991.
信任是保证在线服务质量的前提。针对电子商务环境存在的复杂性、模糊性和不确定性等因素,引入直觉模糊理论,提出了一种多维集成直觉模糊信息的信任评价方法,给出了两类信任反馈属性集成直觉模糊信息的方法,通过直觉模糊熵确定属性权重,并利用直觉加权算数平均算子求出实体的综合直觉模糊数,从而全面、客观和细腻地反映信任的模糊性和不确定性。计算实例和仿真实验表明,基于多维集成直觉模糊信息的信任评估方法是可行的,通过对风险偏好因子的灵敏度分析,发现服务请求者风险偏好不同,则评估的服务提供商的信任得分也不同;同时也验证了该方法可以有效地抑制恶意节点的攻击,为电子商务环境下信任评价的研究提供了新思路。 相似文献
992.
本文围绕低截获概率雷达信号处理的特点和实时性的要求,设计了基于FPGA和DSP传统组合模式的LPI雷达信号检测处理平台。在一款基于Keystone构架的多核DSP处理板上,创新性地运用并行关联流水线体系结构和多层任务调度分配信号处理机制,构建了针对LPI雷达信号从预处理到检测结果输出的一整套信号处理模型。经过仿真实验验证,该信号处理模型适合在低信噪比条件下对LPI雷达信号进行检测,且系统资源分配合理占用逻辑资源少,具有实时检测LPI雷达信号的潜力。 相似文献
993.
994.
In this paper, we explore the issue of static routing and spectrum/IT resource assignment (RSIA) of elastic all-optical switched intra-datacenter networks (intra-DCNs) by proposing anycast- and manycast-based integer linear programming (ILP) models. The objective is to jointly optimize the DCN resources, i.e., network transmission bandwidth and IT resources, under different situations. First, for given service-request matrices with unknown network transmission bandwidth and IT resources, we propose anycast and manycast ILP models to minimize the maximum numbers of required network and IT resources to accommodate all the service requests. For anycast RSIA issue, we proposed two different ILP models that are based on node-arc and link-path methods, respectively. Node-arc based manycast ILP model is also proposed for the first time to our knowledge. Second, for given network transmission bandwidth and IT resources and known service-request matrices, we propose node-arc based anycast ILP models to maximize the total number of successfully served service requests. To evaluate the efficiency of anycast and manycast models, all proposed ILP models are evaluated and compared with unicast ILP models. Simulation results show that anycast and manycast ILP models perform much better in efficiently using DCN resources and successfully accommodating more service requests when compared to unicast ILP models under the same network conditions. 相似文献
995.
Auto-focus is very important for capturing sharp human face centered images in digital and smart phone cameras. With the development of image sensor technology, these cameras support more and more highresolution images to be processed. Currently it is difficult to support fast auto-focus at low power consumption on high-resolution images. This work proposes an efficient architecture for an AdaBoost-based face-priority auto-focus. The architecture supports block-based integral image computation to improve the processing speed on high-resolution images; meanwhile, it is reconfigurable so that it enables the sub-window adaptive cascade classification, which greatly improves the processing speed and reduces power consumption. Experimental results show that 96% detection rate in average and 58 fps (frame per second) detection speed are achieved for the 1080p (1920×1080) images. Compared with the state-of-the-art work, the detection speed is greatly improved and power consumption is largely reduced. 相似文献
996.
Controllers play a critical role in software-defined networking (SDN). However, existing single-controller SDN architectures are vulnerable to single-point failures, where a controller’s capacity can be saturated by flooded flow requests. In addition, due to the complicated interactions between applications and controllers, the flow setup latency is relatively large. To address the above security and performance issues of current SDN controllers, we propose distributed rule store (DRS), a new multi-controller architecture for SDNs. In DRS, the controller caches the flow rules calculated by applications, and distributes these rules to multiple controller instances. Each controller instance holds only a subset of all rules, and periodically checks the consistency of flow rules with each other. Requests from switches are distributed among multiple controllers, in order to mitigate controller capacity saturation attack. At the same time, when rules at one controller are maliciously modified, they can be detected and recovered in time. We implement DRS based on Floodlight and evaluate it with extensive emulation. The results show that DRS can effectively maintain a consistently distributed rule store, and at the same time can achieve a shorter flow setup time and a higher processing throughput, compared with ONOS and Floodlight. 相似文献
997.
Peng Qin Bin Dai Guan Xu Kui Wu Benxiong Huang 《Peer-to-Peer Networking and Applications》2016,9(6):1047-1059
A Peer-to-Peer (P2P) network can boost its performance if peers are provided with underlying network-layer routing topology. The task of inferring the network-layer routing topology and link performance from an end host to a set of other hosts is termed as network tomography, and it normally requires host computers to send probing messages. We design a passive network tomography method that does not require any probing messages and takes a free ride over data flows in P2P networks. It infers routing topology based on end-to-end delay correlation estimation (DCE) without requiring any synchronization or cooperation from the intermediate routers. We implement and test our method in the real world Internet environment and achieved the accuracy of 92 % in topology recovery. We also perform extensive simulation in OMNeT++ to evaluate its performance over large scale networks, showing that its topology recovery accuracy is about 95 % for large networks. 相似文献
998.
Yanrong Lu Lixiang Li Haipeng Peng Yixian Yang 《Peer-to-Peer Networking and Applications》2016,9(2):449-459
The Session Initiation Protocol (SIP) as the core signaling protocol for multimedia services is receiving much attention. Authentication is becoming increasingly crucial issue when a user asks to use SIP services. Many authentication schemes for the SIP have been proposed. Very recently, Zhang et al. has presented an authentication scheme for SIP and claimed their scheme could overcome various attacks while maintaining efficiency. In this research, we illustrate that their scheme is susceptible to the insider attack and does not provide proper mutual authentication. We then propose a modified secure mutual authentication scheme to conquer the security flaws in Zhang et al.’s scheme. Through the informal and formal security analyses, we demonstrate that our scheme is resilient possible known attacks including the attacks found in Zhang et al.’s scheme. In addition, the performance analysis shows that our scheme has better efficiency in comparison with other related ECC-based authentication schemes for SIP. 相似文献
999.
A <Emphasis Type="Italic">K</Emphasis> self-adaptive SDN controller placement for wide area networks
As a novel architecture, software-defined networking (SDN) is viewed as the key technology of future networking. The core idea of SDN is to decouple the control plane and the data plane, enabling centralized, flexible, and programmable network control. Although local area networks like data center networks have benefited from SDN, it is still a problem to deploy SDN in wide area networks (WANs) or large-scale networks. Existing works show that multiple controllers are required in WANs with each covering one small SDN domain. However, the problems of SDN domain partition and controller placement should be further addressed. Therefore, we propose the spectral clustering based partition and placement algorithms, by which we can partition a large network into several small SDN domains efficiently and effectively. In our algorithms, the matrix perturbation theory and eigengap are used to discover the stability of SDN domains and decide the optimal number of SDN domains automatically. To evaluate our algorithms, we develop a new experimental framework with the Internet2 topology and other available WAN topologies. The results show the effectiveness of our algorithm for the SDN domain partition and controller placement problems. 相似文献
1000.