全文获取类型
收费全文 | 205篇 |
免费 | 14篇 |
专业分类
化学工业 | 81篇 |
金属工艺 | 5篇 |
机械仪表 | 10篇 |
建筑科学 | 5篇 |
矿业工程 | 1篇 |
能源动力 | 10篇 |
轻工业 | 37篇 |
石油天然气 | 2篇 |
无线电 | 1篇 |
一般工业技术 | 24篇 |
冶金工业 | 8篇 |
原子能技术 | 4篇 |
自动化技术 | 31篇 |
出版年
2023年 | 2篇 |
2022年 | 5篇 |
2021年 | 10篇 |
2020年 | 10篇 |
2019年 | 8篇 |
2018年 | 5篇 |
2017年 | 11篇 |
2016年 | 12篇 |
2015年 | 7篇 |
2014年 | 12篇 |
2013年 | 20篇 |
2012年 | 14篇 |
2011年 | 16篇 |
2010年 | 16篇 |
2009年 | 9篇 |
2008年 | 11篇 |
2007年 | 7篇 |
2006年 | 9篇 |
2005年 | 3篇 |
2004年 | 6篇 |
2003年 | 4篇 |
2002年 | 4篇 |
2001年 | 1篇 |
2000年 | 3篇 |
1999年 | 2篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1996年 | 1篇 |
1994年 | 1篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1981年 | 1篇 |
1975年 | 1篇 |
1974年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有219条查询结果,搜索用时 15 毫秒
1.
Cagnon Christine; Valverde Viviane; Masson Jean-Michel 《Protein engineering, design & selection : PEDS》1991,4(7):843-847
A set of 11 expression vectors was constructed, each of themharbouring a cloning cassette under the control of the promoter.Some of these vectors enable expression of foreign proteinsin the cytoplasm, while others include a synthetic sequencecoding for a very efficient secretion signal sequence. Otherfeatures are an fl origin of replication (in plus or minus orientation)and a promoterup mutation that enhances the already very highlevel of expression from these vectors. With such a versatilevector family, cloning, sequencing and sitedirected mutagenesiscan be performed on the same vector, and the level of expressioncan be defined according to the specific constraints of a givenprotein. 相似文献
2.
3.
This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover
a wide class of optimality criteria we start out by introducing an extension of the (priced) timed automata model that includes
both costs and rewards as separate modelling features. A precise definition is then given of what constitutes optimal infinite
behaviours for this class of models. We subsequently show that the derivation of optimal non-terminating schedules for such
double-priced timed automata is computable. This is done by a reduction of the problem to the determination of optimal mean-cycles
in finite graphs with weighted edges. This reduction is obtained by introducing the so-called corner-point abstraction, a
powerful abstraction technique of which we show that it preserves optimal schedules.
This work has been mostly done while visiting CISS at Aalborg University in Denmark and has been supported by CISS and by
ACI Cortos, a program of the French Ministry of Research. 相似文献
4.
N. Férey J. Nelson C. Martin L. Picinali G. Bouyer A. Tek P. Bourdot J. M. Burkhardt B. F. G. Katz M. Ammi C. Etchebest L. Autin 《Virtual Reality》2009,13(4):273-293
Proteins take on their function in the cell by interacting with other proteins or biomolecular complexes. To study this process, computational methods, collectively named protein docking, are used to predict the position and orientation of a protein ligand when it is bound to a protein receptor or enzyme, taking into account chemical or physical criteria. This process is intensively studied to discover new biological functions for proteins and to better understand how these macromolecules take on these functions at the molecular scale. Pharmaceutical research also employs docking techniques for a variety of purposes, most notably in the virtual screening of large databases of available chemicals to select likely molecular candidates for drug design. The basic hypothesis of our work is that Virtual Reality (VR) and multimodal interaction can increase efficiency in reaching and analysing docking solutions, in addition to fully a computational docking approach. To this end, we conducted an ergonomic analysis of the protein–protein current docking task as it is carried out today. Using these results, we designed an immersive and multimodal application where VR devices, such as the three-dimensional mouse and haptic devices, are used to interactively manipulate two proteins to explore possible docking solutions. During this exploration, visual, audio, and haptic feedbacks are combined to render and evaluate chemical or physical properties of the current docking configuration. 相似文献
5.
Carina F. Dorneles Marcos Freitas Nunes Carlos A. Heuser Viviane P. Moreira Altigran S. da Silva Edleno S. de Moura 《Information Systems》2009,34(8):673
Approximate data matching aims at assessing whether two distinct instances of data represent the same real-world object. The comparison between data values is usually done by applying a similarity function which returns a similarity score. If this score surpasses a given threshold, both data instances are considered as representing the same real-world object. These score values depend on the algorithm that implements the function and have no meaning to the user. In addition, score values generated by different functions are not comparable. This will potentially lead to problems when the scores returned by different similarity functions need to be combined for computing the similarity between records. In this article, we propose that thresholds should be defined in terms of the precision that is expected from the matching process rather than in terms of the raw scores returned by the similarity function. Precision is a widely known similarity metric and has a clear interpretation from the user's point of view. Our approach defines mappings from score values to precision values, which we call adjusted scores. In order to obtain such mappings, our approach requires training over a small dataset. Experiments show that training can be reused for different datasets on the same domain. Our results also demonstrate that existing methods for combining scores for computing the similarity between records may be enhanced if adjusted scores are used. 相似文献
6.
Algebra offers an elegant and powerful approach to understand regular languages and finite automata. Such framework has been notoriously lacking for timed languages and timed automata. We introduce the notion of monoid recognizability for data languages, which includes timed languages as special case, in a way that respects the spirit of the classical situation. We study closure properties and hierarchies in this model and prove that emptiness is decidable under natural hypotheses. Our class of recognizable languages properly includes many families of deterministic timed languages that have been proposed until now, and the same holds for non-deterministic versions. 相似文献
7.
Forward Analysis of Updatable Timed Automata 总被引:1,自引:2,他引:1
Patricia Bouyer 《Formal Methods in System Design》2004,24(3):281-320
Timed automata are a widely studied model. Its decidability has been proved using the so-called region automaton construction. This construction provides a correct abstraction for the behaviours of timed automata, but it suffers from a state explosion and is thus not used in practice. Instead, algorithms based on the notion of zones are implemented using adapted data structures like DBMs. When we focus on forward analysis algorithms, the exact computation of all the successors of the initial configurations does not always terminate. Thus, some abstractions are often used to ensure termination, among which, a widening operator on zones.In this paper, we study in detail this widening operator and the corresponding forward analysis algorithm. This algorithm is most used and implemented in tools like KRONOS and UPPAAL. One of our main results is that it is hopeless to find a forward analysis algorithm for general timed automata, that uses such a widening operator, and which is correct. This goes really against what one could think. We then study in detail this algorithm in the more general framework of updatable timed automata, a model which has been introduced as a natural syntactic extension of classical timed automata. We describe subclasses of this model for which a correct widening operator can be found. 相似文献
8.
Viviane Torres Da Silva Carlos J. P. De Lucena 《Autonomous Agents and Multi-Agent Systems》2004,9(1-2):145-189
In this paper we propose a multi-agent system modeling language (MAS-ML) that extends UML (Unified Modeling Language) based on structural and dynamic properties presented in a conceptual framework (metamodel) called Taming Agents and Objects (TAO). Our focus is the adaptation according to TAO concepts of the static Class diagram and the interaction Sequence diagram proposed by UML. These two diagrams have been chosen because they are the most commonly used and because it is possible to use them to illustrate both the structural and dynamic aspects of TAO metamodel. We propose a conservative extension of the UML metamodel, which includes agent-related notions that are part of the TAO conceptual framework while preserving all object-related concepts, which constitute the UML metamodel. The main difference between our approach and the others presented in the literature is the clear definition and representation of the elements that compose MASs and their corresponding behavior. In order to extend UML with TAO non-object concepts, it is not possible to use only the three basic extensions mechanisms provided by UML and new metaclasses and stereotypes have been created and associated with the UML metamodel. 相似文献
9.
João P. F. Mota Viviane G. P. Ribeiro Fernando L. F. da Silva Antônio E. C. Junior Davi R. Oliveira Lloyd R. V. Kotzebue 《分离科学与技术》2016,51(14):2473-2483
The present work made a comparative study between two purification methods, column chromatography and recrystallization, for compounds derived from cardanol, a by-product of the cashew industry (Anacardium occidentale L.). The compounds were successfully synthesized and characterized, focusing our attention to results obtained in terms of yield, purity, generation of solid waste and amount of solvent used in each purification process. For all the synthesized compounds, the amount of solvent used was greatly reduced in the recrystallization process, with purities above 80%, when compared to chromatographic column, which still demands high amounts of eluent. 相似文献
10.
Viviane Muniz da Silva Fragoso Carla Patrícia de Morais Coura Luanda Yanaan Hoppe Marília Amável Gomes Soares Dilson Silva Celia Martins Cortez 《International journal of molecular sciences》2016,17(1)
The aim of this work was to study the interaction of sulpiride with human serum albumin (HSA) and bovine serum albumin (BSA) through the fluorescence quenching technique. As sulpiride molecules emit fluorescence, we have developed a simple mathematical model to discriminate the quencher fluorescence from the albumin fluorescence in the solution where they interact. Sulpiride is an antipsychotic used in the treatment of several psychiatric disorders. We selectively excited the fluorescence of tryptophan residues with 290 nm wavelength and observed the quenching by titrating HSA and BSA solutions with sulpiride. Stern-Volmer graphs were plotted and quenching constants were estimated. Results showed that sulpiride form complexes with both albumins. Estimated association constants for the interaction sulpiride–HSA were 2.20 (±0.08) × 104 M−1, at 37 °C, and 5.46 (±0.20) × 104 M−1, at 25 °C. Those for the interaction sulpiride-BSA are 0.44 (±0.01) × 104 M−1, at 37 °C and 2.17 (±0.04) × 104 M−1, at 25 °C. The quenching intensity of BSA, which contains two tryptophan residues in the peptide chain, was found to be higher than that of HSA, what suggests that the primary binding site for sulpiride in albumin should be located next to the sub domain IB of the protein structure. 相似文献