全文获取类型
收费全文 | 6922篇 |
免费 | 403篇 |
国内免费 | 6篇 |
专业分类
电工技术 | 101篇 |
综合类 | 28篇 |
化学工业 | 1947篇 |
金属工艺 | 183篇 |
机械仪表 | 152篇 |
建筑科学 | 417篇 |
矿业工程 | 39篇 |
能源动力 | 243篇 |
轻工业 | 465篇 |
水利工程 | 42篇 |
石油天然气 | 5篇 |
无线电 | 608篇 |
一般工业技术 | 1479篇 |
冶金工业 | 283篇 |
原子能技术 | 38篇 |
自动化技术 | 1301篇 |
出版年
2024年 | 14篇 |
2023年 | 101篇 |
2022年 | 152篇 |
2021年 | 268篇 |
2020年 | 190篇 |
2019年 | 191篇 |
2018年 | 190篇 |
2017年 | 186篇 |
2016年 | 282篇 |
2015年 | 299篇 |
2014年 | 349篇 |
2013年 | 505篇 |
2012年 | 472篇 |
2011年 | 626篇 |
2010年 | 413篇 |
2009年 | 418篇 |
2008年 | 403篇 |
2007年 | 354篇 |
2006年 | 275篇 |
2005年 | 246篇 |
2004年 | 191篇 |
2003年 | 149篇 |
2002年 | 149篇 |
2001年 | 74篇 |
2000年 | 100篇 |
1999年 | 92篇 |
1998年 | 84篇 |
1997年 | 81篇 |
1996年 | 86篇 |
1995年 | 55篇 |
1994年 | 48篇 |
1993年 | 50篇 |
1992年 | 47篇 |
1991年 | 34篇 |
1990年 | 20篇 |
1989年 | 12篇 |
1988年 | 16篇 |
1987年 | 16篇 |
1986年 | 12篇 |
1985年 | 13篇 |
1984年 | 8篇 |
1983年 | 7篇 |
1982年 | 4篇 |
1981年 | 5篇 |
1980年 | 9篇 |
1977年 | 3篇 |
1976年 | 3篇 |
1975年 | 4篇 |
1972年 | 4篇 |
1954年 | 3篇 |
排序方式: 共有7331条查询结果,搜索用时 0 毫秒
91.
In a graph, a vertex is simplicial if its neighborhood is a clique. For an integer k≥1, a graph G=(VG,EG) is the k-simplicial power of a graph H=(VH,EH) (H a root graph of G) if VG is the set of all simplicial vertices of H, and for all distinct vertices x and y in VG, xyEG if and only if the distance in H between x and y is at most k. This concept generalizes k-leaf powers introduced by Nishimura, Ragde and Thilikos which were motivated by the search for underlying phylogenetic trees; k-leaf powers are the k-simplicial powers of trees. Recently, a lot of work has been done on k-leaf powers and their roots as well as on their variants phylogenetic roots and Steiner roots. For k≤5, k-leaf powers can be recognized in linear time, and for k≤4, structural characterizations are known. For k≥6, the recognition and characterization problems of k-leaf powers are still open. Since trees and block graphs (i.e., connected graphs whose blocks are cliques) have very similar metric properties, it is natural to study k-simplicial powers of block graphs. We show that leaf powers of trees and simplicial powers of block graphs are closely related, and we study simplicial powers of other graph classes containing all trees such as ptolemaic graphs and strongly chordal graphs. 相似文献
92.
Changes in the microstructure of materials and their impact on reliability: experiments and modeling
Several types of microstructural changes in microelectronic solder materials are briefly discussed, namely the formation of
intermetallics, Kirkendall voiding, spinodal decomposition, and coarsening. Moreover, a theoretical framework, based on the
entropy principle, is developed by means of which constitutive equations can be derived that are necessary to understand and
simulate such processes. The resulting equations are specialized to binary alloys and then investigated numerically. Finally,
simulations of spinodal decomposition and coarsening are performed for the eutectic solder AgCu. The theoretical predictions
are compared with experiments.
相似文献
Andreas BrandmairEmail: |
Wolfgang H. Müller (Corresponding author)Email: |
93.
94.
95.
Wolfgang Fuhl Marc Tonsen Andreas Bulling Enkelejda Kasneci 《Machine Vision and Applications》2016,27(8):1275-1288
Robust and accurate detection of the pupil position is a key building block for head-mounted eye tracking and prerequisite for applications on top, such as gaze-based human–computer interaction or attention analysis. Despite a large body of work, detecting the pupil in images recorded under real-world conditions is challenging given significant variability in the eye appearance (e.g., illumination, reflections, occlusions, etc.), individual differences in eye physiology, as well as other sources of noise, such as contact lenses or make-up. In this paper we review six state-of-the-art pupil detection methods, namely ElSe (Fuhl et al. in Proceedings of the ninth biennial ACM symposium on eye tracking research & applications, ACM. New York, NY, USA, pp 123–130, 2016), ExCuSe (Fuhl et al. in Computer analysis of images and patterns. Springer, New York, pp 39–51, 2015), Pupil Labs (Kassner et al. in Adjunct proceedings of the 2014 ACM international joint conference on pervasive and ubiquitous computing (UbiComp), pp 1151–1160, 2014. doi: 10.1145/2638728.2641695), SET (Javadi et al. in Front Neuroeng 8, 2015), Starburst (Li et al. in Computer vision and pattern recognition-workshops, 2005. IEEE Computer society conference on CVPR workshops. IEEE, pp 79–79, 2005), and ?wirski (?wirski et al. in Proceedings of the symposium on eye tracking research and applications (ETRA). ACM, pp 173–176, 2012. doi: 10.1145/2168556.2168585). We compare their performance on a large-scale data set consisting of 225,569 annotated eye images taken from four publicly available data sets. Our experimental results show that the algorithm ElSe (Fuhl et al. 2016) outperforms other pupil detection methods by a large margin, offering thus robust and accurate pupil positions on challenging everyday eye images. 相似文献
96.
97.
Satellite-based estimates of groundwater storage variations in large drainage basins with extensive floodplains 总被引:2,自引:0,他引:2
Frédéric Frappart Fabrice Papa Andreas Güntner Joecila Santos da Silva Frédérique Seyler William B. Rossow Marie-Paule Bonnet 《Remote sensing of environment》2011,115(6):1588-1594
This study presents monthly estimates of groundwater anomalies in a large river basin dominated by extensive floodplains, the Negro River Basin, based on the synergistic analysis using multisatellite observations and hydrological models. For the period 2003-2004, changes in water stored in the aquifer is isolated from the total water storage measured by GRACE by removing contributions of both the surface reservoir, derived from satellite imagery and radar altimetry, and the root zone reservoir simulated by WGHM and LaD hydrological models. The groundwater anomalies show a realistic spatial pattern compared with the hydrogeological map of the basin, and similar temporal variations to local in situ groundwater observations and altimetry-derived level height measurements. Results highlight the potential of combining multiple satellite techniques with hydrological modeling to estimate the evolution of groundwater storage. 相似文献
98.
The K-connected Deployment and Power Assignment Problem (DPAP) in WSNs aims at deciding both the sensor locations and transmit power levels, for maximizing the network coverage and lifetime objectives under K-connectivity constraints, in a single run. Recently, it is shown that the Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) is a strong enough tool for dealing with unconstraint real life problems (such as DPAP), emphasizing the importance of incorporating problem-specific knowledge for increasing its efficiency. In a constrained Multi-objective Optimization Problem (such as K-connected DPAP), the search space is divided into feasible and infeasible regions. Therefore, problem-specific operators are designed for MOEA/D to direct the search into optimal, feasible regions of the space. Namely, a DPAP-specific population initialization that seeds the initial solutions into promising regions, problem-specific genetic operators (i.e. M-tournament selection, adaptive crossover and mutation) for generating good, feasible solutions and a DPAP-specific Repair Heuristic (RH) that transforms an infeasible solution into a feasible one and maintains the MOEA/D’s efficiency simultaneously. Simulation results have shown the importance of each proposed operator and their interrelation, as well as the superiority of the DPAP-specific MOEA/D against the popular constrained NSGA-II in several WSN instances. 相似文献
99.
Jayaraman J. ThiagarajanKarthikeyan N. Ramamurthy Andreas Spanias 《Pattern recognition letters》2011,32(9):1299-1304
K-hyperline clustering is an iterative algorithm based on singular value decomposition and it has been successfully used in sparse component analysis. In this paper, we prove that the algorithm converges to a locally optimal solution for a given set of training data, based on Lloyd’s optimality conditions. Furthermore, the local optimality is shown by developing an Expectation-Maximization procedure for learning dictionaries to be used in sparse representations and by deriving the clustering algorithm as its special case. The cluster centroids obtained from the algorithm are proved to tessellate the space into convex Voronoi regions. The stability of clustering is shown by posing the problem as an empirical risk minimization procedure over a function class. It is proved that, under certain conditions, the cluster centroids learned from two sets of i.i.d. training samples drawn from the same probability space become arbitrarily close to each other, as the number of training samples increase asymptotically. 相似文献
100.
Jaap-Henk Hoepman Andreas Larsson Philippas Tsigas 《Theoretical computer science》2011,412(40):5631-5647
In sensor networks, correct clocks have arbitrary starting offsets and nondeterministic fluctuating skews. We consider an adversary that aims at tampering with the clock synchronization by intercepting messages, replaying intercepted messages (after the adversary’s choice of delay), and capturing nodes (i.e., revealing their secret keys and impersonating them). We present an efficient clock sampling algorithm which tolerates attacks by this adversary, collisions, a bounded amount of losses due to ambient noise, and a bounded number of captured nodes that can jam, intercept, and send fake messages. The algorithm is self-stabilizing, so if these bounds are temporarily violated, the system can efficiently stabilize back to a correct state. Using this clock sampling algorithm, we construct the first self-stabilizing algorithm for secure clock synchronization in sensor networks that is resilient to the aforementioned adversarial attacks. 相似文献