Search

Description the EEG (Electroencephalogram) signal of the consumer was calculated in this paper and the EEG signal rule was classified using the SVM (Support Vector Machine) algorithm and the signal accuracy was measured. An experiment was performed by separating males and females in order to determine the user's EEG signal, and a single channel EEG unit was used to measure the EEG signal. The effect of the user's EEG signal measurement using the EEG system was analyzed using R. Furthermore, the prediction accuracy of the recognition rate was 90.2 percent as a result of predicting the EEG measurement experiment data at a ratio of 75:25 (training data: test data) by applying a combination of unique vectors that have the best SVM classification output. Approximately 90.2% of the EEG signal of the user can be identified in this document, and the fact that it can only be done with a simple linear classification of the SVM algorithm indicates that it can be used in different ways for biometric authentication using EEG signals. [ABSTRACT FROM AUTHOR]

The growing reality today is the application of Internet of Things (IoT) in day-to-day. Though there are lot of complexities around this environment such as security, energy consumption and heterogeneity, this giant network of connecting devices with internet is sky rocketing. The mounting increase in the sharing of information made this connected network of devices is mandatory in everyday life. This powerful IoT platform suffers a lot by the security breaches as more people uses it. Authentication of IoT users using One Time Password (OTP) is one kind of resolution to solve many security issues. The OTP has added an additional coating to the traditional username-password authentication system. So, this research proposes a hybrid One-time Password generation algorithm, AroSheb_Jo, for IoT data and presents a security analysis of that algorithm. Additionally, this paper presents a comparison of its lightweight characteristics and resistance against security attacks. Experimental and performance analysis of that algorithm is also elaborated in this paper. [ABSTRACT FROM AUTHOR]

Multi-core processing can decrease the cost of many Machine Learning (ML) tasks by executing them in parallel using multiple cores of a processor. Modern computers are equipped with processors that contain multiple cores that can be leveraged to decrease the execution time of many ML tasks by multiple folds. Especially ensemble of ML algorithms like Random Forest (RF) can take advantage of the multi-core processing ability for improving their performance. In this paper five models using RF algorithm using Gaussian_Quantiles (GQ), Load_Wine (LW), Load_Iris (LI), Load_Breast_Cancer (BC) and Load_Digits (LD) datasets are developed and evaluated using k-fold cross-validation respectively. In general, the execution time of RF algorithm decreases as the number of cores increases. [ABSTRACT FROM AUTHOR]

In this digital era, the amount of sensitive data getting transferred every day is very high, the digitization of all data brought a lot of advantages along with serious security threats. The security standards exist in present scenario provides three basic services such as Confidentiality, Integrity, and Authentication (CIA), the two common types of symmetric and asymmetric algorithms are being used at different levels and capacities. The emerging of new technologies and high computing facilities makes the existing standards vulnerable to different attacks and security threats. There is a need of developing a new set of cryptographic algorithms those are quantum-safe, which means, the arrival of quantum computers can break any sized keywithin a polynomial solvable time, the quantum computers can do prime factorization in realistic time complexities. There are new and smart cryptanalysis emerging to break the existing standards such as Advanced Encryption Standard (AES) and RSA, these algorithms are ruling the cyber world for more than two decades. In this research paper, a new concept of using polynomials to encrypt and decrypt data is proposed, however, the power of polynomials are not fully explored in cryptography, we use Newton Raphson method and its advancements to implement a new cryptography algorithm that is more accurate and faster than existing standards. The proposed algorithm doesn't use any fixed size to avoid cryptanalysis and attacks based on key sizes, the highly intensive computing can break any length of key in realistic time delays, so variable sized key solves this problem in our approach. [ABSTRACT FROM AUTHOR]

Cloud computing is an evolving concept which has now come out with a radical shift in storage and hosting services. The huge requirement for cloud computing services desired various technologies and different approaches for the effective and timely delivery of consistent quality to the users. With the increasing growth in the network and arising with the latest technologies including cloud and big data, to control and manage the traditional networks is quite tedious. Therefore, it's mandatory to transform conventional network architecture. To resolve this issue, Software Defined Networking (SDN) came into existence which makes the management of the network more conformable. To satisfy the fulfilments of Quality of Service (QoS) and with the limited network availability, one of the keynotes that have been taken into consideration is the load balancing issue. It is quite a tedious job to handle the massive amount of load for a single server. This paper proposed the minimal loaded load balancing approach and compare it with the different load balancing techniques based on the response time. [ABSTRACT FROM AUTHOR]

In today's world Cloud computing is perhaps the most utilized technology. Distributed computing offers web administrations, information stockpiling and computing assets over the web effortlessly. Cloud computing permits clients to get to the IT assets anyplace and whenever on a compensation for every utilization premise. As the interest for distributed computing develops quickly, the traffic additionally increases. There are two answers for this issue, one is to upgrade a single server to a high-performance server but upgraded server may also overload soon and second is multi server (gathering of workers). Multi server arrangement is adaptable and practical. While making a group of servers, the issue is Load adjusting. Load balancing is one of the critical issues in cloud computing. Load balancing is an interaction of parting the unique responsibility and dispersing the responsibility among every one of the hubs with the end goal that no hub in the cloud climate is overloaded/under loaded or inactive. Load balancing in Cloud computing is utilized to improve the proficiency and utilizing resources effectively. This journal paper objective is on investigation on cloud load balancing, Load balancing methods, Load balancing algorithms. [ABSTRACT FROM AUTHOR]

The new results presented in this paper are based on the long-term research conducted recently over several years. Creation and development of multi-disciplinary knowledge resources and implementation of practical computational and numerical algorithms and solutions require flexible and long-term approaches to structures. The goal of this research is to create a flexible fundament of structures for arbitrary long-term knowledge and references, which allow an efficient deployment for knowledge creation, development, and mining. The knowledge-centric structural solution is consequently based on complements of knowledge and a coherent system of conceptual knowledge integrated in the fundamental methodology of superordinate knowledge. The results allow to sustainably master structures and algorithms for long-term computational and numerical scenarios. The solution is targeting knowledge resources and scenarios and has been developed and used for many practical implementations over a time span of more than three decades. The paper presents an overview of new, previously unpublished results on architecture complements, object development architecture, resulting knowledge resources' structures, and the new archaeological Rhodos case results. [ABSTRACT FROM AUTHOR]

Graph Isomorphism is the illustration of same graph in more than one pattern. In order to check that the graphs are isomorphic it should follow some properties. Graphs have many real life applications. Here we are considering Intuitionistic Fuzzy Graphs. As it is extended from crisp graph, Intuitionistic fuzzy graphs have all the properties of crisp graphs. Intuitionistic Fuzzy graph theory is tracking down an expanding number of uses in demonstrating genuine frameworks and circumstances where the level of data is uncertain. In the field of networks, one has to take into account whether two networks are similar or not. In this context studying isomorphism of Intuitionistic Fuzzy graphs become important. In this paper we propose algorithms to check weak isomorphism and co-weak isomorphism between Intuitionistic Fuzzy Graphs. We have applied this algorithms to detect Intuitionistic Fuzzy Graph isomorphism with the suitable examples. [ABSTRACT FROM AUTHOR]

This paper is based on the OVATION control system for cascade superheated temperature model of the control system design, intended to imitate the actual production of thermal power plant superheated temperature control system, so that we can preliminary understand the design of the OVATION system and the control method of large delay controlled system. Because the control of superheated temperature model has the characteristics of unidirectional heating, large inertia, large delay and time-varying, it is particularly important to establish accurate model and determine the relevant PID control parameters by mathematical method for this course design. Furthermore, OVATION system, as a more advanced control system in the world today, has many advantages (this paper will introduce), this system is also used by most of the domestic power plants, for our future development also has certain advantages, learning and application of this system is particularly important, this paper will I/O measurement points. Establishment, the establishment of logical configuration (SAMA diagram), the establishment of screen configuration and other necessary operations are described in detail. Finally, several algorithms (cascade control, ordinary Smith prediction and improved Smith prediction) are compared. At the same time, the shortcomings and improvement direction of this algorithm are also proposed. [ABSTRACT FROM AUTHOR]

The paper deals with the one-time pad symmetric secure algorithm, called OSA. The method involves a double-memory technique in order to improve the security aspects. In particular, the paper proposes a key-stream generator for the OSA algorithm. Furthermore, security analysis and the results of the experimental verification of OSA are presented. The conducted investigations were focused on a security analysis of the proposed key-stream generator. [ABSTRACT FROM AUTHOR]

Fatigue life assessment for random loading can be divided into two groups, defined in time or frequency domain. In this paper we are within the range of calculations in the frequency domain. The paper deals with the problem of fatigue life assessment of materials subjected to wind loading spectrum. The paper analyses three types of standardized spectrums that is: Wisper, Wisperx and New Wisper. The spectrums have been processed to the use for fatigue life assessment algorithms. All the analyzed spectrums have a non zero mean stress characteristic and have a non Gaussian distribution. The proposed solution to the correction of these signals is widely explained. The paper deals with simulation based on fatigue material constants obtained from the literature. The results of assessment are compared to results obtained with the use of rainflow cycle counting method described in the time domain. [ABSTRACT FROM AUTHOR]

Research on task assignment and scheduling problems began in the 1960's, and has become a popular research topic in the past few decades. In this paper, the theoretical graph application using bi-partitioning technique is presented to assign a number of tasks onto two processors. This paper considered a directed-weighted cyclic task graph. Combining the technique of reduction and bi-partitioning led to an efficient graph-mapping concept. The developed simulation model found that the proposed techniques and algorithms are easy to be implemented and minimized the computational time. [ABSTRACT FROM AUTHOR]

S.L. Sobolev [1] firstly posed the problem of finding an extremal function for an interpolation formula and calculating the norm of the error functional in the space W 2 m . In this paper, an extremal function of the interpolation formula was found in explicit form in the Sobolev space W 2 m , functions for which the generalized derivatives of order m are square integrable. In the present paper, we consider the problem of finding the norm of the error functional for interposional formulas of Hermite type in the space of S.L. Sobolev W ˜ 2 (m) (T1). [ABSTRACT FROM AUTHOR]

The field of Cryptography serves as a crucial aid in all the circumstances where a secured and a safer communication has to be constructed. The word 'Crypto' means 'hidden' and 'graph' means 'to write'. So far, several cryptographic algorithms have been put forth and implemented, thereby establishing more private communications in English language and in Machine language as well. Since, technology provides the facility to communicate in any desired language, these existing algorithms must be developed and practiced in many languages at a broader extent. But considering the complexity of each language, developing a cryptographic algorithm has not been carried out. Tamil happens to be one of the classical languages. We have developed a cryptographic algorithm to ensure secured communication in Tamil language. But still, manual encryption could become difficult for us to handle in all the situations. In order to overcome this kind of complication, we aim at executing this encryption and decryption algorithm with the help of a programming language. This will reduce the human energy and time consumption which will also be far easier and accurate than the manual performance. Thus, in this paper, we have developed a Python program that will encrypt the message given in Tamil language which shall be the extended version of classical Julius Caesar's method. But because of the larger alphabet structure, the disadvantages occurred while implementing this algorithm in English does not seem to hold for Tamil language. Moreover, we have implemented dual key pattern and uyir mei decomposition technique to strengthen the security. Hence, this would be highly helpful for anyone to communicate with Tamil script itself in a secured manner that too without any hassle. [ABSTRACT FROM AUTHOR]

In this paper, a new method is presented to calculate the complement of each Sum of Products. The corresponding mathematical procedure is based on the novel linking technique of orthogonalizing difference-building- and is integrated in Quaternary-Vector-List arithmetic. This algorithm has clear advantages in terms of computation time and memory usage in con-trast to the conventional method. Thus, the computation time is on average about 80 times faster and the number of terms in the determined complement function is on average about 180 times fewer. [ABSTRACT FROM AUTHOR]

The community#x2019;s views and inputs have always been the main and most beneficial source for varied range of enterprises. With more widespread community media, it provides a spectacular study and assessment of many fields in which companies used to have faith in peculiar, exhausting and inaccurate ways. This form of analysis is subclass of #x2019;sentence analysis#x2019; area. Sentiment analysis is a broad term that refers to the process of effectively classifying user-generated content into specific polarities. To perform sentiment identification and analysis, a variety of tools and techniques are available, includes supervised techniques for machine-learning that classify the target group after training in data. Hybrid instruments are a blend of machine learning and lexicon-based algorithms, which classify according to annotated dictionary. We employed the SVM with Weka for analyzing sentiments in this paper. Two pre-categorized datasets of tweets are utilized. The performance of SVM is analyzed with the help of analytical metrics. [ABSTRACT FROM AUTHOR]

This paper presents an algorithm for determining the frequency response of vibration transducers using broadband random vibration (BRV). The parameters of excitation signal are determined based on the required signal-to- noise (SNR) value in the whole working frequency range and the required RMS acceleration value. The excitation signal is represented as a linear piecewise function defined on three frequency intervals. The proposed algorithm enabled increasing the spectral power density in the low-frequency section of the working range of the electrodynamic shaker working in the BRV mode and providing the required SNR value. Compared to the verification methods using sine sweep technique at fixed frequencies of the 1/3 octave band, the proposed method can reduce the verification time by a factor of 3...4. It was also possible to reduce the error of determining frequency response caused by the use of BRV to 0.5% relative to the sine sweep procedure. [ABSTRACT FROM AUTHOR]

The paper proposes an algorithm for balancing a platform on aerodynamic suspension based on measurements of the angular velocity sensor. Results of the algorithm experimental development are presented. The developed algorithm makes it possible to improve adequacy of results of the nanosatellite angular motion control system testing. The balancing algorithm error is comparable with errors of the known algorithms that are using more expensive measurement instruments. [ABSTRACT FROM AUTHOR]

One of the most important stages of the service mission is the service satellite rendezvous with a serviced spacecraft. The task is complicated by the fact that the serviced satellite is generally non-cooperative and could be in a state of uncontrolled motion. The paper proposes a hierarchical structure of a service satellite control system and presents results in the Matlab/Simulink environment of simulating the service satellite control algorithms at the stage of rendezvous with the non-cooperative spacecraft. [ABSTRACT FROM AUTHOR]

The use of computer vision for landing operations on the mars and martian rover navigation is very important for scientific space missions. In this paper we implement an iterative visual navigation algorithm based on Gauss-Newton method for estimating position based on the image captured by only one camera. We find the pose that minimize the squared error of the predicted location of the image features to the measured location. For computing the error of pose estimation, synthetic images were generated. Considered a two-dimensional object (square) containing a set of distinct points (at least four points). The algorithm error is calculated for many relative distances between the camera and the object and three noise levels. Several images of the body are generated and taken from different elevation and azimuth angles, the position of the camera in relation to the body is estimated by applying the algorithm, then compared with the real position, to calculate the error. [ABSTRACT FROM AUTHOR]

In the paper the results of laboratory study of algorithms for angular motion determination are presented. Algo-rithms are based on extended Kalman filter using measurements of sun sensors, magnetometer and angular velocity sen-sor. The influence of vital parameters on algorithm performance is studied experimentally using laboratory facility with aerodynamic suspension. Modifications of angular motion determination algorithms are proposed and tested. [ABSTRACT FROM AUTHOR]

Proper measurement is essential to ensure a good performance of a machine to produce a high-quality product. To have a good measurement, the first thing to consider is the datum since it is used primarily for manufacturing and inspection setups. However, the common datum as defined by ASME and ISO somehow is not practical to be used for a rotating machine tool. Thus, this paper focuses to define an appropriate datum for a 3D simulated surface by including a possible source of variation or error that may exist. To achieve the objective of this paper, surface reversal measurement is used as the main approach along with aid of the correlation function in the image-processing tool. Development of the surface reversal algorithm begins as two simulated surfaces are created and undergo surface correlation to achieve the best match point between both surfaces. Then, after one of the surfaces is translated to the desired position, surface subtraction is conducted to determine the inclined plane (real datum) of the simulated surface. The algorithm ends with the validation process through surface characterization by comparing the Sz value. As a result, both surfaces show different Sz values although both have the same surface topography and result for A minus with the real datum (LSPAB) providing less error on the surface topography data compared to A-minus with AB. This evaluation proves that an appropriate datum is necessary for every measurement so that the result obtained is accurate. Moreover, the objective to improvise the datum definition is successfully achieved since the error found along with the datum has been removed. [ABSTRACT FROM AUTHOR]

Solving the problem of constructing the trajectory of a UAV in a complex urban area is a difficult task. The possibility of automated formation of the trajectory of movement, without the operator's participation, allows to reduce errors and simplify the task of monitoring in conditions of a single movement. The paper considers the methodology and algorithm for constructing the trajectory of the UAV movement in the conditions of urban development. The criterion for constructing the motion curve is the possibility of a UAV flying between objects, equidistance from their boundaries, and the possibility of constructing a closed trajectory. The article contains a block diagram of the algorithm, its description, and examples of constructing a trajectory based on simulation. The algorithm obtained in the article made it possible to perform automated construction of the UAV motion curve in a complex environment along an equidistant trajectory. The proposed approach made it possible to build the route 35% faster than the primary algorithm. The proposed computational operations are based on simple calculations and can be obtained onboard the UAV. [ABSTRACT FROM AUTHOR]

The paper reviewed the state-of-the-art MCP-I and ESSO-M systems, discussed the interconnection of the MCP-I and ESSO-M systems and included the converter interfaces with the ESSO. Algorithms for determining the location and order of wagons have been developed for the development of hardware and software. The proposed algorithm is the basis for the development of a mathematical model for calculating the time spent by a wagon on non–road routes. The developed algorithm is based on a combination of the technology of optical recognition of railway tank numbers and the technology of axle counting using inductive wheel pair sensors and can be used at any length and configuration. At the hardware level, the system is integrated with the control system for the freedom/employment of sections of the ESSO-M railway track, at the software level — with any upper–level systems. It has been established that the hardware and software system operates in real time for the purpose of producing objective data on the presence and condition of the wagon fleet at stations at any given time. [ABSTRACT FROM AUTHOR]

The paper addresses the problem of reducing the error in determining the decisive function of the coordinate of a train approaching a crossing under conditions of instability of parameters of the primary information sensor. Rail lines of the section approaching the crossing are used as a sensitive element of the primary train position sensor. The decisive coordinate determination function (system model) is obtained by the solution of the system of conditional equations, and the model is used as Kolmogorov — Gabor polynomial. The arguments (informative features) of the decisive function are complex amplitudes of voltages and currents at the inlet of the four-pole rail line of the approach section. The algorithm of correction of the decisive function in conditions of irregularity of sensor parameters is shown by the principles of self tuning and adaptation of the polynomial of the decisive function to changed parameters. The purpose of the self-adaptive function is to minimize the error of determining the coordinates of the train in the vicinity of the crossing. The feasibility of the approach is graphically illustrated by the results of the self-recussion of the decisive function by the recurrence algorithm. [ABSTRACT FROM AUTHOR]

Computer graphics is the Visual Presentation of diagram, photographs that we draw on a surface with the help of Computer. We can transform the data or information in visual form and can represent that on any display device. Numerous drawing algorithms have been used in computer graphics for rasterizing the screen. This paper deals with a new way to reduce the error in the accessible Midpoint Circle Drawing Algorithm. In this approach, we have measured two dissimilar values of h as (1 and 0.1) in the first quadrant of a circle. For h=1, every one of the outcomes of Midpoint Circle Drawing Algorithm have been confirmed and for different values of h it is seen that as the value of h diminishes, the quantity of cycle increments yet the errors between the points created and the first circle points diminishes and the other way around. Finally by doing symmetry a whole circle is been drawn. [ABSTRACT FROM AUTHOR]

It handles the pipeline issue in the oil and gas industry and expects the issue events and their answer for change the insufficiency comparatively as restoring the beginner stage of pipeline disappointment information in the model. Applications involving AI in oil and gas draw in PCs to rapidly and conclusively take a gander at enormous extents of information. Therefore to perceive the kind of wickedness that happens and change them considerably more effectively in the business issue correction requires a lot of extent of time and exertion and this will reduce the expense and time sufficiency in the oil and gas creation ventures. [ABSTRACT FROM AUTHOR]

AI-based predictive data mining algorithms play an important role in the prediction-role of the two-faceted roles of data mining (classification as the other role). Having a rigid predictive algorithm is tantamount to a successful and near-human predictive decision in knowledge discovery among databases being implemented among government, commercial and educational sectors. In this paper, three (3) of the most commonly used AI-based predictive data mining algorithms, namely: instance-based (nearest neighbor), statistical (naive Bayes), and Bayesian networks were evaluated using academic admission data in order to assess which predictive algorithm is best suited for predicting an ideal collegiate course for a student based on the student's high school grades and historical admission records. This study sought also to find out which among the four predictive algorithms can be used in terms of volume of historical data and number of data attributes. [ABSTRACT FROM AUTHOR]

Optimizing modes of the modern power system on active power is a complex problem of nonlinear mathematical programming. Despite the existence of many methods and algorithms for solving this problem, the issues of their improvement in the direction of correctly taking into account the factors that affect the regime remains an important problem. One of such factors is functional inequality constraints. The paper presents a new algorithm for optimising the modes of power system, taking into account losses in networks and functional constraints in the form of inequalities on power flows of controlled power transmission lines (PTL). A characteristic feature of the algorithm is taking into account the losses in branches by transferring them to the nodes of the electrical network. The algorithm's efficiency is investigated by the example of optimization of the mode of a complex electric power system with four thermal power plants participating in the optimization, ten PTL, in two of which the active power flows are controlled. In this case, the power flows in the controlled lines are determined by linearized formulas using the power distribution coefficients of the nodes. The economic effect on the total fuel consumption due to the use of the proposed algorithm is 0.45%. [ABSTRACT FROM AUTHOR]

Routing in Wireless-Sensor-Network is an indispensable research area where continuous improvements are needed as the junctions are resource constrained. The junctions in the WSN when optimized with routing showing, it leads to increase of lifetime of WSN besides other showing benefits. Many nature-inspired routing enhancement algorithms came into existence as found in the literature. In this paper we proposed an Enhanced Flower –Pollination-Optimization (E-FPO) that has features such as computing junction localization and find shortest path for routing more efficiently. There are mechanisms in the algorithm that results in energy efficiency. It monitors sensed data of junctions and data density to make well informed decisions. A grouping approach with filter convention is used to leverage showing. The grouping of data and filtering besides finding best possible pat makes the algorithm better than its predecessors like LEACH. A simulation study is made to have empirical observations. The results show that the proposed E-FPOA showed better showing in terms of many metrics including lifetime of WSN. In fact, E-FPOA outperforms LEACH with 35% better lifetime showing. [ABSTRACT FROM AUTHOR]

Process of propagating one-dimensional deformations in a heteromodular isotropic elastic half-space under nonstationary boundary loading is under consideration. Nonstationary boundary problems are solved with using an algorithm based on piecewise linear approximation of nonlinear boundary conditions. It is shown that this approach preserves the physical nonlinearity of model and at the same time allows us to pass to a related sequence of simpler problems with analytical solutions; all these solutions together are an approximation of a continuous solution of the original problem. Earlier the question concerned with freedom of choice of the number and position of the nodes of the approximating function was investigated for various forms of boundary conditions. The paper presents the solution of one-dimensional boundary value problem for nonstationary loading the heteromodular half-space in the "tension – compression – stop" mode. It is shown that the solution can have several non-intersecting branches due to the various positions of nodes in the piecewise linear function of boundary motion. [ABSTRACT FROM AUTHOR]

A router-based packet switching network for versatile communication between system on chip (SoC) modules on an integrated chip is known as Network on Chip (NoC). For better communication among intellectual protocols via routers, an effective routing topology along with an efficient router design and an algorithm are required. There are several existing network topologies such as Ring, Mesh, and Star, all of which have drawbacks such as increased diameter, hop- count, wiring etc. This paper suggests a novel routing topology, algorithm and compatible router architecture that provides a path for data from source to destination routers and outperforms mesh and ring topologies in terms of hop count and wiring lengths. Since diagonal paths in the network follows the form of a geometric rhombus, the proposed topology is called rhombic topology. The diagonals in this proposed topology are primarily responsible for lowering the hop count and the distance that data must travel to reach its destination. When implemented in MATLAB and SIMULINK, the results show a 33.92 percent decrease in hop count. [ABSTRACT FROM AUTHOR]

The primary objective of this paper is to verify individuals as indicated by their finger surfaces. We propose to remove Finger Texture (FT) highlights of the two finger pictures (center, ring) from a low goal contactless hand picture utilizing LBP strategy. The utilization of Inner-Knuckle-Print (IKP) in biometric recognition is the most broadly proposed validation work. The unique characteristics of the IKP give us the requirement for recognizable proof. During the IKP filtering process, the image created by the scanner might be partially unique. This paper proposes artificial neural networks for effectively coordinating procedures to IKP validation. By utilizing the Back-Propagation method, the algorithm coordinates IKP and relates them to a novel accomplished client. After grouping, the procedure restores to the best counterpart for the given finger impression variables. [ABSTRACT FROM AUTHOR]

This paper attempts to compare the two socio-inspired based metaheuristics algorithms which were introduced recently. These metaheuristics optimizations and search techniques "Election algorithm, and Election Campaign Optimization Algorithm" were inspired by socio-political processes of human ideologies. This paper gives an overview of these algorithms with respect to their control parameters, components, intensification and diversification as well as their applications. It also makes a simple comparison between the two metaheuristics algorithms in terms of quality of solution, ease of finding correct control parameters and further explored their strengths and limitations as well as their superiority over other metaheuristics algorithms. [ABSTRACT FROM AUTHOR]

This paper provides the explanation of the concepts of point tracking technique to be implemented in mitral valve locating in video frames. Object tracking has been used for many applications in motion-based recognition and monitoring. This paper discussed about the implementation of Kanade-Lucas-Tomasi (KLT) algorithm for automatic detection of the mitral valve in video frames. An experiment is carried out which covers the patient scanning who suffers from mitral valve disease. The performance of the method is validated by comparing the value of point track per frames. It is found that the point tracker systems can track the mitral valve up to 0.3s. [ABSTRACT FROM AUTHOR]

Peer to Peer (P2P) are distributed networks that distribute task and workloads between peers. Kademlia and Chord is two of the most popular Distributed Hash Table (DHT) algorithm in P2P network. In this paper we discussed how does Kademlia and Chord functions and what improvement on the two DHT have been done and how it is done. We then further discussed on which DHT outperformed the other and in which area that the two DHT differs in. [ABSTRACT FROM AUTHOR]

The aim of the paper is to summarize and review methods for modeling and estimating time-varying quantiles and to make several notes on their properties. The paper is focused on conditional autoregressive value-at-risk via regression quantiles (CAViaR) models, models based on signal extraction and state space algorithm. Several notes are made on changing copula models for dynamic distributions and models based on kernel. A simple local linear trend model and a simple CAViaR model are estimated for illustration purposes and some related practical issues are highlighted. [ABSTRACT FROM AUTHOR]

To minimize makespan for scheduling independent tasks in cloud computing, an improved estimation of distribution algorithm (IEDA) is proposed to tackle the investigated problem in this paper. Considering that the problem is concerned with multi-dimensional discrete problems, an improved population-based incremental learning (PBIL) algorithm is applied, which the parameter for each component is independent with other components in PBIL. In order to improve the performance of PBIL, on the one hand, the integer encoding scheme is used and the method of probability calculation of PBIL is improved by using the task average processing time; on the other hand, an effective adaptive learning rate function that related to the number of iterations is constructed to trade off the exploration and exploitation of IEDA. In addition, both enhanced Max-Min and Min-Min algorithms are properly introduced to form two initial individuals. In the proposed IEDA, an improved genetic algorithm (IGA) is applied to generate partial initial population by evolving two initial individuals and the rest of initial individuals are generated at random. Finally, the sampling process is divided into two parts including sampling by probabilistic model and IGA respectively. The experiment results show that the proposed IEDA not only gets better solution, but also has faster convergence speed. [ABSTRACT FROM AUTHOR]

In this paper, a new multi-agent genetic algorithm based on orthogonal experiment is proposed, which is based on multi-agent system, genetic algorithm and orthogonal experimental design. The design of neighborhood competition operator, orthogonal crossover operator, Son and self-learning operator. The new algorithm is applied to mobile tower defense game, according to the characteristics of the game, the establishment of mathematical models, and finally increases the value of the game’s monster. [ABSTRACT FROM AUTHOR]

In order to solve the problem of how to reconstruct the original image under the condition of unknown sparse basis, this paper proposes an image reconstruction method based on blind compressed sensing model. In this model, the image signal is regarded as the product of a sparse coefficient matrix and a dictionary matrix. Based on the existing blind compressed sensing theory, the optimal solution is solved by the alternative minimization method. The proposed method solves the problem that the sparse basis in compressed sensing is difficult to represent, which restrains the noise and improves the quality of reconstructed image. This method ensures that the blind compressed sensing theory has a unique solution and can recover the reconstructed original image signal from a complex environment with a stronger self-adaptability. The experimental results show that the image reconstruction algorithm based on blind compressed sensing proposed in this paper can recover high quality image signals under the condition of under-sampling. [ABSTRACT FROM AUTHOR]

Maximal clique enumeration is a graph clustering method for finding all vertices that have the most influence in a graph. The Bron-Kerbosch algorithm is one of the fastest algorithms to find all maximal cliques. Hence, this paper will focus on that algorithm to find all maximal cliques. Counting all maximal cliques of a graph usually uses an adjacency matrix of the graph to find all vertices in the graph that have the most influence. But, in this paper, a complement matrix of a graph will be used in counting all maximal cliques. This research uses a graph that represents a domestic flight route of one of the airlines in Indonesia. By using Bron-Kerbosch algorithm, all maximal cliques of the graph will be listed, so that it will come up with the vertices which are the most influential in this graph. The graph will be represented in complement matrix. The result of applying the Bron-Kerbosch algorithm with the complement matrix of graph will determine vertices that have the most influence in the graph. Besides that, by using a complement matrix, the result gives more information on the vertices which are only connected to the vertices that have the most influence. [ABSTRACT FROM AUTHOR]

A good dictionary has direct impact to the result of super-resolution image reconstruction. For solving the problem that dictionary learning only contains representation ability but no class information using K-SVD algorithm,this paper proposes single image super-resolution algorithm based on LC-KSVD (Label consist K-SVD).The algorithm adds classifier parameter constraints into the process of dictionary learning and classifier parameters in the process, making the dictionary possess good representation and discrimination ability. The experimental results show that the algorithm has high reconstruction results and good robustness. [ABSTRACT FROM AUTHOR]