全文获取类型
收费全文 | 4575篇 |
免费 | 208篇 |
国内免费 | 10篇 |
专业分类
电工技术 | 57篇 |
综合类 | 3篇 |
化学工业 | 963篇 |
金属工艺 | 88篇 |
机械仪表 | 67篇 |
建筑科学 | 276篇 |
矿业工程 | 4篇 |
能源动力 | 197篇 |
轻工业 | 482篇 |
水利工程 | 30篇 |
石油天然气 | 9篇 |
无线电 | 393篇 |
一般工业技术 | 840篇 |
冶金工业 | 451篇 |
原子能技术 | 33篇 |
自动化技术 | 900篇 |
出版年
2023年 | 44篇 |
2022年 | 68篇 |
2021年 | 127篇 |
2020年 | 84篇 |
2019年 | 99篇 |
2018年 | 113篇 |
2017年 | 104篇 |
2016年 | 140篇 |
2015年 | 125篇 |
2014年 | 160篇 |
2013年 | 286篇 |
2012年 | 291篇 |
2011年 | 343篇 |
2010年 | 298篇 |
2009年 | 268篇 |
2008年 | 277篇 |
2007年 | 240篇 |
2006年 | 208篇 |
2005年 | 180篇 |
2004年 | 155篇 |
2003年 | 136篇 |
2002年 | 121篇 |
2001年 | 59篇 |
2000年 | 75篇 |
1999年 | 54篇 |
1998年 | 77篇 |
1997年 | 68篇 |
1996年 | 59篇 |
1995年 | 45篇 |
1994年 | 52篇 |
1993年 | 38篇 |
1992年 | 27篇 |
1991年 | 28篇 |
1990年 | 24篇 |
1989年 | 30篇 |
1988年 | 17篇 |
1987年 | 25篇 |
1986年 | 21篇 |
1985年 | 23篇 |
1984年 | 22篇 |
1983年 | 21篇 |
1982年 | 25篇 |
1981年 | 17篇 |
1980年 | 15篇 |
1979年 | 20篇 |
1978年 | 9篇 |
1977年 | 18篇 |
1976年 | 12篇 |
1974年 | 10篇 |
1973年 | 7篇 |
排序方式: 共有4793条查询结果,搜索用时 10 毫秒
71.
Existing transformational leadership research has focused primarily on the behaviors of leaders and their effects on followers. The authors extended this research by examining the social networks of managers who exhibit transformational leadership behaviors. Their focus was on the network of relationships that managers develop and whether they hold key positions in the organization's informal social networks. In a field study using data from 39 managers and 130 nonmanagement employees of 6 organizations, the authors found that managers who score higher on transformational leadership tend to hold more central positions in organizational advice and influence networks. Furthermore, the direct reports of these leaders were also more central in informal organizational networks. These results illuminate one of the ways that managers who exhibit transformational leadership behaviors may exert influence in organizations. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
72.
French Douglas J.; No?l Marc; Vigneau Fran?ois; French Julie A.; Cyr Chantal P.; Evans R. Thomas 《Canadian Metallurgical Quarterly》2005,37(3):181
This study examined the psychometric properties of the PCS-CF, a French-Canadian adaptation of the Pain Catastrophizing Scale (Sullivan, Bishop & Pivik, 1995). One hundred and twenty undergraduate students (83 women; 37 men) completed the PCS-CF and measures of anxiety and depression prior to immersing their hand in ice water for 1-minute. A subset of 39 participants (28 females; 11 males) also completed a second pain task involving an ascending series of electrocutaneous stimulations. Participants' verbal and non-verbal pain behaviours during and immediately after the immersion task were recorded and subsequently independently coded. Reliability analyses revealed that the PCS-CF total score and subscale scores have a high degree of internal consistency and test-retest reliabilities that are comparable to the original Pain Catastrophizing Scale. PCS-CF scores were associated with higher levels of self-reported pain during the ice water immersion task and decreased pain tolerance during electrocutaneous stimulation. Individuals with elevated PCS-CF scores also displayed a more diverse repertoire of pain behaviours than their low PCS-CF counterparts. Previous findings that catastrophizing scores are able to discriminate criterion groups of males and females were also replicated. Given the highly correlated factors obtained in analyses of the dimensionality of the PCS-CF, the structure suggested by the authors of the original scale is only partially supported. However, the results taken together suggest that the PCS-CF is both a reliable and valid measure of the pain catastrophizing construct that is psychometrically comparable to the original PCS. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
73.
Marc L. Imhoff Thomas D. Sisk Anthony Milne Garth Morgan Tony Orr 《Remote sensing of environment》1997,60(3):217-227
An integrated remote sensing/field ecology project linked the use of synthetic aperture radar (SAR) and aerial photography to studies of landscape spatial heterogeneity and bird community ecology. P-, L-, and C-band SAR data, collected over a section of Kakadu National Park in Australia's Northern Territory during the Joint NASA/Australia DC-8 data acquisition campaign, were analyzed in light of field data integrating vegetation structure and floristics with bird abundances across a heterogeneous study site. Results indicate that SAR data are able to discern structural differences relevant to bird habitat quality within floristically homogeneous stands, while multispectral sensors successfully identified floristic differences among habitat types. Simplifying indices of bird diversity showed ambiguous changes across the site; however, the abundances of individual species were observed to change significantly across both floristic and structural gradients. These results suggest that efforts to map bird diversity should focus on species-specific habitat relationships and that some measure of vegetation structure is needed to understand bird habitat. The approach employed here advances the use of SAR data in the three-dimensional mapping of animal habitats from remotely sensed data, and extends current capabilities for mapping and modeling large-scale patterns in the distribution of biological diversity. 相似文献
74.
75.
The graph partitioning problem consists of dividing the vertices of a graph into clusters, such that the weight of the edges crossing between clusters is minimized. We present a new compact mathematical formulation of this problem, based on the use of binary representation for the index of clusters assigned to vertices. This new formulation is almost minimal in terms of the number of variables and constraints and of the density of the constraint matrix. Its linear relaxation brings a very fast computational resolution, compared with the standard one.Experiments were conducted on classical large benchmark graphs designed for comparing heuristic methods. On one hand, these experiments show that the new formulation is surprisingly less time efficient than expected on general k-partitioning problems. On the other hand, the new formulation applied on bisection problems allows to obtain the optimum solution for about ten instances, where only best upper bounds were previously known. 相似文献
76.
David Gabriel Huub H. J. Cox Marc A. Deshusses 《Canadian Metallurgical Quarterly》2004,130(10):1110-1117
Until recently, biological treatment of odors in biofilters or biotrickling filters was thought to require a longer gas contact time than chemical scrubbing, hence bioreactors for air treatment required a larger footprint. This paper discusses the conversion of chemical scrubbers to biological trickling filters. Initially, research was conducted with a laboratory-scale biotrickling filter. An effective open-pore polyurethane packing material was identified and H2S biotreatment performance was quantified. Key technical issues in determining the general suitability of converting wet scrubbers to biotrickling filters were identified, and a generic ten-step conversion procedure was developed. Following the laboratory research, five full-scale chemical scrubbers treating odorous air at the Sanitation District of Orange County, Calif., were converted to biotrickling filters. The original airflow rate was maintained, resulting in a gas contact time as low as 1.6–3.1?s. The converted biotrickling filters demonstrated an excellent capability for treating high H2S concentrations to concentrations below regulatory limits. This study shows outstanding potential for converting chemical scrubbers to biotrickling filters at publicly owned treatment works. 相似文献
77.
Marc Rennhard Sandro Rafaeli Laurent Mathy Bernhard Plattner David Hutchison 《Electronic Commerce Research》2004,4(1-2):83-111
The lack of privacy is one of the main reasons that limits trust in e-commerce. Current e-commerce practice enforces a customer to disclose her identity to the e-shop and the use of credit cards makes it straightforward for an e-shop to know the real identity of its customers. Although there are some payment systems based on untraceable tokens, they are not as widely used as credit cards. Furthermore, even without buying anything, a customer is already disclosing some information about who or where she may be by just connecting to the e-shop's web server and leaving behind an IP-address. In this paper, we present novel components that enable secure pseudonymous e-commerce. On the one hand, these components allow a customer to browse through an e-shop, select goods, and pay the goods with her credit card such that neither the e-shop operator nor the credit card issuer nor an eavesdropper is able to get any information about the customer's identity. On the other hand, it is guaranteed that none of the involved parties is able to act dishonestly during the credit card payment. Such a system could greatly enhance trust in e-commerce since it overcomes the customers' privacy concerns. 相似文献
78.
This paper represents a first attempt at a systematic study of sensitivity analysis for scheduling problems. Because schedules contain both combinatorial and temporal structures, scheduling problems present unique issues for sensitivity analysis. Some of the issues that we discuss have not been considered before. Others, while studied before, have not been explored in the context of scheduling. The applicability of these issues is illustrated using well-known scheduling models. We provide fast methods to determine when a previously optimal schedule remains optimal. Other methods restore an optimal schedule after a parameter change. The value of studying the sensitivity of an optimal sequence instead of the sensitivity of an optimal schedule is demonstrated. We show that, for some problems, sensitivity analysis results depend on the positions of jobs with changed parameters. We identify scheduling problems where performing additional or different computations during optimization facilitates sensitivity analysis. To improve the robustness of an optimal schedule, selection among multiple optimal schedules is considered. We discuss which types of sensitivity analysis questions are intractable because the scheduling problem itself is intractable. We also study how heuristic error bounds vary when the data of a scheduling problem is continuously modified. Although we focus on scheduling problems, several of the issues we discuss and our classification scheme can be extended to other optimization problems. 相似文献
79.
Marc Bodson Shankar SastryBrian D. O. Anderson Iven Mareels Robert R. Bitmead 《Systems & Control Letters》1986,7(3)
The paper presents nonlinear averaging theorems for two-time scale systems, where the dynamics of the fast system are allowed to vary with the slow system. The results are applied to the Narendra-Valavani adaptive control algorithm, and estimates of the parameter convergence rates are obtained which do not rely on a linearization of the system around the equilibrium, and therefore are valid in a larger region in the parameter space. 相似文献
80.
Representing Animations by Principal Components 总被引:10,自引:1,他引:10
In this paper, we present a representation for three-dimensional geometric animation sequences. Different from standard key-frame techniques, this approach is based on the determination of principal animation components and decouples the animation from the underlying geometry. The new representation supports progressive animation compression with spatial, as well as temporal, level-of-detail and high compression ratios. The distinction of animation and geometry allows for mapping animations onto other objects. 相似文献