全文获取类型
收费全文 | 2563篇 |
免费 | 196篇 |
国内免费 | 5篇 |
专业分类
电工技术 | 37篇 |
综合类 | 1篇 |
化学工业 | 679篇 |
金属工艺 | 51篇 |
机械仪表 | 46篇 |
建筑科学 | 68篇 |
矿业工程 | 4篇 |
能源动力 | 90篇 |
轻工业 | 245篇 |
水利工程 | 21篇 |
石油天然气 | 2篇 |
无线电 | 230篇 |
一般工业技术 | 540篇 |
冶金工业 | 142篇 |
原子能技术 | 18篇 |
自动化技术 | 590篇 |
出版年
2024年 | 5篇 |
2023年 | 39篇 |
2022年 | 83篇 |
2021年 | 115篇 |
2020年 | 85篇 |
2019年 | 77篇 |
2018年 | 81篇 |
2017年 | 84篇 |
2016年 | 108篇 |
2015年 | 94篇 |
2014年 | 123篇 |
2013年 | 170篇 |
2012年 | 204篇 |
2011年 | 229篇 |
2010年 | 171篇 |
2009年 | 149篇 |
2008年 | 153篇 |
2007年 | 127篇 |
2006年 | 127篇 |
2005年 | 79篇 |
2004年 | 72篇 |
2003年 | 60篇 |
2002年 | 42篇 |
2001年 | 25篇 |
2000年 | 20篇 |
1999年 | 23篇 |
1998年 | 44篇 |
1997年 | 31篇 |
1996年 | 16篇 |
1995年 | 14篇 |
1994年 | 15篇 |
1993年 | 18篇 |
1992年 | 5篇 |
1991年 | 15篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1987年 | 6篇 |
1986年 | 4篇 |
1985年 | 5篇 |
1984年 | 4篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1979年 | 6篇 |
1977年 | 2篇 |
1975年 | 3篇 |
1971年 | 1篇 |
1967年 | 1篇 |
1931年 | 1篇 |
排序方式: 共有2764条查询结果,搜索用时 15 毫秒
81.
In this paper we explore the interest of computational intelligence tools in the management of heterogeneous communication networks, specifically to predict congestion, failures and other anomalies in the network that may eventually lead to degradation of the quality of offered services. We show two different applications based on neural and neuro-fuzzy systems for quality of service (QoS) management in next generation networks for voice and video service over heterogeneous Internet protocol (V2oIP) services. The two examples explained in this paper attempt to predict the communication network resources for new incoming calls, and visualizing the QoS of a communication network by means of self-organizing maps. 相似文献
82.
83.
84.
Papadakis N Bugeau A 《IEEE transactions on pattern analysis and machine intelligence》2011,33(1):144-157
This work presents a new method for tracking and segmenting along time-interacting objects within an image sequence. One major contribution of the paper is the formalization of the notion of visible and occluded parts. For each object, we aim at tracking these two parts. Assuming that the velocity of each object is driven by a dynamical law, predictions can be used to guide the successive estimations. Separating these predicted areas into good and bad parts with respect to the final segmentation and representing the objects with their visible and occluded parts permit handling partial and complete occlusions. To achieve this tracking, a label is assigned to each object and an energy function representing the multilabel problem is minimized via a graph cuts optimization. This energy contains terms based on image intensities which enable segmenting and regularizing the visible parts of the objects. It also includes terms dedicated to the management of the occluded and disappearing areas, which are defined on the areas of prediction of the objects. The results on several challenging sequences prove the strength of the proposed approach. 相似文献
85.
Nicolas HuberAuthor Vitae M.S. Hromalik-PouchetAuthor VitaeT.D. CarozziAuthor Vitae M.P. GoughAuthor VitaeA.M. BuckleyAuthor Vitae 《Microprocessors and Microsystems》2011,35(3):297-307
Recently, a serial implementation of the one-bit auto- and cross-correlation functions (ACF and CCF respectively) in a field programmable gate array (FPGA) has been developed, based on asynchronous delay elements and counters, known as the counterbased correlation. This paper proposes a method of parallelizing this otherwise serial process, offering significant improvements in the applicability of this approach to more types of ACF. Furthermore, the possibility of obtaining lag results from a parallel data sequence without first shifting the entire sequence has been realized, hence decreasing the number of clock cycles necessary for the calculation of the ACF. A synchronous design was preferred here for reasons of stability and portability, the technology of choice again being an FPGA. The advantages offered by the counterbased implementation in terms of device area usage and speed still apply. A practical implementation in the instrumentation of an upcoming space mission is also discussed. 相似文献
86.
87.
Since wavelets were introduced in the radiosity algorithm 5 , surprisingly little research has been devoted to higher order wavelets and their use in radiosity algorithms. A previous study 13 has shown that wavelet radiosity, and especially higher order wavelet radiosity was not bringing significant improvements over hierarchical radiosity and was having a very important extra memory cost, thus prohibiting any effective computation. In this paper, we present a new implementation of wavelets in the radiosity algorithm, that is substantially different from previous implementations in several key areas (refinement oracle, link storage, resolution algorithm). We show that, with this implementation, higher order wavelets are actually bringing an improvement over standard hierarchical radiosity and lower order wavelets. 相似文献
88.
Pierre Aubert Nicolas Di Césaré Olivier Pironneau 《Computing and Visualization in Science》2001,3(4):197-208
This work deals with an implementation of automatic differentiation of C++ computer programs in forward mode using operator overloading and expression templates. We report on the efficiency of such implementation and its obvious advantage : the ability to perform sensitivity analysis
without touching the source of the computer program by simply adding a library to it. We apply this tool to a flow control
problem : minimize the drag of a cylinder, in subsonic unsteady turbulent flow, by controlling the boundary condition of the
cylinder.
Received: 1 June 1999 / Accepted: 29 May 2000 相似文献
89.
Lounis Kessal Nicolas Abel Si Mahmoud Karabernou Didier Demigny 《Journal of Real-Time Image Processing》2008,3(3):131-147
Technology evolution makes possible the integration of heterogeneous components as programmable elements (processors), hardware
dedicated blocks, hierarchical memories and buses. Furthermore, an optimized reconfigurable logic core embedded within a System-on-Chip
will associate the performances of dedicated architecture and the flexibility of programmable ones. In order to increase performances,
some of the applications are carried out in hardware, using dynamically reconfigurable logic, rather than software, using
programmable elements. This approach offers a suitable hardware support to design malleable systems able to adapt themselves
to a specific application. This article makes a synthesis of the Ardoise project. The first objective of Ardoise project was
to design and to produce a dynamically reconfigurable platform based on commercial FPGAs. The concept of dynamically reconfigurable
architecture depends partially on new design methodologies elaboration as well as on the programming environment. The platform
architecture was designed to be suitable for real-time image processing. The article outlines mainly the Ardoise tools aspect:
development environment and real-time management of the hardware tasks. The proposed methodology is based on a dynamic management
of tasks according to an application scenario written using C++ language.
相似文献
Lounis KessalEmail: |
90.
We use Schnyder woods of 3-connected planar graphs to produce convex straight-line drawings
on a grid of size
The parameter
depends on the Schnyder wood used for the drawing. This parameter is in the range
The algorithm is a refinement of the face-counting algorithm; thus, in particular, the size of the grid is at most
The above bound on the grid size simultaneously matches or improves all previously known bounds for convex drawings, in particular
Schnyder's and the recent Zhang and He bound for triangulations and the Chrobak and Kant bound for 3-connected planar graphs.
The algorithm takes linear time. The drawing algorithm has been implemented and tested. The expected grid size for the drawing
of a random triangulation is close to
For a random 3-connected plane graph, tests show that the expected size of the drawing is
相似文献