全文获取类型
收费全文 | 2029篇 |
免费 | 152篇 |
国内免费 | 6篇 |
专业分类
电工技术 | 24篇 |
综合类 | 2篇 |
化学工业 | 564篇 |
金属工艺 | 45篇 |
机械仪表 | 34篇 |
建筑科学 | 79篇 |
矿业工程 | 1篇 |
能源动力 | 73篇 |
轻工业 | 240篇 |
水利工程 | 6篇 |
石油天然气 | 2篇 |
无线电 | 211篇 |
一般工业技术 | 400篇 |
冶金工业 | 53篇 |
原子能技术 | 36篇 |
自动化技术 | 417篇 |
出版年
2024年 | 1篇 |
2023年 | 20篇 |
2022年 | 49篇 |
2021年 | 66篇 |
2020年 | 51篇 |
2019年 | 45篇 |
2018年 | 62篇 |
2017年 | 72篇 |
2016年 | 67篇 |
2015年 | 78篇 |
2014年 | 103篇 |
2013年 | 161篇 |
2012年 | 137篇 |
2011年 | 224篇 |
2010年 | 147篇 |
2009年 | 135篇 |
2008年 | 126篇 |
2007年 | 87篇 |
2006年 | 90篇 |
2005年 | 79篇 |
2004年 | 60篇 |
2003年 | 64篇 |
2002年 | 45篇 |
2001年 | 25篇 |
2000年 | 20篇 |
1999年 | 30篇 |
1998年 | 17篇 |
1997年 | 13篇 |
1996年 | 23篇 |
1995年 | 9篇 |
1994年 | 17篇 |
1993年 | 17篇 |
1992年 | 10篇 |
1991年 | 6篇 |
1990年 | 5篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1987年 | 2篇 |
1986年 | 4篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1982年 | 3篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1974年 | 1篇 |
排序方式: 共有2187条查询结果,搜索用时 0 毫秒
11.
A review of smart homes- present state and future challenges 总被引:5,自引:0,他引:5
In the era of information technology, the elderly and disabled can be monitored with numerous intelligent devices. Sensors can be implanted into their home for continuous mobility assistance and non-obtrusive disease prevention. Modern sensor-embedded houses, or smart houses, cannot only assist people with reduced physical functions but help resolve the social isolation they face. They are capable of providing assistance without limiting or disturbing the resident's daily routine, giving him or her greater comfort, pleasure, and well-being. This article presents an international selection of leading smart home projects, as well as the associated technologies of wearable/implantable monitoring systems and assistive robotics. The latter are often designed as components of the larger smart home environment. The paper will conclude by discussing future challenges of the domain. 相似文献
12.
Behaviour based on decision matrices for a coordination between agents in a urban traffic simulation
René Mandiau Alexis Champion Jean-Michel Auberlet Stéphane Espié Christophe Kolski 《Applied Intelligence》2008,28(2):121-138
This paper describes a multi-agent coordination mechanism applied to intersection simulation situations. In a goal of urban
traffic simulation, we must consider the dynamic interactions between autonomous vehicles. The field of multi-agent systems
provides us some studies for such systems, in particular on the coordination mechanisms. Conflicts between vehicles (i.e.
agents) are very frequent in such applications, and they may cause deadlocks, particularly at intersections such as crossroads.
Our approach is based on the solving of two player games/decision matrices which characterize three basic situations. An aggregation
method generalizes to n-player games for complex crossroads. The objective of this approach consists in searching basic two-player
matrices for solving n-agent problems. To explain the principle, we describe our approach for a particular case of crossroad
with three agents. Finally, the obtained results have been examined via a tool of road traffic simulation, ARCHISIM. We assume
also that the global traffic replicates the behavior of agents in different situations. 相似文献
13.
To improve the efficiency and the quality of a service, a network operator may consider deploying a peer-to-peer architecture among controlled peers, also called here nano data centers, which contrast with the churn and resource heterogeneity of peers in uncontrolled environments. In this paper, we consider a prevalent peer-to-peer application: live video streaming. We demonstrate how nano data centers can take advantage of the self-scaling property of a peer-to-peer architecture, while significantly improving the quality of a live video streaming service, allowing smaller delays and fast channel switching. We introduce the branching architecture for nano datacenters (BAND), where a user can “pull” content from a channel of interest, or content could be “pushed” to it for relaying to other interested users. We prove that there exists an optimal trade-off point between minimizing the number of push, or the number of relaying nodes, and maintaining a robust topology as the number of channels and users get large, which allows scalability. We analyze the performance of content dissemination as users switch between channels, creating migration of nodes in the tree, while flow control insures continuity of data transmission. We prove that this p2p architecture guarantees a throughput independently of the size of the group. Analysis and evaluation of the model demonstrate that pushing content to a small number of relay nodes can have significant performance gains in throughput, start-up time, playback lags and channel switching delays. 相似文献
14.
Sheng Ying Zohar Yoni Ringeissen Christophe Lange Jane Fontaine Pascal Barrett Clark 《Journal of Automated Reasoning》2022,66(3):331-355
Journal of Automated Reasoning - Algebraic datatypes, and among them lists and trees, have attracted a lot of interest in automated reasoning and Satisfiability Modulo Theories (SMT). Since its... 相似文献
15.
Christophe Kassiotis Adnan Ibrahimbegovic Hermann G. Matthies Bostjan Brank 《Computer Methods in Applied Mechanics and Engineering》2010,199(21-22):1254-1264
An efficient implementation of the operator split procedure for boundary value solution with plastic flow computation is presented for a general form of associated plasticity model. We start with the general form of phenomenological model of plasticity where the yield criterion is not restricted to a simple (quadratic) form, and the elasticity tensor does not have constant entries. We then turn to the multi-scale model of plasticity which employs the fine scale representation of the plastic deformation along with the homogenization procedure for stress computation. We also visit the plasticity model with rate sensitive plastic response where plastic flow computation is carried out at fine scale in time. We proved herein the sufficient and necessary conditions for the proposed operator split procedure to converge, for any such general form of associated plasticity. Moreover, we presented a systematic manner for constructing the main ingredients for the plastic flow computation and the global Newton’s iteration, such as the consistent elastoplastic tangent. 相似文献
16.
The Gaussian quasi-maximum likelihood estimator of Multivariate GARCH models is shown to be very sensitive to outliers in the data. A class of robust M-estimators for MGARCH models is developed. To increase the robustness of the estimators, the use of volatility models with the property of bounded innovation propagation is recommended. The Monte Carlo study and an empirical application to stock returns document the good robustness properties of the M-estimator with a fat-tailed Student t loss function. 相似文献
17.
Duc-Khanh Tran Christophe Ringeissen Silvio Ranise Hélène Kirchner 《Journal of Symbolic Computation》2010
Decision procedures are key components of theorem provers and constraint satisfaction systems. Their modular combination is of prime interest for building efficient systems, but their effective use is often limited by poor interface capabilities, when such procedures only provide a simple “sat/unsat” answer. In this paper, we develop a framework to design cooperation schemas between such procedures while maintaining modularity of their interfaces. First, we use the framework to specify and prove the correctness of classic combination schemas by Nelson–Oppen and Shostak. Second, we introduce the concept of deduction complete satisfiability procedures, we show how to build them for large classes of theories, then we provide a schema to modularly combine them. Third, we consider the problem of modularly constructing explanations for combinations by re-using available proof-producing procedures for the component theories. 相似文献
18.
Véronique Souchère Laurent Millair Javier Echeverria François Bousquet Christophe Le Page Michel Etienne 《Environmental Modelling & Software》2010,25(11):1359-1370
Erosive runoff is a recurring problem and is a source of sometimes deadly muddy floods in the Pays de Caux (France). The risk results from a conjunction of natural factors and human activity. Efficient actions against runoff in agricultural watersheds are well known. However they are still difficult to implement as they require co-operation between stakeholders. Local actors thus need tools to help them understand the collective consequences of their individual decisions and help to initiate a process of negotiation between them. We decided to use a participatory approach called companion modelling (ComMod), and, in close collaboration with one of the first group of local stakeholders, to create a role-playing game (RPG) to facilitate negotiations on the future management of erosive runoff. This paper describes and discusses the development of the RPG and its use with other groups of local stakeholders within the framework of two game sessions organized by two different watershed management committees. During the joint construction step, stakeholders shared their viewpoints about the environment, agents, rules, and how to model runoff in preparation for the creation of the RPG. During the RPG sessions, two groups of eight players, including farmers, mayors and watershed advisors, were confronted with disastrous runoff in a fictive agricultural watershed. Results showed that they managed to reduce runoff by 20–50% by engaging a dialogue about grass strips, storage ponds and management of the intercrop period. However, further progress is still needed to better control runoff through the implementation of better agricultural practices because, during the RPG sessions, the watershed advisors did not encourage farmers to do so. Because of the complexity of management problems, results of jointly constructing the game and the RPG sessions showed that modelling and simulation can be a very useful way of accompanying the collective learning process. This new way of working was welcomed by the participants who expressed their interest in organizing further RPG sessions. 相似文献
19.
20.