全文获取类型
收费全文 | 5671篇 |
免费 | 621篇 |
国内免费 | 273篇 |
专业分类
电工技术 | 888篇 |
综合类 | 268篇 |
化学工业 | 428篇 |
金属工艺 | 105篇 |
机械仪表 | 230篇 |
建筑科学 | 34篇 |
矿业工程 | 15篇 |
能源动力 | 254篇 |
轻工业 | 47篇 |
水利工程 | 2篇 |
石油天然气 | 5篇 |
武器工业 | 11篇 |
无线电 | 1748篇 |
一般工业技术 | 372篇 |
冶金工业 | 22篇 |
原子能技术 | 19篇 |
自动化技术 | 2117篇 |
出版年
2024年 | 26篇 |
2023年 | 203篇 |
2022年 | 272篇 |
2021年 | 290篇 |
2020年 | 373篇 |
2019年 | 246篇 |
2018年 | 281篇 |
2017年 | 584篇 |
2016年 | 619篇 |
2015年 | 476篇 |
2014年 | 584篇 |
2013年 | 390篇 |
2012年 | 472篇 |
2011年 | 315篇 |
2010年 | 231篇 |
2009年 | 274篇 |
2008年 | 112篇 |
2007年 | 218篇 |
2006年 | 158篇 |
2005年 | 64篇 |
2004年 | 44篇 |
2003年 | 45篇 |
2002年 | 51篇 |
2001年 | 45篇 |
2000年 | 41篇 |
1999年 | 46篇 |
1998年 | 12篇 |
1997年 | 4篇 |
1996年 | 14篇 |
1995年 | 12篇 |
1994年 | 7篇 |
1993年 | 10篇 |
1992年 | 8篇 |
1991年 | 11篇 |
1990年 | 5篇 |
1989年 | 7篇 |
1988年 | 14篇 |
1987年 | 1篇 |
排序方式: 共有6565条查询结果,搜索用时 15 毫秒
121.
122.
Based on advantages of basic non-negative sparse coding (NNSC) model, and considered the prior class constraint of image features, a novel NNSC model is discussed here. In this NNSC model, the sparseness criteria is selected as a two-parameter density estimation model and the dispersion ratio of within-class and between-class is used as the class constraint. Utilizing this NNSC model, image features can be extracted successfully. Further, the feature recognition task by using different classifiers can be implemented well. Simulation results prove that our NNSC model proposed is indeed effective in extracting image features and recognition task in application. 相似文献
123.
124.
Many good evolutionary algorithms have been proposed in the past. However, frequently, the question arises that given a problem, one is at a loss of which algorithm to choose. In this paper, we propose a novel algorithm portfolio approach to address the above problem for single objective optimization. A portfolio of evolutionary algorithms is first formed. Covariance Matrix Adaptation Evolution Strategy (CMA-ES), History driven Evolutionary Algorithm (HdEA), Particle Swarm Optimization (PSO2011) and Self adaptive Differential Evolution (SaDE) are chosen as component algorithms. Each algorithm runs independently with no information exchange. At any point in time, the algorithm with the best predicted performance is run for one generation, after which the performance is predicted again. The best algorithm runs for the next generation, and the process goes on. In this way, algorithms switch automatically as a function of the computational budget. This novel algorithm is named Multiple Evolutionary Algorithm (MultiEA). The predictor we introduced has the nice property of being parameter-less, and algorithms switch automatically as a function of budget. The following contributions are made: (1) experimental results on 24 benchmark functions show that MultiEA outperforms (i) Multialgorithm Genetically Adaptive Method for Single Objective Optimization (AMALGAM-SO); (ii) Population-based Algorithm Portfolio (PAP); (iii) a multiple algorithm approach which chooses an algorithm randomly (RandEA); and (iv) a multiple algorithm approach which divides the computational budget evenly and execute all algorithms in parallel (ExhEA). This shows that it outperforms existing portfolio approaches and the predictor is functioning well. (2) Moreover, a neck to neck comparison of MultiEA with CMA-ES, HdEA, PSO2011, and SaDE is also made. Experimental results show that the performance of MultiEA is very competitive. In particular, MultiEA, being a portfolio algorithm, is sometimes even better than all its individual algorithms, and has more robust performance. (3) Furthermore, a positive synergic effect is discovered, namely, MultiEA can sometimes perform better than the sum of its individual EAs. This gives interesting insights into why an algorithm portfolio is a good approach. (4) It is found that MultiEA scales as well as the best algorithm in the portfolio. This suggests that MultiEA scales up nicely, which is a desirable algorithmic feature. (5) Finally, the performance of MultiEA is investigated on a real world problem. It is found that MultiEA can select the most suitable algorithm for the problem and is much better than choosing algorithms randomly. 相似文献
125.
Li Dong-fen Wang Rui-jin Zhang Feng-li Baagyere Edward Qin Zhen Xiong Hu Zhan Huayi 《Quantum Information Processing》2016,15(11):4819-4837
Quantum Information Processing - With the advent of the Internet and information and communication technology, quantum teleportation has become an important field in information security and its... 相似文献
126.
Internet Data Center (IDC) is one of important emerging cyber-physical systems. To guarantee the quality of service for their worldwide users, large Internet service providers usually operate multiple geographically distributed IDCs. The enormous power consumption of these data centers may lead to both huge electricity bills and considerable carbon emissions. To mitigate these problems, on-site renewable energy plants are emerging in recent years. Since the renewable energy is intermittent, greening geographical load balancing (GGLB for short) has been proposed to reduce both the electricity bills and carbon emissions by following the renewables. However, GGLB is not able to well deal with the wildly fluctuating wind power when applied into IDCs with on-site wind energy plants. It may either fail to minimize the total electricity bills or incur the costly frequent on–off switching of servers. In order to minimize the total electricity bills of geographically distributed IDCs with on-site wind energy plants, we formulate the total electricity bills minimization problem and propose a novel two-time-scale load balancing framework TLB to solve it. First, TLB models the runtime cooling efficiency for each IDC. Then it predicts the future fine-grained (e.g., 10-min) on-site wind power output at the beginning of each scheduling period (e.g., an hour). After that, TLB transforms the primal optimization problem into a typical mixed-integer linear programming problem and solves it to finally obtain the optimal scheduling policy including the open server number as well as the request routing policy. It is worth noting that the open server number of each IDC will remain the same during each scheduling period. As an application instance of TLB, we also design a two-time-scale load balancing algorithm TLB-ARMA for our experimental scenario. Evaluation results based on real-life traces show that TLB-ARMA is able to reduce the total electricity bills by as much as 12.58 % compared with the hourly executed GGLB without incurring the costly repeated on–off switching of servers. 相似文献
127.
128.
129.
You-bo Liu Jun-yong Liu Gareth Taylor Ting-jian Liu Jing Gou Xi Zhang 《浙江大学学报:C卷英文版》2016,17(11):1107-1121
The operational environment of today’s smart grids is becoming more complicated than ever before. A number of factors, including renewable penetration, marketization, cyber security, and hazards of nature, bring challenges and even threats to control centers. New techniques are anticipated to help dispatchers become aware of the accurate situations as they manipulate and navigate the situations as quickly as possible. To address the issues, we first introduce the background for this topic as well as the emerging technical demands of situational awareness in the dispatcher’s environment. The general concepts and technical requirements of situational awareness are then summarized, aimed at offering an overview for readers to understand the state-of-the-art progress in this area. In addition, we discuss the importance of integrating the architecture of support tools in accordance with the dispatcher’s thought process, which in fact guides correct and swift reactions in real-time operations. Finally, the prospects for situational awareness architecture are investigated with the goal of presenting situational awareness modules in an advanced and visualized manner. 相似文献
130.
Hui Zhao Dan-yang Wang Chao-qing Tang Ya-ping Liu Gao-feng Pan Ting-ting Li Yun-fei Chen 《浙江大学学报:C卷英文版》2016,17(9):929-937
We investigate the secrecy outage performance of maximal ratio combining (MRC) in cognitive radio networks over Rayleigh fading channels. In a single-input multiple-output wiretap system, we consider a secondary user (SU-TX) that transmits confidential messages to another secondary user (SU-RX) equipped with M (M ≥ 1) antennas where the MRC technique is adopted to improve its received signal-to-noise ratio. Meanwhile, an eavesdropper equipped with N (N ≥ 1) antennas adopts the MRC scheme to overhear the information between SU-TX and SU-RX. SU-TX adopts the underlay strategy to guarantee the service quality of the primary user without spectrum sensing. We derive the closed-form expressions for an exact and asymptotic secrecy outage probability. 相似文献