全文获取类型
收费全文 | 3571篇 |
免费 | 201篇 |
国内免费 | 4篇 |
专业分类
电工技术 | 65篇 |
综合类 | 1篇 |
化学工业 | 971篇 |
金属工艺 | 47篇 |
机械仪表 | 86篇 |
建筑科学 | 166篇 |
矿业工程 | 2篇 |
能源动力 | 114篇 |
轻工业 | 288篇 |
水利工程 | 10篇 |
石油天然气 | 4篇 |
武器工业 | 1篇 |
无线电 | 308篇 |
一般工业技术 | 637篇 |
冶金工业 | 190篇 |
原子能技术 | 31篇 |
自动化技术 | 855篇 |
出版年
2024年 | 5篇 |
2023年 | 41篇 |
2022年 | 146篇 |
2021年 | 158篇 |
2020年 | 85篇 |
2019年 | 92篇 |
2018年 | 100篇 |
2017年 | 96篇 |
2016年 | 150篇 |
2015年 | 127篇 |
2014年 | 147篇 |
2013年 | 244篇 |
2012年 | 219篇 |
2011年 | 255篇 |
2010年 | 205篇 |
2009年 | 207篇 |
2008年 | 196篇 |
2007年 | 189篇 |
2006年 | 133篇 |
2005年 | 109篇 |
2004年 | 126篇 |
2003年 | 103篇 |
2002年 | 76篇 |
2001年 | 55篇 |
2000年 | 46篇 |
1999年 | 41篇 |
1998年 | 50篇 |
1997年 | 45篇 |
1996年 | 46篇 |
1995年 | 41篇 |
1994年 | 33篇 |
1993年 | 26篇 |
1992年 | 22篇 |
1991年 | 12篇 |
1990年 | 8篇 |
1989年 | 12篇 |
1987年 | 14篇 |
1986年 | 5篇 |
1985年 | 16篇 |
1984年 | 20篇 |
1983年 | 11篇 |
1982年 | 8篇 |
1981年 | 8篇 |
1980年 | 7篇 |
1979年 | 6篇 |
1978年 | 7篇 |
1977年 | 7篇 |
1976年 | 4篇 |
1975年 | 3篇 |
1973年 | 4篇 |
排序方式: 共有3776条查询结果,搜索用时 10 毫秒
41.
Tarini M Cignoni P Montani C 《IEEE transactions on visualization and computer graphics》2006,12(5):1237-1244
The paper presents a set of combined techniques to enhance the real-time visualization of simple or complex molecules (up to order of 106 atoms) space fill mode. The proposed approach includes an innovative technique for efficient computation and storage of ambient occlusion terms, a small set of GPU accelerated procedural impostors for space-fill and ball-and-stick rendering, and novel edge-cueing techniques. As a result, the user's understanding of the three-dimensional structure under inspection is strongly increased (even for still images), while the rendering still occurs in real time. 相似文献
42.
Paolo Carraresi Giorgio Gallo Gabriella Rago 《Annals of Mathematics and Artificial Intelligence》1993,8(3-4):247-270
In a previous paper, a hypergraph model for the satisfiability of Datalog formulas was proposed. Here, we extend that approach in order to deal with a class ofconstraint logic programming (CLP) formulas, that is, Datalog formulas in the presence of constraints. A CLP formula is represented by means of a weighted hypergraph and the problem of evaluating this formula is reduced to a sequence of shortest path computations on hypergraphs. To evaluate the performance of this approach, the bus drivers' scheduling problem is formulated as the problem of checking the satisfiability of a CLP formula and it is solved by means of the hypergraph-based algorithm embedded within a local search procedure. Preliminary experimental results are quite encouraging and suggest that the proposed approach may provide an efficient way to tackle hard real-life combinatorial problems.This research was partially supported by the Progetto Finalizzato Trasporti 2 of the Italian National Research Council, under Contract No. 91.02479.PF74. 相似文献
43.
The problem of line breaking consists of finding the best way to split paragraphs into lines. It has been cleverly addressed by the total‐fit algorithm exposed by Knuth and Plass in a well‐known paper. Similarly, page‐breaking algorithms break the content flow of a document into page units. Formatting languages—such as the World Wide Web Consortium standard Extensible Stylesheet Language Formatting Objects (XSL‐FO)—allow users to set which content should be kept in the same page and how many isolated lines are acceptable at the beginning/end of each page. The strategies most formatters adopt to meet these requirements, however, are not satisfactory for many publishing contexts as they very often generate unpleasant empty areas. In that case, typographers are required to manually craft the results in order to completely fill pages. This paper presents a page‐breaking algorithm that extends the original Knuth and Plass line‐breaking approach and produces high‐quality documents without unwanted empty areas. The basic idea consists of delaying the definitive choice of breaks in the line‐breaking process in order to provide a larger set of alternatives to the actual pagination step. The algorithm also allows users to decide the set of properties to be adjusted for pagination and their variation ranges. An application of the algorithm to XSL‐FO is also presented, with an extension of the language that allows users to drive the pagination process. The tool, named FOP+, is a customized version of the open‐source Apache Formatting Objects Processor formatter. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
44.
Francesco Banterle Massimiliano Corsini Paolo Cignoni Roberto Scopigno 《Computer Graphics Forum》2012,31(1):19-32
In this work we present a new algorithm for accelerating the colour bilateral filter based on a subsampling strategy working in the spatial domain. The base idea is to use a suitable subset of samples of the entire kernel in order to obtain a good estimation of the exact filter values. The main advantages of the proposed approach are that it has an excellent trade‐off between visual quality and speed‐up, a very low memory overhead is required and it is straightforward to implement on the GPU allowing real‐time filtering. We show different applications of the proposed filter, in particular efficient cross‐bilateral filtering, real‐time edge‐aware image editing and fast video denoising. We compare our method against the state of the art in terms of image quality, time performance and memory usage. 相似文献
45.
Carabalona R Grossi F Tessadri A Castiglioni P Caracciolo A de Munari I 《Ergonomics》2012,55(5):552-563
Brain-computer interface (BCI) systems aim to enable interaction with other people and the environment without muscular activation by the exploitation of changes in brain signals due to the execution of cognitive tasks. In this context, the visual P300 potential appears suited to control smart homes through BCI spellers. The aim of this work is to evaluate whether the widely used character-speller is more sustainable than an icon-based one, designed to operate smart home environment or to communicate moods and needs. Nine subjects with neurodegenerative diseases and no BCI experience used both speller types in a real smart home environment. User experience during BCI tasks was evaluated recording concurrent physiological signals. Usability was assessed for each speller type immediately after use. Classification accuracy was lower for the icon-speller, which was also more attention demanding. However, in subjective evaluations, the effect of a real feedback partially counterbalanced the difficulty in BCI use. PRACTITIONER SUMMARY: Since inclusive BCIs require to consider interface sustainability, we evaluated different ergonomic aspects of the interaction of disabled users with a character-speller (goal: word spelling) and an icon-speller (goal: operating a real smart home). We found the first one as more sustainable in terms of accuracy and cognitive effort. 相似文献
46.
V. Palmisano S. Agrestini G. Campi M. Filippi L. Simonelli M. Fratini A. Bianconi S. De Negri M. Giovannini A. Saccone A. N. Fitch M. Brunelli I. Margiolaki 《Journal of Superconductivity and Novel Magnetism》2005,18(5-6):737-741
The thermal lattice expansion in the superconducting Mg1? x Al x B2 system (x = 0, 0.13, and 0.59) has been measured using high-resolution X-ray powder diffraction. An unusual large negative thermal expansion (NTE) appears for temperatures below T * = 60 K in the MgB2. The NTE effect increases in Mg0.87Al0.13B2 and disappears at high Al content in the Mg0.59Al0.41B2 where the temperature dependence of volume follows a standard Einstein model in the whole temperature range. The anomalous behavior of the thermal expansion provides a direct evidence in the physics of diborides for the relevance of the proximity to the 2.5 Lifshitz electronic topological transition where the Fermi surface of the σband changes from a two-dimensional (2D) to a three-dimensional (3D) topology. 相似文献
47.
Anna Ciampolini Evelina Lamma Paola Mello Francesca Toni Paolo Torroni 《Annals of Mathematics and Artificial Intelligence》2003,37(1-2):65-91
This paper presents ALIAS, an agent architecture based on intelligent logic agents, where the main form of agent reasoning is abduction. The system is particularly suited for solving problems where knowledge is incomplete, where agents may need to make reasonable hypotheses about the problem domain and other agents, and where the raised hypotheses have to be consistent for the overall set of agents. ALIAS agents are pro-active, exhibiting a goal-directed behavior, and autonomous, since each one can solve problems using its own private knowledge base. ALIAS agents are also social, because they are able to interact with other agents, in order to cooperatively solve problems. The coordination mechanisms are modeled by means of LAILA, a logic-based language which allows to express intra-agent reasoning and inter-agent coordination. As an application, we show how LAILA can be used to implement inter-agent dialogues, e.g., for negotiation. In particular, LAILA is well-suited to coordinate the process of negotiation aimed at exchanging resources between agents, thus allowing them to execute the plans to achieve their goals. 相似文献
48.
Tropos: An Agent-Oriented Software Development Methodology 总被引:16,自引:4,他引:16
Paolo Bresciani Anna Perini Paolo Giorgini Fausto Giunchiglia John Mylopoulos 《Autonomous Agents and Multi-Agent Systems》2004,8(3):203-236
Our goal in this paper is to introduce and motivate a methodology, called Tropos,1 for building agent oriented software systems. Tropos is based on two key ideas. First, the notion of agent and all related mentalistic notions (for instance goals and plans) are used in all phases of software development, from early analysis down to the actual implementation. Second, Tropos covers also the very early phases of requirements analysis, thus allowing for a deeper understanding of the environment where the software must operate, and of the kind of interactions that should occur between software and human agents. The methodology is illustrated with the help of a case study. The Tropos language for conceptual modeling is formalized in a metamodel described with a set of UML class diagrams. 相似文献
49.
Marco Alberti Marco Gavanelli Evelina Lamma Paola Mello Paolo Torroni 《Electronic Notes in Theoretical Computer Science》2004,85(2):94
In this paper we propose a logic-based social approach to the specification and verification of agent interaction. We firstly introduce integrity constraints about social acts (called Social Integrity Constraints) as a formalism to express interaction protocols and to give a social semantics to the behavior of agents, focusing on communicative acts. Then, we discuss several possible kinds of verification of agent interaction, and we show how social integrity constraints can be used to verify some properties in this respect. We focus our attention on static verification of compliance of agent specifications to interaction protocols, and on run-time verification, based on agents' observable behavior. We adopt as a running example the NetBill security transaction protocol for the selling and delivery of information goods. 相似文献
50.
Laura Mannarino Lara Paracchini Federica Pezzuto Gheorghe Emilian Olteanu Laura Moracci Luca Vedovelli Irene De Simone Cristina Bosetti Monica Lupi Rosy Amodeo Alessia Inglesi Maurizio Callari Serena Penpa Roberta Libener Sara Delfanti Antonina De Angelis Alberto Muzio Paolo Andrea Zucali Paola Allavena Giovanni Luca Ceresoli Sergio Marchini Fiorella Calabrese Maurizio DIncalci Federica Grosso 《International journal of molecular sciences》2022,23(10)