全文获取类型
收费全文 | 9727篇 |
免费 | 1522篇 |
国内免费 | 1217篇 |
专业分类
电工技术 | 776篇 |
技术理论 | 1篇 |
综合类 | 954篇 |
化学工业 | 165篇 |
金属工艺 | 98篇 |
机械仪表 | 397篇 |
建筑科学 | 208篇 |
矿业工程 | 88篇 |
能源动力 | 135篇 |
轻工业 | 76篇 |
水利工程 | 85篇 |
石油天然气 | 61篇 |
武器工业 | 119篇 |
无线电 | 1184篇 |
一般工业技术 | 783篇 |
冶金工业 | 343篇 |
原子能技术 | 18篇 |
自动化技术 | 6975篇 |
出版年
2024年 | 99篇 |
2023年 | 194篇 |
2022年 | 307篇 |
2021年 | 316篇 |
2020年 | 375篇 |
2019年 | 346篇 |
2018年 | 319篇 |
2017年 | 464篇 |
2016年 | 472篇 |
2015年 | 589篇 |
2014年 | 707篇 |
2013年 | 822篇 |
2012年 | 788篇 |
2011年 | 837篇 |
2010年 | 635篇 |
2009年 | 700篇 |
2008年 | 763篇 |
2007年 | 703篇 |
2006年 | 554篇 |
2005年 | 478篇 |
2004年 | 368篇 |
2003年 | 282篇 |
2002年 | 254篇 |
2001年 | 219篇 |
2000年 | 177篇 |
1999年 | 100篇 |
1998年 | 85篇 |
1997年 | 86篇 |
1996年 | 59篇 |
1995年 | 56篇 |
1994年 | 43篇 |
1993年 | 42篇 |
1992年 | 30篇 |
1991年 | 25篇 |
1990年 | 17篇 |
1989年 | 23篇 |
1988年 | 14篇 |
1987年 | 9篇 |
1986年 | 9篇 |
1985年 | 10篇 |
1984年 | 4篇 |
1983年 | 11篇 |
1982年 | 14篇 |
1981年 | 11篇 |
1980年 | 11篇 |
1979年 | 6篇 |
1978年 | 6篇 |
1977年 | 4篇 |
1976年 | 5篇 |
1975年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 390 毫秒
61.
One of the symptoms of plagues, epidemics or pandemics is often a fever, so during such unprecedented times, handheld infrared thermometers are vital devices for monitoring symptomatic individuals. It is therefore very important to enhance reading efficiency when these thermometers are used for lengthy periods of time in a low illuminance environment. The need for the efficient reading of infrared thermometers or a fast reaction time when reading the information is even more relevant now during the COVID-19 pandemic. In this study, a target search experiment of digital characters is carried out through a simulated interface and use scenarios of a handheld thermometer based on three variables: the inclination angle or slant of the seven segment display characters, screen brightness, and ambient illuminance. The experimental results show that the inclination angle or slant of the characters and ambient illuminance have a significant effect on the reaction speed. In general, the slowest reaction time is found when reading characters with a slant of 10° to the left and the reaction time is the fastest with a right slant of 20°. A continued reduction in ambient illuminance does not affect the visual recognition performance but instead further enhances reading efficiency. Increasing the screen brightness increases the reaction time more in relatively low ambient illuminance conditions as opposed to relatively high ambient illuminance, which implies that in higher ambient illuminance conditions, a brighter screen needs to be used to obtain the same reaction speed as that in lower ambient illuminance conditions. 相似文献
62.
The impact of digital technology in biometrics is much more efficient at interpreting data than humans, which results in completely replacement of manual identification procedures in forensic science. Because the single modality‐based biometric frameworks limit performance in terms of accuracy and anti‐spoofing capabilities due to the presence of low quality data, therefore, information fusion of more than one biometric characteristic in pursuit of high recognition results can be beneficial. In this article, we present a multimodal biometric system based on information fusion of palm print and finger knuckle traits, which are least associated to any criminal investigation as evidence yet. The proposed multimodal biometric system might be useful to identify the suspects in case of physical beating or kidnapping and establish supportive scientific evidences, when no fingerprint or face information is present in photographs. The first step in our work is data preprocessing, in which region of interest of palm and finger knuckle images have been extracted. To minimize nonuniform illumination effects, we first normalize the detected circular palm or finger knuckle and then apply line ordinal pattern (LOP)‐based encoding scheme for texture enrichment. The nondecimated quaternion wavelet provides denser feature representation at multiple scales and orientations when extracted over proposed LOP encoding and increases the discrimination power of line and ridge features. To best of our knowledge, this first attempt is a combination of backtracking search algorithm and 2D2LDA has been employed to select the dominant palm and knuckle features for classification. The classifiers output for two modalities are combined at unsupervised rank level fusion rule through Borda count method, which shows an increase in performance in terms of recognition and verification, that is, 100% (correct recognition rate), 0.26% (equal error rate), 3.52 (discriminative index), and 1,262 m (speed). 相似文献
63.
64.
Hyuntae ParkAuthor VitaeHyejeong HongAuthor Vitae Sungho KangAuthor Vitae 《Computer Networks》2012,56(1):231-243
Due to a tremendous increase in internet traffic, backbone routers must have the capability to forward massive incoming packets at several gigabits per second. IP address lookup is one of the most challenging tasks for high-speed packet forwarding. Some high-end routers have been implemented with hardware parallelism using ternary content addressable memory (TCAM). However, TCAM is much more expensive in terms of circuit complexity as well as power consumption. Therefore, efficient algorithmic solutions are essentially required to be implemented using network processors as low cost solutions.Among the state-of-the-art algorithms for IP address lookup, a binary search based on a balanced tree is effective in providing a low-cost solution. In order to construct a balanced search tree, the prefixes with the nesting relationship should be converted into completely disjointed prefixes. A leaf-pushing technique is very useful to eliminate the nesting relationship among prefixes [V. Srinivasan, G. Varghese, Fast address lookups using controlled prefix expansion, ACM Transactions on Computer Systems 17 (1) (1999) 1-40]. However, it creates duplicate prefixes, thus expanding the search tree.This paper proposes an efficient IP address lookup algorithm based on a small balanced tree using entry reduction. The leaf-pushing technique is used for creating the completely disjointed entries. In the leaf-pushed prefixes, there are numerous pairs of adjacent prefixes with similarities in prefix strings and output ports. The number of entries can be significantly reduced by the use of a new entry reduction method which merges pairs with these similar prefixes. After sorting the reduced disjointed entries, a small balanced tree is constructed with a very small node size. Based on this small balanced tree, a native binary search can be effectively used in address lookup issue. In addition, we propose a new multi-way search algorithm to improve a binary search for IPv4 address lookup. As a result, the proposed algorithms offer excellent lookup performance along with reduced memory requirements. Besides, these provide good scalability for large amounts of routing data and for the address migration toward IPv6. Using both various IPv4 and IPv6 routing data, the performance evaluation results demonstrate that the proposed algorithms have better performance in terms of lookup speed, memory requirement and scalability for the growth of entries and IPv6, as compared with other algorithms based on a binary search. 相似文献
65.
A comparative study between dynamic adapted PSO and VNS for the vehicle routing problem with dynamic requests 总被引:1,自引:0,他引:1
Combinatorial optimization problems are usually modeled in a static fashion. In this kind of problems, all data are known in advance, i.e. before the optimization process has started. However, in practice, many problems are dynamic, and change while the optimization is in progress. For example, in the dynamic vehicle routing problem (DVRP), new orders arrive when the working day plan is in progress. In this case, routes must be reconfigured dynamically while executing the current simulation. The DVRP is an extension of a conventional routing problem, its main interest being the connection to many real word applications (repair services, courier mail services, dial-a-ride services, etc.). In this article, a DVRP is examined, and solving methods based on particle swarm optimization and variable neighborhood search paradigms are proposed. The performance of both approaches is evaluated using a new set of benchmarks that we introduce here as well as existing benchmarks in the literature. Finally, we measure the behavior of both methods in terms of dynamic adaptation. 相似文献
66.
This paper presents a social harmony search algorithm model for the cost optimization of composite floor system with discrete variables. The total cost function includes the costs of concrete, steel beam and shear studs. The design is based on AISC load and resistance factor design specifications and plastic design concepts. Here, six decision variables are considered for the objective function. In order to demonstrate the capabilities of the proposed model in optimizing composite floor system designs, two design examples taken from the literature are studied. It is shown that use of the presented model results in significant cost saving. Hence, it can be of practical value to structural designers. Also the proposed model is compared to the original harmony search, its recently developed variants, and other meta-heuristic algorithms to illustrate the superiority of the present method in convergence and leading to better solutions. In order to investigate the effects of beam spans and loadings on the cost optimization of composite floor system a parametric study is also conducted. 相似文献
67.
This paper describes a heuristic approach to the discovery of useful macro-operators (macros) in problem solving. The approach has been implemented in a program, MACLEARN, that has three parts: macro-proposer, static filter, and dynamic filter. Learning occurs during problem solving, so that performance improves in the course of a single problem trial. Primitive operators and macros are both represented within a uniform representational framework that is closed under composition. This means that new macros can be defined in terms of others, which leads to a definitional hierarchy. The representation also supports the transfer of macros to related problems. MACLEARN is embedded in a supporting system that carries out best-first search. Experiments in macro learning were conducted for two classes of problems: peg solitaire (generalized Hi-Q puzzle), and tile sliding (generalized Fifteen puzzle). The results indicate that MACLEARN'S filtering heuristics all improve search performance, sometimes dramatically. When the system was given practice on simpler training problems, it learned a set of macros that led to successful solutions of several much harder problems. 相似文献
68.
J. Dudley Williams Kim N. Holland David M. Jameson Reimar C. Bruening 《Journal of chemical ecology》1992,18(11):2107-2115
Yellowfin tuna enhance their hunting success in the vast pelagic environment by using their sense of smell to detect intact (uninjured) prey that are beyond visual range. However, the olfactory cues that tuna use would normally face huge and rapid dilution in the open ocean. We demonstrate that these prey odors are complexed within biologically derived lipid structures that probably delay the dilution of the amino acids to subthreshold concentrations and provide persistent arousal and search cues for the tuna. This may be the first demonstration of an extracorporeal biological function for liposomes. Tuna may also form chemical search images to maximize feeding efficiency. We demonstrate that the amino acid profiles of various prey species are consistent over time and between schools, which makes the formation of search images feasible. 相似文献
69.
Felix Baessler 《OR Spectrum》1992,14(1):11-18
Summary In this paper, we present a novel relaxation method for the integer programming problem:Ax=b,A {–1,0,+1}m×N,x {0,1}N, N>m. The report includes experimental results of problems with up tom=100 equations andN=400 variables. 相似文献
70.
This paper presents the analysis of a parallel formulation of depth-first search. At the heart of this parallel formulation is a dynamic work-distribution scheme that divides the work between different processors. The effectiveness of the parallel formulation is strongly influenced by the work-distribution scheme and the target architecture. We introduce the concept of isoefficiency function to characterize the effectiveness of different architectures and work-distribution schemes. Many researchers considered the ring architecture to be quite suitable for parallel depth-first search. Our analytical and experimental results show that hypercube and shared-memory architectures are significantly better. The analysis of previously known work-distribution schemes motivated the design of substantially improved schemes for ring and shared-memory architectures. In particular, we present a work-distribution algorithm that guarantees close to optimal performance on a shared-memory/-network-with-message-combining architecture (e.g. RP3). Much of the analysis presented in this paper is applicable to other parallel algorithms in which work is dynamically shared between different processors (e.g., parallel divide-and-conquer algorithms). The concept of isoefficiency is useful in characterizing the scalability of a variety of parallel algorithms.This work was supported by Army Research Office Grant No. DAAG29-84-K-0060 to the Artificial Intelligence Laboratory, and Office of Naval Research Grant N00014-86-K-0763 to the Computer Science Department at the University of Texas at Austin. 相似文献