全文获取类型
收费全文 | 1386篇 |
免费 | 70篇 |
国内免费 | 8篇 |
专业分类
电工技术 | 20篇 |
综合类 | 5篇 |
化学工业 | 313篇 |
金属工艺 | 39篇 |
机械仪表 | 40篇 |
建筑科学 | 39篇 |
矿业工程 | 7篇 |
能源动力 | 72篇 |
轻工业 | 59篇 |
水利工程 | 9篇 |
石油天然气 | 2篇 |
无线电 | 197篇 |
一般工业技术 | 251篇 |
冶金工业 | 167篇 |
原子能技术 | 16篇 |
自动化技术 | 228篇 |
出版年
2023年 | 21篇 |
2022年 | 37篇 |
2021年 | 40篇 |
2020年 | 41篇 |
2019年 | 42篇 |
2018年 | 52篇 |
2017年 | 40篇 |
2016年 | 52篇 |
2015年 | 36篇 |
2014年 | 40篇 |
2013年 | 99篇 |
2012年 | 66篇 |
2011年 | 75篇 |
2010年 | 36篇 |
2009年 | 58篇 |
2008年 | 57篇 |
2007年 | 49篇 |
2006年 | 21篇 |
2005年 | 35篇 |
2004年 | 31篇 |
2003年 | 26篇 |
2002年 | 19篇 |
2001年 | 19篇 |
2000年 | 16篇 |
1999年 | 12篇 |
1998年 | 47篇 |
1997年 | 28篇 |
1996年 | 24篇 |
1995年 | 20篇 |
1994年 | 19篇 |
1993年 | 22篇 |
1992年 | 21篇 |
1991年 | 15篇 |
1990年 | 14篇 |
1989年 | 11篇 |
1988年 | 19篇 |
1987年 | 14篇 |
1986年 | 17篇 |
1985年 | 22篇 |
1984年 | 21篇 |
1983年 | 11篇 |
1982年 | 17篇 |
1981年 | 11篇 |
1980年 | 11篇 |
1978年 | 9篇 |
1977年 | 9篇 |
1976年 | 10篇 |
1974年 | 6篇 |
1973年 | 9篇 |
1971年 | 7篇 |
排序方式: 共有1464条查询结果,搜索用时 31 毫秒
31.
Engineering with Computers - This paper is devoted to numerical investigations on mechanical behavior of cracked composite functionally graded (FG) plates. We thus develop an efficient adaptive... 相似文献
32.
33.
Tien Van Do 《Acta Informatica》2010,47(1):67-75
In this paper we introduce the new M/M/1 retrial queue with working vacations which is motivated by the performance analysis
of a Media Access Control function in wireless systems. We give a condition for the stability of the model, which has an important
impact on setting the retrial rate for such systems. We derive the closed form solution in equilibrium for the retrial M/M/1
queue with working vacations, and we also show that the conditional stochastic decomposition holds for this model as well. 相似文献
34.
Bruno H. G. Barbosa Lam T. Bui Hussein A. Abbass Luis A. Aguirre Ant?nio P. Braga 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2011,15(9):1735-1747
This paper presents two new approaches for constructing an ensemble of neural networks (NN) using coevolution and the artificial
immune system (AIS). These approaches are extensions of the CLONal Selection Algorithm for building ENSembles (CLONENS) algorithm.
An explicit diversity promotion technique was added to CLONENS and a novel coevolutionary approach to build neural ensembles
is introduced, whereby two populations representing the gates and the individual NN are coevolved. The former population is
responsible for defining the ensemble size and selecting the members of the ensemble. This population is evolved using the
differential evolution algorithm. The latter population supplies the best individuals for building the ensemble, which is
evolved by AIS. Results show that it is possible to automatically define the ensemble size being also possible to find smaller
ensembles with good generalization performance on the tested benchmark regression problems. More interestingly, the use of
the diversity measure during the evolutionary process did not necessarily improve generalization. In this case, diverse ensembles
may be found using only implicit diversity promotion techniques. 相似文献
35.
A challenge in building pervasive and smart spaces is to learn and recognize human activities of daily living (ADLs). In this paper, we address this problem and argue that in dealing with ADLs, it is beneficial to exploit both their typical duration patterns and inherent hierarchical structures. We exploit efficient duration modeling using the novel Coxian distribution to form the Coxian hidden semi-Markov model (CxHSMM) and apply it to the problem of learning and recognizing ADLs with complex temporal dependencies. The Coxian duration model has several advantages over existing duration parameterization using multinomial or exponential family distributions, including its denseness in the space of nonnegative distributions, low number of parameters, computational efficiency and the existence of closed-form estimation solutions. Further we combine both hierarchical and duration extensions of the hidden Markov model (HMM) to form the novel switching hidden semi-Markov model (SHSMM), and empirically compare its performance with existing models. The model can learn what an occupant normally does during the day from unsegmented training data and then perform online activity classification, segmentation and abnormality detection. Experimental results show that Coxian modeling outperforms a range of baseline models for the task of activity segmentation. We also achieve a recognition accuracy competitive to the current state-of-the-art multinomial duration model, while gaining a significant reduction in computation. Furthermore, cross-validation model selection on the number of phases K in the Coxian indicates that only a small K is required to achieve the optimal performance. Finally, our models are further tested in a more challenging setting in which the tracking is often lost and the activities considerably overlap. With a small amount of labels supplied during training in a partially supervised learning mode, our models are again able to deliver reliable performance, again with a small number of phases, making our proposed framework an attractive choice for activity modeling. 相似文献
36.
37.
This paper investigates the use of artificial intelligent models as virtual sensors to predict relevant emissions such as
carbon dioxide, carbon monoxide, unburnt hydrocarbons and oxides of nitrogen for a hydrogen powered car. The virtual sensors
are developed by means of application of various Artificial Intelligent (AI) models namely; AI software built at the University
of Tasmania, back-propagation neural networks with Levenberg–Marquardt algorithm, and adaptive neuro-fuzzy inference systems.
These predictions are based on the study of qualitative and quantitative effects of engine process parameters such as mass
airflow, engine speed, air-to-fuel ratio, exhaust gas temperature and engine power on the harmful exhaust gas emissions. All
AI models show good predictive capability in estimating the emissions. However, excellent accuracy is achieved when using
back-propagation neural networks with Levenberg–Marquardt algorithm in estimating emissions for various hydrogen engine operating
conditions with the predicted values less than 6% of percentage average root mean square error. 相似文献
38.
Te-Hsiu Sun Fang-Cheng Tien Fang-Chih Tien Ren-Jieh Kuo 《Journal of Intelligent Manufacturing》2016,27(3):639-651
Machine vision is an excellent tool for inspecting a variety of items such as textiles, fruit, printed circuit boards, electrical components, labels, integrated circuits, machine tools, etc. This paper presents an intelligent system that incorporates machine vision with artificial intelligent networks to automatically inspect thermal fuses. An effective inspection flow is proposed to detect four commonly seen defects, including black-dot, small-head, bur, and flake during the production of thermal fuses. Backpropagation neural networks and learning vector quantization performance is compared in detecting the bur defect because of its illegibility. Different numbers of defective samples were screened out from a production line in a case study company and used to demonstrate the efficacy of the proposed system. Currently, the proposed inspection system is operating at the case study company, replacing four to six human inspectors. The system not only ensures the quality of the thermal fuses produced, but also reduced the cost of manual visual inspection. 相似文献
39.
Tien Van DoAuthor Vitae 《Performance Evaluation》2011,68(4):330-337
In this paper, we consider a queueing model extension for a manufacturing cell composed of a machining center and several parallel downstream production stations under a rotation rule. A queueing model is extended with the arrival processes of negative customers to capture failures of production stations, reorganization of works and disasters in the manufacturing cell. We present an exact solution for the steady-state probabilities of the proposed queueing model. The solution does not require the approximation of the infinite sum. In addition, it provides an alternative way to compute the rate matrix for the matrix-geometric method as well. 相似文献
40.
The contribution of this paper is threefold. First, we present the paradigm of snap-stabilization. A snap- stabilizing protocol guarantees that, starting from an arbitrary system configuration, the protocol always behaves
according to its specification. So, a snap-stabilizing protocol is a time optimal self-stabilizing protocol (because it stabilizes
in 0 rounds). Second, we propose a new Propagation of Information with Feedback (PIF) cycle, called Propagation of Information with Feedback and Cleaning (). We show three different implementations of this new PIF. The first one is a basic cycle which is inherently snap-stabilizing. However, the first PIF cycle can be delayed O(h
2) rounds (where h is the height of the tree) due to some undesirable local states. The second algorithm improves the worst delay of the basic
algorithm from O(h
2) to 1 round. The state requirement for the above two algorithms is 3 states per processor, except for the root and leaf processors
that use only 2 states. Also, they work on oriented trees. We then propose a third snap-stabilizing PIF algorithm on un-oriented
tree networks. The state requirement of the third algorithm depends on the degree of the processors, and the delay is at most
h rounds. Next, we analyze the maximum waiting time before a PIF cycle can be initiated whether the PIF cycle is infinitely
and sequentially repeated or launch as an isolated PIF cycle. The analysis is made for both oriented and un-oriented trees.
We show or conjecture that the two best of the above algorithms produce optimal waiting time. Finally, we compute the minimal
number of states the processors require to implement a single PIF cycle, and show that both algorithms for oriented trees
are also (in addition to being time optimal) optimal in terms of the number of states.
WARNING: The concept of snap-stabilization was first introduced in [12]. The concept evolved over the last eight years. We
take this evolution in consideration in this paper, which includes the early results published in [10] and [12]. In particular,
infinite repetition of computation cycles is a requirement of self-stabilizing systems. This is not required in snap-stabilization because snap-stabilization ensures that the first completed computation cycle is executed according to the
specification of the problem. The correctness proofs conform to this basic property. 相似文献