406 research outputs found

    On extending actions of groups

    Full text link
    Problems of dense and closed extension of actions of compact transformation groups are solved. The method developed in the paper is applied to problems of extension of equivariant maps and of construction of equivariant compactifications

    Russia\u27s Strategy of Success: Resources of Economy and Culture

    Get PDF

    On the localization of discontinuities of the first kind for a function of bounded variation

    Full text link
    Methods of the localization (detection of positions) of discontinuities of the first kind for a univariate function of bounded variation are constructed and investigated. Instead of an exact function, its approximation in L2(-∞,+∞) and the error level are known. We divide the discontinuities into two sets, one of which contains discontinuities with the absolute value of the jump greater than some positive Δmin; the other set contains discontinuities satisfying a smallness condition for the value of the jump. It is required to find the number of discontinuities in the former set and localize them using the approximately given function and the error level. Since the problem is ill-posed, regularizing algorithms should be used for its solution. Under additional conditions on the exact function, we construct regular methods for the localization of discontinuities and obtain estimates for the accuracy of localization and for the separability threshold, which is another important characteristic of the method. The (order) optimality of the constructed methods on the classes of functions with singularities is established. © 2013 Pleiades Publishing, Ltd

    Budget Feasible Mechanisms for Experimental Design

    Full text link
    In the classical experimental design setting, an experimenter E has access to a population of nn potential experiment subjects i{1,...,n}i\in \{1,...,n\}, each associated with a vector of features xiRdx_i\in R^d. Conducting an experiment with subject ii reveals an unknown value yiRy_i\in R to E. E typically assumes some hypothetical relationship between xix_i's and yiy_i's, e.g., yiβxiy_i \approx \beta x_i, and estimates β\beta from experiments, e.g., through linear regression. As a proxy for various practical constraints, E may select only a subset of subjects on which to conduct the experiment. We initiate the study of budgeted mechanisms for experimental design. In this setting, E has a budget BB. Each subject ii declares an associated cost ci>0c_i >0 to be part of the experiment, and must be paid at least her cost. In particular, the Experimental Design Problem (EDP) is to find a set SS of subjects for the experiment that maximizes V(S) = \log\det(I_d+\sum_{i\in S}x_i\T{x_i}) under the constraint iSciB\sum_{i\in S}c_i\leq B; our objective function corresponds to the information gain in parameter β\beta that is learned through linear regression methods, and is related to the so-called DD-optimality criterion. Further, the subjects are strategic and may lie about their costs. We present a deterministic, polynomial time, budget feasible mechanism scheme, that is approximately truthful and yields a constant factor approximation to EDP. In particular, for any small δ>0\delta > 0 and ϵ>0\epsilon > 0, we can construct a (12.98, ϵ\epsilon)-approximate mechanism that is δ\delta-truthful and runs in polynomial time in both nn and loglogBϵδ\log\log\frac{B}{\epsilon\delta}. We also establish that no truthful, budget-feasible algorithms is possible within a factor 2 approximation, and show how to generalize our approach to a wide class of learning problems, beyond linear regression

    On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum

    Full text link
    In this paper, we consider the problem of finding a maximum cardinality subset of vectors, given a constraint on the normalized squared length of vectors sum. This problem is closely related to Problem 1 from (Eremeev, Kel'manov, Pyatkin, 2016). The main difference consists in swapping the constraint with the optimization criterion. We prove that the problem is NP-hard even in terms of finding a feasible solution. An exact algorithm for solving this problem is proposed. The algorithm has a pseudo-polynomial time complexity in the special case of the problem, where the dimension of the space is bounded from above by a constant and the input data are integer. A computational experiment is carried out, where the proposed algorithm is compared to COINBONMIN solver, applied to a mixed integer quadratic programming formulation of the problem. The results of the experiment indicate superiority of the proposed algorithm when the dimension of Euclidean space is low, while the COINBONMIN has an advantage for larger dimensions.Comment: To appear in Proceedings of the 6th International Conference on Analysis of Images, Social Networks, and Texts (AIST'2017

    DEVELOPMENT OF A MODEL FOR THE PRODUCTION OF METAL-POWDER COMPOSITIONS BASED ON CO-CR ALLOYS BY ELECTROEROSIVE DISPERSION

    Get PDF
    Abstract. The main requirement for powders for additive 3d technologies is the spherical shape of theparticles. Such particles are most compactly packed into a certain volume and ensure the "fluidity" of the powder composition in the supply systems of the material with minimal resistance. The wide use of the EED method for processing metal waste into powders for the purpose of their reuse and application in additive technologies is hampered by the lack in the scientific and technical literature of full-fledged information on the effect of the initial composition, regimes and media on the properties of powders and technologies of practical application. Therefore, in order to develop technologies for the reuse of electroerosive powders and to evaluate the effectiveness of their use, complex theoretical and experimental studies are required. The aim of the work was to develop a model for the production of metal powder compositions on the basis of Co-Cr alloys by electroerosive dispersion. Based on the results of the conducted studies, it has been established that the optimum parameters for the process of obtaining powder materials by the method of electroerosive dispersion of butyl alcohol are: capacitance of discharge capacitors 48 μF, voltage on electrodes 100 V, repetition rate of pulses 120 Hz

    Modeling of temperature fields in the working chamber of the process furnace for REE synthesis

    Get PDF
    The results of mathematical modeling of temperature fields in the working chamber of the process furnace for special purposes are shown. Studied laboratory furnace is test equipment, which is used for practicing the stages of the technological process of continuous solid-phase synthesis of nanopowders of various purpose, such as obtaining of luminophore powders with rare earth elements oxides in its composition. Mathematical model adequacy is tested empirically

    Influence of the focused ion beam parameters on the etching of planar nanosized multigraphene/SiC field emitters

    Full text link
    The equipment of the Collective Usage Center “Nanotechnologies” and the Research and Educational Center "Nanotechnologies" of Southern Federal University was used for this study. This work was funded by Internal grant of Southern Federal University No. VnGr-07/2017-26
    corecore