全文获取类型
收费全文 | 2713篇 |
免费 | 209篇 |
国内免费 | 9篇 |
专业分类
电工技术 | 57篇 |
综合类 | 1篇 |
化学工业 | 840篇 |
金属工艺 | 34篇 |
机械仪表 | 66篇 |
建筑科学 | 72篇 |
矿业工程 | 3篇 |
能源动力 | 97篇 |
轻工业 | 318篇 |
水利工程 | 11篇 |
石油天然气 | 1篇 |
无线电 | 202篇 |
一般工业技术 | 443篇 |
冶金工业 | 41篇 |
原子能技术 | 33篇 |
自动化技术 | 712篇 |
出版年
2024年 | 4篇 |
2023年 | 44篇 |
2022年 | 192篇 |
2021年 | 205篇 |
2020年 | 80篇 |
2019年 | 98篇 |
2018年 | 115篇 |
2017年 | 90篇 |
2016年 | 139篇 |
2015年 | 114篇 |
2014年 | 153篇 |
2013年 | 224篇 |
2012年 | 172篇 |
2011年 | 195篇 |
2010年 | 138篇 |
2009年 | 164篇 |
2008年 | 139篇 |
2007年 | 99篇 |
2006年 | 96篇 |
2005年 | 88篇 |
2004年 | 65篇 |
2003年 | 49篇 |
2002年 | 42篇 |
2001年 | 30篇 |
2000年 | 25篇 |
1999年 | 16篇 |
1998年 | 27篇 |
1997年 | 17篇 |
1996年 | 23篇 |
1995年 | 15篇 |
1994年 | 5篇 |
1993年 | 8篇 |
1992年 | 6篇 |
1991年 | 7篇 |
1990年 | 2篇 |
1989年 | 5篇 |
1988年 | 2篇 |
1987年 | 5篇 |
1985年 | 2篇 |
1984年 | 4篇 |
1983年 | 4篇 |
1982年 | 4篇 |
1980年 | 3篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1977年 | 4篇 |
1976年 | 2篇 |
1975年 | 3篇 |
1974年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有2931条查询结果,搜索用时 31 毫秒
71.
Alessandro Agnetis Enrico Grande Pitu B. Mirchandani Andrea Pacifici 《Computers & Operations Research》2009
The paper addresses the problem of locating sensors with a circular field of view so that a given line segment is under full surveillance, which is termed as the disc covering problem on a line. The cost of each sensor includes a fixed component f, and a variable component that is a convex function of the diameter of the field-of-view area. When only one type of sensor or, in general, one type of disc, is available, then a simple polynomial algorithm solves the problem. When there are different types of sensors, the problem becomes hard. A branch-and-bound algorithm as well as an efficient heuristic are developed for the special case in which the variable cost component of each sensor is proportional to the square of the measure of the field-of-view area. The heuristic very often obtains the optimal solution as shown in extensive computational testing. 相似文献
72.
Alfonso E. Gerevini Patrik Haslum Derek Long Alessandro Saetti Yannis Dimopoulos 《Artificial Intelligence》2009,173(5-6):619-668
The international planning competition (IPC) is an important driver for planning research. The general goals of the IPC include pushing the state of the art in planning technology by posing new scientific challenges, encouraging direct comparison of planning systems and techniques, developing and improving a common planning domain definition language, and designing new planning domains and problems for the research community. This paper focuses on the deterministic part of the fifth international planning competition (IPC5), presenting the language and benchmark domains that we developed for the competition, as well as a detailed experimental evaluation of the deterministic planners that entered IPC5, which helps to understand the state of the art in the field.We present an extension of pddl, called pddl3, allowing the user to express strong and soft constraints about the structure of the desired plans, as well as strong and soft problem goals. We discuss the expressive power of the new language focusing on the restricted version that was used in IPC5, for which we give some basic results about its compilability into pddl2. Moreover, we study the relative performance of the IPC5 planners in terms of solved problems, CPU time, and plan quality; we analyse their behaviour with respect to the winners of the previous competition; and we evaluate them in terms of their capability of dealing with soft goals and constraints, and of finding good quality plans in general. Overall, the results indicate significant progress in the field, but they also reveal that some important issues remain open and require further research, such as dealing with strong constraints and computing high quality plans in metric-time domains and domains involving soft goals or constraints. 相似文献
73.
This note deals with the implementation of a second-order sliding mode control algorithm for a class of nonlinear systems in which the sign of the high-frequency gain, though constant, is unknown. A specific second-order sliding mode control algorithm, the “Suboptimal” algorithm, is properly modified in order to face the uncertainty in the control direction. It is shown that after a finite time the uncertain sign is identified and the standard finite time convergence takes place from that time on. Simulation results are provided. 相似文献
74.
This article studies the exponential stabilization problem for discrete-time switched linear systems based on a control-Lyapunov function approach. It is proved that a switched linear system is exponentially stabilizable if and only if there exists a piecewise quadratic control-Lyapunov function. Such a converse control-Lyapunov function theorem justifies many of the earlier synthesis methods that have adopted piecewise quadratic Lyapunov functions for convenience or heuristic reasons. In addition, it is also proved that if a switched linear system is exponentially stabilizable, then it must be stabilizable by a stationary suboptimal policy of a related switched linear-quadratic regulator (LQR) problem. Motivated by some recent results of the switched LQR problem, an efficient algorithm is proposed, which is guaranteed to yield a control-Lyapunov function and a stabilizing policy whenever the system is exponentially stabilizable. 相似文献
75.
Alessandro Pollini 《AI & Society》2009,24(2):165-171
In interacting with artificial social agents, novel forms of sociality between humans and machines emerge. The theme of Social
Agency between humans and robots is of emerging importance. In this paper key theoretical issues are discussed in a preliminary
exploration of the concept. We try to understand what Social Agency is and how it is created by, negotiated with, and attributed
to artificial agents. This is done in particular considering socially situated robots and by exploring how people recognize
and accept social agents. The interplay between humans and agents is investigated through dynamics of interpretation, signification
and attribution. The ultimate goal of this research is to explore the challenges and opportunities brought by the design of
socially intelligent agents.
相似文献
Alessandro PolliniEmail: |
76.
Alessandro Farinelli Masoume M. Raeissi Nicolo’ Marchi Nathan Brooks Paul Scerri 《Autonomous Agents and Multi-Agent Systems》2017,31(2):332-361
Team oriented plans have become a popular tool for operators to control teams of autonomous robots to pursue complex objectives in complex environments. Such plans allow an operator to specify high level directives and allow the team to autonomously determine how to implement such directives. However, the operators will often want to interrupt the activities of individual team members to deal with particular situations, such as a danger to a robot that the robot team cannot perceive. Previously, after such interrupts, the operator would usually need to restart the team plan to ensure its success. In this paper, we present an approach to encoding how interrupts can be smoothly handled within a team plan. Building on a team plan formalism that uses Colored Petri Nets, we describe a mechanism that allows a range of interrupts to be handled smoothly, allowing the team to efficiently continue with its task after the operator intervention. We validate the approach with an application of robotic watercraft and show improved overall efficiency. In particular, we consider a situation where several platforms should travel through a set of pre-specified locations, and we identify three specific cases that require the operator to interrupt the plan execution: (i) a boat must be pulled out; (ii) all boats should stop the plan and move to a pre-specified assembly position; (iii) a set of boats must synchronize to traverse a dangerous area one after the other. Our experiments show that the use of our interrupt mechanism decreases the time to complete the plan (up to 48 % reduction) and decreases the operator load (up to 80 % reduction in number of user actions). Moreover, we performed experiments with real robotic platforms to validate the applicability of our mechanism in the actual deployment of robotic watercraft. 相似文献
77.
This paper proposes a novel class of Command Governor (CG) strategies for input and state-related constrained discrete-time LTI systems subject to bounded disturbances in the absence of explicit state or output measurements. While in traditional CG schemes the set-point manipulation is undertaken on the basis of either the actual measure of the state or its suitable estimation, it is shown here that the CG design problem can be solved, with limited performance degradation and with similar properties, also in the case that such an explicit measure is not available. This approach, which will be referred to as the Feed-Forward CG (FF-CG) approach, may be a convenient alternative CG solution in all situations whereby the cost of measuring the state may be a severe limitation, e.g. in distributed or decentralized applications. In order to evaluate the method proposed here, numerical simulations on a physical example have been undertaken and comparisons with the standard state-based CG solution reported. 相似文献
78.
Damien Sulla-Menashe Mark A. Friedl Olga N. Krankina Alessandro Baccini Curtis E. Woodcock Adam Sibley Guoqing Sun Viacheslav Kharuk Vladimir Elsakov 《Remote sensing of environment》2011,115(2):392-403
The Northern Eurasian land mass encompasses a diverse array of land cover types including tundra, boreal forest, wetlands, semi-arid steppe, and agricultural land use. Despite the well-established importance of Northern Eurasia in the global carbon and climate system, the distribution and properties of land cover in this region are not well characterized. To address this knowledge and data gap, a hierarchical mapping approach was developed that encompasses the study area for the Northern Eurasia Earth System Partnership Initiative (NEESPI). The Northern Eurasia Land Cover (NELC) database developed in this study follows the FAO-Land Cover Classification System and provides nested groupings of land cover characteristics, with separate layers for land use, wetlands, and tundra. The database implementation is substantially different from other large-scale land cover datasets that provide maps based on a single set of discrete classes. By providing a database consisting of nested maps and complementary layers, the NELC database provides a flexible framework that allows users to tailor maps to suit their needs. The methods used to create the database combine empirically derived climate–vegetation relationships with results from supervised classifications based on Moderate Resolution Imaging Spectroradiometer (MODIS) data. The hierarchical approach provides an effective framework for integrating climate–vegetation relationships with remote sensing-based classifications, and also allows sources of error to be characterized and attributed to specific levels in the hierarchy. The cross-validated accuracy was 73% for the land cover map and 73% and 91% for the agriculture and wetland classifications, respectively. These results support the use of hierarchical classification and climate–vegetation relationships for mapping land cover at continental scales. 相似文献
79.
Alessandro Lapadula Rosario Pugliese Francesco Tiezzi 《Electronic Notes in Theoretical Computer Science》2008,200(3):133
To provide formal foundations to current (web) services technologies, we put forward using COWS, a process calculus for specifying, combining and analysing services, as a uniform formalism for modelling all the relevant phases of the life cycle of service-oriented applications, such as publication, discovery, negotiation, deployment and execution. In this paper, we show that constraints and operations on them can be smoothly incorporated in COWS, and propose a disciplined way to model multisets of constraints and to manipulate them through appropriate interaction protocols. Therefore, we demonstrate that also QoS requirement specifications and SLA achievements, and the phases of dynamic service discovery and negotiation can be comfortably modelled in COWS. We illustrate our approach through a scenario for a service-based web hosting provider. 相似文献
80.
Enver Sangineto Nicola Capuano Matteo Gaeta Alessandro Micarelli 《Universal Access in the Information Society》2008,7(1-2):1-23
This paper presents an approach to automatic course generation and student modeling. The method has been developed during
the European funded projects Diogene and Intraserv, focused on the construction of an adaptive e-learning platform. The aim
of the platform is the automatic generation and personalization of courses, taking into account pedagogical knowledge on the
didactic domain as well as statistic information on both the student’s knowledge degree and learning preferences. Pedagogical
information is described by means of an innovative methodology suitable for effective and efficient course generation and
personalization. Moreover, statistic information can be collected and exploited by the system in order to better describe
the student’s preferences and learning performances. Learning material is chosen by the system matching the student’s learning
preferences with the learning material type, following a pedagogical approach suggested by Felder and Silverman. The paper
discusses how automatic learning material personalization makes it possible to facilitate distance learning access to both
able-bodied and disabled people. Results from the Diogene and Intraserv evaluation are reported and discussed. 相似文献