全文获取类型
| 收费全文 | 132篇 |
| 免费 | 12篇 |
| 国内免费 | 2篇 |
专业分类
| 电工技术 | 3篇 |
| 综合类 | 12篇 |
| 化学工业 | 5篇 |
| 金属工艺 | 2篇 |
| 机械仪表 | 4篇 |
| 建筑科学 | 4篇 |
| 轻工业 | 1篇 |
| 无线电 | 14篇 |
| 一般工业技术 | 8篇 |
| 冶金工业 | 4篇 |
| 自动化技术 | 89篇 |
出版年
| 2023年 | 2篇 |
| 2022年 | 1篇 |
| 2021年 | 2篇 |
| 2020年 | 2篇 |
| 2019年 | 1篇 |
| 2018年 | 1篇 |
| 2017年 | 3篇 |
| 2016年 | 2篇 |
| 2015年 | 5篇 |
| 2014年 | 10篇 |
| 2013年 | 11篇 |
| 2012年 | 9篇 |
| 2011年 | 5篇 |
| 2010年 | 4篇 |
| 2009年 | 9篇 |
| 2008年 | 6篇 |
| 2007年 | 5篇 |
| 2006年 | 8篇 |
| 2005年 | 10篇 |
| 2004年 | 7篇 |
| 2003年 | 9篇 |
| 2002年 | 2篇 |
| 2001年 | 5篇 |
| 1999年 | 1篇 |
| 1998年 | 1篇 |
| 1997年 | 4篇 |
| 1996年 | 2篇 |
| 1995年 | 4篇 |
| 1994年 | 4篇 |
| 1992年 | 1篇 |
| 1991年 | 2篇 |
| 1990年 | 2篇 |
| 1986年 | 2篇 |
| 1985年 | 1篇 |
| 1981年 | 1篇 |
| 1976年 | 1篇 |
| 1966年 | 1篇 |
排序方式： 共有146条查询结果，搜索用时 15 毫秒
1.
Huan Huang 《Information Sciences》2010,180(19):3806-3813
This paper shows that the Zadeh’s extensions of sendograph-metric-continuous fuzzy-valued functions are sendograph-metric-continuous fuzzy functions. 相似文献
2.
结合Markov调制泊松过程（MMPP）和混合泊松流,为突发性分组业务设计了Gamma调制泊松过程（GMPP）业务流模型。面向开源仿真器NS2的功能扩展,给出了纯泊松流、MMPP流和GMPP流的NS2扩展设计和实现方案,并经仿真实验进行了验证。分析表明GMPP更适用于实际业务流。 相似文献
3.
4.
以景深扩展和视域扩展为例,介绍了Photoshop CS软件的脚本工具在高质量的金相图片制作上的应用实例,这些应用突破了光学金相显微镜和图像采集设备的物理限制,具有智能和高效的特点,可广泛应用在各种类型的金相图片制作中,丰富了金相图片的制作手段,提高了金相分析工作的质量和效率。同时也探讨了图像编辑软件在金相图片制作中的利与弊。 相似文献
5.
In order to discuss the kinds of reasoning a visualization supports and the conclusions that can be drawn within the analysis context, a theoretical framework is needed that enables a formal treatment of the reasoning process. Such a model needs to encompass three stages of the visualization pipeline: encoding, decoding and interpretation. The encoding details how data are transformed into a visualization and what can be seen in the visualization. The decoding explains how humans construct graphical contexts inside the depicted visualization and how they interpret them assigning meaning to displayed structures according to a formal reasoning strategy. In the presented model, we adapt and combine theories for the different steps into a unified formal framework such that the analysis process is modelled as an assignment of meaning to displayed structures according to a formal reasoning strategy. Additionally, we propose the ConceptGraph, a combined graph-based representation of the finite-state transducers resulting from the three stages, that can be used to formalize and understand the reasoning process. We apply the new model to several visualization types and investigate reasoning strategies for various tasks. 相似文献
6.
Ulises Olivares Hctor G. Rodríguez Arturo García Flix F. Ramos 《Computer Animation and Virtual Worlds》2016,27(3-4):358-368
This paper proposes an efficient construction scheme for bounding volume hierarchies based on a complete tree. This construction offers up to 4× faster construction times than binned‐surface area heuristic and offers competitive ray traversal performance. The construction is fully parallelized on x86 CPU architectures; it takes advantage of the eight‐wide vector units and exploits the advance vector extensions available for current x86 CPU architectures. Additionally, this work presents a clustering algorithm for grouping primitives, which can be computed in linear time O(n). Furthermore, this construction uses the graphics processing unit to perform intensive operations efficiently. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
7.
8.
Olivier Serre 《Theoretical computer science》2004,310(1-3):79-116
Determining for a given deterministic complete automaton the sequence of visited states while reading a given word is the core of important problems with automata-based solutions, such as approximate string matching. The main difficulty is to do this computation efficiently. Considering words as vectors and working on them using vectorial operations allows to solve the problem faster than using local operations.
In this paper, we show first that the set of vectorial operations needed by an algorithm representing a given automaton depends on the language accepted by the automaton. We give precise characterizations for star-free, solvable and regular languages using vectorial algorithms. We also study classes of languages associated with restricted sets of vectorial operations and relate them with languages defined by fragments of linear temporal logic.
Finally, we consider the converse problem of constructing an automaton from a given vectorial algorithm. As a byproduct, we show that the satisfiability problem for some extensions of LTL characterizing solvable and regular languages is PSPACE-complete. 相似文献
9.
对开放式数控发展概况和数控任务的实时要求进行了讨论,在分析WindowsNT的实时性能的基础上,对WindowsNT进行实时扩展的常见方法进行了论述,实现了一个基于嵌入代码方法的开放式数控实时核心,并对其实时性能进行了测试与分析。该实时核心能够满足数控系统实时要求。 相似文献
10.
分析了ASP.NET MVC框架中模型绑定的本质及过程,说明了何时需要自定义扩展,并给出了模型绑定框架中的自定义扩展的实现方法。 相似文献