全文获取类型
收费全文 | 4400篇 |
免费 | 280篇 |
国内免费 | 33篇 |
专业分类
电工技术 | 62篇 |
综合类 | 17篇 |
化学工业 | 1296篇 |
金属工艺 | 97篇 |
机械仪表 | 91篇 |
建筑科学 | 147篇 |
矿业工程 | 17篇 |
能源动力 | 136篇 |
轻工业 | 583篇 |
水利工程 | 27篇 |
石油天然气 | 14篇 |
无线电 | 338篇 |
一般工业技术 | 753篇 |
冶金工业 | 227篇 |
原子能技术 | 20篇 |
自动化技术 | 888篇 |
出版年
2024年 | 10篇 |
2023年 | 44篇 |
2022年 | 161篇 |
2021年 | 250篇 |
2020年 | 116篇 |
2019年 | 110篇 |
2018年 | 193篇 |
2017年 | 206篇 |
2016年 | 245篇 |
2015年 | 171篇 |
2014年 | 247篇 |
2013年 | 340篇 |
2012年 | 280篇 |
2011年 | 245篇 |
2010年 | 228篇 |
2009年 | 220篇 |
2008年 | 232篇 |
2007年 | 200篇 |
2006年 | 165篇 |
2005年 | 126篇 |
2004年 | 121篇 |
2003年 | 95篇 |
2002年 | 88篇 |
2001年 | 55篇 |
2000年 | 37篇 |
1999年 | 48篇 |
1998年 | 51篇 |
1997年 | 52篇 |
1996年 | 33篇 |
1995年 | 32篇 |
1994年 | 25篇 |
1993年 | 20篇 |
1992年 | 14篇 |
1991年 | 18篇 |
1990年 | 17篇 |
1989年 | 13篇 |
1988年 | 8篇 |
1987年 | 14篇 |
1986年 | 14篇 |
1985年 | 15篇 |
1984年 | 14篇 |
1983年 | 15篇 |
1982年 | 15篇 |
1981年 | 20篇 |
1980年 | 20篇 |
1979年 | 14篇 |
1978年 | 10篇 |
1977年 | 9篇 |
1976年 | 8篇 |
1975年 | 7篇 |
排序方式: 共有4713条查询结果,搜索用时 10 毫秒
71.
Mohamed Sadok Cherif Habib Chabchoub Belaïd Aouni 《International Transactions in Operational Research》2010,17(1):85-102
Quality function deployment (QFD) is a customer-oriented design tool for developing new or improved products to achieve higher customer satisfaction by integrating various functions of an organization. The engineering characteristics (ECs) affecting the product performances are designed to match the customer attributes (CAs). However, from the viewpoint of the QFD team, product design processes are performed in imprecise environments, and more than one factor must be taken into account in determining the target levels of ECs, especially the limited resources and increased market competition. This paper presents an imprecise goal programming (GP) approach to determine the optimum target levels of ECs in QFD for maximizing customer satisfaction under resource limitation and considerations of market competition. Based on benchmarking data of CAs, the concept of satisfaction functions is utilized to formulate explicitly the customer's preferences and to integrate the competitive analysis of target market into the modelling and solution process. In addition, the relationships linking CAs and ECs and the ECs to each other are integrated by functional relationships. The proposed approach will be illustrated through a car door design example. 相似文献
72.
Multiobjective evolutionary clustering of Web user sessions: a case study in Web page recommendation
G. Nildem Demir A. Şima Uyar Şule Gündüz-Öğüdücü 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2010,14(6):579-597
In this study, we experiment with several multiobjective evolutionary algorithms to determine a suitable approach for clustering
Web user sessions, which consist of sequences of Web pages visited by the users. Our experimental results show that the multiobjective
evolutionary algorithm-based approaches are successful for sequence clustering. We look at a commonly used cluster validity
index to verify our findings. The results for this index indicate that the clustering solutions are of high quality. As a
case study, the obtained clusters are then used in a Web recommender system for representing usage patterns. As a result of
the experiments, we see that these approaches can successfully be applied for generating clustering solutions that lead to
a high recommendation accuracy in the recommender model we used in this paper. 相似文献
73.
Stéphane Zieba Philippe Polet Frédéric Vanderhaegen Serge Debernard 《Cognition, Technology & Work》2010,12(3):193-203
Unmanned ground vehicles tend to be more and more autonomous, but both complete teleoperation and full autonomy are not efficient
enough to deal with all possible situations. To be efficient, the human–robot system must be able to anticipate, react and
recover from errors of different kinds, i.e., to be resilient. From this observation, this paper proposes a survey on the
resilience of a human–machine system and the means to control the resilience. The resilience of a system can be defined as
the ability to maintain or recover a stable state when subject to disturbance. Adjustable autonomy and human–machine cooperation
are considered as means of resilience for the system. This paper then proposes three indicators to assess different meanings
of resilience of the system: foresight and avoidance of events, reaction to events and recovery from occurrence of events.
The third of these metrics takes into consideration the concept of affordances that allows a common representation for the
opportunities of action between the automated system and its environment. 相似文献
74.
Roberto Sanchez Geneviève Dauphin-Tanguy Xavier Guillaud Frédéric Colas 《Simulation Modelling Practice and Theory》2010,18(9):1185-1198
This paper proposes a model of a three phase electrical inverter with a LC output filter in delta connection used in a renewable energy supply system. The concept of inverse bond graph via bicausality is used for the control law design. The control law robustness is tested by connecting passive and active (induction machine) loads. 相似文献
75.
Mitsuo Takaki Diego Cavalcanti Rohit Gheyi Juliano Iyoda Marcelo d’Amorim Ricardo B. C. Prudêncio 《Innovations in Systems and Software Engineering》2010,6(3):243-253
The complexity of constraints is a major obstacle for constraint-based software verification. Automatic constraint solvers are fundamentally incomplete: input constraints often build on some undecidable theory or some theory the solver does not support. This paper proposes and evaluates several randomized solvers to address this issue. We compared the effectiveness of a symbolic solver (CVC3), a random solver, two heuristic search solvers, and seven hybrid solvers (i.e. mix of random, symbolic, and heuristic solvers). We evaluated the solvers on a benchmark generated with a concolic execution of 9 subjects. The performance of each solver was measured by its precision, which is the fraction of constraints that the solver can find solution out of the total number of constraints that some solver can find solution. As expected, symbolic solving subsumes the other approaches for the 4 subjects that only generate decidable constraints. For the remaining 5 subjects, which contain undecidable constraints, the hybrid solvers achieved the highest precision (fraction of constraints that a solver can find a solution out of the total number of satisfiable constraints). We also observed that the solvers were complementary, which suggests that one should alternate their use in iterations of a concolic execution driver. 相似文献
76.
Karol MalechaAuthor Vitae Dorota G. PijanowskaAuthor VitaeLeszek J. GolonkaAuthor Vitae Piotr KurekAuthor Vitae 《Sensors and actuators. B, Chemical》2011,155(2):923-929
This article presents design, fabrication and testing of a miniature ceramic-based biosensor which is destined for continuous glucose monitoring. It is fabricated using well known LTCC (low temperature co-fired ceramics) technology. The biosensor consists of a microreaction chamber, three thick-film electrodes and a microdialysis tube. The detection process is based on oxidation of glucose by molecular oxygen in the presence of enzyme - glucose oxidase, GOx. One of the reaction products is a hydrogen peroxide which is detected amperometrically during its oxidation at a working electrode. Computational fluid dynamics (CFD) analysis was used for optimization of the biosensor geometry and considerations of the influence of operating conditions (flow rate) on mass transfer (diffusion) of the glucose within the microreaction chamber. Tests of the developed LTCC-based biosensor indicate its linear response to glucose concentration up to 9 mM with a relatively high sensitivity of about 147 nA/mM. Moreover, the properties of the presented ceramic biosensor are compared with properties of a similar device made in silicon/glass and in Perspex®. 相似文献
77.
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. 相似文献
78.
Marc Baboulin Alfredo Buttari Jack Dongarra Jakub Kurzak Julie Langou Julien Langou Piotr Luszczek Stanimire Tomov 《Computer Physics Communications》2009,180(12):2526-2533
On modern architectures, the performance of 32-bit operations is often at least twice as fast as the performance of 64-bit operations. By using a combination of 32-bit and 64-bit floating point arithmetic, the performance of many dense and sparse linear algebra algorithms can be significantly enhanced while maintaining the 64-bit accuracy of the resulting solution. The approach presented here can apply not only to conventional processors but also to other technologies such as Field Programmable Gate Arrays (FPGA), Graphical Processing Units (GPU), and the STI Cell BE processor. Results on modern processor architectures and the STI Cell BE are presented.
Program summary
Program title: ITER-REFCatalogue identifier: AECO_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AECO_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.: 7211No. of bytes in distributed program, including test data, etc.: 41 862Distribution format: tar.gzProgramming language: FORTRAN 77Computer: desktop, serverOperating system: Unix/LinuxRAM: 512 MbytesClassification: 4.8External routines: BLAS (optional)Nature of problem: On modern architectures, the performance of 32-bit operations is often at least twice as fast as the performance of 64-bit operations. By using a combination of 32-bit and 64-bit floating point arithmetic, the performance of many dense and sparse linear algebra algorithms can be significantly enhanced while maintaining the 64-bit accuracy of the resulting solution.Solution method: Mixed precision algorithms stem from the observation that, in many cases, a single precision solution of a problem can be refined to the point where double precision accuracy is achieved. A common approach to the solution of linear systems, either dense or sparse, is to perform the LU factorization of the coefficient matrix using Gaussian elimination. First, the coefficient matrix A is factored into the product of a lower triangular matrix L and an upper triangular matrix U. Partial row pivoting is in general used to improve numerical stability resulting in a factorization PA=LU, where P is a permutation matrix. The solution for the system is achieved by first solving Ly=Pb (forward substitution) and then solving Ux=y (backward substitution). Due to round-off errors, the computed solution, x, carries a numerical error magnified by the condition number of the coefficient matrix A. In order to improve the computed solution, an iterative process can be applied, which produces a correction to the computed solution at each iteration, which then yields the method that is commonly known as the iterative refinement algorithm. Provided that the system is not too ill-conditioned, the algorithm produces a solution correct to the working precision.Running time: seconds/minutes 相似文献79.
Of the very few practical implementations of program slicing algorithms, the majority deal with C/C++ programs. Yet, preprocessor-related issues have been marginally addressed by these slicers, despite the fact that ignoring (or only partially handling) these constructs may lead to serious inaccuracies in the slicing results and hence in the program analysis task being performed. Recently, an accurate slicing method for preprocessor-related constructs has been proposed, which-when combined with existing C/C++ language slicers-can provide more complete slices and hence a more successful analysis of programs written in one of these languages. In this paper, we present our approach which combines the two slicing methods and, via practical experiments, describe its benefits in terms of the completeness of the resulting slices. 相似文献
80.
This article deals with a local improvement of domain decomposition methods for 2-dimensional elliptic problems for which
either the geometry or the domain decomposition presents conical singularities. After explaining the main results of the theoretical
analysis carried out in Chniti et al. (Calcolo 45, 2008), the numerical experiments presented in this article confirm the optimality properties of the new interface conditions. 相似文献