全文获取类型
收费全文 | 1670篇 |
免费 | 80篇 |
专业分类
电工技术 | 5篇 |
化学工业 | 750篇 |
金属工艺 | 20篇 |
机械仪表 | 38篇 |
建筑科学 | 51篇 |
能源动力 | 47篇 |
轻工业 | 282篇 |
水利工程 | 13篇 |
石油天然气 | 3篇 |
无线电 | 49篇 |
一般工业技术 | 193篇 |
冶金工业 | 59篇 |
原子能技术 | 6篇 |
自动化技术 | 234篇 |
出版年
2024年 | 2篇 |
2023年 | 26篇 |
2022年 | 159篇 |
2021年 | 185篇 |
2020年 | 57篇 |
2019年 | 50篇 |
2018年 | 39篇 |
2017年 | 42篇 |
2016年 | 69篇 |
2015年 | 63篇 |
2014年 | 58篇 |
2013年 | 124篇 |
2012年 | 92篇 |
2011年 | 121篇 |
2010年 | 76篇 |
2009年 | 77篇 |
2008年 | 102篇 |
2007年 | 64篇 |
2006年 | 33篇 |
2005年 | 45篇 |
2004年 | 35篇 |
2003年 | 36篇 |
2002年 | 33篇 |
2001年 | 15篇 |
2000年 | 15篇 |
1999年 | 19篇 |
1998年 | 20篇 |
1997年 | 13篇 |
1996年 | 11篇 |
1995年 | 11篇 |
1994年 | 10篇 |
1993年 | 8篇 |
1992年 | 7篇 |
1991年 | 4篇 |
1990年 | 2篇 |
1989年 | 1篇 |
1988年 | 4篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 4篇 |
1984年 | 1篇 |
1982年 | 2篇 |
1981年 | 4篇 |
1980年 | 1篇 |
1977年 | 3篇 |
1976年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有1750条查询结果,搜索用时 0 毫秒
21.
Marco Riani 《Computational statistics & data analysis》2010,54(12):3300-3312
The forward search provides data-driven flexible trimming of a Cp statistic for the choice of regression models that reveals the effect of outliers on model selection. An informed robust model choice follows. Even in small samples, the statistic has a null distribution indistinguishable from an F distribution. Limits on acceptable values of the Cp statistic follow. Two examples of widely differing size are discussed. A powerful graphical tool is the generalized candlestick plot, which summarizes the information on all forward searches and on the choice of models. A comparison is made with the use of M-estimation in robust model choice. 相似文献
22.
23.
Circular splicing systems are a formal model of a generative mechanism of circular words, inspired by a recombinant behaviour of circular DNA. Some unanswered questions are related to the computational power of such systems, and finding a characterization of the class of circular languages generated by circular splicing systems is still an open problem. In this paper we solve this problem for monotone complete systems, which are finite circular splicing systems with rules of a simpler form. We show that a circular language L is generated by a monotone complete system if and only if the set Lin(L) of all words corresponding to L is a pure unitary language generated by a set closed under the conjugacy relation. The class of pure unitary languages was introduced by A. Ehrenfeucht, D. Haussler, G. Rozenberg in 1983, as a subclass of the class of context-free languages, together with a characterization of regular pure unitary languages by means of a decidable property. As a direct consequence, we characterize (regular) circular languages generated by monotone complete systems. We can also decide whether the language generated by a monotone complete system is regular. Finally, we point out that monotone complete systems have the same computational power as finite simple systems, an easy type of circular splicing system defined in the literature from the very beginning, when only one rule of a specific type is allowed. From our results on monotone complete systems, it follows that finite simple systems generate a class of languages containing non-regular languages, showing the incorrectness of a longstanding result on simple systems. 相似文献
24.
SNPs are positions of the DNA sequences where the differences among individuals are embedded. The knowledge of such SNPs is crucial for disease association studies, but even if the number of such positions is low (about 1% of the entire sequence), the cost to extract the complete information is actually very high. Recent studies have shown that DNA sequences are structured into blocks of positions, that are conserved during evolution, where there is strong correlation among values (alleles) of different loci. To reduce the cost of extracting SNPs information, the block structure of the DNA has suggested to limit the process to a subset of SNPs, the so-called Tag SNPs, that are able to maintain the most of the information contained in the whole sequence. In this paper, we apply a technique for feature selection based on integer programming to the problem of Tag SNP selection. Moreover, to test the quality of our approach, we consider also the problem of SNPs reconstruction, i.e. the problem of deriving unknown SNPs from the value of Tag SNPs and propose two reconstruction methods, one based on a majority vote and the other on a machine learning approach. We test our algorithm on two public data sets of different nature, providing results that are, when comparable, in line with the related literature. One of the interesting aspects of the proposed method is to be found in its capability to deal simultaneously with very large SNPs sets, and, in addition, to provide highly informative reconstruction rules in the form of logic formulas. 相似文献
25.
Donato Di Paola David Naso Biagio Turchiano Grazia Cicirelli Arcangelo Distante 《Journal of Intelligent and Robotic Systems》2009,56(5):513-541
This paper focuses on the control system for an autonomous robot for the surveillance of indoor environments. Our approach
proposes a matrix-based formalism which allows us to merge in a single framework discrete-event supervisory control, conflict
resolution and reactive control. As a consequence, the robot is able to autonomously handle high level tasks as well as low-level
behaviors, solving control and decision-making issues simultaneously. Moreover, the matrix-based controller is modular and
can be easily reconfigured if mission characteristics or robot hardware configuration change. An illustrative example and
a report on experimental investigations are provided to illustrate the main features of the proposed approach. 相似文献
26.
27.
Luciano Baresi Vahid Rafe Adel T. Rahmani Paola Spoletini 《Electronic Notes in Theoretical Computer Science》2008,213(1):3
This paper presents an efficient solution for modeling checking graph transformation systems. The approach transforms AGG specifications into Bogor models and supports both attributed typed graphs and layered transformations. Resulting models are amenable to check interesting properties expressed as combinations of LTL (Linear Temporal Logic) and graph transformation rules. The first experimental results are encouraging and show that in most cases our proposal improves existing approaches, both in terms of performance and expressiveness. 相似文献
28.
29.
Claudia Tarantola Paola Vicard Ioannis Ntzoufras 《Expert systems with applications》2012,39(11):10103-10111
Mystery shopping is a well known marketing technique used by companies and marketing analysts to measure quality of service, and gather information about products and services. In this article, we analyse data from mystery shopping surveys via Bayesian Networks in order to examine and evaluate the quality of service offered by the loan departments of Greek Banks. We use mystery shopping visits to collect information about loan products and services and, by this way, evaluate the customer satisfaction and plan improvement strategies that will assist banks to reach their internal standards. Bayesian Networks not only provide a pictorial representation of the dependence structure between the characteristics of interest but also allow to evaluate, interpret and understand the effects of possible improvement strategies. 相似文献
30.
Anna Ciampolini Evelina Lamma Paola Mello Francesca Toni Paolo Torroni 《Annals of Mathematics and Artificial Intelligence》2003,37(1-2):65-91
This paper presents ALIAS, an agent architecture based on intelligent logic agents, where the main form of agent reasoning is abduction. The system is particularly suited for solving problems where knowledge is incomplete, where agents may need to make reasonable hypotheses about the problem domain and other agents, and where the raised hypotheses have to be consistent for the overall set of agents. ALIAS agents are pro-active, exhibiting a goal-directed behavior, and autonomous, since each one can solve problems using its own private knowledge base. ALIAS agents are also social, because they are able to interact with other agents, in order to cooperatively solve problems. The coordination mechanisms are modeled by means of LAILA, a logic-based language which allows to express intra-agent reasoning and inter-agent coordination. As an application, we show how LAILA can be used to implement inter-agent dialogues, e.g., for negotiation. In particular, LAILA is well-suited to coordinate the process of negotiation aimed at exchanging resources between agents, thus allowing them to execute the plans to achieve their goals. 相似文献