全文获取类型
收费全文 | 3985篇 |
免费 | 426篇 |
国内免费 | 335篇 |
专业分类
电工技术 | 369篇 |
综合类 | 285篇 |
化学工业 | 117篇 |
金属工艺 | 53篇 |
机械仪表 | 295篇 |
建筑科学 | 95篇 |
矿业工程 | 25篇 |
能源动力 | 81篇 |
轻工业 | 18篇 |
水利工程 | 30篇 |
石油天然气 | 20篇 |
武器工业 | 26篇 |
无线电 | 386篇 |
一般工业技术 | 357篇 |
冶金工业 | 63篇 |
原子能技术 | 6篇 |
自动化技术 | 2520篇 |
出版年
2024年 | 33篇 |
2023年 | 92篇 |
2022年 | 81篇 |
2021年 | 107篇 |
2020年 | 144篇 |
2019年 | 138篇 |
2018年 | 106篇 |
2017年 | 135篇 |
2016年 | 169篇 |
2015年 | 171篇 |
2014年 | 255篇 |
2013年 | 301篇 |
2012年 | 242篇 |
2011年 | 277篇 |
2010年 | 207篇 |
2009年 | 230篇 |
2008年 | 245篇 |
2007年 | 240篇 |
2006年 | 248篇 |
2005年 | 208篇 |
2004年 | 173篇 |
2003年 | 169篇 |
2002年 | 146篇 |
2001年 | 100篇 |
2000年 | 89篇 |
1999年 | 71篇 |
1998年 | 64篇 |
1997年 | 48篇 |
1996年 | 31篇 |
1995年 | 43篇 |
1994年 | 32篇 |
1993年 | 24篇 |
1992年 | 21篇 |
1991年 | 25篇 |
1990年 | 15篇 |
1989年 | 13篇 |
1988年 | 9篇 |
1987年 | 3篇 |
1986年 | 3篇 |
1985年 | 6篇 |
1984年 | 11篇 |
1983年 | 2篇 |
1982年 | 4篇 |
1981年 | 5篇 |
1980年 | 3篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 2篇 |
1973年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有4746条查询结果,搜索用时 15 毫秒
51.
Lei Cao Da-Wei Zhang Clara Mihaela Ionescu Guo-Ping Liu 《Asian journal of control》2023,25(5):3978-3991
In this paper, the formation consensus problem for a class of leader–follower networked multi-agent systems under communication constraints and switching topologies is investigated. A networked predictive control scheme is proposed to achieve stability and output formation consensus with the switching topology, capable of compensating for data loss and time delays in the network. By equating the whole closed-loop networked multi-agent system with the proposed control scheme to the corresponding switched system, the sufficient and necessary condition of output formation consensus and stability for agents is given. Finally, using three-degree-of-freedom air-bearing spacecraft simulators as the control objects, the proposed scheme is demonstrated to be able to actively compensate for the communication constraints through numerical simulations, and it is also verified to have a good control performance by further realizing the formation task of the simulators through practical experiments. 相似文献
52.
F. Hooshmand Khaligh 《国际生产研究杂志》2016,54(2):579-590
In this study, a multistage stochastic programming (SP) model is presented for a variant of single-vehicle routing problem with stochastic demands from a dynamic viewpoint. It is assumed that the actual demand of a customer becomes known only when the customer is visited. This problem falls into the category of SP with endogenous uncertainty and hence, the scenario tree is decision-dependent. Therefore, nonanticipativity of decisions is ensured by conditional constraints making up a large portion of total constraints. Thus, a novel approach is proposed that considerably reduces the problem size without any effect on the solution space. Computational results on some test problems are reported. 相似文献
53.
This paper is concerned with the adaptive stabilization problem of uncertain input delayed systems.A solution to this problem is given for a class of uncertain nonlinear systems with time-varying delays in both state and input.An adaptive asymptotically stabilizing controller,which can guarantee the stability of the closed-loop system and the convergence of the original system state,is designed by means of the Lyapunov-Krasovskii functional stability theory combined with linear matrix inequalities (LMIs) an... 相似文献
54.
State feedback design for input-saturating quadratic systems 总被引:1,自引:0,他引:1
Giórgio Valmórbida Author Vitae Sophie Tarbouriech Author VitaeAuthor Vitae 《Automatica》2010,46(7):1196-1202
This paper proposes a method to design stabilizing state feedback control laws for nonlinear quadratic systems subject to input saturation. Based on a quadratic Lyapunov function, a modified sector condition and a particular representation for the quadratic terms, synthesis conditions in a “quasi”-LMI form are stated in a regional (local) context. An LMI-based optimization problem is then derived for computing the state feedback gains maximizing the estimate of the stability region of the closed-loop system. 相似文献
55.
Fabien Tricoire Martin Romauch Karl F. Doerner Richard F. Hartl 《Computers & Operations Research》2010,37(2):351-367
We present the multi-period orienteering problem with multiple time windows (MuPOPTW), a new routing problem combining objective and constraints of the orienteering problem (OP) and team orienteering problem (TOP), constraints from standard vehicle routing problems, and original constraints from a real-world application. The problem itself comes from a real industrial case. Specific route duration constraints result in a route feasibility subproblem. We propose an exact algorithm for this subproblem, and we embed it in a variable neighborhood search method to solve the whole routing problem. We then provide experimental results for this method. We compare them to a commercial solver. We also adapt our method to standard benchmark OP and TOP instances, and provide comparative tables with state-of-the-art algorithms. 相似文献
56.
Given an undirected network with positive edge costs and a positive integer , the minimum-degree constrained minimum spanning tree problem is the problem of finding a spanning tree with minimum total cost such that each non-leaf node in the tree has a degree of at least . This problem is new to the literature while the related problem with upper bound constraints on degrees is well studied. Mixed-integer programs proposed for either type of problem is composed, in general, of a tree-defining part and a degree-enforcing part. In our formulation of the minimum-degree constrained minimum spanning tree problem, the tree-defining part is based on the Miller–Tucker–Zemlin constraints while the only earlier paper available in the literature on this problem uses single and multi-commodity flow-based formulations that are well studied for the case of upper degree constraints. We propose a new set of constraints for the degree-enforcing part that lead to significantly better solution times than earlier approaches when used in conjunction with Miller–Tucker–Zemlin constraints. 相似文献
57.
An effective heuristic for flexible job-shop scheduling problem with maintenance activities 总被引:1,自引:0,他引:1
Most production scheduling problems, including the standard flexible job-shop scheduling problem (FJSP), assume that machines are continuously available. However, in most realistic situations, machines may become unavailable during certain periods due to preventive maintenance (PM). In this paper, a flexible job-shop scheduling problem with machine availability constraints is considered. Each machine is subject to preventive maintenance during the planning period and the starting times of maintenance activities are either flexible in a time window or fixed beforehand. Moreover, two cases of maintenance resource constraint are considered: sufficient maintenance resource available or only one maintenance resource available. To deal with this variant FJSP problem with maintenance activities, a filtered beam search (FBS) based heuristic algorithm is proposed. With a modified branching scheme, the machine availability constraint and maintenance resource constraint can be easily incorporated into the proposed algorithm. Simulation experiments are conducted on some representative problems. The results demonstrate that the proposed filtered beam search based heuristic algorithm is a viable and effective approach for the FJSP with maintenance activities. 相似文献
58.
59.
Context
Input/output transition system (IOTS) models are commonly used when next input can arrive even before outputs are produced. The interaction between the tester and an implementation under test (IUT) is usually assumed to be synchronous. However, as the IUT can produce outputs at any moment, the tester should be prepared to accept all outputs from the IUT, or else be able to block (refuse) outputs of the implementation. Testing distributed, remote applications under the assumptions that communication is synchronous and actions can be blocked is unrealistic, since synchronous communication for such applications can only be achieved if special protocols are used. In this context, asynchronous tests can be more appropriate, reflecting the underlying test architecture which includes queues.Objective
In this paper, we investigate the problem of constructing test cases for given test purposes and specification input/output transition systems, when the communication between the tester and the implementation under test is assumed to be asynchronous, performed via multiple queues.Method
When issuing verdicts, asynchronous tests should take into account a distortion caused by the queues in the observed interactions. First, we investigate how the test purpose can be transformed to account for this distortion when there are a single input queue and a single output queue. Then, we consider a more general problem, when there may be multiple queues.Results
We propose an algorithm which constructs a sound test case, by transforming the test purpose prior to composing it with the specification without queues.Conclusion
The proposed algorithm mitigates the state explosion problem which usually occurs when queues are directly involved in the composition. Experimental results confirm the resulting state space reduction. 相似文献60.
Hybrid flexible flowshops with sequence-dependent setup times and machine availability constraints 总被引:1,自引:0,他引:1
One of the common assumptions in the field of scheduling is that machines are always available in the planning horizon. This may not be true in realistic problems since machines might be busy processing some jobs left from previous production horizon, breakdowns or preventive maintenance activities. Another common assumption is the consideration of setup times as a part of processing times, while in some industries, such as printed circuit board and automobile manufacturing, not only setups are an important factor but also setup magnitude of a job depends on its immediately preceding job on the same machine, known as sequence-dependent setup times. In this paper, we consider hybrid flexible flowshops with sequence-dependent setup times and machine availability constraints caused by preventive maintenance. The optimization criterion is the minimization of makespan. Since this problem is NP-hard in the strong sense, we propose three heuristics, based on SPT, LPT and Johnson rule and two metaheuristics based on genetic algorithm and simulated annealing. Computational experiments are performed to evaluate the efficiencies of the algorithms. 相似文献