全文获取类型
收费全文 | 171481篇 |
免费 | 9196篇 |
国内免费 | 5190篇 |
专业分类
电工技术 | 6594篇 |
技术理论 | 6篇 |
综合类 | 9330篇 |
化学工业 | 25785篇 |
金属工艺 | 10457篇 |
机械仪表 | 9066篇 |
建筑科学 | 8192篇 |
矿业工程 | 3275篇 |
能源动力 | 3533篇 |
轻工业 | 10528篇 |
水利工程 | 3084篇 |
石油天然气 | 5024篇 |
武器工业 | 854篇 |
无线电 | 19064篇 |
一般工业技术 | 26184篇 |
冶金工业 | 6992篇 |
原子能技术 | 1330篇 |
自动化技术 | 36569篇 |
出版年
2024年 | 312篇 |
2023年 | 1245篇 |
2022年 | 2390篇 |
2021年 | 3545篇 |
2020年 | 2559篇 |
2019年 | 2340篇 |
2018年 | 16659篇 |
2017年 | 15786篇 |
2016年 | 12283篇 |
2015年 | 4179篇 |
2014年 | 4638篇 |
2013年 | 5641篇 |
2012年 | 9269篇 |
2011年 | 15989篇 |
2010年 | 14121篇 |
2009年 | 11312篇 |
2008年 | 12768篇 |
2007年 | 13475篇 |
2006年 | 5780篇 |
2005年 | 5815篇 |
2004年 | 4548篇 |
2003年 | 3897篇 |
2002年 | 3070篇 |
2001年 | 2330篇 |
2000年 | 2155篇 |
1999年 | 1769篇 |
1998年 | 1367篇 |
1997年 | 1164篇 |
1996年 | 1029篇 |
1995年 | 837篇 |
1994年 | 703篇 |
1993年 | 454篇 |
1992年 | 379篇 |
1991年 | 314篇 |
1990年 | 226篇 |
1989年 | 225篇 |
1988年 | 154篇 |
1987年 | 115篇 |
1986年 | 74篇 |
1985年 | 52篇 |
1984年 | 40篇 |
1983年 | 41篇 |
1968年 | 43篇 |
1966年 | 43篇 |
1965年 | 44篇 |
1959年 | 42篇 |
1958年 | 37篇 |
1957年 | 36篇 |
1955年 | 63篇 |
1954年 | 68篇 |
排序方式: 共有10000条查询结果,搜索用时 203 毫秒
991.
Most algorithms of smoothing schedule compute the required bit rate of video transmission to satisfy all the transmitted data.
In this paper, our proposed tolerable data dropping algorithm can adjust transmitting data to fit available bit rate. MPEG-4
with fine grained scalability (FGS) can support partial data dropping to adapt to available bandwidth network. The algorithm
is based on the minimum variance bandwidth allocation (MVBA) algorithm proposed by Salehi et al. to compute the bit rate such
that still ensuring that the buffer never underflows and overflows for MPEG-4 FGS streams under the limited bandwidth resource.
We prove that our proposed algorithm, named MVBADP, is smoother than the MVBA algorithm. The experimental results show the
peak rate, the number of rate changes, and the ratio of total dropping data, and the PSNR for four test sequences with different
content characteristics. They are varied by buffer sizes and tolerable dropping ratios. We found that the MVBADP algorithm
can reduce the peak rate and the number of changes when the transmitted data are dropped by tolerable dropping ratio, especially
on the video sequences with the high motion and complex texture characteristic and larger size change of the consecutive frame. 相似文献
992.
This paper presents a 2D to 3D conversion scheme to generate a 3D human model using a single depth image with several color
images. In building a complete 3D model, no prior knowledge such as a pre-computed scene structure and photometric and geometric
calibrations is required since the depth camera can directly acquire the calibrated geometric and color information in real
time. The proposed method deals with a self-occlusion problem which often occurs in images captured by a monocular camera.
When an image is obtained from a fixed view, it may not have data for a certain part of an object due to occlusion. The proposed
method consists of following steps to resolve this problem. First, the noise in a depth image is reduced by using a series
of image processing techniques. Second, a 3D mesh surface is constructed using the proposed depth image-based modeling method.
Third, the occlusion problem is resolved by removing the unwanted triangles in the occlusion region and filling the corresponding
hole. Finally, textures are extracted and mapped to the 3D surface of the model to provide photo-realistic appearance. Comparison
results with the related work demonstrate the efficiency of our method in terms of visual quality and computation time. It
can be utilized in creating 3D human models in many 3D applications. 相似文献
993.
Andy Gill Tristan Bull Andrew Farmer Garrin Kimmell Ed Komp 《Higher-Order and Symbolic Computation》2012,25(2-4):255-274
In this article we overview the design and implementation of the second generation of Kansas Lava. Driven by the needs and experiences of implementing telemetry decoders and other circuits, we have made a number of improvements to both the external API and the internal representations used. We have retained our dual shallow/deep representation of signals in general, but now have a number of externally visible abstractions for combinatorial and sequential circuits, and enabled signals. We introduce these abstractions, as well as our abstractions for reading and writing memory. Internally, we found the need to represent unknown values inside our circuits, so we made aggressive use of associated type families to lift our values to allow unknowns, in a principled and regular way. We discuss this design decision, how it unfortunately complicates the internals of Kansas Lava, and how we mitigate this complexity. Finally, when connecting Kansas Lava to the real world, the standardized idiom of using named input and output ports is provided by Kansas Lava using a new monad, called Fabric. We present the design of this Fabric monad, and illustrate its use in a small but complete example. 相似文献
994.
Intra coding in H.264/AVC can significantly improve the compression efficiency but at the cost of high computational complexity. To reduce the complexity, this paper presents an efficient block type decision algorithm for intra prediction. In H.264/AVC high profile, three kinds of block types are supported. This algorithm determines the optimal block type by two steps. The first step is based on the fact that the block type of intra prediction is highly dependent on the smoothness of macroblock. An edge-based feature is introduced to characterize the smoothness, by comparing it with two thresholds impossible block type is firstly filtered out. Then the second step is based on the correlation of block type chosen for different chroma modes. Experimental results show that the proposed fast algorithm can achieve 72.8% time saving on average for encoding the all intra-frame sequence with average 0.75% bit rate increase and 0.05dB PSNR degradation when comparing with the reference software. 相似文献
995.
The Web has evolved into a dominant digital medium for conducting many types of online transactions such as shopping, paying
bills, making travel plans, etc. Such transactions typically involve a number of steps spanning several Web pages. For sighted
users these steps are relatively straightforward to do with graphical Web browsers. But they pose tremendous challenges for
visually impaired individuals. This is because screen readers, the dominant assistive technology used by visually impaired
users, function by speaking out the screen’s content serially. Consequently, using them for conducting transactions can cause
considerable information overload. But usually one needs to browse only a small fragment of a Web page to do a step of a transaction
(e.g., choosing an item from a search results list). Based on this observation this paper presents a model-directed transaction
framework to identify, extract and aurally render only the “relevant” page fragments in each step of a transaction. The framework
uses a process model to encode the state of the transaction and a concept model to identify the page fragments relevant for
the transaction in that state. We also present algorithms to mine such models from click stream data generated by transactions
and experimental evidence of the practical effectiveness of our models in improving user experience when conducting online
transactions with non-visual modalities. 相似文献
996.
997.
SimRank has become an important similarity measure to rank web documents based on a graph model on hyperlinks. The existing
approaches for conducting SimRank computation adopt an iteration paradigm. The most efficient deterministic technique yields
O(n3)O\left(n^3\right) worst-case time per iteration with the space requirement O(n2)O\left(n^2\right), where n is the number of nodes (web documents). In this paper, we propose novel optimization techniques such that each iteration
takes O (min{ n ·m , nr })O \left(\min \left\{ n \cdot m , n^r \right\}\right) time and O ( n + m )O \left( n + m \right) space, where m is the number of edges in a web-graph model and r ≤ log2 7. In addition, we extend the similarity transition matrix to prevent random surfers getting stuck, and devise a pruning
technique to eliminate impractical similarities for each iteration. Moreover, we also develop a reordering technique combined
with an over-relaxation method, not only speeding up the convergence rate of the existing techniques, but achieving I/O efficiency
as well. We conduct extensive experiments on both synthetic and real data sets to demonstrate the efficiency and effectiveness
of our iteration techniques. 相似文献
998.
Wei-Lan Suo Bo Feng Zhi-Ping Fan 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2012,16(3):471-483
The decision making trial and evaluation laboratory (DEMATEL) method is a useful tool for analyzing correlations among factors
using crisp values. However, the crisp values are inadequate to model real-life situations due to the fuzziness and uncertainty
that are frequently involved in judgments of experts. The aim of this paper is to extend the DEMATEL method to an uncertain
linguistic environment. In this paper, the correlation information among factors provided by experts is in the form of uncertain
linguistic terms. A formula is first presented to transform correlation information from uncertain linguistic terms to trapezoidal
fuzzy numbers. Then, we aggregate the transformed correlation information of each expert into group information using the
operations of trapezoidal fuzzy numbers. The importance and classification of factors are determined via fuzzy matrix operations.
Furthermore, a causal diagram is constructed to vividly show the different roles of factors. Finally, an example is used to
illustrate the procedure of the proposed method. 相似文献
999.
In this paper, we propose a multi-agent learning system for the control of an intelligent robot, based on a model of the human
consciousnesses, including the ego. We pay attention to the intelligent learning processes of human beings. We try to give
a robot a high learning ability by modeling the roles of the human consciousnesses, including the ego. In most ordinary methods,
the instructions for learning are given from outside the system only. In the proposed method, the instructions are given not
only from outside, but also from inside (from other agents in the system). Therefore, the robot can learn efficiently because
it has more instructions than usual. The learning is also more flexible, since an agent learns by instructions from other
agents while the learning agent and one of the instructing agents exchange roles according to changes in the environment.
We experimentally verified that the proposed method is efficient by using an actual robot. 相似文献
1000.