Implementation of a Port-graph Model for Finance

In this paper we examine the process involved in the design and implementation of a port-graph model to be used for the analysis of an agent-based rational negligence model. Rational negligence describes the phenomenon that occurred during the financial crisis of 2008 whereby investors chose to trade asset-backed securities without performing independent evaluations of the underlying assets. This has contributed to motivating the search for more effective and transparent tools in the modelling of the capital markets. This paper shall contain the details of a proposal for the use of a visual declarative language, based on strategic port-graph rewriting, as a visual modelling tool to analyse an asset-backed securitisation market.Comment: In Proceedings TERMGRAPH 2018, arXiv:1902.0151

THE STUDY OF BIOCHEMICAL PARAMETERS FOR NAVAL ACADEMY TEAM IN THE NAVAL PENTATHLON

Under consideration accomplished subdued research a series of the biochemical parameters (the haemoglobin, albuminoidal, lactic acid), who conditions the physical special effort. Hold the medical area ( A. Demeter, 1982; I. Dragan, 1984; M. Ifrim, 1989, etc.) propose in the process of selection grids with standard values have the parameters determinant in the system criterions of selection. Biochemical investigations suggested were effectuate in this experimentally stage to the initially and final moment. Through these inhibition of laboratory investigation we have follow: 1. If the results obtained frames in the natural suggested limits hold by the medical area specialist; 2. In what grey the investigations values obtained are influenced of the specific complex effort from the military pentathlon. The biochemical investigation realized demonstrated that the results obtained of subjects the group of the experiment they framed in natural physiological limits. From the series four the biochemical parameters apply in research, from statistical viewpoint to the ultimate testing mark crease average values to the level experiment group. "the haemoglobin, albuminoidal, lactic acid, the urea

CRITICAL DEVELOPMENT OF COSTING METHODS USED IN THE FURNITURE INDUSTRY, IN THE CONTEXT OF ECONOMIC REALITY SPECIAL XXI CENTURY

In the current economic downturn in the furniture industry companies, to face competition, requires new costing methods to succeed, in a flexible manner, fructifying market information, inside to find levers to identify places, resource intensive activities and then cost reduction opportunities. New methods of management cost excess the accounting and economics scope Current economic situation requires this work and converts the cost information into the main tool of insurance competitiveness and profitability of the company. Applying the standard cost in single cost model is a viable business solutions of enterprises in the furniture industry to face strong competition from European Union, specifically in the context of complex economic XXI century.cost, value, performance, costing system, efficiency;

Hardness of submodular cost allocation : lattice matching and a simplex coloring conjecture

We consider the Minimum Submodular Cost Allocation (MSCA) problem. In this problem, we are given k submodular cost functions f1, ... , fk: 2V -> R+ and the goal is to partition V into k sets A1, ..., Ak so as to minimize the total cost sumi = 1,k fi(Ai). We show that MSCA is inapproximable within any multiplicative factor even in very restricted settings; prior to our work, only Set Cover hardness was known. In light of this negative result, we turn our attention to special cases of the problem. We consider the setting in which each function fi satisfies fi = gi + h, where each gi is monotone submodular and h is (possibly non-monotone) submodular. We give an O(k log |V|) approximation for this problem. We provide some evidence that a factor of k may be necessary, even in the special case of HyperLabel. In particular, we formulate a simplex-coloring conjecture that implies a Unique-Games-hardness of (k - 1 - epsilon) for k-uniform HyperLabel and label set [k]. We provide a proof of the simplex-coloring conjecture for k=3