全文获取类型
收费全文 | 1607篇 |
免费 | 109篇 |
国内免费 | 2篇 |
专业分类
电工技术 | 12篇 |
综合类 | 2篇 |
化学工业 | 367篇 |
金属工艺 | 31篇 |
机械仪表 | 59篇 |
建筑科学 | 78篇 |
矿业工程 | 3篇 |
能源动力 | 131篇 |
轻工业 | 169篇 |
水利工程 | 17篇 |
石油天然气 | 8篇 |
无线电 | 140篇 |
一般工业技术 | 287篇 |
冶金工业 | 103篇 |
原子能技术 | 19篇 |
自动化技术 | 292篇 |
出版年
2024年 | 5篇 |
2023年 | 19篇 |
2022年 | 41篇 |
2021年 | 46篇 |
2020年 | 50篇 |
2019年 | 49篇 |
2018年 | 82篇 |
2017年 | 53篇 |
2016年 | 88篇 |
2015年 | 45篇 |
2014年 | 78篇 |
2013年 | 162篇 |
2012年 | 88篇 |
2011年 | 123篇 |
2010年 | 72篇 |
2009年 | 157篇 |
2008年 | 99篇 |
2007年 | 70篇 |
2006年 | 72篇 |
2005年 | 40篇 |
2004年 | 38篇 |
2003年 | 34篇 |
2002年 | 29篇 |
2001年 | 20篇 |
2000年 | 18篇 |
1999年 | 10篇 |
1998年 | 25篇 |
1997年 | 16篇 |
1996年 | 9篇 |
1995年 | 12篇 |
1994年 | 5篇 |
1993年 | 5篇 |
1992年 | 5篇 |
1991年 | 4篇 |
1990年 | 5篇 |
1989年 | 3篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 2篇 |
1984年 | 3篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1980年 | 2篇 |
1979年 | 7篇 |
1978年 | 3篇 |
1977年 | 2篇 |
1975年 | 1篇 |
1974年 | 3篇 |
1973年 | 2篇 |
排序方式: 共有1718条查询结果,搜索用时 15 毫秒
21.
The kinetics of non-congruent dissolution of long E-glass fiber in saturated calcium hydroxide solution has been investigated at 25°C in a closed reactor adopting the rotating disc method for the sample holder. The fiber dissolution rate (), measured from the relative loss weight of the fiber after selective dissolution of the attack layer in acetic acid, is a linear function of time, what implies an interfacial dissolution process. However, the kinetics does not stay regular for a long time due to local detachment of the attack layer. The comparison between = f (t) and ′ = f (t) curves, where ′ is the formation rate of the attack layer, shows that the formation of the layer does not only imply the deposit of a bad-crystalline hydrated calcium silicate but the nucleation and growth of solid calcium hydroxide and calcium carbonate resulting from the transfert, to the interface, of ions coming from the liquid phase. This phenomenon was precedently observed by some other authors in the case of glass-fiber reinforced cement matrix. 相似文献
22.
It is commonly accepted that an individual's beliefs and actions are based on his or her assessment and perceptions of the world. In order to determine what practices an individual is likely to follow at any given time, it is necessary to understand the individual's behavioral intention in a given circumstance. From an Information Technology perspective, a software development professional's belief systems are potentially the basis for the adoption and implementation of new and innovative work practices and processes. In this article, we explore the belief systems of software development professionals in order to understand the beliefs underlying intention and practice, and we seek answers about how they adopt or reject new and innovative software development processes and practices. The results point out a strong influence of past experiences, personality types, and repeated behavior on current software development processes and practices in industrial settings. 相似文献
23.
24.
In this paper, metamodeling and five well-known metaheuristic optimization algorithms were used to reduce the weight and improve crash and NVH attributes of a vehicle simultaneously. A high-fidelity full vehicle model is used to analyze peak acceleration, intrusion and component’s internal-energy under Full-Frontal, Offset-Frontal, and Side crash scenarios as well as vehicle natural frequencies. The radial basis functions method is used to approximate the structural responses. A nonlinear surrogate-based mass minimization was formulated and solved by five different optimization algorithms under crash-vibration constraints. The performance of these algorithms is investigated and discussed. 相似文献
25.
Murat Kalender Ahmed Kheiri Ender Özcan Edmund K. Burke 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2013,17(12):2279-2292
Educational timetabling problem is a challenging real world problem which has been of interest to many researchers and practitioners. There are many variants of this problem which mainly require scheduling of events and resources under various constraints. In this study, a curriculum based course timetabling problem at Yeditepe University is described and an iterative selection hyper-heuristic is presented as a solution method. A selection hyper-heuristic as a high level methodology operates on the space formed by a fixed set of low level heuristics which operate directly on the space of solutions. The move acceptance and heuristic selection methods are the main components of a selection hyper-heuristic. The proposed hyper-heuristic in this study combines a simulated annealing move acceptance method with a learning heuristic selection method and manages a set of low level constraint oriented heuristics. A key goal in hyper-heuristic research is to build low cost methods which are general and can be reused on unseen problem instances as well as other problem domains desirably with no additional human expert intervention. Hence, the proposed method is additionally applied to a high school timetabling problem, as well as six other problem domains from a hyper-heuristic benchmark to test its level of generality. The empirical results show that our easy-to-implement hyper-heuristic is effective in solving the Yeditepe course timetabling problem. Moreover, being sufficiently general, it delivers a reasonable performance across different problem domains. 相似文献
26.
Ali R. Yildiz 《Applied Soft Computing》2013,13(3):1433-1439
Hybridizing of the optimization algorithms provides a scope to improve the searching abilities of the resulting method. The purpose of this paper is to develop a novel hybrid optimization algorithm entitled hybrid robust differential evolution (HRDE) by adding positive properties of the Taguchi's method to the differential evolution algorithm for minimizing the production cost associated with multi-pass turning problems. The proposed optimization approach is applied to two case studies for multi-pass turning operations to illustrate the effectiveness and robustness of the proposed algorithm in machining operations. The results reveal that the proposed hybrid algorithm is more effective than particle swarm optimization algorithm, immune algorithm, hybrid harmony search algorithm, hybrid genetic algorithm, scatter search algorithm, genetic algorithm and integration of simulated annealing and Hooke-Jeevespatter search. 相似文献
27.
In many wireless sensor network (WSN) applications, the location of a sensor node is crucial for determining where the event or situation of interest occurred. Therefore, localization is one of the critical challenges in WSNs. Mobile anchor node assisted localization (MANAL) is one of the promising solutions for the localization of statically deployed sensors. The main problem in MANAL localization is that the path planning of the mobile anchor (MA) node should be done so that the localization error in the network will be minimal and that all unknown nodes in the network are covered. This paper proposes a new path planning approach called nested hexagons curves (NHexCurves) for MANAL. NHexCurves guarantees that it will receive messages from at least three non-collinear anchors to locate all unknown nodes in the network. The proposed model has compared six different path planning schemes in the literature using weighted centroid localization (WCL). In these comparisons, first of all, localization errors of the models are compared using some statistical concepts. Second, the variation of the localization error according to parameters such as resolution (R) and the standard deviation of noise (σ) is observed. Then, with similar approaches, the standard deviation of errors, localization ratio, scalability performances, and finally, path lengths of the models are examined. The simulation results show that the NHexCurves static path planning model proposed in this study stands out compared to other models with high localization error and localization ratio performance, especially at low resolutions, due to its path design. At the same time, the lowest error values according to σ are obtained with the proposed model among all models considered. 相似文献
28.
29.
The wavelet domain association rules method is proposed for efficient texture characterization. The concept of association rules to capture the frequently occurring local intensity variation in textures. The frequency of occurrence of these local patterns within a region is used as texture features. Since texture is basically a multi-scale phenomenon, multi-resolution approaches such as wavelets, are expected to perform efficiently for texture analysis. Thus, this study proposes a new algorithm which uses the wavelet domain association rules for texture classification. Essentially, this work is an extension version of an early work of the Rushing et al. [10], [11], where the generation of intensity domain association rules generation was proposed for efficient texture characterization. The wavelet domain and the intensity domain (gray scale) association rules were generated for performance comparison purposes. As a result, Rushing et al. [10], [11] demonstrated that intensity domain association rules performs much more accurate results than those of the methods which were compared in the Rushing et al. work. Moreover, the performed experimental studies showed the effectiveness of the wavelet domain association rules than the intensity domain association rules for texture classification problem. The overall success rate is about 97%. 相似文献
30.
Mathematical model of vertical electrical sounding by using resistivity method is studied. The model leads to an inverse problem of determination of the unknown leading coefficient (conductivity) of the elliptic equation in R2 in a slab. The direct problem is obtained in the form of mixed BVP in axisymmetric cylindrical coordinates. The additional (available measured) data is given on the upper boundary of the slab, in the form of tangential derivative. Due to ill-conditionedness of the considered inverse problem the logarithmic transformation is applied to the unknown coefficient and the inverse problem is studied as a minimization problem for the cost functional, with respect to the reflection coefficient. The Conjugate Gradient method (CGM) is applied for the numerical solution of this problem. Computational experiments were performed with noise free and random noisy data. 相似文献