全文获取类型
收费全文 | 4006篇 |
免费 | 550篇 |
国内免费 | 4篇 |
专业分类
电工技术 | 15篇 |
综合类 | 1篇 |
化学工业 | 1167篇 |
金属工艺 | 35篇 |
机械仪表 | 72篇 |
建筑科学 | 147篇 |
矿业工程 | 7篇 |
能源动力 | 60篇 |
轻工业 | 1587篇 |
水利工程 | 40篇 |
石油天然气 | 28篇 |
无线电 | 134篇 |
一般工业技术 | 599篇 |
冶金工业 | 266篇 |
原子能技术 | 3篇 |
自动化技术 | 399篇 |
出版年
2024年 | 13篇 |
2023年 | 43篇 |
2022年 | 77篇 |
2021年 | 128篇 |
2020年 | 134篇 |
2019年 | 137篇 |
2018年 | 239篇 |
2017年 | 225篇 |
2016年 | 252篇 |
2015年 | 231篇 |
2014年 | 235篇 |
2013年 | 440篇 |
2012年 | 350篇 |
2011年 | 345篇 |
2010年 | 225篇 |
2009年 | 178篇 |
2008年 | 176篇 |
2007年 | 209篇 |
2006年 | 117篇 |
2005年 | 117篇 |
2004年 | 92篇 |
2003年 | 104篇 |
2002年 | 88篇 |
2001年 | 32篇 |
2000年 | 21篇 |
1999年 | 27篇 |
1998年 | 66篇 |
1997年 | 63篇 |
1996年 | 36篇 |
1995年 | 33篇 |
1994年 | 18篇 |
1993年 | 18篇 |
1992年 | 8篇 |
1991年 | 5篇 |
1990年 | 6篇 |
1989年 | 7篇 |
1988年 | 5篇 |
1987年 | 2篇 |
1985年 | 3篇 |
1984年 | 5篇 |
1982年 | 2篇 |
1981年 | 7篇 |
1980年 | 7篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1977年 | 6篇 |
1976年 | 10篇 |
1974年 | 7篇 |
1969年 | 1篇 |
1968年 | 1篇 |
排序方式: 共有4560条查询结果,搜索用时 531 毫秒
71.
María Cristina Riff Xavier Bonnaire Bertrand Neveu 《Engineering Applications of Artificial Intelligence》2009,22(4-5):823-827
In this paper, we present a review of the recent approaches proposed in the literature for strip-packing problems. Many of them have been concurrently published, given some similar results for the same set of benchmarks. Due to the quantity of published papers, it is difficult to ascertain the level of current research in this area. 相似文献
72.
This paper presents a system that is able to process the information provided by a Tagged World to identify user’s behavior and to produce alarms in dangerous situations. The system inputs are signals from sensors, which are used to recognize correct behavior (action sequences) by Inductive Learning, using Data Mining techniques. The inference engine is a reasoning device that is implemented by means of Regular Grammars. It permits us to control user’s behavior. As output, the system produces and sends alarms when a user action sequence is wrong, indicating the erroneous actions, forgotten future, and so on. To test our system, the Tagged World is supposed to be at a house, where we have used RFID technology to control the objects inside it. 相似文献
73.
74.
Virtual organizations (VOs) are formed by an alliance of organizations linked by a partnership for dealing with emerging challenges. Information and communication technologies play a fundamental role facilitating cooperation, communication and collaboration among the VO members. The formal identification and representation of Requirements Engineering (RE) for one organization have been researched to a large extent along with several elicitation techniques. However, these techniques are not adequate for covering the major challenges of RE for VO. We explore the work done in the management and RE fields to propose a model-based framework for eliciting VOs’ requirements. The goal is to analyze the VO from two points of view: border (intra-organizational, inter-organizational and extra-organizational) and abstract (intentional, organizational and operational). This article includes the framework validation with a case study and a transformation process to develop partial Business Process Diagram from the intentional models. 相似文献
75.
Luis Alvarez‐Icaza Oscar Rosas‐Jaimes María Elena Lárraga 《Asian journal of control》2017,19(2):494-509
A framework for stability analysis of local on‐ramp metering control strategies based on the cell transmission model is presented. Within this framework, it is possible to formulate Lyapunov and input‐state stability results for on‐ramp metering control strategies in an open section of highway with on‐ramps. Using this analysis, recommendations for the design of on‐ramp metering control laws set points are derived. Two examples on the use of such analysis are presented. One deals with the stability analysis of a local on‐ramp metering control law and the other with the design of a disturbance observer that, used in combination with the local on‐ramp metering control law, provides a more robust response to traffic regulation. Simulation results are included that confirm the possibility of using this framework to test the impact of local on‐ramp metering control strategies. 相似文献
76.
Arce-Urriza Marta Cebollada Javier Tarira María Fernanda 《Information Systems and E-Business Management》2017,15(1):69-87
Information Systems and e-Business Management - This study evaluates the differential effect of price promotions on brand choice across the offline and online channels of a grocery retailer. We use... 相似文献
77.
Juan M. Marín Pérez Jorge Bernal Bernabé Jose M. Alcaraz Calero Felix J. Garcia Clemente Gregorio Martínez Pérez Antonio F. Gómez Skarmeta 《Future Generation Computer Systems》2011,27(1):40-55
There are a few issues that still need to be covered regarding security in the Grid area. One of them is authorization where there exist good solutions to define, manage and enforce authorization policies in Grid scenarios. However, these solutions usually do not provide Grid administrators with semantic-aware components closer to the particular Grid domain and easing different administration tasks such as conflict detection or resolution. This paper defines a proposal based on Semantic Web to define, manage and enforce security policies in a Grid scenario. These policies are defined by means of semantic-aware rules which help the administrator to create higher-level definitions with more expressiveness. These rules also permit performing added-value tasks such as conflict detection and resolution, which can be of interest in medium and large scale scenarios where different administrators define the authorization rules that should be followed before accessing a resource in the Grid. The proposed solution has been also tested providing some reasonable response times in the authorization decision process. 相似文献
78.
Francisco Jes��s Mart��n-Mateos Jos�� Luis Ruiz-Reina Jos�� Antonio Alonso Mar��a Jos�� Hidalgo 《Journal of Automated Reasoning》2011,47(3):229-250
Higman??s lemma is an important result in infinitary combinatorics, which has been formalized in several theorem provers. In this paper we present a formalization and proof of Higman??s Lemma in the ACL2 theorem prover. Our formalization is based on a proof by Murthy and Russell, where the key termination argument is justified by the multiset relation induced by a well-founded relation. To our knowledge, this is the first mechanization of this proof. 相似文献
79.
Flavio Antonio Ferrarotti José María Turull Torres 《Annals of Mathematics and Artificial Intelligence》2007,50(1-2):111-141
We study the effect of simultaneously bounding the maximal-arity of the higher-order variables and the alternation of quantifiers in higher-order logics, as to their expressive power on finite structures (or relational databases). Let $\mathit{AA}^i(r,m)$ be the class of (i?+?1)-th order logic formulae where all quantifiers are grouped together at the beginning of the formulae, forming m alternating blocks of consecutive existential and universal quantifiers, and such that the maximal-arity (a generalization of the concept of arity, not just the maximal of the arities of the quantified variables) of the higher-order variables is bounded by r. Note that, the order of the quantifiers in the prefix may be mixed. We show that, for every i?≥?1, the resulting $\mathit{AA}^i(r,m)$ hierarchy of formulae of (i?+?1)-th order logic is proper. This extends a result by Makowsky and Pnueli who proved that the same hierarchy in second-order logic is proper. In both cases the strategy used to prove the results consists in considering formulae which, represented as finite structures, satisfy themselves. As the well known diagonalization argument applies here, this gives rise, for each order i and each level of the $\mathit{AA}^i(r,m)$ hierarchy of arity and alternation, to a class of formulae which is not definable in that level, but which is definable in a higher level of the same hierarchy. We then use a similar argument to prove that the classes of $\Sigma^i_m \cup \Pi^i_m$ formulae in which the higher-order variables of all orders up to i?+?1 have maximal-arity at most r, also induce a proper hierarchy in each higher-order logic of order i?≥?3. It is not known whether the correspondent hierarchy in second-order logic is proper. Using the concept of finite model truth definitions introduced by M. Mostowski, we give a sufficient condition for that to be the case. 相似文献
80.