全文获取类型
收费全文 | 1084篇 |
免费 | 57篇 |
专业分类
电工技术 | 13篇 |
综合类 | 1篇 |
化学工业 | 269篇 |
金属工艺 | 3篇 |
机械仪表 | 12篇 |
建筑科学 | 33篇 |
矿业工程 | 2篇 |
能源动力 | 39篇 |
轻工业 | 81篇 |
水利工程 | 11篇 |
石油天然气 | 4篇 |
无线电 | 175篇 |
一般工业技术 | 131篇 |
冶金工业 | 28篇 |
原子能技术 | 4篇 |
自动化技术 | 335篇 |
出版年
2024年 | 2篇 |
2023年 | 14篇 |
2022年 | 36篇 |
2021年 | 48篇 |
2020年 | 41篇 |
2019年 | 41篇 |
2018年 | 36篇 |
2017年 | 45篇 |
2016年 | 40篇 |
2015年 | 33篇 |
2014年 | 56篇 |
2013年 | 88篇 |
2012年 | 68篇 |
2011年 | 81篇 |
2010年 | 54篇 |
2009年 | 79篇 |
2008年 | 67篇 |
2007年 | 69篇 |
2006年 | 35篇 |
2005年 | 23篇 |
2004年 | 26篇 |
2003年 | 18篇 |
2002年 | 17篇 |
2001年 | 6篇 |
2000年 | 6篇 |
1999年 | 5篇 |
1998年 | 8篇 |
1997年 | 6篇 |
1996年 | 5篇 |
1995年 | 3篇 |
1994年 | 9篇 |
1993年 | 5篇 |
1992年 | 5篇 |
1991年 | 4篇 |
1990年 | 3篇 |
1989年 | 7篇 |
1988年 | 7篇 |
1987年 | 7篇 |
1986年 | 4篇 |
1985年 | 8篇 |
1984年 | 5篇 |
1983年 | 4篇 |
1982年 | 3篇 |
1981年 | 4篇 |
1980年 | 3篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1973年 | 1篇 |
排序方式: 共有1141条查询结果,搜索用时 15 毫秒
31.
Christos D. Antonopoulos Filip Blagojevic Andrey N. Chernikov Nikos P. Chrisochoides Dimitrios S. Nikolopoulos 《Journal of Parallel and Distributed Computing》2009
This article focuses on the optimization of PCDM, a parallel, two-dimensional (2D) Delaunay mesh generation application, and its interaction with parallel architectures based on simultaneous multithreading (SMT) processors. We first present the step-by-step effect of a series of optimizations on performance. These optimizations improve the performance of PCDM by up to a factor of six. They target issues that very often limit the performance of scientific computing codes. We then evaluate the interaction of PCDM with a real SMT-based SMP system, using both high-level metrics, such as execution time, and low-level information from hardware performance counters. 相似文献
32.
Christos Doulkeridis Akrivi Vlachou Kjetil Nørvåg Yannis Kotidis Michalis Vazirgiannis 《Peer-to-Peer Networking and Applications》2010,3(1):67-79
The advent of the World Wide Web has made an enormous amount of information available to everyone and the widespread use of
digital equipment enables end-users (peers) to produce their own digital content. This vast amount of information requires scalable data management systems. Peer-to-peer
(P2P) systems have so far been well established in several application areas, with file-sharing being the most prominent.
The next challenge that needs to be addressed is (more complex) data sharing, management and query processing, thus facilitating
the delivery of a wide spectrum of novel data-centric applications to the end-user, while providing high Quality-of-Service.
In this paper, we propose a self-organizing P2P system that is capable to identify peers with similar content and intentionally
assign them to the same super-peer. During content retrieval, fewer super-peers need to be contacted and therefore efficient
similarity search is supported, in terms of reduced network traffic and contacted peers. Our approach increases the responsiveness
and reliability of a P2P system and we demonstrate the advantages of our approach using large-scale simulations. 相似文献
33.
34.
35.
Jimeng Sun Charalampos E. Tsourakakis Evan Hoke Christos Faloutsos Tina Eliassi-Rad 《Data mining and knowledge discovery》2008,17(1):111-128
Data stream values are often associated with multiple aspects. For example each value observed at a given time-stamp from environmental sensors may have an associated type (e.g., temperature,
humidity, etc.) as well as location. Time-stamp, type and location are the three aspects, which can be modeled using a tensor
(high-order array). However, the time aspect is special, with a natural ordering, and with successive time-ticks having usually
correlated values. Standard multiway analysis ignores this structure. To capture it, we propose 2 Heads Tensor Analysis (2-heads), which provides a qualitatively different treatment on time. Unlike most existing approaches that use a PCA-like
summarization scheme for all aspects, 2-heads treats the time aspect carefully. 2-heads combines the power of classic multilinear
analysis with wavelets, leading to a powerful mining tool. Furthermore, 2-heads has several other advantages as well: (a)
it can be computed incrementally in a streaming fashion, (b) it has a provable error guarantee and, (c) it achieves significant
compression ratio against competitors. Finally, we show experiments on real datasets, and we illustrate how 2-heads reveals
interesting trends in the data. This is an extended abstract of an article published in the Data Mining and Knowledge Discovery
journal. 相似文献
36.
Galanis CC Sfantsikopoulos MM Koidis PT Kafantaris NM Mpikos PG 《Computer methods and programs in biomedicine》2007,86(1):30-38
The paper presents computer-aided methods that allocate a dental implant and suggest its size, during the pre-operative planning stage, in conformance with introduced optimization criteria and established clinical requirements. Based on computed tomography data of the jaw and prosthesis anatomy, single tooth cases are planned for the best-suited implant insertion at a user-defined region. An optimum implantation axis line is produced and cylindrical implants of various candidate sizes are then automatically positioned, while their occlusal end is leveled to bone ridge, and evaluated. Radial safety margins are used for the assessment of the implant safety distance from neighboring anatomical structures and bone quantity and quality are estimated and taken into consideration. A case study demonstrates the concept and allows for its discussion. 相似文献
37.
We consider discrete event systems (DES) involving tasks with real-time constraints and seek to control processing times so
as to minimize a cost function subject to each task meeting its own constraint. When tasks are processed over a single stage,
it has been shown that there are structural properties of the optimal sample path that lead to very efficient solutions of
such problems. When tasks are processed over multiple stages and are subject to end-to-end real-time constraints, these properties
no longer hold and no obvious extensions are known. We consider a two-stage problem with homogeneous cost functions over all
tasks at each stage and derive several new optimality properties. These properties lead to the idea of introducing “virtual”
deadlines at the first stage, thus partially decoupling the stages so that the known efficient solutions for single-stage
problems can be used. We prove that the solution obtained by an iterative virtual deadline algorithm (VDA) converges to the
global optimal solution of the two-stage problem and illustrate the efficiency of the VDA through numerical examples.
相似文献
Christos G. CassandrasEmail: |
38.
Flip Korn Alexandros Labrinidis Yannis Kotidis Christos Faloutsos 《The VLDB Journal The International Journal on Very Large Data Bases》2000,8(3-4):254-266
Association Rule Mining algorithms operate on a data matrix (e.g., customers products) to derive association rules [AIS93b, SA96]. We propose a new paradigm, namely, Ratio Rules, which are quantifiable in that we can measure the “goodness” of a set of discovered rules. We also propose the “guessing
error” as a measure of the “goodness”, that is, the root-mean-square error of the reconstructed values of the cells of the
given matrix, when we pretend that they are unknown. Another contribution is a novel method to guess missing/hidden values
from the Ratio Rules that our method derives. For example, if somebody bought $10 of milk and $3 of bread, our rules can “guess”
the amount spent on butter. Thus, unlike association rules, Ratio Rules can perform a variety of important tasks such as forecasting,
answering “what-if” scenarios, detecting outliers, and visualizing the data. Moreover, we show that we can compute Ratio Rules
in a single pass over the data set with small memory requirements (a few small matrices), in contrast to association rule mining methods
which require multiple passes and/or large memory. Experiments on several real data sets (e.g., basketball and baseball statistics,
biological data) demonstrate that the proposed method: (a) leads to rules that make sense; (b) can find large itemsets in
binary matrices, even in the presence of noise; and (c) consistently achieves a “guessing error” of up to 5 times less than
using straightforward column averages.
Received: March 15, 1999 / Accepted: November 1, 1999 相似文献
39.
Abstract The present paper tries to estimate the surface water resources potential in some of the major Aegean islands in an effort to provide a means for the continuous development of the region, and, by extension, for similar areas around the world. The islands have to confront the challenge of surviving in a semiarid environment under the constraints of uneven water resources distribution both in space and time. In addition to these, tourism development, industrialization and highly water consumptive life styles have exacerbated perennial problems in water resources and water resources management. The framework of the present effort has a two-prong emphasis. In the first part, a simulation model is presented, which tries to estimate the potential surface runoff under physical, structural organizational, and institutional constraints. The methodology and the premises of the simulation process are delineated. In the second part, the results of the model's application in distinct cases are demarcated. The final product, namely the model and the resulting runoff coefficients, are presented in the form of a standard, which may provide practitioners in the field as well as decisionmakers the means for an initial reference in pertinent developmental efforts. Finally, the conclusions and recommendations raise the question of ecosystem resilience and point towards the urgent and continuous need for the application of integrated water resources management principles. 相似文献
40.
Perturbation Analysis of Multiclass Stochastic Fluid Models 总被引:1,自引:5,他引:1
Gang Sun Christos G. Cassandras Christos G. Panayiotou 《Discrete Event Dynamic Systems》2004,14(3):267-307
We use a stochastic fluid model (SFM) to capture the operation of finite-capacity queueing systems with multiple customer classes. We derive gradient estimators for class-dependent loss and workload related performance metrics with respect to any one of several threshold parameters used for buffer control. These estimators are shown to be unbiased and directly observable from a sample path without any knowledge of underlying stochastic characteristics of the traffic processes. This renders them computable in on-line environments and easily implementable in settings such as communication networks. 相似文献