全文获取类型
收费全文 | 84530篇 |
免费 | 968篇 |
国内免费 | 411篇 |
专业分类
电工技术 | 775篇 |
综合类 | 2316篇 |
化学工业 | 11707篇 |
金属工艺 | 4841篇 |
机械仪表 | 3052篇 |
建筑科学 | 2210篇 |
矿业工程 | 563篇 |
能源动力 | 1131篇 |
轻工业 | 3684篇 |
水利工程 | 1267篇 |
石油天然气 | 342篇 |
武器工业 | 1篇 |
无线电 | 9257篇 |
一般工业技术 | 16430篇 |
冶金工业 | 2674篇 |
原子能技术 | 266篇 |
自动化技术 | 25393篇 |
出版年
2022年 | 29篇 |
2021年 | 45篇 |
2020年 | 17篇 |
2018年 | 14464篇 |
2017年 | 13384篇 |
2016年 | 9982篇 |
2015年 | 622篇 |
2014年 | 246篇 |
2013年 | 239篇 |
2012年 | 3158篇 |
2011年 | 9437篇 |
2010年 | 8311篇 |
2009年 | 5583篇 |
2008年 | 6812篇 |
2007年 | 7800篇 |
2006年 | 150篇 |
2005年 | 1240篇 |
2004年 | 1162篇 |
2003年 | 1186篇 |
2002年 | 554篇 |
2001年 | 110篇 |
2000年 | 184篇 |
1999年 | 71篇 |
1998年 | 62篇 |
1997年 | 33篇 |
1996年 | 53篇 |
1995年 | 22篇 |
1994年 | 25篇 |
1993年 | 24篇 |
1992年 | 23篇 |
1991年 | 29篇 |
1988年 | 25篇 |
1986年 | 19篇 |
1984年 | 19篇 |
1979年 | 19篇 |
1969年 | 26篇 |
1968年 | 43篇 |
1967年 | 34篇 |
1966年 | 44篇 |
1965年 | 44篇 |
1963年 | 29篇 |
1962年 | 22篇 |
1961年 | 18篇 |
1960年 | 30篇 |
1959年 | 36篇 |
1958年 | 38篇 |
1957年 | 36篇 |
1956年 | 35篇 |
1955年 | 63篇 |
1954年 | 68篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
Piotr Zieliński 《Distributed Computing》2008,20(6):435-450
The Atomic Broadcast algorithm described in this paper can deliver messages in two communication steps, even if multiple processes
broadcast at the same time. It tags all broadcast messages with the local real time, and delivers all messages in the order
of these timestamps. Both positive and negative statements are used: “m broadcast at time 51” vs. “no messages broadcast between times 31 and 51”. To prevent crashed processes from blocking the
system, the -elected leader broadcasts negative statements on behalf of the processes it suspects () to have crashed. A new cheap Generic Broadcast algorithm is used to ensure consistency between conflicting statements. It
requires only a majority of correct processes (n > 2f) and, in failure-free runs, delivers all non-conflicting messages in two steps. The main algorithm satisfies several new
lower bounds, which are proved in this paper. 相似文献
992.
This paper presents an efficient scheme maintaining a separator decomposition representation in dynamic trees using asymptotically optimal labels. In order to maintain the short labels, the scheme uses relatively low
message complexity. In particular, if the initial dynamic tree contains only the root, then the scheme incurs an O(log4
n) amortized message complexity per topology change, where n is the current number of vertices in the tree. As a separator decomposition is a fundamental decomposition of trees used
extensively as a component in many static graph algorithms, our dynamic scheme for separator decomposition may be used for
constructing dynamic versions to these algorithms. The paper then shows how to use our dynamic separator decomposition to
construct efficient labeling schemes on dynamic trees, using the same message complexity as our dynamic separator scheme.
Specifically, we construct efficient routing schemes on dynamic trees, for both the designer and the adversary port models,
which maintain optimal labels, up to a multiplicative factor of O(log log n). In addition, it is shown how to use our dynamic separator decomposition scheme to construct dynamic labeling schemes supporting
the ancestry and NCA relations using asymptotically optimal labels, as well as to extend a known result on dynamic distance
labeling schemes.
Supported in part at the Technion by an Aly Kaufman fellowship.
Supported in part by a grant from the Israel Science Foundation. 相似文献
993.
André Stork Clemens-August Thole Stanislav Klimenko Igor Nikitin Lialia Nikitina Yuri Astakhov 《The Visual computer》2008,24(11):947-953
One of the important tasks in Mechanical Engineering is to increase the safety of the vehicle and decrease its production
costs. This task is typically solved by means of Multiobjective Optimization, which formulates the problem as a mapping from
the space of design variables to the space of target criteria and tries to find an optimal region in these multidimensional
spaces. Due to high computational costs of numerical simulations, the sampling of this mapping is usually very sparse and
scattered. Combining design of experiments methods, metamodeling, new interpolation schemes and innovative graphics methods,
we enable the user to interact with simulation parameters, optimization criteria, and come to a new interpolated crash result
within seconds. We denote this approach as Simulated Reality, a new concept for the interplay between simulation, optimization
and interactive visualization. In this paper we show the application of Simulated Reality for solution of real life car design
optimization problems.
相似文献
Lialia NikitinaEmail: |
994.
Question-Answering Bulletin Boards (QABB), such as Yahoo! Answers and Windows Live QnA, are gaining popularity recently. Questions
are submitted on QABB and let somebody in the internet answer them. Communications on QABB connect users, and the overall
connections can be regarded as a social network. If the evolution of social networks can be predicted, it is quite useful
for encouraging communications among users. Link prediction on QABB can be used for recommendation to potential answerers.
Previous approaches for link prediction based on structural properties do not take weights of links into account. This paper
describes an improved method for predicting links based on weighted proximity measures of social networks. The method is based
on an assumption that proximities between nodes can be estimated better by using both graph proximity measures and the weights
of existing links in a social network. In order to show the effectiveness of our method, the data of Yahoo! Chiebukuro (Japanese
Yahoo! Answers) are used for our experiments. The results show that our method outperforms previous approaches, especially
when target social networks are sufficiently dense.
相似文献
Tsuyoshi MurataEmail: |
995.
In order to be capable of exploiting context for pro-active information recommendation, agents need to extract and understand
user activities based on their knowledge of the user interests. In this paper, we propose a novel approach for context-aware
recommendation in browsing assistants based on the integration of user profiles, navigational patterns and contextual elements.
In this approach, user profiles built using an unsupervised Web page clustering algorithm are used to characterize user ongoing
activities and behavior patterns. Experimental evidence show that using longer-term interests to explain active browsing goals
user assistance is effectively enhanced.
相似文献
Analía AmandiEmail: |
996.
Jeremy Brandman 《Journal of scientific computing》2008,37(3):282-315
We demonstrate, through separation of variables and estimates from the semi-classical analysis of the Schrödinger operator, that the eigenvalues of an elliptic operator defined on a compact hypersurface in ? n can be found by solving an elliptic eigenvalue problem in a bounded domain Ω?? n . The latter problem is solved using standard finite element methods on the Cartesian grid. We also discuss the application of these ideas to solving evolution equations on surfaces, including a new proof of a result due to Greer (J. Sci. Comput. 29(3):321–351, 2006). 相似文献
997.
Colin B. Macdonald Sigal Gottlieb Steven J. Ruuth 《Journal of scientific computing》2008,36(1):89-112
Diagonally split Runge–Kutta (DSRK) time discretization methods are a class of implicit time-stepping schemes which offer
both high-order convergence and a form of nonlinear stability known as unconditional contractivity. This combination is not
possible within the classes of Runge–Kutta or linear multistep methods and therefore appears promising for the strong stability
preserving (SSP) time-stepping community which is generally concerned with computing oscillation-free numerical solutions
of PDEs. Using a variety of numerical test problems, we show that although second- and third-order unconditionally contractive
DSRK methods do preserve the strong stability property for all time step-sizes, they suffer from order reduction at large
step-sizes. Indeed, for time-steps larger than those typically chosen for explicit methods, these DSRK methods behave like
first-order implicit methods. This is unfortunate, because it is precisely to allow a large time-step that we choose to use
implicit methods. These results suggest that unconditionally contractive DSRK methods are limited in usefulness as they are
unable to compete with either the first-order backward Euler method for large step-sizes or with Crank–Nicolson or high-order
explicit SSP Runge–Kutta methods for smaller step-sizes.
We also present stage order conditions for DSRK methods and show that the observed order reduction is associated with the
necessarily low stage order of the unconditionally contractive DSRK methods.
The work of C.B. Macdonald was partially supported by an NSERC Canada PGS-D scholarship, a grant from NSERC Canada, and a
scholarship from the Pacific Institute for the Mathematical Sciences (PIMS).
The work of S. Gottlieb was supported by AFOSR grant number FA9550-06-1-0255.
The work of S.J. Ruuth was partially supported by a grant from NSERC Canada. 相似文献
998.
Feature selection is an important aspect of solving data-mining and machine-learning problems. This paper proposes a feature-selection
method for the Support Vector Machine (SVM) learning. Like most feature-selection methods, the proposed method ranks all features
in decreasing order of importance so that more relevant features can be identified. It uses a novel criterion based on the
probabilistic outputs of SVM. This criterion, termed Feature-based Sensitivity of Posterior Probabilities (FSPP), evaluates
the importance of a specific feature by computing the aggregate value, over the feature space, of the absolute difference
of the probabilistic outputs of SVM with and without the feature. The exact form of this criterion is not easily computable
and approximation is needed. Four approximations, FSPP1-FSPP4, are proposed for this purpose. The first two approximations
evaluate the criterion by randomly permuting the values of the feature among samples of the training data. They differ in
their choices of the mapping function from standard SVM output to its probabilistic output: FSPP1 uses a simple threshold
function while FSPP2 uses a sigmoid function. The second two directly approximate the criterion but differ in the smoothness
assumptions of criterion with respect to the features. The performance of these approximations, used in an overall feature-selection
scheme, is then evaluated on various artificial problems and real-world problems, including datasets from the recent Neural
Information Processing Systems (NIPS) feature selection competition. FSPP1-3 show good performance consistently with FSPP2
being the best overall by a slight margin. The performance of FSPP2 is competitive with some of the best performing feature-selection
methods in the literature on the datasets that we have tested. Its associated computations are modest and hence it is suitable
as a feature-selection method for SVM applications.
Editor: Risto Miikkulainen. 相似文献
999.
Hsiao-Hsi Wang Kuan-Ching Li Ssu-Hsuan Lu Chun-Chieh Yang Jean-Luc Gaudiot 《International journal of parallel programming》2008,36(6):521-542
In recent years, cluster computing has been widely investigated and there is no doubt that it can provide a cost-effective
computing infrastructure by aggregating computational power, communication, and storage resources. Moreover, it is also considered
to be a very attractive platform for low-cost supercomputing. Distributed shared memory (DSM) systems utilize the physical
memory of each computing node interconnected in a private network to form a global virtual shared memory. Since this global
shared memory is distributed among the computing nodes, accessing the data located in remote computing nodes is an absolute
necessity. However, this action will result in significant remote memory access latencies which are major sources of overhead
in DSM systems. For these reasons, in order to increase overall system performance and decrease this overhead, a number of
strategies have been devised. Prefetching is one such approach which can reduce latencies, although it always increases the
workload in the home nodes. In this paper, we propose a scheme named Agent Home Scheme. Its most noticeable feature, when compared to other schemes, is that the agent home distributes the workloads of each computing
nodes when sending data. By doing this, we can reduce not only the workload of the home nodes by balancing the workload for
each node, but also the waiting time. Experimental results show that the proposed method can obtain about 20% higher performance
than the original JIAJIA, about 18% more than History Prefetching Strategy (HPS), and about 10% higher than Effective Prefetch
Strategy (EPS). 相似文献
1000.
Dongsoo Kang Chen Liu Jean-Luc Gaudiot 《International journal of parallel programming》2008,36(4):361-385
By executing two or more threads concurrently, Simultaneous MultiThreading (SMT) architectures are able to exploit both Instruction-Level
Parallelism (ILP) and Thread-Level Parallelism (TLP) from the increased number of in-flight instructions that are fetched
from multiple threads. However, due to incorrect control speculations, a significant number of these in-flight instructions
are discarded from the pipelines of SMT processors (which is a direct consequence of these pipelines getting wider and deeper).
Although increasing the accuracy of branch predictors may reduce the number of instructions so discarded from the pipelines,
the prediction accuracy cannot be easily scaled up since aggressive branch prediction schemes strongly depend on the particular
predictability inherently to the application programs. In this paper, we present an efficient thread scheduling mechanism
for SMT processors, called SAFE-T (Speculation-Aware Front-End Throttling): it is easy to implement and allows an SMT processor
to selectively perform speculative execution of threads according to the confidence level on branch predictions, hence preventing
wrong-path instructions from being fetched. SAFE-T provides an average reduction of 57.9% in the number of discarded instructions
and improves the instructions per cycle (IPC) performance by 14.7% on average over the ICOUNT policy across the multi-programmed
workloads we simulate.
This paper is an extended version of the paper, “Speculation Control for Simultaneous Multithreading,” which appeared in the
Proceedings of the 18th International Parallel and Distributed Processing Symposium, Santa Fe, New Mexico, April 2004. 相似文献