Статьи журнала - International Journal of Intelligent Systems and Applications
Все статьи: 1159
Eye Gaze Relevance Feedback Indicators for Information Retrieval
Статья научная
There is a growing interest in the research on interactive information retrieval, particularly in the study of eye gaze-enhanced interaction. Feedback generated from user gaze features is important for developing an interactive information retrieval system. Generating these gaze features have become less difficult with the advancement of the eye tracker system over the years. In this work, eye movement as a source of relevant feedback was examined. A controlled user experiment was carried out and a set of documents were given to users to read before an eye tracker and rate the documents according to how relevant they are to a given task. Gaze features such as fixation duration, fixation count and heat maps were captured. The result showed a medium linear relationship between fixation count and user explicit ratings. Further analysis was carried out and three classifiers were compared in terms of predicting document relevance based on gaze features. It was found that the J48 decision tree classifier produced the highest accuracy.
Бесплатно
FPGA Fuzzy Controller Design for Magnetic Ball Levitation
Статья научная
This paper presents a fuzzy controller design for nonlinear system using FPGA. A magnetic levitation system is considered as a case study and the fuzzy controller is designed to keep a magnetic object suspended in the air counteracting the weight of the object. Fuzzy controller will be implemented using FPGA chip. The design will use a high-level programming language HDL for implementing the fuzzy logic controller using the Xfuzzy tools to implement the fuzzy logic controller into HDL code. This paper, advocates a novel approach to implement the fuzzy logic controller for magnetic ball levitation system by using FPGA.
Бесплатно
Face Recognition System based on SURF and LDA Technique
Статья научная
In the past decade, Improve the quality in face recognition system is a challenge. It is a challenging problem and widely studied in the different type of imag-es to provide the best quality of faces in real life. These problems come due to illumination and pose effect due to light in gradient features. The improvement and optimization of human face recognition and detection is an important problem in the real life that can be handles to optimize the error rate, accuracy, peak signal to noise ratio, mean square error, and structural similarity Index. Now-a-days, there several methods are proposed to recognition face in different problem to optimize above parameters. There occur many invariant changes in hu-man faces due to the illumination and pose variations. In this paper we proposed a novel method in face recogni-tion to improve the quality parameters using speed up robust feature and linear discriminant analysis for opti-mize result. SURF is used for feature matching. In this paper, we use linear discriminant analysis for the edge dimensions reduction to live faces from our data-sets. The proposed method shows the better result as compare to the previous result on the basis of comparative analysis because our method show the better quality and better results in live images of face.
Бесплатно
Face Veins Based MCMT Technique for Personal Identification
Статья научная
Face veins based personal identification is a challenging task in the field of identity verification of a person. It is because many other techniques are not identifying the uniqueness of a person in the universe. This research paper finds the uniqueness of a person on the basis of face veins based technique. In this paper five different persons face veins images have been used with different rotation angles (left/right 900 to 2700 and 3150). For each person, eight different images at different rotations were used and for each of these images the same minimum cost minutiae tree (MCMT) is obtained. Here, Prim’s or Kruskal’s algorithm is used for finding the MCMT from a minutiae graph. The MCMT is traversed in pre-order to generate the unique string of vertices and edge lengths. We deviated the edge lengths of each MCMT by five pixels in positive and negative directions for robustness testing. It is observed in our experiments that the traversed string which consists of vertices and edge lengths of MCMT is unique for each person and this unique sequence is correctly identifying a person with an accuracy of above 95%. Further, we have compared the performance of our proposed technique with other standard techniques and it is observed that the proposed technique is giving the promising result.
Бесплатно
Fault Diagnosis of Mixed-Signal Analog Circuit using Artificial Neural Networks
Статья научная
This paper presents parametric fault diagnosis in mixed-signal analog circuit using artificial neural networks. Single parametric faults are considered in this study. A benchmark R2R digital to analog converter circuit has been used as an example circuit for experimental validations. The input test pattern required for testing are reduced to optimum value using sensitivity analysis of the circuit under test. The effect of component tolerances has also been taken care of by performing the Monte-Carlo analysis. In this study parametric fault models are defined for the R2R network of the digital to analog converter. The input test patterns are applied to the circuit under test and the output responses are measured for each fault model covering all the Monte-Carlo runs. The classification of the parametric faults is done using artificial neural networks. The fault diagnosis system is developed in LabVIEW environment in the form of a virtual instrument. The artificial neural network is designed using MATLAB and finally embedded in the virtual instrument. The fault diagnosis is validated with simulated data and with the actual data acquired from the circuit hardware.
Бесплатно
Fault Tolerant Multi-Criteria Multi-Path Routing in Wireless Sensor Networks
Статья научная
The Ad Hoc On-Demand Multi-Path Distance Vector (AOMDV) routing protocol allows the transport of data along one or more paths in wireless sensor networks (WSNs). The path chosen is based on a single shortest path hop count metric. The data on some WSNs is mission critical, for example, military and health care applications. Hence, fault tolerance in WSNs is becoming increasingly important. To improve the fault tolerance of WSNs in lossy environments, this work adds to the AOMDV routing protocol as it incorporates an additional packet loss metric. This Multi-criteria AOMDV or M-AOMDV is evaluated using the ns2 simulator. Simulations show that M-AOMDV maintains relatively low packet loss rates when the WSN is experiencing loss.
Бесплатно
Статья научная
Propagated electromagnetic signal over the cellular radio communication channels and interfaces are usually highly stochastic and complex with unequal noise variation pattern. This is due to multipath nature of the propagation channels and diverse radio propagation mechanisms that impact the signal strength at the receiver en-route the transmitter, and verse versa. This also makes measurement, predictive modeling and estimation based analysis of such signal very challenging and complex as well. One important and popular parametric modelling and estimation technique in mathematics and engineering science, especially for signal processing applications is the least square regression (LSR). The dominance use and popularity of the LSR approach may be attributed to its simplified supporting theory, relatively fast application procedure and ubiquitous application packages. However, LSR is known to be very sensitive to outliers and unusual stochastic signal data. In this work, we propose the application of weighted least square regression method for enhanced propagation practical field strength estimation modelling over cellular radio communication networks interface. The signal data was collected from a commercial LTE networks service provider. Also, we provide statistical computational analyses to compare the resultant estimation outcome of the weighted least square and the standard least approach. From the result, it is found that the WLSR approach is reliably better the most popular standard least square method. The significance and academic of value of this paper is that our proposed and implemented WLSR method can used as replacement of the standard LSR approach for robust mobile signal processing of future communication system networks.
Бесплатно
Filter Loop Reduction in DT BP Sigma-Delta Modulator Assisted by Noise Coupling Technique
Статья научная
In bandpass modulators, a 2N-order loop filter can lead to an N-order noise shaping in the band of interest. This caused a bandpass modulator with more complex structure than a lowpass modulator and increased the power consumption and area of the modulator. In this paper, we proposed a discrete-time bandpass modulator using the noise-coupling technique that only needs to a second- order loop filter to have a second-order noise shaping. To realize a noise coupled bandpass modulator, we need to implement Z-2 delay block in the analog domain, but the proposed modulator uses only Z-1 delay blocks to apply the noise coupling technique. This simplifies the structure of the modulator and reduces the power consumption, area, and nonlinearity of the modulator. The error in the coupling path is considered and the effect of it on the modulator resolution is analyzed. According to the simulation results, the proposed modulator results in SNR = 84.9 dB at 80 MHz sampling frequency, 200 KHz bandwidth and OSR = 200.
Бесплатно
Finding Representative Test Case for Test Case Reduction in Regression Testing
Статья научная
Software testing is one of the important stages of software development. In software development, developers always depend on testing to reveal bugs. In the maintenance stage test suite size grow because of integration of new technique. An addition of new technique force to create new test case which increase the size of test suite. In regression testing new test case may be added to the test suite during the whole testing process. These additions of test cases create possibility of presence of redundant test cases. Due to limitation of time and resource, reduction techniques should be used to identify and remove them. Research shows that a subset of the test case in a suit may still satisfy all the test objectives which is called as representative set. Redundant test case increase the execution cost of the test suite, in spite of NP-completeness of the problem there are few good reduction techniques have been available. In this paper a new approach for test case reduction is proposed. This algorithm use genetic algorithm technique iteratively with varying chromosome length to reduce test case in a test suit by finding a representative set of test cases that are fulfill the testing criteria.
Бесплатно
Finding Within Cluster Dense Regions Using Distance Based Technique
Статья научная
One of the main categories in Data Clustering is density based clustering. Density based clustering techniques like DBSCAN are attractive because they can find arbitrary shaped clusters along with noisy outlier. The main weakness of the traditional density based algorithms like DBSCAN is clustering the different density level data sets. DBSCAN calculations done according to given parameters applied to all points in a data set, while densities of the data set clusters may be totally different. The proposed algorithm overcomes this weakness of the traditional density based algorithms. The algorithm starts with partitioning the data within a cluster to units based on a user parameter and compute the density for each unit separately. Consequently, the algorithm compares the results and merges neighboring units with closer approximate density values to become a new cluster. The experimental results of the simulation show that the proposed algorithm gives good results in finding clusters for different density cluster data set.
Бесплатно
Finding the Number of Clusters in Data and Better Initial Centers for K-means Algorithm
Статья научная
The k-means is the most well-known algorithm for data clustering in data mining. Its simplicity and speed of convergence to local minima are the most important advantages of it, in addition to its linear time complexity. The most important open problems in this algorithm are the selection of initial centers and the determination of the exact number of clusters in advance. This paper proposes a solution for these two problems together; by adding a preprocess step to get the expected number of clusters in data and better initial centers. There are many researches to solve each of these problems separately, but there is no research to solve both problems together. The preprocess step requires o(n log n); where n is size of the dataset. This preprocess step aims to get initial portioning of data without determining the number of clusters in advance, then computes the means of initial clusters. After that we apply k-means on original data using the resulting information from the preprocess step to get the final clusters. We use many benchmark datasets to test the proposed method. The experimental results show the efficiency of the proposed method.
Бесплатно
Football match prediction with tree based model classification
Статья научная
This paper presents the football match prediction using a tree-based model algorithm (C5.0, Random Forest, and Extreme Gradient Boosting). Backward wrapper model was applied as a feature selection methodology to help select the best feature that will improve the accuracy of the model. This study used 10 seasons of football data match history (2007/2008 – 2016/2017) in the English Premier League with 15 initial features to predict the match results. With the tuning process, each model showed improvement in accuracy. Random Forest algorithm generated the best accuracy with 68,55% while the C5.0 algorithm had the lowest accuracy at 64,87% and Extreme Gradient Boosting algorithm produced accuracy of 67,89%. With the output produced in this study, the Decision Tree based algorithm is concluded as not good enough in predicting a football match history.
Бесплатно
Force-Directed Method in Mirror Frames for Graph Drawing
Статья научная
The most widely used algorithms for graph drawing are force-directed algorithms. We should modify a hybrid force model that is coupling a traditional spring force model and a novel repulsive force model will be proposed to solve the graph drawing problems in 2-D space. Especially, regular triangle drawing frame can be applied to binary tree drawing problems that on an important contribution to computer science. And apply circle drawing frame to normal graph drawing problems, we get satisfactory and aesthetic criteria graphics.
Бесплатно
Forecasting Performance of Random Walk with Drift and Feed Forward Neural Network Models
Статья научная
In this study, linear and nonlinear methods were used to model forecasting performances on the daily crude oil production data of the Nigerian National Petroleum Corporation (NNPC). The linear model considered here is the random walk with drift, while the nonlinear model is the feed forward neural network model. The results indicate that nonlinear methods have better forecasting performance greater than linear methods based on the mean error square sense. The root mean square error (RMSE) and the mean absolute error (MAE) were applied to ascertain the assertion that nonlinear methods have better forecasting performance greater than linear methods. Autocorrelation functions emerging from the increment series, that is, log difference series and difference series of the daily crude oil production data of the NNPC indicates significant autocorrelations. As a result of the foregoing assertion we deduced that the daily crude oil production series of the NNPC is not firmly a random walk process. However, the original daily crude oil production series of the NNPC was considered to be a random walk with drift when we are not trying to forecast immediate values. The analysis for this study was simulated using MATLAB software, version 8.03.
Бесплатно
Forecasting of dry freight index data by using machine learning algorithms
Статья научная
Discovery of meaningful information from the data and design of an expert system are carried out within the frame of machine learning. Supervised learning is used commonly in practical machine learning. It includes basically two stages: a) the training data are sent to as input to the classifier algorithms, b) the performance of pre-learned algorithm is tested on the testing data. And so, knowledge discovery is carried out through the data. In this study, the analysis of Lloyd data is performed by utilizing Gradient Boosted Trees and Multi-Layer Perceptron learning algorithms. Lloyd data consist of the Baltic Dry Index, Capesize Index, Panamax Index and Supramax Index values, updated daily. Accurate prediction of these data is very important in order to eliminate the risks of commercial organization. Eight datasets from Lloyd data are obtained within the frame of two scenarios: a) the last three index values in the freight index datasets; b) the last three index values in both crude oil price and freight index datasets. The results show that the models designed with Gradient Boosted Trees and Multi-Layer Perceptron algorithms are successful for Lloyd data prediction and so proved their applicability.
Бесплатно
Formal and Informal Modeling of Fault Tolerant Noc Architectures
Статья научная
The suggested new approach based on B-Event formal technics consists of suggesting aspects and constraints related to the reliability of NoC (Network-On-chip) and the over-cost related to the solutions of tolerances on the faults: a design of NoC tolerating on the faults for SoC (System-on-Chip) containing configurable technology FPGA (Field Programmable Gates Array), by extracting the properties of the NoC architecture. We illustrate our methodology by developing several refinements which produce QNoC (Quality of Service of Network on chip) switch architecture from specification to test. We will show how B-event formalism can follow life cycle of NoC design and test: for example the code VHDL (VHSIC Hardware Description Language) simulation established of certain kind of architecture can help us to optimize the architecture and produce new architecture; we can inject the new properties related to the new QNoC architecture into formal B-event specification. B-event is associated to Rodin tool environment. As case study, the last stage of refinement used a wireless network in order to generate complete test environment of the studied application.
Бесплатно
Formal validation of data warehouse complexity metrics using distance framework
Статья научная
Data Warehouse is the cornerstone for organizations that base their strategic decisions on the large scale processing of numerical data. The success of the organization depends on these decisions and hence it becomes extremely important to have a quality data warehouse. Conceptual models have been widely recognized as a key determinant of data warehouse quality during the early stages of design. Recently, metrics have been proposed by authors based on hierarchies to quantify the complexity and inturn quality of the conceptual models of data warehouse. They have formally corroborated the measures against Briand’s property based framework to ensure their validity. However, Briand’s set of properties for software measures are a set of necessary but not sufficient measure axioms. They are advantageous to refute software metrics but not to validate them. Thus, we focus on the theoretical validation of the data warehouse conceptual model metrics using the Distance framework whose sufficiency is ensured by the measurement theory. The results indicate that the metrics are valid measures of the complexity of data warehouse conceptual models. Besides, validation by Distance framework assures that the metrics are in the ratio scale which further aids in data analysis.
Бесплатно
Formation of optimum temperature graph of paper web warming
Статья научная
To date, the requirements for the quality of paper products are increasing. At the same time, the most common trend in recent years is improving the resource and energy conservation of all technological processes. From the point of view of specialists in the field of paper industry in technological process of production on a paper machine, the greatest attention must be paid to the drying of a paper web. This process is the most expensive and decisive for a large number of quality parameters of finished products. In order to satisfy these requirements, it is necessary to implement a system of optimal control for this technological process. The first and one of the most important parts of the development of such system is the formation of a criterion for the optimal control and calculation of the optimal mode of operation of the first stage of drying - the heating of a paper web. For this purpose, the problem of calculating the optimal temperature graph of heating the paper web in the drying section of a paper machine is considered. Proposed quality control criterion ensures the maintenance of the parameters of finished products within the limits defined by the standard. Established limitations on the dynamics of temperature change on each drying cylinder and the final values. The calculation of the optimal temperature schedule is made by taking into account the characteristics of the material, the changes in the parameters of heat and mass transfer, which are functional dependences on the temperature of the paper web. The formulas for calculating the temperature of the paper at the exit from each drying cylinder and the free movement sections are based on the data on partial pressure on the surface of the paper web and in the environment. Results of the work are presented in the form of a step-by-step algorithm. Implementation of the developed algorithm ensures uniform heating of the paper web and reaches the optimum temperature for effective removal of moisture.
Бесплатно
Статья научная
The paper presents a detailed discussion on the structural organisation of a Fuzzy Inference System Planner (FISPLAN) for Autonomous Underwater Vehicles (AUVs), including elaboration of membership functions for the inputs as well as outputs. The inference mechanism is detailed with discussions on the rule base, which in essence incorporates the planning logic. In order to assess the effectiveness of the planner as a means of reactive escape under critical situations, a case study is studied with reference to a state of the art AUV. An approximate subsea current model is developed from field observations, and residual energy is estimated by referring to a typical Lithium-polymer cell discharge characteristic together with data recorded in actual field trials. Situations are simulated by considering different combinations of sea-currents as well as status of resident energy. Results reveal that the simulated system, by virtue of the planner, is capable of perceiving situations, thereby realizing their imminence and making a decisive action thereupon. In concise, the fuzzy planner may be considered to provide human-like perception of situations on the basis of crisp observations. Furthermore dynamics of the system are modelled with actual parameters, and subsequently controller responses for pitching and velocity correction are illustrated. Choice of planning interval is also expressed as a function of the controllers' response.
Бесплатно
Fractional Order EOQ Model with Linear Trend of Time-Dependent Demand
Статья научная
In this paper we introduce the classical EOQ model with a linear trend of time-dependent demand having no shortages using the concept of fractional calculus. The application of fractional calculus has been already used in classical EOQ model where the demand is assumed to be constant. In this present article fractional differential calculus can be used to describe EOQ model with time-dependent linear trend of demand to develop more generalized EOQ model. Here, we want to discuss more deeply its role as a tool for describing the traditional classical EOQ model with time dependent demand.
Бесплатно
