全文获取类型
收费全文 | 2794篇 |
免费 | 119篇 |
国内免费 | 3篇 |
专业分类
电工技术 | 37篇 |
综合类 | 7篇 |
化学工业 | 513篇 |
金属工艺 | 47篇 |
机械仪表 | 45篇 |
建筑科学 | 94篇 |
矿业工程 | 5篇 |
能源动力 | 71篇 |
轻工业 | 295篇 |
水利工程 | 38篇 |
石油天然气 | 1篇 |
无线电 | 283篇 |
一般工业技术 | 454篇 |
冶金工业 | 672篇 |
原子能技术 | 14篇 |
自动化技术 | 340篇 |
出版年
2023年 | 28篇 |
2022年 | 24篇 |
2021年 | 47篇 |
2020年 | 46篇 |
2019年 | 75篇 |
2018年 | 72篇 |
2017年 | 71篇 |
2016年 | 85篇 |
2015年 | 58篇 |
2014年 | 98篇 |
2013年 | 126篇 |
2012年 | 128篇 |
2011年 | 170篇 |
2010年 | 117篇 |
2009年 | 118篇 |
2008年 | 102篇 |
2007年 | 105篇 |
2006年 | 85篇 |
2005年 | 78篇 |
2004年 | 70篇 |
2003年 | 47篇 |
2002年 | 51篇 |
2001年 | 34篇 |
2000年 | 51篇 |
1999年 | 37篇 |
1998年 | 134篇 |
1997年 | 92篇 |
1996年 | 76篇 |
1995年 | 60篇 |
1994年 | 33篇 |
1993年 | 55篇 |
1992年 | 37篇 |
1991年 | 28篇 |
1990年 | 17篇 |
1989年 | 23篇 |
1988年 | 30篇 |
1987年 | 19篇 |
1986年 | 22篇 |
1985年 | 31篇 |
1984年 | 27篇 |
1983年 | 22篇 |
1982年 | 16篇 |
1980年 | 12篇 |
1979年 | 20篇 |
1978年 | 27篇 |
1977年 | 26篇 |
1976年 | 31篇 |
1974年 | 15篇 |
1969年 | 12篇 |
1964年 | 12篇 |
排序方式: 共有2916条查询结果,搜索用时 10 毫秒
41.
In numerous modern stream ciphers, the internal state consists of a large array of pseudo-random words, while the output key-stream is a relatively simple function of the state. It has been heuristically shown in several situations [3], [8], [9], [10], [11] and [14] that this structure may lead to distinguishing attacks on the cipher. In this note we present a more rigorous treatment of this structural attack. First, we present a rigorous proof of the main probabilistic claim behind it in the basic cases. We then apply it concretely to the cipher sn3 [12], and demonstrate that the heuristic assumptions of the attack are remarkably precise in more complicated cases. 相似文献
42.
Omid?David-TabibiEmail author Moshe?Koppel Nathan?S.?Netanyahu 《Genetic Programming and Evolvable Machines》2011,12(1):5-22
In this paper we demonstrate how genetic algorithms can be used to reverse engineer an evaluation function’s parameters for
computer chess. Our results show that using an appropriate expert (or mentor), we can evolve a program that is on par with
top tournament-playing chess programs, outperforming a two-time World Computer Chess Champion. This performance gain is achieved
by evolving a program that mimics the behavior of a superior expert. The resulting evaluation function of the evolved program
consists of a much smaller number of parameters than the expert’s. The extended experimental results provided in this paper
include a report on our successful participation in the 2008 World Computer Chess Championship. In principle, our expert-driven
approach could be used in a wide range of problems for which appropriate experts are available. 相似文献
43.
44.
Metrics to assess the cost of paths through networks are critical to ensuring the efficiency of network routing. This is particularly true in multi-radio multi-hop wireless networks. Effective metrics for these networks must measure the cost of a wireless path based not only on traditional measures such as throughput, but also on the distribution of wireless channels used. In this paper, we argue that routing metrics over such networks may be viewed as a class of existing shortest path problems, the formal language constrained path problems.On this basis, we describe labeled path problems corresponding to two multi-radio wireless routing metrics: Weighted Cumulative Expected Transmission Time (WCETT), developed by Draves et al., and Metric for Interference and Channel-switch (MIC), developed by Yang et al. For the first, we give a concise proof that calculating shortest WCETT paths is strongly NP-Complete for a variety of graph classes. We also show that the existing heuristic given by Draves et al. is an approximator. For the second, we show that calculating loop-free (simple) shortest MIC paths is NP-Complete, and additionally show that the optimization version of the problem is NPO PB-Complete. This result implies that shortest simple MIC paths are only poorly approximable in the worst case.Furthermore, we demonstrate how the polynomial-time algorithm for shortest MIC paths is derivable from an existing language constrained shortest path algorithm. We use this as a basis to exhibit the general utility of viewing multi-channel wireless routing metrics as labeled graph problems, and discuss how a class of related polynomial-time computable metrics are derivable from this algorithm. 相似文献
45.
Mobility path information of cell phone users play a crucial role in a wide range of cell phone applications, including context based search and advertising, early warning systems, city-wide sensing applications such as air pollution exposure estimation and traffic planning. However, there is a disconnect between the low level location data logs available from the cell phones and the high level mobility path information required to support these cell phone applications. In this paper, we present formal definitions to capture the cell phone users’ mobility patterns and profiles, and provide a complete framework, Mobility Profiler, for discovering mobile cell phone user profiles starting from cell based location data. We use real-world cell phone log data (of over 350 K h of coverage) to demonstrate our framework and perform experiments for discovering frequent mobility patterns and profiles. Our analysis of mobility profiles of cell phone users expose a significant long tail in a user’s location-time distribution: A total of 15% of a cell phone user’s time is spent on average in locations that each appears with less than 1% of total time. 相似文献
46.
The feasibility of general task systems with precedence constraints on multiprocessor platforms 总被引:1,自引:1,他引:0
Feasibility analysis determines (prior to system execution-time) whether a specified collection of hard-real-time jobs executed
on a processing platform can meet all deadlines. In this paper, we derive near-optimal sufficient tests for determining whether
a given collection of jobs can feasibly meet all deadlines upon a specified multiprocessor platform assuming job migration
is permitted. The collection of jobs may contain precedence constraints upon the order of execution of these jobs. The derived
tests are general enough to be applied even when the collection of jobs is incompletely specified. We discuss the applicability
of these tests to the scheduling of collections of jobs that are generated by systems of recurrent real-time tasks. We also
show that our feasibility conditions may be used to obtain global-EDF schedulability conditions.
相似文献
Sanjoy BaruahEmail: |
47.
We introduce Process Overview, a situation awareness characterisation of the knowledge derived from monitoring process plants. Process Overview is based on observational studies of process control work in the literature. The characterisation is applied to develop a query-based measure called the Process Overview Measure. The goal of the measure is to improve coupling between situation and awareness according to process plant properties and operator cognitive work. A companion article presents the empirical evaluation of the Process Overview Measure in a realistic process control setting. The Process Overview Measure demonstrated sensitivity and validity by revealing significant effects of experimental manipulations that corroborated with other empirical results. The measure also demonstrated adequate inter-rater reliability and practicality for measuring SA based on data collected by process experts.
Practitioner Summary: The Process Overview Measure is a query-based measure for assessing operator situation awareness from monitoring process plants in representative settings. 相似文献
48.
Ariel Felner Uzi Zahavi Robert Holte Jonathan Schaeffer Nathan Sturtevant Zhifu Zhang 《Artificial Intelligence》2011,175(9-10):1570-1603
In the field of heuristic search it is usually assumed that admissible heuristics are consistent, implying that consistency is a desirable attribute. The term “inconsistent heuristic” has, at times, been portrayed negatively, as something to be avoided. Part of this is historical: early research discovered that inconsistency can lead to poor performance for A? (nodes might be re-expanded many times). However, the issue has never been fully investigated, and was not re-considered after the invention of IDA?.This paper shows that many of the preconceived notions about inconsistent heuristics are outdated. The worst-case exponential time of inconsistent heuristics is shown to only occur on contrived graphs with edge weights that are exponential in the size of the graph. Furthermore, the paper shows that rather than being something to be avoided, inconsistent heuristics often add a diversity of heuristic values into a search which can lead to a reduction in the number of node expansions. Inconsistent heuristics are easy to create, contrary to the common perception in the AI literature. To demonstrate this, a number of methods for achieving effective inconsistent heuristics are presented.Pathmax is a way of propagating inconsistent heuristic values in the search from parent to children. This technique is generalized into bidirectional pathmax (BPMX) which propagates values from a parent to a child node, and vice versa. BPMX can be integrated into IDA? and A?. When inconsistent heuristics are used with BPMX, experimental results show a large reduction in the search effort required by IDA?. Positive results are also presented for A? searches. 相似文献
49.
Exploring indicators for quantifying surface urban heat islands of European cities with MODIS land surface temperatures 总被引:2,自引:0,他引:2
The term urban heat island describes the phenomenon of altered temperatures in urban areas compared to their rural hinterlands. A surface urban heat island encompasses the patterns of land surface temperatures in urban areas. The classical indicator to describe a surface urban heat island is the difference between urban and rural surface temperatures. However, several other indicators for this purpose have been suggested in the literature. In this study, we compared the eleven different indicators for quantifying surface urban heat islands that were most frequently used in recent publications on remote sensing-based urban heat island assessments. The dataset used here consists of 263 European cities with monthly mean temperatures from MODIS data products for July 2002, January 2003 and July 2003. We found that (i) the indicators individually reveal diurnal and seasonal patterns but show rather low correlations over time, and (ii) for single points in time, the different indicators show only weak correlations, although they are supposed to quantify the same phenomenon. Differentiating cities according to thermal climate zones increased the relationships between the indicators. Thus, we can identify temporal aspects and indicator selection as important factors determining the estimation of urban heat islands. We conclude that research should take into account the differences and instabilities of the indicators chosen for quantifying surface urban heat islands and should use several indicators in parallel for describing the surface urban heat island of a city. 相似文献
50.
Fritz Schwarz 《Computing》2000,65(2):155-167
The largest group of Lie symmetries that a third-order ordinary differential equation (ode) may allow has seven parameters.
Equations sharing this property belong to a single equivalence class with a canonical representative v
′′′(u)=0. Due to this simple canonical form, any equation belonging to this equivalence class may be identified in terms of certain
constraints for its coefficients. Furthermore a set of equations for the transformation functions to canonical form may be
set up for which large classes of solutions may be determined algorithmically. Based on these steps a solution algorithm is described for any equation with this symmetry type which resembles a similar
scheme for second order equations with projective symmetry group.
Received March 9, 2000; revised June 8, 2000 相似文献