全文获取类型
收费全文 | 2711篇 |
免费 | 84篇 |
国内免费 | 7篇 |
专业分类
电工技术 | 19篇 |
综合类 | 2篇 |
化学工业 | 692篇 |
金属工艺 | 66篇 |
机械仪表 | 71篇 |
建筑科学 | 55篇 |
矿业工程 | 1篇 |
能源动力 | 172篇 |
轻工业 | 199篇 |
水利工程 | 16篇 |
石油天然气 | 15篇 |
武器工业 | 1篇 |
无线电 | 254篇 |
一般工业技术 | 410篇 |
冶金工业 | 477篇 |
原子能技术 | 20篇 |
自动化技术 | 332篇 |
出版年
2023年 | 14篇 |
2022年 | 39篇 |
2021年 | 72篇 |
2020年 | 52篇 |
2019年 | 53篇 |
2018年 | 70篇 |
2017年 | 56篇 |
2016年 | 67篇 |
2015年 | 50篇 |
2014年 | 69篇 |
2013年 | 142篇 |
2012年 | 113篇 |
2011年 | 140篇 |
2010年 | 116篇 |
2009年 | 113篇 |
2008年 | 111篇 |
2007年 | 104篇 |
2006年 | 69篇 |
2005年 | 63篇 |
2004年 | 71篇 |
2003年 | 65篇 |
2002年 | 74篇 |
2001年 | 62篇 |
2000年 | 66篇 |
1999年 | 45篇 |
1998年 | 113篇 |
1997年 | 68篇 |
1996年 | 65篇 |
1995年 | 56篇 |
1994年 | 55篇 |
1993年 | 54篇 |
1992年 | 35篇 |
1991年 | 22篇 |
1990年 | 27篇 |
1989年 | 25篇 |
1988年 | 33篇 |
1987年 | 27篇 |
1986年 | 20篇 |
1985年 | 33篇 |
1984年 | 24篇 |
1983年 | 24篇 |
1982年 | 27篇 |
1981年 | 15篇 |
1980年 | 16篇 |
1978年 | 18篇 |
1977年 | 20篇 |
1976年 | 27篇 |
1975年 | 12篇 |
1974年 | 13篇 |
1973年 | 13篇 |
排序方式: 共有2802条查询结果,搜索用时 15 毫秒
51.
52.
Thomas DM Natarajan V 《IEEE transactions on visualization and computer graphics》2011,17(12):2035-2044
Study of symmetric or repeating patterns in scalar fields is important in scientific data analysis because it gives deep insights into the properties of the underlying phenomenon. Though geometric symmetry has been well studied within areas like shape processing, identifying symmetry in scalar fields has remained largely unexplored due to the high computational cost of the associated algorithms. We propose a computationally efficient algorithm for detecting symmetric patterns in a scalar field distribution by analysing the topology of level sets of the scalar field. Our algorithm computes the contour tree of a given scalar field and identifies subtrees that are similar. We define a robust similarity measure for comparing subtrees of the contour tree and use it to group similar subtrees together. Regions of the domain corresponding to subtrees that belong to a common group are extracted and reported to be symmetric. Identifying symmetry in scalar fields finds applications in visualization, data exploration, and feature detection. We describe two applications in detail: symmetry-aware transfer function design and symmetry-aware isosurface extraction. 相似文献
53.
This paper addresses the problem of autonomous navigation of a micro air vehicle (MAV) in GPS‐denied environments. We present experimental validation and analysis for our system that enables a quadrotor helicopter, equipped with a laser range finder sensor, to autonomously explore and map unstructured and unknown environments. The key challenge for enabling GPS‐denied flight of a MAV is that the system must be able to estimate its position and velocity by sensing unknown environmental structure with sufficient accuracy and low enough latency to stably control the vehicle. Our solution overcomes this challenge in the face of MAV payload limitations imposed on sensing, computational, and communication resources. We first analyze the requirements to achieve fully autonomous quadrotor helicopter flight in GPS‐denied areas, highlighting the differences between ground and air robots that make it difficult to use algorithms developed for ground robots. We report on experiments that validate our solutions to key challenges, namely a multilevel sensing and control hierarchy that incorporates a high‐speed laser scan‐matching algorithm, data fusion filter, high‐level simultaneous localization and mapping, and a goal‐directed exploration module. These experiments illustrate the quadrotor helicopter's ability to accurately and autonomously navigate in a number of large‐scale unknown environments, both indoors and in the urban canyon. The system was further validated in the field by our winning entry in the 2009 International Aerial Robotics Competition, which required the quadrotor to autonomously enter a hazardous unknown environment through a window, explore the indoor structure without GPS, and search for a visual target. © 2011 Wiley Periodicals, Inc. 相似文献
54.
Abraham Debebe Woldeyohannes Mohd Amin Abd Majid 《Simulation Modelling Practice and Theory》2011,19(1):196-212
This paper focuses on developing a simulation model for the analysis of transmission pipeline network system (TPNS) with detailed characteristics of compressor stations. Compressor station is the key element in the TPNS since it provides energy to keep the gas moving. The simulation model is used to create a system that simulates TPNS with different configurations to get pressure and flow parameters. The mathematical formulations for the TPNS simulation were derived from the principles of flow of fluid through pipe, mass balance and compressor characteristics. In order to determine the unknown pressure and flow parameters, a visual C++ code was developed based on Newton–Raphson solution technique. Using the parameters obtained, the model evaluates the energy consumption for various configurations in order to guide for the selection of optimal TPNS. Results from the evaluations of the model with the existing TPNS and comparison with the existing approaches showed that the developed simulation model enabled to determine the operational parameters with less than 10 iterations. Hence, the simulation model could assist in decisions regarding the design and operations of the TPNS. 相似文献
55.
In this paper we introduce the balanced traveling salesman problem (BTSP), which can be used to model optimization problems where equitable distribution of resources are important. BTSP is obviously NP-hard. Efficient heuristic algorithms are presented to solve the problem along with extensive computational results using benchmark problems from TSPLIB and random instances. Our algorithms produced provably optimal solutions for several test instances. Application of the model in solving the nozzle guide vane assembly problem related to the maintenance of aircraft engines is also discussed. 相似文献
56.
The bottleneck network flow problem (BNFP) is a generalization of several well-studied bottleneck problems such as the bottleneck transportation problem (BTP), bottleneck assignment problem (BAP), bottleneck path problem (BPP), and so on. The BNFP can easily be solved as a sequence of O(logn) maximum flow problems on almost unit capacity networks. We observe that this algorithm runs in O(min{m3/2,n2/3m}logn) time by showing that the maximum flow problem on an almost unit capacity graph can be solved in O(min{m3/2,n2/3m}) time. We then propose a faster algorithm to solve the unit capacity BNFP in time, an improvement by a factor of at least . For dense graphs, the improvement is by a factor of . On unit capacity simple graphs, we show that BNFP can be solved in time, an improvement by a factor of . As a consequence we have an algorithm for the BTP with unit arc capacities. 相似文献
57.
Organizational Learning Mechanisms and Creative Climate: Insights from an Italian Fashion Design Company 下载免费PDF全文
Stefano Cirella Filomena Canterino Marco Guerci Abraham B. Shani 《Creativity & Innovation Management》2016,25(2):211-222
This paper investigates the relationship between different types of organizational learning mechanisms and creative climate. In the context of an action research study, this paper focuses on insights from a survey that was administered to all the employees of the Product Design and Development unit of the company. The results demonstrate that the three different types of organizational learning mechanisms considered in the study (cognitive, structural and procedural mechanisms) are associated with creative climate. The study generates new scientific knowledge about the role of organizational learning mechanisms and provides specific recommendations for organizations that aim to enhance creative climate. 相似文献
58.
Tim Menzies Ye Yang George Mathew Barry Boehm Jairus Hihn 《Empirical Software Engineering》2017,22(5):2658-2683
More than half the literature on software effort estimation (SEE) focuses on comparisons of new estimation methods. Surprisingly, there are no studies comparing state of the art latest methods with decades-old approaches. Accordingly, this paper takes five steps to check if new SEE methods generated better estimates than older methods. Firstly, collect effort estimation methods ranging from “classical” COCOMO (parametric estimation over a pre-determined set of attributes) to “modern” (reasoning via analogy using spectral-based clustering plus instance and feature selection, and a recent “baseline method” proposed in ACM Transactions on Software Engineering). Secondly, catalog the list of objections that lead to the development of post-COCOMO estimation methods. Thirdly, characterize each of those objections as a comparison between newer and older estimation methods. Fourthly, using four COCOMO-style data sets (from 1991, 2000, 2005, 2010) and run those comparisons experiments. Fifthly, compare the performance of the different estimators using a Scott-Knott procedure using (i) the A12 effect size to rule out “small” differences and (ii) a 99 % confident bootstrap procedure to check for statistically different groupings of treatments. The major negative result of this paper is that for the COCOMO data sets, nothing we studied did any better than Boehms original procedure. Hence, we conclude that when COCOMO-style attributes are available, we strongly recommend (i) using that data and (ii) use COCOMO to generate predictions. We say this since the experiments of this paper show that, at least for effort estimation, how data is collected is more important than what learner is applied to that data. 相似文献
59.
Marya Wani Vishnupriya Raghavan Dolphy Abraham Virginia Kleist 《Information Systems Frontiers》2017,19(4):769-785
Travel websites are extensively used by travelers for their travel bookings, yet little is known about the hedonic effectiveness of such experiences for the customer. The end users of these websites are customers who may not always be sophisticated information system (IS) users. Further, traditional utility based measures of customer evaluation are dated with respect to the interactive nature of the technology in use and the hedonic benefits that may result from the use of the technology. The evaluation of IS needs to include hedonic measures facilitated by the interactive technology in addition to the traditional utility based measures. We propose and test an evaluation model for retail travel websites that combines the traditional utility based measures with hedonic measures which collectively create a more comprehensive measure for the IS evaluation of consumer focused websites. Thus rooted in theory, the model extends DeLone and McLean’s model of IS Success by adding the construct of User Experience. The model was tested on a sample of 255 customers of travel websites targeted at the Indian market. The results indicate that both utility based and hedonic measures are important factors for customer IS (travel website in this study) evaluation. The larger implications for theory and practice of IS evaluation are explained. 相似文献
60.
This paper revisits the problem of wireframe rendering, which, at first, appears to be an easily solved problem. However, the conventional solution is inefficient and does not result in high-quality images. Recently, graphics hardware programming has been employed to achieve high-quality solid line rendering. In this paper, we present a simpler and faster technique for wireframe rendering based on texture mapping. Our technique does not require (but can benefit from) graphics hardware programming and thus can be easily integrated into existing rendering engines, while resulting in fast, accurate, high-quality, anti-aliased, and still versatile, wireframe drawing. For topologically structured meshes, our approach allows the rendering of wireframe decoupled from the underlying mesh, making possible the rendering of original wireframes on top of decimated meshes. 相似文献