全文获取类型
收费全文 | 385篇 |
免费 | 9篇 |
国内免费 | 9篇 |
学科分类
工业技术 | 403篇 |
出版年
2023年 | 1篇 |
2022年 | 3篇 |
2021年 | 3篇 |
2020年 | 7篇 |
2019年 | 5篇 |
2018年 | 1篇 |
2017年 | 10篇 |
2016年 | 21篇 |
2015年 | 13篇 |
2014年 | 26篇 |
2013年 | 32篇 |
2012年 | 23篇 |
2011年 | 23篇 |
2010年 | 19篇 |
2009年 | 20篇 |
2008年 | 23篇 |
2007年 | 21篇 |
2006年 | 29篇 |
2005年 | 20篇 |
2004年 | 17篇 |
2003年 | 21篇 |
2002年 | 6篇 |
2001年 | 5篇 |
2000年 | 7篇 |
1999年 | 6篇 |
1998年 | 8篇 |
1997年 | 4篇 |
1996年 | 4篇 |
1995年 | 3篇 |
1994年 | 3篇 |
1993年 | 4篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1986年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 3篇 |
1979年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有403条查询结果,搜索用时 15 毫秒
1.
2.
中铝河南分公司矿山在土地复垦中的有益探索 总被引:1,自引:0,他引:1
分析了铝土矿露天开采和土地、环境之间的利害关系,并对矿山公司“土地复垦”工艺技术进行了阐述,介绍了中铝河南分公司矿山公司方面的具体作法和成功经验。 相似文献
3.
In this paper the dynamic location problem with opening, closure and reopening of facilities is formulated and an efficient primal-dual heuristic that computes both upper and lower limits to its optimal solution is described. The problem here studied considers the possibility of reconfiguring any location more than once over the planning horizon. This problem is NP-hard (the simple plant location problem is a special case of the problem studied). A primal-dual heuristic based on the work of Erlenkotter [A dual-based procedure for uncapacitated facility location. Operations Research 1978;26:992–1009] and Van Roy and Erlenkotter [A dual-based procedure for dynamic facility location. Management Science 1982;28:1091–105] was developed and tested over a set of randomly generated test problems. The results obtained are quite good, both in terms of the quality of lower and upper bounds calculated as in terms of the computational time spent by the heuristic. A branch-and-bound procedure that enables to optimize the problem is also described and tested over the same set of randomly generated problems. 相似文献
4.
In this paper, we consider the problem of determining a best compromise solution for the multi-objective assignment problem. Such a solution minimizes a scalarizing function, such as the weighted Tchebychev norm or reference point achievement functions. To solve this problem, we resort to a ranking (or k-best) algorithm which enumerates feasible solutions according to an appropriate weighted sum until a condition, ensuring that an optimal solution has been found, is met. The ranking algorithm is based on a branch and bound scheme. We study how to implement efficiently this procedure by considering different algorithmic variants within the procedure: choice of the weighted sum, branching and bounding schemes. We present an experimental analysis that enables us to point out the best variants, and we provide experimental results showing the remarkable efficiency of the procedure, even for large size instances. 相似文献
5.
《Microprocessors and Microsystems》2014,38(7):717-729
High single instruction multiple data (SIMD) efficiency and low power consumption have made graphic processing units (GPUs) an ideal platform for many complex computational applications. Thousands of threads can be created by programmers and grouped into fixed-size SIMD batches, known as warps. High throughput is then achieved by concurrently executing such warps with minimal control overhead. However, if a branch instruction occurs, which assigns different paths to different threads, one warp will be broken into multiple warps that have to be executed serially, consequently reducing the efficiency advantage of SIMD. In this paper, the contemporary fixed-size warp design is abandoned for a hybrid warp size (HWS) mechanism. Mixed-size warps are generated according to HWS and are scheduled and issued flexibly. The simulation results show that this mechanism yields an average speedup of 1.20 over the baseline architecture for a wide variety of general purpose GPU applications. The paper also integrates HWS with dynamic warp formation (DWF), which is a well-known branch handling mechanism used to improve SIMD utilization by forming new warps out of split warps in real time. The simulation results show that the combination of DWF and HWS generates an average speedup of 1.27 over the DWF-only platform with an estimated area increase of about 1% of DWF. 相似文献
6.
刘兴鸿 《安徽冶金科技职业学院学报》2015,(4):100-102
基层党支部是党在社会基层组织中的战斗堡垒,是从思想上、政治上凝聚团结广大群众的核心,是基层各项工作的组织者,是贯彻落实党的方针路线政策的决定性力量。当前形势下,我国经济步入新常态,适应新常态必须加强基层党建工作,针对党支部地位、作用弱化、组织教育缺乏活力、队伍建设有待加强等问题,笔者提出自己的几点思考。 相似文献
7.
学习型离退休党支部建设探析 总被引:1,自引:0,他引:1
李蜀江 《江汉石油职工大学学报》2014,27(5):90-91
建设学习型离退休党组织,对加强离退休党支部建设,提升党组织凝聚力和战斗力具有重要意义。建设学习型离退休党支部是推动离退休党建工作科学开展的需要,是发挥离退休党员干部参谋助手作用的需要,是提高离退休党员干部生活质量的需要。建设学习型离退休党支部,必须把理论武装工作放在首位,必须服务于党的中心工作,必须立足于离退休党员干部素质的提高。我们要努力营造建设学习型离退休党支部的浓厚氛围;强化建设学习型离退休党支部的制度保障;采取确保学习效果的多种学习方式。 相似文献
8.
本文首先介绍了系统失效的分支-界限分析法,然后以空间桁架系统为例用分支-界限分析法进行了可靠性分析。系统失效的分支-界限分析法直观、明了,适合对实际工程中的复杂系统进行可靠性分析。 相似文献
9.
10.
Abstract. An upward planar drawing of a directed graph (digraph) is a planar drawing such that all the edges are represented by curves
monotonically increasing in the vertical direction. In this paper we introduce and study the concept of quasi-upward planarity.
Quasi-upward planarity allows us to extend the upward planarity theory to a large class of digraphs including digraphs that
also have directed cycles. First, we characterize the digraphs that have a quasi-upward planar drawing. Second, we give a
polynomial time algorithm for computing ``optimal' quasi-upward planar drawings within a given planar embedding. Further,
we apply branch and bound techniques to the problem of computing optimal quasi-upward planar drawings, considering all possible
planar embeddings. The paper also contains experimental results about the proposed techniques. 相似文献