全文获取类型
收费全文 | 6073篇 |
免费 | 237篇 |
国内免费 | 187篇 |
专业分类
电工技术 | 234篇 |
技术理论 | 1篇 |
综合类 | 591篇 |
化学工业 | 243篇 |
金属工艺 | 45篇 |
机械仪表 | 284篇 |
建筑科学 | 709篇 |
矿业工程 | 34篇 |
能源动力 | 128篇 |
轻工业 | 132篇 |
水利工程 | 71篇 |
石油天然气 | 40篇 |
武器工业 | 20篇 |
无线电 | 368篇 |
一般工业技术 | 348篇 |
冶金工业 | 530篇 |
原子能技术 | 5篇 |
自动化技术 | 2714篇 |
出版年
2024年 | 19篇 |
2023年 | 68篇 |
2022年 | 86篇 |
2021年 | 121篇 |
2020年 | 105篇 |
2019年 | 97篇 |
2018年 | 92篇 |
2017年 | 140篇 |
2016年 | 138篇 |
2015年 | 250篇 |
2014年 | 423篇 |
2013年 | 461篇 |
2012年 | 474篇 |
2011年 | 548篇 |
2010年 | 448篇 |
2009年 | 425篇 |
2008年 | 398篇 |
2007年 | 371篇 |
2006年 | 348篇 |
2005年 | 262篇 |
2004年 | 257篇 |
2003年 | 208篇 |
2002年 | 174篇 |
2001年 | 113篇 |
2000年 | 61篇 |
1999年 | 57篇 |
1998年 | 56篇 |
1997年 | 41篇 |
1996年 | 27篇 |
1995年 | 27篇 |
1994年 | 27篇 |
1993年 | 14篇 |
1992年 | 18篇 |
1991年 | 14篇 |
1990年 | 18篇 |
1989年 | 9篇 |
1988年 | 8篇 |
1987年 | 9篇 |
1986年 | 10篇 |
1985年 | 14篇 |
1984年 | 16篇 |
1983年 | 5篇 |
1982年 | 9篇 |
1981年 | 8篇 |
1980年 | 3篇 |
1978年 | 2篇 |
1977年 | 3篇 |
1976年 | 4篇 |
1975年 | 2篇 |
1974年 | 3篇 |
排序方式: 共有6497条查询结果,搜索用时 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.
This paper considers the scheduling problem of minimizing earliness–tardiness (E/T) on a single batch processing machine with a common due date. The problem is extended to the environment of non-identical job sizes. First, a mathematical model is formulated, which is tested effectively under IBM ILOG CPLEX using the constraint programming solver. Then several optimal properties are given to schedule batches effectively, and by introducing the concept of ARB (Attribute Ratio of Batch), it is proven that the ARB of each batch should be made as small as possible in order to minimize the objective, designed as the heuristic information for assigning jobs into batches. Based on these properties, a heuristic algorithm MARB (Minimum Attribute Ratio of Batch) for batch forming is proposed, and a hybrid genetic algorithm is developed for the problem under study by combining GA (genetic algorithm) with MARB. Experimental results demonstrate that the proposed algorithm outperforms other algorithms in the literature, both for small and large problem instances. 相似文献
3.
Many argue that digital technologies have the potential to enhance the teaching and learning of mathematics. However, the availability of technology is not sufficient to realise this potential. The study reported takes a detailed approach to investigate the utility of the particular offerings of the available technologies in the teaching and learning of a specific area of mathematics, functions. Sixteen affordances identified in the data are described. The complexity of the process involved in resolving a situation where particular affordances would be useful so as they are perceived and enacted is detailed. Finally, a grounded theory framework arising from the data analysis from this study that can be used to explain, predict and guide action in other digital environments is presented. 相似文献
4.
A steelmaking-continuous casting (SCC) scheduling problem is an example of complex hybrid flow shop scheduling problem (HFSSP) with a strong industrial background. This paper investigates the SCC scheduling problem that involves controllable processing times (CPT) with multiple objectives concerning the total waiting time, earliness/tardiness and adjusting cost. The SCC scheduling problem with CPT is seldom discussed in the existing literature. This study is motivated by the practical situation of a large integrated steel company in which the just-in-time (JIT) and cost-cutting production strategy have become a significant concern. To address this complex HFSSP, the scheduling problem is decomposed into two subproblems: a parallel machine scheduling problem (PMSP) in the last stage and an HFSSP in the upstream stages. First, a hybrid differential evolution (HDE) algorithm combined with a variable neighborhood decomposition search (VNDS) is proposed for the former subproblem. Second, an iterative backward list scheduling (IBLS) algorithm is presented to solve the latter subproblem. The effectiveness of this bi-layer optimization approach is verified by computational experiments on well-designed and real-world scheduling instances. This study provides a new perspective on modeling and solving practical SCC scheduling problems. 相似文献
5.
We study a two-agent scheduling problem in a two-machine permutation flowshop with learning effects. The objective is to minimize the total completion time of the jobs from one agent, given that the maximum tardiness of the jobs from the other agent cannot exceed a bound. We provide a branch-and-bound algorithm for the problem. In addition, we present several genetic algorithms to obtain near-optimal solutions. Computational results indicate that the algorithms perform well in either solving the problem or efficiently generating near-optimal solutions. 相似文献
6.
7.
Understanding the differences between how novice and experienced designers approach design tasks 总被引:2,自引:1,他引:1
Research was undertaken to understand how to provide the most appropriate support for novice designers in engineering design.
However, how designers apply their experience and knowledge is not understood and further research in this area is required.
This paper describes an observational study to understand how novice and experienced designers approach design tasks.
Electronic Publication 相似文献
8.
Micro assembly injection moulding 总被引:1,自引:0,他引:1
Injection moulding is established as one of the most common manufacturing processes of thermoplastics due to its high degree of automation and the short cycle times. Micro injection moulding is a rapidly growing technology that allows for the efficient production of very complex micro parts in high series. The “Market Analysis for Microsystems II 2002–2005” of the Nexus Task Force anticipates a yearly growth in the field of micro system technology of about 20% (Wechsung et al. 2002). This study identifies in addition to the continuous miniaturization the growing use of polymers in micro systems (Schneider et al. 2001). No other material group offers this wide range of material properties and permits to choose processing parameters and application properties according to necessities (Gächter 2000). While the production processes of micro technical components are mainly controllable, the assembly of these components to hybrid micro systems is a bottleneck to the industrial large scale production. The assembly itself represents a large fraction of the added product value and gains in importance with growing complexity and miniaturization of the systems. 相似文献
9.
This paper addresses the problem of power control in a multihop wireless network supporting multicast traffic. We face the problem of forwarding packet traffic to multicast group members while meeting constraints on the signal-to-interference-plus-noise ratio (SINR) at the intended receivers. First, we present a distributed algorithm which, given the set of multicast senders and their corresponding receivers, provides an optimal solution when it exists, which minimizes the total transmit power. When no optimal solution can be found for the given set of multicast senders and receivers, we introduce a distributed, joint scheduling and power control algorithm which eliminates the weak connections and tries to maximize the number of successful multicast transmissions. The algorithm allows the other senders to solve the power control problem and minimize the total transmit power. We show that our distributed algorithm converges to the optimal solution when it exists, and performs close to centralized, heuristic algorithms that have been proposed to address the joint scheduling and power control problem. 相似文献
10.
We consider the problem of rescheduling trains in the case where one track of a railway section consisting of two tracks
in opposing directions is closed due to construction activities. After presenting an appropriate model for this situation
we derive a polynomial algorithm for the subproblem of finding an optimal schedule with minimal latenesss if the subsequences
of trains for both directions outside the construction site are fixed. Based on this algorithm we propose a local search procedure
for the general problem of finding good schedules and report test results for some real world instances.
Received: December 8, 1999 / Accepted: May 2, 2001 相似文献