全文获取类型
收费全文 | 800篇 |
免费 | 42篇 |
国内免费 | 12篇 |
专业分类
电工技术 | 35篇 |
化学工业 | 176篇 |
金属工艺 | 15篇 |
机械仪表 | 28篇 |
建筑科学 | 9篇 |
矿业工程 | 1篇 |
能源动力 | 42篇 |
轻工业 | 41篇 |
水利工程 | 17篇 |
石油天然气 | 3篇 |
无线电 | 77篇 |
一般工业技术 | 165篇 |
冶金工业 | 71篇 |
自动化技术 | 174篇 |
出版年
2024年 | 3篇 |
2023年 | 15篇 |
2022年 | 30篇 |
2021年 | 35篇 |
2020年 | 29篇 |
2019年 | 32篇 |
2018年 | 40篇 |
2017年 | 33篇 |
2016年 | 37篇 |
2015年 | 38篇 |
2014年 | 33篇 |
2013年 | 66篇 |
2012年 | 43篇 |
2011年 | 45篇 |
2010年 | 46篇 |
2009年 | 47篇 |
2008年 | 29篇 |
2007年 | 23篇 |
2006年 | 21篇 |
2005年 | 18篇 |
2004年 | 13篇 |
2003年 | 16篇 |
2002年 | 18篇 |
2001年 | 15篇 |
2000年 | 11篇 |
1999年 | 11篇 |
1998年 | 12篇 |
1997年 | 16篇 |
1996年 | 12篇 |
1995年 | 6篇 |
1994年 | 6篇 |
1993年 | 5篇 |
1992年 | 2篇 |
1991年 | 5篇 |
1990年 | 3篇 |
1989年 | 5篇 |
1988年 | 4篇 |
1987年 | 2篇 |
1985年 | 1篇 |
1984年 | 5篇 |
1983年 | 1篇 |
1981年 | 4篇 |
1980年 | 3篇 |
1979年 | 5篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1974年 | 1篇 |
1970年 | 3篇 |
1969年 | 2篇 |
排序方式: 共有854条查询结果,搜索用时 562 毫秒
21.
Ganapati Panda Pyari Mohan Pradhan Babita Majhi 《Expert systems with applications》2011,38(10):12671-12683
Conventional derivative based learning rule poses stability problem when used in adaptive identification of infinite impulse response (IIR) systems. In addition the performance of these methods substantially deteriorates when reduced order adaptive models are used for such identification. In this paper the IIR system identification task is formulated as an optimization problem and a recently introduced cat swarm optimization (CSO) is used to develop a new population based learning rule for the model. Both actual and reduced order identification of few benchmarked IIR plants is carried out through simulation study. The results demonstrate superior identification performance of the new method compared to that achieved by genetic algorithm (GA) and particle swarm optimization (PSO) based identification. 相似文献
22.
23.
24.
It is a well known result in the vision literature that the motion of independently moving objects viewed by an affine camera lie on affine subspaces of dimension four or less. As a result a large number of the recently proposed motion segmentation algorithms model the problem as one of clustering the trajectory data to its corresponding affine subspace. While these algorithms are elegant in formulation and achieve near perfect results on benchmark datasets, they fail to address certain very key real-world challenges, including perspective effects and motion degeneracies. Within a robotics and autonomous vehicle setting, the relative configuration of the robot and moving object will frequently be degenerate leading to a failure of subspace clustering algorithms. On the other hand, while gestalt-inspired motion similarity algorithms have been used for motion segmentation, in the moving camera case, they tend to over-segment or under-segment the scene based on their parameter values. In this paper we present a principled approach that incorporates the strengths of both approaches into a cohesive motion segmentation algorithm capable of dealing with the degenerate cases, where camera motion follows that of the moving object. We first generate a set of prospective motion models for the various moving and stationary objects in the video sequence by a RANSAC-like procedure. Then, we incorporate affine and long-term gestalt-inspired motion similarity constraints, into a multi-label Markov Random Field (MRF). Its inference leads to an over-segmentation, where each label belongs to a particular moving object or the background. This is followed by a model selection step where we merge clusters based on a novel motion coherence constraint, we call in-frame shear, that tracks the in-frame change in orientation and distance between the clusters, leading to the final segmentation. This oversegmentation is deliberate and necessary, allowing us to assess the relative motion between the motion models which we believe to be essential in dealing with degenerate motion scenarios.We present results on the Hopkins-155 benchmark motion segmentation dataset [27], as well as several on-road scenes where camera and object motion are near identical. We show that our algorithm is competitive with the state-of-the-art algorithms on [27] and exceeds them substantially on the more realistic on-road sequences. 相似文献
25.
Singh Siddharth Rathore Vivek Singh Singh Rajiv 《Multimedia Tools and Applications》2017,76(3):3557-3575
Multimedia Tools and Applications - Medical image watermarking is a challenging area of research. High bandwidth, secure transmission of patient’s data among hospitals and hiding capacity are... 相似文献
26.
Soumya Priyadarsini Panda Ajit Kumar Nayak 《International Journal of Speech Technology》2017,20(4):959-976
Designing text-to-speech systems capable of producing natural sounding speech segments in different Indian languages is a challenging and ongoing problem. Due to the large number of possible pronunciations in different Indian languages, a number of speech segments are needed to be stored in the speech database while a concatenative speech synthesis technique is used to achieve highly natural speech segments. However, the large speech database size makes it unusable for small hand held devices or human computer interactive systems with limited storage resources. In this paper, we proposed a fraction-based waveform concatenation technique to produce intelligible speech segments from a small footprint speech database. The results of all the experiments performed shows the effectiveness of the proposed technique in producing intelligible speech segments in different Indian languages even with very less storage and computation overhead compared to the existing syllable-based technique. 相似文献
27.
Constructing plans that can handle multiple problem instances is a longstanding open problem in AI. We present a framework for generalized planning that captures the notion of algorithm-like plans and unifies various approaches developed for addressing this problem. Using this framework, and building on the TVLA system for static analysis of programs, we develop a novel approach for computing generalizations of classical plans by identifying sequences of actions that will make measurable progress when placed in a loop. In a wide class of problems that we characterize formally in the paper, these methods allow us to find generalized plans with loops for solving problem instances of unbounded sizes and also to determine the correctness and applicability of the computed generalized plans. We demonstrate the scope and scalability of the proposed approach on a wide range of planning problems. 相似文献
28.
Sundar N.S. Jayasimha D.N. Panda D.K. Sadayappan P. 《Parallel and Distributed Systems, IEEE Transactions on》2001,12(12):1201-1218
Parallel algorithms for several common problems such as sorting and the FFT involve a personalized exchange of data among all the processors. Past approaches to doing complete exchange have taken one of two broad approaches: direct exchange or the indirect message-combining approaches. While combining approaches reduce the number of message startups, direct exchange minimizes the volume of data transmitted. This paper presents a family of hybrid algorithms for wormhole-routed 2D meshes that can effectively utilize the complementary strengths of these two approaches to complete exchange. The performance of hybrid algorithms using Cyclic Exchange and Scott's Direct Exchange are studied using analytical models, simulation, and implementation on a Cray T3D system. The results show that hybrids achieve lower completion times than either pure algorithm for a range of mesh sizes, data block sizes, and message startup costs. It is also demonstrated that barriers may be used to enhance performance by reducing message contention, whether or not the target system provides hardware support for barrier synchronization. The analytical models are shown useful in selecting the optimum hybrid for any given combination of system parameters (mesh size, message startup time, flit transfer time, and barrier cost) and the problem parameter (data block size) 相似文献
29.
Manay S Cremers D Hong BW Yezzi AJ Soatto S 《IEEE transactions on pattern analysis and machine intelligence》2006,28(10):1602-1618
For shapes represented as closed planar contours, we introduce a class of functionals which are invariant with respect to the Euclidean group and which are obtained by performing integral operations. While such integral invariants enjoy some of the desirable properties of their differential counterparts, such as locality of computation (which allows matching under occlusions) and uniqueness of representation (asymptotically), they do not exhibit the noise sensitivity associated with differential quantities and, therefore, do not require presmoothing of the input shape. Our formulation allows the analysis of shapes at multiple scales. Based on integral invariants, we define a notion of distance between shapes. The proposed distance measure can be computed efficiently and allows warping the shape boundaries onto each other; its computation results in optimal point correspondence as an intermediate step. Numerical results on shape matching demonstrate that this framework can match shapes despite the deformation of subparts, missing parts and noise. As a quantitative analysis, we report matching scores for shape retrieval from a database. 相似文献
30.
This paper explores the suitability of the emerging passive star-coupled optical interconnection using wavelength division multiplexing as the system interconnect to provide high bandwidth (Gbits/sec) communication demanded by heterogeneous systems. Several different communication strategies (combinations of communication topologies and protocols) are investigated under a representative master-slave computational model. The interplay between system speed, network speed, task granularity, and degree of parallelism is studied using both analytical modeling and simulations. It is shown that a hierarchical ALOHA-based communication strategy between the master and the slaves, implemented on top of the passive star-coupled network, leads to a considerable reduction in channel contention and provides 50–80% reduction in task completion time for applications with medium to high degrees of coarse grain parallelism. Comparable reduction in channel contention is also shown to be achieved by using tunable acoustooptic filters at master nodes. 相似文献