全文获取类型
收费全文 | 3999篇 |
免费 | 238篇 |
国内免费 | 9篇 |
专业分类
电工技术 | 55篇 |
综合类 | 2篇 |
化学工业 | 1118篇 |
金属工艺 | 59篇 |
机械仪表 | 98篇 |
建筑科学 | 198篇 |
矿业工程 | 3篇 |
能源动力 | 159篇 |
轻工业 | 594篇 |
水利工程 | 43篇 |
石油天然气 | 44篇 |
无线电 | 287篇 |
一般工业技术 | 557篇 |
冶金工业 | 195篇 |
原子能技术 | 14篇 |
自动化技术 | 820篇 |
出版年
2024年 | 11篇 |
2023年 | 46篇 |
2022年 | 119篇 |
2021年 | 176篇 |
2020年 | 107篇 |
2019年 | 141篇 |
2018年 | 150篇 |
2017年 | 123篇 |
2016年 | 199篇 |
2015年 | 102篇 |
2014年 | 176篇 |
2013年 | 337篇 |
2012年 | 267篇 |
2011年 | 332篇 |
2010年 | 243篇 |
2009年 | 256篇 |
2008年 | 228篇 |
2007年 | 180篇 |
2006年 | 130篇 |
2005年 | 100篇 |
2004年 | 107篇 |
2003年 | 77篇 |
2002年 | 84篇 |
2001年 | 51篇 |
2000年 | 37篇 |
1999年 | 48篇 |
1998年 | 57篇 |
1997年 | 54篇 |
1996年 | 37篇 |
1995年 | 33篇 |
1994年 | 28篇 |
1993年 | 23篇 |
1992年 | 27篇 |
1991年 | 17篇 |
1990年 | 16篇 |
1989年 | 16篇 |
1988年 | 18篇 |
1987年 | 8篇 |
1986年 | 5篇 |
1985年 | 9篇 |
1984年 | 10篇 |
1983年 | 8篇 |
1981年 | 8篇 |
1980年 | 7篇 |
1979年 | 3篇 |
1978年 | 3篇 |
1977年 | 6篇 |
1976年 | 6篇 |
1969年 | 3篇 |
1966年 | 5篇 |
排序方式: 共有4246条查询结果,搜索用时 15 毫秒
71.
72.
73.
Fernando Maccari Tarini Prasad Mishra Monica Keszler Tobias Braun Esmaeil Adabifiroozjaei Iliya Radulov Tianshu Jiang Enrico Bruder Olivier Guillon Leopoldo Molina-Luna Martin Bram Oliver Gutfleisch 《Advanced Engineering Materials》2023,25(18):2300252
Flash spark plasma sintering (flash SPS) is an attractive method to obtain Nd–Fe–B magnets with anisotropic magnetic properties when starting from melt-spun powders. Compared to the benchmark processing route via hot pressing with subsequent die upsetting, flash SPS promises electroplasticity as an additional deformation mechanism and reduced tool wear, while maximizing magnetic properties by tailoring the microstructure—fully dense and high texture. A detailed parameter study is conducted to understand the influence of Flash SPS parameters on the densification and magnetic properties of commercial MQU-F powder. It is revealed that the presintering conditions and preheating temperature before applying the power pulse play a major role for tailoring grain size and texture in the case of hot deformation via Flash SPS. Detailed microstructure and magnetic domain evaluation disclose the texture enhancement with increasing flash SPS temperature at the expense of coercivity. The best compromise between remanence and coercivity (1.37 T and 1195 kA m−1, respectively) is achieved through a combination of presintering at 500 °C for 120 s and preheating temperature of 600 °C, resulting in a magnet with energy product (BH)max of 350 kJm−3. These findings show the potential of flash SPS to obtain fully dense anisotropic nanocrystalline magnets with high magnetic performance. 相似文献
74.
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. 相似文献
75.
This paper proposes a new Lyapunov–Krasovskii functional to cope with stability analysis and control design for time‐delay nonlinear systems modeled in the Takagi–Sugeno (TS) fuzzy form. The delay‐dependent conditions are formulated as linear matrix inequalities (LMIs), solvable through several numerical tools. By using the Gu's discretization technique and by employing an appropriated fuzzy functional, less conservative conditions are obtained. Numerical results illustrate the efficiency of the proposed methods. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
76.
This article focusses on the fusion of information from various automotive sensors like radar, video, and lidar for enhanced safety and traffic efficiency. Fusion is not restricted to data from sensors onboard the same vehicle but vehicular communication systems allow to propagate and fuse information with sensor data from other vehicles or from the road infrastructure as well. This enables vehicles to perceive information from regions that are hardly accessible otherwise and represents the basis for cooperative driving maneuvers. While the Bayesian framework builds the basis for information fusion, automobile environments are characterized by their a priori unknown topology, i.e., the number, type, and structure of the perceived objects is highly variable. Multi-object detection and tracking methods are a first step to cope with this challenge. Obviously, the existence or non-existence of an object is of paramount importance for safe driving. Such decisions are highly influenced by the association step that assigns sensor measurements to object tracks. Methods that involve multiple sequences of binary assignments are compared with soft-assignment strategies. Finally, fusion based on finite set statistics that (theoretically) avoid an explicit association are discussed. 相似文献
77.
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. 相似文献
78.
A new way of devising numerical methods is introduced whose distinctive feature is the computation of a finite element approximation
only in a polyhedral subdomain
D{\mathsf{D}}
of the original, possibly curved-boundary domain. The technique is applied to a discontinuous Galerkin method for the one-dimensional
diffusion-reaction problem. Sharp a priori error estimates are obtained which identify conditions, on the subdomain
D{\mathsf{D}}
and the discretization parameters of the discontinuous Galerkin method, under which the method maintains its original optimal
convergence properties. The error analysis is new even in the case in which
D=W{\mathsf{D}}=\Omega
. It allows to see that the uniform error at any given interval is bounded by an interpolation error associated to the interval
plus a significantly smaller error of a global nature. Numerical results confirming the sharpness of the theoretical results
are displayed. Also, preliminary numerical results illustrating the application of the method to two-dimensional second-order
elliptic problems are shown. 相似文献
79.
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. 相似文献
80.
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. 相似文献