392 research outputs found

    Hungarian Enterprises in the Global Market

    Get PDF
    This paper reports on Hungarian companies and how they perform on the global market. The first part of the paper provides some background and historic information on government support for export. Four successful companies were selected, from computer technology, acoustics, pharmaceutical industry and lighting retailing. These four companies are very different, however they all became successful internationally. We set out to provide an insight into their success by describing their case from their origins to the present day

    NEURAL NETWORK CONTROLLED ADAPTIVE FILTERS

    Get PDF
    Recently SZTIPÁNOVITS has proposed [2,3] an adaptive processing system - an adaptive FIR filter structure - that consists of a resonator based digital filter (RBDF) and a neural network. The RBDF is a highly parallel structure with several structural and implementational advantages, which in the proposed case performs a recursive transformation as well. This paper focuses on the advantages and disadvantages of the proposed composite structure. Some improvements are suggested, for example extending the parallelism of the structure to the neural network as well, which results in a better convergence rate of the training procedure. On the other hand, the convergence rate can be improved by using the combination of the output error and the transform domain component error. Finally the structure is extended to adaptive IIR filtering problems which requires the modification of the resonator based IIR structure

    Bad semidefinite programs: they all look the same

    Get PDF
    Conic linear programs, among them semidefinite programs, often behave pathologically: the optimal values of the primal and dual programs may differ, and may not be attained. We present a novel analysis of these pathological behaviors. We call a conic linear system Ax<=bAx <= b {\em badly behaved} if the value of supAx<=b\sup { | A x <= b } is finite but the dual program has no solution with the same value for {\em some} c.c. We describe simple and intuitive geometric characterizations of badly behaved conic linear systems. Our main motivation is the striking similarity of badly behaved semidefinite systems in the literature; we characterize such systems by certain {\em excluded matrices}, which are easy to spot in all published examples. We show how to transform semidefinite systems into a canonical form, which allows us to easily verify whether they are badly behaved. We prove several other structural results about badly behaved semidefinite systems; for example, we show that they are in NPcoNPNP \cap co-NP in the real number model of computing. As a byproduct, we prove that all linear maps that act on symmetric matrices can be brought into a canonical form; this canonical form allows us to easily check whether the image of the semidefinite cone under the given linear map is closed.Comment: For some reason, the intended changes between versions 4 and 5 did not take effect, so versions 4 and 5 are the same. So version 6 is the final version. The only difference between version 4 and version 6 is that 2 typos were fixed: in the last displayed formula on page 6, "7" was replaced by "1"; and in the 4th displayed formula on page 12 "A_1 - A_2 - A_3" was replaced by "A_3 - A_2 - A_1

    Strong duality in conic linear programming: facial reduction and extended duals

    Full text link
    The facial reduction algorithm of Borwein and Wolkowicz and the extended dual of Ramana provide a strong dual for the conic linear program (P)sup<c,x>AxKb (P) \sup {<c, x> | Ax \leq_K b} in the absence of any constraint qualification. The facial reduction algorithm solves a sequence of auxiliary optimization problems to obtain such a dual. Ramana's dual is applicable when (P) is a semidefinite program (SDP) and is an explicit SDP itself. Ramana, Tuncel, and Wolkowicz showed that these approaches are closely related; in particular, they proved the correctness of Ramana's dual using certificates from a facial reduction algorithm. Here we give a clear and self-contained exposition of facial reduction, of extended duals, and generalize Ramana's dual: -- we state a simple facial reduction algorithm and prove its correctness; and -- building on this algorithm we construct a family of extended duals when KK is a {\em nice} cone. This class of cones includes the semidefinite cone and other important cones.Comment: A previous version of this paper appeared as "A simple derivation of a facial reduction algorithm and extended dual systems", technical report, Columbia University, 2000, available from http://www.unc.edu/~pataki/papers/fr.pdf Jonfest, a conference in honor of Jonathan Borwein's 60th birthday, 201

    Characterizing the universal rigidity of generic frameworks

    Full text link
    A framework is a graph and a map from its vertices to E^d (for some d). A framework is universally rigid if any framework in any dimension with the same graph and edge lengths is a Euclidean image of it. We show that a generic universally rigid framework has a positive semi-definite stress matrix of maximal rank. Connelly showed that the existence of such a positive semi-definite stress matrix is sufficient for universal rigidity, so this provides a characterization of universal rigidity for generic frameworks. We also extend our argument to give a new result on the genericity of strict complementarity in semidefinite programming.Comment: 18 pages, v2: updates throughout; v3: published versio

    Effect of Cutting Date on Quality of Red Clover Forage

    Get PDF
    Development stage or plant age is an important factor determining the chemical composition and quality of red clover forage (Ignjatovic et al., 2001). In early spring, young red clover plants have large leaf mass, high contents of moisture, protein and minerals and a low fibre content. In the course of the growing season, under the effects of long days and high temperatures, the plant undergoes morphological changes: leaves grow more slowly, the stem elongates, dry matter yield increases and quality drops, especially digestibility and the contents of protein and minerals

    A novel forest state assessment methodology to support conservation and forest management planning

    Get PDF
    A new forest state assessment methodology to complement existing conservation and forestry data has been developed. The aim is to provide tools for strategic planning including spatial distribution of conservation priorities. The method is point-based using a dense systematic sampling grid and provides more detailed information than vegetation maps or forest subcompartment descriptions, but requires less effort than forest inventories. Indicators include canopy composition and structure, deadwood, herbs, microhabitats, disturbances, shrubs and regeneration. The results can inform managers about the structural and compositional diversity of forest stands in the form of thematic maps and can provide the basis for analysis of habitat suitability for forest-dwelling organisms. A smartphone application has been developed to enable electronic data collection. PostGIS and Python scripts were used in the data flow. In this paper, we outline the development of the assessment protocol, and present the sampling design and the variables recorded. The main advantages of the survey methodology are also shown by case-studies based on data collected during the first field season in 2014. The protocol has been designed for low mountain forests in Hungary, but it can be modified to fit other forest types
    corecore