Search

This paper defines the self-covariance property for the solutions of transferable utility cooperative games (TU-games) as a weakening of their covariance. Self-covariant solutions are positively homogenous and satisfy a "restricted" translation covariance so that feasible shifts are only the solution vectors themselves and their multipliers. A description of all non-empty, single-valued, efficient, anonymous, weakly and self-covariant solutions in the class of twoplayer TU-games is given. As demonstrated below, among them there exist just three solutions admitting consistent extensions in the Davis-Maschler sense. They are the equal share solution, the standard solution, and the constrained egalitarian solution for superadditive two-player TUgames. For the third solution mentioned, characterizations of some consistent extensions to the class of all TU-games are given. [ABSTRACT FROM AUTHOR]

The paper is devoted to problems of optimal boundary control of string vibrations under nonlocal conditions that relate values of string displacement or its derivative at the boundary point with their values at the interior point. The solutions for all problems of boundary control are obtained in explicit analytic form. [ABSTRACT FROM AUTHOR]

We consider a polling system with adaptive dynamic polling order for modeling a broadband wireless network with a centralized control mechanism. A new algorithm has been developed for calculating the steady-state probability distribution of the number of packets in subscriber stations. The algorithm makes it possible to calculate the average waiting time and other network performance characteristics. We investigate a queuing system with several queues in which the server serves queues in a dynamic polling order. This order of queuing involves skipping queues that had been empty in the previous polling cycle. The queues that have been skipped in the current cycle can be polled by the server only in the next cycle. The specified queue servicing algorithm allows one to reduce the queue polling time and thus increase the system performance. A comparative numerical analysis of various options for constructing and evaluating the performance characteristics of broadband wireless IEEE 802.11 networks with a centralized control mechanism is presented. Numerical studies have been carried out using a software package for evaluating stochastic polling systems. [ABSTRACT FROM AUTHOR]

This paper analyzes the routing problem in order to design automatic train operation in a station. The authors consider the routing problem for the receipt-departure of trains and their shunting movements. It is noted that, in the case of stations with a branched track infrastructure, the number of all admissible routes becomes large, leading to bulky computations in the search procedure. A certain method is proposed to partition stations into zones for reducing the amount of computations. And finally, the authors pose the graph cutting problem of a railway station network with due account of track infrastructure features and present its solution algorithm. [ABSTRACT FROM AUTHOR]

The paper is devoted to schemes of approximation of attainability sets of nonlinear controlled differential systems where the problem of program control optimization is an 'elementary operation.' The results of numerical experiments are represented. [ABSTRACT FROM AUTHOR]

In this paper, we consider two scheduling problems on a single machine, where a specific objective function has to be maximized in contrast to usual minimization problems. We propose exact algorithms for the single machine problem of maximizing total tardiness 1|max-Σ T and for the problem of maximizing the number of tardy jobs 1|maxΣ U. In both cases, it is assumed that the processing of the first job starts at time zero and there is no idle time between the jobs. We show that problem 1|max-Σ T is polynomially solvable. For several special cases of problem 1|maxΣ T, we present exact polynomial algorithms. Moreover, we give an exact pseudo-polynomial algorithm for the general case of the latter problem and an alternative exact algorithm. [ABSTRACT FROM AUTHOR]

The construction of the iteration procedure for synthesizing the law of control of observation over the processes, appeared one after another according to random flux regularities, is considered. The general approach to solution of the problem and the approximate algorithm for synthesizing the law of observations control are given for the case of a simple Poissonian flux. The example is presented in the paper. [ABSTRACT FROM AUTHOR]

We study properties of strategy-proof mechanisms of multicriteria expertise representable by generahzed voter median schemes that allow to decrease the complexity of verification of the so-called intersection property. The latter is necessary and sufficient for the outcome of the expertise to belong to the set of feasible results. The algorithm is proposed, that for an arbitrary generalized median scheme determines for which sets of feasible results of the expertise this scheme satisfies the intersection property. [ABSTRACT FROM AUTHOR]

We consider the problem of identifying unknown nonstationary piecewise linear parameters for a linear regression model. A new algorithm is proposed that allows, in the case of a number of assumptions on the elements of the regressor, to provide an estimate of unknown non-stationary parameters. We analyze in detail the case with two unknown parameters, which makes it possible to understand the main idea of the proposed approach. We also consider a generalization to the case of an arbitrary number of parameters. We give an example of computer simulation that illustrates the efficiency of the proposed approach. [ABSTRACT FROM AUTHOR]

We consider the problem of finding a set of alternative configurations of redundant complexes for onboard equipment and give an analytic solution. The redundancy problem is solved by finding admissible values of the “integration” matrix that contains the connections between input and output interfaces of individual components of the complex. For the case of a structured set of “integration” matrices, the set of nominal matrices and additions to them yields a complete set of solutions. We also give an illustrative example. [ABSTRACT FROM AUTHOR]

In this work, we propose algorithms for optimizing the choice of feedback in the modal control problem in multidimensional linear systems with the criterion of minimizing the norm of the feedback matrix. The proposed approaches to solving this problem are based on representing the original system in an orthonormal basis. In particular, representing controllability in a block form lets us divide a high dimensional optimization problem into optimization subproblems of lower dimension. We pay special attention to finding the initial value of the feedback matrix with suboptimal search procedures. We give recommendations on constructing numerical search procedures for suboptimal solutions with gradient-based methods. The efficiency of the developed algorithms is demonstrated with numerical examples. [ABSTRACT FROM AUTHOR]

Consideration was given to generalization of one of the formation control algorithms, that of equidistant arrangement of agents over a fixed interval. In distinction to the earlier approaches that are based on the equations of the first order, a second-order algorithm was proposed. It was proved to be stable and with proper selection of the adjusted parameter able to provide a higher rate of convergence in comparison with its first-order counterparts. Relation was demonstrated between the problem of arrangement over an interval and the classical problem of consensus. Examples of the results of modeling were presented. [ABSTRACT FROM AUTHOR]

An algorithm to solve numerically the optimal measurement problem was proposed for the first time. The abstract results were illustrated by numerical experiments. [ABSTRACT FROM AUTHOR]

We present hardness and approximation results for the problem of preemptive scheduling of n independent jobs on m identical parallel machines subject to a migration delay d with the objective to minimize the makespan. We give a sharp threshold on the value of d for which the complexity of the problem changes from polynomial time solvable to NP-hard. Next, we give initial results supporting a conjecture that there always exists an optimal schedule with at most m − 1 job migrations. Finally, we provide a O( n) time (1 + 1/log n)-approximation algorithm for m = 2. [ABSTRACT FROM AUTHOR]

A new algorithm is proposed to the design of an adaptive observer for an unknown sinusoidal disturbance that affects the output of a non-minimum phase linear control plant. [ABSTRACT FROM AUTHOR]

Consideration was given to the problem of packing the rectangular half-infinite strip. It was suggested to solve it using a one-point evolutionary algorithm with search of the best solution in the neighborhood of the local lower bound. Proposed was an algorithm to construct this neighborhood including the packings obtained by solving a special problem of one-dimensional cutting. Its solution was shown to be the local lower bound in the considered neighborhood. An improved global lower bound was proposed. The results of numerical modeling were presented. The record value obtained was compared with the global bounds. [ABSTRACT FROM AUTHOR]

The oral technologies created a new type of the human-computer interaction. The oral servers and oral portals which implement a new model of human-computer communications may be studied using the methods of the queuing theory. Development of the analytical models to estimate some numerical characteristics of the human-computer one-channel dialogue such as the probability of successful dialogue, number of overinterrogations, and mean time of dialogue are the immediate subject matters of such studies. These characteristics may be used further to analyze operation of the entire queuing system that models the multichannel oral portal. The main parameters of the human-computer dialogue such as the probability of correct recognition of an element and the entire dialogue at overinterrogations and the time used for a dialogue element were considered. The parameters for estimation of the dialogue length were determined. A classification of the dialogue control algorithms at oral interaction of the client with the computer-aided information and servicing systems was developed. The algorithms were compared in terms of duration with regard for the desired reliability of recognition. [ABSTRACT FROM AUTHOR]

An analogy between celebrated Kendall equation for busy periods in the system M| GI|1 and analytical results for busy periods in the priority systems M r | GI r |1 is drawn. These results can be viewed as generalizations of the functional Kendall equation. The methodology and algorithms of numerical solution of recurrent functional equations which appear in the analysis of such queueing systems are developed. The efficiency of the algorithms is achieved by acceleration of the numerical procedure of solving the classical Kendall equation. An algorithm of calculation of the system workload coefficient calculation is given. [ABSTRACT FROM AUTHOR]

Methods and corresponding algorithms for improving a discrete control basing on the approximation in mean of Krotov-Bellman equations in the neighborhood of current approximation trajectory are proposed. Their application to the correction of the simple approximation of the sliding mode as a generalized solution to the control problem is studied. Examples demonstrating specific features of algorithms and their efficiency are given. [ABSTRACT FROM AUTHOR]

Consideration was given to the linear problems of optimal control in the class of discrete-pulse and discrete-quasipulse control actions. Proposed was a dual method for construction of the open-loop solutions underlying the algorithms of the optimal controllers generating in real time the current values of the optimal feedbacks. The results obtained were illustrated by examples. [ABSTRACT FROM AUTHOR]

A robust analog of the Nadaraya-Watson regression estimate is considered. A solution is obtained in the class of censor algorithms. A criterion and iteration procedure for determining a censored sample are proposed. The criterion is based on the analysis of residuals (errors) of estimation. [ABSTRACT FROM AUTHOR]

Certain characterization properties of time-varying periodic Poisson flows are studied in terms of almost-lack-of-memory (ALM) distributions. Parameter estimation formulas are derived. A method for verifying the hypothesis on the membership of a sample to the class of ALM-distributions is developed. Algorithms for computing critical levels and power of the likelihood ratio test by the Monte Carlo method are designed. [ABSTRACT FROM AUTHOR]

A computer-aided control system of distributed production of printed matter which is interpreted as an open queuing network was considered. Optimal resource allocation to the processing network nodes is one of the key problems in this class of systems. An algorithm based on a combination of the branch-and-bound method and simulation was proposed for determining the optimal solution. The branch-and-bound method enables one to establish the direction of search, and simulation is used to verify each step of search. High convergence of the algorithm was corroborated by numerical experiments. [ABSTRACT FROM AUTHOR]

The problem of choosing from a predetermined family a quasi-informational extension that is most advantageous to one of the players was considered. Existence of its solution was studied. [ABSTRACT FROM AUTHOR]

For a system with several heterogeneous servers, the well-known Howard algorithm was used to study numerically whether the optimal servicing disciplines satisfy the criterion for minimum stationary number of customers in system. [ABSTRACT FROM AUTHOR]