共查询到20条相似文献,搜索用时 62 毫秒
1.
2.
希润高娃 《网络安全技术与应用》2012,(4):48-50
集群是充分利用计算资源的一个重要概念,PC集群是最易构建的分布式并行计算环境。MPI是应用最广的并行程序设计平台。本文通过实例阐述PC集群及PC集群上的MPI并行计算环境的搭建。 相似文献
3.
C_MPS的设计与实现 总被引:1,自引:0,他引:1
元程序设计系统是进行元程序设计的有效工具。C_MPS(CMetaProgra-mming System)是我们在PC机上开发的C语言的元程序设计系统,本文介绍了该系统的设计思想和实现技术。 相似文献
4.
叙述了PC机与嵌入式计算机系统的多线程串行通信的实现。介绍了多线程设计思想的必要性,给出了程序设计流程。 相似文献
5.
朱静 《数字社区&智能家居》2006,(35)
本文介绍了在PC机平台上设计实现GPS应用程序的方法。重点讨论了PC机与GPS接收机通讯程序设计,以及对GPS信息的提取与分离处理的实现。文中给出了PC机与GPS接收器的硬件连接图以及关键实现程序。 相似文献
6.
7.
8.
9.
10.
任志敏 《自动化技术与应用》2013,32(1):20-24
本文介绍了基于USB2.0接口的68013A的图像采集板设计方案,包括硬件设计,下位机程序设计,上位机程序设计,USB驱动程序改写.在此基础上,实现了PC端实时显示感光芯片OV6620输出的数字信号图像. 相似文献
11.
12.
13.
K. K. Klyuchnikov 《Automation and Remote Control》2009,70(7):1250-1260
The mathematical model of an estimation of an execution time of the program in the presence of random failures is studied. For decreasing of influence of failures on a program execution time the known method of checkpoints is considered. The main objective consists in reception of the formula for a distribution function of a random variable of an execution time of the program and an estimation of a quantile of the received distribution. Properties of a mean value of a random variable of an execution time of the program are studied. 相似文献
14.
V. M. Aleksandrov 《Automation and Remote Control》2009,70(4):615-632
The method of computation of control in real time of a linear system with disturbance is suggested. The system of linear algebraic equations is obtained, which links the deviations of phase coordinates to the deviations of initial conditions of the normalized conjugate system and to the deviation of the finite moment. The calculations reduce to the sequence of the solutions of systems of linear algebraic equations and the integration of a matrix differential equation over transfer intervals of the control switching moments and the finite moment of time. The correction of switching moments and the finite moment of control in the accompaniment of the phase trajectory of motion of a controllable object is considered. Simple constructive conditions of the origin of the sliding mode, motions of the representative point over manifolds of switchings, and changes of the control structure in accompanying the phase trajectory of the system motion are obtained. The convergence of the computational method is proved. 相似文献
15.
16.
D. A. Evsevichev O. V. Maksimova M. K. Samokhvalov 《Automation and Remote Control》2016,77(6):1093-1098
The actual task in the field of instrument making—automation of technological preparation of production of perspective thin-film electroluminescent (TFEL) indicators is considered. The main problems in the field is high labor-intensive characteristic of calculations, tardiness of process of calculations, and also the large volume of the processed data connected by that today the large number of methods and means of a thin-film sputtering are developed. For the purpose of the solution of the problems the automated system of technological preparation of production of thin-film electroluminescent indicator devices—TFEL DDS—was developed. The main features of this system are the automated design of a configuration and a choice of materials of layers of an electroluminescent indicator element taking into account results of the analysis of indicators of TFEL structure, and also drawing up a package of design-technology documentation on the designed TFEL indicator. 相似文献
17.
T. A. Dolenko S. A. Burikov A. O. Efitorov K. A. Laptinsky O. E. Sarmanova S. A. Dolenko 《Optical Memory & Neural Networks》2016,25(1):16-24
Elaboration of methods of monitoring of biochemical reactions with DNA strands is necessary to solve one of the main problems in creation of biocomputers—improvement of fidelity of molecular DNA computations. In this paper, the results of solution of inverse two-parameter problems of laser Raman spectroscopy on determination of the types and concentration of DNA nitrogenous bases in multicomponent solutions are presented. Comparative analysis of the three used methods of solving these problems has demonstrated convincing advantages of artificial neural networks and of the method of projection to latent structures. Use of adaptive methods allowed achieving the accuracy of determining the concentration of each base in two-component solutions about 0.2–0.4 g/L. 相似文献
18.
R. I. Podlovchenko 《Programming and Computer Software》2016,42(1):1-4
Algebraic models of programs with procedures extend algebraic models of programs that are free of procedures (simple models of programs). A specific feature of both types of models is that they are built for some formalization of software programs. Models of programs are intended for studying functional equivalence of formalized programs and constructing wide sets of equivalent transformations of programs. Two basic problems in the theory of algebraic models of programs are the equivalence problem and the problem of building complete systems of equivalent transformations. An increasing interest in models of programs with procedures is due to the abundance of results obtained for simple models of programs. The most suitable model of programs with procedures is a gateway model. A remarkable feature of these models is that every such model is induced by some simple model of programs. This paper gives a survey of the latest results obtained for gateway models of programs. 相似文献
19.
We investigate the use of shuffle on trajectories to model certain classes of languages arising in the theory of codes. In particular, for each finite set of sets of trajectories, which we call a hyperset of trajectories, we define a class of languages induced by that hyperset of trajectories. We investigate the properties of hypersets of trajectories and the associated classes of languages, including the problem of decidability of membership and the problem of equivalence of hypersets of trajectories. 相似文献
20.
V. A. Kokhov 《Journal of Computer and Systems Sciences International》2012,51(5):695-714
An approach to solving the problem of determining similarity with application of a maximal common fragment of two graphs is considered. Its two main disadvantages are specified. Two new approaches to solving the problem of determining similarity of digraphs are proposed: a generalized substructural-metric approach and an approach using a stratified system of matrix models of the digraph complexity. New features for investigating similarity of digraphs are formulated. The original problem of calculating similarity of layout of fragments in the digraph is formalized with account of quantitative and qualitative features of fragments of the digraph. A methodology, involving two systems of methods for solving the problem, is developed. The first system of methods takes into account the precise layout of fragments in the digraph, while the second one deals with the approximate layout of fragments. A new class of problems is distinguished, which consists in calculating similarity of digraphs with account of similarity of the layout of fragments of the specified type. An example of solving the problem of finding semantic networks that are most similar to a network-template is presented. 相似文献