全文获取类型
收费全文 | 4691篇 |
免费 | 123篇 |
国内免费 | 43篇 |
专业分类
电工技术 | 162篇 |
综合类 | 39篇 |
化学工业 | 1104篇 |
金属工艺 | 90篇 |
机械仪表 | 177篇 |
建筑科学 | 130篇 |
矿业工程 | 23篇 |
能源动力 | 151篇 |
轻工业 | 400篇 |
水利工程 | 28篇 |
石油天然气 | 13篇 |
武器工业 | 2篇 |
无线电 | 451篇 |
一般工业技术 | 633篇 |
冶金工业 | 740篇 |
原子能技术 | 101篇 |
自动化技术 | 613篇 |
出版年
2023年 | 15篇 |
2022年 | 67篇 |
2021年 | 96篇 |
2020年 | 38篇 |
2019年 | 67篇 |
2018年 | 83篇 |
2017年 | 62篇 |
2016年 | 78篇 |
2015年 | 80篇 |
2014年 | 115篇 |
2013年 | 255篇 |
2012年 | 188篇 |
2011年 | 271篇 |
2010年 | 234篇 |
2009年 | 272篇 |
2008年 | 273篇 |
2007年 | 224篇 |
2006年 | 183篇 |
2005年 | 205篇 |
2004年 | 134篇 |
2003年 | 151篇 |
2002年 | 149篇 |
2001年 | 107篇 |
2000年 | 83篇 |
1999年 | 91篇 |
1998年 | 240篇 |
1997年 | 160篇 |
1996年 | 135篇 |
1995年 | 96篇 |
1994年 | 72篇 |
1993年 | 91篇 |
1992年 | 50篇 |
1991年 | 27篇 |
1990年 | 36篇 |
1989年 | 40篇 |
1988年 | 34篇 |
1987年 | 31篇 |
1986年 | 27篇 |
1985年 | 38篇 |
1984年 | 31篇 |
1983年 | 34篇 |
1982年 | 20篇 |
1981年 | 28篇 |
1980年 | 26篇 |
1979年 | 10篇 |
1978年 | 11篇 |
1977年 | 24篇 |
1976年 | 26篇 |
1974年 | 10篇 |
1973年 | 8篇 |
排序方式: 共有4857条查询结果,搜索用时 0 毫秒
71.
Len Seligman Paul Lehner Ken Smith Chris Elsaesser David Mattox 《Journal of Intelligent Information Systems》2000,14(1):29-50
We are interested in information management for decision support applications, especially those that monitor distributed, heterogeneous databases to assess time-critical decisions. Users of such applications can easily be overwhelmed with data that may change rapidly, may conflict, and may be redundant. Developers are faced with a dilemma: either filter out most information and risk excluding critical items, or gather possibly irrelevant or redundant information, and overwhelm the decision maker. This paper describes a solution to this dilemma called decision-centric information monitoring (DCIM). First, we observe that decision support systems should monitor only information that can potentially change some decision. We present an architecture for DCIM that meets the requirements implied by this observation. We describe techniques for identifying the highest value information to monitor and techniques for monitoring that information despite autonomy, distribution, and heterogeneity of data sources. Finally, we present lessons learned from building LOOKOUT, which is to our knowledge the first implementation of a top-to-bottom system performing decision-centric information monitoring. 相似文献
72.
Replica Placement Strategies in Data Grid 总被引:1,自引:0,他引:1
Replication is a technique used in Data Grid environments that helps to reduce access latency and network bandwidth utilization.
Replication also increases data availability thereby enhancing system reliability. The research addresses the problem of replication
in Data Grid environment by investigating a set of highly decentralized dynamic replica placement algorithms. Replica placement
algorithms are based on heuristics that consider both network latency and user requests to select the best candidate sites
to place replicas. Due to dynamic nature of Grid, the candidate site holds replicas currently may not be the best sites to
fetch replicas in subsequent periods. Therefore, a replica maintenance algorithm is proposed to relocate replicas to different
sites if the performance metric degrades significantly. The study of our replica placement algorithms is carried out using
a model of the EU Data Grid Testbed 1 [Bell et al. Comput. Appl., 17(4), 2003] sites and their associated network geometry. We validate our replica placement
algorithms with total file transfer times, the number of local file accesses, and the number of remote file accesses. 相似文献
73.
Evans WJ Yoo CS Lee GW Cynn H Lipp MJ Visbeck K 《The Review of scientific instruments》2007,78(7):073904
We have developed a unique device, a dynamic diamond anvil cell (dDAC), which repetitively applies a time-dependent load/pressure profile to a sample. This capability allows studies of the kinetics of phase transitions and metastable phases at compression (strain) rates of up to 500 GPa/s (approximately 0.16 s(-1) for a metal). Our approach adapts electromechanical piezoelectric actuators to a conventional diamond anvil cell design, which enables precise specification and control of a time-dependent applied load/pressure. Existing DAC instrumentation and experimental techniques are easily adapted to the dDAC to measure the properties of a sample under the varying load/pressure conditions. This capability addresses the sparsely studied regime of dynamic phenomena between static research (diamond anvil cells and large volume presses) and dynamic shock-driven experiments (gas guns, explosive, and laser shock). We present an overview of a variety of experimental measurements that can be made with this device. 相似文献
74.
Ken Maynard Patrick Moss Marcus Whitehead S. Narayanan Matt Garay Nathan Brannon Raj Gopal Kantamneni & Todd Kustra 《Expert Systems》2001,18(2):88-98
Although developments on software agents have led to useful applications in automation of routine tasks such as electronic mail filtering, there is a scarcity of research that empirically evaluates the performance of a software agent versus that of a human reasoner, whose problem-solving capabilities the agent embodies. In the context of a game of a chance, namely Yahtzee©, we identified strategies deployed by expert human reasoners and developed a decision tree for agent development. This paper describes the computer implementation of the Yahtzee game as well as the software agent. It also presents a comparison of the performance of humans versus an automated agent. Results indicate that, in this context, the software agent embodies human expertise at a high level of fidelity. 相似文献
75.
Biddiscombe J Geveci B Martin K Moreland K Thompson D 《IEEE transactions on visualization and computer graphics》2007,13(6):1376-1383
Pipeline architectures provide a versatile and efficient mechanism for constructing visualizations, and they have been implemented in numerous libraries and applications over the past two decades. In addition to allowing developers and users to freely combine algorithms, visualization pipelines have proven to work well when streaming data and scale well on parallel distributed-memory computers. However, current pipeline visualization frameworks have a critical flaw: they are unable to manage time varying data. As data flows through the pipeline, each algorithm has access to only a single snapshot in time of the data. This prevents the implementation of algorithms that do any temporal processing such as particle tracing; plotting over time; or interpolation, fitting, or smoothing of time series data. As data acquisition technology improves, as simulation time-integration techniques become more complex, and as simulations save less frequently and regularly, the ability to analyze the time-behavior of data becomes more important. This paper describes a modification to the traditional pipeline architecture that allows it to accommodate temporal algorithms. Furthermore, the architecture allows temporal algorithms to be used in conjunction with algorithms expecting a single time snapshot, thus simplifying software design and allowing adoption into existing pipeline frameworks. Our architecture also continues to work well in parallel distributed-memory environments. We demonstrate our architecture by modifying the popular VTK framework and exposing the functionality to the ParaView application. We use this framework to apply time-dependent algorithms on large data with a parallel cluster computer and thereby exercise a functionality that previously did not exist. 相似文献
76.
OBJECTIVE: This study examined the way in which the type and preexisting strength of association between an auditory icon and a warning event affects the ease with which the icon/event pairing can be learned and retained. BACKGROUND: To be effective, an auditory warning must be audible, identifiable, interpretable, and heeded. Warnings consisting of familiar environmental sounds, or auditory icons, have potential to facilitate identification and interpretation. The ease with which pairings between auditory icons and warning events can be learned and retained is likely to depend on the type and strength of the preexisting icon/event association. METHOD: Sixty-three participants each learned eight auditory-icon/denotative-referent pairings and attempted to recall them 4 weeks later. Three icon/denotative-referent association types (direct, related, and unrelated) were employed. Participants rated the strength of the association for each pairing on a 7-point scale. RESULTS: The number of errors made while learning pairings was greater for unrelated than for either related or direct associations, whereas the number of errors made while attempting to recall pairings 4 weeks later was greater for unrelated than for related associations and for related than for direct associations. Irrespective of association type, both learning and retention performance remained at very high levels, provided the strength of the association was rated greater than 5. CONCLUSION: This suggests that strong preexisting associations are used to facilitate learning and retention of icon/denotative-referent pairings. APPLICATION: The practical implication of this study is that auditory icons having either direct or strong, indirect associations with warning events should be preferred. 相似文献
77.
An ion interacting with quasiparticles in liquid3He is treated theoretically by summing most divergent terms in perturbation series of the self-energy of the ion and the vertex part. The ion Green's function is renormalized by a factorZ(T), and the vertex part byZ(T) ?1, where \({\text{Z(T)}} = {\text{(T/T}}_F {\text{)}}^{{\text{2V}}_{{\text{0}}^{\rho ^{\text{2}} } }^{\text{2}} } \) , forT 0?T?T F. Here,T 0=(m/M)T F, withm the3He mass andM the ion mass, and \({\text{V}}_{0^\rho } \) is the strength of the interaction. The factor explains the weak temperature dependence of the mobility around the minimum atT 0; we also discuss its effect on the behavior of the mobility in3He-B nearT c. 相似文献
78.
Volunteer computing uses the free resources in Internet and Intranet environments for large-scale computation and storage. Currently, 70 applications use over 12 PetaFLOPS of computing power from such platforms. However, these platforms are currently limited to embarrassingly parallel applications. In an effort to broaden the set of applications that can leverage volunteer computing, we focus on the problem of predicting if a group of resources will be continuously available for a relatively long time period. Ensuring the collective availability of volunteer resources is challenging due to their inherent volatility and autonomy. Collective availability is important for enabling parallel applications and workflows on volunteer computing platforms. We evaluate our predictive methods using real availability traces gathered from hundreds of thousands of hosts from the SETI@home volunteer computing project. We show our prediction methods can guarantee reliably the availability of collections of volunteer resources. We show that this is particularly useful for service deployments over volunteer computing environments. 相似文献
79.
基于平面模板的机器人TCF标定 总被引:1,自引:0,他引:1
针对末端夹持激光位移传感器的机器人TCF(tool/terminal control frame)标定,提出一种基于平面模板的标定方法,机器人操作末端执行器使激光位移传感器在不同位形下对平面模板进行测量,再通过非线性最小二乘拟合求解标定参数.为了减小问题的奇异性,对标定时应该采取的参数控制策略进行了定性分析.该标定方法只需要一块表面精度较高的平面模板,而无需其它测量仪器,标定过程简单、易操作,且易于实现自动化.仿真和实验结果表明本文提出的标定方法具有较高的精度. 相似文献
80.
Lattice and grain-boundary interdiffusion coefficients were calculated from the concentration distributions determined for Zr-Hf interdiffusion in polycrystalline 16Y2O3·84(Zr1–x
Hf
x
)O2 withx=0.020 and 0.100. The lattice interdiffusion coefficients were described byD=0.031 exp [–391 (kJ mol–1)/RT] cm2 sec–1 and the grain-boundary diffusion parameters byD=1.5×10–6exp [–309(kJ mol–1)/RT] cm3 sec–1 in the temperature range 1584–2116° C. Comparison of the results with those for the systems CaO-(Zr+Hf)O2 and MgO-(Zr+Hf)O2 indicated that the Zr self-diffusion coefficient was insensitive to the dopants in the fluorite-cubic ZrO2 solid solutions. 相似文献