全文获取类型
收费全文 | 212篇 |
免费 | 5篇 |
国内免费 | 6篇 |
专业分类
电工技术 | 2篇 |
综合类 | 13篇 |
化学工业 | 14篇 |
金属工艺 | 8篇 |
机械仪表 | 10篇 |
建筑科学 | 2篇 |
矿业工程 | 12篇 |
能源动力 | 2篇 |
轻工业 | 13篇 |
水利工程 | 2篇 |
无线电 | 8篇 |
一般工业技术 | 12篇 |
冶金工业 | 4篇 |
原子能技术 | 1篇 |
自动化技术 | 120篇 |
出版年
2024年 | 1篇 |
2022年 | 1篇 |
2021年 | 3篇 |
2020年 | 2篇 |
2019年 | 3篇 |
2018年 | 4篇 |
2017年 | 2篇 |
2016年 | 11篇 |
2015年 | 7篇 |
2014年 | 10篇 |
2013年 | 10篇 |
2012年 | 14篇 |
2011年 | 19篇 |
2010年 | 12篇 |
2009年 | 9篇 |
2008年 | 12篇 |
2007年 | 12篇 |
2006年 | 9篇 |
2005年 | 9篇 |
2004年 | 4篇 |
2003年 | 11篇 |
2002年 | 8篇 |
2001年 | 4篇 |
2000年 | 4篇 |
1999年 | 7篇 |
1998年 | 6篇 |
1997年 | 8篇 |
1996年 | 3篇 |
1995年 | 5篇 |
1994年 | 4篇 |
1993年 | 2篇 |
1992年 | 4篇 |
1991年 | 1篇 |
1988年 | 1篇 |
1987年 | 1篇 |
排序方式: 共有223条查询结果,搜索用时 15 毫秒
1.
钢包钢水保温覆盖剂的开发 总被引:2,自引:0,他引:2
研制了钢包钢水新型保温覆盖剂,主要成分为(%);15-25C,20-35SiO2,10-20Al2O3,2-5Fe2O3,15-25CaO,2-5MgO,新覆盖剂铺展性与保温性能良好。经转炉钢水160t钢包生产使用,统计数据表明,镇静15min后钢水降温速度由原碳化稻壳覆盖剂1.33℃/min降低到0.93℃/min。 相似文献
2.
Andrzej Lingas 《Information Processing Letters》2007,104(6):220-227
In 1986, Keil provided an O(n2) time algorithm for the problem of covering monotone orthogonal polygons with the minimum number of r-star-shaped orthogonal polygons. This was later improved to O(n) time and space by Gewali et al. in [L. Gewali, M. Keil, S.C. Ntafos, On covering orthogonal polygons with star-shaped polygons, Information Sciences 65 (1992) 45-63]. In this paper we simplify the latter algorithm—we show that with a little modification, the first step Sweep1 of the discussed algorithm—which computes the top ceilings of horizontal grid segments—can be omitted.In addition, for the minimum orthogonal guard problem in the considered class of polygons, our approach provides a linear time algorithm which uses O(k) additional space, where k is the size of the optimal solution—the algorithm in [L. Gewali, M. Keil, S.C. Ntafos, On covering orthogonal polygons with star-shaped polygons, Information Sciences 65 (1992) 45-63] uses both O(n) time and O(n) additional space. 相似文献
3.
We consider the problem of finding the repetitive structures of a given stringx. The periodu of the stringx grasps the repetitiveness ofx, sincex is a prefix of a string constructed by concatenations ofu. We generalize the concept of repetitiveness as follows: A stringw covers a stringx if there is a superstring ofx which is constructed by concatenations and superpositions ofw. A substringw ofx is called aseed ofx ifw coversx. We present anO(n logn)-time algorithm for finding all the seeds of a given string of lengthn.Partially supported by SERC Grants GR/F 00898 and GR/J 17844, NATO Grant CRG 900293, ESPRIT BRA Grant 7131 for ALCOMII, and MRC Grant G 9115730.Partially supported by MRC Grant G 9115730 and S.N.U. Posco Research Fund 94-15-1112. 相似文献
4.
Emergency medical service (EMS) providers continually seek ways to improve system performance particularly the response time to incidents. The demand for ambulances fluctuate throughout the week, depending on the day of week, and even the time of day, therefore EMS operators can improve system performance by dynamic relocation/redeployment of ambulances in response to fluctuating demand patters. The objective of the model is to determine the minimum number of ambulances and their locations for each time cluster in which significant changes in demand pattern occur while meeting coverage requirement with a predetermined reliability. The model is further enhanced by calculating ambulance specific busy probabilities and validated by a comprehensive simulation model. Computational results on experimental data sets and data from an EMS agency are provided. 相似文献
5.
Eric C.C. Tsang Chen Degang Daniel S. Yeung 《Computers & Mathematics with Applications》2008,56(1):279-289
The covering generalized rough sets are an improvement of traditional rough set model to deal with more complex practical problems which the traditional one cannot handle. It is well known that any generalization of traditional rough set theory should first have practical applied background and two important theoretical issues must be addressed. The first one is to present reasonable definitions of set approximations, and the second one is to develop reasonable algorithms for attributes reduct. The existing covering generalized rough sets, however, mainly pay attention to constructing approximation operators. The ideas of constructing lower approximations are similar but the ideas of constructing upper approximations are different and they all seem to be unreasonable. Furthermore, less effort has been put on the discussion of the applied background and the attributes reduct of covering generalized rough sets. In this paper we concentrate our discussion on the above two issues. We first discuss the applied background of covering generalized rough sets by proposing three kinds of datasets which the traditional rough sets cannot handle and improve the definition of upper approximation for covering generalized rough sets to make it more reasonable than the existing ones. Then we study the attributes reduct with covering generalized rough sets and present an algorithm by using discernibility matrix to compute all the attributes reducts with covering generalized rough sets. With these discussions we can set up a basic foundation of the covering generalized rough set theory and broaden its applications. 相似文献
6.
一种新的覆盖粗糙集及其模糊性度量 总被引:2,自引:0,他引:2
在覆盖近似空间中定义了一类新的模糊集,给出了该类模糊集的模糊性度量,讨论模糊集及其模糊度量的性质,最后通过实例给出直观解释. 相似文献
7.
Let S be a set of elements. We say that a collection C of subsets of S has the consecutive ones property if there exist a linear order on S and a 0-1 matrix M, where Mij=1 if and only if the jth element is in the ith set in C, such that all 1's appear consecutively in each row of M. A set X∈C is hit by a subset S′⊆S if X∩S′≠∅. Let Cr (red collection) and Cb (blue collection) be two collections of subsets of S respectively. The red-blue hitting set problem asks for a subset S′⊆S such that all sets in the blue collection are hit by S′, while the number of sets in the red collection hit by S′ has to be minimum. We present a shortest-path based algorithm with time complexity O(|Cb||S|+|Cr||S|+2|S|) for this problem with Cr∪Cb having the consecutive ones property, which improves the previous time bound O(|Cr||Cb|2|S|) by Dom et al. (2008) [8]. 相似文献
8.
In this paper, we study two interesting variants of the classical bin packing problem, called Lazy Bin Covering (LBC) and Cardinality Constrained Maximum Resource Bin Packing (CCMRBP) problems. For the offline LBC problem, we first prove the approximation ratio of the First-Fit-Decreasing and First-Fit-Increasing algorithms, then present an APTAS. For the online LBC problem, we give a competitive analysis for the algorithms of Next-Fit, Worst-Fit, First-Fit, and a modified HARMONICM algorithm. The CCMRBP problem is a generalization of the Maximum Resource Bin Packing (MRBP) problem Boyar et al. (2006) [1]. For this problem, we prove that its offline version is no harder to approximate than the offline MRBP problem. 相似文献
9.
In this paper we describe and solve the following geometric optimisation problem: given a set S of n points on the plane (antennas) and two points A and B, find the smallest radial range r∈ℜ+ (power transmission range of the antennas) so that a path with endpoints A and B exists in which all points are within the range of at least two antennas. The solution to the problem has several applications (e.g., in the planning of safe routes). We present an O(nlogn) time solution, which is based on the second order Voronoi diagram. We also show how to obtain a path with such characteristics. 相似文献
10.
Bih-Sheue Shieh 《Information Sciences》2011,181(4):832-841
The work examines the feasibility of minimizing a linear objective function subject to a max-t fuzzy relation equation constraint, where t is a continuous/Archimedean t-norm. Conventional methods for solving this problem are significantly improved by, first separating the problem into two sub-problems according to the availability of positive coefficients. This decomposition is thus more easily handled than in previous literature. Next, based on use of the maximum solution of the constraint equation, the sub-problem with non-positive coefficients is solved and the size of the sub-problem with positive coefficients reduced as well. This step is unique among conventional methods, owing to its ability to determine as many optimal variables as possible. Additionally, several rules are developed for simplifying the remaining problem. Finally, those undecided optimal variables are obtained using the covering problem rather than the branch-and-bound methods. Three illustrative examples demonstrate that the proposed approach outperforms conventional schemes. Its potential applications are discussed as well. 相似文献