全文获取类型
收费全文 | 23901篇 |
免费 | 3999篇 |
国内免费 | 2601篇 |
专业分类
电工技术 | 4938篇 |
综合类 | 2562篇 |
化学工业 | 317篇 |
金属工艺 | 122篇 |
机械仪表 | 1044篇 |
建筑科学 | 403篇 |
矿业工程 | 253篇 |
能源动力 | 547篇 |
轻工业 | 144篇 |
水利工程 | 351篇 |
石油天然气 | 162篇 |
武器工业 | 195篇 |
无线电 | 5181篇 |
一般工业技术 | 634篇 |
冶金工业 | 158篇 |
原子能技术 | 76篇 |
自动化技术 | 13414篇 |
出版年
2024年 | 50篇 |
2023年 | 326篇 |
2022年 | 560篇 |
2021年 | 654篇 |
2020年 | 732篇 |
2019年 | 635篇 |
2018年 | 598篇 |
2017年 | 837篇 |
2016年 | 876篇 |
2015年 | 1123篇 |
2014年 | 1672篇 |
2013年 | 1539篇 |
2012年 | 1969篇 |
2011年 | 1946篇 |
2010年 | 1672篇 |
2009年 | 1663篇 |
2008年 | 1853篇 |
2007年 | 2162篇 |
2006年 | 1630篇 |
2005年 | 1661篇 |
2004年 | 1380篇 |
2003年 | 1161篇 |
2002年 | 912篇 |
2001年 | 701篇 |
2000年 | 505篇 |
1999年 | 398篇 |
1998年 | 270篇 |
1997年 | 194篇 |
1996年 | 176篇 |
1995年 | 180篇 |
1994年 | 125篇 |
1993年 | 86篇 |
1992年 | 69篇 |
1991年 | 40篇 |
1990年 | 25篇 |
1989年 | 19篇 |
1988年 | 17篇 |
1987年 | 10篇 |
1986年 | 12篇 |
1985年 | 13篇 |
1984年 | 8篇 |
1983年 | 8篇 |
1982年 | 8篇 |
1981年 | 5篇 |
1980年 | 7篇 |
1979年 | 6篇 |
1978年 | 5篇 |
1977年 | 2篇 |
1959年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
2.
3.
《International Journal of Hydrogen Energy》2022,47(56):23762-23771
Limiting current density at different temperatures, backpressures, and balance gases can be used to separate molecular diffusion resistance, Knudsen diffusion resistance and local transport resistance of membrane electrode assembly (MEA). However, the measurement of limiting current density has no unified protocol. The diverse choices in the literature, either in the control of current or voltage or in the atmosphere like relative humidity and O2 concentrations, make it difficult to compare the results and identify the true bottleneck hindering the mass transport. In this work, the current-voltage curves obtained by current scanning/stepping and voltage scanning/stepping methods under dilute O2 of different concentrations and a wide range of relative humidity were measured and analyzed systematically. It is found that the voltage stepping method is superior to the other three ways of control for the reliable determination of the limiting current density. Aided with simultaneous electrochemical impedance spectroscopy measurement, the limiting current density can be determined with pinpoint accuracy. When the limiting current density is just used to qualitatively evaluate different MEA, the voltage scanning method can be used instead for its high time efficiency. The selection of the atmosphere also plays an important role in suppressing the distortion from excessive water and reducing the spurious contribution from proton conduction resistance. It is found that O2 concentrations at 0.5 vol% and relative humidity at 90% can give the best estimation of O2 transport resistance in membrane electrode assembly. 相似文献
4.
Ning Wang Yinya Li Guoqing Qi Andong Sheng 《International Journal of Adaptive Control and Signal Processing》2019,33(7):1174-1188
This paper investigates the state estimation issue for a class of wireless sensor networks (WSNs) with the consideration of limited energy resources. First, a multirate estimation model is established, and then, a new event‐triggered two‐stage information fusion algorithm is developed based on the optimal fusion criterion weighted by matrices. Compared with the existing methods, the presented fusion algorithm can significantly reduce the communication cost in WSNs and save energy resources of sensors efficiently. Furthermore, by presetting a desired containment probability over the interval [0,1] with the developed event‐triggered mechanism, one can obtain a suitable compromise between the communication cost and the estimation accuracy. Finally, a numerical simulation for the WSN tracking system is given to demonstrate the effectiveness of the proposed method. 相似文献
5.
Edge Computing is one of the radically evolving systems through generations as it is able to effectively meet the data saving standards of consumers, providers and the workers. Requisition for Edge Computing based items have been increasing tremendously. Apart from the advantages it holds, there remain lots of objections and restrictions, which hinders it from accomplishing the need of consumers all around the world. Some of the limitations are constraints on computing and hardware, functions and accessibility, remote administration and connectivity. There is also a backlog in security due to its inability to create a trust between devices involved in encryption and decryption. This is because security of data greatly depends upon faster encryption and decryption in order to transfer it. In addition, its devices are considerably exposed to side channel attacks, including Power Analysis attacks that are capable of overturning the process. Constrained space and the ability of it is one of the most challenging tasks. To prevail over from this issue we are proposing a Cryptographic Lightweight Encryption Algorithm with Dimensionality Reduction in Edge Computing. The t-Distributed Stochastic Neighbor Embedding is one of the efficient dimensionality reduction technique that greatly decreases the size of the non-linear data. The three dimensional image data obtained from the system, which are connected with it, are dimensionally reduced, and then lightweight encryption algorithm is employed. Hence, the security backlog can be solved effectively using this method. 相似文献
6.
Rejab Hajlaoui Eesa Alsolami Tarek Moulahi Herv Guyennet 《International Journal of Communication Systems》2019,32(12)
Recently, the routing problem in vehicular ad hoc networks is one of the most vital research. Despite the variety of the proposed approaches and the development of communications technologies, the routing problem in VANET suffers from the high speed of vehicles and the repetitive failures in communications. In this paper, we adjusted the well‐known K‐medoids clustering algorithm to improve the network stability and to increase the lifetime of all established links. First, the number of clusters and the initial cluster heads will not be selected randomly as usual, but based on mathematical formula considering the environment size and the available transmission ranges. Then the assignment of nodes to clusters in both k‐medoids phases will be carried out according to several metrics including direction, relative speed, and proximity. To the best of our knowledge, our proposed model is the first that introduces the new metric named “node disconnection frequency.” This metric prevents nodes with volatile and suspicious behavior to be elected as a new CH. This screening ensures that the new CH retains its property as long as possible and thus increases the network stability. Empirical results confirm that in addition to the convergence speed that characterizes our adjusted K‐medoids clustering algorithm (AKCA), the proposed model achieves more stability and robustness when compared with most recent approaches designed for the same objective. 相似文献
7.
8.
针对新闻文本领域,该文提出一种基于查询的自动文本摘要技术,更加有针对性地满足用户信息需求。根据句子的TF-IDF、与查询句的相似度等要素,计算句子权重,并根据句子指示的时间给定不同的时序权重系数,使得最近发生的新闻内容具有更高的权重,最后使用最大边界相关的方法选择摘要句。通过与基于TF-IDF、Text-Rank、LDA等六种方法的对比,该摘要方法ROUGE评测指标上优于其他方法。从结合评测结果及摘要示例可以看出,该文提出的方法可以有效地从新闻文档集中摘取核心信息,满足用户查询内容的信息需求。 相似文献
9.
The operational environment can be a valuable source of information about the behavior of software applications and their usage context. Although a single instance of an application has limited evidence of the range of the possible behaviors and situations that might be experienced in the field, the collective knowledge composed by the evidence gathered by the many instances of a same application running in several diverse user environments (eg, a browser) might be an invaluable source of information. This information can be exploited by applications able to autonomously analyze how they behave in the field and adjust their behavior accordingly. Augmenting applications with the capability to collaborate and directly share information about their behavior is challenging because it requires the definition of a fully decentralized and dependable networked infrastructure whose nodes are the user machines. The nodes of the infrastructure must be collaborative, to share information, and autonomous, to exploit the available information to change their behavior, for instance, to better accommodate the needs of the users to prevent known problems. This paper describes the initial results that we obtained with the design and the development of an infrastructure that can enable the execution of collaborative scenarios in a fully decentralized way. Our idea is to combine the agent-based paradigm, which is well suited to design collaborative and autonomous nodes, and the peer-to-peer paradigm, which is well suited to design distributed and dynamic network infrastructures. To demonstrate our idea, we augmented the popular JADE agent-based platform with a software layer that supports both the creation of a fully decentralized peer-to-peer network of JADE platforms and the execution of services within that network, thus enabling JADE multiagent systems (MASs) to behave as peer-to-peer networks. The resulting platform can be used to study the design of collaborative applications running in the field. 相似文献
10.
The scheduling problems under distributed production or flexible assembly settings have achieved increasing attention in recent years. This paper considers scheduling the integration of these two environments and proposes an original distributed flowshop scheduling problem with flexible assembly and set-up time. Distributed production stage is deployed several homogeneous flowshop factories that process the jobs to be assembled into final products in the flexible assembly stage. The objective is to find a schedule, including a production subschedule for jobs and an assembly subschedule for products, to minimise the makespan. Such a scheduling problem involves four successive decisions: assigning jobs to production factories, sequencing jobs at every factory, designating an assembly machine for each product and sequencing products on each assembly machine. The computational model is first established, and then a constructive heuristic (TPHS) and two hybrid metaheuristics (HVNS and HPSO) are proposed. Numerical experiments have been carried out and results validate the algorithmic feasibility and effectiveness. TPHS can obtain reasonable solutions in a shorter time, while metaheuristics can report better solutions using more yet acceptable time. HPSO is statistically comparable yet less robust compared with HVNS for small-scale instances. For the large-scale case, HPSO outperforms HVNS on both effectiveness and robustness. 相似文献