全文获取类型
收费全文 | 4658篇 |
免费 | 227篇 |
国内免费 | 9篇 |
专业分类
电工技术 | 58篇 |
综合类 | 3篇 |
化学工业 | 1254篇 |
金属工艺 | 86篇 |
机械仪表 | 109篇 |
建筑科学 | 244篇 |
矿业工程 | 4篇 |
能源动力 | 181篇 |
轻工业 | 722篇 |
水利工程 | 78篇 |
石油天然气 | 48篇 |
无线电 | 333篇 |
一般工业技术 | 619篇 |
冶金工业 | 267篇 |
原子能技术 | 17篇 |
自动化技术 | 871篇 |
出版年
2024年 | 14篇 |
2023年 | 49篇 |
2022年 | 126篇 |
2021年 | 205篇 |
2020年 | 119篇 |
2019年 | 153篇 |
2018年 | 164篇 |
2017年 | 139篇 |
2016年 | 215篇 |
2015年 | 112篇 |
2014年 | 204篇 |
2013年 | 386篇 |
2012年 | 310篇 |
2011年 | 381篇 |
2010年 | 285篇 |
2009年 | 294篇 |
2008年 | 262篇 |
2007年 | 210篇 |
2006年 | 165篇 |
2005年 | 116篇 |
2004年 | 122篇 |
2003年 | 102篇 |
2002年 | 110篇 |
2001年 | 65篇 |
2000年 | 47篇 |
1999年 | 57篇 |
1998年 | 68篇 |
1997年 | 62篇 |
1996年 | 37篇 |
1995年 | 44篇 |
1994年 | 33篇 |
1993年 | 30篇 |
1992年 | 31篇 |
1991年 | 20篇 |
1990年 | 16篇 |
1989年 | 19篇 |
1988年 | 19篇 |
1987年 | 8篇 |
1986年 | 5篇 |
1985年 | 12篇 |
1984年 | 12篇 |
1983年 | 8篇 |
1982年 | 5篇 |
1981年 | 8篇 |
1980年 | 10篇 |
1979年 | 5篇 |
1978年 | 3篇 |
1977年 | 11篇 |
1976年 | 6篇 |
1974年 | 3篇 |
排序方式: 共有4894条查询结果,搜索用时 15 毫秒
51.
52.
53.
James Pita Milind Tambe Fernando Ordóñez Sarit Kraus 《Artificial Intelligence》2010,174(15):1142-1171
How do we build algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human interaction, such as oligopolistic markets and security domains. In Stackelberg games, one player, the leader, commits to a strategy and the follower makes her decision with knowledge of the leader's commitment. Existing algorithms for Stackelberg games efficiently find optimal solutions (leader strategy), but they critically assume that the follower plays optimally. Unfortunately, in many applications, agents face human followers (adversaries) who — because of their bounded rationality and limited observation of the leader strategy — may deviate from their expected optimal response. In other words, human adversaries' decisions are biased due to their bounded rationality and limited observations. Not taking into account these likely deviations when dealing with human adversaries may cause an unacceptable degradation in the leader's reward, particularly in security applications where these algorithms have seen deployment. The objective of this paper therefore is to investigate how to build algorithms for agent interactions with human adversaries.To address this crucial problem, this paper introduces a new mixed-integer linear program (MILP) for Stackelberg games to consider human adversaries, incorporating: (i) novel anchoring theories on human perception of probability distributions and (ii) robustness approaches for MILPs to address human imprecision. Since this new approach considers human adversaries, traditional proofs of correctness or optimality are insufficient; instead, it is necessary to rely on empirical validation. To that end, this paper considers four settings based on real deployed security systems at Los Angeles International Airport (Pita et al., 2008 [35]), and compares 6 different approaches (three based on our new approach and three previous approaches), in 4 different observability conditions, involving 218 human subjects playing 2960 games in total. The final conclusion is that a model which incorporates both the ideas of robustness and anchoring achieves statistically significant higher rewards and also maintains equivalent or faster solution speeds compared to existing approaches. 相似文献
54.
Jose Gonzalez-Mora Fernando De la Torre Nicolas Guil Emilio L. Zapata 《Image and vision computing》2010
Over the last decade 3D face models have been extensively used in many applications such as face recognition, facial animation and facial expression analysis. 3D Morphable Models (MMs) have become a popular tool to build and fit 3D face models to images. Critical to the success of MMs is the ability to build a generic 3D face model. Major limitations in the MMs building process are: (1) collecting 3D data usually involves the use of expensive laser scans and complex capture setups, (2) the number of available 3D databases is limited, and typically there is a lack of expression variability and (3) finding correspondences and registering the 3D model is a labor intensive and error prone process. 相似文献
55.
Graph constraints were introduced in the area of graph transformation, in connection with the notion of (negative) application conditions, as a form to limit the applicability of transformation rules. However, we believe that graph constraints may also play a significant role in the area of visual software modelling or in the specification and verification of semi-structured documents or websites (i.e. HTML or XML sets of documents). In this sense, after some discussion on these application areas, we concentrate on the problem of how to prove the consistency of specifications based on this kind of constraints. In particular, we present proof rules for two classes of graph constraints and show that our proof rules are sound and (refutationally) complete for each class. In addition, we study clause subsumption in this context as a form to speed up refutation. 相似文献
56.
Rafael Marín-LópezAuthor Vitae Fernando Pereñíguez Author VitaeGabriel López Author Vitae Alejandro Pérez-Méndez Author Vitae 《Computer Standards & Interfaces》2011,33(5):494-504
Kerberos is a well-known standard protocol which is becoming one of the most widely deployed for authentication and key distribution in application services. However, whereas service providers use the protocol to control their own subscribers, they do not widely deploy Kerberos infrastructures to handle subscribers coming from foreign domains, as happens in network federations. Instead, the deployment of Authentication, Authorization and Accounting (AAA) infrastructures has been preferred for that operation. Thus, the lack of a correct integration between these infrastructures and Kerberos limits the service access only to service provider's subscribers. To avoid this limitation, we design an architecture which integrates a Kerberos pre-authentication mechanism, based on the use of the Extensible Authentication Protocol (EAP), and advanced authorization, based on the standards SAML and XACML, to link the end user authentication and authorization performed through an AAA infrastructure with the delivery of Kerberos tickets in the service provider's domain. We detail the interfaces, protocols, operation and extensions required for our solution. Moreover, we discuss important aspects such as the implications on existing standards. 相似文献
57.
We present new GPU-based techniques for implementing linear digital filters for real-time audio processing. Our solution for recursive filters is the first presented in the literature. We demonstrate the relevance of these algorithms to computer graphics by synthesizing realistic sounds of colliding objects made of different materials, such as glass, plastic, and wood, in real time. The synthesized sounds can be parameterized by the object materials, velocities, and collision angles. Despite its flexibility, our approach uses very little memory, since it essentially requires a set of coefficients representing the impulse response of each material sound. Such features make our approach an attractive alternative to traditional CPU-based techniques that use playback of pre-recorded sounds. 相似文献
58.
Carlos A. Jara Francisco A. Candelas Fernando Torres Sebastian Dormido Francisco Esquembre Oscar Reinoso 《Computers & Education》2009
Web-based learning environments are becoming increasingly popular in higher education. One of the most important web-learning resources is the virtual laboratory (VL), which gives students an easy way for training and learning through the Internet. Moreover, on-line collaborative communication represents a practical method to transmit the knowledge and experience from the teacher to students overcoming physical distance and isolation. Considering these facts, the authors of this document have developed a new dynamic collaborative e-learning system which combines the main advantages of virtual laboratories and collaborative learning practices. In this system, the virtual laboratories are based on Java applets which have embedded simulations developed in Easy Java Simulations (EJS), an open-source tool for teachers who do not need complex programming skills. The collaborative e-learning is based on a real-time synchronized communication among these Java applets. Therefore, this original approach provides a new tool which integrates virtual laboratories inside a synchronous collaborative e-learning framework. This paper describes the main features of this system and its successful application in a distance education environment among different universities from Spain. 相似文献
59.
This paper is concerned with the problem of assessing the stability of linear systems with a single time-delay. Stability analysis of linear systems with time-delays is complicated by the need to locate the roots of a transcendental characteristic equation. In this paper we show that a linear system with a single time-delay is stable independent of delay if and only if a certain rational function parameterized by an integer k and a positive real number T has only stable roots for any finite T≥0 and any k≥2. We then show how this stability result can be further simplified by analyzing the roots of an associated polynomial parameterized by a real number δ in the open interval (0,1). The paper is closed by showing counterexamples where stability of the roots of the rational function when k=1 is not sufficient for stability of the associated linear system with time-delay. We also introduce a variation of an existing frequency-sweeping necessary and sufficient condition for stability independent of delay which resembles the form of a generalized Nyquist criterion. The results are illustrated by numerical examples. 相似文献
60.
BAIS: A Bayesian Artificial Immune System for the effective handling of building blocks 总被引:1,自引:0,他引:1
Significant progress has been made in theory and design of Artificial Immune Systems (AISs) for solving hard problems accurately. However, an aspect not yet widely addressed by the research reported in the literature is the lack of ability of the AISs to deal effectively with building blocks (partial high-quality solutions coded in the antibody). The available AISs present mechanisms for evolving the population that do not take into account the relationship among the variables of the problem, potentially causing the disruption of high-quality partial solutions. This paper proposes a novel AIS with abilities to identify and properly manipulate building blocks in optimization problems. Instead of using cloning and mutation to generate new individuals, our algorithm builds a probabilistic model representing the joint probability distribution of the promising solutions and, subsequently, uses this model for sampling new solutions. The probabilistic model used is a Bayesian network due to its capability of properly capturing the most relevant interactions among the variables. Therefore, our algorithm, called Bayesian Artificial Immune System (BAIS), represents a significant attempt to improve the performance of immune-inspired algorithms when dealing with building blocks, and hence to solve efficiently hard optimization problems with complex interactions among the variables. The performance of BAIS compares favorably with that produced by contenders such as state-of-the-art Estimation of Distribution Algorithms. 相似文献