全文获取类型
收费全文 | 50291篇 |
免费 | 3017篇 |
国内免费 | 46篇 |
专业分类
电工技术 | 355篇 |
综合类 | 21篇 |
化学工业 | 10264篇 |
金属工艺 | 874篇 |
机械仪表 | 1034篇 |
建筑科学 | 1486篇 |
矿业工程 | 104篇 |
能源动力 | 1050篇 |
轻工业 | 8845篇 |
水利工程 | 524篇 |
石油天然气 | 191篇 |
武器工业 | 6篇 |
无线电 | 1932篇 |
一般工业技术 | 8360篇 |
冶金工业 | 11205篇 |
原子能技术 | 180篇 |
自动化技术 | 6923篇 |
出版年
2024年 | 110篇 |
2023年 | 453篇 |
2022年 | 569篇 |
2021年 | 1238篇 |
2020年 | 1063篇 |
2019年 | 1168篇 |
2018年 | 2046篇 |
2017年 | 2009篇 |
2016年 | 2117篇 |
2015年 | 1585篇 |
2014年 | 1897篇 |
2013年 | 4027篇 |
2012年 | 3002篇 |
2011年 | 2773篇 |
2010年 | 2306篇 |
2009年 | 2049篇 |
2008年 | 2055篇 |
2007年 | 1908篇 |
2006年 | 1287篇 |
2005年 | 1109篇 |
2004年 | 1001篇 |
2003年 | 955篇 |
2002年 | 869篇 |
2001年 | 667篇 |
2000年 | 596篇 |
1999年 | 648篇 |
1998年 | 3537篇 |
1997年 | 2325篇 |
1996年 | 1505篇 |
1995年 | 887篇 |
1994年 | 673篇 |
1993年 | 735篇 |
1992年 | 261篇 |
1991年 | 253篇 |
1990年 | 191篇 |
1989年 | 200篇 |
1988年 | 212篇 |
1987年 | 187篇 |
1986年 | 170篇 |
1985年 | 192篇 |
1984年 | 169篇 |
1983年 | 115篇 |
1982年 | 153篇 |
1981年 | 179篇 |
1980年 | 195篇 |
1979年 | 94篇 |
1978年 | 92篇 |
1977年 | 337篇 |
1976年 | 724篇 |
1973年 | 86篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
821.
We present and analyze an unsupervised method for Word Sense Disambiguation (WSD). Our work is based on the method presented
by McCarthy et al. in 2004 for finding the predominant sense of each word in the entire corpus. Their maximization algorithm allows weighted
terms (similar words) from a distributional thesaurus to accumulate a score for each ambiguous word sense, i.e., the sense
with the highest score is chosen based on votes from a weighted list of terms related to the ambiguous word. This list is
obtained using the distributional similarity method proposed by Lin Dekang to obtain a thesaurus. In the method of McCarthy
et al., every occurrence of the ambiguous word uses the same thesaurus, regardless of the context where the ambiguous word occurs.
Our method accounts for the context of a word when determining the sense of an ambiguous word by building the list of distributed
similar words based on the syntactic context of the ambiguous word. We obtain a top precision of 77.54% of accuracy versus
67.10% of the original method tested on SemCor. We also analyze the effect of the number of weighted terms in the tasks of
finding the Most Frecuent Sense (MFS) and WSD, and experiment with several corpora for building the Word Space Model. 相似文献
822.
Veronika Šoltészová Daniel Patel Stefan Bruckner Ivan Viola 《Computer Graphics Forum》2010,29(3):883-891
In this paper, we present a novel technique which simulates directional light scattering for more realistic interactive visualization of volume data. Our method extends the recent directional occlusion shading model by enabling light source positioning with practically no performance penalty. Light transport is approximated using a tilted cone‐shaped function which leaves elliptic footprints in the opacity buffer during slice‐based volume rendering. We perform an incremental blurring operation on the opacity buffer for each slice in front‐to‐back order. This buffer is then used to define the degree of occlusion for the subsequent slice. Our method is capable of generating high‐quality soft shadowing effects, allows interactive modification of all illumination and rendering parameters, and requires no pre‐computation. 相似文献
823.
The problem of computing the chromatic number of a P
5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show
that for every fixed integer k, there exists a polynomial-time algorithm determining whether or not a P
5-free graph admits a k-coloring, and finding one, if it does. 相似文献
824.
José L. Risco-Martín David Atienza J. Manuel Colmenar Oscar Garnica 《Parallel Computing》2010,36(10-11):572-590
For the last 30 years, several dynamic memory managers (DMMs) have been proposed. Such DMMs include first fit, best fit, segregated fit and buddy systems. Since the performance, memory usage and energy consumption of each DMM differs, software engineers often face difficult choices in selecting the most suitable approach for their applications. This issue has special impact in the field of portable consumer embedded systems, that must execute a limited amount of multimedia applications (e.g., 3D games, video players, signal processing software, etc.), demanding high performance and extensive memory usage at a low energy consumption. Recently, we have developed a novel methodology based on genetic programming to automatically design custom DMMs, optimizing performance, memory usage and energy consumption. However, although this process is automatic and faster than state-of-the-art optimizations, it demands intensive computation, resulting in a time-consuming process. Thus, parallel processing can be very useful to enable to explore more solutions spending the same time, as well as to implement new algorithms. In this paper we present a novel parallel evolutionary algorithm for DMMs optimization in embedded systems, based on the Discrete Event Specification (DEVS) formalism over a Service Oriented Architecture (SOA) framework. Parallelism significantly improves the performance of the sequential exploration algorithm. On the one hand, when the number of generations are the same in both approaches, our parallel optimization framework is able to reach a speed-up of 86.40× when compared with other state-of-the-art approaches. On the other, it improves the global quality (i.e., level of performance, low memory usage and low energy consumption) of the final DMM obtained in a 36.36% with respect to two well-known general-purpose DMMs and two state-of-the-art optimization methodologies. 相似文献
825.
In this paper we introduce a minimax model unifying several classes of single facility planar center location problems. We
assume that the transportation costs of the demand points to the serving facility are convex functions {Q
i
}, i=1,…,n, of the planar distance used. Moreover, these functions, when properly transformed, give rise to piecewise quadratic functions
of the coordinates of the facility location. In the continuous case, using results on LP-type models by Clarkson (J. ACM 42:488–499,
1995), Matoušek et al. (Algorithmica 16:498–516, 1996), and the derandomization technique in Chazelle and Matoušek (J. Algorithms 21:579–597, 1996), we claim that the model is solvable deterministically in linear time. We also show that in the separable case, one can
get a direct O(nlog n) deterministic algorithm, based on Dyer (Proceedings of the 8th ACM Symposium on Computational Geometry, 1992), to find an optimal solution. In the discrete case, where the location of the center (server) is restricted to some prespecified
finite set, we introduce deterministic subquadratic algorithms based on the general parametric approach of Megiddo (J. ACM
30:852–865, 1983), and on properties of upper envelopes of collections of quadratic arcs. We apply our methods to solve and improve the complexity
of a number of other location problems in the literature, and solve some new models in linear or subquadratic time complexity. 相似文献
826.
Partitioning large networks without breaking communities 总被引:1,自引:1,他引:0
Anand Narasimhamurthy Derek Greene Neil Hurley Pádraig Cunningham 《Knowledge and Information Systems》2010,25(2):345-369
The identification of cohesive communities is a key process in social network analysis. However, the algorithms that are effective
for finding communities do not scale well to very large problems, as their time complexity is worse than linear in the number
of edges in the graph. This is an important issue for those interested in applying social network analysis techniques to very
large networks, such as networks of mobile phone subscribers. In this respect, the contributions of this paper are twofold.
First, we demonstrate these scaling issues using a prominent community-finding algorithm as a case study. Then, we show that
a two-stage process, whereby the network is first decomposed into manageable subnetworks using a multilevel graph partitioning
procedure, is effective in finding communities in networks with more than 106 nodes. 相似文献
827.
Virginia Francisco Pablo Gervás Federico Peinado 《Knowledge and Information Systems》2010,25(3):421-443
With the advent of affective computing, the task of adequately identifying, representing and processing the emotional connotations
of text has acquired importance. Two problems facing this task are addressed in this paper: the composition of sentence emotion
from word emotion, and a representation of emotion that allows easy conversion between existing computational representations.
The emotion of a sentence of text should be derived by composition of the emotions of the words in the sentence, but no method
has been proposed so far to model this compositionality. Of the various existing approaches for representing emotions, some
are better suited for some problems and some for others, but there is no easy way of converting from one to another. This
paper presents a system that addresses these two problems by reasoning with two ontologies implemented with Semantic Web technologies:
one designed to represent word dependency relations within a sentence, and one designed to represent emotions. The ontology
of word dependency relies on roles to represent the way emotional contributions project over word dependencies. By applying
automated classification of mark-up results in terms of the emotion ontology the system can interpret unrestricted input in
terms of a restricted set of concepts for which particular rules are provided. The rules applied at the end of the process
provide configuration parameters for a system for emotional voice synthesis. 相似文献
828.
829.
830.
Combinatorial problems appear in many areas in science, engineering, biomedicine, business, and operations research. This article presents a new intelligent computing approach for solving combinatorial problems, involving permutations and combinations, by incorporating logic programming. An overview of applied combinatorial problems in various domains is given. Such computationally hard and popular combinatorial problems as the traveling salesman problem are discussed to illustrate the usefulness of the logic programming approach. Detailed discussions of implementation of combinatorial problems with time complexity analyses are presented in Prolog, the standard language of logic programming. These programs can be easily integrated into other systems to implement logic programming in combinatorics. 相似文献