全文获取类型
收费全文 | 1025篇 |
免费 | 56篇 |
专业分类
电工技术 | 16篇 |
化学工业 | 372篇 |
金属工艺 | 24篇 |
机械仪表 | 30篇 |
建筑科学 | 36篇 |
能源动力 | 27篇 |
轻工业 | 45篇 |
水利工程 | 1篇 |
石油天然气 | 3篇 |
武器工业 | 1篇 |
无线电 | 67篇 |
一般工业技术 | 172篇 |
冶金工业 | 73篇 |
原子能技术 | 8篇 |
自动化技术 | 206篇 |
出版年
2024年 | 3篇 |
2023年 | 11篇 |
2022年 | 71篇 |
2021年 | 81篇 |
2020年 | 31篇 |
2019年 | 36篇 |
2018年 | 42篇 |
2017年 | 32篇 |
2016年 | 34篇 |
2015年 | 46篇 |
2014年 | 50篇 |
2013年 | 73篇 |
2012年 | 65篇 |
2011年 | 64篇 |
2010年 | 61篇 |
2009年 | 56篇 |
2008年 | 33篇 |
2007年 | 45篇 |
2006年 | 37篇 |
2005年 | 19篇 |
2004年 | 21篇 |
2003年 | 15篇 |
2002年 | 17篇 |
2001年 | 3篇 |
2000年 | 8篇 |
1999年 | 5篇 |
1998年 | 8篇 |
1997年 | 12篇 |
1996年 | 8篇 |
1995年 | 7篇 |
1994年 | 8篇 |
1993年 | 10篇 |
1992年 | 6篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 4篇 |
1988年 | 4篇 |
1987年 | 5篇 |
1986年 | 5篇 |
1985年 | 3篇 |
1984年 | 4篇 |
1983年 | 4篇 |
1981年 | 9篇 |
1980年 | 4篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1976年 | 4篇 |
1969年 | 1篇 |
1966年 | 1篇 |
1953年 | 1篇 |
排序方式: 共有1081条查询结果,搜索用时 15 毫秒
1.
Takeshi Kondo Sang Min Lee Michal Malicki Benoit Domercq Seth R. Marder Bernard Kippelen 《Advanced functional materials》2008,18(7):1112-1118
We report on a single‐layer organic memory device made of poly(N‐vinylcarbazole) embedded between an Al electrode and ITO modified with Ag nanodots (Ag‐NDs). Devices exhibit high ON/OFF switching ratios of 104. This level of performance could be achieved by modifying the ITO electrodes with some Ag‐NDs that act as trapping sites, reducing the current in the OFF state. Temperature dependence of the electrical characteristics suggest that the current of the low‐resistance state can be attributed to Schottky charge tunnelling through low‐resistance pathways of Al particles in the polymer layer and that the high‐resistance state can be controlled by charge trapping by the Al particles and Ag‐NDs. 相似文献
2.
To identify possible sources of the observed differences in the career choices of women and men, three facets of career preferences were examined: the relative importance attributed to career-related aspects, the within-aspect preferences (i.e., desirable characteristics of occupations), and the structure of aspects derived from these within-aspect preferences. The career-related preferences of 2,000 young adults who were in the process of making their career decisions were analyzed. These career-related preferences were elicited during their dialogues with a computer-assisted career guidance system. The analyses revealed (a) only small gender differences in the relative importance of the aspects, (b) considerable gender differences in the within-aspect preferences, and (c) certain gender differences in the structure of aspects. The findings and their possible theoretical and practical implications are discussed. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
3.
Michal Ephratt 《Computers and the Humanities》1992,26(4):249-259
The paper sets out twenty proposals for the development and evaluation of Computer Assisted Language Learning (CALL) programs. These proposals emerge from special characteristics of language instruction and of the use of computers to assist in language instruction. We combine theoretically-based assumptions with empirical findings drawn from investigation of language courseware for Hebrew speakers in Israel. We first list four unique features of language instruction: (1) the object-language-meta-language distinction; (2) computer as written medium vs. language as primary spoken medium; (3) teaching of second language skills vs. linguistics; (4) the computer as an electronic tool vs. the computer as a cognitive entity simulating the speaker. We then show how these unique characteristics of language instruction (mother-tongue and foreign language) impose special proposals on language courseware. These proposals should be observed in the development of language courseware and in the evaluation of such programs. Clearly, these proposals integrate with general courseware proposals.
Michal Ephratt (Ph.D., computational linguistics) completed post-doctoral studies at the University of Rochester. She has been on the staff of the Dept. of Hebrew Linguistics, University of Haifa, since 1988. Some of her publications include Root-Pattern Array: The Main Tool of Hebrew Word Formation (Hebrew University, 1985); and What's in a Joke? in Advances in Artificial Intelligence, Natural Language and Knowledge-based Systems (Springer-Verlag, 1990).This paper is based on work the author did as a consultant in the National Courseware Evaluation Department of the Ministry of Education. I wish to thank Esther Diamant, head of the department, for making the study possible. 相似文献
4.
Michal Podhradský Calvin Coopmans Austin Jensen 《Journal of Intelligent and Robotic Systems》2014,74(1-2):193-207
Small unmanned aerial vehicles (UAV) are typically driven by Lithium polymer batteries. The batteries have their own dynamics, which changes during discharge. Classical approaches to altitude control assume a time-invariant system and therefore fail. Adaptive controllers require an identified system model which is often unavailable. Battery dynamics can be characterized and used for a battery model-based controller. This controller is useful in situations when no feedback from actuators (such as RPM or thrust) is available. After measuring the battery dynamics for two distinct types of batteries, a controller is designed and experimentally verified, showing a consistent performance during entire discharge test and a consequent flight verification. 相似文献
5.
Zdenek Vasicek Michal Bidlo Lukas Sekanina 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2013,17(11):2163-2180
Image processing represents a research field in which high-quality solutions have been obtained using various soft computing techniques. Evolutionary algorithms constitute a class of stochastic search methods that are applicable in both optimization and design tasks. In the area of circuit design Cartesian Genetic Programming has often been utilized in combination with an algorithm of Evolutionary Strategy. Digital image filters represent a specific class of circuits whose design can be performed by means of this approach. Switching filters are advanced non-linear filtering techniques in which the main idea is to detect and filter the noise pixels while keeping the uncorrupted pixels unchanged in order to increase the quality of the resulting image. The aim of this article is to present a robust design technique based on Cartesian Genetic Programming for the automatic synthesis of switching image filters intended for real-time processing applications. The robustness of the proposed evolutionary approach is evaluated using four design problems including the removal of salt and pepper noise, random shot noise, impulse burst noise and impulse burst noise combined with random shot noise. An extensive evaluation is performed in order to compare the properties of the evolved switching filters with the best conventional solutions. The evaluation has shown that the evolved switching filters exhibit a very good trade off between the quality of filtering and the implementation cost in field programmable gate arrays. 相似文献
6.
Abstract: The paper presents a novel machine learning algorithm used for training a compound classifier system that consists of a set of area classifiers. Area classifiers recognize objects derived from the respective competence area. Splitting feature space into areas and selecting area classifiers are two key processes of the algorithm; both take place simultaneously in the course of an optimization process aimed at maximizing the system performance. An evolutionary algorithm is used to find the optimal solution. A number of experiments have been carried out to evaluate system performance. The results prove that the proposed method outperforms each elementary classifier as well as simple voting. 相似文献
7.
The present paper deals with the problem of solving the (\(n^2 - 1\))-puzzle and cooperative path-finding (CPF) problems sub-optimally by rule-based algorithms. To solve the puzzle, we need to rearrange \(n^2 - 1\) pebbles in the \(n \times n\)-sized square grid using one vacant position to achieve the goal configuration. An improvement to the existing polynomial-time algorithm is proposed and experimentally analyzed. The improved algorithm represents an attempt to move pebbles in a more efficient way compared to the original algorithm by grouping them into so-called snakes and moving them together as part of a snake formation. An experimental evaluation has shown that the snakeenhanced algorithm produces solutions which are 8–9 % shorter than the solutions generated by the original algorithm. Snake-like movement has also been integrated into the rule-based algorithms used in solving CPF problems sub-optimally, which is a closely related task. The task in CPF consists in moving a group of abstract robots on an undirected graph to specific vertices. The robots can move to unoccupied neighboring vertices; no more than one robot can be placed in each vertex. The (\(n^2 - 1\))-puzzle is a special case of CPF where the underlying graph is a 4-connected grid and only one vertex is vacant. Two major rule-based algorithms for solving CPF problems were included in our study—BIBOX and PUSH-and-SWAP (PUSH-and-ROTATE). The use of snakes in the BIBOX algorithm led to consistent efficiency gains of around 30 % for the (\(n^2 - 1\))-puzzle and up to 50 % in for CPF problems on biconnected graphs with various ear decompositions and multiple vacant vertices. For the PUSH-and-SWAP algorithm, the efficiency gain achieved from the use of snakes was around 5–8 %. However, the efficiency gain was unstable and hardly predictable for PUSH-and-SWAP. 相似文献
8.
Michal Mereš Ivan Melo Boris Tomášik Vladimír Balek Vladimír ?erný 《Computer Physics Communications》2011,182(12):2561-2566
We propose a novel algorithm, called REGGAE, for the generation of momenta of a given sample of particle masses, evenly distributed in Lorentz-invariant phase space and obeying energy and momentum conservation. In comparison to other existing algorithms, REGGAE is designed for the use in multiparticle production in hadronic and nuclear collisions where many hadrons are produced and a large part of the available energy is stored in the form of their masses. The algorithm uses a loop simulating multiple collisions which lead to production of configurations with reasonably large weights.
Program summary
Program title: REGGAE (REscattering-after-Genbod GenerAtor of Events)Catalogue identifier: AEJR_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEJR_v1_0.htmlProgram obtainable from: CPC Program Library, Queen?s University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 1523No. of bytes in distributed program, including test data, etc.: 9608Distribution format: tar.gzProgramming language: C++Computer: PC Pentium 4, though no particular tuning for this machine was performed.Operating system: Originally designed on Linux PC with g++, but it has been compiled and ran successfully on OS X with g++ and MS Windows with Microsoft Visual C++ 2008 Express Edition, as well.RAM: This depends on the number of particles which are generated. For 10 particles like in the attached example it requires about 120 kB.Classification: 11.2Nature of problem: The task is to generate momenta of a sample of particles with given masses which obey energy and momentum conservation. Generated samples should be evenly distributed in the available Lorentz-invariant phase space.Solution method: In general, the algorithm works in two steps. First, all momenta are generated with the GENBOD algorithm. There, particle production is modeled as a sequence of two-body decays of heavy resonances. After all momenta are generated this way, they are reshuffled. Each particle undergoes a collision with some other partner such that in the pair center of mass system the new directions of momenta are distributed isotropically. After each particle collides only a few times, the momenta are distributed evenly across the whole available phase space. Starting with GENBOD is not essential for the procedure but it improves the performance.Running time: This depends on the number of particles and number of events one wants to generate. On a LINUX PC with 2 GHz processor, generation of 1000 events with 10 particles each takes about 3 s. 相似文献9.
This paper shows how to improve holistic face analysis by assigning importance factors to different facial regions (termed as face relevance maps). We propose a novel supervised learning algorithm for generating face relevance maps to improve the discriminating capability of existing methods. We have successfully applied the developed technique to face identification based on the Eigenfaces and Fisherfaces methods, and also to gender classification based on principal geodesic analysis (PGA). We demonstrate how to iteratively learn the face relevance map using labelled data. Experimental results confirm the effectiveness of the developed approach. 相似文献
10.
A visual appearance of natural materials significantly depends on acquisition circumstances, particularly illumination conditions and viewpoint position, whose variations cause difficulties in the analysis of real scenes. We address this issue with novel texture features, based on fast estimates of Markovian statistics, that are simultaneously rotation and illumination invariant. The proposed features are invariant to in-plane material rotation and illumination spectrum (colour invariance), they are robust to local intensity changes (cast shadows) and illumination direction. No knowledge of illumination conditions is required and recognition is possible from a single training image per material. The material recognition is tested on the currently most realistic visual representation - Bidirectional Texture Function (BTF), using CUReT and ALOT texture datasets with more than 250 natural materials. Our proposed features significantly outperform leading alternatives including Local Binary Patterns (LBP, LBP-HF) and texton MR8 methods. 相似文献