61 research outputs found
Optimization of approximate inhibitory rules relative to number of misclassifications
In this work, we consider so-called nonredundant inhibitory rules, containing an expression "attribute≠ value" on the right-hand side, for which the number of misclassifications is at most a threshold y. We study a dynamic programming approach for description of the considered set of rules. This approach allows also the optimization of nonredundant inhibitory rules relative to the length and coverage [1, 2]. The aim of this paper is to investigate an additional possibility of optimization relative to the number of misclassifications. The results of experiments with decision tables from the UCI Machine Learning Repository [3] show this additional optimization achieves a fewer misclassifications. Thus, the proposed optimization procedure is promising
A Machine-Synesthetic Approach To DDoS Network Attack Detection
In the authors' opinion, anomaly detection systems, or ADS, seem to be the
most perspective direction in the subject of attack detection, because these
systems can detect, among others, the unknown (zero-day) attacks. To detect
anomalies, the authors propose to use machine synesthesia. In this case,
machine synesthesia is understood as an interface that allows using image
classification algorithms in the problem of detecting network anomalies, making
it possible to use non-specialized image detection methods that have recently
been widely and actively developed. The proposed approach is that the network
traffic data is "projected" into the image. It can be seen from the
experimental results that the proposed method for detecting anomalies shows
high results in the detection of attacks. On a large sample, the value of the
complex efficiency indicator reaches 97%.Comment: 12 pages, 2 figures, 5 tables. Accepted to the Intelligent Systems
Conference (IntelliSys) 201
Decision rules, trees and tests for tables with many-valued decisions : comparative study
In this paper, we present three approaches for construction of decision rules for decision tables with many-valued decisions. We construct decision rules directly for rows of decision table, based on paths in decision tree, and based on attributes contained in a test (super-reduct). Experimental results for the data sets taken from UCI Machine Learning Repository, contain comparison of the maximum and the average length of rules for the mentioned approaches
Decision rules derived from optimal decision trees with hypotheses
Conventional decision trees use queries each of which is based on one attribute. In this study, we also examine decision trees that handle additional queries based on hypotheses. This kind of query is similar to the equivalence queries considered in exact learning. Earlier, we designed dynamic programming algorithms for the computation of the minimum depth and the minimum number of internal nodes in decision trees that have hypotheses. Modification of these algorithms considered in the present paper permits us to build decision trees with hypotheses that are optimal relative to the depth or relative to the number of the internal nodes. We compare the length and coverage of decision rules extracted from optimal decision trees with hypotheses and decision rules extracted from optimal conventional decision trees to choose the ones that are preferable as a tool for the representation of information. To this end, we conduct computer experiments on various decision tables from the UCI Machine Learning Repository. In addition, we also consider decision tables for randomly generated Boolean functions. The collected results show that the decision rules derived from decision trees with hypotheses in many cases are better than the rules extracted from conventional decision trees
Relationship of receivables and creditorial duties: Impact on Financial Indicators
In the process of financial and economic activities, companies constantly make settlements: with suppliers and contractors, buyers and customers, personnel, accountable persons, other debtors and creditors. Debt for all calculations should be within the limits of acceptable values. Doubtful accounts receivable and overdue accounts payable testify to violations of financial and payment discipline, which requires immediate taking appropriate measures to eliminate negative consequences. Timely adoption of these measures is possible only if the enterprise exercises systematic control.The development of market relations increases the responsibility and independence of enterprises in the development and adoption of management decisions to ensure the effectiveness of settlements with debtors and creditors.Analysis of settlements with debtors and creditors is of vital importance for any enterprise that is actively working in a market economy.The shortage of cash in the economy and the insolvency of many enterprises have made the issues of working with debtors and creditors one of the main functions of financial managers. The problem of managing accounts receivable and accounts payable is to a considerable extent complicated by the imperfection of the regulatory and legislative framework in terms of debt collection.Debt and payables are natural elements of the company's balance sheet. They appear in connection with the mismatch of the date of occurrence of obligations with the date of cash settlement for them. The financial condition of the company is influenced by the size of these types of debts, and the period of turnover of each of the debts.In carrying out entrepreneurial activities, those who take part in the turnover of property assume that after full implementation of economic operations they will be able not only to return the invested funds, but also to receive benefits and revenues
A Twistor Formulation of the Non-Heterotic Superstring with Manifest Worldsheet Supersymmetry
We propose a new formulation of the type II superstring which is
manifestly invariant under both target-space supersymmetry and worldsheet
super reparametrizations. This gives rise to a set of twistor
(commuting spinor) variables, which provide a solution to the two Virasoro
constraints. The worldsheet supergravity fields are shown to play the r\^ole of
auxiliary fields.Comment: 21p., LaTe
Twistor--like Formulation of the Supermembrane in D=11
We propose a new formulation of the D=11 supermembrane theory that involves
commuting spinors (twistor--like variables) and exhibits a manifest
--extended world volume supersymmetry . This supersymmetry
replaces components of the usual --symmetry. We show that this
formulation is classically equivalent to the standard one.Comment: 18 pages, Te
Generalized Action Principle and Superfield Equations of Motion for d=10 D-p-branes
The action for the D=10 type II Dirichlet super-p-branes, which has been
obtained recently, is reconstructed in a more geometrical form involving
Lorentz harmonic variables. This new (Lorentz-harmonic) formulation possesses
kappa-symmetry in an irreducible form and is used as a basis for applying a
generalized action principle that provides the superfield equations of motion
and clarifies the geometrical nature of the kappa-symmetry of these models. The
case of a Dirichlet super-3-brane is considered in detail.Comment: LaTeX file, 22 page
New Superembeddings for Type II Superstrings
Possible ways of generalization of the superembedding approach for the
supersurfaces with the number of Grassmann directions being less than the half
of that for the target superspace are considered on example of Type II
superstrings. Focus is on n=(1,1) superworldsheet embedded into D=10 Type II
superspace that is of the interest for establishing a relation with the NSR
string.Comment: 26 pages, LaTeX, JHEP.cls and JHEP.bst style files are used; v2:
misprints corrected, comments, acknowledgments, references adde
Tensionless String in the Notoph Background
We study the interaction between a tensionless (null) string and an
antisymmetric background field B_{ab} using a 2-component spinor formalism. A
geometric condition for the absence of such an interaction is formulated. We
show that only one gauge-invariant degree of freedom of the field B_{ab} does
not satisfy this condition. Identification of this degree of freedom with the
notoph field \phi of Ogievetskii-Polubarinov-Kalb-Ramond is suggested.
Application of a two-component spinor formalism allows us a reduction of the
complete system of non-linear partial differential equations and constraints
governing the interacting null string dynamics to a system of linear
differential equations for the basis spinors of the spin-frame. We find that
total effect of the interaction is contained in a single derivation coefficient
which is identified with the notoph field.Comment: 15 pages, no figures, RevTeX 3.
- …