全文获取类型
收费全文 | 908篇 |
免费 | 91篇 |
国内免费 | 2篇 |
专业分类
电工技术 | 19篇 |
综合类 | 1篇 |
化学工业 | 222篇 |
金属工艺 | 17篇 |
机械仪表 | 24篇 |
建筑科学 | 36篇 |
矿业工程 | 6篇 |
能源动力 | 26篇 |
轻工业 | 94篇 |
水利工程 | 7篇 |
无线电 | 87篇 |
一般工业技术 | 180篇 |
冶金工业 | 16篇 |
原子能技术 | 20篇 |
自动化技术 | 246篇 |
出版年
2024年 | 3篇 |
2023年 | 12篇 |
2022年 | 33篇 |
2021年 | 66篇 |
2020年 | 46篇 |
2019年 | 32篇 |
2018年 | 33篇 |
2017年 | 39篇 |
2016年 | 45篇 |
2015年 | 33篇 |
2014年 | 45篇 |
2013年 | 67篇 |
2012年 | 64篇 |
2011年 | 76篇 |
2010年 | 50篇 |
2009年 | 51篇 |
2008年 | 50篇 |
2007年 | 26篇 |
2006年 | 42篇 |
2005年 | 27篇 |
2004年 | 19篇 |
2003年 | 21篇 |
2002年 | 22篇 |
2001年 | 14篇 |
2000年 | 6篇 |
1999年 | 13篇 |
1998年 | 8篇 |
1997年 | 6篇 |
1996年 | 9篇 |
1995年 | 5篇 |
1994年 | 6篇 |
1993年 | 3篇 |
1992年 | 7篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1987年 | 3篇 |
1986年 | 5篇 |
1985年 | 2篇 |
1984年 | 3篇 |
1983年 | 2篇 |
1981年 | 2篇 |
1977年 | 1篇 |
排序方式: 共有1001条查询结果,搜索用时 62 毫秒
11.
Riccardo Carli Raymond Le Van Mao Claudia L. Blanchi Vittorio Ragaini 《Catalysis Letters》1993,21(3-4):265-274
Gallium species which were incorporated initially in the oxide form, were all in the (+3) oxidation state in the hybrid catalyst and exhibited two types of hydrogen chemisorption sites, shw and shs. The stronger sorption sites shs which predominated at higher gallium dispersion, corresponded probably to the most effective surface configuration for gallium in the aromatization ofn-butane. 相似文献
12.
Silk fibers and membranes were acylated with octadecenylsuccinic anhydride (ODSA) at 75°C for different times. Swelling [N,N‐dimethylformamide (DMF) and dimethyl sulfoxide (DMSO)] and nonswelling (xylene) solvent media were used for the reaction. Silk membranes that reacted in DMF or DMSO displayed faster reaction kinetics and attained higher weight‐gain values than fibers. The effect of the solvent on the reaction yield was in the following order: DMSO > DMF ? xylene. The Fourier transform infrared spectra of acylated silk samples showed the characteristic absorption bands of the anhydride at 2990, 2852, 1780–1700, and 1170 cm?1. The intensity of the latter band, which increased linearly with the weight gain, was used as a marker for evaluating the reaction kinetics of the samples acylated in the nonswelling medium. The moisture regain and water retention of silk fibers acylated with ODSA decreased significantly, regardless of the solvent system used. Accordingly, the water repellency increased. Acylation induced an increase in the thermal stability of the silk fibers and membranes. Fine particles adhering to the surfaces of the silk fibers acylated in xylene were detected by scanning electron microscopy. © 2003 Wiley Periodicals, Inc. J Appl Polym Sci 89: 324–332, 2003 相似文献
13.
The growing size and complexity of cloud systems determine scalability issues for resource monitoring and management. While most existing solutions consider each Virtual Machine (VM) as a black box with independent characteristics, we embrace a new perspective where VMs with similar behaviors in terms of resource usage are clustered together. We argue that this new approach has the potential to address scalability issues in cloud monitoring and management. In this paper, we propose a technique to cluster VMs starting from the usage of multiple resources, assuming no knowledge of the services executed on them. This innovative technique models VMs behavior exploiting the probability histogram of their resources usage, and performs smoothing-based noise reduction and selection of the most relevant information to consider for the clustering process. Through extensive evaluation, we show that our proposal achieves high and stable performance in terms of automatic VM clustering, and can reduce the monitoring requirements of cloud systems. 相似文献
14.
Automated formal verification of security protocols has been mostly focused on analyzing high-level abstract models which, however, are significantly different from real protocol implementations written in programming languages. Recently, some researchers have started investigating techniques that bring automated formal proofs closer to real implementations. This paper surveys these attempts, focusing on approaches that target the application code that implements protocol logic, rather than the libraries that implement cryptography. According to these approaches, libraries are assumed to correctly implement some models. The aim is to derive formal proofs that, under this assumption, give assurance about the application code that implements the protocol logic. The two main approaches of model extraction and code generation are presented, along with the main techniques adopted for each approach. 相似文献
15.
Chiara Damiani Dario Pescini Riccardo Colombo Sara Molinari Lilia Alberghina Marco Vanoni Giancarlo Mauri 《Natural computing》2014,13(3):321-331
Constraint-based modeling is largely used in computational studies of metabolism. We propose here a novel approach that aims to identify ensembles of flux distributions that comply with one or more target phenotype(s). The methodology has been tested on a small-scale model of yeast energy metabolism. The target phenotypes describe the differential pattern of ethanol production and O2 consumption observed in “Crabtree-positive” and “Crabtree-negative” yeasts in changing environment (i.e., when the upper limit of glucose uptake is varied). The ensembles were obtained either by selection among sampled flux distributions or by means of a search heuristic (genetic algorithm). The former approach provided indication about the probability to observe a given phenotype, but the resulting ensembles could not be unambiguously partitioned into “Crabtree-positive” and “Crabtree-negative” clusters. On the contrary well-separated clusters were obtained with the latter method. The cluster analysis further allowed identification of distinct groups within each target phenotype. The method may thus prove useful in characterizing the design principles underlying metabolic plasticity arising from evolving physio-pathological or developmental constraints. 相似文献
16.
Mollie B. Schear Arianna Neal Jadah S. Clarke Andrew P. Saab Carl B. Giller Riccardo Casalini Matthew Laskoski 《应用聚合物科学杂志》2021,138(12):50053
The preparation of highly aromatic elastomers from a bisphenol A-based divinyl-terminated resin and polymerization with various aromatic silane containing compounds utilizing a room temperature hydrosilylation reaction is demonstrated. The polymers exhibit high thermal and oxidative stability with 5% weight losses around 430 and 350°C and char yields ranging from 35% to 40%. The thermosets maintained their elastomeric properties with good hardness and mechanical properties as measured by elongation measurements. The toughness of the thermosets was not improved with the inclusion of aromatic moieties but the hardness did appear to increase with the addition of more aromatic groups. 相似文献
17.
Fabio Poiesi Riccardo Mazzon Andrea Cavallaro 《Computer Vision and Image Understanding》2013,117(10):1257-1272
We propose a generic online multi-target track-before-detect (MT-TBD) that is applicable on confidence maps used as observations. The proposed tracker is based on particle filtering and automatically initializes tracks. The main novelty is the inclusion of the target ID in the particle state, enabling the algorithm to deal with unknown and large number of targets. To overcome the problem of mixing IDs of targets close to each other, we propose a probabilistic model of target birth and death based on a Markov Random Field (MRF) applied to the particle IDs. Each particle ID is managed using the information carried by neighboring particles. The assignment of the IDs to the targets is performed using Mean-Shift clustering and supported by a Gaussian Mixture Model. We also show that the computational complexity of MT-TBD is proportional only to the number of particles. To compare our method with recent state-of-the-art works, we include a postprocessing stage suited for multi-person tracking. We validate the method on real-world and crowded scenarios, and demonstrate its robustness in scenes presenting different perspective views and targets very close to each other. 相似文献
18.
Francesco Bellotti Riccardo Berta Massimiliano Margarone Alessandro De Gloria 《Software》2008,38(12):1241-1259
The RFID technology is becoming ever more popular in the development of ubiquitous computing applications. A full exploitation of the RFID potential requires the study and implementation of human–computer interaction (HCI) modalities to be able to support wide usability by the target audience. This implies the need for programming methodologies specifically dedicated to support the easy and efficient prototyping of applications to have feedback from early tests with users. On the basis of our field‐working experience, we have designed oDect, a high‐level language and platform‐independent application programming interface (API), ad hoc designed to meet the needs of typical applications for mobile devices (smart phones and PDAs). oDect aims at allowing application developers to create their prototypes focusing on the needs of the final users, without having to care about the low‐level software that interacts with the RFID hardware. Further, in an end‐user developing (EUD) approach, oDect provides specific support for the application end‐user herself to cope with typical problems of RFID applications in detecting objects. We describe in detail the features of the API and discuss the findings of a test with four programmers, where we analyse and evaluate the use of the API in four sample applications. We also present results of an end‐user test, which investigated strengths and weaknesses of the territorial agenda (TA) concept. The TA is an RFID‐based citizen guide that aids—through time‐ and location‐based reminders—users in their daily activities in a city. The TA directly exploits EUD features of oDect, in particular concerning the possibility of linking detected objects with custom actions. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
19.
Boosting text segmentation via progressive classification 总被引:5,自引:4,他引:1
Eugenio Cesario Francesco Folino Antonio Locane Giuseppe Manco Riccardo Ortale 《Knowledge and Information Systems》2008,15(3):285-320
A novel approach for reconciling tuples stored as free text into an existing attribute schema is proposed. The basic idea
is to subject the available text to progressive classification, i.e., a multi-stage classification scheme where, at each intermediate stage, a classifier is learnt that analyzes the textual
fragments not reconciled at the end of the previous steps. Classification is accomplished by an ad hoc exploitation of traditional
association mining algorithms, and is supported by a data transformation scheme which takes advantage of domain-specific dictionaries/ontologies.
A key feature is the capability of progressively enriching the available ontology with the results of the previous stages
of classification, thus significantly improving the overall classification accuracy. An extensive experimental evaluation
shows the effectiveness of our approach. 相似文献
20.
In this paper we consider the p-ary transitive reduction (TR
p
) problem where p>0 is an integer; for p=2 this problem arises in inferring a sparsest possible (biological) signal transduction network consistent with a set of
experimental observations with a goal to minimize false positive inferences even if risking false negatives. Special cases
of TR
p
have been investigated before in different contexts; the best previous results are as follows:
In this paper, our contributions are as follows:
R. Albert’s research was partly supported by a Sloan Research Fellowship in Science and Technology.
B. DasGupta’s research was partly supported by NSF grants DBI-0543365, IIS-0612044 and IIS-0346973.
E. Sontag’s research was partly supported by NSF grants EIA 0205116 and DMS-0504557. 相似文献
(1) | The minimum equivalent digraph problem, that correspond to a special case of TR1 with no critical edges, is known to be MAX-SNP-hard, admits a polynomial time algorithm with an approximation ratio of 1.617+ε for any constant ε>0 (Chiu and Liu in Sci. Sin. 4:1396–1400, 1965) and can be solved in linear time for directed acyclic graphs (Aho et al. in SIAM J. Comput. 1(2):131–137, 1972). |
(2) | A 2-approximation algorithm exists for TR1 (Frederickson and JàJà in SIAM J. Comput. 10(2):270–283, 1981; Khuller et al. in 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 937–938, 1999). |
• | We observe that TR p , for any integer p>0, can be solved in linear time for directed acyclic graphs using the ideas in Aho et al. (SIAM J. Comput. 1(2):131–137, 1972). |
• | We provide a 1.78-approximation for TR1 that improves the 2-approximation mentioned in (2) above. |
• | We provide a 2+o(1)-approximation for TR p on general graphs for any fixed prime p>1. |