全文获取类型
收费全文 | 3363篇 |
免费 | 113篇 |
国内免费 | 6篇 |
专业分类
电工技术 | 22篇 |
化学工业 | 728篇 |
金属工艺 | 125篇 |
机械仪表 | 79篇 |
建筑科学 | 103篇 |
矿业工程 | 37篇 |
能源动力 | 70篇 |
轻工业 | 325篇 |
水利工程 | 101篇 |
石油天然气 | 230篇 |
无线电 | 202篇 |
一般工业技术 | 599篇 |
冶金工业 | 211篇 |
原子能技术 | 40篇 |
自动化技术 | 610篇 |
出版年
2022年 | 45篇 |
2021年 | 61篇 |
2020年 | 46篇 |
2019年 | 39篇 |
2018年 | 48篇 |
2017年 | 59篇 |
2016年 | 107篇 |
2015年 | 68篇 |
2014年 | 86篇 |
2013年 | 262篇 |
2012年 | 180篇 |
2011年 | 215篇 |
2010年 | 166篇 |
2009年 | 140篇 |
2008年 | 159篇 |
2007年 | 110篇 |
2006年 | 120篇 |
2005年 | 72篇 |
2004年 | 71篇 |
2003年 | 67篇 |
2002年 | 68篇 |
2001年 | 43篇 |
2000年 | 38篇 |
1999年 | 40篇 |
1998年 | 64篇 |
1997年 | 58篇 |
1996年 | 25篇 |
1994年 | 30篇 |
1993年 | 36篇 |
1992年 | 30篇 |
1991年 | 37篇 |
1990年 | 30篇 |
1989年 | 30篇 |
1988年 | 30篇 |
1987年 | 25篇 |
1985年 | 28篇 |
1984年 | 41篇 |
1981年 | 28篇 |
1980年 | 34篇 |
1979年 | 37篇 |
1978年 | 44篇 |
1977年 | 44篇 |
1976年 | 36篇 |
1975年 | 47篇 |
1974年 | 50篇 |
1973年 | 38篇 |
1972年 | 28篇 |
1971年 | 28篇 |
1970年 | 35篇 |
1969年 | 29篇 |
排序方式: 共有3482条查询结果,搜索用时 31 毫秒
81.
Stéphane Zieba Philippe Polet Frédéric Vanderhaegen Serge Debernard 《Cognition, Technology & Work》2010,12(3):193-203
Unmanned ground vehicles tend to be more and more autonomous, but both complete teleoperation and full autonomy are not efficient
enough to deal with all possible situations. To be efficient, the human–robot system must be able to anticipate, react and
recover from errors of different kinds, i.e., to be resilient. From this observation, this paper proposes a survey on the
resilience of a human–machine system and the means to control the resilience. The resilience of a system can be defined as
the ability to maintain or recover a stable state when subject to disturbance. Adjustable autonomy and human–machine cooperation
are considered as means of resilience for the system. This paper then proposes three indicators to assess different meanings
of resilience of the system: foresight and avoidance of events, reaction to events and recovery from occurrence of events.
The third of these metrics takes into consideration the concept of affordances that allows a common representation for the
opportunities of action between the automated system and its environment. 相似文献
82.
Roberto Sanchez Geneviève Dauphin-Tanguy Xavier Guillaud Frédéric Colas 《Simulation Modelling Practice and Theory》2010,18(9):1185-1198
This paper proposes a model of a three phase electrical inverter with a LC output filter in delta connection used in a renewable energy supply system. The concept of inverse bond graph via bicausality is used for the control law design. The control law robustness is tested by connecting passive and active (induction machine) loads. 相似文献
83.
This paper proposes a mathematical model, valid inequalities and polyhedral results for the minimum labeling Hamiltonian cycle problem. This problem is defined on an unweighted graph in which each edge has a label. The aim is to determine a Hamiltonian cycle with the least number of labels. We also define two variants of this problem by assigning weights to the edges and by considering the tour length either as an objective or as a constraint. A branch-and-cut algorithm for the three problems is developed, and computational results are reported on randomly generated instances and on modified instances from TSPLIB. 相似文献
84.
Abstract: Managing multiple ontologies is now a core question in most of the applications that require semantic interoperability. The semantic web is surely the most significant application of this report: the current challenge is not to design, develop and deploy domain ontologies but to define semantic correspondences among multiple ontologies covering overlapping domains. In this paper, we introduce a new approach of ontology matching named axiom-based ontology matching. As this approach is founded on the use of axioms, it is mainly dedicated to heavyweight ontologies, but it can also be applied to lightweight ontologies as a complementary approach to the current techniques based on the analysis of natural language expressions, instances and/or taxonomical structures of ontologies. This new matching paradigm is defined in the context of the conceptual graphs model, where the projection (i.e. the main operator for reasoning with conceptual graphs which corresponds to homomorphism of graphs) is used as a means to semantically match the concepts and the relations of two ontologies through the explicit representation of the axioms in terms of conceptual graphs. We also introduce an ontology of representation, called MetaOCGL, dedicated to the reasoning of heavyweight ontologies at the meta-level. 相似文献
85.
Frédéric Jean Author Vitae Alexandra Branzan Albu Author Vitae 《Pattern recognition》2009,42(11):2936-2949
This paper proposes an approach to compute view-normalized body part trajectories of pedestrians walking on potentially non-linear paths. The proposed approach finds applications in gait modeling, gait biometrics, and in medical gait analysis. Our approach uses the 2D trajectories of both feet and the head extracted from the tracked silhouettes. On that basis, it computes the apparent walking (sagittal) planes for each detected gait half-cycle. A homography transformation is then computed for each walking plane to make it appear as if walking was observed from a fronto-parallel view. Finally, each homography is applied to head and feet trajectories over each corresponding gait half-cycle. View normalization makes head and feet trajectories appear as if seen from a fronto-parallel viewpoint, which is assumed to be optimal for gait modeling purposes. The proposed approach is fully automatic as it requires neither manual initialization nor camera calibration. An extensive experimental evaluation of the proposed approach confirms the validity of the normalization process. 相似文献
86.
87.
This article deals with a local improvement of domain decomposition methods for 2-dimensional elliptic problems for which
either the geometry or the domain decomposition presents conical singularities. After explaining the main results of the theoretical
analysis carried out in Chniti et al. (Calcolo 45, 2008), the numerical experiments presented in this article confirm the optimality properties of the new interface conditions. 相似文献
88.
Bytecode instrumentation is a widely used technique to implement aspect weaving and dynamic analyses in virtual machines such as the Java virtual machine. Aspect weavers and other instrumentations are usually developed independently and combining them often requires significant engineering effort, if at all possible. In this article, we present polymorphic bytecode instrumentation(PBI), a simple but effective technique that allows dynamic dispatch amongst several, possibly independent instrumentations. PBI enables complete bytecode coverage, that is, any method with a bytecode representation can be instrumented. We illustrate further benefits of PBI with three case studies. First, we describe how PBI can be used to implement a comprehensive profiler of inter‐procedural and intra‐procedural control flow. Second, we provide an implementation of execution levels for AspectJ, which avoids infinite regression and unwanted interference between aspects. Third, we present a framework for adaptive dynamic analysis, where the analysis to be performed can be changed at runtime by the user. We assess the overhead introduced by PBI and provide thorough performance evaluations of PBI in all three case studies. We show that pure Java profilers like JP2 can, thanks to PBI, produce accurate execution profiles by covering all code, including the core Java libraries. We then demonstrate that PBI‐based execution levels are much faster than control flow pointcuts to avoid interference between aspects and that their efficient integration in a practical aspect language is possible. Finally, we report that PBI enables adaptive dynamic analysis tools that are more reactive to user inputs than existing tools that rely on dynamic aspect‐oriented programming with runtime weaving. These experiments position PBI as a widely applicable and practical approach for combining bytecode instrumentations. © 2015 The Authors. Software: Practice and Experience Published by John Wiley & Sons Ltd. 相似文献
89.
Éric Lunaud Ngoupé Clément Parisot Sylvan Stoesel Petko Valtchev Roger Villemaire Omar Cherkaoui Pierre Boucher Sylvain Hallé 《Journal of Network and Systems Management》2017,25(1):180-209
Configuration Logic (CL) is a formal language that allows a network engineer to express constraints in terms of the actual parameters found in the configuration of network devices. We present an efficient algorithm that can automatically check a pool of devices for conformance to a set of CL constraints; moreover, this algorithm can point to the part of the configuration responsible for the error when a constraint is violated. Contrary to other validation approaches that require dumping the configuration of the whole network to a central location in order to be verified, we also present an algorithm that analyzes the correct formulas and greatly helps reduce the amount of data that need to be transferred to that central location, pushing as much of the evaluation of the formula locally on each device. The procedure is also backwards-compatible, in such a way that a device that does not (or only partially) supports a local evaluation may simply return a subset or all of its configuration. These capabilities have been integrated into a network management tool called ValidMaker. 相似文献
90.
Simultaneous automated design of structured QFT controller and prefilter using nonlinear programming
下载免费PDF全文
![点击此处可从《国际强度与非线性控制杂志<br>》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Harsh Purohit Alexandre Goldsztejn Christophe Jermann Laurent Granvilliers Frédéric Goualard P. S. V. Nataraj Bhagyesh Patil 《国际强度与非线性控制杂志
》2017,27(15):2529-2548
》2017,27(15):2529-2548
This paper describes a nonlinear programming‐based robust design methodology for controllers and prefilters of a predefined structure for the linear time‐invariant systems involved in the quantitative feedback theory. This controller and prefilter synthesis problem is formulated as a single optimization problem with a given performance optimization objective and constraints enforcing stability and various specifications usually enforced in the quantitative feedback theory. The focus is set on providing constraints expression that can be used in standard nonlinear programming solvers. The nonlinear solver then computes in a single‐step controller and prefilter design parameters that satisfy the prescribed constraints and maximizes the performance optimization objective. The effectiveness of the proposed approach is demonstrated through a variety of difficult design cases like resonant plants, open‐loop unstable plants, and plants with variation in the time delay. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献