全文获取类型
收费全文 | 1189篇 |
免费 | 98篇 |
国内免费 | 1篇 |
专业分类
电工技术 | 6篇 |
综合类 | 2篇 |
化学工业 | 262篇 |
金属工艺 | 25篇 |
机械仪表 | 32篇 |
建筑科学 | 40篇 |
矿业工程 | 4篇 |
能源动力 | 58篇 |
轻工业 | 111篇 |
水利工程 | 10篇 |
石油天然气 | 3篇 |
无线电 | 120篇 |
一般工业技术 | 266篇 |
冶金工业 | 78篇 |
原子能技术 | 11篇 |
自动化技术 | 260篇 |
出版年
2023年 | 22篇 |
2022年 | 33篇 |
2021年 | 52篇 |
2020年 | 45篇 |
2019年 | 41篇 |
2018年 | 49篇 |
2017年 | 52篇 |
2016年 | 55篇 |
2015年 | 42篇 |
2014年 | 72篇 |
2013年 | 79篇 |
2012年 | 92篇 |
2011年 | 123篇 |
2010年 | 68篇 |
2009年 | 60篇 |
2008年 | 62篇 |
2007年 | 62篇 |
2006年 | 44篇 |
2005年 | 37篇 |
2004年 | 26篇 |
2003年 | 21篇 |
2002年 | 18篇 |
2001年 | 7篇 |
2000年 | 14篇 |
1999年 | 16篇 |
1998年 | 20篇 |
1997年 | 14篇 |
1996年 | 11篇 |
1995年 | 4篇 |
1994年 | 5篇 |
1992年 | 4篇 |
1991年 | 4篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 4篇 |
1987年 | 2篇 |
1986年 | 5篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1977年 | 6篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1974年 | 1篇 |
1973年 | 1篇 |
1972年 | 1篇 |
排序方式: 共有1288条查询结果,搜索用时 62 毫秒
31.
The idea of decomposed software pipelining is to decouple the software pipelining problem into a cyclic scheduling problem without resource constraints and an acyclic scheduling problem with resource constraints. In terms of loop transformation and code motion, the technique can be formulated as a combination of loop shifting and loop compaction. Loop shifting amounts to moving statements between iterations thereby changing some loop independent dependences into loop carried dependences and vice versa. Then, loop compaction schedules the body of the loop considering only loop independent dependences, but taking into account the details of the target architecture. In this paper, we show how loop shifting can be optimized so as to minimize both the length of the critical path and the number of dependences for loop compaction. The first problem is well-known and can be solved by an algorithm due to Leiserson and Saxe. We show that the second optimization (and the combination with the first one) is also polynomially solvable with a fast graph algorithm, variant of minimum-cost flow algorithms. Finally, we analyze the improvements obtained on loop compaction by experiments on random graphs. 相似文献
32.
Malicious software and other attacks are a major concern in the computing ecosystem and there is a need to go beyond the answers
based on untrusted software. Trusted and secure computing can add a new hardware dimension to software protection. Several
secure computing hardware architectures using memory encryption and memory integrity checkers have been proposed during the
past few years to provide applications with a tamper resistant environment. Some solutions, such as HIDE, have also been proposed
to solve the problem of information leakage on the address bus. We propose the CRYPTOPAGE architecture which implements memory encryption, memory integrity protection checking and information leakage protection
together with a low performance penalty (3% slowdown on average) by combining the Counter Mode of operation, local authentication
values and MERKLE trees. It has also several other security features such as attestation, secure storage for applications and program identification.
We present some applications of the CRYPTOPAGE architecture in the computer virology field as a proof of concept of improving security in presence of viruses compared to
software only solutions. 相似文献
33.
Franco Raimondi Charles Pecheur Guillaume Brat 《Electronic Notes in Theoretical Computer Science》2007,190(2):113
We address the problem of verifying planning domains as used in model-based planning, for example in space missions. We propose a methodology for testing flight rules of planning domains which is self-contained, in the sense that flight rules are verified using a planner and no external tools are required. We review and analyse coverage conditions for requirements-based testing, and we reason in detail on "Unique First Cause" (UFC) coverage for test suites. We characterise flight rules using patterns, encoded using LTL, and we provide UFC coverage for them. We then present a translation of LTL formulae into planning goals, and illustrate our approach on a case study. 相似文献
34.
35.
This paper examines some aspects of the usefulness of interactive tabletop systems, if and how these impact collaboration. We chose creative problem solving such as brainstorming as an application framework to test several collaborative media: the use of pen-and-paper tools, the “around-the-table” form factor, the digital tabletop interface, the attractiveness of interaction styles. Eighty subjects in total (20 groups of four members) participated in the experiments. The evaluation criteria were task performance, collaboration patterns (especially equity of contributions), and users’ subjective experience. The “around-the-table” form factor, which is hypothesized to promote social comparison, increased performance and improved collaboration through an increase of equity. Moreover, the attractiveness of the tabletop device improved subjective experience and increased motivation to engage in the task. However, designing attractiveness seems a highly challenging issue, since overly attractive interfaces may distract users from the task. 相似文献
36.
Guillaume Caron El Mustapha Mouaddib Eric Marchand 《Robotics and Autonomous Systems》2012,60(8):1056-1068
The current work addresses the problem of 3D model tracking in the context of monocular and stereo omnidirectional vision in order to estimate the camera pose. To this end, we track 3D objects modeled by line segments because the straight line feature is often used to model the environment. Indeed, we are interested in mobile robot navigation using omnidirectional vision in structured environments. In the case of omnidirectional vision, 3D straight lines are projected as conics in omnidirectional images. Under certain conditions, these conics may have singularities.In this paper, we present two contributions. We, first, propose a new spherical formulation of the pose estimation withdrawing singularities, using an object model composed of lines. The theoretical formulation and the validation on synthetic images thus show that the new formulation clearly outperforms the former image plane one. The second contribution is the extension of the spherical representation to the stereovision case. We consider in the paper a sensor which combines a camera and four mirrors. Results in various situations show the robustness to illumination changes and local mistracking. As a final result, the proposed new stereo spherical formulation allows us to localize online a robot indoor and outdoor whereas the classical formulation fails. 相似文献
37.
Methane calibration burner and C‐factor determination with cone calorimeter – validation of the standardized calibration protocol
下载免费PDF全文
![点击此处可从《火与材料》网站下载免费的PDF全文](/ch/ext_images/free.gif)
The cone calorimeter is one of the major fire tests. In its reference standard ISO 5660‐1, the apparatus (and especially a characteristic of its orifice plate mass flow meter, called C‐Factor) is calibrated using a methane burner set at 5 kW. However, measurements performed in end‐use are in the range 1–10 kW. In addition, standard proposes to check linearity at 1 and 3 kW, which means in the lowest part of the range. This communication establishes the validation of the linearity on the whole range and determines the optimal condition for C‐factor determination. It justifies the technical choices of the standard. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
38.
Guillaume Cabanac 《Scientometrics》2013,96(1):1-9
Schubert introduced the partnership ability φ-index relying on a researcher’s number of co-authors and collaboration rate. As a Hirsch-type index, φ was expected to be consistent with Schubert–Glänzel’s model of h-index. Schubert demonstrated this relationship with the 34 awardees of the Hevesy medal in the field of nuclear and radiochemistry (r 2 = 0.8484). In this paper, we upscale this study by testing the φ-index on a million researchers in computer science. We found that the Schubert–Glänzel’s model correlates with the million empirical φ values (r 2 = 0.8695). In addition, machine learning through symbolic regression produces models whose accuracy does not exceed a 6.1 % gain (r 2 = 0.9227). These results suggest that the Schubert–Glänzel’s model of φ-index is accurate and robust on the domain-wide bibliographic dataset of computer science. 相似文献
39.
40.