全文获取类型
收费全文 | 1004篇 |
免费 | 185篇 |
国内免费 | 101篇 |
专业分类
电工技术 | 41篇 |
综合类 | 189篇 |
化学工业 | 10篇 |
金属工艺 | 3篇 |
机械仪表 | 30篇 |
建筑科学 | 76篇 |
矿业工程 | 13篇 |
能源动力 | 11篇 |
轻工业 | 15篇 |
水利工程 | 7篇 |
石油天然气 | 5篇 |
武器工业 | 19篇 |
无线电 | 255篇 |
一般工业技术 | 79篇 |
冶金工业 | 25篇 |
自动化技术 | 512篇 |
出版年
2024年 | 18篇 |
2023年 | 15篇 |
2022年 | 13篇 |
2021年 | 20篇 |
2020年 | 24篇 |
2019年 | 28篇 |
2018年 | 20篇 |
2017年 | 24篇 |
2016年 | 34篇 |
2015年 | 30篇 |
2014年 | 55篇 |
2013年 | 88篇 |
2012年 | 73篇 |
2011年 | 85篇 |
2010年 | 63篇 |
2009年 | 87篇 |
2008年 | 80篇 |
2007年 | 99篇 |
2006年 | 86篇 |
2005年 | 54篇 |
2004年 | 58篇 |
2003年 | 47篇 |
2002年 | 45篇 |
2001年 | 38篇 |
2000年 | 25篇 |
1999年 | 15篇 |
1998年 | 15篇 |
1997年 | 7篇 |
1996年 | 7篇 |
1995年 | 4篇 |
1994年 | 6篇 |
1993年 | 6篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 1篇 |
1988年 | 2篇 |
1984年 | 2篇 |
1982年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1969年 | 1篇 |
1966年 | 1篇 |
1955年 | 1篇 |
排序方式: 共有1290条查询结果,搜索用时 31 毫秒
991.
992.
The shuttle-based storage and retrieval system (SBS/RS) is a relatively new part-to-picker order picking system. We have developed a performance estimation and design algorithm for the SBS/RS. The performance estimation is based on a queuing model. The design algorithm aims to find the minimum cost configurations in terms of number of tiers, aisles, lifts and workstations with given throughput, tote capacity and order cycle time requirements. We used simulation driven by parameters abstracted from an actual SBS/RS to verify the performance estimation, and applied the design algorithm in the case study. The results indicate that: (1) compared to simulation results, the throughput of the performance estimation is nearly identical when the arrival rate is below the maximum capacity; (2) the design algorithm yields a configuration with 28.1% cost reduction in the current system. In addition, we also compared the shuttle system with the competing robotic order fulfilment system (robotic system in short) in terms of facility cost, building cost and order cycle time. We found that the shuttle system is a better choice if large storage capacity and high throughput are required whereas the robotic order fulfilment system performs better if small storage capacity and low throughput are required. 相似文献
993.
Blocking makes the analytical modelling of open queuing networks with finite buffers intractable because the product-form solutions are unavailable. In this paper, about mould manufacturing, a four-stage flexible flow shop with match processing constraint is first modelled as an open queuing network with finite buffers. According to the characteristics of the matching node, the inter-arrival time distributions of parts arriving at the nodes are assumed to be exponential or general. Next, based on approximation of queuing theory, the Decomposition of State Space Method and the Generalized Expansion Method are developed for system performance evaluation. Then, experiments to assess the accuracy of the proposed methods are reported by comparing the analytical results with simulations. Finally, a case of a real-life production system of mould manufacturing is studied to show the application of the proposed methods. The results of experiments reveal that the proposed methods are feasible and effective for system performance evaluation and they can even solve large-size practical problems in a reasonable time. The results in this paper can provide a basis for system design or resource planning, to solve buffer allocation problems and capacity configuration problems. 相似文献
994.
995.
The response time variability problem (RTVP) is an NP-hard combinatorial scheduling problem that has been recently formalised in the literature. The RTVP has a wide range of real-life applications such as in the automobile industry, when models to be produced on a mixed-model assembly line have to be sequenced under a just-in-time production. The RTVP occurs whenever products, clients or jobs need to be sequenced so as to minimise variability in the time between the instants at which they receive the necessary resources. In two previous studies, three metaheuristic algorithms (a multi-start, a GRASP and a PSO algorithm) were proposed to solve the RTVP. We propose solving the RTVP by means of the electromagnetism-like mechanism (EM) metaheuristic algorithm. The EM algorithm is based on an analogy with the attraction-repulsion mechanism of the electromagnetism theory, where solutions are moved according to their associated charges. In this paper we compare the proposed EM metaheuristic procedure with the three metaheuristic algorithms aforementioned and it is shown that, on average, the EM procedure improves strongly on the obtained results. 相似文献
996.
Time constraints related issues are unavoidable in wafer fabrications. However, when the lots released from a batch workstation overload the downstream serial workstation the consequences are more serious. Under a time constraints environment, peak workload is a critical problem that seriously hurts the overall performance of the downstream workstation. This work applies a GI/G/m queuing network to develop a capacity planning model for batch-serial processes. By applying this queuing network model, the expected waiting time between batch-serial processes can be estimated. Managers can also determine the capacity through the setting of expected rate of exceeding time constraints. The arrival smoothing of the upstream batch workstation and its effect on the downstream workstation is also analysed. The results show that arrival smoothing can effectively decrease the waiting time on the downstream serial workstation through increasing the upstream number of batch machines and decreasing the batch size. The results also conclude that increasing the number of downstream serial machines is not the only option under the batch-serial process in a time constraint environment. Therefore, an investment function of batch-serial process equipment with time constraints is established in this work that can support managers when making investment decisions. 相似文献
997.
998.
网络流量测量对网络管理、网络监控、网络设计和网络规划具有重要的意义.由于网络带宽以摩尔速率增长,流采样作为一种以有限资源实时获取网络运行状况的方式引起了广泛的关注.文章在分析早期流采样技术现状及不足的基础上,详细综述了大流采样算法、流公平采样算法、全流采样算法及异常检测流采样算法四种互联网流采样技术,对四种技术的性能指标给出了理论分析及证明,最后展望了互联网流采样技术可能发展的四个方向. 相似文献
999.
1000.