全文获取类型
收费全文 | 4810篇 |
免费 | 262篇 |
国内免费 | 11篇 |
专业分类
电工技术 | 32篇 |
综合类 | 5篇 |
化学工业 | 1016篇 |
金属工艺 | 96篇 |
机械仪表 | 99篇 |
建筑科学 | 245篇 |
矿业工程 | 8篇 |
能源动力 | 151篇 |
轻工业 | 456篇 |
水利工程 | 48篇 |
石油天然气 | 18篇 |
武器工业 | 2篇 |
无线电 | 421篇 |
一般工业技术 | 886篇 |
冶金工业 | 830篇 |
原子能技术 | 30篇 |
自动化技术 | 740篇 |
出版年
2024年 | 6篇 |
2023年 | 42篇 |
2022年 | 83篇 |
2021年 | 136篇 |
2020年 | 94篇 |
2019年 | 110篇 |
2018年 | 143篇 |
2017年 | 126篇 |
2016年 | 157篇 |
2015年 | 118篇 |
2014年 | 160篇 |
2013年 | 275篇 |
2012年 | 275篇 |
2011年 | 338篇 |
2010年 | 241篇 |
2009年 | 265篇 |
2008年 | 301篇 |
2007年 | 282篇 |
2006年 | 231篇 |
2005年 | 239篇 |
2004年 | 171篇 |
2003年 | 147篇 |
2002年 | 155篇 |
2001年 | 77篇 |
2000年 | 66篇 |
1999年 | 58篇 |
1998年 | 64篇 |
1997年 | 58篇 |
1996年 | 68篇 |
1995年 | 52篇 |
1994年 | 48篇 |
1993年 | 53篇 |
1992年 | 41篇 |
1991年 | 27篇 |
1990年 | 40篇 |
1989年 | 38篇 |
1988年 | 31篇 |
1987年 | 42篇 |
1986年 | 38篇 |
1985年 | 33篇 |
1984年 | 25篇 |
1983年 | 29篇 |
1982年 | 25篇 |
1981年 | 13篇 |
1980年 | 12篇 |
1979年 | 9篇 |
1978年 | 13篇 |
1976年 | 6篇 |
1975年 | 6篇 |
1974年 | 4篇 |
排序方式: 共有5083条查询结果,搜索用时 15 毫秒
21.
Kenneth W. Young Kevin J. Whittle 《Journal of the science of food and agriculture》1985,36(5):383-392
Hunter L, a and b values are used to order fish mince colour according to species or processing parameters. Mince colour difference (ΔE) or statistical examination of L, a and b values are used to establish a 3-dimensional plot to illustrate colour differences between samples. 相似文献
22.
Kevin R. Boyle Martijn Udink Anton de Graauw Leo P. Ligthart 《Antennas and Propagation, IEEE Transactions on》2007,55(2):373-382
A dual-fed, self-diplexing planar inverted F antenna and an associated RF front-end are described. It is shown that co-design of the antenna and front-end can be used to double the operational bandwidth, without significant size or performance penalties. Indeed, the use of two feeds allows the antenna to be self-diplexing, which results in improved overall efficiency 相似文献
23.
Standard procedures for estimating factor scores for the Wechsler Adult Intelligence Scale—Revised (WAIS—R; D. Wechsler, 1981) involve equally weighted sums of the subtests that load most highly on the factor being estimated. We argue that factor scores derived in this manner lack discriminant validity; they are strongly biased toward g (the first unrotated factor) and away from the other 2 unrotated factors. If regression-like weights are applied to all of the WAIS—R subtests and the products are summed, the resulting differentially weighted factors give results that show similar convergent validity and much greater discriminant validity with respect to the original factors. (PsycINFO Database Record (c) 2011 APA, all rights reserved) 相似文献
24.
Hobbie KA Peterson ES Barton ML Waters KM Anderson KA 《Journal of laboratory automation》2012,17(4):275-283
Large collaborative centers are a common model for accomplishing integrated environmental health research. These centers often include various types of scientific domains (e.g., chemistry, biology, bioinformatics) that are integrated to solve some of the nation's key economic or public health concerns. The Superfund Research Center (SRP) at Oregon State University (OSU) is one such center established in 2008 to study the emerging health risks of polycyclic aromatic hydrocarbons while using new technologies both in the field and laboratory. With outside collaboration at remote institutions, success for the center as a whole depends on the ability to effectively integrate data across all research projects and support cores. Therefore, the OSU SRP center developed a system that integrates environmental monitoring data with analytical chemistry data and downstream bioinformatics and statistics to enable complete "source-to-outcome" data modeling and information management. This article describes the development of this integrated information management system that includes commercial software for operational laboratory management and sample management in addition to open-source custom-built software for bioinformatics and experimental data management. 相似文献
25.
Linh Thao Ly Stefanie Rinderle-Ma Kevin G?ser Peter Dadam 《Information Systems Frontiers》2012,14(2):195-219
Key to broad use of process management systems (PrMS) in practice is their ability to foster and ease the implementation,
execution, monitoring, and adaptation of business processes while still being able to ensure robust and error-free process
enactment. To meet these demands a variety of mechanisms has been developed to prevent errors at the structural level (e.g., deadlocks). In many application domains, however, processes often have to comply with business level rules and
policies (i.e., semantic constraints) as well. Hence, to ensure error-free executions at the semantic level, PrMS need certain control mechanisms for validating
and ensuring the compliance with semantic constraints. In this paper, we discuss fundamental requirements for a comprehensive
support of semantic constraints in PrMS. Moreover, we provide a survey on existing approaches and discuss to what extent they
are able to meet the requirements and which challenges still have to be tackled. In order to tackle the particular challenge
of providing integrated compliance support over the process lifecycle, we introduce the SeaFlows framework. The framework
introduces a behavioural level view on processes which serves a conceptual process representation for constraint specification
approaches. Further, it provides general compliance criteria for static compliance validation but also for dealing with process
changes. Altogether, the SeaFlows framework can serve as formal basis for realizing integrated support of semantic constraints
in PrMS. 相似文献
26.
27.
The results of two experiments showed that an illusion of memory can be produced by unconscious perception. In a first phase of those experiments, a long list of words was presented for study. For the test of recognition memory given in the second phase of each experiment, presentation of a "context" word preceded that of most recognition test words. Ss were to judge whether or not the test words had been presented during the earlier study phase of the experiment. Effects of a context word on this recognition memory decision were opposite when Ss were aware vs. unaware of its presentation. For example, as compared to a condition in which no context word was presented, the probability of false recognition was increased when Ss were unaware but decreased when Ss were aware of the presentation of a context word that matched the recognition test word. Results are discussed in terms of unconscious influences on an attribution process. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
28.
The Lovász ?-function (Lovász in IEEE Trans. Inf. Theory, 25:1–7, 1979) of a graph G=(V,E) can be defined as the maximum of the sum of the entries of a positive semidefinite matrix X, whose trace Tr(X) equals 1, and X ij =0 whenever {i,j}∈E. This function appears as a subroutine for many algorithms for graph problems such as maximum independent set and maximum clique. We apply Arora and Kale’s primal-dual method for SDP to design an algorithm to approximate the ?-function within an additive error of δ>0, which runs in time $O(\frac{\vartheta ^{2} n^{2}}{\delta^{2}} \log n \cdot M_{e})$ , where ?=?(G) and M e =O(n 3) is the time for a matrix exponentiation operation. It follows that for perfect graphs G, our primal-dual method computes ?(G) exactly in time O(? 2 n 5logn). Moreover, our techniques generalize to the weighted Lovász ?-function, and both the maximum independent set weight and the maximum clique weight for vertex weighted perfect graphs can be approximated within a factor of (1+?) in time O(? ?2 n 5logn). 相似文献
29.
Lianhang Ma Hao Huang Qinming He Kevin Chiew Zhenguang Liu 《Journal of Intelligent Information Systems》2014,43(1):183-203
Local community detection aims at finding a community structure starting from a seed which is a given vertex in a network without global information, such as online social networks that are too large and dynamic to ever be known fully. Nonetheless, the existing approaches to local community detection are usually sensitive to seeds, i.e., some seeds may lead to missing of some true communities. In this paper, we present a seed-insensitive method called GMAC and its variation iGMAC for local community detection. They estimate the similarity among vertices by investigating vertices’ neighborhoods, and reveal a local community by maximizing its internal similarity and minimizing its external similarity simultaneously. Extensive experimental results on both synthetic and real-world data sets verify the effectiveness of our algorithms. 相似文献
30.
We present several novel techniques to summarize the high-level behavior in surveillance video. Our proposed methods can employ either optical flow or trajectories as input, and incorporate spatial and temporal information together, which improve upon existing approaches for summarization. To begin, we extract common pathway regions by performing graph-based clustering on similarity matrices describing the relationships between location/orientation states. We then employ the activities along the pathway regions to extract the aggregate behavioral patterns throughout scenes. We show how our summarization methods can be applied to detect anomalies, retrieve video clips of interest, and generate adaptive-speed summary videos. We examine our approaches on multiple complex urban scenes and present experimental results. 相似文献