全文获取类型
收费全文 | 239169篇 |
免费 | 23969篇 |
国内免费 | 13477篇 |
专业分类
电工技术 | 4362篇 |
技术理论 | 4篇 |
综合类 | 13372篇 |
化学工业 | 41877篇 |
金属工艺 | 11868篇 |
机械仪表 | 7311篇 |
建筑科学 | 5706篇 |
矿业工程 | 4856篇 |
能源动力 | 11995篇 |
轻工业 | 52285篇 |
水利工程 | 2284篇 |
石油天然气 | 3001篇 |
武器工业 | 1005篇 |
无线电 | 20740篇 |
一般工业技术 | 31440篇 |
冶金工业 | 5557篇 |
原子能技术 | 1619篇 |
自动化技术 | 57333篇 |
出版年
2024年 | 1445篇 |
2023年 | 7799篇 |
2022年 | 10139篇 |
2021年 | 11091篇 |
2020年 | 11372篇 |
2019年 | 9251篇 |
2018年 | 9379篇 |
2017年 | 11680篇 |
2016年 | 12399篇 |
2015年 | 13497篇 |
2014年 | 17872篇 |
2013年 | 18949篇 |
2012年 | 22526篇 |
2011年 | 21916篇 |
2010年 | 15849篇 |
2009年 | 15897篇 |
2008年 | 9571篇 |
2007年 | 13117篇 |
2006年 | 10616篇 |
2005年 | 4916篇 |
2004年 | 2254篇 |
2003年 | 2285篇 |
2002年 | 2438篇 |
2001年 | 2210篇 |
2000年 | 1613篇 |
1999年 | 1779篇 |
1998年 | 1149篇 |
1997年 | 747篇 |
1996年 | 841篇 |
1995年 | 702篇 |
1994年 | 663篇 |
1993年 | 551篇 |
1992年 | 519篇 |
1991年 | 530篇 |
1990年 | 536篇 |
1989年 | 479篇 |
1988年 | 891篇 |
1987年 | 1678篇 |
1986年 | 1514篇 |
1985年 | 569篇 |
1984年 | 441篇 |
1983年 | 354篇 |
1982年 | 359篇 |
1981年 | 335篇 |
1980年 | 283篇 |
1979年 | 320篇 |
1978年 | 241篇 |
1977年 | 184篇 |
1976年 | 210篇 |
1975年 | 128篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
901.
This paper presents a mixed-integer programming model for a multi-floor layout design of cellular manufacturing systems (CMSs) in a dynamic environment. A novel aspect of this model is to concurrently determine the cell formation (CF) and group layout (GL) as the interrelated decisions involved in the design of a CMS in order to achieve an optimal (or near-optimal) design solution for a multi-floor factory in a multi-period planning horizon. Other design aspects are to design a multi-floor layout to form cells in different floors, a multi-rows layout of equal area facilities in each cell, flexible reconfigurations of cells during successive periods, distance-based material handling cost, and machine depot keeping idle machines. This model incorporates with an extensive coverage of important manufacturing features used in the design of CMSs. The objective is to minimize the total costs of intra-cell, inter-cell, and inter-floor material handling, purchasing machines, machine processing, machine overhead, and machine relocation. Two numerical examples are solved by the CPLEX software to verify the performance of the presented model and illustrate the model features. Since this model belongs to NP-hard class, an efficient genetic algorithm (GA) with a matrix-based chromosome structure is proposed to derive near-optimal solutions. To verify its computational efficiency in comparison to the CPLEX software, several test problems with different sizes and settings are implemented. The efficiency of the proposed GA in terms of the objective function value and computational time is proved by the obtained results. 相似文献
902.
To satisfy the high-performance requirements of application executions, many kinds of task scheduling algorithms have been proposed. Among them, duplication-based scheduling algorithms achieve higher performance compared to others. However, because of their greedy feature, they duplicate parents of each task as long as the finish time can be reduced, which leads to a superfluous consumption of resource. However, a large amount of duplications are unnecessary because slight delay of some uncritical tasks does not affect the overall makespan. Moreover, these redundant duplications would occupy the resources, delay the execution of subsequent tasks, and increase the schedule makespan consequently. In this paper, we propose a novel duplication-based algorithm designed to overcome the above drawbacks. The proposed algorithm is to schedule tasks with the least redundant duplications. An optimizing scheme is introduced to search and remove redundancy for a schedule generated by the proposed algorithm further. Randomly generated directed acyclic graphs and two real-world applications are tested in our experiments. Experimental results show that the proposed algorithm can save up to 15.59 % resource consumption compared with the other algorithms. The makespan has improvement as well. 相似文献
903.
Javidan Kazemi Kordestani Ali Ahmadi Mohammad Reza Meybodi 《Applied Intelligence》2014,41(4):1150-1169
A new variant of Differential Evolution (DE), called ADE-Grid, is presented in this paper which adapts the mutation strategy, crossover rate (CR) and scale factor (F) during the run. In ADE-Grid, learning automata (LA), which are powerful decision making machines, are used to determine the proper value of the parameters CR and F, and the suitable strategy for the construction of a mutant vector for each individual, adaptively. The proposed automata based DE is able to maintain the diversity among the individuals and encourage them to move toward several promising areas of the search space as well as the best found position. Numerical experiments are conducted on a set of twenty four well-known benchmark functions and one real-world engineering problem. The performance comparison between ADE-Grid and other state-of-the-art DE variants indicates that ADE-Grid is a viable approach for optimization. The results also show that the proposed ADE-Grid improves the performance of DE in terms of both convergence speed and quality of final solution. 相似文献
904.
A major requirement of many real-time embedded systems is to have time-predictable interaction with the environment. More specifically, they need fixed or small sampling and I/O delays, and they cannot cope with large delay jitters. Non-preemptive execution is a known method to reduce the latter delay; however, the corresponding scheduling problem is NP-Hard for periodic tasks. In this paper, we present Precautious-RM as a predictable linear-time online non-preemptive scheduling algorithm for harmonic tasks which can also deal with the former delay, namely sampling delay. We derive conditions of optimality of Precautious-RM and show that satisfying those conditions, tight bounds for best- and worst-case response times of the tasks can be calculated in polynomial-time. More importantly, response time jitter of the tasks is analyzed and it is proven that under specific conditions, each task has either one or two values for response time, which leads to improving the predictability of the system interaction with the environment. Simulation results demonstrate efficiency of Precautious-RM in increasing accuracy of control applications. 相似文献
905.
Petr Švec Atul Thakur Eric Raboin Brual C. Shah Satyandra K. Gupta 《Autonomous Robots》2014,36(4):383-405
The capability of following a moving target in an environment with obstacles is required as a basic and necessary function for realizing an autonomous unmanned surface vehicle (USV). Many target following scenarios involve a follower and target vehicles that may have different maneuvering capabilities. Moreover, the follower vehicle may not have prior information about the intended motion of the target boat. This paper presents a trajectory planning and tracking approach for following a differentially constrained target vehicle operating in an obstacle field. The developed approach includes a novel algorithm for computing a desired pose and surge speed in the vicinity of the target boat, jointly defined as a motion goal, and tightly integrates it with trajectory planning and tracking components of the entire system. The trajectory planner generates a dynamically feasible, collision-free trajectory to allow the USV to safely reach the computed motion goal. Trajectory planning needs to be sufficiently fast and yet produce dynamically feasible and short trajectories due to the moving target. This required speeding up the planning by searching for trajectories through a hybrid, pose-position state space using a multi-resolution control action set. The search in the velocity space is decoupled from the search for a trajectory in the pose space. Therefore, the underlying trajectory tracking controller computes desired surge speed for each segment of the trajectory and ensures that the USV maintains it. We have carried out simulation as well as experimental studies to demonstrate the effectiveness of the developed approach. 相似文献
906.
Lianhang Ma Hao Huang Qinming He Kevin Chiew Zhenguang Liu 《Journal of Intelligent Information Systems》2014,43(1):183-203
Local community detection aims at finding a community structure starting from a seed which is a given vertex in a network without global information, such as online social networks that are too large and dynamic to ever be known fully. Nonetheless, the existing approaches to local community detection are usually sensitive to seeds, i.e., some seeds may lead to missing of some true communities. In this paper, we present a seed-insensitive method called GMAC and its variation iGMAC for local community detection. They estimate the similarity among vertices by investigating vertices’ neighborhoods, and reveal a local community by maximizing its internal similarity and minimizing its external similarity simultaneously. Extensive experimental results on both synthetic and real-world data sets verify the effectiveness of our algorithms. 相似文献
907.
908.
Twin support vector machine (TSVM) is regarded as a milestone in the development of the powerful SVM. It finds two nonparallel planes by resolving a pair of smaller-sized quadratic programming problems rather than a single large one, which makes the learning speed of TSVM approximately four times faster than that of the standard SVM. However, the empirical risk minimization principle is implemented in the TSVM, so it easily leads to the over-fitting problem and reduces the prediction accuracy of the classifier. ν-TSVM, as a variant of TSVM, also implements the empirical risk minimization principle. To enhance the generalization ability of the classifier, we propose an improved ν-TSVM by introducing a regularization term into the objective function, so there are two parts in the objective function, one of which is to maximize the margin between the two parallel hyper-planes, and the other one is to minimize the training errors of two classes of samples. Therefore the structural risk minimization principle is implemented in our improved ν-TSVM. Numerical experiments on one artificial dataset and nine benchmark datasets show that our improved ν-TSVM yields better generalization performance than SVM, ν-SVM, and ν-TSVM. Moreover, numerical experiments with different proportions of outliers demonstrate that our improved ν-TSVM is robust and stable. Finally, we apply our improved ν-TSVM to two BCI competition datasets, and also obtain better prediction accuracy. 相似文献
909.
Medical data feature a number of characteristics that make their classification a complex task. Yet, the societal significance of the subject and the computational challenge it presents has caused the classification of medical datasets to be a popular research area. A new hybrid metaheuristic is presented for the classification task of medical datasets. The hybrid ant–bee colonies (HColonies) consists of two phases: an ant colony optimization (ACO) phase and an artificial bee colony (ABC) phase. The food sources of ABC are initialized into decision lists, constructed during the ACO phase using different subsets of the training data. The task of the ABC is to optimize the obtained decision lists. New variants of the ABC operators are proposed to suit the classification task. Results on a number of benchmark, real-world medical datasets show the usefulness of the proposed approach. Classification models obtained feature good predictive accuracy and relatively small model size. 相似文献
910.
Bargaining is an effective paradigm to solve the problem of resource allocation. The consideration of factors such as bounded rationality of negotiators, time constraints, incomplete information, and complexity of dynamic environment make the design of optimal strategy for one-shot bargaining much tougher than the situation that all bargainers are assumed to be absolutely rational. Lots of prediction-based strategies have been explored either based on assuming a finite number of models for opponents, or focusing on the prediction of opponent’s reserve price, deadline, or the probabilities of different behaviors. Following the methods of estimating opponent’s private information, this paper gives a strategy which improves the BLGAN strategy to adapt to various possible bargaining situations and deal with multifarious opponents. In addition, this paper compares the improved BLGAN strategy with related work. Experimental results show that the improved BLGAN strategy can outperform related ones when faced with various opponents, especially the agents who frequently change their strategies for anti-learning. 相似文献