全文获取类型
收费全文 | 2315篇 |
免费 | 113篇 |
国内免费 | 6篇 |
专业分类
电工技术 | 11篇 |
综合类 | 1篇 |
化学工业 | 382篇 |
金属工艺 | 26篇 |
机械仪表 | 38篇 |
建筑科学 | 130篇 |
矿业工程 | 11篇 |
能源动力 | 34篇 |
轻工业 | 419篇 |
水利工程 | 13篇 |
石油天然气 | 15篇 |
无线电 | 102篇 |
一般工业技术 | 285篇 |
冶金工业 | 617篇 |
原子能技术 | 3篇 |
自动化技术 | 347篇 |
出版年
2023年 | 15篇 |
2022年 | 21篇 |
2021年 | 36篇 |
2020年 | 26篇 |
2019年 | 44篇 |
2018年 | 39篇 |
2017年 | 43篇 |
2016年 | 45篇 |
2015年 | 38篇 |
2014年 | 63篇 |
2013年 | 178篇 |
2012年 | 79篇 |
2011年 | 140篇 |
2010年 | 112篇 |
2009年 | 95篇 |
2008年 | 126篇 |
2007年 | 127篇 |
2006年 | 113篇 |
2005年 | 91篇 |
2004年 | 74篇 |
2003年 | 77篇 |
2002年 | 79篇 |
2001年 | 44篇 |
2000年 | 47篇 |
1999年 | 43篇 |
1998年 | 42篇 |
1997年 | 37篇 |
1996年 | 44篇 |
1995年 | 30篇 |
1994年 | 51篇 |
1993年 | 40篇 |
1992年 | 24篇 |
1991年 | 12篇 |
1990年 | 34篇 |
1989年 | 33篇 |
1988年 | 24篇 |
1987年 | 28篇 |
1986年 | 29篇 |
1985年 | 22篇 |
1984年 | 27篇 |
1983年 | 22篇 |
1982年 | 13篇 |
1981年 | 15篇 |
1980年 | 13篇 |
1979年 | 11篇 |
1978年 | 11篇 |
1977年 | 16篇 |
1976年 | 11篇 |
1975年 | 11篇 |
1974年 | 7篇 |
排序方式: 共有2434条查询结果,搜索用时 781 毫秒
61.
62.
The discretely-scaled string indexing problem asks one to preprocess a given text string T, so that for a queried pattern P, the matched positions in T that P appears with some discrete scale can be reported efficiently. For solving this problem, Wang et al. first show that with an O(|T|log|T|)-time preprocessing on T, all matched positions can be reported in O(|P|+Ud) time, where |T|, |P|, and Ud denote the length of T, the length of P, and the number of matched positions for discretely-scaled P in T, respectively. In this paper, for fixed alphabets we propose the first-known optimal indexing algorithm that takes O(|T|) and O(|P|+Ud) time in its preprocessing and query phases, respectively. For integer and unbounded alphabets, our new algorithm can also be extended to obtain the best-known results. 相似文献
63.
Geert Poels Ann Maes Frederik Gailly Roland Paemeleire 《Information Systems Journal》2011,21(1):63-89
The Resources‐Events‐Agents (REA) model is a semantic data model for the development of enterprise information systems. Although this model has been proposed as a benchmark for enterprise information modelling, only few studies have attempted to empirically validate the claimed benefits of REA modelling. Moreover, these studies focused on the evaluation of REA‐based system implementations rather than directly assessing the REA‐modelled conceptual schemas that these systems are based on. This paper presents a laboratory experiment that measured the user understanding of diagrammatic conceptual schemas developed using the REA model. The theoretical foundation for the hypotheses are cognitive theories that explain pattern recognition phenomena and the resulting reduction in cognitive effort for understanding conceptual schemas. The results of the experiment indicate a more accurate understanding of the business processes and policies modelled when users recognize the REA model’s core pattern of enterprise information in the diagram. The implication for modelling practice is that the use of the REA model improves the requirements engineering process by facilitating the user validation of conceptual schemas produced by analysts, and thus helps ensuring the quality of the enterprise information system that is developed or implemented. 相似文献
64.
Breast cancer is one of the most common cancers diagnosed in women. Large margin classifiers like the support vector machine (SVM) have been reported effective in computer-assisted diagnosis systems for breast cancers. However, since the separating hyperplane determination exclusively relies on support vectors, the SVM is essentially a local classifier and its performance can be further improved. In this work, we introduce a structured SVM model to determine if each mammographic region is normal or cancerous by considering the cluster structures in the training set. The optimization problem in this new model can be solved efficiently by being formulated as one second order cone programming problem. Experimental evaluation is performed on the Digital Database for Screening Mammography (DDSM) dataset. Various types of features, including curvilinear features, texture features, Gabor features, and multi-resolution features, are extracted from the sample images. We then select the salient features using the recursive feature elimination algorithm. The structured SVM achieves better detection performance compared with a well-tested SVM classifier in terms of the area under the ROC curve. 相似文献
65.
Traditional and fuzzy cluster analyses are applicable to variables whose values are uncorrelated. Hence, in order to cluster time series data which are usually serially correlated, one needs to extract features from the time series, the values of which are uncorrelated. The periodogram which is an estimator of the spectral density function of a time series is a feature that can be used in the cluster analysis of time series because its ordinates are uncorrelated. Additionally, the normalized periodogram and the logarithm of the normalized periodogram are also features that can be used. In this paper, we consider a fuzzy clustering approach for time series based on the estimated cepstrum. The cepstrum is the spectrum of the logarithm of the spectral density function. We show in our simulation studies for the typical generating processes that have been considered, fuzzy clustering based on the cepstral coefficients performs very well compared to when it is based on other features. 相似文献
66.
Ann Q. Gates Steve Roach Oscar Mondragon Nelly Delgado 《Electronic Notes in Theoretical Computer Science》2001,55(2):164-180
Software engineering strives to enable the economic construction of software systems that behave reliably, predictably, and safely. In other engineering disciplines, safety is assured in part by detailed monitoring of processes. In software, we may achieve some level of confidence in the operation of programs by monitoring their execution. DynaMICs is a software tool that facilitates the collection and use of constraints for software systems. In addition, it supports traceability by mapping constraints to system artifacts. Constraint specifications are stored separately from code; constraint-monitoring code is automatically generated from the specifications and inserted into the program at appropriate places; and constraints are verified at execution time. These constraint checks are triggered by changes made to variable values. We describe the architecture of DynaMICs, discuss alternative verification techniques, and outline research directions for the DynaMICs project. 相似文献
67.
Ann Monté Pieter Bauwens Stefaan Maeyaert Jan Doutreloigne 《Journal of the Society for Information Display》2008,16(11):1171-1180
Abstract— A new bistable‐display driver is presented. The innovation in the developed driver is the addition of a new logical block that calculates the most energy‐efficient driving waveforms. In this paper, the algorithms being applied to the row and column waveforms in order to reduce the power consumption are discussed. Some theoretical as well as experimental results are shown, proving a reduction in the power consumption by about 50%. The proposed algorithms are especially important for battery‐powered applications. 相似文献
68.
Kinematics of heelstrike during walking and carrying: implications for slip resistance testing 总被引:1,自引:0,他引:1
Slip resistance measurements of shoes and floors are used to evaluate the potential for slip and fall injuries. These measurements are believed to have increased validity when they more closely reflect actual heelstrike biomechanics during locomotion. The purpose of this study was to describe heelstrike kinematics during load carrying to provide data towards improved slip resistance testing. Foot kinematics during load carrying (unladen and carrying from 0 to 13.5 kg) at various cadences (70, 90, 100 steps/min) was recorded. Measures before, during and after heelstrike were analysed. Cadence was an important predictor for all variables measured, associated with changes from 13% to over 100%. The load carried was an important predictor for only the heel slip distance after heelstrike, but this effect needs to be investigated further. These results can be used to improve the fidelity of slip resistance measurements, which is critical to reduce slip and fall injuries in the workplace or during activities of daily living. 相似文献
69.
Ann Blandford 《Expert Systems》2001,18(1):3-18
As more intelligent systems are introduced into the marketplace, it is becoming increasingly urgent to consider usability for such systems. Historically, the two fields of artificial intelligence (AI) and human- computer interaction (HCI) have had little in common. In this paper, we consider how established HCI techniques can usefully be applied to the design and evaluation of intelligent systems, and where there is an urgent need for new approaches. Some techniques - notably those for requirements acquisition and empirical evaluation - can usefully be adopted, and indeed are, within many projects. However, many of the tools and techniques developed within HCI to support design and theory-based evaluation cannot be applied in their present forms to intelligent systems because they are based on inappropriate assumptions; there is consequently a need for new approaches. Conversely, there are approaches that have been developed within AI - e.g. in research on dialogue and on ontologies - that could usefully be adapted and encapsulated to respond to this need. These should form the core of a future research agenda for intelligent interaction design. 相似文献
70.
Ann Maria Bell 《Computational Economics》2001,18(1):89-110
This paper examines the performance of simple reinforcement learningalgorithms in a stationary environment and in a repeated game where theenvironment evolves endogenously based on the actions of other agents. Sometypes of reinforcement learning rules can be extremely sensitive to smallchanges in the initial conditions, consequently, events early in a simulationcan affect the performance of the rule over a relatively long time horizon.However, when multiple adaptive agents interact, algorithms that performedpoorly in a stationary environment often converge rapidly to a stableaggregate behaviors despite the slow and erratic behavior of individuallearners. Algorithms that are robust in stationary environments can exhibitslow convergence in an evolving environment. 相似文献