全文获取类型
收费全文 | 6010篇 |
免费 | 287篇 |
国内免费 | 50篇 |
专业分类
电工技术 | 86篇 |
综合类 | 76篇 |
化学工业 | 1296篇 |
金属工艺 | 233篇 |
机械仪表 | 225篇 |
建筑科学 | 267篇 |
矿业工程 | 50篇 |
能源动力 | 448篇 |
轻工业 | 865篇 |
水利工程 | 42篇 |
石油天然气 | 61篇 |
武器工业 | 2篇 |
无线电 | 341篇 |
一般工业技术 | 1031篇 |
冶金工业 | 431篇 |
原子能技术 | 78篇 |
自动化技术 | 815篇 |
出版年
2024年 | 28篇 |
2023年 | 82篇 |
2022年 | 158篇 |
2021年 | 207篇 |
2020年 | 220篇 |
2019年 | 212篇 |
2018年 | 284篇 |
2017年 | 256篇 |
2016年 | 277篇 |
2015年 | 164篇 |
2014年 | 243篇 |
2013年 | 592篇 |
2012年 | 341篇 |
2011年 | 350篇 |
2010年 | 278篇 |
2009年 | 354篇 |
2008年 | 318篇 |
2007年 | 261篇 |
2006年 | 199篇 |
2005年 | 135篇 |
2004年 | 135篇 |
2003年 | 154篇 |
2002年 | 185篇 |
2001年 | 138篇 |
2000年 | 81篇 |
1999年 | 69篇 |
1998年 | 158篇 |
1997年 | 84篇 |
1996年 | 60篇 |
1995年 | 33篇 |
1994年 | 35篇 |
1993年 | 27篇 |
1992年 | 24篇 |
1991年 | 26篇 |
1990年 | 18篇 |
1989年 | 15篇 |
1988年 | 10篇 |
1987年 | 14篇 |
1986年 | 18篇 |
1985年 | 18篇 |
1984年 | 13篇 |
1983年 | 13篇 |
1982年 | 8篇 |
1981年 | 8篇 |
1979年 | 6篇 |
1978年 | 5篇 |
1976年 | 8篇 |
1970年 | 3篇 |
1967年 | 3篇 |
1965年 | 3篇 |
排序方式: 共有6347条查询结果,搜索用时 15 毫秒
91.
Radioactivity concentrations in soil and dose assessment for Samsun City Centre, Turkey 总被引:1,自引:0,他引:1
In this study, natural gamma radioactivity levels were determined in the soil samples of the Samsun city centre by using the gamma ray spectrometry method. The analysis carried out with the high-purity germanium gamma spectrometry system has shown that average activity concentrations of (238)U, (232)Th, (40)K and (137)Cs were 19±2, 22±4, 521±23 and 15±1 Bq kg(-1), respectively. From the gamma analysis of soil samples, the average value of the absorbed gamma dose rates in air and the average value of the external annual effective dose rates were calculated as 45±4 nGy h(-1) and 55±5 μSv y(-1), respectively. The external hazard index has also been calculated and it has been found that the radiation hazard in Samsun is insignificant. 相似文献
92.
Tankut Atan Olgu Pelin Hüseyinoǧlu 《International Transactions in Operational Research》2017,24(3):465-484
Assignment decisions of referees to football (soccer) games are highly debated in sports media. Referee assignments are typically done on a weekly basis as the league progresses. However, this practice ignores important workload constraints on referees. Moreover, referees' skill levels should also be considered in determining their assignments. In this article, we first give a mixed integer linear program formulation for the problem of simultaneously generating a game schedule and assigning main referees to games by incorporating specific rules in the Turkish league. We also approach this problem using a genetic algorithm (GA) because of the computational difficulties in solving the problem. In the GA solution pool, we suggest using templates for referee assignments that follow several referee‐related workload constraints. We explain how these templates can be obtained by solving a mixed integer linear model prior to running the GA. The usage of these templates for referee assignments is conceptually similar to using a basic match schedule for game scheduling such as the one used in the Turkish Football League. We use the Turkish Football League fixtures for 2010–2013 as a case study. Experiments with the GA using real‐world data show a rather modest performance in terms of computation time and objective function value. Our numerical results indicate that the problem is extremely hard to solve. 相似文献
93.
Buğra Gedik 《International journal of parallel programming》2013,41(5):595-620
In recent times, large high-dimensional datasets have become ubiquitous. Video and image repositories, financial, and sensor data are just a few examples of such datasets in practice. Many applications that use such datasets require the retrieval of data items similar to a given query item, or the nearest neighbors (NN or $k$ -NN) of a given item. Another common query is the retrieval of multiple sets of nearest neighbors, i.e., multi $k$ -NN, for different query items on the same data. With commodity multi-core CPUs becoming more and more widespread at lower costs, developing parallel algorithms for these search problems has become increasingly important. While the core nearest neighbor search problem is relatively easy to parallelize, it is challenging to tune it for optimality. This is due to the fact that the various performance-specific algorithmic parameters, or “tuning knobs”, are inter-related and also depend on the data and query workloads. In this paper, we present (1) a detailed study of the various tuning knobs and their contributions on increasing the query throughput for parallelized versions of the two most common classes of high-dimensional multi-NN search algorithms: linear scan and tree traversal, and (2) an offline auto-tuner for setting these knobs by iteratively measuring actual query execution times for a given workload and dataset. We show experimentally that our auto-tuner reaches near-optimal performance and significantly outperforms un-tuned versions of parallel multi-NN algorithms for real video repository data on a variety of multi-core platforms. 相似文献
94.
We address the symmetric flip problem that is inherent to multi‐resolution isometric shape matching algorithms. To this effect, we extend our previous work which handles the dense isometric correspondence problem in the original 3D Euclidean space via coarse‐to‐fine combinatorial matching. The key idea is based on keeping track of all optimal solutions, which may be more than one due to symmetry especially at coarse levels, throughout denser levels of the shape matching process. We compare the resulting dense correspondence algorithm with state‐of‐the‐art techniques over several 3D shape benchmark datasets. The experiments show that our method, which is fast and scalable, is performance‐wise better than or on a par with the best performant algorithms existing in the literature for isometric (or nearly isometric) shape correspondence. Our key idea of tracking symmetric flips can be considered as a meta‐approach that can be applied to other multi‐resolution shape matching algorithms, as we also demonstrate by experiments. 相似文献
95.
We consider a continuous multi-facility location-allocation problem that aims to minimize the sum of weighted farthest Euclidean distances between (closed convex) polygonal and/or circular demand regions, and facilities they are assigned to. We show that the single facility version of the problem has a straightforward second-order cone programming formulation and can therefore be efficiently solved to optimality. To solve large size instances, we adapt a multi-dimensional direct search descent algorithm to our problem which is not guaranteed to find the optimal solution. In a special case with circular and rectangular demand regions, this algorithm, if converges, finds the optimal solution. We also apply a simple subgradient method to the problem. Furthermore, we review the algorithms proposed for the problem in the literature and compare all these algorithms in terms of both solution quality and time. Finally, we consider the multi-facility version of the problem and model it as a mixed integer second-order cone programming problem. As this formulation is weak, we use the alternate location-allocation heuristic to solve large size instances. 相似文献
96.
This paper presents both a calculus for stream processing, named Brooklet, and its realization as an intermediate language, named River. Because River is based on Brooklet, it has a formal semantics that enables reasoning about the correctness of source translations and optimizations. River builds on Brooklet by addressing the real‐world details that the calculus elides. We evaluated our system by implementing front‐ends for three streaming languages, and three important optimizations, and a back‐end for the System S distributed streaming runtime. Overall, we significantly lower the barrier to entry for new stream‐processing languages and thus grow the ecosystem of this crucial style of programming. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
97.
98.
This paper presents the design,implementation and testing of an embedded system that integrates solar and storage energy resources to smart homes within the smart microgrid.The proposed system provides the required home energy by installing renewable energy and storage devices.It also manages and schedules the power flow during peak and off-peak periods.In addition,a two-way communication protocol is developed to enable the home owners and the utility service provider to improve the energy flow and the consumption efficiency.The system can be an integral part for homes in a smart grid or smart microgrid power networks.A prototype for the proposed system was designed,implemented and tested by using a controlled load bank to simulate a scaled random real house consumption behavior.Three different scenarios were tested and the results and findings are reported.Moreover,data flow security among the home,home owners and utility server is developed to minimize cyber-attacks. 相似文献
99.
100.