全文获取类型
收费全文 | 926篇 |
免费 | 62篇 |
国内免费 | 2篇 |
专业分类
电工技术 | 3篇 |
综合类 | 2篇 |
化学工业 | 324篇 |
金属工艺 | 38篇 |
机械仪表 | 22篇 |
建筑科学 | 24篇 |
矿业工程 | 2篇 |
能源动力 | 41篇 |
轻工业 | 56篇 |
水利工程 | 5篇 |
石油天然气 | 2篇 |
无线电 | 70篇 |
一般工业技术 | 163篇 |
冶金工业 | 19篇 |
原子能技术 | 2篇 |
自动化技术 | 217篇 |
出版年
2023年 | 7篇 |
2022年 | 51篇 |
2021年 | 90篇 |
2020年 | 33篇 |
2019年 | 41篇 |
2018年 | 47篇 |
2017年 | 25篇 |
2016年 | 46篇 |
2015年 | 33篇 |
2014年 | 51篇 |
2013年 | 74篇 |
2012年 | 53篇 |
2011年 | 61篇 |
2010年 | 37篇 |
2009年 | 51篇 |
2008年 | 40篇 |
2007年 | 36篇 |
2006年 | 29篇 |
2005年 | 20篇 |
2004年 | 19篇 |
2003年 | 20篇 |
2002年 | 20篇 |
2001年 | 6篇 |
2000年 | 6篇 |
1999年 | 3篇 |
1998年 | 7篇 |
1997年 | 6篇 |
1996年 | 6篇 |
1995年 | 6篇 |
1994年 | 4篇 |
1993年 | 4篇 |
1992年 | 4篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 4篇 |
1988年 | 4篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 5篇 |
1984年 | 7篇 |
1983年 | 5篇 |
1982年 | 3篇 |
1981年 | 6篇 |
1980年 | 4篇 |
1979年 | 3篇 |
1977年 | 2篇 |
1968年 | 1篇 |
排序方式: 共有990条查询结果,搜索用时 0 毫秒
1.
Impossible and ambiguous shading patterns 总被引:2,自引:1,他引:1
Michael J. Brooks Wojciech Chojnacki Ryszard Kozera 《International Journal of Computer Vision》1992,7(2):119-126
A smooth object depicted in a monochrome image will often exhibit brightness variation, or shading. A problem much studied in computer vision has been that of how object shape may be recovered from image shading. When the imaging conditions are such that an overhead point-source illuminates a smooth Lambertian surface, the problem may be formulated as that of finding a solution to an eikonal equation. This article will focus on the existence and uniqueness of such solutions, reporting recent results obtained. With regard to existence, shading patterns are exhibited for which there is no corresponding object shape. Specifically, a necessary and sufficient condition is presented for a circularly symmetric eikonal equation to admit exclusively unbounded solutions; additionally, a sufficient condition is given for an eikonal equation to have no solution whatsoever. In connection with uniqueness, we consider eikonal equations, defined over a disc, such that the Euclidean norm of the gradient of any solution is circularly symmetric, vanishes exactly at the disc center, and diverges to infinity as the circumference of the disc is approached. Contrary to earlier influential work, a class of such eikonal equations is shown to possess simultaneously circularly symmetric and noncircularly symmetric bounded smooth solutions. 相似文献
2.
A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs
In recent years growing interest in local distributed algorithms has widely been observed. This results from their high resistance to errors and damage, as well as from their good performance, which is independent of the size of the network. A local deterministic distributed algorithm finding an approximation of a Minimum Dominating Set in planar graphs has been presented by Lenzen et al., and they proved that the algorithm returns a 130-approximation of the Minimum Dominating Set. In this article we will show that the algorithm is two times more effective than was previously assumed, and we prove that the algorithm by Lenzen et al. outputs a 52-approximation to a Minimum Dominating Set. Therefore the gap between the lower bound and the approximation ratio of the best yet local deterministic distributed algorithm is reduced by half. 相似文献
3.
Alternating-time temporal logic (ATL) is a modal logic that allows to reason about agents’ abilities in game-like scenarios. Semantic variants of ATL are usually built upon different assumptions about the kind of game that is played, including capabilities of agents (perfect vs. imperfect information, perfect vs. imperfect memory, etc.). ATL has been studied extensively in previous years; however, most of the research focused on model checking. Studies of other decision problems (e.g., satisfiability) and formal meta-properties of the logic (like axiomatization or expressivity) have been relatively scarce, and mostly limited to the basic variant of ATL where agents possess perfect information and perfect memory. In particular, a comparison between different semantic variants of the logic is largely left untouched. In this paper, we show that different semantics of ability in ATL give rise to different validity sets. The issue is important for several reasons. First, many logicians identify a logic with its set of true sentences. As a consequence, we prove that different notions of ability induce different strategic logics. Secondly, we show that different concepts of ability induce different general properties of games. Thirdly, the study can be seen as the first systematic step towards satisfiability-checking algorithms for ATL with imperfect information. We introduce sophisticated unfoldings of models and prove invariance results that are an important technical contribution to formal analysis of strategic logics. 相似文献
4.
Tomasz Kajdanowicz Wojciech Indyk Przemyslaw Kazienko 《Pattern Analysis & Applications》2014,17(4):739-746
The relational label propagation problem for large data sets using MapReduce programming model was considered in the paper. The method we propose estimates class probability in relational domain in the networks. The method was examined on large real telecommunication data set. The results indicated that it could be used successfully to classify networks’ nodes and, thanks to that, new offerings or tariffs might be proposed to customers who belong to other providers. Moreover, basic properties of relational label propagation were examined and reported. 相似文献
5.
Methanol adsorption and electro-oxidation on Pt-Rh alloys have been studied in aqueous 0.5 M H2SO4 for a broad range of alloy surface composition including the pure Pt and Rh metals. Adsorption results have been compared with equivalent data obtained for CO and CO2 adsorption on these alloys. Current densities of continuous methanol oxidation on Pt, Rh and a Pt-Rh alloy with optimum surface molar fraction of Rh have been measured.Although on the pure Pt and Rh metals the methanol adsorption products exhibit similar energetic stability, as judged from the peak potential of electro-desorption, on the Pt-Rh alloys, there is a lowering of the stability. Similar behavior is observed for the CO and CO2 adsorption products, however, the lowering for methanol is much less than for CO and CO2. In the case of methanol, the maximum lowering is obtained for a surface molar fraction of Rh equal to ca. 0.65 and it is the same alloy surface composition that results in maximum lowering of the stability of the CO2 adsorption products, but not of the CO adsorption products (optimal fraction of Rh equal ca. 0.10). Structural similarity of the methanol and the CO2 adsorption products finds support in similar values of the electrons-per-site parameter obtained.Pt-Rh alloys show insufficient electrode potential improvement over Pt in continuous methanol electro-oxidation due to the susceptibility of Rh to strong poisoning by the methanol adsorption products, which switches off the bi-functional mechanism of methanol electro-oxidation on this alloy. The presence of Rh in the alloy with Pt additionally strongly lowers the methanol electro-oxidation turnover rate of the Pt component. 相似文献
6.
Ciesielczyk Tomasz Cabrera Alberto Oleksiak Ariel Piątek Wojciech Waligóra Grzegorz Almeida Francisco Blanco Vicente 《Journal of Scheduling》2021,24(5):489-505
Journal of Scheduling - Rapid growth of demand for remote computational power, along with high energy costs and infrastructure limits, has led to treating power usage as a primary constraint in... 相似文献
7.
Ewa Talik Marie-Emilie Lucas Wojciech Suski R. Tro 《Journal of Alloys and Compounds》2003,350(1-2):72-76
The XPS electronic structures of the AFe4Al8 (A=Sc, Y, U, Th) single crystals were measured. The valence band of UFe4Al8 exhibits domination of the U 5f states at the Fermi level, while for the other AFe4Al8 compounds the valence states are shifted by 0.5 eV toward higher binding energy. The multiplet structure of the U 4f and Th 4f states was analyzed in comparison with the U 4f states of U3Ge5 and UNiSb2. 相似文献
8.
Wojciech Chmiel Jacek Dańda Andrzej Dziech Sebastian Ernst Piotr Kadłuczka Zbigniew Mikrut Piotr Pawlik Piotr Szwed Igor Wojnicki 《Multimedia Tools and Applications》2016,75(17):10529-10560
Intelligent Transportation Systems (ITS) aim to improve safety, mobility and environmental performance of road transport. The INSIGMA project provides a fresh look at the possible innovations in this field, by enhancing the functionality and accuracy of ITS in urban environments. This paper describes the architecture, sensors, processing algorithms, output modules and advantages of the developed system. A comparison of existing ITS systems has been provided as background. Special attention has been given to performance and privacy issues, as the system includes social aspects such as location monitoring. 相似文献
9.
Peter Mühlfellner Mathias Bürki Michael Bosse Wojciech Derendarz Roland Philippsen Paul Furgale 《野外机器人技术杂志》2016,33(5):561-590
Robots that use vision for localization need to handle environments that are subject to seasonal and structural change, and operate under changing lighting and weather conditions. We present a framework for lifelong localization and mapping designed to provide robust and metrically accurate online localization in these kinds of changing environments. Our system iterates between offline map building, map summary, and online localization. The offline mapping fuses data from multiple visually varied datasets, thus dealing with changing environments by incorporating new information. Before passing these data to the online localization system, the map is summarized, selecting only the landmarks that are deemed useful for localization. This Summary Map enables online localization that is accurate and robust to the variation of visual information in natural environments while still being computationally efficient. We present a number of summary policies for selecting useful features for localization from the multisession map, and we explore the tradeoff between localization performance and computational complexity. The system is evaluated on 77 recordings, with a total length of 30 kilometers, collected outdoors over 16 months. These datasets cover all seasons, various times of day, and changing weather such as sunshine, rain, fog, and snow. We show that it is possible to build consistent maps that span data collected over an entire year, and cover day‐to‐night transitions. Simple statistics computed on landmark observations are enough to produce a Summary Map that enables robust and accurate localization over a wide range of seasonal, lighting, and weather conditions. 相似文献
10.
Henning Zimmer Fabrice Rousselle Wenzel Jakob Oliver Wang David Adler Wojciech Jarosz Olga Sorkine‐Hornung Alexander Sorkine‐Hornung 《Computer Graphics Forum》2015,34(4):131-142
Renderings of animation sequences with physics‐based Monte Carlo light transport simulations are exceedingly costly to generate frame‐by‐frame, yet much of this computation is highly redundant due to the strong coherence in space, time and among samples. A promising approach pursued in prior work entails subsampling the sequence in space, time, and number of samples, followed by image‐based spatio‐temporal upsampling and denoising. These methods can provide significant performance gains, though major issues remain: firstly, in a multiple scattering simulation, the final pixel color is the composite of many different light transport phenomena, and this conflicting information causes artifacts in image‐based methods. Secondly, motion vectors are needed to establish correspondence between the pixels in different frames, but it is unclear how to obtain them for most kinds of light paths (e.g. an object seen through a curved glass panel). To reduce these ambiguities, we propose a general decomposition framework, where the final pixel color is separated into components corresponding to disjoint subsets of the space of light paths. Each component is accompanied by motion vectors and other auxiliary features such as reflectance and surface normals. The motion vectors of specular paths are computed using a temporal extension of manifold exploration and the remaining components use a specialized variant of optical flow. Our experiments show that this decomposition leads to significant improvements in three image‐based applications: denoising, spatial upsampling, and temporal interpolation. 相似文献