全文获取类型
收费全文 | 2080篇 |
免费 | 92篇 |
国内免费 | 77篇 |
专业分类
电工技术 | 36篇 |
综合类 | 168篇 |
化学工业 | 19篇 |
金属工艺 | 21篇 |
机械仪表 | 131篇 |
建筑科学 | 31篇 |
矿业工程 | 19篇 |
能源动力 | 24篇 |
轻工业 | 22篇 |
水利工程 | 9篇 |
石油天然气 | 41篇 |
武器工业 | 9篇 |
无线电 | 122篇 |
一般工业技术 | 144篇 |
冶金工业 | 16篇 |
原子能技术 | 4篇 |
自动化技术 | 1433篇 |
出版年
2024年 | 6篇 |
2023年 | 30篇 |
2022年 | 35篇 |
2021年 | 27篇 |
2020年 | 26篇 |
2019年 | 48篇 |
2018年 | 29篇 |
2017年 | 62篇 |
2016年 | 67篇 |
2015年 | 68篇 |
2014年 | 89篇 |
2013年 | 125篇 |
2012年 | 113篇 |
2011年 | 153篇 |
2010年 | 98篇 |
2009年 | 161篇 |
2008年 | 120篇 |
2007年 | 113篇 |
2006年 | 106篇 |
2005年 | 81篇 |
2004年 | 80篇 |
2003年 | 90篇 |
2002年 | 63篇 |
2001年 | 40篇 |
2000年 | 48篇 |
1999年 | 32篇 |
1998年 | 38篇 |
1997年 | 36篇 |
1996年 | 38篇 |
1995年 | 37篇 |
1994年 | 29篇 |
1993年 | 38篇 |
1992年 | 19篇 |
1991年 | 19篇 |
1990年 | 11篇 |
1989年 | 12篇 |
1988年 | 8篇 |
1987年 | 6篇 |
1985年 | 3篇 |
1984年 | 4篇 |
1983年 | 5篇 |
1982年 | 3篇 |
1981年 | 3篇 |
1980年 | 4篇 |
1979年 | 6篇 |
1978年 | 4篇 |
1977年 | 3篇 |
1976年 | 5篇 |
1974年 | 2篇 |
1973年 | 2篇 |
排序方式: 共有2249条查询结果,搜索用时 18 毫秒
141.
Dengfeng Gao Christian S. Jensen Richard T. Snodgrass Michael D. Soo 《The VLDB Journal The International Journal on Very Large Data Bases》2005,14(1):2-29
Joins are arguably the most important relational operators. Poor implementations are tantamount to computing the Cartesian product of the input relations. In a temporal database, the problem is more acute for two reasons. First, conventional techniques are designed for the evaluation of joins with equality predicates rather than the inequality predicates prevalent in valid-time queries. Second, the presence of temporally varying data dramatically increases the size of a database. These factors indicate that specialized techniques are needed to efficiently evaluate temporal joins.We address this need for efficient join evaluation in temporal databases. Our purpose is twofold. We first survey all previously proposed temporal join operators. While many temporal join operators have been defined in previous work, this work has been done largely in isolation from competing proposals, with little, if any, comparison of the various operators. We then address evaluation algorithms, comparing the applicability of various algorithms to the temporal join operators and describing a performance study involving algorithms for one important operator, the temporal equijoin. Our focus, with respect to implementation, is on non-index-based join algorithms. Such algorithms do not rely on auxiliary access paths but may exploit sort orderings to achieve efficiency.Received: 17 October 2002, Accepted: 26 July 2003, Published online: 28 October 2003Edited by: T. Sellis 相似文献
142.
Curve reconstruction based on an interval B-spline curve 总被引:3,自引:0,他引:3
Curve reconstruction that generates a piece of centric curve from a piece of planar strip-shaped point cloud is a fundamental problem in reverse engineering. In this paper, we present a new curve-reconstruction algorithm based on an interval B-spline curve. The algorithm constructs a rectangle sequence approximating the point cloud using a new data clustering technique, which facilitates the determination of curve order implied in the shape of the point cloud. A quasicentric point sequence and two pieces of boundary point sequences are then computed, based on which a piece of interval B-spline curve representing the geometric shape of the point cloud is constructed. Its centric curve is the final reconstructed curve. The whole algorithm is intuitive, simple, and efficient, as demonstrated by experimental results. 相似文献
143.
This paper reports preliminary work to investigate the suitability of using a blackboard framework as a problem-solving model for stamping process planning in progressive die design. The model is described at two levels: knowledge level and computational level. The knowledge level describes how the stamping process planning domain is represented in a blackboard architecture. The computational level describes how the blackboard architecture is modeled and implemented using object technology. A software prototype has been developed using CLIPS and C++ interfaced with Solid Edge CAD system. An example is presented to illustrate the feasibility and practicality of the proposed approach. 相似文献
144.
An r-perfect code of a graph G=(V,E) is a set C⊆V such that the r-balls centered at vertices of C form a partition of V. It is proved that the direct product of Cm and Cn (r?1, m,n?2r+1) contains an r-perfect code if and only if m and n are each a multiple of 2(r+1)+r2 and that the direct product of Cm, Cn, and C? (r?1, m,n,??2r+1) contains an r-perfect code if and only if m, n, and ? are each a multiple of r3+3(r+1). The corresponding r-codes are essentially unique. Also, r-perfect codes in C2r×Cn (r?2, n?2r) are characterized. 相似文献
145.
Pietro Cenciarelli Alessandro Tiberi 《Electronic Notes in Theoretical Computer Science》2005,127(5):3
We present a case study where Synchronising Graphs, a system of parallel graph transformation, are used to solve the syntactic unification problem for first order rational terms (with possibly infinite unifier). The solution we offer is efficient, that is quasi-linear, and simple: a program of 28 characters. 相似文献
146.
《Electronic Notes in Theoretical Computer Science》2005,125(3):137
We present a new method for deciding Gödel-Dummett logic. Starting from a formula, it proceeds in three steps. First build a conditional graph based on the decomposition tree of the formula. Then try to remove some cycles in this graph by instantiating these boolean conditions. In case this is possible, extract a counter-model from such an instance graph. Otherwise the initial formula is provable. We emphasize on cycle removal through matrix computation, boolean constraint solving and counter-model extraction. 相似文献
147.
Saravut Charcranoon Tarek S. El-Bawab Jong-Dug Shin Hakki C. Cankaya 《Photonic Network Communications》2006,11(1):99-110
We propose a new burst scheduling mechanism for Optical Burst-Switched (OBS) networks. The new approach is made possible by
gathering data bursts into groups and performing the scheduling decision for each group collectively. In OBS group-scheduling,
bursts will not be considered for scheduling until a pre-defined time period elapses, during which the group of burst header
packets would be gathered. By transforming a set of data bursts into a set of corresponding time intervals, the problem of
scheduling these bursts is transformed into a combinatorial optimization problem. Graph algorithms are applied to obtain the
maximum number of non-overlapping bursts. The proposed OBS group-scheduling scheme is shown to improve the performance of
OBS networks over existing scheduling schemes in terms of burst loss probability and channel utilization. With an extension
through a sequential optimization, using a Branch-and-Bound technique, the proposed scheme can support multiple classes of
service. It is shown that the new scheduling approach has several desired characteristics including fairness and service differentiability
among classes in terms of burst loss probability and channel utilization. 相似文献
148.
运用空间数据尺度有时会遇到麻烦的概念和逻辑问题,必须仔细严格划定数据的名义尺度、有序尺度、间隔尺度和比率尺度,才会避免自我矛盾。 相似文献
149.
Theodoros Koutroumanidis Lazaros Iliadis Georgios K. Sylaios 《Environmental Modelling & Software》2006,21(12):1711-1721
Forecasting, using historic time-series data, has become an important tool for fisheries management. ARIMA modeling, Modeling for Optimal Forecasting techniques and Decision Support Systems based on fuzzy mathematics may be used to predict the general trend of a given fish landings time-series with increased reliability and accuracy. The present paper applies these three modeling methods to forecast anchovy fish catches landed in a given port (Thessaloniki, Greece) during 1979–2000 and hake and bonito total fish catches during 1982–2000. The paper attempts to assess the model's accuracy by comparing model results to the actual monthly fish catches of the year 2000. According to the measures of forecasting accuracy established, the best forecasting performance for anchovy was shown by the DSS model (MAPE = 28.06%, RMSE = 76.56, U-statistic = 0.67 and R2 = 0.69). The optimal forecasting technique of genetic modeling improved significantly the forecasting values obtained by the selected ARIMA model. Similarly, the DSS model showed a noteworthy forecasting efficiency for the prediction of hake landings, during the year 2000 (MAPE = 2.88%, RMSE = 13.75, U-statistic = 0.19 and R2 = 0.98), as compared to the other two modeling techniques. Optimal forecasting produced by combined modeling scored better than application of the simple ARIMA model. Overall, DSS results showed that the Fuzzy Expected Intervals methodology could be used as a very reliable tool for short-term predictions of fishery landings. 相似文献
150.
In order to estimate continuously the dynamic location of a car, dead reckoning and absolute sensors are usually merged. The models used for this fusion are non-linear and, therefore, classical tools (such as Bayesian estimation) cannot provide a guaranteed estimation. In some applications, integrity is essential and the ability to guaranty the result is a crucial point. There are bounded-error approaches that are insensitive to non-linearity. In this context, the random errors are only modeled by their maximum bounds. This paper presents a new technique to merge the data of redundant sensors with a guaranteed result based on constraints propagation techniques on real intervals. We have thus developed an approach for the fusion of the two ABS wheel encoders of the rear wheels of a car, a fiber optic gyro and a differential GPS receiver in order to estimate the absolute location of a car. Experimental results show that the precision that one can obtain is acceptable, with a guaranteed result, in comparison with an extended Kalman filter. Moreover, constraints propagation techniques are well adapted to a real-time context. 相似文献