全文获取类型
收费全文 | 1437篇 |
免费 | 60篇 |
国内免费 | 23篇 |
专业分类
电工技术 | 4篇 |
综合类 | 48篇 |
化学工业 | 2篇 |
金属工艺 | 2篇 |
机械仪表 | 3篇 |
建筑科学 | 7篇 |
能源动力 | 1篇 |
轻工业 | 2篇 |
水利工程 | 2篇 |
无线电 | 12篇 |
一般工业技术 | 12篇 |
冶金工业 | 25篇 |
自动化技术 | 1400篇 |
出版年
2023年 | 3篇 |
2022年 | 4篇 |
2020年 | 6篇 |
2019年 | 9篇 |
2018年 | 10篇 |
2017年 | 30篇 |
2016年 | 34篇 |
2015年 | 31篇 |
2014年 | 59篇 |
2013年 | 46篇 |
2012年 | 59篇 |
2011年 | 62篇 |
2010年 | 55篇 |
2009年 | 63篇 |
2008年 | 68篇 |
2007年 | 67篇 |
2006年 | 65篇 |
2005年 | 54篇 |
2004年 | 54篇 |
2003年 | 56篇 |
2002年 | 52篇 |
2001年 | 34篇 |
2000年 | 35篇 |
1999年 | 32篇 |
1998年 | 30篇 |
1997年 | 34篇 |
1996年 | 22篇 |
1995年 | 24篇 |
1994年 | 41篇 |
1993年 | 21篇 |
1992年 | 21篇 |
1991年 | 22篇 |
1990年 | 10篇 |
1989年 | 16篇 |
1988年 | 16篇 |
1987年 | 8篇 |
1986年 | 7篇 |
1985年 | 25篇 |
1984年 | 17篇 |
1983年 | 30篇 |
1982年 | 25篇 |
1981年 | 22篇 |
1980年 | 11篇 |
1979年 | 30篇 |
1978年 | 23篇 |
1977年 | 15篇 |
1976年 | 22篇 |
1975年 | 13篇 |
1974年 | 6篇 |
1973年 | 8篇 |
排序方式: 共有1520条查询结果,搜索用时 31 毫秒
61.
62.
Justin Solomon Mirela Ben‐Chen Adrian Butscher Leonidas Guibas 《Computer Graphics Forum》2011,30(2):365-374
The discovery of meaningful parts of a shape is required for many geometry processing applications, such as parameterization, shape correspondence, and animation. It is natural to consider primitives such as spheres, cylinders and cones as the building blocks of shapes, and thus to discover parts by fitting such primitives to a given surface. This approach, however, will break down if primitive parts have undergone almost‐isometric deformations, as is the case, for example, for articulated human models. We suggest that parts can be discovered instead by finding intrinsic primitives, which we define as parts that posses an approximate intrinsic symmetry. We employ the recently‐developed method of computing discrete approximate Killing vector fields (AKVFs) to discover intrinsic primitives by investigating the relationship between the AKVFs of a composite object and the AKVFs of its parts. We show how to leverage this relationship with a standard clustering method to extract k intrinsic primitives and remaining asymmetric parts of a shape for a given k. We demonstrate the value of this approach for identifying the prominent symmetry generators of the parts of a given shape. Additionally, we show how our method can be modified slightly to segment an entire surface without marking asymmetric connecting regions and compare this approach to state‐of‐the‐art methods using the Princeton Segmentation Benchmark. 相似文献
63.
Quentin Mérigot 《Computer Graphics Forum》2011,30(5):1583-1592
In this paper, we propose an improvement of an algorithm of Aurenhammer, Hoffmann and Aronov to find a least square matching between a probability density and finite set of sites with mass constraints, in the Euclidean plane. Our algorithm exploits the multiscale nature of this optimal transport problem. We iteratively simplify the target using Lloyd's algorithm, and use the solution of the simplified problem as a rough initial solution to the more complex one. This approach allows for fast estimation of distances between measures related to optimal transport (known as Earth‐mover or Wasserstein distances). We also discuss the implementation of these algorithms, and compare the original one to its multiscale counterpart. 相似文献
64.
In this work, we address some issues related to products of graphs and products of modal logics. Our main contribution is the presentation of a necessary and sufficient condition for a countable and connected graph to be a product, using a property called intransitivity. We then proceed to describe this property in a logical language. First, we show that intransitivity is not modally definable and also that no necessary and sufficient condition for a graph to be a product can be modally definable. Then, we exhibit a formula in a hybrid language that describes intransitivity. With this, we get a logical characterization of products of graphs of arbitrary dimensions. We then use this characterization to obtain two other interesting results. First, we determine that it is possible to test in polynomial time, using a model-checking algorithm, whether a finite connected graph is a product. This test has cubic complexity in the size of the graph and quadratic complexity in its number of dimensions. Finally, we use this characterization of countable connected products to provide sound and complete axiomatic systems for a large class of products of modal logics. This class contains the logics defined by product frames obtained from Kripke frames that satisfy connectivity, transitivity and symmetry plus any additional property that can be defined by a pure hybrid formula. Most sound and complete axiomatic systems presented in the literature are for products of a pair of modal logics, while we are able, using hybrid logics, to provide sound and complete axiomatizations for many products of arbitrary dimensions. 相似文献
65.
Lorna Hardwick 《Computers and the Humanities》2000,34(3):279-295
The article offers a case study of the relationshipbetween current developments in Classical Studies andthe impact of computing and IT. The first sectionsummarises the main features of the Classical Studiesenvironment, especially the deep seated changes whichhave been taking place. These changes are then relatedto specific initiatives in Research, Teaching andLearning. The discussion is framed by a statement ofmicro-criteria for the evaluation of new developmentsand by reference to the macro-climate of debate aboutthe nature of cyberspace, especially the dichotomybetween conceptions of post-modern diversity and ofEnlightenment images of rational structures. It issuggested that these debates mirror those with whichthe discipline itself engages. 相似文献
66.
67.
Azzurra Ragone Tommaso Di Noia Eugenio Di Sciascio Francesco M. Donini 《Autonomous Agents and Multi-Agent Systems》2008,16(3):249-270
We present a novel logic-based framework to automate multi-issue bilateral negotiation in e-commerce settings. The approach
exploits logic as communication language among agents, and optimization techniques in order to find Pareto-efficient agreements.
We introduce , a propositional logic extended with concrete domains, which allows one to model relations among issues (both numerical and
non-numerical ones) via logical entailment, differently from well-known approaches that describe issues as uncorrelated. Through
it is possible to represent buyer’s request, seller’s supply and their respective preferences as formulas endowed with a
formal semantics, e.g., “if I spend more than 30000 € for a sedan then I want more than a two-years warranty and a GPS system included”. We mix logic and utility theory in order to express preferences in a qualitative and quantitative way. We illustrate the
theoretical framework, the logical language, the one-shot negotiation protocol we adopt, and show we are able to compute Pareto-efficient
outcomes, using a mediator to solve an optimization problem. We prove the computational adequacy of our method by studying
the complexity of the problem of finding Pareto-efficient solutions in our setting. 相似文献
68.
Formal power series over non-commuting variables have been investigated as representations of the behavior of automata with
multiplicities. Here we introduce and investigate the concepts of aperiodic and of star-free formal power series over semirings
and partially commuting variables. We prove that if the semiring K is idempotent and commutative, or if K is idempotent and the variables are non-commuting, then the product of any two aperiodic series is again aperiodic. We also
show that if K is idempotent and the matrix monoids over K have a Burnside property (satisfied, e.g. by the tropical semiring), then the aperiodic and the star-free series coincide.
This generalizes a classical result of Schützenberger (Inf. Control 4:245–270, 1961) for aperiodic regular languages and subsumes a result of Guaiana et al. (Theor. Comput. Sci. 97:301–311, 1992) on aperiodic trace languages.
This work partly supported by the DAAD-PROCOPE project Temporal and Quantitative Analysis of Distributed Systems. 相似文献
69.
Huafeng Yu Abdoulaye Gamatié Éric Rutten Jean-Luc Dekeyser 《Innovations in Systems and Software Engineering》2008,4(3):215-222
In this paper, we use the UML MARTE profile to model high-performance embedded systems (HPES) in the GASPARD2 framework. We address the design correctness issue on the UML model by using the formal validation tools associated with
synchronous languages, i.e., the SIGALI model checker, etc. This modeling and validation approach benefits from the advantages of UML as a standard, and from the
number of validation tools built around synchronous languages. In our context, model transformations act as a bridge between
UML and the chosen validation technologies. They are implemented according to a model-driven engineering approach. The modeling
and validation are illustrated using the multimedia functionality of a new-generation cellular phone. 相似文献
70.
QuadCover - Surface Parameterization using Branched Coverings 总被引:4,自引:0,他引:4
We introduce an algorithm for the automatic computation of global parameterizations on arbitrary simplicial 2-manifolds, whose parameter lines are guided by a given frame field, for example, by principal curvature frames. The parameter lines are globally continuous and allow a remeshing of the surface into quadrilaterals. The algorithm converts a given frame field into a single vector field on a branched covering of the 2-manifold and generates an integrable vector field by a Hodge decomposition on the covering space. Except for an optional smoothing and alignment of the initial frame field, the algorithm is fully automatic and generates high quality quadrilateral meshes. 相似文献