全文获取类型
收费全文 | 223篇 |
免费 | 10篇 |
专业分类
电工技术 | 1篇 |
化学工业 | 49篇 |
机械仪表 | 1篇 |
建筑科学 | 1篇 |
能源动力 | 3篇 |
轻工业 | 18篇 |
无线电 | 29篇 |
一般工业技术 | 18篇 |
冶金工业 | 56篇 |
自动化技术 | 57篇 |
出版年
2023年 | 3篇 |
2022年 | 5篇 |
2021年 | 6篇 |
2020年 | 5篇 |
2019年 | 8篇 |
2018年 | 9篇 |
2017年 | 2篇 |
2016年 | 3篇 |
2015年 | 5篇 |
2014年 | 8篇 |
2013年 | 14篇 |
2012年 | 8篇 |
2011年 | 14篇 |
2010年 | 8篇 |
2009年 | 11篇 |
2008年 | 5篇 |
2007年 | 6篇 |
2006年 | 5篇 |
2005年 | 1篇 |
2004年 | 4篇 |
2003年 | 2篇 |
2002年 | 3篇 |
2001年 | 2篇 |
2000年 | 3篇 |
1999年 | 2篇 |
1998年 | 16篇 |
1997年 | 13篇 |
1996年 | 8篇 |
1995年 | 7篇 |
1994年 | 9篇 |
1993年 | 5篇 |
1991年 | 4篇 |
1990年 | 4篇 |
1989年 | 1篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1986年 | 3篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1981年 | 4篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1976年 | 4篇 |
1973年 | 1篇 |
排序方式: 共有233条查询结果,搜索用时 0 毫秒
1.
2.
3.
Mauri soininen 《Drying Technology》1995,13(4):867-896
Designs of heat exchangers for heat recovery from humid air are described. A mathematical model for heat transfer with simultaneous mass transfer is constructed, based on heat and mass balances. Methods for solution are shown for two cases: 1. The water on the exhaust side of the heating surface is only condensate, whose heat content may be neglected. Also, the case of only partially condensing heat transfer surface is discussed. 2. The heating surface is flushed with abundant water. - Each case is illuminated with a calculation example. 相似文献
4.
Tiina Komulainen Mauri Sourander Sirkka-Liisa Jms-Jounela 《Computers & Chemical Engineering》2004,28(12):2611-2619
5.
The hydrophobic-polar (HP) model has been widely studied in the field of protein structure prediction both for theoretical purposes and as a benchmark for new optimization strategies. In this work we present results of the recently proposed Hybrid Monte Carlo Ant Colony Optimization heuristic in the HP model using a fragment assembly-like strategy. Moreover we extend that method introducing a general framework for optimization in the HP model, called Local Landscape Mapping, and we test it using the pull moves set to generate solutions. We describe the heuristic and compare results obtained on well known HP instances in the 3-dimensional cubic lattice to those obtained with standard Ant Colony optimization and Simulated Annealing. Fragment assembly-like tests were performed using a modified objective function to prevent the creation of overlapping walks. Results show that our method performs better than the other heuristics in all benchmark instances when the fragment assembly-like strategy is used while in the case of pull moves-based neighborhood its performance is comparable to that of simulated annealing. 相似文献
6.
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. 相似文献
7.
J Sala E Esplugas A Cequier J Mauri A Ruiz-Majoral F Jara J Barthe 《Canadian Metallurgical Quarterly》1994,47(6):362-367
BACKGROUND: "Penetrating aortic ulcer", an atherosclerotic lesion with ulceration that penetrates the internal elastic lamina and allows haematoma formation within the aortic wall, is rarely considered in the differential diagnosis of patients with sudden onset of severe chest or back pain. It has been suggested that it is a pathologic process that involves elderly hypertensive patients with severe atherosclerosis and rarely has been observed in the ascending aorta. METHODS: To determine the characteristics of this process, 11 clinical, 2 hemodynamic, 3 angiographic and 4 surgical variables were compared between 10 consecutive patients with penetrating aortic ulcers and 20 matched patients with classic acute aortic dissection. RESULTS: Clinical and hemodynamic variables were similar in both compared groups. In the group of patients with penetrating ulcer mean age was 58 +/- 6 years, previous hypertension was observed in 6 patients and the penetrating ulcer was located in the ascending aorta in 6 cases. In comparison to patients with aortic dissection, more angiographic projections were necessary to obtain the diagnosis in the group of patients with penetrating ulcer (2.4 +/- 0.8 vs 1.7 +/- 0.6; p < 0.05). In addition, the presence of angiographic aortic valve regurgitation was only observed in the group of patients with acute dissection (60% vs 0%; p < 0.001). Severe atherosclerosis was not present angiographically in any patient with penetrating ulcer. CONCLUSIONS: Penetrating aortic ulcer can also affect middle age patients without severe atherosclerosis and is frequently observed in the ascending aorta. Its form of presentation and clinical characteristics are similar to classic aortic dissection. The lack of angiographic confirmatory evidence of dissection with suggestive clinical history, should raise the possibility of penetrating aortic ulcer. 相似文献
8.
We describe a solution to the SAT problem via non-confluent P systems with active membranes, without using membrane division rules. Furthermore, we provide an algorithm for simulating such devices on a nondeterministic Turing machine with a polynomial slowdown. Together, these results prove that the complexity class of problems solvable non-confluently and in polynomial time by this kind of P system is exactly the class . 相似文献
9.
The paper is about some families of rewriting P systems, where the application of evolution rules is extended from the classical
sequential rewriting to the parallel one (as, for instance, in Lindenmayer systems). As a result, consistency problems for
the communication of strings may arise. Three variants of parallel rewriting P systems (already present in the literature)
are considered here, together with the strategies they use to face the communication problem, and some parallelism methods
for string rewriting are defined. We give a survey of all known results about each variant and we state some relations among
the three variants, thus establishing hierarchies of parallel rewriting P systems. Various open problems related to the subject
are also presented.
Danicla Besozzi: She is assistant professor at the University of Milano. She received her M.S. in Mathematics (2000) from the University
of Como and Ph.D. in Computer Science (2004) from the University of Milano. Her research interests cover topics in Formal
Language Theory, Molecular Computing, Systems Biology. She is member of EATCS (European Association for Theoretical Computer
Science) and EMCC (European Molecular Computing Consortium).
Giancarlo Mauri: He is full professor of Computer Science at the University of Milano-Bicocca. His research interests are mainly in the area
of theoretical computer science, and include: formal languages and automata, computational complexity, computational learning
theory, soft computing techniques, cellular automata, bioinformatics and molecular computing. On these subjects, he published
more than 150 scientific papers in international journals, contributed volumes and conference proceedings.
Claudio Zandron: He received Ph.D. in Computer Science at the University of Milan, Italy, in 2001. Since 2002 he is assistant professor at
the University of Milano-Bicocca, Italy. He is member of the EATCS (European Association for Theoretical Computer Science)
and of EMCC (European Molecular Computing Consortium). His research interests are Molecular Computing (DNA and Membrane Computing)
and Formal Languages. 相似文献
10.