全文获取类型
收费全文 | 61029篇 |
免费 | 9011篇 |
国内免费 | 5343篇 |
专业分类
电工技术 | 7700篇 |
技术理论 | 3篇 |
综合类 | 6096篇 |
化学工业 | 5026篇 |
金属工艺 | 2229篇 |
机械仪表 | 6178篇 |
建筑科学 | 2835篇 |
矿业工程 | 2069篇 |
能源动力 | 3050篇 |
轻工业 | 3714篇 |
水利工程 | 1592篇 |
石油天然气 | 2599篇 |
武器工业 | 824篇 |
无线电 | 4831篇 |
一般工业技术 | 5326篇 |
冶金工业 | 1848篇 |
原子能技术 | 292篇 |
自动化技术 | 19171篇 |
出版年
2024年 | 599篇 |
2023年 | 1542篇 |
2022年 | 2635篇 |
2021年 | 2760篇 |
2020年 | 3056篇 |
2019年 | 2598篇 |
2018年 | 2326篇 |
2017年 | 2830篇 |
2016年 | 3101篇 |
2015年 | 3436篇 |
2014年 | 4808篇 |
2013年 | 4608篇 |
2012年 | 5195篇 |
2011年 | 5254篇 |
2010年 | 3595篇 |
2009年 | 3799篇 |
2008年 | 3345篇 |
2007年 | 3770篇 |
2006年 | 3083篇 |
2005年 | 2468篇 |
2004年 | 2014篇 |
2003年 | 1586篇 |
2002年 | 1348篇 |
2001年 | 1073篇 |
2000年 | 898篇 |
1999年 | 603篇 |
1998年 | 575篇 |
1997年 | 489篇 |
1996年 | 381篇 |
1995年 | 332篇 |
1994年 | 269篇 |
1993年 | 201篇 |
1992年 | 174篇 |
1991年 | 143篇 |
1990年 | 122篇 |
1989年 | 102篇 |
1988年 | 64篇 |
1987年 | 25篇 |
1986年 | 26篇 |
1985年 | 14篇 |
1984年 | 20篇 |
1983年 | 22篇 |
1982年 | 19篇 |
1981年 | 9篇 |
1980年 | 16篇 |
1979年 | 13篇 |
1978年 | 6篇 |
1977年 | 5篇 |
1959年 | 4篇 |
1951年 | 12篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
针对遗传算法在移动机器人路径规划中易产生早熟现象和收敛速度慢的问题,提出了改进的D~* Lite遗传算法。该算法将D~* Lite算法和遗传算法相结合,通过引入碰撞系数和可视检测技术以提高路径安全性,寻找最短路径。在遗传算法设计中加入动态调整交叉与变异概率,以解决算法在路径规划中因陷入局部最优值而不能到达目标点的问题。最后,通过实验仿真可知:与蚁群算法和免疫遗传算法相比,改进的D~* Lite遗传算法执行效率高,可以快速规划出全局最优路径。 相似文献
2.
基于神经网络和遗传算法的锭子弹性管性能优化 总被引:1,自引:0,他引:1
为得到减振弹性管对下锭胆的支承弹性和锭子高速运动下的稳定性等性能的最优匹配效率,依据减振弹性管的等效抗弯刚度及底部等效刚度系数公式,利用MatLab数值分析软件构建弹性管抗弯刚度和底部挠度数学模型。首先,结合Isight优化软件基于径向基神经网络构建其近似模型,且使精度达到可接受水平,并以模型的关键结构参数弹性模量、螺距、槽宽、壁厚为设计变量,结合遗传算法对弹性管抗弯刚度和底部挠度进行多目标优化设计,得到Pareto最优解集和Pareto前沿图,确定出减振弹性管结构工艺参数的优化方案。通过对优化数据进行分析发现,该方案在保证减振弹性管弹性的同时,其底部振幅明显减弱。 相似文献
3.
Small group detection and tracking in crowd scenes are basis for high level crowd analysis tasks. However, it suffers from the ambiguities in generating proper groups and in handling dynamic changes of group configurations. In this paper, we propose a novel delay decision-making based method for addressing the above problems, motivated by the idea that these ambiguities can be solved using rich temporal context. Specifically, given individual detections, small group hypotheses are generated. Then candidate group hypotheses across consecutive frames and their potential associations are built in a tree. By seeking for the best non-conflicting subset from the hypothesis tree, small groups are determined and simultaneously their trajectories are got. So this framework is called joint detection and tracking. This joint framework reduces the ambiguities in small group decision and tracking by looking ahead for several frames. However, it results in the unmanageable solution space because the number of track hypotheses grows exponentially over time. To solve this problem, effective pruning strategies are developed, which can keep the solution space manageable and also improve the credibility of small groups. Experiments on public datasets demonstrate the effectiveness of our method. The method achieves the state-of-the-art performance even in noisy crowd scenes. 相似文献
4.
Mahmoud Elsisi 《国际智能系统杂志》2020,35(11):1857-1878
The controller design for the robotic manipulator faces different challenges such as the system's nonlinearities and the uncertainties of the parameters. Furthermore, the tracking of different linear and nonlinear trajectories represents a vital role by the manipulator. This paper suggests an optimal design for the nonlinear model predictive control (NLMPC) based on a new improved intelligent technique and it is named modified multitracker optimization algorithm (MMTOA). The proposed modification of the MTOA is carried out based on opposition-based learning (OBL) and quasi OBL approaches. This modification improves the exploration behavior of the MTOA to prevent it from becoming trapped in a local optimum. The proposed method is applied on the robotic manipulator to track different linear and nonlinear trajectories. The NLMPC parameters are tuned by the MMTOA rather than the trial and error method of the designer. The proposed NLMPC based on MMTOA is compared with the original MTOA, genetic algorithm, and cuckoo search algorithm in literature. The superiority and effectiveness of the proposed controller are confirmed to track different linear and nonlinear trajectories. Furthermore, the robustness of the proposed method is emphasized against the uncertainties of the parameters. 相似文献
5.
6.
Quadrature spatial modulation (QSM) utilizes the in‐phase and quadrature spatial dimensions to transmit the real and imaginary parts of a single signal symbol, respectively. The improved QSM (IQSM) transmits two signal symbols per channel use through a combination of two antennas for each of the real and imaginary parts. The main contributions of this study can be summarized as follows. First, we derive an upper bound for the error performance of the IQSM. We then design constellation sets that minimize the error performance of the IQSM for several system configurations. Second, we propose a double QSM (DQSM) that transmits the real and imaginary parts of two signal symbols through any available transmit antennas. Finally, we propose a parallel IQSM (PIQSM) that splits the antenna set into equal subsets and performs IQSM within each subset using the same two signal symbols. Simulation results demonstrate that the proposed constellations significantly outperform conventional constellations. Additionally, DQSM and PIQSM provide a performance similar to that of IQSM while requiring a smaller number of transmit antennas and outperform IQSM with the same number of transmit antennas. 相似文献
7.
Serena Finco Daria Battini Xavier Delorme Alessandro Persona Fabio Sgarbossa 《国际生产研究杂志》2020,58(4):1255-1270
Ergonomic aspects have a crucial role in manual assembly systems. They impact on the workers’ health, final product quality and productivity. For these reasons, there is the necessity to integrate them into the assembly line balancing phase as, whereas, only time and cost variables are considered. In this study, human energy expenditures are considered as ergonomic aspects and we integrate them, for the first time, into the assembly line balancing problem type 2 through the rest allowance evaluation. We consider as an objective function the minimization of the smoothness index. Firstly, a new optimal method based on mixed integer linear programming and a new linearization methodology are proposed. Then, a heuristic approach is introduced. To complete the study, a computational experimentation is presented to validate the mathematical model and to compare the methodologies proposed in terms of computational time, complexity and solution. Additionally, we provide a detailed analysis of the impact that rest allowance evaluation can have on productivity comparing the results obtained, taking into account the rest allowance integration before, during and after the assembly balancing process. 相似文献
8.
In this paper, a modified particle swarm optimization (PSO) algorithm is developed for solving multimodal function optimization problems. The difference between the proposed method and the general PSO is to split up the original single population into several subpopulations according to the order of particles. The best particle within each subpopulation is recorded and then applied into the velocity updating formula to replace the original global best particle in the whole population. To update all particles in each subpopulation, the modified velocity formula is utilized. Based on the idea of multiple subpopulations, for the multimodal function optimization the several optima including the global and local solutions may probably be found by these best particles separately. To show the efficiency of the proposed method, two kinds of function optimizations are provided, including a single modal function optimization and a complex multimodal function optimization. Simulation results will demonstrate the convergence behavior of particles by the number of iterations, and the global and local system solutions are solved by these best particles of subpopulations. 相似文献
9.
High dimensionality in real-world multi-reservoir systems greatly hinders the application and popularity of evolutionary algorithms, especially for systems with heterogeneous units. An efficient hierarchical optimization framework is presented for search space reduction, determining the best water distributions, not only between cascade reservoirs, but also among different types of hydropower units. The framework is applied to the Three Gorges Project (TGP) system and the results demonstrate that the difficulties of multi-reservoir optimization caused by high dimensionality can be effectively solved by the proposed hierarchical method. For the day studied, power output could be increased by 6.79 GWh using an optimal decision with the same amount of water actually used; while the same amount of power could be generated with 2.59 × 107 m3 less water compared to the historical policy. The methodology proposed is general in that it can be used for other reservoir systems and other types of heterogeneous unit generators. 相似文献
10.
Chaos optimization algorithm (COA) utilizes the chaotic maps to generate the pseudo-random sequences mapped as the decision variables for global optimization applications. A kind of parallel chaos optimization algorithm (PCOA) has been proposed in our former studies to improve COA. The salient feature of PCOA lies in its pseudo-parallel mechanism. However, all individuals in the PCOA search independently without utilizing the fitness and diversity information of the population. In view of the limitation of PCOA, a novel PCOA with migration and merging operation (denoted as MMO-PCOA) is proposed in this paper. Specifically, parallel individuals are randomly selected to be conducted migration and merging operation with the so far parallel solutions. Both migration and merging operation exchange information within population and produce new candidate individuals, which are different from those generated by stochastic chaotic sequences. Consequently, a good balance between exploration and exploitation can be achieved in the MMO-PCOA. The impacts of different one-dimensional maps and parallel numbers on the MMO-PCOA are also discussed. Benchmark functions and parameter identification problems are used to test the performance of the MMO-PCOA. Simulation results, compared with other optimization algorithms, show the superiority of the proposed MMO-PCOA algorithm. 相似文献