全文获取类型
收费全文 | 162篇 |
免费 | 10篇 |
专业分类
电工技术 | 2篇 |
化学工业 | 44篇 |
金属工艺 | 2篇 |
机械仪表 | 1篇 |
建筑科学 | 3篇 |
能源动力 | 10篇 |
轻工业 | 15篇 |
无线电 | 7篇 |
一般工业技术 | 27篇 |
冶金工业 | 15篇 |
自动化技术 | 46篇 |
出版年
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 3篇 |
2020年 | 3篇 |
2019年 | 4篇 |
2018年 | 10篇 |
2017年 | 5篇 |
2016年 | 7篇 |
2015年 | 4篇 |
2014年 | 4篇 |
2013年 | 14篇 |
2012年 | 9篇 |
2011年 | 5篇 |
2010年 | 8篇 |
2009年 | 6篇 |
2008年 | 8篇 |
2007年 | 10篇 |
2006年 | 8篇 |
2005年 | 7篇 |
2004年 | 2篇 |
2003年 | 10篇 |
2002年 | 3篇 |
2001年 | 1篇 |
1999年 | 1篇 |
1998年 | 4篇 |
1997年 | 4篇 |
1996年 | 1篇 |
1995年 | 5篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1992年 | 3篇 |
1991年 | 2篇 |
1986年 | 2篇 |
1984年 | 4篇 |
1983年 | 2篇 |
1980年 | 1篇 |
1976年 | 2篇 |
1973年 | 1篇 |
1971年 | 2篇 |
排序方式: 共有172条查询结果,搜索用时 15 毫秒
1.
We consider the problem of finding a shortest watchman route from which the exterior of a polygon is visible (external watchman route). We present an O (n
4 log logn) algorithm to find shortest external watchman routes for simple polygons by transforming the external watchman route problem to a set of internal watchman route problems. Also, we present faster external watchman route algorithms for special cases. These include optimal O (n) algorithms for convex, monotone, star and spiral polygons and an O (n log logn) algorithm for rectilinear polygons.This work was supported in part by a grant from Texas Instruments, Inc. to S. Ntafos 相似文献
2.
In this paper, we consider stochastic dynamical systems on the sphere and the associated Fokker–Planck equations. A semi-Lagrangian method combined with a Finite Volume discretization of the sphere is presented to solve the Fokker–Planck equation. The method is applied to a typical problem in fiber dynamics and textile production. The numerical results are compared to explicit solutions and Monte-Carlo solutions. 相似文献
3.
Michael R. Dörfel Bert Jüttler Bernd Simeon 《Computer Methods in Applied Mechanics and Engineering》2010,199(5-8):264-275
Isogeometric analysis based on non-uniform rational B-splines (NURBS) as basis functions preserves the exact geometry but suffers from the drawback of a rectangular grid of control points in the parameter space, which renders a purely local refinement impossible. This paper demonstrates how this difficulty can be overcome by using T-splines instead. T-splines allow the introduction of so-called T-junctions, which are related to hanging nodes in the standard FEM. Obeying a few straightforward rules, rectangular patches in the parameter space of the T-splines can be subdivided and thus a local refinement becomes feasible while still preserving the exact geometry. Furthermore, it is shown how state-of-the-art a posteriori error estimation techniques can be combined with refinement by T-splines. Numerical examples underline the potential of isogeometric analysis with T-splines and give hints for further developments. 相似文献
4.
5.
Yan-Dong Xu Zhen-Yu Zhu Tian-Zhao Xu Hamidreza Abadikhah Jun-Wei Wang Xin Xu Simeon Agathopoulos 《Ceramics International》2018,44(14):16443-16449
Robust hydrophobic surface was produced by modifying the surface of porous Si3N4 membrane, via aminolysis and pyrolysis process, with organosilane-derived inorganic SiNCO nanoparticles, which are tightly adhered to the Si3N4 grains. The resultant material had a high water contact angle of 142°, attributed to -Si-CH3 surface terminal groups and a lotus leaf-like hierarchical structure of the nanoparticles, which had a frame structure with Si-N and Si-O covalent bonds in their bulk. The hydrophobic behavior remained practically unchanged after exposure of the produced membranes to aqueous solutions of humic acid, HCl and NaOH, to benzene, as well as to stirring abrasive slurry with SiC particles, and after exposure at high temperatures, up to 500?°C, to air. The inorganic membrane can be considered for use in a broad range of applications which require robust hydrophobic surfaces. 相似文献
6.
7.
When solving stiff mechanical systems, implicit time integrators overestimate the error and tend to use small stepsizes due to the order reduction phenomenon. This article introduces an algorithm for the detection of stiff components that allows automatic scaling of the stepsize h in the error estimation. It is based on an investigation of the local error and applies existing embedded formulas of implicit Runge–Kutta methods. Thus, implementation and calculation effort are low. Three examples are integrated with the code RADAU5, a linear DAE in two different formulations and a slider crank mechanism. 相似文献
8.
Néstor M. Carballeira Fathi Shalabi Kamen Stefanov Krassimir Dimitrov Simeon Popov Athanas Kujumgiev Stoitze Andreev 《Lipids》1995,30(7):677-679
The fatty acid composition of the tunicateBotryllus schlosseri and of two bacterial strains found within the tunicate, namelyVibrio parahaemolyticus and of an associated but previously unreported gram positive cocci were studied. The polyunsaturated fatty acids 6,9,12-octadecatrienoic
acid, 5,8,11,14,17-eicosapentaenoic acid, and 4,7,10,13,16,19-docosahexaenoic acid were particularly abundant inB. schlosseri and were not detected in the two bacterial strains found in the tunicate. Theiso/anteiso pair, 13-methyltetradecanoic acid and 12-methyltetradecanoic acid, were the principal fatty acids in the gram positive cocci,
and the 9- and 11-hexadecenoic acids were particulary abundant inV. parahaemolyticus. The diunsaturated fatty acid 9,12-octadecadienoic acid was also shown to be present inV. parahaemolyticus. The fatty acid composition of a third bacterial strain, characterized as either aPseudomonas or anAlteromonas species, and shown to be present only in the sea water from the Black Sea and not inB. schlosseri, is also reported. This is the first investigation on fatty acids from Black Sea bacteria. 相似文献
9.
Duran Joe W. Ntafos Simeon C. 《IEEE transactions on pattern analysis and machine intelligence》1984,(4):438-444
Random testing of programs has usually (but not always) been viewed as a worst case of program testing. Testing strategies that take into account the program structure are generally preferred. Path testing is an often proposed ideal for structural testing. Path testing is treated here as an instance of partition testing, where by partition testing is meant any testing scheme which forces execution of at least one test case from each subset of a partition of the input domain. Simulation results are presented which suggest that random testing may often be more cost effective than partition testing schemes. Also, results of actual random testing experiments are presented which confirm the viability of random testing as a useful validation tool. 相似文献
10.