全文获取类型
收费全文 | 1070篇 |
免费 | 72篇 |
国内免费 | 3篇 |
专业分类
电工技术 | 14篇 |
化学工业 | 316篇 |
金属工艺 | 14篇 |
机械仪表 | 12篇 |
建筑科学 | 35篇 |
矿业工程 | 3篇 |
能源动力 | 25篇 |
轻工业 | 197篇 |
水利工程 | 4篇 |
石油天然气 | 4篇 |
无线电 | 48篇 |
一般工业技术 | 141篇 |
冶金工业 | 148篇 |
原子能技术 | 4篇 |
自动化技术 | 180篇 |
出版年
2024年 | 2篇 |
2023年 | 15篇 |
2022年 | 56篇 |
2021年 | 65篇 |
2020年 | 29篇 |
2019年 | 38篇 |
2018年 | 28篇 |
2017年 | 30篇 |
2016年 | 28篇 |
2015年 | 37篇 |
2014年 | 47篇 |
2013年 | 76篇 |
2012年 | 65篇 |
2011年 | 72篇 |
2010年 | 51篇 |
2009年 | 58篇 |
2008年 | 41篇 |
2007年 | 37篇 |
2006年 | 34篇 |
2005年 | 33篇 |
2004年 | 40篇 |
2003年 | 33篇 |
2002年 | 19篇 |
2001年 | 18篇 |
2000年 | 15篇 |
1999年 | 21篇 |
1998年 | 18篇 |
1997年 | 19篇 |
1996年 | 19篇 |
1995年 | 14篇 |
1994年 | 9篇 |
1993年 | 10篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 6篇 |
1988年 | 3篇 |
1987年 | 4篇 |
1986年 | 3篇 |
1985年 | 6篇 |
1984年 | 3篇 |
1983年 | 2篇 |
1982年 | 6篇 |
1981年 | 5篇 |
1978年 | 5篇 |
1974年 | 2篇 |
1971年 | 2篇 |
1969年 | 3篇 |
1968年 | 2篇 |
1967年 | 2篇 |
1945年 | 1篇 |
排序方式: 共有1145条查询结果,搜索用时 31 毫秒
21.
Helmut Alt Esther M. Arkin Alon Efrat George Hart Ferran Hurtado Irina Kostitsyna Alexander Kröller Joseph S. B. Mitchell Valentin Polishchuk 《Theory of Computing Systems》2014,54(4):689-714
We show how to compute the smallest rectangle that can enclose any polygon, from a given set of polygons, in nearly linear time; we also present a PTAS for the problem, as well as a linear-time algorithm for the case when the polygons are rectangles themselves. We prove that finding a smallest convex polygon that encloses any of the given polygons is NP-hard, and give a PTAS for minimizing the perimeter of the convex enclosure. We also give efficient algorithms to find the smallest rectangle simultaneously enclosing a given pair of convex polygons. 相似文献
22.
Juan de Lara Esther Guerra Artur Boronat Reiko Heckel Paolo Torrini 《Software and Systems Modeling》2014,13(1):209-238
Graph transformation is being increasingly used to express the semantics of domain-specific visual languages since its graphical nature makes rules intuitive. However, many application domains require an explicit handling of time to accurately represent the behaviour of a real system and to obtain useful simulation metrics to measure throughputs, utilization times and average delays. Inspired by the vast knowledge and experience accumulated by the discrete event simulation community, we propose a novel way of adding explicit time to graph transformation rules. In particular, we take the event scheduling discrete simulation world view and provide rules with the ability to schedule the occurrence of other rules in the future. Hence, our work combines standard, efficient techniques for discrete event simulation (based on the handling of a future event set) and the intuitive, visual nature of graph transformation. Moreover, we show how our formalism can be used to give semantics to other timed approaches and provide an implementation on top of the rewriting logic system Maude. 相似文献
23.
Esther Galbrun Aristides Gionis Nikolaj Tatti 《Data mining and knowledge discovery》2016,30(5):1134-1165
Finding dense subgraphs is an important problem in graph mining and has many practical applications. At the same time, while large real-world networks are known to have many communities that are not well-separated, the majority of the existing work focuses on the problem of finding a single densest subgraph. Hence, it is natural to consider the question of finding the top-k densest subgraphs. One major challenge in addressing this question is how to handle overlaps: eliminating overlaps completely is one option, but this may lead to extracting subgraphs not as dense as it would be possible by allowing a limited amount of overlap. Furthermore, overlaps are desirable as in most real-world graphs there are vertices that belong to more than one community, and thus, to more than one densest subgraph. In this paper we study the problem of finding top-k overlapping densest subgraphs, and we present a new approach that improves over the existing techniques, both in theory and practice. First, we reformulate the problem definition in a way that we are able to obtain an algorithm with constant-factor approximation guarantee. Our approach relies on using techniques for solving the max-sum diversification problem, which however, we need to extend in order to make them applicable to our setting. Second, we evaluate our algorithm on a collection of benchmark datasets and show that it convincingly outperforms the previous methods, both in terms of quality and efficiency. 相似文献
24.
Testing model transformations poses several challenges, among them the automatic generation of appropriate input test models and the specification of oracle functions. Most approaches for the generation of input models ensure a certain coverage of the source meta-model or the transformation implementation code, whereas oracle functions are frequently defined using query or graph languages. However, these two tasks are usually performed independently regardless of their common purpose, and sometimes, there is a gap between the properties exhibited by the generated input models and those considered by the transformations. Recently, we proposed a formal specification language for the declarative formulation of transformation properties (by means of invariants, pre-, and postconditions) from which we generated partial oracle functions used for transformation testing. Here, we extend the usage of our specification language for the automated generation of input test models by SAT solving. The testing process becomes more intentional because the generated models ensure a certain coverage of the transformation requirements. Moreover, we use the same specification to consistently derive both the input test models and the oracle functions. A set of experiments is presented, aimed at measuring the efficacy of our technique. 相似文献
25.
We give a simple O(nlogn) algorithm to compute the convex hull of the (possibly Θ(n2)) intersection points in an arrangement of n line segments in the plane. We also show an arrangement of dn hyperplanes in d-dimensions whose arrangement has Θ(nd−1) intersection points on the convex hull. 相似文献
26.
This article presents a visual object tracking method and applies an event-based performance evaluation metric for assessment.
The proposed monocular object tracker is able to detect and track multiple object classes in non-controlled environments.
The tracking framework uses Bayesian per-pixel classification to segment an image into foreground and background objects,
based on observations of object appearances and motions in real-time. Furthermore, a performance evaluation method is presented
and applied to different state-of-the-art trackers based on successful detections of semantically high level events. These
events are extracted automatically from the different trackers an their varying types of low level tracking results. Then,
a general new event metric is used to compare our tracking method with the other tracking methods against ground truth of
multiple public datasets. 相似文献
27.
The need to make the contents of the Semantic Web accessible to end-users becomes increasingly pressing as the amount of information stored in ontology-based knowledge bases steadily increases. Natural language interfaces (NLIs) provide a familiar and convenient means of query access to Semantic Web data for casual end-users. While several studies have shown that NLIs can achieve high retrieval performance as well as domain independence, this paper focuses on usability and investigates if NLIs and natural language query languages are useful from an end-user's point of view. To that end, we introduce four interfaces each allowing a different query language and present a usability study benchmarking these interfaces. The results of the study reveal a clear preference for full natural language query sentences with a limited set of sentence beginnings over keywords or formal query languages. NLIs to ontology-based knowledge bases can, therefore, be considered to be useful for casual or occasional end-users. As such, the overarching contribution is one step towards the theoretical vision of the Semantic Web becoming reality. 相似文献
28.
Jordi Cabot Robert Clarisó Esther Guerra Juan de Lara 《Software and Systems Modeling》2010,9(3):335-357
In this paper we present an approach for the analysis of graph transformation rules based on an intermediate OCL representation.
We translate different rule semantics into OCL, together with the properties of interest (like rule applicability, conflicts
or independence). The intermediate representation serves three purposes: (1) it allows the seamless integration of graph transformation
rules with the MOF and OCL standards, and enables taking the meta-model and its OCL constraints (i.e. well-formedness rules)
into account when verifying the correctness of the rules; (2) it permits the interoperability of graph transformation concepts
with a number of standards-based model-driven development tools; and (3) it makes available a plethora of OCL tools to actually
perform the rule analysis. This approach is especially useful to analyse the operational semantics of Domain Specific Visual
Languages. We have automated these ideas by providing designers with tools for the graphical specification and analysis of
graph transformation rules, including a back-annotation mechanism that presents the analysis results in terms of the original
language notation. 相似文献
29.
The general problem of answering top-k queries can be modeled using lists of data items sorted by their local scores. The main algorithm proposed so far for answering top-k queries over sorted lists is the Threshold Algorithm (TA). However, TA may still incur a lot of useless accesses to the lists. In this paper, we propose two algorithms that are much more efficient than TA. First, we propose the best position algorithm (BPA). For any database instance (i.e. set of sorted lists), we prove that BPA stops as early as TA, and that its execution cost is never higher than TA. We show that there are databases over which BPA executes top-k queries O(m) times faster than that of TA, where m is the number of lists. We also show that the execution cost of our algorithm can be (m−1) times lower than that of TA. Second, we propose the BPA2 algorithm, which is much more efficient than BPA. We show that the number of accesses to the lists done by BPA2 can be about (m−1) times lower than that of BPA. We evaluated the performance of our algorithms through extensive experimental tests. The results show that over our test databases, BPA and BPA2 achieve significant performance gains in comparison with TA. 相似文献
30.
Content distribution networks (CDN) are fundamental, yet expensive technologies for distributing the content of web-servers to large audiences. The P2P model is a perfect match to build a low-cost and scalable CDN infrastructure for popular websites by exploiting the underutilized resources of their user communities. However, building a P2P-based CDN is not a straightforward endeavor. In contrast to traditional CDNs, peers are autonomous and volunteer participants with their own heterogeneous interests that should be taken into account in the design of the P2P system. Moreover, churn rate is much higher than in dedicated CDN infrastructures, which can easily destabilize the system and severely degrade the performance. Finally and foremostly, while many P2P systems abstract any topological information about the underlying network, a top priority of a CDN is to incorporate locality-awareness in query routing in order to locate close-by content. This paper aims at building a P2P CDN with high performance, scalability and robustness. Our proposed protocols combine DHT efficiency with gossip robustness and take into account the interests and localities of peers. In short, Flower-CDN provides a hybrid and locality-aware routing infrastructure for user queries. PetalUp-CDN is a highly scalable version of Flower-CDN that dynamically adapts to variable rates of participation and prevent overload situations. In addition, we ensure the robustness of our P2P CDN via low-cost maintenance protocols that can detect and recover from churn and dynamicity. Our extensive performance evaluation shows that our protocols yield high performance gains under both static and highly dynamic environments. Furthermore, they incur acceptable and tunable overhead. Finally we provide main guidelines to deploy Flower-CDN for the public use. 相似文献