首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   6801篇
  免费   867篇
  国内免费   781篇
电工技术   146篇
技术理论   1篇
综合类   1988篇
化学工业   71篇
金属工艺   30篇
机械仪表   178篇
建筑科学   5篇
矿业工程   15篇
能源动力   51篇
轻工业   7篇
石油天然气   8篇
武器工业   4篇
无线电   3480篇
一般工业技术   295篇
冶金工业   9篇
原子能技术   1篇
自动化技术   2160篇
  2024年   20篇
  2023年   79篇
  2022年   203篇
  2021年   222篇
  2020年   189篇
  2019年   160篇
  2018年   169篇
  2017年   171篇
  2016年   151篇
  2015年   180篇
  2014年   495篇
  2013年   545篇
  2012年   763篇
  2011年   675篇
  2010年   622篇
  2009年   683篇
  2008年   623篇
  2007年   694篇
  2006年   674篇
  2005年   367篇
  2004年   159篇
  2003年   144篇
  2002年   108篇
  2001年   122篇
  2000年   126篇
  1999年   46篇
  1998年   20篇
  1997年   1篇
  1996年   4篇
  1995年   3篇
  1994年   1篇
  1993年   2篇
  1992年   1篇
  1991年   1篇
  1990年   1篇
  1989年   1篇
  1988年   3篇
  1987年   8篇
  1986年   7篇
  1985年   3篇
  1984年   1篇
  1983年   1篇
  1979年   1篇
排序方式: 共有8449条查询结果,搜索用时 0 毫秒
11.
Finding a path that satisfies multiple Quality-of-Service (QoS) constraints is vital to the deployment of current emerged services. However, existing algorithms are not very efficient and effective at finding such a path. Moreover, few works focus on three or more QoS constraints. In this paper, we present an enhanced version of fully polynomial time approximation scheme (EFPTAS) for multiconstrainted path optimal (MCOP) problem. Specifically, we make four major contributions. We first allow the proposed algorithm to construct an auxiliary graph, through which the QoS parameters on each of the finding path can be guaranteed not to exceed the given constraints. Then we adopt a concept, called nonlinear definition of path constraints in EFPTAS for reducing both time and space complexity. Also, we enable EFPTAS to run iteratively to facilitate a progressive refinement of the finding result. In addition to these, we identify some “deployment” issues for proposed algorithm, the essential steps that how and when the EFPTAS takes place are presented. By analyzing the proposed algorithm theoretically, we find that the presented EFPTAS can find a (1+ε)-approximation path in the network with time complexity O(|E||V|/ε) (where |E| is the number of edges and |V| is the number of nodes), which outperforms the previous best-known algorithm for MCOP. We conduct an extensive comparison between the algorithm presented in this paper and previous best-known study experimentally, our results indicate that EFPTAS can find a path with low complexity and preferable quality.  相似文献   
12.
Generally, if a user wants to use numerous different network services, he/she must register himself/herself to every service providing server. It is extremely hard for users to remember these different identities and passwords. In order to resolve this problem, various multi-server authentication protocols have been proposed. Recently, Sood et al. analyzed Hsiang and Shih's multi-server authentication protocol and proposed an improved dynamic identity based authentication protocol for multi-server architecture. They claimed that their protocol provides user's anonymity, mutual authentication, the session key agreement and can resist several kinds of attacks. However, through careful analysis, we find that Sood et al.'s protocol is still vulnerable to leak-of-verifier attack, stolen smart card attack and impersonation attack. Besides, since there is no way for the control server CS to know the real identity of the user, the authentication and session key agreement phase of Sood et al.'s protocol is incorrect. We propose an efficient and security dynamic identity based authentication protocol for multi-server architecture that removes the aforementioned weaknesses. The proposed protocol is extremely suitable for use in distributed multi-server architecture since it provides user's anonymity, mutual authentication, efficient, and security.  相似文献   
13.
针对目前数据标注过于依赖硬件、手动数据标注效率低下的问题,提出了基于深度学习的人体图像半自动标注系统.系统通过对算法进行改进,增加人体关键点个数进行特征提取和加入运动信息的约束,提高了视频分阶段标注的准确率.使用真实数据集仿真实验证明了通过深度学习算法进行数据标注的可行性,并且使用半自动标注的速度快、准确率高.  相似文献   
14.
相比传统的光场绘制技术,神经网络光场(NeRF)方法可使用神经网络拟合场景的光线采样,将隐式编码输入图片的光场,合成新视图. 针对NeRF方法训练时间长,绘制视图慢的问题,提出了一种基于联合采样的NeRF方法,通过使粗糙网络和细腻网络共享均匀采样结果的方法,减少了不必要的光线采样,从而加快了网络训练和视图合成的速度. 实验结果表明,在取得近似视图合成质量的情况下,与NeRF方法相比,所提方法的训练时间减少了20%,视图合成的效率提高了25%.  相似文献   
15.
针对构建中华文化矢量素材库过程中如何评价矢量图质量优劣的问题,提出精确性、连续性和简单性三大视觉评价指标,并进行了量化分析. 首先,对矢量图进行解析,获取矢量图的文档对象模型,遍历文档树得到矢量信息;然后,结合格式塔心理学对矢量图的视觉误差、曲线连续性和纹饰图案的复杂度进行量化;最后,提出一种基于感知驱动的传统纹饰矢量图的评价方法. 结合视觉上的启发性规则,所提评价方法可提供3个量化指标用于多任务驱动矢量化系统中矢量图的自动评价、排序和筛选. 在纹饰矢量图数据集上对算法进行了仿真实验,结果表明,对矢量图的评价结果符合主流设计的视觉审美和期望.  相似文献   
16.
Liu  Zeng  Zhi  YuSong  Zhang  ShaoHui  Li  Shan  Yan  ZuYong  Gao  Ang  Zhang  ShiYu  Guo  DaoYou  Wang  Jun  Wu  ZhenPing  Li  PeiGang  Tang  WeiHua 《中国科学:技术科学(英文版)》2021,64(1):59-64
The low dark current, high responsivity and high specific detectivity could be preferably achieved in detectors based on junctions, owing to the efficient constraint of carriers. Compared with the other junctions, planar Schottky junctions have simple structures and technological demands and are easy integrated. Herein, in this work, we prepared the β-Ga_2O_3 thin film by metalorganic chemical vapor deposition method to construct planar Ti/β-Ga_2O_3/Ni Schottky photodiode detectors with different onstate resistances. Fortunately, all the devices exhibit state-of-the-art performances, such as responsivity of 175–1372 A W~(-1),specific detectivity of 10~(14) Jones and external quantum efficiency of 85700%–671500%. In addition, the dependences of device performances on the on-state resistances indicate that the higher dark currents, photocurrents and photoresponsivities may well be obtained when on-state resistance is smaller, due to the less external power is used to overcome the impendence and condensance at the Ti/β-Ga_2O_3 and Ni/β-Ga_2O_3 interfaces, but contributing to higher electric current flow both in the dark and under illuminations.  相似文献   
17.
A mobile ad hoc network (MANET) is a special type of wireless network in which a collection of mobile nodes with wireless network interfaces may form a temporary network, without the aids of any fixed infrastructure. Security has become a hot research topic in mobile ad hoc networks. In 1998, Volker and Mehrdad proposed a tree-based key management and access control scheme for the mobile agents to manage rights to access its own resources for the visited mobile nodes. Latter, Huang et al. showed that Volker and Mehrdad's scheme needs a large amount of storage and costs for managing and storing secret keys. Huang et al. further proposed a new and efficient scheme based on the elliptic curve cryptosystems to reduce costs and gain better efficiency. However, there is a security leak inherent in Huang et al.'s scheme that the malicious node can overstep his authority to access unauthorized information. This paper will propose a secure, robust, and efficient hierarchical key management scheme for MANETs. Some practical issues and solutions about dynamic key management are also considered and proposed. As compared with Huang et al.'s scheme, our proposed scheme can provide better security assurance, while requiring smaller key-size, lower computational complexities, and constant key management costs which is independent on the number of the confidential files and the visited nodes.  相似文献   
18.
One of the critical security issues of Vehicular Ad Hoc Networks (VANETs) is the revocation of misbehaving vehicles. While essential, revocation checking can leak potentially sensitive information. Road Side Units (RSUs) receiving the certificate status queries could infer the identity of the vehicles posing the query. An important loss of privacy results from the RSUs ability to tie the checking vehicle with the query's target. We propose a Privacy Preserving Revocation mechanism (PPREM) based on a universal one-way accumulator. PPREM provides explicit, concise, authenticated and unforgeable information about the revocation status of each certificate while preserving the users' privacy.  相似文献   
19.
In C2C communication, all necessary information must be collected promptly when a buyer and a seller communicate. That is, an intelligent C2C agent is needed to provide information to buyers and sellers. Along with the evolution of computing technology, C2C agents can exploit the efficient delivery capabilities of peer-to-peer (P2P) technology. However, P2P also increases traffic between agents, but communication faults are a fatal problem for C2C business. This study proposes a robust communication architecture based on current P2P content-delivery standards and its efficiency and robustness have been verified from an experiment.  相似文献   
20.
The abundance of mobile software applications (apps) has created a security challenge. These apps are widely available across all platforms for little to no cost and are often created by small companies and less-experienced programmers. The lack of development standards and best practices exposes the mobile device to potential attacks. This article explores not only the practices that should be adopted by developers of all apps, but also those practices the enterprise user should demand of any app that resides on a mobile device that is employed for both business and private uses.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号