 |
 |
|
|
|
|
|
:: ( ): : 2013 : : : / . .. , .. , .. . .: , 2013. 568 . : - , , , ( , , , ). ( http://ubs.mtas.ru). , , , , , , , , , . : (pdf) : 4417, : 871 |
On Communication Network Topology Problem with Node Costs: : 2013 : : 26th European Conference on Operational Research : Goubko M. V. On Communication Network Topology Problem with Node Costs // Abstracts of 26th European Conference on Operational Research, July 1-4, 2013, Rome, Italy. P. 14. : The communication network topology problem is studied with no edge costs and node costs depending on the node degree and capacity. If cost depends on the degree only, the optimal network is shown to be the tree T of known cost. If capacity only matters, a two-layered network N is optimal where secondary nodes form a complete graph. When both degree and capacity matter, LB and UB are constructed using costs of T and N networks. A branch-and-bound procedure is designed. The local search heuristics is suggested and tested on a collection of random networks. : 3718, : 0 |
Semantic-aware optimization of user interface menus: : 2013 : .. : Automation and Remote Control () : I. 8, V. 74 : A.I. Danilenko, M.V. Goubko. Semantic-aware optimization of user interface menus // Automation and Remote Control, August 2013, Volume 74, Issue 8, pp 1399-1411. : While the problem of hierarchical menu design is very common in user interface design, existing approaches lack either semantic aspects or optimization techniques. We suggest a semantic-aware mathematical model of hierarchical menu optimization and algorithms developed on the basis of this theory. These algorithms are implemented in the ready-to use design tool. The approach is illustrated by optimization of a banking voice menu. Original Russian Text A.I. Danilenko, M.V. Goubko, 2012, published in Problemy Upravleniya, 2012, No. 2, pp. 3844. " ", 2, 2012, . 38-44 http://www.mtas.ru/search/search_results.php?publication_id=18742 : (1134%2FS000511791308016X) : 4524, : 9289 |
|
: ( ): : 2013 : : , .., , .., , .. : / . . .. . .: , 2013. 448 . : , . , , , . : (pdf) : 3331, : 696 |
.: ( ): : 2005 : : .. . . : , 2005. : (), - . ( , ) , , ; (); - 2000. 2005., , 2001 2005 .. . , , , , , . : (pdf) : 3206, : 628 |
|
|
-: ( ): : 2013 : : 7- (MLSD'2013, ) () : 1 : .., .. - / " " (MLSD2013), 30 2 2013 ., . . 99-101. : , . - . : (pdf) : (pdf) : 6013, : 2186 |
Minimizing Degree-Based Topological Indices for Trees with Given Number of Pendent Vertices: : 2014 : .. : MATCH Commun. Math. Comput. Chem. () : V. 71, No 1 : Goubko M. Minimizing Degree-Based Topological Indices for Trees with Given Number of Pendent Vertices // MATCH Commun. Math. Comput. Chem. 2014. V. 71, No 1. P. 33-46. : We derive sharp lower bounds for the first and the second Zagreb indices (M1 and M2 respectively) for trees and chemical trees with the given number of pendent vertices and find optimal trees. M1 is minimized by a tree with all internal vertices having degree 4, while M2 is minimized by a tree where each "stem" vertex is incident to 3 or 4 pendent vertices and one internal vertex, while the rest internal vertices are incident to 3 other internal vertices. The technique is shown to generalize to the weighted first Zagreb index, the zeroth order general Randi'c index, as long as to many other degree-based indices. : (htm) : (php) : 4557, : 4022 |
Note on Minimizing Degree-Based Topological Indices of Trees with Given Number of Pendent Vertices: : 2014 : .. : MATCH Commun. Math. Comput. Chem. () : V. 72, No 3 : M. Goubko, T. Reti. Note on Minimizing Degree-Based Topological Indices of Trees with Given Number of Pendent Vertices // MATCH Commun. Math. Comput. Chem. 2014. V. 72, No 3. pp. 633-639. : Theorem 3 in [Goubko M. Minimizing Degree-Based Topological Indices for Trees with Given Number of Pendent Vertices // MATCH Commun. Math. Comput. Chem. 2014. V. 71, No 1. P. 33-46.] claims that the second Zagreb index M2 cannot be less than 11n - 27 for a tree with n >= 8 pendent vertices. Yet, a tree exists with n = 8 vertices (the two-sided broom) violating this inequality. The reason is that the proof of Theorem 3 relays on a tacit assumption that an index-minimizing tree contains no vertices of degree 2. This assumption appears to be invalid in general. In this note we show that the inequality M2 >= 11n-27 still holds for trees with n >= 9 vertices and provide the valid proof of the (corrected) Theorem 3. : (htm) : (1293) : (php) : 4729, : 40691 |
:: ( ): : 2013 : .. : () : 6 : . ., .. , . . : // . 2013. 6. . 53-61. : (Smart grid) . , . , , , , . . : (pdf) : 4189, : 785 |
IX: ( ): - : 2013 : : IX 17-18 2013 ., : / IX 17-18 2013 ., . (. . ..), .: -, 2013. : , , . XXI , , , . , , . , , , . . . , , , , -. 11-03-00787 , : 2045, һ 1. .. (100 140 ) .. : .. .. .., .. .. .. .. .., .., .., .., .. .. - . . .. .. .. .. .., .. .. .. .. : 2. ( ) .. - .. - .., .. .. . ., . . .. .., .. .., .., .. .. - .. .. . . .. . . .. .. .., .. .. .. .. .. .., .., .. .. 3. .. .. .. , .., .-.. .., .., .. .. , ss 433 .., .. . . - .. : .. PISA 2012 2015 .. .. . . .. : .. 4. ( , ) .. .., .. .., .., .. .. - .. - - .. - .. .., .. .. .. : .., .. : , , .. .. .. .. C .. () .. .. Filimonov V.A. Implementation of the reflexive analysis of V.A. Lefebvre as an example of creation of the active environment Frankowicz M. Self-organization processes in european higher education: complex adaptive systems approach 5. ( ) .. .., .. - razvitie .. .. .., .. ( - ) .., .. - . . .. . . , .., .., .., .., .., .., .., .., .. .., ., ., .. .. . . : pro et contra .. .. , : .., .. - - . .. : (pdf) : 3745, : 640 |
. 1-2, - 2012: : 2012 : : () : 1-2 (12) : / - , 1-2, - 2012, 12. : .. 12 ( ?) .. .. .. : .. .. , .., .., .., .. : .. : , .. .. .. ? - .: -, 2013. 125 . : (pdf) : 3135, : 614 |
|
|
Trees with fixed number of pendent vertices with minimal first Zagreb Index: : 2013 : : Bulletin of International Mathematical Virtual Institute () : Vol. 3(2) : Gutman I., Goubko M.V. Trees with fixed number of pendent vertices with minimal first Zagreb Index // Bulletin of International Mathematical Virtual Institute, 2013. Vol. 3(2). P. 161-164. : The first Zagreb index M1 of a graph G is equal to the sum of squares of the vertex degrees of G. In a recent work [Goubko, MATCH Commun. Math. Comput. Chem. 71 (2014), 3346], it was shown that for a tree with n_1 pendent vertices, the inequality M1 >= 9n_1−16 holds. We now provide an alternative proof of this relation, and characterize the trees for which the equality holds. : (htm) : 3914, : 776 |
|
|
.: ( ): : 2013 : .. : .. . // 2013. . : . , , , , , . : IB, IM, IS, IC. . , , . : (pdf) : 3319, : 588 |
Information Interaction Is the Fifth Type of Fundamental Interactions: : 2011 : .. : Computer Technology and Application : Gurevich I. Information Interaction Is the Fifth Type of Fundamental Interactions // Computer Technology and Application. V. 2 No 10, October 2011, P. 813-817. : Information is an integral part of the Universe. By its physical essence information is heterogeneity of matter and energy. Therefore information is inseparably connected with matter and energy. The universal measure of information in physical heterogeneity is the Shannon information entropy. An information approach along with a physical one allows to obtain new, sometimes more general data in relation to data obtained on the ground of physical rules only. The results presented in this paper show the effectiveness of informational approach for studying the interactions in the Universe. The paper shows that, along with the physical interactions the gravitational, electromagnetic, strong, weak interactions exists fifth type of fundamental interactionsinformation interaction, whose magnitude is not dependent on distance. The existence of information interaction is determined by the entanglement of quantum states, of quantum subsystems. The magnitude of information interaction is measured in bits. : (pdf) : 3017, : 911 |
|
: ( ): : 2010 : : : . / .., .., .., .., ..; : .., .., .. .., .., .; . .. . .:, 2010. 362 . : , () (). - (, , ). , . : (pdf) : 3134, : 2279 |
|
|
|
|
|
|
|
: ( ): Lambert Academic Piublishing GmbH : 2011 : : .., .. . - Saarbrucken: Lambert Academic Piublishing GmbH, 2011. : , ( , , , , , , , , , .) , , - . , , , , , , - , . . , . , , , . , . . : (pdf) : 3254, : 653 |
, ( ). II: : 1977 : : () : 9 : , , , . , ( ). II // , 1977. 9. . 123 136. : , . : (pdf) : (php) : 3359, : 953 |
Design of experiments on models of organizations: : 1988 : : Automation and remote control () : 8 : O. Yu. Cheprunova, A.V. Shchepkin. Design of experiments on models of organizations // Automation and remote control, 1988. #8. P. 1060-1067. : Logical foundations of experimental design for models of organizations are presented and a method of designing organizational experiments is described. : (pdf) : (php) : 3123, : 1815 |
Competition mechanisms for allocation of scare resources: Burkov V. N. / Enaleev A. K. : : 1988 : : Automation and remote control () : 11 : V.N. Burkov, B. Danev, A.K. Enaleev, T.B. Naneva, L.D. Podval'nyi, B.S. Yusupov. Competition mechanisms for allocation of scare resources // Automation and remote control, 1988. #11. P. 1505-1513. : We investigate the efficiency of competition mechanisms for the allocation of scare resources. We show that for certain classes of effect functions (production functions) competition mechanisms ensure optimal allocation of resources between the winners. A connection is established between competition mechanisms and open management mechanisms. : (pdf) : (php) : 3649, : 1123 |
Asymptotic aggregation: . . / . . : : 1989 : : Automation and remote control () : 1 : G.R. Adilov, V.I. Opoitsev. Asymptotic aggregation // Automation and remote control, 1989. #1. P. 101-108. : We study systems for which aggregation is asymptotically ideal as the system size increases, i.e. the errors of the simplified macro description, in statistical average sense, tend to zero. : : : (pdf) : (php) : 3417, : 2186 |
Correct adaptive mechanisms: : 1989 : : Automation and remote control () : 6 : V.V. Tsyganov. Correct adaptive mechanisms // Automation and remote control, 1989. # 6. P. 796-804. : We consider an active system comprising a center and a far-sighted active element with a controlled stochastic model of constraints. The notion of correctness of adaptive functioning mechanisms (AFMs) is generalized under conditions of uncertainty (including the case of unrealistic plans). Optimal synthesis of a correct AFM is considered. The characteristic function of the AFM yielding the necessary and sufficient conditions of correctness is constructed. The optimal incentive procedure is synthesized for a correct AFM. Open and two-way planning problems in AFM are formulated and solved. The results are applied to the case of guaranteed correct AFMs. : (pdf) : (php) : 3094, : 817 |
Coalitions under a competition mechanism of resource allocation: Burkov V. N. / Enaleev A. K. : : 1989 : : Automation and remote control () : 12 : V.N. Burkov, A.K. Enaleev, V.F. Kalenchuk. Coalitions under a competition mechanism of resource allocation // Automation and remote control, 1989. #12. P. 1679-1686. : A competition mechanism of resource allocation to n users was considered in [1]. It was shown that, first, the competition mechanism ensures the existence of a Nash equilibrium in the system, which is determined by the strategy of the "best" loser in the competition, and, second, the competition mechanism achieves a nearly optimal allocation. However, we assumed in [1] that the winners and losers did not form coalitions. In this paper, we investigate the conditions for the formation of such coalitions and their impact on the efficiency of the system. : (pdf) : (php) : 3585, : 1613 |
Coordinated planning in a discrete active system: : 1990 : : Automation and remote control () : 1 : M.M. Medetov, K.D. Raimbekov, K.S. Sagyngaliev. Coordinated planning in a discrete active system // Automation and remote control, 1990. #1. P. 71-81. : The problem of coordinated planning of the production divisions in a discrete active system is considered and the corresponding mathematical model is constructed. The properties of the set of coordinated solutions are identified and studied. A solution method is proposed and its complexity is estimated. The paper reports the results of one of the first attempts to apply the principles of coordinated planning in a small-batch multiproduct enterprise (development and installation of a computerized on-line/long-term coordinated planning system for a stamping shop in an instrument-building plant). : (pdf) : (php) : 3086, : 1985 |
Optimal incentives in an active system with a stochastic element: Enaleev A. K. : : 1990 : : Automation and remote control () : 2 : A.K. Enaleev, Yu.G. Lavrov. Optimal incentives in an active system with a stochastic element // Automation and remote control, 1990. #2. P. 223-231. : A model of an active system with a stochastic element is considered. The optimal incentive function is synthesized. : ( ) : : : : (pdf) : (php) : 3031, : 1804 |
2731 - 2760 3337
| . | 87 88 89 90 91 92 93 94 95 96 97 | . |