首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   4705篇
  免费   286篇
  国内免费   11篇
电工技术   31篇
综合类   5篇
化学工业   993篇
金属工艺   96篇
机械仪表   99篇
建筑科学   237篇
矿业工程   8篇
能源动力   150篇
轻工业   455篇
水利工程   47篇
石油天然气   18篇
武器工业   2篇
无线电   414篇
一般工业技术   878篇
冶金工业   808篇
原子能技术   28篇
自动化技术   733篇
  2024年   4篇
  2023年   40篇
  2022年   68篇
  2021年   133篇
  2020年   94篇
  2019年   110篇
  2018年   141篇
  2017年   126篇
  2016年   157篇
  2015年   118篇
  2014年   158篇
  2013年   273篇
  2012年   274篇
  2011年   338篇
  2010年   239篇
  2009年   263篇
  2008年   297篇
  2007年   282篇
  2006年   228篇
  2005年   238篇
  2004年   170篇
  2003年   147篇
  2002年   151篇
  2001年   75篇
  2000年   64篇
  1999年   57篇
  1998年   58篇
  1997年   57篇
  1996年   66篇
  1995年   48篇
  1994年   47篇
  1993年   50篇
  1992年   37篇
  1991年   26篇
  1990年   38篇
  1989年   38篇
  1988年   31篇
  1987年   41篇
  1986年   38篇
  1985年   32篇
  1984年   25篇
  1983年   27篇
  1982年   25篇
  1981年   13篇
  1980年   12篇
  1979年   9篇
  1978年   13篇
  1976年   6篇
  1975年   6篇
  1974年   4篇
排序方式: 共有5002条查询结果,搜索用时 343 毫秒
111.
This article provides an overview of, and thematic justification for, the special issue of the journal of Artificial Intelligence and Law entitled “E-Discovery”. In attempting to define a characteristic “AI & Law” approach to e-discovery, and since a central theme of AI & Law involves computationally modeling legal knowledge, reasoning and decision making, we focus on the theme of representing and reasoning with litigators’ theories or hypotheses about document relevance through a variety of techniques including machine learning. We also identify two emerging techniques for enabling users’ document queries to better express the theories of relevance and connect them to documents: social network analysis and a hypothesis ontology.  相似文献   
112.
Seven flying robot “fairies” joined human actors in the Texas A&;M production of William Shakespeare’s A Midsummer Night’s Dream. The production was a collaboration between the departments of Computer Science and Engineering, Electrical and Computer Engineering, and Theater Arts. The collaboration was motivated by two assertions. First, that the performing arts have principles for creating believable agents that will transfer to robots. Second, the theater is a natural testbed for evaluating the response of untrained human groups (both actors and the audience) to robots interacting with humans in shared spaces, i.e., were believable agents created? The production used two types of unmanned aerial vehicles, an AirRobot 100-b quadrotor platform about the size of a large pizza pan, and six E-flite Blade MCX palm-sized toy helicopters. The robots were used as alter egos for fairies in the play; the robots did not replace any actors, instead they were paired with them. The insertion of robots into the production was not widely advertised so the audience was the typical theatergoing demographic, not one consisting of people solely interested technology. The use of radio-controlled unmanned aerial vehicles provides insights into what types of autonomy are needed to create appropriate affective interactions with untrained human groups. The observations from the four weeks of practice and eight performances contribute (1) a taxonomy and methods for creating affect exchanges between robots and untrained human groups, (2) the importance of improvisation within robot theater, (3) insights into how untrained human groups form expectations about robots, and (4) awareness of the importance of safety and reliability as a design constraint for public engagement with robot platforms. The taxonomy captures that apparent affect can be created without explicit affective behaviors by the robot, but requires talented actors to convey the situation or express reactions. The audience’s response to robot crashes was a function of whether they had the opportunity to observe how the actors reacted to robot crashes on stage, suggesting that pre-existing expectations must be taken into account in the design of autonomy. Furthermore, it appears that the public expect robots to be more reliable (an expectation of consumer product hardening) and safe (an expectation from product liability) than the current capabilities and this may be a major challenge or even legal barrier for introducing robots into shared public spaces. These contributions are expected to inform design strategies for increasing public engagement with robot platforms through affect, and shows the value of arts-based approaches to public encounters with robots both for generating design strategies and for evaluation.  相似文献   
113.
We conducted a preliminary investigation of the response of ERS C-band SAR backscatter to variations in soil moisture and surface inundation in wetlands of interior Alaska. Data were collected from 5 wetlands over a three-week period in 2007. Results showed a positive correlation between backscatter and soil moisture in sites dominated by herbaceous vegetation cover (r = 0.74, p < 0.04). ERS SAR backscatter was negatively correlated to water depth in all open (non-forested) wetlands when water table levels were more than 6 cm above the wetland surface (r = − 0.82, p < 0.001). There was no relationship between backscatter and soil moisture in the forested (black spruce-dominated) wetland site. Our preliminary results show that ERS SAR data can be used to monitor variations in hydrologic conditions in high northern latitude wetlands (including peatlands), particularly sites with sparse tree cover.  相似文献   
114.
Though the network quality-of-service (QoS) metrics are defined in terms of technical parameters (e.g., delay, jitter, bandwidth), they are rather subjective when it comes to the end user. Oftentimes, the end user finds it difficult to express his desired QoS in such technical parameters, though he has a fair idea of what QoS he desires. In this paper, we show how translation functions can be devised and used to translate the user inputs to networking parameters that are used by various layers of the protocol stack. In particular, we consider an ad hoc network and show an interface design that uses translation functions to map user supplied inputs to parameters at the medium access control (MAC) and routing layers. These parameters, in turn, choose the right strategies that particular layer functionality can adopt, such that the QoS desired by the user is achieved. We also compute the associated costs due to the different strategies adopted. We implement the interface on ns-2 and conduct simulation experiments with randomly scattered IEEE 802.11 enabled nodes. Results show the functionality of the interface and demonstrate how delay, throughput, and network lifetime are affected when the end user seeks different levels of QoS.  相似文献   
115.
The DTN architecture is based around sender-initiated unicast communication that is insufficient or inconvenient to meet the needs of many applications. To address these limitations, we define a DTN session layer and associated extensions to the DTN bundle protocol that more naturally support receiver-driven applications and multicast communication. Within a session, we provide mechanisms allowing applications to convey ordering relationships between successive transmissions that can be used by the network to help ensure a distributed application’s delivery ordering expectations are met. We also extend the bundle protocol’s expiration procedures to support more efficient network utilization by allowing in-network deletion of obsolete messages. We present the design rationale and describe our implementation of these mechanisms and discuss their advantages in meeting the needs of several popular types of applications.  相似文献   
116.
Aspect-oriented programming (AOP) seeks to improve software modularity via the separation of cross-cutting concerns. AOP proponents often advocate a development strategy where programmers write the main application (base code), ignoring cross-cutting concerns, and then aspect programmers, domain experts in their specific concerns, weave in the logic for these more specialized cross-cutting concerns. This purely oblivious strategy, however, has empirically been shown to tightly couple aspects to base code in many cases, hindering aspect modularity and reuse. In essence, the more intricate the weaving between the cross-cutting concern and the base code (lexically and/or semantically), the harder it becomes to: (a) robustly specify how to weave the aspects in at the required points, (b) capture interactions between aspects and base code, and (c) preserve the correct weaving as the base code evolves.We propose an alternate methodology, termed cooperative aspect-oriented programming (Co-AOP), where complete lexical separation of concerns is not taken as an absolute requirement. Instead, cross-cutting concerns are explicitly modeled as abstract interfaces through explicit join points (EJPs). Programmers specify where these interfaces interact with base code either through explicit lexical references or via traditional oblivious aspects. This explicit awareness allows base code and aspects to cooperate in ways that were previously not possible: arbitrary blocks of code can be advised, advice can be explicitly parameterized, base code can guide aspects in where to apply advice, and aspects can statically enforce new constraints upon the base code that they advise. These new techniques allow aspect modularity and program safety to increase, and bring us towards a cooperative AOP paradigm.We illustrate our methodology via an example on transactions, and also give an initial evaluation of cooperative AOP through an empirical study on program extensibility comparing both the traditional and cooperative AOP methodologies. Initial results show that cooperative AOP techniques result in code that is less complex with lower overall coupling, facilitating extensibility.  相似文献   
117.
We propose a technique for defeating signature-based malware detectors by exploiting information disclosed by antivirus interfaces. This information is leveraged to reverse engineer relevant details of the detector's underlying signature database, revealing binary obfuscations that suffice to conceal malware from the detector. Experiments with real malware and antivirus interfaces on Windows operating systems justify the effectiveness of our approach.  相似文献   
118.
The conductance of several tin oxide gas sensitive layers was simultaneously measured in thermo-cyclic and isothermal operation mode at various concentrations of CO and propene in air, respectively. Different measurement conditions were set by the cycle time, the gas flow rate, the humidity and the thickness of the sensitive layer. The sensor response is expressed by the conductance-over-time profiles (CTPs), the gas sensitivity or by the sum of the CTP sampling points. The resultant sensitivities from the CTPs were found to be higher than those of the isothermal measurements. The CTPs considerably change with the kind of gas as well as with the variation of the measurement conditions. This is discussed for both types of target gases with respect to the temperature, the adsorbates assumed and the reaction kinetics in relation to the gas transport conditions in the porous gas sensitive layer.  相似文献   
119.
120.
Detecting communities is of great importance in social network analysis. However it is an issue that has not yet been satisfactorily solved, despite the efforts made by interdisciplinary research communities over the past few years, because of the nature of complexity in deciding how community structures should be recognized. In this paper we propose an approach based on cooperative game theory for community detection in social networks. We regard individuals as players, and regard communities as coalitions formed by players, and model community detection problem as the formation and optimization of coalitions. Furthermore, we define coalition profile for players to indicate coalitions that players joined, the order of a coalition profile is defined as the number of coalitions in a coalition profile, and we introduce a utility function to measure preference of coalition profiles. Accordingly, we propose an algorithm to detect a coalition profile with maximal utility function values. We have implemented the algorithms developed in this study and experimental results demonstrate the effectiveness of our approaches.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号