Authors:V. N. Shashihin Pages: 75 - 84 Abstract: This paper describes a technique to synthesize robust control for a large-scale system under parametric perturbations. The control law designed provides the guaranteed quality of transient processes under the worst parametric perturbation admissible. The problem is solved based on the required minimax conditions. A modified performance criterion is employed that allows the computational cost of decentralized control synthesis to be reduced significantly. PubDate: 2017-03-01 DOI: 10.3103/s0146411617020079 Issue No:Vol. 51, No. 2 (2017)

Authors:Gang Xiong; Jiming Lan; Haiyan Zhang; Tian-Huai Ding Pages: 85 - 96 Abstract: Attribute distance weighted average (ADWA) is a new filtering paradigm, which can progressively alleviate the denoising contradiction between the noise removal and feature preservation by introducing new attributes. As the key control parameters in ADWA, the attribute normalization factors play an important role in the final filtering result. An in-depth study is necessary to exam the effect the attribute normalization factors have on the filtering performance and the rules they follow, which can then serve as a guide for the determination and optimization of attribute normalization factors. For this purpose, the three attributes of a signal, “Location,” “Value,” and “Gradient,” are studied as an example in this paper. Experimental results indicate that the normalization factors directly determine the strength of the effect the corresponding attributes have on the filtering result. If the normalization factor increases, ADWA’s ability in noise removal becomes stronger and meanwhile its ability in feature preservation becomes weaker. Therefore, the denoising contradiction still exists for ADWA of a specific attribute rank. However, since different attributes contribute to the filtering performance independently in different regions of a signal, the denoising contradiction can be further alleviated by introducing new attributes, and thus a more satisfactory outcome can be obtained. PubDate: 2017-03-01 DOI: 10.3103/s0146411617020031 Issue No:Vol. 51, No. 2 (2017)

Authors:Hong Li; Long Yu; Shengwei Tian; Li Li; Mei Wang; Xueyuan Lu Pages: 97 - 107 Abstract: The aqueous solubility of a drug is a significant factor for its bioavailability. Since many drugs on the market are the oral drugs, their absorption and metabolism in organisms are closely related to its aqueous solubility. As one of the most important properties of drug, the molecule aqueous solubility has received increasing attentions in drug discovery field. The methods of shallow machine learning have been applied to the field of pharmacy, with some success. In this paper, we established a multilayer deep belief network based on semi-supervised learning model to predict the aqueous solubility of compounds. This method can be used for recognizing whether compounds are soluble or not. Firstly, we discussed the influence of feature dimension to predict accuracy. Secondly, we analyzed the parameters of model in predicting aqueous solubility of drugs and contrasted the shallow machine learning with the similar deep architecture. The results showed that the model we proposed can predict aqueous solubility accurately, the accuracy of DBN reached 85.9%. The stable performance on the evaluation metrics confirms the practicability of our model. Moreover, the DBN model could be applied to reduce the cost and time of drug discovery by predicting aqueous solubility of drugs. PubDate: 2017-03-01 DOI: 10.3103/s0146411617020043 Issue No:Vol. 51, No. 2 (2017)

Authors:C. Deepa Pages: 108 - 113 Abstract: In the recent days, web mining is the one of the most widely used research area for finding the patterns from the web page. Similarly, web content mining is defined as the process of extracting some useful information from the web pages. For this mining, a Block Acquiring Page Segmentation (BAPS) technique is proposed in the existing work, which removes the irrelevant information by retrieving the contents. Also, the Tag-Annotation-Demand (TAD) re-ranking methodology is employed to generate the personalized images. The major disadvantage of these techniques is that it fails to retrieve both the images and web page contents. In order to overcome this issue, this paper focused to integrate the TAD and BAPS techniques for the image and web page content retrieval. There are two important steps are involved in this paper, which includes, server database upload and content extraction from the database. Furthermore, the databases are applied on the Semantic Annotation Based Clustering (SABC) for image and Semantic Based Clustering (SBC) for webpage content. The main intention of the proposed work is to accurately retrieve both the images and web pages. In experiments, the performance of the proposed SABC technique is evaluated and analyzed in terms of computation time, precision and recall. PubDate: 2017-03-01 DOI: 10.3103/s014641161702002x Issue No:Vol. 51, No. 2 (2017)

Authors:Laurens Lemaire; Jan Vossaert; Joachim Jansen; Vincent Naessens Pages: 114 - 123 Abstract: Industrial Control Systems (ICS) are used for monitoring and controlling critical infrastructures such as power stations, waste water treatment facilities, traffic lights, and many more. Lately, these systems have become a popular target for cyber-attacks. Security is often an afterthought, leaving them vulnerable to all sorts of attacks. This article presents a formal approach for analysing the security of Industrial Control Systems, both during their design phase and while operational. A knowledge- based system is used to analyse a model of the control system and extract system vulnerabilities. The approach has been validated on an ICS in the design phase. PubDate: 2017-03-01 DOI: 10.3103/s0146411617020055 Issue No:Vol. 51, No. 2 (2017)

Authors:Alireza Rezaee Pages: 124 - 132 Abstract: In this paper, a fuzzy algorithm was used for determining the coefficients of a PID controller using an online method. The plant used in this system is a welder robot, which is used for welding oil and gas pipelines. This robot rest on the pipe and weld it by moving around. The speed is adjusted using a motor moving the robot around the pipe. A digital controller also used for implementation. In this research, in order to choose the rules the skills transmit method and that how the PID response is required has been used. In this paper, the type of algorithms that continuously assigns PID coefficients using an online method depending on the characteristics of the system which is based on fuzzy logic was used. First, the rules associated to each output in relation to inputs are depicted in it. Using the mentioned method, simulation results and then implementation results were obtained and discussed. PubDate: 2017-03-01 DOI: 10.3103/s0146411617020067 Issue No:Vol. 51, No. 2 (2017)

Authors:Zhihong Zhang; Limiao Li; Huafu Liu Pages: 133 - 140 Abstract: Traditional elasticity imaging systems use short pulses with low sound power, causing the signal to be attenuated severely in deep zones. On the basis of the coded excitation and spatial composition theorems, an ultrasonic elastography optimization algorithm is proposed in this paper. It takes advantage of coded excitation and spatial compounding such as high peak power and average sound power, suppresses speckle noise, and improves the imaging quality effectively. Specifically, a coded excitation system encodes the long pulses when transmitting, and then decodes the long pulses into short pulses upon receiving. This increases the average sound power of the beam without sacrificing the spatial resolution. A imaging system based on coded excitation can therefore achieve a good signal-to-noise ratio (SNR e ) and contrast-to-noise ratio (CNR e ) in deep zones below the detection surface. The proposed algorithm combines coded excitation with a filter-group based spatial compounding algorithm at the receiving terminal. Finally, experimental results show that the proposed algorithm yields a higher SNR e and CNR e than using chirp coded excitation or spatial compounding alone. PubDate: 2017-03-01 DOI: 10.3103/s0146411617020080 Issue No:Vol. 51, No. 2 (2017)

Authors:Arefe Esalat Nejad; Morteza Romoozi Pages: 1 - 12 Abstract: Vehicular Networks is considered a major step in the field of Intelligent Transportation System (ITS). In this technology, some equipment will be installed on vehicles and special places at roadsides which will enable the wireless communication between vehicles with each other and will provide the communication between the vehicles and roadside equipment. One of the ITS application is Traffic monitoring system. Such system enables accessing traffic videos by traffic monitoring centers to make traffic decision. However, providing traffic video for the vehicles can be appealing. This paper addresses a new application in vehicular networks and ITS which can provide this videos for drivers in a city. Each driver request timely traffic video of a location from a web server and the web server forward this request to a stream management server. This server based on current location of the requester vehicle, its speed and its direction calculates appropriate video chunks for each RSU along vehicle destination. This study aims to present a system which can bring a high accessibility for content and can provide it with an appropriate bandwidth and quality for vehicles. Due to the scalability and bandwidth limitations for its content and streaming, vehicular networks are used in this system. PubDate: 2017-01-01 DOI: 10.3103/s0146411617010059 Issue No:Vol. 51, No. 1 (2017)

Authors:Mehdi Merouane Pages: 13 - 23 Abstract: Nowadays, Denial of Service (DoS) attacks have become a major security threat to networks and the Internet. Therefore, even a naive hacker can launch a large-scale DoS attack to the victim from providing Internet services. This article deals with the evaluation of the Snort IDS in terms of packet processing performance and detection. This work describes the aspect involved in building campus network security system and then evaluates the campus network security risks and threats, mainly analyses the attacks DoS and DDoS, and puts forward new approach for Snort campus network security solutions. The objective is to analyze the functional advantages of the solution, deployment and configuration of the open source based on Snort intrusion detection system. The evaluation metrics are defined using Snort namely comparison between basic rules with new ones, available bandwidth, CPU loading and memory usage. PubDate: 2017-01-01 DOI: 10.3103/s0146411616060043 Issue No:Vol. 51, No. 1 (2017)

Authors:Yan He; Na Zhang Pages: 24 - 31 Abstract: With the rapid advances in digital signal processing technology, spatial spectrum estimation theory and technology has been widely used in various fields and has become a new favorite in radio direction finding and passive positioning fields. This paper constructs a new shortwave spatial spectrum direction finding and positioning system, which establishes a standard interoperable platform based on software communication architecture (SCA). Meanwhile, a new shortwave co-location method is put forward, which realizes the flexible networking of the new shortwave spatial spectral direction finding system through the optical fiber or Ethernet. Besides, cyclic direction of arrival (DOA) estimation and weighted average method are applied to improve the positioning accuracy under complex environments. Simulation results show that this method has good positioning performance and stability. PubDate: 2017-01-01 DOI: 10.3103/s0146411617010035 Issue No:Vol. 51, No. 1 (2017)

Authors:Fengxian Shen; Xu Jian; Xianjie Xi Pages: 32 - 41 Abstract: Graphic vertex-coloring has long been a classical problem for combinatorial optimization in the field of science and technology. No algorithm can give an optimal solution for graphic vertex-coloring in polynomial time so far, though it plays an important role in the field of mathematical science and technology. Hence the problem has always been a non-deterministic polynomial (NP) complete problem. The current computer parallel technology based on compute unified device architecture (CUDA) is a hot spot in the relevant field. This study put forward a method integrating parallel genetic algorithm and CUDA to solve the problem of graphic vertex-coloring. First, color sequences were coded and parallel genetic operators were designed, which was beneficial to the improvement of algorithm efficacy. Then parallelization reformation was performed on the above integrated algorithm using CUDA. Experimental results demonstrated that, the newly developed algorithm improved the calculation efficiency and reduced the computation time compared to traditional algorithms based on central processing unit (CPU). Thus plenty of cases can be effectively solved if the minimum coloring number of a known graphics is found. PubDate: 2017-01-01 DOI: 10.3103/s0146411617010060 Issue No:Vol. 51, No. 1 (2017)

Authors:Cheng Zeng; Yingying Su; Shan Liang Pages: 42 - 49 Abstract: It is well known that the presence of unstable zeros limits the control performance, which can be achieved, and some control schemes cannot be directly applied. This manuscript investigates a sufficient condition for stabilization of zeros in the discrete-time multirate sampled systems. It is shown that the discretization zeros, especially sampling zeros, can be arbitrarily placed inside the unit circle in the case of relative degree being greater than or equal to three and multirate input and hold, such as generalized sampled-data hold function (GSHF), for the linear continuous-time systems when the sampling period T tends to zero. Moreover, the authors further consider the multivariable case, which has a similar asymptotic behavior. Finally, the simulation proves the validity of the method, and we also propose a hold design that places the sampling zeros asymptotically to the origin for fast sampling rates. PubDate: 2017-01-01 DOI: 10.3103/s0146411617010084 Issue No:Vol. 51, No. 1 (2017)

Authors:K. Sudars Pages: 50 - 54 Abstract: Object classification is a common problem in artificial intelligence and now it is usually approached by deep learning. In the paper the artificial neural network (ANN) architecture is considered. According to described ANN architecture, the ANN models are trained and tested on a relatively small Color-FERET facial image database under different conditions. The best fine-tuned ANN model provides 94% face recognition accuracy on Color-FERET frontal images and 98% face recognition accuracy within 3 attempts. However, for improving recognition system accuracy large data sets are still necessary preferably consisting of millions of images. PubDate: 2017-01-01 DOI: 10.3103/s0146411617010072 Issue No:Vol. 51, No. 1 (2017)

Authors:Ye. V. Bodyanskiy; A. O. Deineko; Ya. V. Kutsenko Pages: 55 - 62 Abstract: The clustering system based on the evolving general regression neural network and self-organizing map of T.Kohonen, is proposed in the paper. The tuning of system is based on “lazy” learning and self-learning using the principle “Winner takes more” at the same time as neighborhood function the output signal of the hybrid network is used. The system’ implementation is characterized by numerical simplicity. The evolving neural network processes data in an online mode and doesn’t suffer from the curse of dimensionality. PubDate: 2017-01-01 DOI: 10.3103/s0146411617010023 Issue No:Vol. 51, No. 1 (2017)

Authors:V. P. Koryachko; D. A. Perepelkin; V. S. Byshov Pages: 63 - 73 Abstract: In modern computer networks, loading and bandwidth of communication links are optimized for providing high-quality service of network traffic, new services and technologies. As a rule, for this task the protocols of dynamic routing based on Dijkstra’s algorithm are used. Protocols of multipath routing for ensuring reliability and accuracy of the provided information allow to divide critical traffic and to execute load balancing along several routes at the same time. The purpose of the work is development and research of the improved multipath adaptive routing model in computer networks with load balancing. In this work, we focused on indicator of jitter optimization between the paved paths and a deviation value of reserve routes from an optimal route. Comparison and estimation of the offered algorithm with some existing approaches, and also modeling and analysis on various topologies of computer networks have been carried out. PubDate: 2017-01-01 DOI: 10.3103/s0146411617010047 Issue No:Vol. 51, No. 1 (2017)

Authors:M. A. Poltavtseva; D. S. Lavrova; A. I. Pechenkin Pages: 703 - 711 Abstract: An approach to preliminary processing of data from the Internet of Things is suggested. The suggested procedure is based on data aggregation and normalization and makes it possible to reduce the data dimension for further analysis and increase the rate of aggregation and normalization. To that end it is proposed to carry out data processing on a multiprocessor cluster. The article provides a detailed description of the approach to dividing the given task into connected subtasks and indicates which of them can be fulfilled in parallel. Algorithms of task distribution among the multiprocessor cluster nodes and task planning on a multiprocessor cluster node are developed. PubDate: 2016-12-01 DOI: 10.3103/s0146411616080162 Issue No:Vol. 50, No. 8 (2016)

Authors:A. P. Baranov; P. A. Baranov Pages: 759 - 764 Abstract: We study the value distributions for the control cyclic redundancy check (CRC) of length k, drawn at the data section of volume n. The behavior of CRC value distribution is examined at large n and fixed values of k (k = const, n → ∞). With the application of the character theory, we find the conditions of asymptomatic uniformity of the CRC distribution. The asymptomatic results can be applied during the assessment of errors of a series of protocols such as USB, X.25, HDLC, Bluetooth, Ethernet, etc. PubDate: 2016-12-01 DOI: 10.3103/s0146411616080046 Issue No:Vol. 50, No. 8 (2016)

Authors:S. V. Belim; S. Yu. Belim Pages: 773 - 776 Abstract: A modification of the KDP scheme for the distribution of encryption keys is considered as applied to a distributed computer system with a discretionary security model. Limited access is specified as forbidden channels of data transmission. The scheme of preliminary key distribution is designed in such a way that it is impossible for forbidden channels to create a key-pair for the data exchange. An example of the construction of the proposed scheme is presented. PubDate: 2016-12-01 DOI: 10.3103/s014641161608006x Issue No:Vol. 50, No. 8 (2016)

Authors:L. S. Kazarin; S. S. Poiseeva Pages: 497 - 509 Abstract: Let G be a finite nontrivial group with an irreducible complex character χ of degree d = χ(1). According to the orthogonality relation, the sum of the squared degrees of irreducible characters of G is the order of G. N. Snyder proved that, if G = d(d + e), then the order of the group G is bounded in terms of e for e > 1. Y. Berkovich demonstrated that, in the case e = 1, the group G is Frobenius with the complement of order d. This paper studies a finite nontrivial group G with an irreducible complex character Θ such that G ≤ 2Θ(1)2 and Θ(1) = pq where p and q are different primes. In this case, we have shown that G is a solvable group with an Abelian normal subgroup K of index pq. Using the classification of finite simple groups, we have established that the simple non-Abelian group, the order of which is divisible by the prime p and not greater than 2p 4 is isomorphic to one of the following groups: L 2(q), L 3(q), U 3(q), S z(8), A 7, M 11, and J 1. PubDate: 2016-12-01 DOI: 10.3103/s0146411616070117 Issue No:Vol. 50, No. 7 (2016)

Authors:A. V. Smirnov Pages: 527 - 535 Abstract: In the article the problem of finding the maximum multiple flow in the network of any natural multiplicity k is studied. There are arcs of three types: ordinary arcs, multiple arcs and multi-arcs. Each multiple and multi-arc is a union of k linked arcs, which are adjusted with each other. The network constructing rules are described. The definitions of a divisible network and some associated subjects are stated. The important property of the divisible network is that every divisible network can be partitioned into k parts, which are adjusted on the linked arcs of each multiple and multi-arc. Each part is the ordinary transportation network. The main results of the article are the following subclasses of the problem of finding the maximum multiple flow in the divisible network. 1. The divisible networks with the multi-arc constraints. Assume that only one vertex is the ending vertex for a multi-arc in s network parts. In this case the problem can be solved in a polynomial time. 2. The divisible networks with the weak multi-arc constraints. Assume that only one vertex is the ending vertex for a multi-arc in k-1 network parts (1 ≤ s < k − 1) and other parts have at least two such vertices. In that case the multiplicity of the maximum multiple flow problem can be decreased to k - s. 3. The divisible network of the parallel structure. Assume that the divisible network component, which consists of all multiple arcs, can be partitioned into subcomponents, each of them containing exactly one vertex-beginning of a multi-arc. Suppose that intersection of each pair of subcomponents is the only vertex-network source x 0. If k=2, the maximum flow problem can be solved in a polynomial time. If k ≥ 3, the problem is NP-complete. The algorithms for each polynomial subclass are suggested. Also, the multiplicity decreasing algorithm for the divisible network with weak multi-arc constraints is formulated. PubDate: 2016-12-01 DOI: 10.3103/s0146411616070191 Issue No:Vol. 50, No. 7 (2016)