全文获取类型
收费全文 | 37284篇 |
免费 | 4193篇 |
国内免费 | 2138篇 |
专业分类
电工技术 | 2954篇 |
技术理论 | 3篇 |
综合类 | 5082篇 |
化学工业 | 1931篇 |
金属工艺 | 723篇 |
机械仪表 | 1788篇 |
建筑科学 | 4609篇 |
矿业工程 | 1831篇 |
能源动力 | 1050篇 |
轻工业 | 3767篇 |
水利工程 | 2070篇 |
石油天然气 | 4104篇 |
武器工业 | 851篇 |
无线电 | 2427篇 |
一般工业技术 | 2450篇 |
冶金工业 | 1118篇 |
原子能技术 | 290篇 |
自动化技术 | 6567篇 |
出版年
2024年 | 181篇 |
2023年 | 554篇 |
2022年 | 1076篇 |
2021年 | 1315篇 |
2020年 | 1351篇 |
2019年 | 1099篇 |
2018年 | 1078篇 |
2017年 | 1148篇 |
2016年 | 1492篇 |
2015年 | 1546篇 |
2014年 | 2609篇 |
2013年 | 2293篇 |
2012年 | 3027篇 |
2011年 | 3095篇 |
2010年 | 2272篇 |
2009年 | 2355篇 |
2008年 | 2134篇 |
2007年 | 2560篇 |
2006年 | 2240篇 |
2005年 | 1976篇 |
2004年 | 1571篇 |
2003年 | 1330篇 |
2002年 | 950篇 |
2001年 | 843篇 |
2000年 | 646篇 |
1999年 | 546篇 |
1998年 | 400篇 |
1997年 | 381篇 |
1996年 | 307篇 |
1995年 | 254篇 |
1994年 | 195篇 |
1993年 | 153篇 |
1992年 | 96篇 |
1991年 | 94篇 |
1990年 | 60篇 |
1989年 | 77篇 |
1988年 | 31篇 |
1987年 | 28篇 |
1986年 | 28篇 |
1985年 | 21篇 |
1984年 | 26篇 |
1983年 | 28篇 |
1982年 | 16篇 |
1981年 | 13篇 |
1979年 | 10篇 |
1978年 | 9篇 |
1977年 | 8篇 |
1975年 | 7篇 |
1963年 | 8篇 |
1959年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 62 毫秒
991.
A corporate credit rating model using multi-class support vector machines with an ordinal pairwise partitioning approach 总被引:1,自引:0,他引:1
Kyoung-jae Kim 《Computers & Operations Research》2012,39(8):1800-1811
Predicting corporate credit-rating using statistical and artificial intelligence (AI) techniques has received considerable research attention in the literature. In recent years, multi-class support vector machines (MSVMs) have become a very appealing machine-learning approach due to their good performance. Until now, researchers have proposed a variety of techniques for adapting support vector machines (SVMs) to multi-class classification, since SVMs were originally devised for binary classification. However, most of them have only focused on classifying samples into nominal categories; thus, the unique characteristic of credit-rating - ordinality - seldom has been considered in the proposed approaches. This study proposes a new type of MSVM classifier (named OMSVM) that is designed to extend the binary SVMs by applying an ordinal pairwise partitioning (OPP) strategy. Our model can efficiently and effectively handle multiple ordinal classes. To validate OMSVM, we applied it to a real-world case of bond rating. We compared the results of our model with those of conventional MSVM approaches and other AI techniques including MDA, MLOGIT, CBR, and ANNs. The results showed that our proposed model improves the performance of classification in comparison to other typical multi-class classification techniques and uses fewer computational resources. 相似文献
992.
Data envelopment analysis for evaluating the efficiency of genetic algorithms on solving the vehicle routing problem with soft time windows 总被引:1,自引:0,他引:1
This study proposes an alternative to the conventional empirical analysis approach for evaluating the relative efficiency of distinct combinations of algorithmic operators and/or parameter values of genetic algorithms (GAs) on solving the pickup and delivery vehicle routing problem with soft time windows (PDVRPSTW). Our approach considers each combination as a decision-making unit (DMU) and adopts data envelopment analysis (DEA) to determine the relative and cross efficiencies of each combination of GA operators and parameter values on solving the PDVRPSTW. To demonstrate the applicability and advantage of this approach, we implemented a number of combinations of GA’s three main algorithmic operators, namely selection, crossover and mutation, and employed DEA to evaluate and rank the relative efficiencies of these combinations. The numerical results show that DEA is well suited for determining the efficient combinations of GA operators. Among the combinations under consideration, the combinations using tournament selection and simple crossover are generally more efficient. The proposed approach can be adopted to evaluate the relative efficiency of other meta-heuristics, so it also contributes to the algorithm development and evaluation for solving combinatorial optimization problems from the operational research perspective. 相似文献
993.
Azzedine Boukerche Dionysios Efstathiou Sotiris Nikoletseas 《Journal of Parallel and Distributed Computing》2012
We consider sensor networks where the sensor nodes are attached on entities that move in a highly dynamic, heterogeneous manner. To capture this mobility diversity we introduce a new network parameter, the direction-aware mobility level, which measures how fast and close each mobile node is expected to get to the data destination (the sink). We then provide local, distributed data dissemination protocols that adaptively exploit the node mobility to improve performance. In particular, “high” mobility is used as a low cost replacement for data dissemination (due to the ferrying of data), while in the case of “low” mobility either (a) data propagation redundancy is increased (when highly mobile neighbors exist) or (b) long-distance data transmissions are used (when the entire neighborhood is of low mobility) to accelerate data dissemination toward the sink. An extensive performance comparison to relevant methods from the state of the art demonstrates significant improvements, i.e. latency is reduced by even four times while keeping energy dissipation and delivery success at very satisfactory levels. 相似文献
994.
This paper describes the results of a summative evaluation conducted to explore the usability and acceptability of an automated telephone-based technology, designed and developed as a screening tool for mental health disorders in the workplace. The system screens employees for symptoms and subsequently provides educational information and referrals to improve mental health and enhance productivity. The qualitative evaluation was a sub-study of a larger randomized controlled trial (RCT). We conducted in-depth interviews with 15 individuals who participated in the RCT and had used the system. A phenomenological theoretical framework was utilized to analyze the narrative data. Results indicated that participants had mostly positive experience with the system and perceived it as a confidential program that allowed them to reflect on their symptoms without inhibition, fear of judgment or embarrassment. We also learned that asking mere questions about mental health symptoms can be a positive, instructive and possibly a restorative experience. There is a likelihood that for many participants, exposure to questions about their emotional and mental distress validated their feelings about their symptoms and was sufficiently compelling to promote help-seeking behavior. This evaluation study demonstrates that computers can be utilized in the workplace as effective screening and educational tools to improve employees’ mental health. 相似文献
995.
《Ergonomics》2012,55(4):556-572
Despite the ongoing health problem of repetitive strain injuries, there are few tools currently available for ergonomic applications evaluating cumulative loading that have well-documented evidence of reliability and validity. The purpose of this study was to determine the inter-rater reliability of a posture matching based analysis tool (3DMatch, University of Waterloo) for predicting cumulative and peak spinal loads. A total of 30 food service workers were each videotaped for a 1-h period while performing typical work activities and a single work task was randomly selected from each for analysis by two raters. Inter-rater reliability was determined using intraclass correlation coefficients (ICC) model 2,1 and standard errors of measurement for cumulative and peak spinal and shoulder loading variables across all subjects. Overall, 85.5% of variables had moderate to excellent inter-rater reliability, with ICCs ranging from 0.30–0.99 for all cumulative and peak loading variables. 3DMatch was found to be a reliable ergonomic tool when more than one rater is involved. 相似文献
996.
《国际计算机数学杂志》2012,89(7):1334-1357
We prove that to any partial function ? defined on a finite set, there corresponds an infinite class of graphs that could be generated by a graph grammar such that each graph in the class represents the function in the sense that evaluation of the function at any point x of its domain can be simulated by finding the unique extension of a partial vertex colouring of the graph specified by x. We show that in the proposed setup, generating such simulator graphs as well as finding the colouring extensions can be computed effectively in polynomial time. We also discuss some applications of this scenario in producing instances of the graph colouring problem near its phase transition that can be applied in a cryptographic setting. 相似文献
997.
《Behaviour & Information Technology》2012,31(1-2):154-159
Abstract This article defines a quantitative goal that is cheap to measure for the usability of a business application system for casual users. The article also describes a cost-effective method for attaining the goal. The goal is to eliminate all user interface disasters (UIDs) in a given system. UIDs are usability problems that seriously annoy users, or prevent them from accomplishing their work without help from a human being. The method consists of series of simple user tests without audio or video recording, and with little analysis after each user test. The article concludes by describing Baltica's results of applying the method to a medium-size business application for casual users. 相似文献
998.
999.
1000.