共查询到20条相似文献,搜索用时 109 毫秒
1.
介绍了一种使用C+ +语言重新绘制Protel原理图的方法.文章分析了原理图文件及其导出文件的格式,由此确定了具体的转换思路,并提供了程序流程和一个简单的转换效果.该方法可以推广到使用其他语言编写的软件中. 相似文献
2.
3.
本文介绍了电路设计软件包Protel产生的PCB文件的格式,并在此基础上给出了一种使用C语言将位图文件转换为制作印刷电路板所需的PCB文件的实用方法。 相似文献
4.
屈泽明 《电脑编程技巧与维护》2008,(13):20-24
本文以C#为设计语言,应用ADO.NET技术,并且综合运用DataAdapter与DataSet,完成ASP.NET下DBF文件向MDB文件的转换,这样在应用系统中无需借助第三方软件的转换就可以直接使用DBF文件,解决了以MDB文件为数据源的应用系统如何直接使用DBF文件的问题。 相似文献
5.
QU Zeming 《电脑编程技巧与维护》2008,(15)
本文以C#为设计语言,应用ADO.NET技术,并且综合运用DataAdapter与DataSet,完成ASP.NET下DBF文件向MDB文件的转换,这样在应用系统中无需借助第三方软件的转换就可以直接使用DBF文件,解决了以MDB文件为数据源的应用系统如何直接使用DBF文件的问题。 相似文献
6.
微软.NET框架下提取在线Web数据的方法 总被引:1,自引:1,他引:0
本文通过一个在线Web数据提取的实例,介绍了在微软的.NET框架下,使用SgmlReader将HTML文件转换为XHTML,并使用XML的XPath语言和XSLT转换技术提取在线Web数据的方法,文中还给出了核心程序的部分代码. 相似文献
7.
一、前言ProtelACLELTechnologiesInc公司推出的电路辅助设计软件,自进入中国以来,得到了广泛的应用。它的元件库比较齐全,包括了各种常用的IC及分立器件,而且可以任意扩充其中的元件。在使用Windows中的文档编辑系统时,若能从Protel原理图文件中直接得到电路图,则可以大大减少用户的工作量。下面,我们对Protel原理图文件结。构进行分析,然后讨论在Windows中利用剪贴板显示和截取原理图。二、原理图文件结构Protel的原理图文件以son为后缀,保存了电路中的所有信息,包括:原理图尺寸;原理图各个部件的坐标,点阵信息,文字… 相似文献
8.
前言dBASEⅡ/Ⅲ的数据库文件(DBF)若需被其他高级语言程序使用以及修改,通常的方法是在dBASE的控制下,将数据库文件拷贝生成一个文本文件(等长记录的顺序文件,后缀名是TXT)。这无疑要增加转换时间和额外的磁盘空间。高级语言程序处理数据后,若需把结果送 相似文献
9.
10.
数字逻辑电路与语言相结合的教学方法探索 总被引:3,自引:0,他引:3
为了改进数字逻辑电路教学方法以适应电子技术迅猛发展的需要,探索了新的数字逻辑电路教学方法,这就是数字电路与语言相结合.比较电路原理图输入方法和Verilog语言输入方法在逻辑电路设计中的使用. 相似文献
11.
We give a systematic treatment of distributivity for a monad and a comonad as arises in giving category theoretic accounts of operational and denotational semantics, and in giving an intensional denotational semantics. We do this axiomatically, in terms of a monad and a comonad in a 2-category, giving accounts of the Eilenberg–Moore and Kleisli constructions. We analyse the eight possible relationships, deducing that two pairs are isomorphic, but that the other pairs are all distinct. We develop those 2-categorical definitions necessary to support this analysis. 相似文献
12.
This paper presents a new method of partition, named-splitting, of a point set ind-dimensional space. Given a pointG in ad-dimensional simplexT, T(G;i) is the subsimplex spanned by G and the ith facet ofT. LetS be a set ofn points inT, and let be a sequence of nonnegative integers 1, ..., nd+1 satisfying
i=1
d+1
1=n The-splitter of (T, S) is a pointG inT such thatT(G;i) contains at least
i
points ofS in its closure for everyi=1, 2, ...,d + 1. The associated dissection is the re-splitting.The existence of a-splitting is shown for any (T, S) and, and two efficient algorithms for finding such a splitting are given. One runs inO(d2n logn + d3n) time, and the other runs inO(n) time if the dimensiond can be considered as a constant. Applications of re-splitting to mesh generation, polygonal-tour generation, and a combinatorial assignment problem are given. 相似文献
13.
14.
Yu. I. Berdyshev 《Journal of Computer and Systems Sciences International》2008,47(3):380-385
The problem of evasion of a group of moving points from a nonlinear controlled object, whose goal is consecutively approach these points in a prescribed order, is analyzed. The movement of each point is defined uniquely by a scalar parameter chosen at the initial time instant. The controlled object minimizes a certain cost function, and the group of the points, acting cooperatively, maximize this cost function by choosing the parameters. Necessary optimality conditions for parameters are obtained. A model problem of an evasion of moving points from a vehicle is solved. 相似文献
15.
Klimina L. A. Formalskii A. M. 《Journal of Computer and Systems Sciences International》2020,59(5):728-744
Journal of Computer and Systems Sciences International - We model movements of a person swinging on a swing. We consider a flat three-link hinged mechanism as the main mechanical model of the... 相似文献
16.
A portable keyboard that's no larger than my phone, that's theiGo Stowaway. 相似文献
17.
Murray Dow 《Parallel Computing》1995,21(12):1997-2005
There are many published algorithms for transposing a rectangular matrix in place, however none of these are suited to a vector processor. In this work we describe four methods and compare their speed and memory requirements to copying the matrix into workspace then back again in transposed order. 相似文献
18.
Phylogenetic trees and networks are leaf-labelled graphs that are used to describe evolutionary histories of species. The Tree Containment problem asks whether a given phylogenetic tree is embedded in a given phylogenetic network. Given a phylogenetic network and a cluster of species, the Cluster Containment problem asks whether the given cluster is a cluster of some phylogenetic tree embedded in the network. Both problems are known to be NP-complete in general. In this article, we consider the restriction of these problems to several well-studied classes of phylogenetic networks. We show that Tree Containment is polynomial-time solvable for normal networks, for binary tree-child networks, and for level-k networks. On the other hand, we show that, even for tree-sibling, time-consistent, regular networks, both Tree Containment and Cluster Containment remain NP-complete. 相似文献
19.
20.
In mid-1973, the Division of Computing Research, CSIKO, took delivery of a Control Data CVBER76 computer, which acts as the primary processing power of the CSIRO computer network (CSIRONET), replacing the Control Data 3600. The 3600, running under the DAD operating system, has been retained as a ‘front-end’ to the CYBER76 and continues to support the following functions:
- 1 An interactive system allowing both editing and CYBER76 job submission
- 2 Input of job files centrally from 3600 input devices, remotely from CSIRONET devices, or from interactive console users, and output of results similarly
- 3 A permanent file (document) system, with tape archiving