全文获取类型
收费全文 | 225篇 |
免费 | 3篇 |
专业分类
化学工业 | 25篇 |
机械仪表 | 2篇 |
建筑科学 | 6篇 |
矿业工程 | 1篇 |
能源动力 | 1篇 |
轻工业 | 10篇 |
水利工程 | 1篇 |
无线电 | 62篇 |
一般工业技术 | 30篇 |
冶金工业 | 52篇 |
原子能技术 | 3篇 |
自动化技术 | 35篇 |
出版年
2023年 | 1篇 |
2022年 | 7篇 |
2021年 | 5篇 |
2020年 | 2篇 |
2019年 | 3篇 |
2018年 | 2篇 |
2016年 | 10篇 |
2015年 | 12篇 |
2014年 | 6篇 |
2013年 | 8篇 |
2012年 | 2篇 |
2011年 | 5篇 |
2010年 | 8篇 |
2009年 | 15篇 |
2008年 | 10篇 |
2007年 | 8篇 |
2006年 | 8篇 |
2005年 | 3篇 |
2004年 | 10篇 |
2003年 | 4篇 |
2002年 | 4篇 |
2001年 | 5篇 |
2000年 | 1篇 |
1999年 | 4篇 |
1998年 | 11篇 |
1997年 | 12篇 |
1996年 | 5篇 |
1995年 | 3篇 |
1994年 | 6篇 |
1993年 | 9篇 |
1992年 | 5篇 |
1991年 | 2篇 |
1990年 | 5篇 |
1989年 | 4篇 |
1988年 | 2篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1981年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1976年 | 5篇 |
1975年 | 3篇 |
1973年 | 1篇 |
1971年 | 1篇 |
1965年 | 1篇 |
1964年 | 1篇 |
1958年 | 2篇 |
排序方式: 共有228条查询结果,搜索用时 15 毫秒
1.
2.
Helmut Alt Esther M. Arkin Alon Efrat George Hart Ferran Hurtado Irina Kostitsyna Alexander Kröller Joseph S. B. Mitchell Valentin Polishchuk 《Theory of Computing Systems》2014,54(4):689-714
We show how to compute the smallest rectangle that can enclose any polygon, from a given set of polygons, in nearly linear time; we also present a PTAS for the problem, as well as a linear-time algorithm for the case when the polygons are rectangles themselves. We prove that finding a smallest convex polygon that encloses any of the given polygons is NP-hard, and give a PTAS for minimizing the perimeter of the convex enclosure. We also give efficient algorithms to find the smallest rectangle simultaneously enclosing a given pair of convex polygons. 相似文献
3.
4.
5.
Automated regression suites are essential in developing large applications, while maintaining reasonable quality and timetables. The main argument against the automation of regression suites, in addition to the cost of creation and maintenance, is the observation that if you run the same test many times, it becomes increasingly less likely to find bugs. To alleviate such problems, a new regression suite practice, using random test generators to create regression suites on-the-fly, is becoming more common. In this practice, instead of maintaining tests, we generate test suites on-the-fly by choosing several specifications and generating a number of tests from each specification. 相似文献
6.
Efrat Blumenfeld-Lieberthal 《Networks and Spatial Economics》2009,9(3):427-458
This paper presents an analysis of the topology of transportation networks within different systems of cities. Urban entities
and their components are complex systems by their nature; there is no central force that affects their spatial structure.
Thus, we study transportation networks within different countries as complex networks. Based on the above, we consider cities
as nodes, while direct air and railways routes represent the links. We present characteristics of these networks including
their degree and clustering coefficient. Transportation networks can be used as an indicator of economic activity between
cities. Cities with strong economic relationship are characterized by high volume of connectivity. Our findings suggest that
the topology of the analyzed transportation networks can be used to classify the countries they belong to based on their economic
development.
相似文献
Efrat Blumenfeld-LieberthalEmail: |
7.
In this paper we investigate data structures obtained by a recursive partitioning of the multi- dimensional input domain
into regions of equal size. One of the best known examples of such a structure is the quadtree . It is used here as a basis for more complex data structures. We also provide multidimensional versions of the stratified tree by van Emde Boas [vEB]. We show that under the assumption that the input points have limited precision (i.e., are drawn
from the integer grid of size u ) these data structures yield efficient solutions to many important problems. In particular, they allow us to achieve O(log log u) time per operation for dynamic approximate nearest neighbor (under insertions and deletions) and exact on-line closest pair
(under insertions only) in any constant number of dimensions. They allow O(log log u) point location in a given planar shape or in its expansion (dilation by a ball of a given radius). Finally, we provide a
linear time (optimal) algorithm for computing the expansion of a shape represented by a region quadtree. This result shows
that the spatial order imposed by this regular data structure is sufficient to optimize the operation of dilation by a ball.
Received January 19, 1999; revised November 4, 1999. 相似文献
8.
Merhav N. Ziv J. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2006,52(3):867-873
We consider a variation of the Wyner-Ziv (W-Z) problem pertaining to lossy compression of individual sequences using finite-state encoders and decoders. There are two main results in this paper. The first characterizes the relationship between the performance of the best M-state encoder-decoder pair to that of the best block code of size /spl lscr/ for every input sequence, and shows that the loss of the latter relative to the former (in terms of both rate and distortion) never exceeds the order of (logM)//spl lscr/, independently of the input sequence. Thus, in the limit of large M, the best rate-distortion performance of every infinite source sequence can be approached universally by a sequence of block codes (which are also implementable by finite-state machines). While this result assumes an asymptotic regime where the number of states is fixed, and only the length n of the input sequence grows without bound, we then consider the case where the number of states M=M/sub n/ is allowed to grow concurrently with n. Our second result is then about the critical growth rate of M/sub n/ such that the rate-distortion performance of M/sub n/-state encoder-decoder pairs can still be matched by a universal code. We show that this critical growth rate of M/sub n/ is linear in n. 相似文献
9.
Hadas Schwartz-Chassidim Joachim Meyer Yisrael Parmet Efrat Rogatka Ohad Amzaleg 《Applied ergonomics》2014
Maps should be designed so that users can comprehend and use the information. Display decisions, such as choosing the scale at which an area is shown, depend on properties of the displayed information such as the perceived density (PD) of the information. Taking a psychophysical approach we suggest that the PD of information in a road map is related to the scale and properties of the mapped area. 54 participants rated the PD of 60 maps from different regions. We provide a simple model that predicts the PD of electronic road map displays, using the logarithm of the number of roads, the logarithm of the number of junctions and the length of the shown roads. The PD model was cross-validated using a different set of 60 maps (n = 44). The model can be used for automatically adjusting display scales and for evaluating map designs, considering the required PD to perform a map-related task. 相似文献
10.
Ziv Hameiri Arman Mahboubi Soufiani Mattias K. Juhl Liangcong Jiang Fuzhi Huang Yi‐Bing Cheng Henner Kampwerth Juergen W. Weber Martin A. Green Thorsten Trupke 《Progress in Photovoltaics: Research and Applications》2015,23(12):1697-1705
Fast camera‐based luminescence‐imaging measurements on perovskite solar cells are presented. The fundamental correlation between the luminescence intensity and the open circuit voltage predicted by the generalised Planck law is confirmed, enabling various quantitative methods for the detection of efficiency‐limiting defects to be applied to this new cell structure. Interstinegly, it is found that this fundamental correlation is valid only for light‐soaked devices. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献