全文获取类型
收费全文 | 20414篇 |
免费 | 2336篇 |
国内免费 | 1895篇 |
专业分类
电工技术 | 2150篇 |
综合类 | 1822篇 |
化学工业 | 687篇 |
金属工艺 | 266篇 |
机械仪表 | 1500篇 |
建筑科学 | 1992篇 |
矿业工程 | 507篇 |
能源动力 | 468篇 |
轻工业 | 165篇 |
水利工程 | 1095篇 |
石油天然气 | 339篇 |
武器工业 | 192篇 |
无线电 | 2357篇 |
一般工业技术 | 1778篇 |
冶金工业 | 340篇 |
原子能技术 | 80篇 |
自动化技术 | 8907篇 |
出版年
2024年 | 97篇 |
2023年 | 255篇 |
2022年 | 453篇 |
2021年 | 512篇 |
2020年 | 674篇 |
2019年 | 546篇 |
2018年 | 568篇 |
2017年 | 689篇 |
2016年 | 779篇 |
2015年 | 895篇 |
2014年 | 1508篇 |
2013年 | 1745篇 |
2012年 | 1734篇 |
2011年 | 1672篇 |
2010年 | 1262篇 |
2009年 | 1430篇 |
2008年 | 1411篇 |
2007年 | 1540篇 |
2006年 | 1255篇 |
2005年 | 1115篇 |
2004年 | 902篇 |
2003年 | 761篇 |
2002年 | 611篇 |
2001年 | 465篇 |
2000年 | 357篇 |
1999年 | 295篇 |
1998年 | 215篇 |
1997年 | 178篇 |
1996年 | 132篇 |
1995年 | 127篇 |
1994年 | 92篇 |
1993年 | 72篇 |
1992年 | 67篇 |
1991年 | 43篇 |
1990年 | 34篇 |
1989年 | 32篇 |
1988年 | 16篇 |
1987年 | 7篇 |
1986年 | 16篇 |
1985年 | 17篇 |
1984年 | 17篇 |
1983年 | 7篇 |
1982年 | 3篇 |
1981年 | 8篇 |
1980年 | 8篇 |
1979年 | 5篇 |
1978年 | 4篇 |
1976年 | 3篇 |
1975年 | 3篇 |
1959年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
《Journal of dairy science》2022,105(5):4314-4323
We tested the hypothesis that the size of a beef cattle population destined for use on dairy females is smaller under optimum-contribution selection (OCS) than under truncation selection (TRS) at the same genetic gain (ΔG) and the same rate of inbreeding (ΔF). We used stochastic simulation to estimate true ΔG realized at a 0.005 ΔF in breeding schemes with OCS or TRS. The schemes for the beef cattle population also differed in the number of purebred offspring per dam and the total number of purebred offspring per generation. Dams of the next generation were exclusively selected among the one-year-old heifers. All dams were donors for embryo transfer and produced a maximum of 5 or 10 offspring. The total number of purebred offspring per generation was: 400, 800, 1,600 or 4,000 calves, and it was used as a measure of population size. Rate of inbreeding was predicted and controlled using pedigree relationships. Each OCS (TRS) scheme was simulated for 10 discrete generations and replicated 100 (200) times. The OCS scheme and the TRS scheme with a maximum of 10 offspring per dam required approximately 783 and 1,257 purebred offspring per generation to realize a true ΔG of €14 and a ΔF of 0.005 per generation. Schemes with a maximum of 5 offspring per dam required more purebred offspring per generation to realize a similar true ΔG and a similar ΔF. Our results show that OCS and multiple ovulation and embryo transfer act on selection intensity through different mechanisms to achieve fewer selection candidates and fewer selected sires and dams than under TRS at the same ΔG and a fixed ΔF. Therefore, we advocate the use of a breeding scheme with OCS and multiple ovulation and embryo transfer for beef cattle destined for use on dairy females because it is favorable both from an economic perspective and a carbon footprint perspective. 相似文献
2.
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. 相似文献
3.
Short-term generation scheduling is an important function in daily operational planning of power systems. It is defined as optimal scheduling of power generators over a scheduling period while respecting various generator constraints and system constraints. Objective of the problem includes costs associated with energy production, start-up cost and shut-down cost along with profits. The resulting problem is a large scale nonlinear mixed-integer optimization problem for which there is no exact solution technique available. The solution to the problem can be obtained only by complete enumeration, often at the cost of a prohibitively computation time requirement for realistic power systems. This paper presents a hybrid algorithm which combines Lagrangian Relaxation (LR) together with Evolutionary Algorithm (EA) to solve the problem in cooperative and competitive energy environments. Simulation studies were carried out on different systems containing various numbers of units. The outcomes from different algorithms are compared with that from the proposed hybrid algorithm and the advantages of the proposed algorithm are briefly discussed. 相似文献
4.
Meysam Akbari Omid Hashemipour Masoud Nazari Farshad Moradi 《International Journal of Circuit Theory and Applications》2019,47(7):1188-1198
This paper presents an energy-efficient switching scheme for successive approximation register (SAR) analogue-to-digital converter (ADC). The proposed scheme employs charge recycling method to keep the capacitor arrays free of transitional energy between bit generations except reset phase. In comparison with the conventional switching scheme, the proposed one achieves 100% transitional energy saving without considering reset phase. In addition, configuration of a 10-bit SAR ADC shows that the proposed switching scheme reduces the capacitor area by 25% compared with the conventional switching scheme. 相似文献
5.
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. 相似文献
6.
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. 相似文献
7.
The optimization of energy consumption, with consequent cost reduction, is one of the main challenges for the present and future smart grid. Demand response (DR) program is expected to be vital in home energy management system (HEMS) which aims to schedule the operation of appliances to save energy costs by considering customer convenience as well as characteristics of electric appliances. The DR program is a challenging optimization problem especially when the formulations are non-convex or NP-hard problems. In order to solve this challenging optimization problem efficiently, an effective heuristic approach is proposed to achieve a near optimal solution with low computational costs. Different from previously proposed methods in literatures which are not suitable to be run in embedded devices such as a smart meter. The proposed algorithm can be implemented in an embedded device which has severe limitations on memory size and computational power, and can get an optimal value in real-time. Numerical studies were carried out with the data simulating practical scenarios are provided to demonstrate the effectiveness of the proposed method. 相似文献
8.
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. 相似文献
9.
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. 相似文献
10.
Numerical dissipation acts as artificial viscosity to make smoke viscous. Reducing numerical dissipation is able to recover visual details smeared out by the numerical dissipation. Great efforts have been devoted to suppress the numerical dissipation in smoke simulation in the past few years. In this paper we investigate methods of combating the numerical dissipation. We describe visual consequences of the numerical dissipation and explore sources that introduce the numerical dissipation into course of smoke simulation. Methods are investigated from various aspects including grid variation, high-order advection, sub-grid compensation, invariant conservation, and particle-based improvement, followed by discussion and comparison in terms of visual quality, computational overhead, ease of implementation, adaptivity, and scalability, which leads to their different applicability to various application scenarios. 相似文献