全文获取类型
收费全文 | 1026篇 |
免费 | 56篇 |
专业分类
电工技术 | 16篇 |
化学工业 | 373篇 |
金属工艺 | 24篇 |
机械仪表 | 30篇 |
建筑科学 | 36篇 |
能源动力 | 27篇 |
轻工业 | 45篇 |
水利工程 | 1篇 |
石油天然气 | 3篇 |
武器工业 | 1篇 |
无线电 | 67篇 |
一般工业技术 | 172篇 |
冶金工业 | 73篇 |
原子能技术 | 8篇 |
自动化技术 | 206篇 |
出版年
2024年 | 3篇 |
2023年 | 11篇 |
2022年 | 72篇 |
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篇 |
排序方式: 共有1082条查询结果,搜索用时 15 毫秒
11.
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. 相似文献
12.
When calculating aberration coefficients of secondary and higher order, there is a danger of misinterpreting the result. An example is given for a homogenous magnetic field and the source of the difficulty is described. 相似文献
13.
Daojin Zhou Zhao Cai Yongmin Bi Weiliang Tian Ma Luo Qian Zhang Qian Zhang Qixian Xie Jindi Wang Yaping Li Yun Kuang Xue Duan Michal Bajdich Samira Siahrostami Xiaoming Sun 《Nano Research》2018,11(3):1358-1368
Nickel-iron layered double hydroxide (NiFe-LDH) nanosheets have shown optimal oxygen evolution reaction (OER) performance; however, the role of the intercalated ions in the OER activity remains unclear. In this work, we show that the activity of the NiFe-LDHs can be tailored by the intercalated anions with different redox potentials. The intercalation of anions with low redox potential (high reducing ability), such as hypophosphites, leads to NiFe-LDHs with low OER overpotential of 240 mV and a small Tafel slope of 36.9 mV/dec, whereas NiFe-LDHs intercalated with anions of high redox potential (low reducing ability), such as fluorion, show a high overpotential of 370 mV and a Tafel slope of 80.8 mV/dec. The OER activity shows a surprising linear correlation with the standard redox potential. Density functional theory calculations and X-ray photoelectron spectroscopy analysis indicate that the intercalated anions alter the electronic structure of metal atoms which exposed at the surface. Anions with low standard redox potential and strong reducing ability transfer more electrons to the hydroxide layers. This increases the electron density of the surface metal sites and stabilizes their high-valence states, whose formation is known as the critical step prior to the OER process. 相似文献
14.
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. 相似文献
15.
We present a method to speed up the dynamic program algorithms used for solving the HMM decoding and training problems for
discrete time-independent HMMs. We discuss the application of our method to Viterbi’s decoding and training algorithms (IEEE
Trans. Inform. Theory IT-13:260–269, 1967), as well as to the forward-backward and Baum-Welch (Inequalities 3:1–8, 1972) algorithms. Our approach is based on identifying repeated substrings in the observed input sequence. Initially, we show
how to exploit repetitions of all sufficiently small substrings (this is similar to the Four Russians method). Then, we describe
four algorithms based alternatively on run length encoding (RLE), Lempel-Ziv (LZ78) parsing, grammar-based compression (SLP),
and byte pair encoding (BPE). Compared to Viterbi’s algorithm, we achieve speedups of Θ(log n) using the Four Russians method,
using RLE,
using LZ78,
using SLP, and Ω(r) using BPE, where k is the number of hidden states, n is the length of the observed sequence and r is its compression ratio (under each compression scheme). Our experimental results demonstrate that our new algorithms are
indeed faster in practice. We also discuss a parallel implementation of our algorithms.
A preliminary version of this paper appeared in Proc. 18th Annual Symposium on Combinatorial Pattern Matching (CPM), pp. 4–15,
2007.
Y. Lifshits’ research was supported by the Center for the Mathematics of Information and the Lee Center for Advanced Networking.
S. Mozes’ work conducted while visiting MIT. 相似文献
16.
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. 相似文献
17.
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. 相似文献18.
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. 相似文献
19.
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. 相似文献
20.
Yang G Stewart CV Sofka M Tsai CL 《IEEE transactions on pattern analysis and machine intelligence》2007,29(11):1973-1989
Our goal is an automated 2D-image-pair registration algorithm capable of aligning images taken of a wide variety of natural and man-made scenes as well as many medical images. The algorithm should handle low overlap, substantial orientation and scale differences, large illumination variations, and physical changes in the scene. An important component of this is the ability to automatically reject pairs that have no overlap or have too many differences to be aligned well.We propose a complete algorithm, including techniques for initialization, for estimating transformation parameters, and for automatically deciding if an estimate is correct. Keypoints extracted and matched between images are used to generate initial similarity transform estimates, each accurate over a small region. These initial estimates are rank-ordered and tested individually in succession. Each estimate is refined using the Dual-Bootstrap ICP algorithm, driven by matching of multiscale features. A three-part decision criteria, combining measurements of alignment accuracy, stability in the estimate, and consistency in the constraints, determines whether the refined transformation estimate is accepted as correct. Experimental results on a data set of 22 challenging image pairs show that the algorithm effectively aligns 19 of the 22 pairs and rejects 99.8% of the misalignments that occur when all possible pairs are tried. The algorithm substantially out-performs algorithms based on keypoint matching alone. 相似文献