Intellectual agents of targets in analytical constructing of optimum systems of management of drum mills

Purpose. Justification of the rational use of intellectual agents in forming of the quasi-optimal systems of management furnaces of complexes of type drum mills as observers of complete order. A method of research consists of decision of the best laws management by the mining complexes by the use of methods of the analytical constructing of optimum regulators withthe input in their structures of such essences as intellectual agents as observers of complete order. Results of research. Management by the mining and processing complexes it is perspective to carry out on the basis of the quasi-optimal systems of management. Taking into account properties and sensitiveness of intellectual agents, expediently to include them at the analytical constructing of regulators in the structure of observers of complete order. This increases in accordance with securing functional of quality criterion of exactness of optimum stabilization of rational technology of process of growing shallow in the drum mills. Scientific novelty. A new structure is set of the quasi-optimal system of management by the technological dynamics of drum mills with the asymptotic observer of complete order. Of efficiency of recognition and operative management it is suggested to carry the rise out on the basis of functional possibilities of intellectual agents of targets, as which an observer comes forward of complete order in aggregate with the considered technological processes in the mining and processing complexes. Practical value. Results of researches allow to recommend a rational chart of quasi-optimal management by the drum mills in accordance with the set criterion. In the spectrum of the active power consumable by the drive electric motor technological constituents are selected, which are conditioned by the difficult vibrations of ore mass of filling of drum. Their maximal values are selected ekstremum by detector and are watched by the observer of complete order with the optimum stabilization. This allows to secure intensification of return of the prepared class.

Early peroral feeding after pancreaticoduodenecomy

Objective. To analyze the various ways for enteral feeding after pancreaticoduodenectomy. Materials and methods. There were investigated the results of pancreaticoduodenectomy, performed in 78 patients, suffering tumors of pancreatic head and periampullary zone, in whom various methods of nutritive support, in 2003 - 2017 yrs were applied. For comparative analysis the patients were divided into two groups: the first - 39 patients, perioperative treatment of whom was conducted in accordance to the ERAS program, and the second - 39 patients, who were treated using a standard method. In patients of the first group the effects of a peroral way of nutrition were compared, as well as combined peroral and enteral nutrition via microjejunostomy. There were studied the terms of restoration of peroral feeding, the gastrostasis rate, the nutrition calorage during 7 postoperative days, levels of general protein and albumin on the first, third and seventh postoperative day. Results. In 33 (84.6%) patients of the first group the peroral nutrition restoration have occurred in complete order to the protocol. The gastrostasis rate in patients of the first group was essentially lesser, than in patients of the second group. In the first group this complication have occurred in 6 (15.4%) patients, in the second group - in 14 (35.9%) patients (p = 0.009). Dynamics of level of general protein and albumin of the blood in postoperative period did not depend on method and energetic estimate of the nutrition. Conclusion. Application of peroral feeding, in accordance to the concept of the program for accelerated restoration of the patients, survived after pancreaticododenectomy, constitutes an optimal way for the nutrient support of an organism and permits to reduce the gastrostasis rate trustworthily.

Online Discovery of Search Objectives for Test-Based Problems

In test-based problems, commonly approached with competitive coevolutionary algorithms, the fitness of a candidate solution is determined by the outcomes of its interactions with multiple tests. Usually, fitness is a scalar aggregate of interaction outcomes, and as such imposes a complete order on the candidate solutions. However, passing different tests may require unrelated “skills,” and candidate solutions may vary with respect to such capabilities. In this study, we provide theoretical evidence that scalar fitness, inherently incapable of capturing such differences, is likely to lead to premature convergence. To mitigate this problem, we propose disco, a method that automatically identifies the groups of tests for which the candidate solutions behave similarly and define the above skills. Each such group gives rise to a derived objective, and these objectives together guide the search algorithm in multi-objective fashion. When applied to several well-known test-based problems, the proposed approach significantly outperforms the conventional two-population coevolution. This opens the door to efficient and generic countermeasures to premature convergence for both coevolutionary and evolutionary algorithms applied to problems featuring aggregating fitness functions.

Recipes for Structural Fairness in Games

Background. Although fairness is central to society and to games that are taken seriously, the structural aspect of fairness has not been addressed as a problem of games. Aim. To resolve the problem of structural fairness in multi-player, multi-episodic games, especially for business games that are transaction based, where sales result from individual transactions rather than from formulae that aggregate and allocate modeled-market demand. Method. Mathematics and examples are used to clarify positions, present proofs, and show application. Argument. Structural fairness is of three kinds: positional, order, and arrival. Finding. For fixed number of parties, positional rotation assures complete positional fairness, whereas order rotation assures both complete positional fairness and complete order fairness, but only when number-of-party and number-of-episode conditions are satisfied. For variable number of parties, arrival rotation assures fairness to parties added last. The classic Gold and Pray model can be modified to allow supply to affect demand by applying order rotation to stock outs. Application. The rotational procedures apply to business games with modeled and real markets, and may apply to all games with a scoring system that is taken seriously. Conclusion. Games can be structurally fair, but the game that is structurally fair must be a multi-episodic game that incorporates fairness into its design. For assuring structural fairness, proportional and random methods are generally inferior to rotation.

Close hereditary C*-subalgebras and the structure of quasi-multipliers

We answer a question of Takesaki by showing that the following can be derived from the thesis of Shen: if A and B are σ-unital hereditary C*-subalgebras of C such that ‖p – q‖ < 1, where p and q are the corresponding open projections, then A and B are isomorphic. We give some further elaborations and counterexamples with regard to the σ-unitality hypothesis. We produce a natural one-to-one correspondence between complete order isomorphisms of C*-algebras and invertible left multipliers of imprimitivity bimodules. A corollary of the above two results is that any complete order isomorphism between σ-unital C*-algebras is the composite of an isomorphism with an inner complete order isomorphism. We give a separable counterexample to a question of Akemann and Pedersen; namely, the space of quasi-multipliers is not linearly generated by left and right multipliers. But we show that the space of quasi-multipliers is multiplicatively generated by left and right multipliers in the σ-unital case. In particular, every positive quasi-multiplier is of the form T*T for T a left multiplier. We show that a Lie theory consequence of the negative result just stated is that the map sending T to T*T need not be open, even for very nice C*-algebras. We show that surjective maps between σ-unital C*-algebras induce surjective maps on left, right, and quasi-multipliers. (The more significant similar result for multipliers is Pedersen's non-commutative Tietze extension theorem.) We elaborate the relations of the above with continuous fields of Hilbert spaces and in so doing answer a question of Dixmier and Douady. We discuss the relationship of our results to the theory of perturbations of C*-algebras.

CHOOSING A TRAVEL AGENCY FRANCHISE BY MEAN OF A GLOBAL COMPOSITE INDICATOR: AN APPLICATION IN SPAIN

This paper highlights the complexity of the franchise partner selection process from a franchisee's perspective. The purpose of this article is, firstly, to propose the definition of a system of indicators which include all the relevant information which the potential franchisee should take into consideration when choosing a chain secondly, to obtain a global composite indicator for the construction of a ranking of franchisors. In order to illustrate the procedure, a sample of travel agency franchisors in Spain and a suitable database to quantify the indicators are considered. The paper concludes constructing a complete order of the franchisors in the travel agency industry. In addition, the results show the most important characteristics of franchisors that potential franchisees must take into account. The value of the paper is significant as it provides a practical frame – work for potential franchisees in the selection of franchisors.