全文获取类型
收费全文 | 342篇 |
免费 | 23篇 |
专业分类
电工技术 | 3篇 |
综合类 | 1篇 |
化学工业 | 67篇 |
金属工艺 | 7篇 |
机械仪表 | 2篇 |
建筑科学 | 12篇 |
能源动力 | 2篇 |
轻工业 | 78篇 |
水利工程 | 1篇 |
石油天然气 | 1篇 |
无线电 | 10篇 |
一般工业技术 | 54篇 |
冶金工业 | 96篇 |
原子能技术 | 1篇 |
自动化技术 | 30篇 |
出版年
2024年 | 1篇 |
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 18篇 |
2020年 | 8篇 |
2019年 | 2篇 |
2018年 | 16篇 |
2017年 | 9篇 |
2016年 | 14篇 |
2015年 | 7篇 |
2014年 | 10篇 |
2013年 | 17篇 |
2012年 | 19篇 |
2011年 | 15篇 |
2010年 | 12篇 |
2009年 | 12篇 |
2008年 | 11篇 |
2007年 | 11篇 |
2006年 | 11篇 |
2005年 | 10篇 |
2004年 | 5篇 |
2003年 | 6篇 |
2002年 | 8篇 |
2001年 | 8篇 |
2000年 | 5篇 |
1999年 | 11篇 |
1998年 | 34篇 |
1997年 | 20篇 |
1996年 | 12篇 |
1995年 | 4篇 |
1994年 | 6篇 |
1993年 | 6篇 |
1992年 | 2篇 |
1990年 | 1篇 |
1989年 | 4篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1976年 | 5篇 |
1974年 | 1篇 |
1973年 | 1篇 |
1972年 | 2篇 |
1959年 | 1篇 |
排序方式: 共有365条查询结果,搜索用时 15 毫秒
1.
Annette L. West Louise V. Michaelson Elizabeth A. Miles Richard P. Haslam Karen A. Lillycrop Ramona Georgescu Lihua Han Johnathan A. Napier Philip C. Calder Graham C. Burdge 《Lipids》2021,56(2):229-242
The phospholipid composition of lipoproteins is determined by the specificity of hepatic phospholipid biosynthesis. Plasma phospholipid 20:4n-6 and 22:6n-3 concentrations are higher in women than in men. We used this sex difference in a lipidomics analysis of the impact of endocrine factors on the phospholipid class and molecular species composition of fasting plasma from young men and women. Diester species predominated in all lipid classes measured. 20/54 Phosphatidylcholine (PtdCho) species were alkyl ester, 15/48 phosphatidylethanolamine (PtdEtn) species were alkyl ester, and 12/48 PtdEtn species were alkenyl ester. There were no significant differences between sexes in the proportions of alkyl PtdCho species. The proportion of alkyl ester PtdEtn species was greater in women than men, while the proportion of alkenyl ester PtdEtn species was greater in men than women. None of the phosphatidylinositol (PtdIns) or phosphatidylserine (PtdSer) molecular species contained ether-linked fatty acids. The proportion of PtdCho16:0_22:6, and the proportions of PtdEtn O-16:0_20:4 and PtdEtn O-18:2_20:4 were greater in women than men. There were no sex differences in PtdIns and PtdSer molecular species compositions. These findings show that plasma phospholipids can be modified by sex. Such differences in lipoprotein phospholipid composition could contribute to sexual dimorphism in patterns of health and disease. 相似文献
2.
3.
4.
We describe how the tree identification phase of the IEEE 1394 high-performance serial bus (FireWire) protocol is modelled
in Promela and verified using SPIN. The verification of arbitrary system configurations is discussed.
Received July 2001/Accepted in revised form November 2002
Correspondence and offprint requests to: Alice Miller, Department of Computing Science, University of Glasgow, 17 Lilybank Gardens, Glasgow G12 8QQ, UK. Email: alice@dcs.gla.ac.uk 相似文献
5.
Soledad Escolar Díaz Florin Isaila Alejandro Calderón Mateos Luis Miguel Sanchez García David E. Singh 《The Journal of supercomputing》2010,51(1):76-93
In the last years the Wireless Sensor Networks’ (WSN) technology has been increasingly employed in various application domains.
The extensive use of WSN posed new challenges in terms of both scalability and reliability. This paper proposes Sensor Node
File System (SENFIS), a novel file system for sensor nodes, which addresses both scalability and reliability concerns. SENFIS
can be mainly used in two broad scenarios. First, it can transparently be employed as a permanent storage for distributed
TinyDB queries, in order to increase the reliability and scalability. Second, it can be directly used by a WSN application
for permanent storage of data on the WSN nodes. The experimental section shows that SENFIS implementation makes an efficient
use of resources in terms of energy consumption, memory footprint, flash wear levelling, while achieving execution times similarly
with existing WSN file systems. 相似文献
6.
We study the use of high-order Sobolev gradients for PDE-based image smoothing and sharpening, extending our previous work
on this problem. In particular, we study the gradient descent equation on the heat equation energy functional obtained by
modifying the usual metric on the space of images, which is the L
2 metric, to a weighted H
k
Sobolev metric. We present existence and uniqueness results which show that the Sobolev diffusion PDE are well-posed both
in the forward and backward direction. Furthermore, we perform a Fourier analysis on the scale space generated by the Sobolev
PDE and show that as the order of the Sobolev metric tends to infinity, the Sobolev gradients converge to a Gaussian smoothed
L
2 gradient. We then present experimental results which exploit the theoretical stability results by applying the various Sobolev
gradient flows in the backward direction for image sharpening effects. Furthermore, we show that as the Sobolev order is increased,
the sharpening effects become more global in nature and more immune to noise. 相似文献
7.
Calder Phillips-Grafflin Halit Bener Suay Jim Mainprice Nicholas Alunni Daniel Lofaro Dmitry Berenson Sonia Chernova Robert W. Lindeman Paul Oh 《Journal of Intelligent and Robotic Systems》2016,82(3-4):341-361
In this paper, we present our system design, operational procedure, testing process, field results, and lessons learned for the valve-turning task of the DARPA Robotics Challenge (DRC). We present a software framework for cooperative traded control that enables a team of operators to control a remote humanoid robot over an unreliable communication link. Our system, composed of software modules running on-board the robot and on a remote workstation, allows the operators to specify the manipulation task in a straightforward manner. In addition, we have defined an operational procedure for the operators to manage the teleoperation task, designed to improve situation awareness and expedite task completion. Our testing process, consisting of hands-on intensive testing, remote testing, and remote practice runs , demonstrates that our framework is able to perform reliably and is resilient to unreliable network conditions. We analyze our approach, field tests, and experience at the DRC Trials and discuss lessons learned which may be useful for others when designing similar systems. 相似文献
8.
Lori Carter Beth Simon Brad Calder Larry Carter Jeanne Ferrante 《International journal of parallel programming》2000,28(6):563-588
Increases in instruction level parallelism are needed to exploit the potential parallelism available in future wide issue architectures. Predicated execution is an architectural mechanism that increases instruction level parallelism by removing branches and allowing simultaneous execution of multiple paths of control, only committing instructions from the correct path. In order for the compiler to expose and use such parallelism, traditional compiler data-flow and path analysis needs to be extended to predicated code. In this paper, we motivate the need for renaming and for predicates that reflect path information. We present Predicated Static Single Assignment (PSSA) which uses renaming and introduces Full -Path Predicates to remove false dependences and enable aggressive predicated optimization and instruction scheduling. We demonstrate the usefulness of PSSA for Predicated Speculation and Control Height Reduction. These two predicated code optimizations used during instruction scheduling reduce the dependence length of the critical paths through a predicated region. Our results show that using PSSA to enable speculation and control height reduction reduces execution time from 12 to 68%. 相似文献
9.
The execution model for mobile, dynamically‐linked, object‐oriented programs has evolved from fast interpretation to a mix of interpreted and dynamically compiled execution. The primary motivation for dynamic compilation is that compiled code executes significantly faster than interpreted code. However, dynamic compilation, which is performed while the application is running, introduces execution delay. In this paper we present two dynamic compilation techniques that enable high performance execution while reducing the effect of this compilation overhead. These techniques can be classified as (1) decreasing the amount of compilation performed, and (2) overlapping compilation with execution. We first present and evaluate lazy compilation, an approach used in most dynamic compilation systems in which individual methods are compiled on‐demand upon their first invocation. This is in contrast to eager compilation, in which all methods in a class are compiled when a new class is loaded. In this work, we describe our experience with eager compilation, as well as the implementation and transition to lazy compilation. We empirically detail the effectiveness of this decision. Our experimental results using the SpecJVM Java benchmarks and the Jalapeño JVM show that, compared to eager compilation, lazy compilation results in 57% fewer methods being compiled and reductions in total time of 14 to 26%. Total time in this context is compilation plus execution time. Next, we present profile‐driven, background compilation, a technique that augments lazy compilation by using idle cycles in multiprocessor systems to overlap compilation with application execution. With this approach, compilation occurs on a thread separate from that of application threads so as to reduce intermittent, and possibly substantial, delay in execution. Profile information is used to prioritize methods as candidates for background compilation. Methods are compiled according to this priority scheme so that performance‐critical methods are invoked using optimized code as soon as possible. Our results indicate that background compilation can achieve the performance of off‐line compiled applications and masks almost all compilation overhead. We show significant reductions in total time of 14 to 71% over lazy compilation. Copyright © 2001 John Wiley & Sons, Ltd. 相似文献
10.
Rosa Filgueira Jesús Carretero David E. Singh Alejandro Calderón Alberto Núñez 《The Journal of supercomputing》2012,59(1):361-391
This work presents an optimization of MPI communications, called Dynamic-CoMPI, which uses two techniques in order to reduce the impact of communications and non-contiguous I/O requests in parallel applications.
These techniques are independent of the application and complementaries to each other. The first technique is an optimization
of the Two-Phase collective I/O technique from ROMIO, called Locality aware strategy for Two-Phase I/O (LA-Two-Phase I/O). In order to increase the locality of the file accesses, LA-Two-Phase I/O employs the Linear Assignment Problem (LAP) for finding an optimal I/O data communication schedule. The main purpose of this
technique is the reduction of the number of communications involved in the I/O collective operation. The second technique,
called Adaptive-CoMPI, is based on run-time compression of MPI messages exchanged by applications. Both techniques can be applied on every application,
because both of them are transparent for the users. Dynamic-CoMPI has been validated by using several MPI benchmarks and real HPC applications. The results show that, for many of the considered
scenarios, important reductions in the execution time are achieved by reducing the size and the number of the messages. Additional
benefits of our approach are the reduction of the total communication time and the network contention, thus enhancing, not
only performance, but also scalability. 相似文献