全文获取类型
收费全文 | 4441篇 |
免费 | 216篇 |
国内免费 | 9篇 |
专业分类
电工技术 | 69篇 |
综合类 | 3篇 |
化学工业 | 1172篇 |
金属工艺 | 96篇 |
机械仪表 | 75篇 |
建筑科学 | 176篇 |
矿业工程 | 5篇 |
能源动力 | 150篇 |
轻工业 | 357篇 |
水利工程 | 22篇 |
石油天然气 | 13篇 |
武器工业 | 1篇 |
无线电 | 556篇 |
一般工业技术 | 785篇 |
冶金工业 | 362篇 |
原子能技术 | 29篇 |
自动化技术 | 795篇 |
出版年
2023年 | 25篇 |
2022年 | 63篇 |
2021年 | 79篇 |
2020年 | 70篇 |
2019年 | 80篇 |
2018年 | 103篇 |
2017年 | 96篇 |
2016年 | 123篇 |
2015年 | 109篇 |
2014年 | 159篇 |
2013年 | 284篇 |
2012年 | 231篇 |
2011年 | 293篇 |
2010年 | 223篇 |
2009年 | 184篇 |
2008年 | 223篇 |
2007年 | 205篇 |
2006年 | 180篇 |
2005年 | 152篇 |
2004年 | 133篇 |
2003年 | 118篇 |
2002年 | 132篇 |
2001年 | 61篇 |
2000年 | 76篇 |
1999年 | 75篇 |
1998年 | 79篇 |
1997年 | 86篇 |
1996年 | 77篇 |
1995年 | 71篇 |
1994年 | 66篇 |
1993年 | 47篇 |
1992年 | 44篇 |
1991年 | 40篇 |
1990年 | 47篇 |
1989年 | 42篇 |
1988年 | 28篇 |
1987年 | 26篇 |
1986年 | 27篇 |
1985年 | 42篇 |
1984年 | 43篇 |
1983年 | 38篇 |
1982年 | 45篇 |
1981年 | 34篇 |
1980年 | 18篇 |
1979年 | 31篇 |
1978年 | 19篇 |
1977年 | 22篇 |
1976年 | 21篇 |
1974年 | 17篇 |
1970年 | 15篇 |
排序方式: 共有4666条查询结果,搜索用时 15 毫秒
51.
52.
The problem of determining whether several finite automata accept a word in common is closely related to the well-studied membership problem in transformation monoids. We raise the issue of limiting the number of final states in the automata intersection problem. For automata with two final states, we show the problem to be \({\oplus}\)L-complete or NP-complete according to whether a nontrivial monoid other than a direct product of cyclic groups of order 2 is allowed in the automata. We further consider idempotent commutative automata and (Abelian, mainly) group automata with one, two, or three final states over a singleton or larger alphabet, elucidating (under the usual hypotheses on complexity classes) the complexity of the intersection nonemptiness and related problems in each case. 相似文献
53.
Andre Suslik Spritzer Jeremy Boy Pierre Dragicevic Jean‐Daniel Fekete Carla Maria Dal Sasso Freitas 《Computer Graphics Forum》2015,34(3):461-470
Node‐link infographics are visually very rich and can communicate messages effectively, but can be very difficult to create, often involving a painstaking and artisanal process. In this paper we present an investigation of node‐link visualizations for communication and how to better support their creation. We begin by breaking down these images into their basic elements and analyzing how they are created. We then present a set of techniques aimed at improving the creation workflow by bringing more flexibility and power to users, letting them manipulate all aspects of a node‐link diagram (layout, visual attributes, etc.) while taking into account the context in which it will appear. These techniques were implemented in a proof‐of‐concept prototype called GraphCoiffure, which was designed as an intermediary step between graph drawing/editing software and image authoring applications. We describe how GraphCoiffure improves the workflow and illustrate its benefits through practical examples. 相似文献
54.
Matrix models are ubiquitous for constraint problems. Many such problems have a matrix of variables $\mathcal{M}$ , with the same constraint C defined by a finite-state automaton $\mathcal{A}$ on each row of $\mathcal{M}$ and a global cardinality constraint $\mathit{gcc}$ on each column of $\mathcal{M}$ . We give two methods for deriving, by double counting, necessary conditions on the cardinality variables of the $\mathit{gcc}$ constraints from the automaton $\mathcal{A}$ . The first method yields linear necessary conditions and simple arithmetic constraints. The second method introduces the cardinality automaton, which abstracts the overall behaviour of all the row automata and can be encoded by a set of linear constraints. We also provide a domain consistency filtering algorithm for the conjunction of lexicographic ordering constraints between adjacent rows of $\mathcal{M}$ and (possibly different) automaton constraints on the rows. We evaluate the impact of our methods in terms of runtime and search effort on a large set of nurse rostering problem instances. 相似文献
55.
Fabrice Rousselle Petrik Clarberg Luc Leblanc Victor Ostromoukhov Pierre Poulin 《The Visual computer》2008,24(7-9):465-474
We present an efficient method for importance sampling the product of multiple functions. Our algorithm computes a quick approximation of the product on the fly, based on hierarchical representations of the local maxima and averages of the individual terms. Samples are generated by exploiting the hierarchical properties of many low-discrepancy sequences, and thresholded against the estimated product. We evaluate direct illumination by sampling the triple product of environment map lighting, surface reflectance, and a visibility function estimated per pixel. Our results show considerable noise reduction compared to existing state-of-the-art methods using only the product of lighting and BRDF. 相似文献
56.
Search games are attractive for their correspondence with classical width parameters. For instance, the invisible search number (a.k.a. node search number) of a graph is equal to its pathwidth plus 1, and the visible search number of a graph is equal to its treewidth plus 1. The connected variants of these games ask for search strategies that are connected, i.e., at every step of the strategy, the searched part of the graph induces a connected subgraph. We focus on monotone search strategies, i.e., strategies for which every node is searched exactly once. The monotone connected visible search number of an n-node graph is at most O(logn) times its visible search number. First, we prove that this logarithmic bound is tight. Precisely, we prove that there is an infinite family of graphs for which the ratio monotone connected visible search number over visible search number is Ω(logn). Second, we prove that, as opposed to the non-connected variant of visible graph searching, “recontamination helps” for connected visible search. Precisely, we prove that, for any k4, there exists a graph with connected visible search number at most k, and monotone connected visible search number >k 相似文献
57.
This paper introduces time stream Pétri nets (Ts treamPn), a model for the formal specification of multimedia synchronization scenarios. This new model extends time Pétri nets to formally describe the timed behaviour of multimedia objects and streams in asynchronous distributed systems. The proposed approach uses time intervals to label the arcs exiting from the places of the net, and typed transitions to define different firing rules. This model allows a complete and accurate specification of synchronization constraints between multimedia streams and can be used at different levels of granularity. 相似文献
58.
Pierre Lescanne 《Formal Aspects of Computing》1995,7(1):77-90
We focus on termination proofs of rewrite systems, especially of rewrite systems containing associative and commutative operators. We prove their termination by elementary interpretations, more specifically, by functions defined by addition, multiplication and exponentiation. We discuss a method based on polynomial interpretations and propose an implementation of a mechanisation of the comparison of expressions built with polynomials and exponentials. 相似文献
59.
Chapellier Paul Lavenus Pierre Le Traon Olivier Dulmet Bernard 《Microsystem Technologies》2022,28(6):1485-1496
Microsystem Technologies - This paper presents recent advances on two dimensional length-extension mode (2D-LEM) quartz resonators providing high quality (Q) factor on resonances at a few MHz. The... 相似文献
60.