Averchenkov V. I., Podvesovsky A. G., Brundasov S. M.
Semantic Extension of Hierarchical and Network Decision Models
      The main issues, which take place on application of the Analytic Hierarchy Process and the Analytic Network Process for creating of alternatives choice models in multi- criteria decision problems, are examined. The conception of semantic extension of hierarchical and network models, based on formal representation of a subject domain and decision problems concerned with it, in the form of the semantic model, is discussed. The application of the semantic model makes it possible to automate the process of decision model creation. The principles of semantic modeling of the subject domain in the software choice problems are described, and the example of the model for choice of database management system is presented.

Bibilo P. N.
Resynthesis FPGA Circuits Into Gate Arrays Circuits
      The approaches of logic resynthesis of FPGA circuits into circuits based on gate array library are proposed in this paper. The projects are represented as VHDL-description.

Batischcv D. I., Kogan D. I., Lejkin M. V.
Decisions Synthesis Algorithms for Multicriteria Many-Dimensional Knapsack Problem
      The multicriteria multidimensional knapsack problem is considered in the article. The procedure of synthesis full set of effective estimators based on multicriteria analog of a dynamic programming principle is given. The adaptation of this procedure for application of four standard compromise schemes with varied schemes parameters is offered. The stated combined approach allows in essential smaller time to synthesize representative sets of effective estimators instead of synthesis full set of effective estimators. The results of experiments which show expediency of application offered algorithms for solving multicriteria multidimensional knapsack problem are represented in the article.

Scheithauer G., Mukhacheva A. S., BelovG. N., Mukhacheva E. A.
Planning of One-Dimensional Cutting for the Stock of Different Length Based on Non-Finite Relaxation and on Secant Plane Technique
      One Dimensional Cutting Stock Problem is a NP-hard problem of combinatorial optimization. The authors consider a more complicated variant of the problem when material of different length is cut. Non-finite relaxation of the problem is considered with the given assortment of the stock. Linear programming with the non-explicitly given restriction matrix is used to solve the above problem. While various approaches based on secant plane technique are discussed for the integer variant there appear some obstacles connected with generating of columns together with forming of secant planes if the material is of different length. This fact required some additional modification of the basic method. As a whole this approach is an endeavor to create a new effective precise method which can help to solve real problems. The results of numerical experiment are shown.

Valeyeva A. F.
Portal Sorting Methods for Searching
      Local Optimum Rectangular Bin Parking Problem The two dimensional Bin Packing Problem is NP-hard and is solved using heuristic methods of polynomial complexity. The paper presents a heuristic method of Portal Sorting and its stochastic modification. The results of the experiments confirm higher efficiency of this method with random elements.

Knjazev E. G., Tarasyk M. V. Enhancement of Traffic Masquerading Effectiveness in Multi-Level packet Switching Networks
      In the paper the method of covert channels bandwidth control for packet switching networks is considered. Covert channels based on a loading modulation of gateway network link, which are used for communicating through entrusted public networks. Such modulating, used main links state, for example "busy" or "unbury".
      In general, method considered in paper is based on the average entropy estimation of information signal for simplest two-position modulation data source.
      The proposed method allow to supply the traffic masquerading function, in order to use it in packet networks with multilevel access.

Kirillov S. N., Dmitriev V. T.
Asynchronous Speech Masking Because of Hurgin— Yakovlev Algorithm
      The systems asynchronous masking of speech because of algorithm of Hurgin—Yakovlev are considered. The capability of similar systems realization both in temporary and in frequent area having a high degree of masking and significant number of parameters combinations of algorithm is shown. The offered masking algorithms provide a high noise immunity of a transmitted speech signal and do not reduce it dynamic range, that makes expedient their use in modern systems of the confidential information transfer.

Panov S. A., Shiriaev V. I.
The Optimal Pricing and Industrial Strategy of the Undertaking
      The dynamic model of the undertaking operating in terms of the varying demand for its production is considered. The solution of the optimization problem of control by the rate of production and the price of the production depending on the function of the demand by means of the reduction to the linear-square problem of optimal control is suggested. The possibility of the spreading of the results for the models of the great dimension is discussed.

Yeresko Yu. N.
The Packet Wavelet Transform Based on Walsh Autocorrelation Functions
      Aspects of Digital Wavelet Transform (DWT) perfection for Applied Information Systems are considered. As a result of theoretical researches, new internals of Walsh function sets and Walsh autocorrelation function (WAF) sets have been derived. Due to that, subsistence of quadric spline and its quadrature mirror decompositions onto finite WAF series were established. Basing on the decompositions, a new DWT algorithm, named as Packet DWT, was synthesized. The algorithm and corresponding structure have new internals and advantages with practical realizing. In Applied Information Systems that have deal with information extraction directly from raw non-stationary signals processing, resolving, recognition and measuring in time domain, using the Packet DWT allows significantly reducing ultimate data distortions and demands to computation system.