首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   13篇
  完全免费   6篇
  自动化技术   19篇
  2011年   1篇
  2009年   4篇
  2007年   2篇
  2006年   3篇
  2005年   1篇
  2003年   1篇
  2002年   1篇
  2000年   1篇
  1998年   1篇
  1996年   2篇
  1994年   1篇
  1993年   1篇
排序方式: 共有19条查询结果,搜索用时 109 毫秒
1.
面向对象的软件构造   总被引:9,自引:1,他引:8       下载免费PDF全文
冯玉琳  黄涛  李京 《软件学报》1996,7(3):129-136
面向对象技术的发展改变了传统软件系统的结构和设计方法学.本文作者提出一种称为SCOP的面向对象的软件系统结构模式,即软件是对象模块的复合,而软件设计则是对象模块经过程控制进行复合的构造生成.本文从语义模型、描述语言、设计方法学和支持环境等几方面对SCOP进行扼要的介绍.  相似文献
2.
层次化软件构造   总被引:6,自引:1,他引:5  
该文针对面向对象和可视化开发环境中出现的常见问题,结合软件系统开发的实践经验,参照计算机网络中的层次参考模型,提出了层次化软件构造的思想。同时结合实现软件复用的构件技术,将软件系统的组成构件划分为物理操作层构件、公共服务层构件、行定领导层构件和用户界面层构件4个层次。文章最后结合软件开发项目的具体应用,说明了层次化软件构造的有效性和实用性。  相似文献
3.
I-DEAS二次开发中的互操作实现技术   总被引:2,自引:0,他引:2  
在剖析了互操作技术两种模式基础上,以先进的I-DEAS工具为例介绍了两种模式下应用程序与I-DEAS宿主程序互操作的实现技术。该技术对I-DEAS在我国的推广应用有着重要意义。  相似文献
4.
虚拟装配中感知机制构造   总被引:2,自引:0,他引:2       下载免费PDF全文
程成 《软件学报》2002,13(12):2324-2330
虚拟装配的一个重要特性是交互性.要提高系统的交互性能,就要合理地分担人和机器的认知负荷,虚拟环境的感知机制是实现这一目标的重要方法.在形式地描述了虚拟装配系统结构后,提出虚拟装配中复合对象的感知机制,同时给出了装配交互中的感知模式,对感知过程给出了分析和构造.桌面虚拟装配的构造实践证明了所提出的感知机制具有很好的交互实时性,对于用户意图理解有较大的帮助作用  相似文献
5.
计算机辅助设计(CAD)是现代制造企业实施信息化系统建设的一项关键支撑技术。CAD技术具有很多优点,可以为生产制造,为生活服务,可以提供很多的便利。首先,提出了CAD的定义,并分析了该技术的广泛应用。接着,概括了计算机辅助设计的设计流程。然后,分析了中等职业学校已经具有的软件和硬件条件,介绍了CAD专业的定位和相关课程的设置。最后,简单研究了计算机辅助设计领域经常用的软件。  相似文献
6.
本文首先对CORBA体系结构的组成和运行原理进行了介绍,在此基础上对CORBA技术在WEB上应用的实现进行了系统的阐述,并由此总结了CORBA的技术特点,最后展望了CORBA技术的新发展。  相似文献
7.
When using current object-oriented methods in the development of computer-based information systems, problems frequently arise in the identification and specification of 'objects'. In this paper, these problems are discussed and an approach that draws upon interpretivist systems thinking is presented that, it is argued, may alleviate some of the problems. It is proposed that a method that has been developed specifically to aid the user and analyst to appreciate a perceived problem situation might provide a useful aid in the process of identifying objects from the situation which are meaningful to the user. [An attempt has been made to use terminology that is consistent with that used in object-oriented analysis. However, at times this terminology may be at variance with some of the interpretivist ideas put forward (e.g. the term 'user' is adopted, although the authors argue that the notion of 'client' is more appropriate to emphasize the increased involvement and responsibility of the 'user' in the approach advocated)]. The ability to achieve this is expected to facilitate the appropriate mapping of these meaningful objects into a technical specification through object-oriented methods and to encourage user acceptance of the resulting computer-based information system.  相似文献
8.
面向对象的用户界面设计是面对象领域的一大热点。本文基于SOP模型探讨由界面构件组装构造用户界的方法,本文首先简单介绍SOP软件构造模型,然后介绍通用界面对象类库的设计和实现,并利用此类库中的构件按SOP方法为SOP软件开发环境实现一个图形用户界面。  相似文献
9.
10.
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n < 3t disks, t of which may fail by becoming non-responsive or arbitrarily corrupted. We give two constructions of this algorithm; that is, we construct two different t-tolerant (i.e., tolerating up to t disk failures) building blocks, each of which can be used, along with a leader oracle, to solve consensus. One building block is a t-tolerant wait-free shared safe register. The second building block is a t-tolerant regular register that satisfies a weaker termination (liveness) condition than wait freedom: its write operations are wait-free, whereas its read operations are guaranteed to return only in executions with a finite number of writes. We call this termination condition finite writes (FW), and show that wait-free consensus is solvable with FW-terminating registers and a leader oracle. We construct each of these t-tolerant registers from n < 3t base registers, t of which can be non-responsive or Byzantine. All the previous t-tolerant wait-free constructions in this model used at least 4t + 1 fault-prone registers, and we are not familiar with any prior FW-terminating constructions in this model. We further show tight lower bounds on the number of invocation rounds required for optimal resilience reliable register constructions, or more generally, constructions that use less than 4t + 1 fault-prone registers. Our lower bounds show that such constructions are inherently more costly than constructions that use 4t + 1 registers, and that our constructions have optimal round complexity. Furthermore, our wait-free construction is early-stopping, and it achieves the optimal round complexity with any number of actual failures. A preliminary version of this paper, by the same authors and with the same title, appears in Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC ’04), July 2004, pages 226–235.  相似文献
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号