全文获取类型
收费全文 | 3579篇 |
免费 | 212篇 |
国内免费 | 3篇 |
专业分类
电工技术 | 55篇 |
综合类 | 2篇 |
化学工业 | 602篇 |
金属工艺 | 71篇 |
机械仪表 | 43篇 |
建筑科学 | 232篇 |
矿业工程 | 27篇 |
能源动力 | 88篇 |
轻工业 | 439篇 |
水利工程 | 27篇 |
石油天然气 | 17篇 |
无线电 | 309篇 |
一般工业技术 | 576篇 |
冶金工业 | 434篇 |
原子能技术 | 30篇 |
自动化技术 | 842篇 |
出版年
2023年 | 36篇 |
2022年 | 33篇 |
2021年 | 104篇 |
2020年 | 73篇 |
2019年 | 105篇 |
2018年 | 132篇 |
2017年 | 118篇 |
2016年 | 152篇 |
2015年 | 113篇 |
2014年 | 153篇 |
2013年 | 245篇 |
2012年 | 209篇 |
2011年 | 238篇 |
2010年 | 178篇 |
2009年 | 175篇 |
2008年 | 205篇 |
2007年 | 181篇 |
2006年 | 156篇 |
2005年 | 127篇 |
2004年 | 122篇 |
2003年 | 89篇 |
2002年 | 114篇 |
2001年 | 44篇 |
2000年 | 47篇 |
1999年 | 44篇 |
1998年 | 73篇 |
1997年 | 55篇 |
1996年 | 51篇 |
1995年 | 34篇 |
1994年 | 38篇 |
1993年 | 33篇 |
1992年 | 30篇 |
1991年 | 24篇 |
1990年 | 24篇 |
1989年 | 25篇 |
1988年 | 9篇 |
1987年 | 19篇 |
1986年 | 18篇 |
1985年 | 20篇 |
1984年 | 29篇 |
1983年 | 14篇 |
1982年 | 13篇 |
1981年 | 11篇 |
1980年 | 15篇 |
1979年 | 12篇 |
1977年 | 7篇 |
1976年 | 10篇 |
1975年 | 8篇 |
1974年 | 6篇 |
1973年 | 6篇 |
排序方式: 共有3794条查询结果,搜索用时 31 毫秒
101.
102.
103.
104.
We consider broadcasting in random d-regular graphs by using a simple modification of the random phone call model introduced by Karp et al. (Proceedings of the FOCS ’00, 2000). In the phone call model, in every time step, each node calls a randomly chosen neighbour to establish a communication channel to this node. The communication channels can then be used bi-directionally to transmit messages. We show that, if we allow every node to choose four distinct neighbours instead of one, then the average number of message transmissions per node required to broadcast a message efficiently decreases exponentially. Formally, we present an algorithm that has time complexity \(O(\log n)\) and uses \(O(n\log \log n)\) transmissions per message. In contrast, we show for the standard model that every distributed algorithm in a restricted address-oblivious model that broadcasts a message in time \(O(\log n)\) requires \(\Omega (n \log n{/} \log d)\) message transmissions. Our algorithm efficiently handles limited communication failures, only requires rough estimates of the number of nodes, and is robust against limited changes in the size of the network. Our results have applications in peer-to-peer networks and replicated databases. 相似文献
105.
Sayed?Ahmed?Imran?Bellary Abdus?SamadEmail author Ivo?Couckuyt Tom?Dhaene 《Engineering with Computers》2016,32(1):49-59
Kriging is a well-established approximation technique for deterministic computer experiments. There are several Kriging variants and a comparative study is warranted to evaluate the different performance characteristics of the Kriging models in the computational fluid dynamics area, specifically in turbomachinery design where the most complex flow situations can be observed. Sufficiently accurate flow simulations can take a long time to converge. Hence, this type of simulation can benefit hugely from the computational cheap Kriging models to reduce the computational burden. The Kriging variants such as ordinary Kriging, universal Kriging and blind Kriging along with the commonly used response surface approximation (RSA) model were used to optimize the performance of a centrifugal impeller using CFD analysis. A Reynolds-averaged Navier–Stokes equation solver was utilized to compute the objective function responses. The responses along with the design variables were used to construct the Kriging variants and RSA functions. A hybrid genetic algorithm was used to find the optimal point in the design space. It was found that the best optimal design was produced by blind Kriging, while the RSA identified the worst optimal design. By changing the shape of the impeller, a reduction in inlet recirculation was observed, which resulted into an increase in efficiency. 相似文献
106.
107.
Carlos Ferreira Lucas Guardalben Tomé Gomes Susana Sargento Paulo Salvador Daniel Robalo Fernando J. Velez 《Journal of Network and Systems Management》2017,25(2):416-456
Nowadays, the prevailing use of networks based on traditional centralized management systems reflects on a fast increase of the management costs. The growth in the number of network equipments and services reinforces the need to distribute the management responsibilities throughout the network devices. In this approach, each device executes common network management functionalities, being part of the overall network management platform. In this paper, we present a Unified Distributed Network Management (UDNM) framework that provides a unified (wired and wireless) management network solution, where further different network services can take part of this infrastructure, e.g., flow monitoring, accurate routing decisions, distributed policies dissemination, etc. This framework is divided in two main components: (A) Situation awareness, which sets up initial information through bootstrapping, discovery, fault-management process and exchange of management information; (B) Autonomic Decision System (ADS) that performs distributed decisions in the network with incomplete information. We deploy the UDNM framework in a testbed which involves two cities (\(\approx\)250 km between), different standards (IEEE 802.3, IEEE 802.11 and IEEE 802.16e) and network technologies, such as, wired virtual grid, wireless ad-hoc gateways, ad-hoc mobile access devices. The UDNM framework integrates management functionalities into the managed devices, proving to be a lightweight and easy-respond framework. The performance analysis shows that the UDNM framework is feasible to unify devices management functionalities and to take accurate decisions on top of a real network. 相似文献
108.
Rinde?R.?S.?van?LonEmail authorView authors OrcID profile Tom?Holvoet 《Autonomous Agents and Multi-Agent Systems》2017,31(6):1578-1609
Multi-agent systems (MAS) literature often assumes decentralized MAS to be especially suited for dynamic and large scale problems. In operational research, however, the prevailing paradigm is the use of centralized algorithms. Present paper empirically evaluates whether a multi-agent system can outperform a centralized algorithm in dynamic and large scale logistics problems. This evaluation is novel in three aspects: (1) to ensure fairness both implementations are subject to the same constraints with respect to hardware resources and software limitations, (2) the implementations are systematically evaluated with varying problem properties, and (3) all code is open source, facilitating reproduction and extension of the experiments. Existing work lacks a systematic evaluation of centralized versus decentralized paradigms due to the absence of a real-time logistics simulator with support for both paradigms and a dataset of problem instances with varying properties. We extended an existing logistics simulator to be able to perform real-time experiments and we use a recent dataset of dynamic pickup-and-delivery problem with time windows instances with varying levels of dynamism, urgency, and scale. The OptaPlanner constraint satisfaction solver is used in a centralized way to compute a global schedule and used as part of a decentralized MAS based on the dynamic contract-net protocol (DynCNET) algorithm. The experiments show that the DynCNET MAS finds solutions with a relatively lower operating cost when a problem has all following three properties: medium to high dynamism, high urgency, and medium to large scale. In these circumstances, the centralized algorithm finds solutions with an average cost of 112.3% of the solutions found by the MAS. However, averaged over all scenario types, the average cost of the centralized algorithm is 94.2%. The results indicate that the MAS performs best on very urgent problems that are medium to large scale. 相似文献
109.
Keerthy Kusumam Tomáš Krajník Simon Pearson Tom Duckett Grzegorz Cielniak 《野外机器人技术杂志》2017,34(8):1505-1518
This paper describes a 3D vision system for robotic harvesting of broccoli using low‐cost RGB‐D sensors, which was developed and evaluated using sensory data collected under real‐world field conditions in both the UK and Spain. The presented method addresses the tasks of detecting mature broccoli heads in the field and providing their 3D locations relative to the vehicle. The paper evaluates different 3D features, machine learning, and temporal filtering methods for detection of broccoli heads. Our experiments show that a combination of Viewpoint Feature Histograms, Support Vector Machine classifier, and a temporal filter to track the detected heads results in a system that detects broccoli heads with high precision. We also show that the temporal filtering can be used to generate a 3D map of the broccoli head positions in the field. Additionally, we present methods for automatically estimating the size of the broccoli heads, to determine when a head is ready for harvest. All of the methods were evaluated using ground‐truth data from both the UK and Spain, which we also make available to the research community for subsequent algorithm development and result comparison. Cross‐validation of the system trained on the UK dataset on the Spanish dataset, and vice versa, indicated good generalization capabilities of the system, confirming the strong potential of low‐cost 3D imaging for commercial broccoli harvesting. 相似文献
110.
One of the main current applications of intelligent systems is recommender systems (RS). RS can help users to find relevant items in huge information spaces in a personalized way. Several techniques have been investigated for the development of RS. One of them is evolutionary computational (EC) techniques, which is an emerging trend with various application areas. The increasing interest in using EC for web personalization, information retrieval and RS fostered the publication of survey papers on the subject. However, these surveys have analyzed only a small number of publications, around ten. This study provides a comprehensive review of more than 65 research publications focusing on five aspects we consider relevant for such: the recommendation technique used, the datasets and the evaluation methods adopted in their experimental parts, the baselines employed in the experimental comparison of proposed approaches and the reproducibility of the reported experiments. At the end of this review, we discuss negative and positive aspects of these papers, as well as point out opportunities, challenges and possible future research directions. To the best of our knowledge, this review is the most comprehensive review of various approaches using EC in RS. Thus, we believe this review will be a relevant material for researchers interested in EC and RS. 相似文献