全文获取类型
收费全文 | 64326篇 |
免费 | 5373篇 |
国内免费 | 2815篇 |
专业分类
电工技术 | 3636篇 |
技术理论 | 7篇 |
综合类 | 4245篇 |
化学工业 | 11027篇 |
金属工艺 | 3578篇 |
机械仪表 | 3952篇 |
建筑科学 | 5465篇 |
矿业工程 | 1860篇 |
能源动力 | 1880篇 |
轻工业 | 4071篇 |
水利工程 | 1159篇 |
石油天然气 | 4514篇 |
武器工业 | 450篇 |
无线电 | 7088篇 |
一般工业技术 | 8029篇 |
冶金工业 | 3118篇 |
原子能技术 | 721篇 |
自动化技术 | 7714篇 |
出版年
2024年 | 225篇 |
2023年 | 1048篇 |
2022年 | 1739篇 |
2021年 | 2447篇 |
2020年 | 1899篇 |
2019年 | 1648篇 |
2018年 | 1871篇 |
2017年 | 2108篇 |
2016年 | 1913篇 |
2015年 | 2381篇 |
2014年 | 3225篇 |
2013年 | 3682篇 |
2012年 | 4098篇 |
2011年 | 4444篇 |
2010年 | 3882篇 |
2009年 | 3696篇 |
2008年 | 3611篇 |
2007年 | 3515篇 |
2006年 | 3569篇 |
2005年 | 3089篇 |
2004年 | 2094篇 |
2003年 | 1878篇 |
2002年 | 1645篇 |
2001年 | 1600篇 |
2000年 | 1658篇 |
1999年 | 1772篇 |
1998年 | 1387篇 |
1997年 | 1172篇 |
1996年 | 1054篇 |
1995年 | 937篇 |
1994年 | 771篇 |
1993年 | 557篇 |
1992年 | 435篇 |
1991年 | 337篇 |
1990年 | 313篇 |
1989年 | 226篇 |
1988年 | 175篇 |
1987年 | 107篇 |
1986年 | 104篇 |
1985年 | 60篇 |
1984年 | 41篇 |
1983年 | 26篇 |
1982年 | 33篇 |
1981年 | 22篇 |
1980年 | 13篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 205 毫秒
992.
Jiang Wu 《Behaviour & Information Technology》2015,34(9):936-948
Online deception is fuelled by the escalated penetration of the Internet and social media. As the threat of online deception increases, understanding deception behaviour and underlying strategies is having a greater social impact. The verbal behaviour of online deception has recently been extended to the discourse level; nevertheless, discourse behaviours have been examined in isolation without referring to other behaviours in the discourse. By conceptualising the discourse of online behaviour as a social network (DOBNet), this research investigates possible impacts of deception intent on the central structures of DOBNet at three different levels: the discourse behaviour, subnetwork, and whole network. The empirical results of discourse network analysis and statistical tests provide partial support for each of the hypothesised effects. The findings not only demonstrate the efficacy of discourse in distinguishing deceivers from truth-tellers but also extend deception theories by confirming deception strategies from the perspective of discourse network and by uncovering unique characteristics of online deception strategies. 相似文献
993.
This paper presents a class of dual–primal proximal point algorithms (PPAs) for extended convex programming with linear constraints. By choosing appropriate proximal regularization matrices, the application of the general PPA to the equivalent variational inequality of the extended convex programming with linear constraints can result in easy proximal subproblems. In theory, the sequence generated by the general PPA may fail to converge since the proximal regularization matrix is asymmetric sometimes. So we construct descent directions derived from the solution obtained by the general PPA. Different step lengths and descent directions are chosen with the negligible additional computational load. The global convergence of the new algorithms is proved easily based on the fact that the sequences generated are Fejér monotone. Furthermore, we provide a simple proof for the O(1/t) convergence rate of these algorithms. 相似文献
994.
995.
软件定义网络SDN(Software-Defined Networking)是由美国斯坦福大学Clean Slate研究组提出的一种新型网络创新架构,可通过软件编程的形式定义和控制网络,其控制平面和转发平面分离及开放性可编程的特点,为新型互联网体系结构研究提供了新的实验途径,也极大地推动了下一代互联网的发展.OpenFlow是SDN的主要协议,定义了SDN控制器与交换机之间的通信标准.目前,很多基于OpenFlow的SDN设备已经在实际中得到了部署.但是,基于OpenFlow的SDN却面临很多安全挑战.其中一个重要的挑战是如何建立一个安全可靠的SDN防火墙应用.由于OpenFlow协议的无状态性,现有的SDN防火墙可以被通过改写交换机中的流表项轻松绕过.针对这一安全威胁,作者提出了基于Flowpath的实时动态策略冲突检测与解决方法.通过获取实时的SDN网络状态,能够准确地检测防火墙策略的直接和间接违反,并且一旦发现冲突,可以基于Flowpath进行自动化和细粒度的冲突解决.最后,作者在开源控制器Floodlight上实现了一个安全增强的防火墙应用FlowVerifier,并基于Mininet对FlowVerifier的性能进行了评估.结果表明FlowVerifier能够检测和自动化地解决SDN网络中由于流表改写而引入的策略冲突及其带来的安全威胁. 相似文献
996.
997.
Yiwei Jiang Feng Yu Ping Zhou Jueliang Hu 《International Transactions in Operational Research》2015,22(5):913-927
We consider an online scheduling problem on two identical parallel machines with a single server. Jobs arrive one by one and each job has to be loaded by the server before being processed on one of the machines, and unloaded immediately by the server after its processing. Both loading and unloading times are equal to one time unit. The goal is to minimize the makespan. For the variant of the problem involving both loading and unloading operations, we present an online algorithm with competitive ratio of 5/3. For the variant with loading operation only, we show that the competitive ratio of list scheduling is at least 8/5 and provide an improved online algorithm with competitive ratio of 11/7. Finally, we discuss the lower bounds for these problems. We show that both variants have a lower bound of 3/2. Furthermore, we show that the lower bound of the first variant is at least 8/5 if the online algorithm satisfies a certain constraint. 相似文献
998.
999.
1000.
Wei Shikui Jiang Su Jin Wenxian Zhao Yao Ni Rongrong Zhu Zhenfeng 《Multimedia Systems》2015,21(2):207-216
Multimedia Systems - Recently, the frame fusion based video copy detection scheme provides a possibility to detect copies in a continuous query video stream. However, its computational complexity... 相似文献