The article demonstrates the application of the Return-Risk model to develop a synthesized investment strategy. The following parameters of the model are determined as the main sought-for parameters: the size of the t...
The article demonstrates the application of the Return-Risk model to develop a synthesized investment strategy. The following parameters of the model are determined as the main sought-for parameters: the size of the time interval, the frequency of portfolio structure revision and the optimal length of the training set. On the example of indices of real estate investment trusts, computational experiments were carried out. Most databases on prices and dividends of financial instruments are updated monthly, so 1 month is chosen as the time interval. The sliding verification method was used to calculate the optimal frequency of revising the portfolio structure in terms of profitability – twice a year. With this frequency, the average portfolio returns increased by 1.5 times. More frequent restructuring reduces the profitability and stability of the portfolio. The search for the optimal length of the training sample was made by the method of coordinate descent and amounted to 5 years. The average monthly expected return on one instrument with this parameter was 0.4%. The evaluation of the resulting synthesized portfolio showed its superiority in terms of profitability over the S&P 500 stock index by almost 2 times.
In recent years, due to the active development of distributed computing technologies, the automation of computations based on these technologies became very important for solving the problems of qualitative research o...
详细信息
ISBN:
(数字)9789532330991
ISBN:
(纸本)9781728153391
In recent years, due to the active development of distributed computing technologies, the automation of computations based on these technologies became very important for solving the problems of qualitative research of binary dynamic systems, which are widely used as mathematical models in cryptography, bioinformatics, the study of fault tolerance of computer networks, and some other domains. In this regard, the issues are actualized of developing tools and providing infrastructures for the microservice-based implementation of scientific applications, which are characterized by the dynamism of resource requirements and oriented to use in a hybrid cloud environment. We offer microservice-oriented tools for the automation of solving computationally complex problems of a qualitative study of attractors of binary dynamic systems in a hybrid computing environment. This study is based on the Boolean constraint method and allows the finding of evolutionary parameters of system states (such as, for example, radius, period, and branching) without modeling systemdynamics. These tools provide the agents implemented as web-services for the integration of resources of on-premises computers with cloud resources using Dew computing. An example of the application of the developed tools is given.
We present comprehensive analysis of the angular structure of the Drell-Yan process at different rapidity and kinematical ranges using data of the ATLAS, LHCb, and CMS Collaborations at CERN LHC. From theory side we d...
详细信息
New methods and techniques developed small research teams for processing remote sensing that are rarely available to other teams. For the exchange of new methods among users, it is necessary to develop an applied digi...
详细信息
The conditional gradient idea proposed by Marguerite Frank and Philip Wolfe in 1956 was so well received by the community that new algorithms (also called Frank-Wolfe type algorithms) are still being actively created....
详细信息
An optimal control problem for a sweeping process driven by impulsive controls is considered. The controlsystem we study is described by both a measure-driven differential equation and a differential inclusion. This ...
详细信息
Boolean satisfiability is one of the fundamental problems in mathematical logic and the theory of computation. Many practical problems can be formulated as problems of Boolean satisfiability (solving a system of Boole...
详细信息
ISBN:
(数字)9789532330991
ISBN:
(纸本)9781728153391
Boolean satisfiability is one of the fundamental problems in mathematical logic and the theory of computation. Many practical problems can be formulated as problems of Boolean satisfiability (solving a system of Boolean equations). These include the tasks of cryptography, qualitative research of binary dynamic systems, logical programming, robot action planning, and many others. NP-complexity of the Boolean satisfiability problem actualizes the development of parallel software for solving it in a high-performance computing environment. We focus on the development of specialized parallel solvers for Boolean satisfiability problems oriented to the application in the qualitative study of binary dynamic systems based on the Boolean constraint method. The Boolean constraint method uses a formal definition of the dynamical property, presented in the language of predicate logic with limited existential and universal quantifiers. Based on this definition, a model of dynamical property is formed in the form of Boolean constraints by a series of sequential formal transformations. The developed parallel solvers provide a conclusion on the feasibility of Boolean constraints, interpret this conclusion accordingly the tested property, and find, unlike similar software tools, all sets of values of Boolean variables that lead to this conclusion. An example of applying the developed solver to constructing cycles of a given length of stream ciphers based on shift registers is considered. The results confirming the effectiveness and scalability of the developed software are presented.
In the paper we propose new algorithms for constructing compact representations of databases of conflict clauses accumulated by state-of-the-art CDCL SAT solvers. These algorithms use the Decision Diagrams of a specia...
详细信息
ISBN:
(数字)9789532330991
ISBN:
(纸本)9781728153391
In the paper we propose new algorithms for constructing compact representations of databases of conflict clauses accumulated by state-of-the-art CDCL SAT solvers. These algorithms use the Decision Diagrams of a special kind (the so-called Disjunctive Diagrams). We consider several families of hard SAT instances and use them to compare the implementations of the proposed algorithms and the well-known CUDD package that uses Zero-Suppressed Binary Decision Diagrams (ZBDD) for solving similar problems. The computational experiments clearly show that our algorithm that uses Disjunctive Diagrams has better effectiveness compared to CUDD.
In this paper we describe the construction of a set of full-round MD4 compression function values, which are weak against the preimage attack of a special kind. The cardinality estimation for this set, obtained by usi...
详细信息
ISBN:
(数字)9789532330991
ISBN:
(纸本)9781728153391
In this paper we describe the construction of a set of full-round MD4 compression function values, which are weak against the preimage attack of a special kind. The cardinality estimation for this set, obtained by using an effective probabilistic algorithm, is close to 2 32 . According to this, the fraction of weak outputs in the set of all outputs of the MD4 compression function is about $2^{-96}$. Thus, the probability to obtain an easyinvertible output by choosing a random input is significantly higher than $2^{-128}$. These results demonstrate that the full-round MD4 compression function does not have the properties of a random oracle.
Web tables are an important source of knowledge and can be used for ontology engineering. In this paper, we propose the approach for the semi-automated formation of domain ontologies at the assertion level (ABox) base...
详细信息
ISBN:
(纸本)9781665423281
Web tables are an important source of knowledge and can be used for ontology engineering. In this paper, we propose the approach for the semi-automated formation of domain ontologies at the assertion level (ABox) based on web tables. The proposed approach consists of 6 steps and is based on the use of the semantic annotation of separate elements of web tables. With the use of the semantic annotation procedure, we extract specific entities (ontology instances) from table cells. Our approach is implemented in the form of a web-based tool. We present a description of the architecture of this tool, as well as its experimental evaluation in the case of domain ontology engineering for the TALISMAN framework. We have formed a special dataset for our experiment. The results obtained show the prospects of using our approach and tool to support ontology engineering based on the semantic annotation of web tables.
暂无评论