全文获取类型
收费全文 | 6264篇 |
免费 | 547篇 |
国内免费 | 17篇 |
专业分类
电工技术 | 90篇 |
综合类 | 14篇 |
化学工业 | 1471篇 |
金属工艺 | 237篇 |
机械仪表 | 438篇 |
建筑科学 | 117篇 |
矿业工程 | 2篇 |
能源动力 | 279篇 |
轻工业 | 616篇 |
水利工程 | 14篇 |
石油天然气 | 1篇 |
无线电 | 1174篇 |
一般工业技术 | 1500篇 |
冶金工业 | 179篇 |
原子能技术 | 108篇 |
自动化技术 | 588篇 |
出版年
2024年 | 13篇 |
2023年 | 112篇 |
2022年 | 153篇 |
2021年 | 273篇 |
2020年 | 210篇 |
2019年 | 212篇 |
2018年 | 272篇 |
2017年 | 255篇 |
2016年 | 310篇 |
2015年 | 259篇 |
2014年 | 335篇 |
2013年 | 440篇 |
2012年 | 452篇 |
2011年 | 551篇 |
2010年 | 414篇 |
2009年 | 443篇 |
2008年 | 332篇 |
2007年 | 235篇 |
2006年 | 236篇 |
2005年 | 187篇 |
2004年 | 179篇 |
2003年 | 156篇 |
2002年 | 142篇 |
2001年 | 87篇 |
2000年 | 88篇 |
1999年 | 83篇 |
1998年 | 92篇 |
1997年 | 67篇 |
1996年 | 56篇 |
1995年 | 51篇 |
1994年 | 25篇 |
1993年 | 12篇 |
1992年 | 22篇 |
1991年 | 13篇 |
1990年 | 15篇 |
1989年 | 9篇 |
1988年 | 9篇 |
1987年 | 7篇 |
1986年 | 3篇 |
1985年 | 6篇 |
1984年 | 2篇 |
1983年 | 1篇 |
1981年 | 2篇 |
1980年 | 3篇 |
1979年 | 1篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1974年 | 1篇 |
排序方式: 共有6828条查询结果,搜索用时 0 毫秒
101.
Gu-Min Jeong Hyun-Sik Ahn Sang-Il Choi Nojun Kwak Chanwoo Moon 《International Journal of Control, Automation and Systems》2010,8(1):141-148
In this paper, we propose a new pattern recognition method using feature feedback and present its application to face recognition.
Conventional pattern recognition methods extract the features employed for classification using PCA, LDA and so on. On the
other hand, in the proposed method, the extracted features are analyzed in the original space using feature feedback. Using
reverse mapping from the extracted features to the original space, we can identify the important part of the original data
that affects the classification. In this way, we can modify the data to obtain a higher classification rate, make it more
compact or abbreviate the required sensors. To verify the applicability of the proposed method, we apply it to face recognition
using the Yale Face Database. Each face image is divided into two parts, the important part and unimportant part, using feature
feedback, and the classification performed using the feature mask obtained from feature feedback. Also, we combine face recognition
with image compression. The experimental results show that the proposed method works well. 相似文献
102.
Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm 总被引:1,自引:0,他引:1
Hang-Min Cho Suk-Joo Bae Jungwuk Kim In-Jae Jeong 《Computers & Industrial Engineering》2011,61(3):529-541
This paper deals with a scheduling problem for reentrant hybrid flowshop with serial stages where each stage consists of identical parallel machines. In a reentrant flowshop, a job may revisit any stage several times. Local-search based Pareto genetic algorithms with Minkowski distance-based crossover operator is proposed to approximate the Pareto optimal solutions for the minimization of makespan and total tardiness in a reentrant hybrid flowshop. The Pareto genetic algorithms are compared with existing multi-objective genetic algorithm, NSGA-II in terms of the convergence to optimal solution, the diversity of solution and the dominance of solution. Experimental results show that the proposed crossover operator and local search are effective and the proposed algorithm outperforms NSGA-II by statistical analysis. 相似文献
103.
Juyoung Wy Sangwon Jeong Byung-In Kim Junhyuk Park Jaejoon Shin Hyunjoong Yoon Sujeong Lee 《Computers & Industrial Engineering》2011
Simulation has been used to evaluate various aspects of manufacturing systems. However, building a simulation model of a manufacturing system is time-consuming and error-prone because of the complexity of the systems. This paper introduces a generic simulation modeling framework to reduce the simulation model build time. The framework consists of layout modeling software and a data-driven generic simulation model. The generic simulation model was developed considering the processing as well as the logistics aspects of assembly manufacturing systems. The framework can be used to quickly develop an integrated simulation model of the production schedule, operation processes and logistics of a system. The framework was validated by developing simulation models of cellular and conveyor manufacturing systems. 相似文献
104.
With the development in IT technology and with growing demands of users, a ubiquitous environment is being made. Because individual
identification is important in ubiquitous environment, RFID technology would be used frequently. RFID is a radio frequency
identification technology to replace bar code. The reader transmits query (request of user information) and tag-provides user
information. RFID has various advantages, such as high speed identification rates, mass memory storages. However, eavesdropping
is possible as well as a problem that user information is exposed (Juels et al. in Conference on Computer and Communications
Security—ACM CCS, pp. 103–111, 2003; Ohkubo et al. in RFID Privacy Workshop 2003; Weis et al. in International Conference on Security in Pervasive Computing, pp. 201–212, 2003; Weis et al. in Cryptographic Hardware and Embedded Systems—CHES, pp. 454–469, 2002). Therefore, when off-line customer had visited bank for banking service, RNTS (RFID number ticket service) system provides
both anonymity in customer identification and efficiency of banking service. In addition, RNTS system protects privacy of
an off-line user visiting the bank and it is an efficient method offering service in order of arriving in the bank. 相似文献
105.
Ab initio predictions of secondary structures in proteins have to combine local predictions, based on short fragments of the
protein sequence, with consistency restrictions, as not all locally plausible predictions may be simultaneously true.
We use the fact that secondary structures are patterns of hydrogen bonds and that a single residue can participate in hydrogen
bonds of at most one secondary structure. Consistency of fixed-sized pieces of secondary structures is the easiest to approximate
and we formalize it as 1-2 matching problem. Consistency of entire secondary structures is a version of set packing. We also
investigate how to form a simple problem if we add the requirement that the secondary structure and the loops that connect
them fit together in a metric space.
Every problem that we investigated is MAX-SNP hard and it has a constant factor approximation. Computational experience suggests
that in biological instances, we can find nearly optimal solutions using heuristics. 相似文献
106.
String inclusion and non-inclusion problems have been vigorously studied in such diverse fields as molecular biology, data compression, and computer security. Among the well-known string inclusion or non-inclusion notions, we are interested in the longest common nonsuperstring. Given a set of strings, the longest common nonsuperstring problem is finding the longest string that is not a superstring of any string in the given set. It is known that the longest common nonsuperstring problem is solvable in polynomial time.In this paper, we propose an efficient algorithm for the longest common nonsuperstring problem. The running time of our algorithm is linear with respect to the sum of the lengths of the strings in the given set, using generalized suffix trees. 相似文献
107.
This paper focuses on recently advanced fuzzy models and the application of type-2 fuzzy sets in video deinterlacing. The final goal of the proposed deinterlacing algorithm is to exactly determine an unknown pixel value while preserving the edges and details of the image. To begin, we will discuss some artefacts of spatial, temporal, and spatio-temporal domain deinterlacing methods. In order to address the aforementioned issues, we adopted type-2 fuzzy sets concepts to design a weight evaluating approach. In the proposed method, the upper and lower fuzzy membership functions of the type-2 fuzzy logic filters are derived from the type-1 (or primary) fuzzy membership function. The weights from upper and lower membership functions are considered to be multiplied with the candidate deinterlaced pixels. Experimental results proved that the performance of the proposed method was superior, both objectively and subjectively to other different conventional deinterlacing methods. Moreover, the proposed method preserved the smoothness of the original image edges and produced a high-quality progressive image. 相似文献
108.
The FP-growth algorithm using the FP-tree has been widely studied for frequent pattern mining because it can dramatically improve performance compared to the candidate generation-and-test paradigm of Apriori. However, it still requires two database scans, which are not consistent with efficient data stream processing. In this paper, we present a novel tree structure, called CP-tree (compact pattern tree), that captures database information with one scan (insertion phase) and provides the same mining performance as the FP-growth method (restructuring phase). The CP-tree introduces the concept of dynamic tree restructuring to produce a highly compact frequency-descending tree structure at runtime. An efficient tree restructuring method, called the branch sorting method, that restructures a prefix-tree branch-by-branch, is also proposed in this paper. Moreover, the CP-tree provides full functionality for interactive and incremental mining. Extensive experimental results show that the CP-tree is efficient for frequent pattern mining, interactive, and incremental mining with a single database scan. 相似文献
109.
Forward secrecy in an e-mail system means that compromising of the long-term secret keys of the mail users and mail servers does not affect the confidentiality of the e-mail messages. Previous forward-secure e-mail protocols used the certified public keys of the users using PKI (Public Key Infrastructure). In this paper, we propose a password-based authenticated e-mail protocol providing forward secrecy. The proposed protocol does not require certified public keys and is sufficiently efficient to be executed on resource-restricted mobile devices. 相似文献
110.
The trend of digital convergence makes multitasking common in many digital electronic products. Some applications in those systems have inherent real‐time properties, while many others have few or no timeliness requirements. Therefore the embedded Linux kernels, which are widely used in those devices, provide real‐time features in many forms. However, providing real‐time scheduling usually induces throughput degradation in heavy multitasking due to the increased context switches. Usually the throughput degradation becomes a critical problem, since the performance of the embedded processors is generally limited for cost, design and energy efficiency reasons. This paper proposes schemes to lessen the throughput degradation, which is from real‐time scheduling, by suppressing unnecessary context switches and applying real‐time scheduling mechanisms only when it is necessary. Also the suggested schemes enable the complete priority inheritance protocol to prevent the well‐known priority inversion problem. We evaluated the effectiveness of our approach with open‐source benchmarks. By using the suggested schemes, the throughput is improved while the scheduling latency is kept same or better in comparison with the existing approaches. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献