articles
|
Complexity of computer information systems at present does not allow an overall verification to
ensure absence errors and vulnerabilities at the development stage. Consequently, the more complex
is the system, the more it is subjected to the information security risks. Recently there have been several
approaches to solving the security problem for complex information systems. The paper presents
a generalized algorithm for development of systems secure from research. The algorithm includes
methods for blurring system parameters and methods based on the moving target technology. Both
above methods are versatile and can be implemented for typical solutions as well as for unique algorithms
applicable to hardware-software solutions. The algorithm includes detection of critical components
which when compromised may be a security threat. The search for sources of randomness
and parameters, which can be used for building a blurring process or a self-complication process for
a computer information system. A system’s protection from research prevents attackers from gathering
information sufficient for exploiting vulnerabilities, while the system’s vulnerabilities are not eliminated.
A method for quantitative evaluation of changes in the security level of information systems is
presented. The method is based on changing the set of potential attacks after implementation of the
methods for protection against research. Analysis of the results achieved by implementation of the
DKAuth password authentication technology and the BSRouter network security software and hardware
complex showed the decreased potential for successful attacks by 25% and 12.26% accordingly.
Continue...
|
|
|
The problem of the exhaustion of mineral resources is one of the most important global environmental
and economic problems of mankind. The problem progresses, which is not surprising, since
the availability of natural resources limited, but the demand for them is growing.
In this paper presented a simulation model of the salt reserves exhaustion, which depending on the
number of input data can be used to simulate the salt extraction process with displaying the dynamics
of the exhaustion of these reserves in tabular and graphical data by years, and also to see how will
be changed along with this parameter wells productivity, the number of wells put into operation, the
number of conserved wells and many other important parameters.
To develop the model was used available materials about the salt deposits in Ishimbai area. Presented
such input data as salt reserves, the number of commissioned wells, the average productivity of the
well, the planned annual percentage commissioning, the planned annual percentage of conservation.
The model is created in the well-known simulation modeling software program iThink with iconic
cognitive maps. It includes three basic sub-models «Salt reserves», «Wells» and «Productivity», that
mainly determine the overall structure and state of the model. Presented the analysis of the resulting
model by software iThink that allows to judge the sustainability, adequacy and efficiency of the model.
The studies are very important for business planning, especially at this time when more and more
difficulties arise with the extraction of some minerals due to their significant exhaustion.
Continue...
|
|
|
The orthogonal packing problem is a problem related with the founding of the optimal placement
of a given set of small orthogonal items (objects) into a set of large orthogonal items (containers).
This problem is a well-known NP-completed problem that has many applications in industry and economics.
To solve the packing problems usually are applied various approximation algorithms that are
based on the heuristic methods of optimization. To provide the effectively work of an optimization algorithm
is necessary to minimize any delays related with construction of a placement according to solution
obtained by the algorithm. For this purpose were investigated the causes affecting the speed and
quality of placement generation by the given solution in a form of a sequence of objects to be placed
into containers. The paper is presented an effective model of orthogonal objects management which
provides the possibility of constructing orthogonal packings of arbitrary dimension in solving of all
optimization problems of orthogonal packing and rectangular cutting. This model is the fasted compared
with other known models for objects management. In paper are given algorithms of placement
and deleting objects. The deleting objects algorithm may be used in future in realization of the algorithm
for the local improvements of the obtained placement. The efficiency of the proposed model is
demonstrated on the standard three-dimensional orthogonal packing test problems.
Continue...
|
|
|
The current financial and banking crisis has shown that even the largest banks in Russia that meet
all the requirements of the Bank of Russia, nevertheless, fall into crisis situations and suffer losses,
often experiencing insurmountable difficulties in settling debts and deal with creditors. One of the
most common reason is the inability to fulfill obligations is associated with a shortage of cash, so it
is important to monitor the commercial bank’s financial resources dynamics. The point is to study
the bank’s financial resources in dynamics. To solve it, an imitation model of the dynamics of financial
resources of a commercial bank is proposed, which takes into account four main cash flows: income
received under deposit agreements; Income received under loan agreements; Expenses on deposit
agreements; Costs associated with the issuance of loans. The model can be used to assess the
bank’s financial resources in a dynamic provided that it is possible to convert the time series characterizing
receipts and payments to a stationary type. This paper describes a simulation algorithm, describes
a software tool that implements the proposed algorithm, and approves the model. The proposed
model allows to assess the bank’s financial resources in a certain period of time and collect the
descriptive statistics of the distribution of financial resources. On the basis of the resulting characteristics,
we can conclude on the financial stability of the bank, assess the risk of entry into the zone
of financial unreliability (risk zone). To assess the risk of entering the unreliability zone, it is suggested
to use the risk factor for the release of financial resources below the critical level. The proposed
model allows to solve actual problems of evaluation, analysis and management of the financial
potential of a commercial bank.
Continue...
|
|
|
The paper describes principles of information risk management in conditional access systems
(CAS). The purpose of models is to justify the economical choice of options for an information
system to counter attacks, which in turn is a set of measures to counter attacks.
Proposed three models of constrained optimization and one of unconstrained optimization
system of protection against information attacks, which are a model of linear programming
with binary variables.
Continue...
|
|
|
Optimal asset management algorithm within 20 – 30 years period is proposed for enterprises that
have large tangible and intangible assets’ fleet including buildings, constructions, facilities, land
parcels, constructional projects, equipment units, software systems, data bases, etc. As an optimization
criterion a maximum total discounted profit for the period is selected. The development strategy
which will be selected must satisfy various constraints, reflecting the requirements of customers,
the environment, the regulators, the company’s owners and management. These constraints may
be financial, technical, market, environmental and other. The entire set of possible projects for the
acquisition, construction and commissioning of new assets, renovation and decommissioning of the
existing assets, as well as projects for the repair of assets and compliance with restrictions, actions
and maintenance works is divided into a collection of specially formed portfolios. Inside, all the elements
of the portfolios are ranked. Budgets of formed portfolios serve as control variables. The algorithm
involves the generation of variants of long-term development of the enterprise and iterate
over them in order to find a maximum of the total discounted profit for the whole period. Variants
determine terms of projects’ completion for the acquisition and construction of new assets and reconstruction
of existing ones. Then they are supplemented by the information about projects and
activities of maintenance and repair as well as constraint satisfaction. Each variant is divided into
yearly intervals, for which optimal internal supply chain plans are calculated. Feasibility assessment
of calculated plans is produced using simulation models, special models, models and methods
of predictive analytic. The architecture of the software system that implements the developed
algorithm is proposed.
Continue...
|
