全文获取类型
收费全文 | 2648篇 |
免费 | 195篇 |
国内免费 | 5篇 |
专业分类
电工技术 | 40篇 |
综合类 | 1篇 |
化学工业 | 667篇 |
金属工艺 | 51篇 |
机械仪表 | 46篇 |
建筑科学 | 68篇 |
矿业工程 | 4篇 |
能源动力 | 101篇 |
轻工业 | 245篇 |
水利工程 | 21篇 |
石油天然气 | 4篇 |
无线电 | 235篇 |
一般工业技术 | 551篇 |
冶金工业 | 187篇 |
原子能技术 | 18篇 |
自动化技术 | 609篇 |
出版年
2024年 | 4篇 |
2023年 | 39篇 |
2022年 | 64篇 |
2021年 | 114篇 |
2020年 | 86篇 |
2019年 | 77篇 |
2018年 | 80篇 |
2017年 | 85篇 |
2016年 | 109篇 |
2015年 | 96篇 |
2014年 | 124篇 |
2013年 | 172篇 |
2012年 | 204篇 |
2011年 | 236篇 |
2010年 | 172篇 |
2009年 | 157篇 |
2008年 | 157篇 |
2007年 | 130篇 |
2006年 | 132篇 |
2005年 | 80篇 |
2004年 | 73篇 |
2003年 | 61篇 |
2002年 | 45篇 |
2001年 | 30篇 |
2000年 | 24篇 |
1999年 | 27篇 |
1998年 | 63篇 |
1997年 | 39篇 |
1996年 | 23篇 |
1995年 | 15篇 |
1994年 | 18篇 |
1993年 | 21篇 |
1992年 | 5篇 |
1991年 | 16篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1987年 | 6篇 |
1986年 | 4篇 |
1985年 | 5篇 |
1984年 | 4篇 |
1983年 | 5篇 |
1982年 | 7篇 |
1981年 | 5篇 |
1980年 | 2篇 |
1979年 | 6篇 |
1977年 | 3篇 |
1976年 | 5篇 |
1975年 | 3篇 |
1971年 | 2篇 |
排序方式: 共有2848条查询结果,搜索用时 109 毫秒
91.
92.
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. 相似文献
93.
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 相似文献
94.
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: |
95.
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
相似文献
96.
This paper is devoted to estimation and numerical approximation of basins of attraction for a class of uncertain systems. We consider systems described by a differential equation depending of a disturbance known by its bounds. By using viability theory tools, we derive basins of attraction lower and upper estimates. We present numerical simulation results of the viability kernel algorithm to basin of attraction approximation problems. 相似文献
97.
Basic algorithms have been proposed in the field of low-power (Yao, F., et al. in Proceedings of lEEE annual foundations of
computer science, pp. 374–382, 1995) which compute the minimum energy-schedule for a set of non-recurrent tasks (or jobs) scheduled under EDF on a dynamically
variable voltage processor. In this study, we propose improvements upon existing algorithms with lower average and worst-case
complexities. They are based on a new EDF feasibility test that helps to identify the “critical intervals”. The complexity
of this feasibility test depends on structural characteristics of the set of jobs. More precisely, it depends on how tasks
are included one in the other. The first step of the algorithm is to construct the Hasse diagram of the set of tasks where
the partial order is defined by the inclusion relation on the tasks. Then, the algorithm constructs the shortest path in a
geometrical representation at each level of the Hasse diagram. The optimal processor speed is chosen according to the maximal
slope of each path.
相似文献
Nicolas NavetEmail: |
98.
Dos Santos A Thiers V Sar S Derian N Bensalem N Yilmaz F Bralet MP Ducot B Bréchot C Demaugre F 《Proteomics. Clinical applications》2007,1(6):545-554
Hepatocellular carcinoma (HCC) is a major cause of cancer worldwide. Proteomic studies provide opportunities to uncover targets for the diagnosis and treatment of this disease. However, in HCC developing in a setting of cirrhosis, the detection of proteome alterations may be hampered by the increased cellular heterogeneity of tissue when analysing global liver homogenates. The aim of this study was to evaluate whether the identification of proteome alterations in these HCC cases was improved when the differential protein profile between tumour and non-tumour areas of liver was determined using hepatocytes isolated by laser microdissection (LM). Differential profiles established with LM-hepatocytes and liver section homogenates using 2-DE and MS exhibited noticeable differences: 30% of the protein spots with deregulated expression in tumorous LM-samples did not display any modification in homogenates; conversely 15% of proteins altered in tumorous homogenates were not impaired in LM-hepatocytes. These alterations resulted from the presence in cirrhotic liver of fibrotic stroma which displayed a protein pattern different from that determined in LM-hepatocytes. In conclusion, our data demonstrate the interest of LM in distinguishing between fibrotic and hepatocyte proteome alterations and thus the benefit of LM to proteome studies of HCC developing in a context of cirrhosis. 相似文献
99.
100.