全文获取类型
收费全文 | 384篇 |
免费 | 18篇 |
专业分类
电工技术 | 5篇 |
化学工业 | 78篇 |
金属工艺 | 2篇 |
机械仪表 | 5篇 |
建筑科学 | 19篇 |
矿业工程 | 1篇 |
能源动力 | 35篇 |
轻工业 | 22篇 |
水利工程 | 8篇 |
无线电 | 45篇 |
一般工业技术 | 40篇 |
冶金工业 | 5篇 |
原子能技术 | 1篇 |
自动化技术 | 136篇 |
出版年
2024年 | 1篇 |
2023年 | 7篇 |
2022年 | 18篇 |
2021年 | 19篇 |
2020年 | 7篇 |
2019年 | 15篇 |
2018年 | 16篇 |
2017年 | 17篇 |
2016年 | 14篇 |
2015年 | 12篇 |
2014年 | 13篇 |
2013年 | 26篇 |
2012年 | 31篇 |
2011年 | 41篇 |
2010年 | 21篇 |
2009年 | 27篇 |
2008年 | 16篇 |
2007年 | 26篇 |
2006年 | 9篇 |
2005年 | 2篇 |
2004年 | 12篇 |
2003年 | 11篇 |
2002年 | 5篇 |
2001年 | 6篇 |
2000年 | 5篇 |
1999年 | 3篇 |
1998年 | 3篇 |
1997年 | 9篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1979年 | 1篇 |
排序方式: 共有402条查询结果,搜索用时 0 毫秒
1.
2.
What is the value of a scientist and its impact upon the scientific thinking? How can we measure the prestige of a journal or a conference? The evaluation of the scientific work of a scientist and the estimation of the quality of a journal or conference has long attracted significant interest, due to the benefits by obtaining an unbiased and fair criterion. Although it appears to be simple, defining a quality metric is not an easy task. To overcome the disadvantages of the present metrics used for ranking scientists and journals, J. E. Hirsch proposed a pioneering metric, the now famous h-index. In this article we demonstrate several inefficiencies of this index and develop a pair of generalizations and effective variants of it to deal with scientist ranking and publication forum ranking. The new citation indices are able to disclose trendsetters in scientific research, as well as researchers that constantly shape their field with their influential work, no matter how old they are. We exhibit the effectiveness and the benefits of the new indices to unfold the full potential of the h-index, with extensive experimental results obtained from the DBLP, a widely known on-line digital library. 相似文献
3.
4.
5.
Recent advances in the field of kernel-based machine learning methods allow fast processing of text using string kernels utilizing suffix arrays. kernlab provides both kernel methods’ infrastructure and a large collection of already implemented algorithms and includes an implementation of suffix-array-based string kernels. Along with the use of the text mining infrastructure provided by tm these packages provide R with functionality in processing, visualizing and grouping large collections of text data using kernel methods. The emphasis is on the performance of various types of string kernels at these tasks. 相似文献
6.
Prefetching in Content Distribution Networks via Web Communities Identification and Outsourcing 总被引:1,自引:0,他引:1
Antonis Sidiropoulos George Pallis Dimitrios Katsaros Konstantinos Stamos Athena Vakali Yannis Manolopoulos 《World Wide Web》2008,11(1):39-70
Content distribution networks (CDNs) improve scalability and reliability, by replicating content to the “edge” of the Internet.
Apart from the pure networking issues of the CDNs relevant to the establishment of the infrastructure, some very crucial data
management issues must be resolved to exploit the full potential of CDNs to reduce the “last mile” latencies. A very important
issue is the selection of the content to be prefetched to the CDN servers. All the approaches developed so far, assume the
existence of adequate content popularity statistics to drive the prefetch decisions. Such information though, is not always
available, or it is extremely volatile, turning such methods problematic. To address this issue, we develop self-adaptive
techniques to select the outsourced content in a CDN infrastructure, which requires no apriori knowledge of request statistics.
We identify clusters of “correlated” Web pages in a site, called Web site communities, and make these communities the basic outsourcing unit. Through a detailed simulation environment, using both real and synthetic
data, we show that the proposed techniques are very robust and effective in reducing the user-perceived latency, performing
very close to an unfeasible, off-line policy, which has full knowledge of the content popularity. 相似文献
7.
A Simulation Framework for Heterogeneous Agents 总被引:2,自引:0,他引:2
David Meyer Alexandros Karatzoglou Friedrich Leisch Christian Buchta Kurt Hornik 《Computational Economics》2003,22(2-3):285-301
We introduce a generic simulation framework suitable for agent-based simulations featuring the support of heterogeneous agents, hierarchical scheduling, and flexible specification of design parameters. One key aspect of this framework is the design specification: we use a format based on the Extendible Markup Language (XML) that is simple-structured yet still enables the design of flexible models. Another issue in agent-based simulations, especially when ready-made components are used, is the heterogeneity arising from both the agents' implementations and the underlying platforms. To tackle such obstacles, we introduce a wrapper technique for mapping the functionality of agents living in an interpreter-based environment to a standardized JAVA interface, thus facilitating the task for any control mechanism (like a simulation manager) because it has to handle only one set of commands for all agents involved. Again, this mapping is made by an XML-based definition format. We demonstrate the technique by applying it to a simple sample simulation of two mass marketing firms operating in an artificial consumer environment. 相似文献
8.
A desirable feature in spatio-temporal databases is the ability to answer future queries, based on the current data characteristics (reference position and velocity vector). Given a moving query and a set of moving objects, a future query asks for the set of objects that satisfy the query in a given time interval. The difficulty in such a case is that both the query and the data objects change positions continuously, and therefore we can not rely on a given fixed reference position to determine the answer. Existing techniques are either based on sampling, or on repetitive application of time-parameterized queries in order to provide the answer. In this paper we develop an efficient method in order to process nearest-neighbor queries in moving-object databases. The basic advantage of the proposed approach is that only one query is issued per time interval. The time-parameterized R-tree structure is used to index the moving objects. An extensive performance evaluation, based on CPU and I/O time, shows that significant improvements are achieved compared to existing techniques. 相似文献
9.
Faloutsos C. Jagadish H.V. Manolopoulos Y. 《Knowledge and Data Engineering, IEEE Transactions on》1997,9(3):373-383
We give a closed-form expression for the average number of n-dimensional quadtree nodes (“pieces” or “blocks”) required by an n-dimensional hyperrectangle aligned with the axes. Our formula includes as special cases the formulae of previous efforts for two-dimensional spaces. It also agrees with theoretical and empirical results that the number of blocks depends on the hypersurface of the hyperrectangle and not on its hypervolume. The practical use of the derived formula is that it allows the estimation of the space requirements of the n-dimensional quadtree decomposition. Quadtrees are used extensively in two-dimensional spaces (geographic information systems and spatial databases in general), as well in higher dimensionality spaces (as oct-trees for three-dimensional spaces, e.g., in graphics, robotics, and three-dimensional medical images). Our formula permits the estimation of the space requirements for data hyperrectangles when stored in an index structure like a (n-dimensional) quadtree, as well as the estimation of the search time for query hyperrectangles, for the so-called linear quadtrees. A theoretical contribution of the paper is the observation that the number of blocks is a piece-wise linear function of the sides of the hyperrectangle 相似文献
10.
Web caching in broadcast mobile wireless environments 总被引:1,自引:0,他引:1
Effectively exploiting available communication bandwidth and client resources is vital in wireless mobile environments. One technique for doing so is client-side data caching, which helps reduce latency and conserve network resources. The SliCache generic self-tunable cache-replacement policy addresses these issues by using intelligent slicing of the cache space and novel methods for selecting which objects to purge. Performance evaluations show that SliCache improves mobile clients' access to Web objects compared to other common policies. 相似文献