全文获取类型
收费全文 | 4622篇 |
免费 | 487篇 |
国内免费 | 141篇 |
专业分类
电工技术 | 48篇 |
综合类 | 241篇 |
化学工业 | 2184篇 |
金属工艺 | 119篇 |
机械仪表 | 59篇 |
建筑科学 | 86篇 |
矿业工程 | 57篇 |
能源动力 | 27篇 |
轻工业 | 545篇 |
水利工程 | 5篇 |
石油天然气 | 139篇 |
武器工业 | 12篇 |
无线电 | 183篇 |
一般工业技术 | 382篇 |
冶金工业 | 112篇 |
原子能技术 | 44篇 |
自动化技术 | 1007篇 |
出版年
2024年 | 13篇 |
2023年 | 70篇 |
2022年 | 95篇 |
2021年 | 152篇 |
2020年 | 127篇 |
2019年 | 143篇 |
2018年 | 131篇 |
2017年 | 130篇 |
2016年 | 154篇 |
2015年 | 177篇 |
2014年 | 219篇 |
2013年 | 311篇 |
2012年 | 311篇 |
2011年 | 304篇 |
2010年 | 234篇 |
2009年 | 284篇 |
2008年 | 262篇 |
2007年 | 251篇 |
2006年 | 277篇 |
2005年 | 236篇 |
2004年 | 220篇 |
2003年 | 169篇 |
2002年 | 182篇 |
2001年 | 144篇 |
2000年 | 119篇 |
1999年 | 107篇 |
1998年 | 80篇 |
1997年 | 56篇 |
1996年 | 57篇 |
1995年 | 56篇 |
1994年 | 38篇 |
1993年 | 26篇 |
1992年 | 22篇 |
1991年 | 16篇 |
1990年 | 12篇 |
1989年 | 14篇 |
1988年 | 12篇 |
1987年 | 10篇 |
1986年 | 3篇 |
1985年 | 2篇 |
1984年 | 8篇 |
1983年 | 2篇 |
1979年 | 2篇 |
1976年 | 2篇 |
1971年 | 1篇 |
1964年 | 1篇 |
1963年 | 1篇 |
1959年 | 2篇 |
1956年 | 1篇 |
1955年 | 1篇 |
排序方式: 共有5250条查询结果,搜索用时 546 毫秒
101.
分形艺术图形是分形艺术最主要的表现形式之一,分形艺术图形的生成需要借助计算机,并通过数学模型和程序才能完成。文中主要利用牛顿迭代算法、特效处理算法和着色算法生成分形艺术图形,其中牛顿迭代算法是核心算法,为创作分形艺术图形提供素材;着色算法也是不可缺少的,为仓Ⅱ作分形艺术图形提供调色板,决定了生成的分形艺术图形的精美程度;特效处理算法是可选的,对分形艺术图形进行二次加工,也在一定程度上决定了分形艺术图形的精美程度。笔者利用Visual C++6.0开发工具编制了一个分形艺术图形生成软件,生成了大量绚丽多彩的分形艺术图形,这说明该算法是有效的。 相似文献
102.
Synthesis of Branched DNA Scaffolded Super‐Nanoclusters with Enhanced Antibacterial Performance
下载免费PDF全文
![点击此处可从《Small (Weinheim an der Bergstrasse, Germany)》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Lu Yang Chi Yao Feng Li Yuhang Dong Zhikun Zhang Dayong Yang 《Small (Weinheim an der Bergstrasse, Germany)》2018,14(16)
Metal nanoclusters (NCs) possess unique optical properties, and exhibit a wide variety of potential applications. DNA with robust molecular programmability is demonstrated as an ideal scaffold to regulate the formation of NCs, offering a rational approach to precisely tune the spatial structures of NCs. Herein, the first use of branched DNA as scaffold to regulate the formation of silver nanoclusters (super‐AgNC) is reported, in which the spatial structures are precisely designed and constructed. Super‐AgNC with tunable shapes and arm‐lengths including Y‐, X‐, and (Y–X)‐ shaped super‐AgNC is achieved. The molecular structures and optical properties of super‐AgNCs are systemically studied. As a proof of application, remarkably, super‐AgNCs exhibit superior antibacterial performance. In addition, super‐AgNCs show excellent biocompatibility with three types of tissue cells including 293T (human embryonic kidney cells), SMCs (vascular smooth muscle cells), and GLC‐82 (lung adenocarcinoma cells). These performances enable the super‐AgNCs adaptable in a variety of applications such as biosensing, bioimaging, and antibacterial agents. 相似文献
103.
Orphan detection in distributed systems is a well-researched field for which many solutions exist. These solutions exploit well defined parent-child relationships given in distributed systems. But they are not applicable in mobile agent systems, since no similar natural relationship between agents exist. Thus new protocols have to be developed. In this paper one such protocol for controlling mobile mobile agents and for orphan detection is presented. The shadow approach presented in this paper uses the idea of a placeholder (shadow) which is assigned by the agent system to each new agent. This defines an artificial relationship between agents and shadow. The shadow records the location of all dependent agents. Removing the root shadow implies that all dependent agents are declared orphan and are eventually be terminated. We introduce agent proxies that create a path from shadow to every agent. In an extension of the basic protocol we additionally allow the shadow to be mobile.The shadow approach can be used for termination of groups of agents even if the exact location of each single agent is not known. 相似文献
104.
105.
采用一种新合成的03#固化剂,可以使呋喃树脂在常温下缩短固化时间,并且在低温下可以固化.测试结果表明:在低温下呋喃树脂的固化性能、粘结强度和体积安定性均符合技术要求. 相似文献
106.
Jeremy Pitt Matthew Anderton Jim Cunningham 《Computer Supported Cooperative Work (CSCW)》1996,5(2-3):201-222
The CEC Project GOAL (Esprit 6283) aims to develop generic software tools to support a new project management paradigm, in which projects are collaborative, decentralised and inter-organizational. To support inter-organizational interaction, communication and cooperation, we are developing a design framework for formalizing the flow of information between organizations, specifying access to and provision of project services, and defining project-wide standards and procedures. This framework is based on normalizing interactions between autonomous software agents by specifying messages and protocols for inter-agent communication and cooperation. This paper reviews the framework, and then focusses on the specification and implementation of a case study, the automation of a distributed document review procedure. This is both a successful proof of concept and a demonstration of how Artificial Intelligence technologies can support inter-organizational project management. It also points the way to agent brokering, an enhancement of object brokering in distributed open systems, where the satisfaction of service requests can be subject to negotiation.Supported by CEC Esprit Project GOAL (Esprit 6283) and CEC Esprit BRA Medlar II (Esprit 6471).Supported by CEC Esprit Project GOAL (Esprit 6283). 相似文献
107.
Andrew Zemke 《Information Processing Letters》2010,110(22):979-985
A k-ranking of a graph is a labeling of the vertices with positive integers 1,2,…,k so that every path connecting two vertices with the same label contains a vertex of larger label. An optimal ranking is one in which k is minimized. Let Pn be a path with n vertices. A greedy algorithm can be used to successively label each vertex with the smallest possible label that preserves the ranking property. We seek to show that when a greedy algorithm is used to label the vertices successively from left to right, we obtain an optimal ranking. A greedy algorithm of this type was given by Bodlaender et al. in 1998 [1] which generates an optimal k-ranking of Pn. In this paper we investigate two generalizations of rankings. We first consider bounded (k,s)-rankings in which the number of times a label can be used is bounded by a predetermined integer s. We then consider kt-rankings where any path connecting two vertices with the same label contains t vertices with larger labels. We show for both generalizations that when G is a path, the analogous greedy algorithms generate optimal k-rankings. We then proceed to quantify the minimum number of labels that can be used in these rankings. We define the bounded rank number to be the smallest number of labels that can be used in a (k,s)-ranking and show for n?2, where i=⌊log2(s)⌋+1. We define the kt-rank number, to be the smallest number of labels that can be used in a kt-ranking. We present a recursive formula that gives the kt-rank numbers for paths, showing for all an−1<j?an where {an} is defined as follows: a1=1 and an=⌊((t+1)/t)an−1⌋+1. 相似文献
108.
109.
Daniel Cosmin Porumbel Jin-Kao Hao Pascale Kuntz 《Computers & Operations Research》2010,37(4):769-778
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, we introduce the following clustering hypothesis: the high quality solutions are not randomly scattered in the search space, but rather grouped in clusters within spheres of specific diameter. We first provide intuitive evidence for this hypothesis by presenting a projection of a large set of local minima in the 3D space. An experimental confirmation is also presented: we introduce two algorithms that exploit the hypothesis by guiding an underlying Tabu Search (TS) process. The first algorithm (TS-Div) uses a learning process to guide the basic TS process toward as-yet-unvisited spheres. The second algorithm (TS-Int) makes deep investigations within a bounded region by organizing it as a tree-like structure of connected spheres. We experimentally demonstrate that if such a region contains a global optimum, TS-Int does not fail in eventually finding it. This pair of algorithms significantly outperforms the underlying basic TS algorithm; it can even improve some of the best-known solutions ever reported in the literature (e.g. for dsjc1000.9). 相似文献
110.