全文获取类型
收费全文 | 88008篇 |
免费 | 1020篇 |
国内免费 | 413篇 |
专业分类
电工技术 | 951篇 |
综合类 | 2322篇 |
化学工业 | 12191篇 |
金属工艺 | 4858篇 |
机械仪表 | 3079篇 |
建筑科学 | 2214篇 |
矿业工程 | 562篇 |
能源动力 | 1205篇 |
轻工业 | 3873篇 |
水利工程 | 1289篇 |
石油天然气 | 351篇 |
无线电 | 9723篇 |
一般工业技术 | 16928篇 |
冶金工业 | 3949篇 |
原子能技术 | 377篇 |
自动化技术 | 25569篇 |
出版年
2022年 | 81篇 |
2021年 | 88篇 |
2020年 | 38篇 |
2019年 | 48篇 |
2018年 | 14478篇 |
2017年 | 13408篇 |
2016年 | 10014篇 |
2015年 | 632篇 |
2014年 | 304篇 |
2013年 | 340篇 |
2012年 | 3239篇 |
2011年 | 9537篇 |
2010年 | 8373篇 |
2009年 | 5663篇 |
2008年 | 6901篇 |
2007年 | 7880篇 |
2006年 | 222篇 |
2005年 | 1305篇 |
2004年 | 1227篇 |
2003年 | 1269篇 |
2002年 | 623篇 |
2001年 | 215篇 |
2000年 | 265篇 |
1999年 | 184篇 |
1998年 | 600篇 |
1997年 | 362篇 |
1996年 | 284篇 |
1995年 | 137篇 |
1994年 | 146篇 |
1993年 | 120篇 |
1992年 | 74篇 |
1991年 | 77篇 |
1990年 | 54篇 |
1989年 | 52篇 |
1988年 | 62篇 |
1987年 | 49篇 |
1986年 | 45篇 |
1985年 | 45篇 |
1982年 | 40篇 |
1981年 | 44篇 |
1976年 | 53篇 |
1968年 | 44篇 |
1967年 | 36篇 |
1966年 | 42篇 |
1965年 | 44篇 |
1959年 | 36篇 |
1958年 | 38篇 |
1957年 | 36篇 |
1955年 | 63篇 |
1954年 | 68篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
921.
Given a graph with edges colored Red and Blue, we study the problem of sampling and approximately counting the number of matchings with exactly k
Red edges. We solve the problem of estimating the number of perfect matchings with exactly k
Red edges for dense graphs. We study a Markov chain on the space of all matchings of a graph that favors matchings with k
Red edges. We show that it is rapidly mixing using non-traditional canonical paths that can backtrack. We show that this chain
can be used to sample matchings in the 2-dimensional toroidal lattice of any fixed size ℓ with k
Red edges, where the horizontal edges are Red and the vertical edges are Blue.
An extended abstract appeared in J.R. Correa, A. Hevia and M.A. Kiwi (eds.) Proceedings of the 7th Latin American Theoretical Informatics Symposium, LNCS 3887, pp. 190–201, Springer, 2006.
N. Bhatnagar’s and D. Randall’s research was supported in part by NSF grants CCR-0515105 and DMS-0505505.
V.V. Vazirani’s research was supported in part by NSF grants 0311541, 0220343 and CCR-0515186.
N. Bhatnagar’s and E. Vigoda’s research was supported in part by NSF grant CCR-0455666. 相似文献
922.
Huimin Zhao 《Knowledge and Information Systems》2008,15(3):321-334
In real-world classification problems, different types of misclassification errors often have asymmetric costs, thus demanding cost-sensitive learning methods that attempt to minimize average misclassification cost rather than plain error rate. Instance weighting and post hoc threshold adjusting are two major approaches to cost-sensitive classifier learning. This paper compares the effects of these two approaches on several standard, off-the-shelf classification methods. The comparison indicates that the two approaches lead to similar results for some classification methods, such as Naïve Bayes, logistic regression, and backpropagation neural network, but very different results for other methods, such as decision tree, decision table, and decision rule learners. The findings from this research have important implications on the selection of the cost-sensitive classifier learning approach as well as on the interpretation of a recently published finding about the relative performance of Naïve Bayes and decision trees. 相似文献
923.
We study the problem of segmenting a sequence into k pieces so that the resulting segmentation satisfies monotonicity or unimodality constraints. Unimodal functions can be used
to model phenomena in which a measured variable first increases to a certain level and then decreases. We combine a well-known
unimodal regression algorithm with a simple dynamic-programming approach to obtain an optimal quadratic-time algorithm for
the problem of unimodal k-segmentation. In addition, we describe a more efficient greedy-merging heuristic that is experimentally shown to give solutions
very close to the optimal. As a concrete application of our algorithms, we describe methods for testing if a sequence behaves
unimodally or not. The methods include segmentation error comparisons, permutation testing, and a BIC-based scoring scheme.
Our experimental evaluation shows that our algorithms and the proposed unimodality tests give very intuitive results, for
both real-valued and binary data.
Niina Haiminen received the M.Sc. degree from the University of Helsinki in 2004. She is currently a Graduate Student at the Department
of Computer Science of University of Helsinki, and a Researcher at the Basic Research Unit of Helsinki Institute for Information
Technology. Her research interests include algorithms, bioinformatics, and data mining.
Aristides Gionis received the Ph.D. degree from Stanford University in 2003, and he is currently a Senior Researcher at the Basic Research
Unit of Helsinki Institute for Information Technology. His research experience includes summer internship positions at Bell
Labs, AT&T Labs, and Microsoft Research. His research areas are data mining, algorithms, and databases.
Kari Laasonen received the M.Sc. degree in Theoretical Physics in 1995 from the University of Helsinki. He is currently a Graduate Student
in Computer Science at the University of Helsinki and a Researcher at the Basic Research Unit of Helsinki Institute for Information
Technology. His research is focused on algorithms and data analysis methods for pervasive computing. 相似文献
924.
In this paper, we describe an implementation of use in demonstrating the effectiveness of architectures for real-time multi-agent
systems. The implementation provides a simulation of a simplified RoboCup Search and Rescue environment, with unexpected events,
and includes a simulator for both a real-time operating system and a CPU. We present experimental evidence to demonstrate
the benefit of the implementation in the context of a particular hybrid architecture for multi-agent systems that allows certain
agents to remain fully autonomous, while others are fully controlled by a coordinating agent. In addition, we discuss the
value of the implementation for testing any models for the construction of real-time multi-agent systems and include a comparison
to related work.
相似文献
Robin CohenEmail: |
925.
Peter Baumann 《Informatik-Spektrum》2008,31(5):435-450
Zusammenfassung Navigationssysteme, ortsbezogene Suchdienste wie Google Maps, interaktive Augmented-Reality-Spiele, Handy-basierte FindMe-Dienste
– diese wenige Beispiele zeigen bereits, wie direkt oder indirekt raumbezogene Dienste unser Alltagsleben immer mehr durchdringen.
Wir beobachten, wie sich die Nutzung von Geodaten schrittweise vom pers?nlichen Desktop-Geoinformationssystem (GIS) über hausinternen
Zugriff auf die Geodatenbank bis zum Webzugriff durch Clients und Servern unterschiedlicher Provenienz ausweitet (,,Web-GIS“).
Klassische Aufgaben wie Kartenproduktion und Beauskunftung treten dabei gegenüber komplexen, situationsbezogenen Verknüpfungen
von Geo- mit anderen Daten eher in den Hintergrund. Damit geht offensichtlich ein Paradigmenwechsel von der einfachen, passiven
Geodatenbereitstellung via WWW zu funktional komplexeren Geodiensten einher.
Sollen solche Mehrwertdienste offen und flexibel orchestrierbar sein, so müssen Geodaten systemübergreifend ad hoc abgefragt werden k?nnen. Unabdingbar sind dafür offene Standards, nicht nur auf der Ebene von Datenaustauschformaten, sondern
auch bei den Zugriffsdiensten; diese Geoservice-Standardisierung leistet das Open GeoSpatial Consortium (OGC).
Im vorliegenden Beitrag geben wir einen überblick über die Modellierung von Web-basierten Geodiensten auf Basis ausgew?hlter
OGC-Standards. Modellierung bedeutet in diesem Kontext die Gestaltung von Funktionalit?t und Schnittstellen eines potenziell
komplexen Dienstes auf Basis offener Standards und ihrer Basisdienste und -operationen. Diskutiert werden Standards für den
Meta-, Vektor- und Rasterdatenzugriff sowie ein anwendungsorientierter Standard für Sensordaten. 相似文献
926.
Sabine Timpf 《Informatik-Spektrum》2008,31(1):70-74
Zusammenfassung Im Zeitalter der Informationsgesellschaft, so wurde postuliert, spielten r?umliche Distanzen keine Rolle mehr und unsere r?umliche
Mobilit?t n?hme ab. Die Mobilit?t in den letzten Jahren, speziell die Freizeitmobilit?t, hat hingegen zugenommen. Die Bereitstellung
ortsbezogener Dienste – ,,Location-based Services“ – unterstützt und f?rdert dieses Verhalten. 相似文献
927.
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. 相似文献
928.
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded
auction, in which every participant is interested in only one subset of commodities. Chen et al. (J. Comput. Syst. Sci. 69(4):
675–687, 2004) showed that it is NP-hard to decide the existence of a Walrasian equilibrium for a single-minded auction and proposed a
notion of approximate Walrasian equilibrium called relaxed Walrasian equilibrium. We show that every single-minded auction
has a relaxed Walrasian equilibrium that satisfies at least two-thirds of the participants, proving a conjecture posed in
Chen et al. (J. Comput. Syst. Sci. 69(4): 675–687, 2004). Motivated by practical considerations, we introduce another concept of approximate Walrasian equilibrium called weak Walrasian
equilibrium. We show NP-completeness and hardness of approximation results for weak Walrasian equilibria.
In search of positive results, we restrict our attention to the tollbooth problem (Guruswami et al. in Proceedings of the
Symposium on Discrete Algorithms (SODA), pp. 1164–1173, 2005), where every participant is interested in a single path in some underlying graph. We give a polynomial time algorithm to
determine the existence of a Walrasian equilibrium and compute one (if it exists), when the graph is a tree. However, the
problem is still NP-hard for general graphs. 相似文献
929.
In this paper we consider the p-ary transitive reduction (TR
p
) problem where p>0 is an integer; for p=2 this problem arises in inferring a sparsest possible (biological) signal transduction network consistent with a set of
experimental observations with a goal to minimize false positive inferences even if risking false negatives. Special cases
of TR
p
have been investigated before in different contexts; the best previous results are as follows:
In this paper, our contributions are as follows:
R. Albert’s research was partly supported by a Sloan Research Fellowship in Science and Technology.
B. DasGupta’s research was partly supported by NSF grants DBI-0543365, IIS-0612044 and IIS-0346973.
E. Sontag’s research was partly supported by NSF grants EIA 0205116 and DMS-0504557. 相似文献
(1) | The minimum equivalent digraph problem, that correspond to a special case of TR1 with no critical edges, is known to be MAX-SNP-hard, admits a polynomial time algorithm with an approximation ratio of 1.617+ε for any constant ε>0 (Chiu and Liu in Sci. Sin. 4:1396–1400, 1965) and can be solved in linear time for directed acyclic graphs (Aho et al. in SIAM J. Comput. 1(2):131–137, 1972). |
(2) | A 2-approximation algorithm exists for TR1 (Frederickson and JàJà in SIAM J. Comput. 10(2):270–283, 1981; Khuller et al. in 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 937–938, 1999). |
• | We observe that TR p , for any integer p>0, can be solved in linear time for directed acyclic graphs using the ideas in Aho et al. (SIAM J. Comput. 1(2):131–137, 1972). |
• | We provide a 1.78-approximation for TR1 that improves the 2-approximation mentioned in (2) above. |
• | We provide a 2+o(1)-approximation for TR p on general graphs for any fixed prime p>1. |
930.
Guido Böttcher Dennis Allerkamp Daniel Glöckner Franz-Erich Wolter 《The Visual computer》2008,24(10):911-922
Real-time cloth simulation involves many computational challenges to be solved, particularly in the context of haptic applications,
where high frame rates are necessary for obtaining a satisfying experience. In this paper, we present an interactive cloth
simulation system that offers a compromise between a realistic physics-based simulation of fabrics and a haptic application
meeting high requirements in terms of computation speed. Our system allows the user to interact with the fabric using two
fingers. The required performance of the system is achieved by introducing an intermediate layer responsible for the simulation
of the small part of the surface being in contact with the fingers. Additionally we separate the possible contact situations
into different cases, each being individually handled by a specialised contact algorithm.
相似文献
Franz-Erich WolterEmail: |