全文获取类型
收费全文 | 13104篇 |
免费 | 1669篇 |
国内免费 | 1588篇 |
专业分类
电工技术 | 1262篇 |
综合类 | 1133篇 |
化学工业 | 310篇 |
金属工艺 | 165篇 |
机械仪表 | 1288篇 |
建筑科学 | 257篇 |
矿业工程 | 141篇 |
能源动力 | 258篇 |
轻工业 | 74篇 |
水利工程 | 290篇 |
石油天然气 | 54篇 |
武器工业 | 100篇 |
无线电 | 1884篇 |
一般工业技术 | 1313篇 |
冶金工业 | 206篇 |
原子能技术 | 41篇 |
自动化技术 | 7585篇 |
出版年
2024年 | 89篇 |
2023年 | 218篇 |
2022年 | 343篇 |
2021年 | 374篇 |
2020年 | 495篇 |
2019年 | 404篇 |
2018年 | 410篇 |
2017年 | 509篇 |
2016年 | 578篇 |
2015年 | 638篇 |
2014年 | 946篇 |
2013年 | 1338篇 |
2012年 | 1024篇 |
2011年 | 998篇 |
2010年 | 773篇 |
2009年 | 878篇 |
2008年 | 949篇 |
2007年 | 974篇 |
2006年 | 852篇 |
2005年 | 753篇 |
2004年 | 603篇 |
2003年 | 469篇 |
2002年 | 387篇 |
2001年 | 279篇 |
2000年 | 205篇 |
1999年 | 180篇 |
1998年 | 137篇 |
1997年 | 106篇 |
1996年 | 83篇 |
1995年 | 73篇 |
1994年 | 66篇 |
1993年 | 40篇 |
1992年 | 44篇 |
1991年 | 30篇 |
1990年 | 22篇 |
1989年 | 20篇 |
1988年 | 7篇 |
1987年 | 2篇 |
1986年 | 12篇 |
1985年 | 13篇 |
1984年 | 13篇 |
1983年 | 6篇 |
1981年 | 3篇 |
1980年 | 4篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1976年 | 3篇 |
1975年 | 3篇 |
1972年 | 1篇 |
1971年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
Against the background of smart manufacturing and Industry 4.0, how to achieve real-time scheduling has become a problem to be solved. In this regard, automatic design for shop scheduling based on hyper-heuristics has been widely studied, and a number of reviews and scheduling algorithms have been presented. Few studies, however, have specifically discussed the technical points involved in algorithm development. This study, therefore, constructs a general framework for automatic design for shop scheduling strategies based on hyper-heuristics, and various state-of-the-art technical points in the development process are summarized. First, we summarize the existing types of shop scheduling strategies and classify them using a new classification method. Second, we summarize an automatic design algorithm for shop scheduling. Then, we investigate surrogate-assisted methods that are popular in the current algorithm field. Finally, current problems and challenges are discussed, and potential directions for future research are proposed. 相似文献
2.
The integration of planning and scheduling decisions in rigorous mathematical models usually results in large scale problems. In order to tackle the problem complexity, decomposition techniques based on duality and information flows between a master and a set of subproblems are widely applied. In this sense, ontologies improve information sharing and communication in enterprises and can even represent holistic mathematical models facilitating the use of analytic tools and providing higher flexibility for model building. In this work, we exploit this ontologies’ capability to address the optimal integration of planning and scheduling using a Lagrangian decomposition approach. Scheduling/planning sub-problems are created for each facility/supply chain entity and their dual solution information is shared by means of the ontological framework. Two case studies based on a STN representation of supply chain planning and scheduling models are presented to emphasize the advantages and limitations of the proposed approach. 相似文献
3.
In modern cloud data centers, reconfigurable devices (FPGAs) are used as an alternative to Graphics Processing Units to accelerate data-intensive computations (e.g., machine learning, image and signal processing). Currently, FPGAs are configured to execute fixed workloads, repeatedly over long periods of time. This conflicts with the needs, proper to cloud computing, to flexibly allocate different workloads and to offer the use of physical devices to multiple users. This raises the need for novel, efficient FPGA scheduling algorithms that can decide execution orders close to the optimum in a short time. In this context, we propose a novel scheduling heuristic where groups of tasks that execute together are interposed by hardware reconfigurations. Our contribution is based on gathering tasks around a high-latency task that hides the latency of tasks, within the same group, that run in parallel and have shorter latencies. We evaluated our solution on a benchmark of 37500 random workloads, synthesized from realistic designs (i.e., topology, resource occupancy). For this testbench, on average, our heuristic produces optimum makespan solutions in 47.4% of the cases. It produces acceptable solutions for moderately constrained systems (i.e., the deadline falls within 10% of the optimum makespan) in 90.1% of the cases. 相似文献
4.
Mohamed Becherif 《Asian journal of control》2019,21(4):2137-2154
Induction machines (IM) constitute a theoretically interesting and practically important class of nonlinear systems. They are frequently used as wind generators for their power/cost ratio. They are described by a fifth‐order nonlinear differential equation with two inputs and only three state variables available for measurement. The control task is further complicated by the fact that IM are subject to unknown (load) disturbances and the parameters can be of great uncertainty. One is then faced with the challenging problem of controlling a highly nonlinear system, with unknown time‐varying parameters, where the regulated output, besides being unmeasurable, is perturbed by an unknown additive signal. Passivity‐based control (PBC) is a well‐established structure‐preserving design methodology which has shown to be very powerful to design robust controllers for physical systems described by Euler‐Lagrange equations of motion. PBCs provide a natural procedure to "shape" the potential energy yielding controllers with a clear physical interpretation in terms of interconnection of the system with its environment and are robust vis á vis to unmodeled dissipative effects. One recent approach of PBC is the Interconnection and Damping Assignment Passivity‐Based Control (IDA‐PBC) which is a very useful technique to control nonlinear systems assigning a desired (Port‐Controlled Hamiltonian) structure to the closed‐loop. The aim of this paper is to give a survey on different PBC of IM. The originality of this work is that the author proves that the well known field oriented control of IM is a particular case of the IDA‐PBC with disturbance. 相似文献
5.
This paper addresses the multi-objective optimization problem arising in the operation of heat integrated batch plants, where makespan and utility consumption are the two conflicting objectives. A new continuous-time MILP formulation with general precedence variables is proposed to simultaneously handle decisions related to timing, product sequencing, heat exchanger matches (selected from a two-stage superstructure) and their heat loads. It features a complex set of timing constraints to synchronize heating and cooling tasks, derived from Generalized Disjunctive Programming. Through the solution of an industrial case study from a vegetable oil refinery, we show that major savings in utilities can be achieved while generating the set of Pareto optimal solutions through the ɛ-constraint method. 相似文献
6.
In this paper, we study scheduling games under mixed coordination mechanisms on hierarchical machines. The two scheduling policies involved are ‐ and ‐, where ‐ (resp., ‐) policy sequences jobs in nondecreasing order of their hierarchies, and jobs of the same hierarchy in nonincreasing (resp., nondecreasing) order of their processing times. We first show the existence of a Nash equilibrium. Then we present the price of anarchy and the price of stability for the games with social costs of minimizing the makespan and maximizing the minimum machine load. All the bounds given in this paper are tight. 相似文献
7.
Considering autonomous mobile robots with a variety of specific functions as a kind of service, when there are many types and quantities of services and the density of regional services is large, proposing an algorithm of Circular Area Search (CAS) because of the problem of multi-robot service scheduling in various areas. Firstly, Django is used as the web framework to build the Service-Oriented Architecture (SOA) multi-robot service cloud platform, which is the basic platform for multi-service combination. Then, the service type, the latitude and longitude and the scoring parameters of the service are selected as the service search metrics to design the CAS algorithm that based on the existing service information registered in MySQL and the Gaode Map for screening optimal service, and then providing the service applicant with the best service. Finally, the service applicant applies for the self-driving tour service as an example to perform performance simulation test on the proposed CAS algorithm. The results show that the CAS algorithm of the multi-robot service cloud platform proposed in this paper is practical compared to the global search. And compared with the Greedy Algorithm experiment, the service search time is reduced about 58% compared with the Greedy Algorithm, which verifies the efficiency of CAS algorithm. 相似文献
8.
Paul Feautrier 《International journal of parallel programming》2006,34(5):459-487
Scheduling a program (i.e. constructing a timetable for the execution of its operations) is one of the most powerful methods
for automatic parallelization. A schedule gives a blueprint for constructing a synchronous program, suitable for an ASIC or
VLIW processor. However, constructing a schedule entails solving a large linear program. Even if one accepts the (experimental)
fact that the Simplex is almost always polynomial, the scheduling time is of the order of a large power of the program size.
Hence, the method does not scale well. The present paper proposes two methods for improving the situation. First, a large
program can be divided into smaller units (processes), which can be scheduled separately. This is structured scheduling. Second, one can use projection methods for solving linear programs incrementally. This is specially efficient if the dependence
graph is sparse. 相似文献
9.
文章介绍了新一代IP骨干网上的IP QoS实现技术,论述了集成业务(IntServ)与差分业务(DiffServ)解决方案的特点,详细介绍了相关的队列管理与排队机制。并结合多协议标签交换(MPLS)技术的最新发展,阐述了综合多协议标签交换流量工程与DiffServ技术体系端到端IP QoS的实现。 相似文献
10.
嵌入式RTOS中任务优先级反转问题研究 总被引:1,自引:0,他引:1
针对嵌入式实时系统任务调度策略的特点,任务在运行的时候可能被更高优先级的任务中断。分析了嵌入式RTOS中的最高就绪任务的查找算法,指出该调度算法存在的不同优先级的反转问题,并且针对这一问题进行研究,给出了相应的优先级继承方案。较好地解决了RTOS中任务调度中的优先级的反转问题。 相似文献