Vol 51, No 4 (2017)
- Year: 2017
- Articles: 9
- URL: https://journals.rcsi.science/0146-4116/issue/view/10710
Article
Parallel method of production rules extraction based on computational intelligence
Abstract
The problem of production rules extraction has been solved based on parallel computing and computational intelligence. The research object is the process of production rules extraction. The purpose of the work is the creation of the production rules extraction method, based on a parallel principle of the construction of the intelligent models, which bring together given data samples in the form of the models based on the decision trees, association rules and negative selection. The developed method allow to significantly reduce the time required for the models synthesis when solving the complex practical problems, characterized by a large amount of the diagnostic data; and the problems, where there is a need to modify the existing diagnostic and recognition models due to the appearance of new information, which is the result of the permanent observation after the state of the research objects and processes. At the same time, the capability of the synthesis of the models that have the high approximating and generalizing abilities is provided.
Efficient determination of a finite set of states for an up-and-down process possessing a practical closure
Abstract
Conditions at which the up-and-down process with a step greater than 0.5 of the standard deviation of masking noise becomes practically closed on a finite set are investigated, e.g., the sufficient number of states of up-and-down process is determined so that the probability of obtaining other states is practically equal to zero. For this purpose, several lemmas on growth of the cumulative distribution function of standard normal distribution are proved. Formulas for a recursive calculation of the probability of obtaining the state of up-and-down process are obtained. Using them, an upper bound for obtaining other up-and-down process states is given.
Control on the transmission of computer viruses in network
Abstract
This study made an inductive discussion on the definition and characteristics of computer viruses and analyzed virus transmission models as well as virus control. Like tumor cells in human body, computer viruses will rapidly transfer and disperse if they are not controlled, indicating a poor stability. To investigate the transmission control of computer viruses, a dynamical model was established for virus transmission and the concept of “equivalent day” was introduced to analyze the dynamic characteristics of discrete transfer of the model and the stability of virus-free equilibrium points and endemic equilibrium points. The characteristic value was obtained by calculating the equation of the model. Moreover, the necessary and sufficient conditions for virus-free and endemic equilibrium points of the model were obtained by proof using Lyapunov first method and disc theorem. Then the model was compared with SIS and SIR models. Finally, a control item was added based on the virus discrete transmission model and the transformation trends of the number of the infected principle machine and the infective principal machine before and after the addition of the control item were compared. In this way, the optimal control strategy for virus transmission model was designed and the effectiveness of the optimal control was verified.
Robust CHARM: an efficient data hosting scheme for cloud data storage system
Abstract
Cloud computing is the recent evolving arena, which offers more benefits to cloud service providers and online users, compared to the traditional architecture. In this paper, an efficient data-hosting scheme with high availability for implementing over heterogeneous multi-cloud system is proposed. The proposed ROBUST CHARM (RCH) scheme is designed with data hosting, storage mode switching, speed mode and workload indicator modules. These modules process data with the support of heuristic and storage mode transition algorithm. The algorithm is proved efficient in identifying the apt cloud to store data. Storage transition is adopted by considering the cost and data access pattern of the data stored during any requirements. This evaluation enables efficient usage of cloud resources with high availability. The experimental results show that the proposed scheme works effectively without affecting the performance compared to the existing systems. The ability to utilize heterogeneous multi-cloud storage with the benefit of cost effectiveness is an added advantage to the cloud users.
Inspecting mixed textured lens collar images using discrete Fourier transformation
Abstract
Superficial and electroplating defects are the most commonly seen flaws on the lens collar. The former arose from cutter offset or chip winding during the cutting process, while the later occurred if the surface was stained with rough or foreign material during the electroplating process. Relying on human inspection to ensure quality of a lens collar was time consuming and accounted for occupational injury. Thus, implementation of automatic inspection technology became invertible in the mass production environment. Since the texture on the surface of lens collar was not only regular but also statistical, the system used image restoration based on discrete Fourier transformation (DFT) to detect defects embedding on those two types of textures.
HEVC intra coding using vote-based optimization algorithm
Abstract
We present a voted optimization algorithm utilizing correlation of adjacent frames’ texture feature and thoughts of voted selection for newly proposed video standard High Efficiency Video Coding (HEVC). In addition, a voted algorithm based on original candidate mode collection is developed, which use the candidate modes, to resolve HEVC Most Probable Mode (MPM) mechanism for intra prediction problem. Meanwhile, we perform the vote rules to cut down on candidate collection, which is based on our proposed voted method. Experimental results show that proposed voted algorithm improves the efficiency of encoder by decreasing encoding time with more than 20% and causes nearly negligible increment in bit-rate.
A novel method of medical image enhancement based on wavelet decomposition
Abstract
The efficiency of image enhancement algorithms depends on the quality and processing speed of image enhancement. There are many algorithms to implement image enhancement using wavelet theory. These algorithms have one thing in common: they all capture image details by decomposing low frequency sub-images. In fact, a lot of details in high-frequency sub-images are also found. Enlightened by the above-mentioned facts, a novel medical image enhancement method based on wavelet decomposition is proposed by adding details from the high-frequency sub-images and decomposing the image specially with ant-symmetric biorthogonal wavelet instead of some traditional wavelets. It not only improves the image enhancement, but also overcomes the shortcomings of large computation with faster computational speed and satisfies the real-time requirement in edge detection. Simulation experiments of mammographic images are implemented by Matlab with several different methods, the results show that the proposed method is superior to some popular methods, such as histogram equalization and wavelet nonlinear enhancement.
Parametric identification for perturbed paths of navigation satellites based on inter-satellite measurements
Abstract
A solution for the problem of stochastic identification of the parameters of perturbed orthodromic orbits of navigation satellites is given. The identification is proposed directly on the board of a satellite based on inter-satellite radio and laser measurements. It is shown that the solution accuracy of the navigation task is increased in comparison with telemetric measurements. The approach is shown to be invariant for other aerospace moving objects because of its invariant parameters. Also, an explaining example is given for comprehensive description of the proposed approach.
Impulse response approximation of digital finite impulse response filter with delay line units
Abstract
This article proposes special digital filtering structures formed by one multiplier, one adder and a delay line. Such structures can be used to synthesize finite impulse response Hilbert filter. The advantage of such approach is reduced number of multipliers, compared to standard implementation. The quotients of structures can be calculated by local optimization methods. This article shows an example of the 30-th order Hilbert filter calculation, which requires only 6 multipliers for implementation.