全文获取类型
收费全文 | 6905篇 |
免费 | 192篇 |
国内免费 | 27篇 |
专业分类
电工技术 | 104篇 |
综合类 | 2篇 |
化学工业 | 1415篇 |
金属工艺 | 284篇 |
机械仪表 | 184篇 |
建筑科学 | 105篇 |
矿业工程 | 8篇 |
能源动力 | 311篇 |
轻工业 | 268篇 |
水利工程 | 56篇 |
石油天然气 | 14篇 |
无线电 | 979篇 |
一般工业技术 | 1493篇 |
冶金工业 | 861篇 |
原子能技术 | 72篇 |
自动化技术 | 968篇 |
出版年
2023年 | 70篇 |
2022年 | 141篇 |
2021年 | 173篇 |
2020年 | 155篇 |
2019年 | 145篇 |
2018年 | 230篇 |
2017年 | 188篇 |
2016年 | 194篇 |
2015年 | 108篇 |
2014年 | 209篇 |
2013年 | 399篇 |
2012年 | 222篇 |
2011年 | 303篇 |
2010年 | 232篇 |
2009年 | 276篇 |
2008年 | 245篇 |
2007年 | 199篇 |
2006年 | 207篇 |
2005年 | 153篇 |
2004年 | 127篇 |
2003年 | 129篇 |
2002年 | 129篇 |
2001年 | 126篇 |
2000年 | 129篇 |
1999年 | 112篇 |
1998年 | 264篇 |
1997年 | 182篇 |
1996年 | 131篇 |
1995年 | 130篇 |
1994年 | 104篇 |
1993年 | 133篇 |
1992年 | 108篇 |
1991年 | 97篇 |
1990年 | 84篇 |
1989年 | 75篇 |
1988年 | 72篇 |
1987年 | 75篇 |
1986年 | 88篇 |
1985年 | 106篇 |
1984年 | 99篇 |
1983年 | 95篇 |
1982年 | 78篇 |
1981年 | 63篇 |
1980年 | 49篇 |
1979年 | 46篇 |
1978年 | 49篇 |
1977年 | 62篇 |
1976年 | 82篇 |
1975年 | 43篇 |
1973年 | 42篇 |
排序方式: 共有7124条查询结果,搜索用时 0 毫秒
81.
Multi-stage molding is capable of producing better-quality articulated products at a lower cost. During the multi-stage molding process, assembly operations are performed along with the molding operations. Hence, it gives rise to a new type of planning problem. It is difficult to perform the planning manually because it involves evaluating large number of combinations and solving complex geometric reasoning problems. This paper investigates the problem of generating multi-stage molding plans for articulated assemblies. We present a planning framework that allows us to utilize constraints from experimentally proven molding plans. As a part of the planning problem, we determine the molding sequence and intermediate assembly configurations. We present algorithms for all the steps in the planning problem and characterize their computational complexities. Finally, we illustrate our approach with representative examples. 相似文献
82.
With the advent of multicores, multithreaded programming has acquired increased importance. In order to obtain good performance, the synchronization constructs in multithreaded programs need to be carefully implemented. These implementations can be broadly classified into two categories: busy–wait and schedule‐based. For shared memory architectures, busy–wait synchronizations are preferred over schedule‐based synchronizations because they can achieve lower wakeup latency, especially when the expected wait time is much shorter than the scheduling time. While busy–wait synchronizations can improve the performance of multithreaded programs running on multicore machines, they create a challenge in program debugging, especially in detecting and identifying the causes of data races. Although significant research has been done on data race detection, prior works rely on one important assumption—the debuggers are aware of all the synchronization operations performed during a program run. This assumption is a significant limitation as multithreaded programs, including the popular SPLASH‐2 benchmark have busy–wait synchronizations such as barriers and flag synchronizations implemented in the user code. We show that the lack of knowledge of these synchronization operations leads to unnecessary reporting of numerous races. To tackle this problem, we propose a dynamic technique for identifying user‐defined synchronizations that are performed during a program run. Both software and hardware implementations are presented. Furthermore, our technique can be easily exploited by a record/replay system to significantly speedup the replay. It can also be leveraged by a transactional memory system to effectively resolve a livelock situation. Our evaluation confirms that our synchronization detector is highly accurate with no false negatives and very few false positives. We further observe that the knowledge of synchronization operations results in 23% reduction in replay time. Finally, we show that using synchronization knowledge livelocks can be efficiently avoided during runtime monitoring of programs. Copyright © 2009 John Wiley & Sons, Ltd. 相似文献
83.
Santosh Ghosh Author Vitae Monjur Alam Author Vitae Author Vitae Indranil Sen Gupta Author Vitae 《Computers & Electrical Engineering》2009,35(2):329-338
All elliptic curve cryptographic schemes are based on scalar multiplication of points, and hence its faster computation signifies faster operation. This paper proposes two different parallelization techniques to speedup the GF(p) elliptic curve multiplication in affine coordinates and the corresponding architectures. The proposed implementations are capable of resisting different side channel attacks based on time and power analysis. The 160, 192, 224 and 256 bits implementations of both the architectures have been synthesized and simulated for both FPGA and 0.13μ CMOS ASIC. The final designs have been prototyped on a Xilinx Virtex-4 xc4vlx200-12ff1513 FPGA board and performance analyzes carried out. The experimental result and performance comparison show better throughput of the proposed implementations as compared to existing reported architectures. 相似文献
84.
Gupta Abhinav Kembhavi Aniruddha Davis Larry S. 《IEEE transactions on pattern analysis and machine intelligence》2009,31(10):1775-1789
Interpretation of images and videos containing humans interacting with different objects is a daunting task. It involves understanding scene/event, analyzing human movements, recognizing manipulable objects, and observing the effect of the human movement on those objects. While each of these perceptual tasks can be conducted independently, recognition rate improves when interactions between them are considered. Motivated by psychological studies of human perception, we present a Bayesian approach which integrates various perceptual tasks involved in understanding human-object interactions. Previous approaches to object and action recognition rely on static shape/appearance feature matching and motion analysis, respectively. Our approach goes beyond these traditional approaches and applies spatial and functional constraints on each of the perceptual elements for coherent semantic interpretation. Such constraints allow us to recognize objects and actions when the appearances are not discriminative enough. We also demonstrate the use of such constraints in recognition of actions from static images without using any motion information. 相似文献
85.
Mohammad Alshibli Ahmed El Sayed Elif Kongar Tarek M. Sobh Surendra M. Gupta 《Journal of Intelligent and Robotic Systems》2016,82(1):69-79
End-of-life disassembly has developed into a major research area within the sustainability paradigm, resulting in the emergence of several algorithms and structures proposing heuristics techniques such as Genetic Algorithm (GA), Ant Colony Optimization (ACO) and Neural Networks (NN). The performance of the proposed methodologies heavily depends on the accuracy and the flexibility of the algorithms to accommodate several factors such as preserving the precedence relationships during disassembly while obtaining near- optimal and optimal solutions. This paper improves a previously proposed Genetic Algorithm model for disassembly sequencing by utilizing a faster metaheuristic algorithm, Tabu search, to obtain the optimal solution. The objectives of the proposed algorithm are to minimize (1) the traveled distance by the robotic arm, (2) the number of disassembly method changes, and (3) the number of robotic arm travels by combining the identical-material components together and hence eliminating unnecessary disassembly operations. In addition to improving the quality of optimum sequence generation, a comprehensive statistical analysis comparing the previous Genetic Algorithm and the proposed Tabu Search Algorithm is also included 相似文献
86.
In this present work, we explore the hot carrier fidelity of gate electrode workfunction engineered silicon nanowire (GEWE-SiNW) MOSFET at 300 K using DEVEDIT-3D device editor and ATLAS device simulation software. TCAD simulation shows reduction in the hot carrier reliability of a GEWE SiNW MOSFET in terms of electron temperature, electron velocity and Hot Electron gate current for reflecting its efficacy in high power CMOS applications. Further, a comparative investigation for different values of oxide thickness and high-k has been done to analyze the performance of GEWE-SiNW MOSFET in terms of electrical parameters such as conduction band, DIBL, electric field, electron temperature, electric velocity and gate current. It has been clearly shown that with oxide thickness 0.5 nm the hot-carrier reliability and device performance improves in comparison to oxide thickness 2.5 nm. In addition, with k = 21(HfO2) device performance in terms of hot-carrier reliability further enhanced due to increased capacitance and thus offer its effectiveness in sub-nm range analog applications. 相似文献
87.
We study the problem of guaranteeing correct execution semantics in parallel implementations of logic programming languages in presence of built-in constructs that are sensitive to order
of execution. The declarative semantics of logic programming languages permit execution of various goals in any arbitrary
order (including in parallel). However, goals corresponding to extra-logical built-in constructs should respect the sequential
order of execution to ensure correct semantics. Ensuring this correctness in presence of such built-in constructs, while efficiently
exploiting maximum parallelism, is a difficult problem. In this paper, we propose a formalization of this problem in terms
of operations on dynamic trees. This abstraction enables us to: (i) show that existing schemes to handle order-sensitive computations used in current parallel
systems are sub-optimal; (ii) develop a novel, optimal scheme to handle order-sensitive goals that requires only a constant time overhead per operation. While we present our results in the context of logic programming, they will apply equally well to
most parallel non-deterministic systems.
Received: 20 April 1998 / 3 April 2000 相似文献
88.
Emergent semantics through interaction in image databases 总被引:9,自引:0,他引:9
Santini S. Gupta A. Jain R. 《Knowledge and Data Engineering, IEEE Transactions on》2001,13(3):337-351
In this paper, we briefly discuss some aspects of image semantics and the role that it plays for the design of image databases. We argue that images don't have an intrinsic meaning, but that they are endowed with a meaning by placing them in the context of other images and by the user interaction. From this observation, we conclude that, in an image, database users should be allowed to manipulate not only the individual images, but also the relation between them. We present an interface model based on the manipulation of configurations of images 相似文献
89.
90.
Towards the development of a virtual environment-based training system for mechanical assembly operations 总被引:2,自引:1,他引:1
John E. Brough Maxim Schwartz Satyandra K. Gupta Davinder K. Anand Robert Kavetsky Ralph Pettersen 《Virtual Reality》2007,11(4):189-206
In this paper, we discuss the development of Virtual Training Studio (VTS), a virtual environment-based training system that
allows training supervisors to create training instructions and allows trainees to learn assembly operations in a virtual
environment. Our system is mainly focused on the cognitive side of training so that trainees can learn to recognize parts,
remember assembly sequences, and correctly orient the parts during assembly operations. Our system enables users to train
using the following three training modes: (1) Interactive Simulation, (2) 3D Animation, and (3) Video. Implementing these
training modes required us to develop several new system features. This paper presents an overview of the VTS system and describes
a few main features of the system. We also report user test results that show how people train using our system. The user
test results indicate that the system is able to support a wide variety of training preferences and works well to support
training for assembly operations.
相似文献
Satyandra K. GuptaEmail: |