一种并行程序设计语言C＋＋^1

该文介绍了一种较新的并行程序设计语言ＣＣ＋＋，该语言在顺序Ｃ＋＋语言的基础之上扩充而来的，该文对扩充的８种结构一一进行了分析，并介绍了具体使用方法，从而说明ＣＣ＋＋具有效的语言表示能力。     

青鸟C++程序理解工具

程序理解是软件开发过程中一项重要活动,为了保证该活动的准确性和高效性,有理解工具的半自动支持是关键的。青鸟Ｃ＋＋程序理解工具（ＪＢＰＣＴ－Ｃ＋＋）支持用户的多样需求,辅助多种理解策略,为用户理解程序提供了很大帮助。该文概要介绍了青鸟Ｃ＋＋程序理解工具（ＪＢＰＣＴ－Ｃ＋＋）的设计目标和原则、体系结构以及基本功能。     

C＋＋Builder中ChartFX构件的使用

Borland公司的C＋＋Builder是一个面向对象的、可视化的程序设计环境,它把所有的WndowAPI（ApplicationProgrammingInteraface）都封装成简单易用的构件（Component）。而程序员的工作就是根据需要挑选构件加到窗体上,再对其属性进行适当的设置,在单元问nit）中加入少量的代码,利用C＋＋B山ldsr提供的功能强大的快速程序开发工具,开发所需的应用程序OChartFX（图表）构件是C＋＋Builder的ActiveX页里C＋＋Builder提供的构件之一,它的绘图功能非常强大,用它可以形成线图、棒图、饼图等9种图形,可以是二维或三维的,能够满…     

C＋＋程序理解辅助系统

本文介绍了一个针对Ｃ＋＋语言的程序理解辅助系统ＨＯＯＰＵＳ（ｈｙｐｅｒｔｅｘｔ－ｂａｓｅｄｏｂｊｅｃｔ－ｏｒｉｅｎｅｄ ｐｒｏｇｒａｍ ｕｎｄｅｒｓｔａｎｄｉｎｇ ｓｕｐｐｏｒｔ ｓｙｓｔｅｍ），该系统基于程序结构分析技术，以易于程序中的信息，辅助理解Ｃ＋＋程序的功能与结构，另外，还利用ｈｙｐｅｒｔｅｘｔ、多维表现、导航与定位等技术对理解过程提供支持。     

用VC++设计多线程串行通信程序

文中主要讨论如何用通信控件和线程函数实现多任务,并给出了ＶＣ＋＋６．０下编写通信线程的方法。     

通用菜单软件的设计与实现

本文介绍了使用Ｃ＋＋语言设计的一个通用菜单程序。文中给出了该程序设计的主要思想，并详细描述了程序实现过程中核心数据结构的定义及算法。同时，就汉字窗口边界出现乱字的现象提出了简单的解决办法。     

Visual C＋＋的MFC程序开发

论述了Ｖｉｓｕａｌ Ｃ＋＋的Ｍｉｃｒｏｓｏｆｔ基本类库编程机制。揭示了ＭＦＣ程序的执行过程;阐述了主要函数的作用。     

用BorlandC＋＋开发微机与单片机通人程序

本文介绍了在Ｗｉｎｄｏｗｓ下利用ＢｏｒｌａｎｄＣ＋＋３．１在微机与单片机之间实现串行通信的原理及方法。     

C＋＋目标对象的抽象与并发控制

C＋＋作为一种面向对象程序设计语言具有非常强大的功能。文章描述了C＋＋面向对象程序设计语言中实体描述（数据抽象）以及程序（进程）的并发控制。     

基于Windows95平台的通讯程序设计与应用研究

本文基于Ｗｉｎｄｏｗｓ９５平台并采用中断方式进行联机通讯，实时采集数据，利用ＶｉｓａｕｌＣ＋＋设计通讯程序，给出了程序流程，部分源程序，应用实例和结果。     

物联网与感知矿山专题讲座之四——感知矿山物联网与煤炭行业物联网规划建设

指出感知矿山物联网M2M平台应为应用层服务提供开放的接口,适应完善安全避险"六大系统"、领导带班下井、煤矿灾害监测的需求;给出了煤炭行业物联网的四层结构,指出感知矿山物联网建设是整个煤炭行业物联网建设的重点,其它层次以煤矿安全管理和资源管理为主,并分析了矿业集团级、省级、国家级煤炭行业物联网的应用方式;提出了煤炭行业物联网建设需要注意的问题。     

Analysis of probability distribution of a random variable of an execution time of the program in the presence of random failures

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.     

Adaptive methods of solving inverse problems for improvement of fidelity of molecular DNA computations

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.     

Codes defined by multiple sets of trajectories

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.     

Using the method of phase biplane to study dynamics of interactions of the elastic structural oscillations of the flexible spacecraft with the control system

A modal-physical representation of the mathematical model of flexible spacecraft enabling one to specify a diversity of the distinctions of the dynamics of controllable motion of the flexible objects was determined. The method of phase biplane enabling strict analysis of the dynamics of relay control of orientation of a flexible object with one dominating mode was described and extended to the method of the fuzzy phase biplane for approximate study of the dynamics of the multifrequency flexible spacecraft. Consideration was given to some important questions concerning the impact of structural flexibility on stability and performance of the control system of orientation of flexible spacecraft.     

The computation algorithm of capacity indices of the telecommunication networks with repeated transmissions

The results are presented of the investigation of an approximate method for the calculation of characteristics of the telecommunication network of commutation of packages with a bounded buffer storage of nodes and retrials of transmissions of packages from sources and transit nodes. As a model of the telecommunication network use is made of the queuing network (QN) represented by an aggregate of isolated queuing systems (QS’s) with bounded accumulators and retrials of transmissions. The algorithm is suggested for the verification of realizability of primary input flows (delivery of all incoming packages to the appropriate finite nodes in the finite time) and the computation of blocking probabilities of nodes, the load of transmission links, mean values of the number of packages, and the dwell time of packages in the network operating in the stationary mode.     

Studies in the theory of algebraic models of programs with procedures

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.     

Two approaches to determining similarity of two digraphs

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.     

Structural optimization of pseudogradient algorithms for estimating image parameters

The possibility of reducing the computational costs for recursive estimation of the parameters of interframe geometric deformations of images (IGDIs) by means of a structural optimization of algorithms is considered. This optimization is based on finding a subdomain of the domain of definition of the parameters that contains an extremum of a goal function (GF). A situation is analyzed when the domain of definition of the estimated parameters is several times greater than the operating range of the algorithms. Basic relations for the probability of erroneous choice of the subdomain and for discrete probability distributions of the number of iterations of an algorithm are found. Aleksandr Grigor’evich Tashlinskii. Born 1954. Graduated from Ul’yanovsk Polytechnical Institute in 1977. Received doctoral degree in 2000. Scientific interests: statistical analysis of images, in particular, estimation of spatiotemporal deformations of sequences of dynamic images. Author of more than 200 papers and one monograph. Member of the International Academy of Authors of Scientific Discoveries and Inventions and the Russian Academy of Natural Sciences. Awarded medals from these academies.     

Mathematical Differential Models and Methods for Assessing the Cybersecurity of Intelligent Computer Networks for Control of Technological Processes of Railway Power Supply

The problem of cybersecurity of computer networks for control of power supply at the level of railroads is analyzed and a graph of the topology of a computer network for control of power consumption is proposed. Based on the Pukhov theory of differential transformations, a number of differential mathematical models are proposed to assess the level of cybersecurity of a computer network for control of power supply. For differential images, a cybersecurity criterion is proposed and the minimax principle is developed for the worst combination of the intensity of cyberattacks and the flow of protective actions. A method of predictive search for an optimal cybersecurity strategy by the extremum analysis of a functional for the case of stochastic intensity of flows of cyberattacks is developed.