首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   276篇
  免费   24篇
电工技术   1篇
综合类   1篇
化学工业   117篇
金属工艺   6篇
机械仪表   8篇
建筑科学   8篇
矿业工程   1篇
能源动力   28篇
轻工业   9篇
水利工程   10篇
石油天然气   14篇
无线电   14篇
一般工业技术   37篇
冶金工业   19篇
原子能技术   1篇
自动化技术   26篇
  2024年   1篇
  2023年   8篇
  2022年   6篇
  2021年   10篇
  2020年   17篇
  2019年   26篇
  2018年   20篇
  2017年   21篇
  2016年   16篇
  2015年   10篇
  2014年   12篇
  2013年   42篇
  2012年   19篇
  2011年   18篇
  2010年   15篇
  2009年   6篇
  2008年   5篇
  2007年   4篇
  2006年   2篇
  2005年   5篇
  2003年   2篇
  2002年   3篇
  2001年   3篇
  2000年   1篇
  1999年   2篇
  1998年   7篇
  1997年   3篇
  1996年   1篇
  1995年   3篇
  1994年   1篇
  1993年   5篇
  1992年   1篇
  1990年   2篇
  1985年   1篇
  1984年   1篇
  1982年   1篇
排序方式: 共有300条查询结果,搜索用时 359 毫秒
41.
This paper deals with a single-machine scheduling problem with setup time and learning effects. The setup times are proportional to the length of the already processed jobs, i.e., the setup times are job-independent and past-sequence-dependent, and the learning effects are job-independent and position-dependent. The objective is to minimize the sum of earliness penalties subject to no tardy jobs. Wang, Wang, Gao, and Huang [Int J Adv Manuf Technol 48: 739–746, 2010] showed that an optimal sequence for this problem could be obtained by arranging jobs in non-increasing order of processing times. In this paper, we first demonstrate that this result is incorrect, and then introduce new exact solution strategies that polynomially solve problems whose earliness penalties are strictly increasing functions of job earliness. Polynomial time solutions are also presented for some special cases.  相似文献   
42.
Networks with billions of vertices introduce new challenges to perform graph analysis in a reasonable time. Clustering coefficient is an important analytical measure of networks such as social networks and biological networks. To compute clustering coefficient in big graphs, existing distributed algorithms suffer from low efficiency such that they may fail due to demanding lots of memory, or even, if they complete successfully, their execution time is not acceptable for real-world applications. We present a distributed MapReduce-based algorithm, called CCFinder, to efficiently compute clustering coefficient in very big graphs. CCFinder is executed on Apache Spark, a scalable data processing platform. It efficiently detects existing triangles through using our proposed data structure, called FONL, which is cached in the distributed memory provided by Spark and reused multiple times. As data items in the FONL are fine-grained and contain the minimum required information, CCFinder requires less storage space and has better parallelism in comparison with its competitors. To find clustering coefficient, our solution to triangle counting is extended to have degree information of the vertices in the appropriate places. We performed several experiments on a Spark cluster with 60 processors. The results show that CCFinder achieves acceptable scalability and outperforms six existing competitor methods. Four competitors are those methods proposed based on graph processing systems, i.e., GraphX, NScale, NScaleSpark, and Pregel frameworks, and two others are the Cohen’s method and NodeIterator++, introduced based on MapReduce.  相似文献   
43.
The response surface methodology was used to evaluate the effects of extraction time, power of ultrasound, liquid to solid ratio, and solvent composition on the quantity and quality (from aspect of antioxidant activity) phenolics of Stachys lavandulifolia. The best extraction time, power of ultrasound, liquid to solid ratio, and solvent composition for both the quality and quantity of phenolics were 14 min, 300 W, 40 (v/w), and 57% methanol, respectively. Only the liquid to solid ratio was effective on the quality of phenolics. Also, the comparison between the ultrasound-assisted extraction and maceration methods showed the suitability of ultrasound-assisted extraction for extracting phenolics from this plant.  相似文献   
44.
Linear alkyl benzene sulfonate (LAS), which is the most common used anionic surfactant in detergents manufacturing, can discharge onto water resources through wastewater and causes change in taste and odor, disruption in water treatment processes, aquatics death, and oxygen transfer limitation. Accordingly, this article investigates to optimize LAS removal using Fenton oxidation process in Taguchi Method for the first time. LAS removal using Fenton oxidation was perused experimentally in a lab-scale reactor. In order to save relevant costs, 25 runs were qualified to specify the optimum conditions of Fenton oxidation using Taguchi method by Minitab 16 software. Sampling and testing procedures were executed based on the standard methods for the examination of water and wastewater. The optimum conditions included 900 mg/L hydrogen peroxide, 170 mg/L ferrous ion, pH of 4 and the reaction time of 20 min. Fenton oxidation, as a second order reaction with the rate coefficient of 0.0152 L/mg?min, provided 86.5% efficiency for LAS removal in the optimum conditions. Despite Fenton oxidation appeared as a high efficiency process in LAS removal, low removal efficiency of chemical oxygen demand corresponding with LAS affirmed its partial degradation.  相似文献   
45.
This paper considers communication over a multi-hop Rayleigh block-fading channel, where there is no direct link between the transmission ends, and communication is carried out through the use of multiple cascaded relays, employing the Decode and Forward (DF) strategy. It is assumed that the relays cannot do buffering or apply coding over consecutive transmission blocks, and they can merely re-encode the retried information and forward an encoded version of information to the next hop. In this case, assuming the channel information of each hop is not available at the corresponding transmitter and considering the destination either receives a minimum rate R0 or declare an outage event, a multi-layer coding strategy in addition to a single-layer code of the minimum rate R0 are employed, where the optimal power allocation policy across code layers is derived, leading to the maximum average achievable rate for a given outage probability.  相似文献   
46.
47.
Mine Water and the Environment - A shortcoming of the heap leaching process is its inherent limited metal recovery rate, due primarily to preferential pathways, which reduces the efficiency of the...  相似文献   
48.
49.
50.
Abstract

A methodology for the analysis of conjugate problems in the convective drying of porous media is presented. In this study, the interface between porous medium and external convective flow is treated as an internal boundary within a two-phase system rather than a geometric limit. The problems of solid drying and convection boundary layer are connected by expressing the continuity of the state variables and their respective fluxes through the interface. The performance of the proposed methodology is evaluated by applying it to wood-drying problems. The analysis of the drying of porous media as a conjugate problem allows the assessment of the effect of the heat and mass transfer within the solid on the transfer in the adjacent fluid, providing good insight on the complexity of the transfer mechanisms.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号