Статьи журнала - International Journal of Intelligent Systems and Applications
Все статьи: 1159
Security Based on Real Time Tracking of Multiple Human Faces Identification
Статья научная
Robust tracking of persons in real-world environments and in real-time is a common goal in many video applications. In this paper a computational system for the real-time tracking of multiple persons in natural environments is presented. Face detection has diverse applications especially as an identification solution which can meet the crying needs in security areas. The region extractor is based on the integration of skin-color, motion and silhouette features, while the face detector uses a simple, rule-based face detection algorithm and SVM. Exemplary results of the integrated system working in real-world video sequences. New intelligent processing methods, as well as security requirements make multiple-person tracking a hot area. This application is robust tracking in real-world environments and in real-time.
Бесплатно
Статья научная
Electronic passports (e-passports) are to prevent the illegal entry of traveller into a specific country and limit the use of counterfeit documents by more accurate identification of an individual. The e-passport, as it is sometimes called, represents a bold initiative in the deployment of two new technologies: cryptography security and biometrics (face, fingerprints, palm prints and iris). A passport contains the important personal information of holder such as photo, name, date of birth and place, nationality, date of issue, date of expiry, authority and so on. The goal of the adoption of the electronic passport is not only to expedite processing at border crossings, but also to increase security. The paper explores the privacy and security implications of this impending worldwide experiment in biometrics authentication technology.
Бесплатно
Статья научная
Biomedical Image-segmentation is one of the ways towards removing an area of attentiveness by making various segments of an image. The segmentation of biomedical images is considered as one of the challenging tasks in many clinical applications due to poor illuminations, intensity inhomogeneity and noise. In this paper, we propose a new segmentation method which is called Optimized K-Means Clustering via Level Set Formulation. The proposed method diversified into two stages for efficient segmentation of soft tissues and tumor’s from MRI brain Scans Images, which is called pre-processing and post-processing. In the first stage, a hybrid approach is considered as pre-processing is called Optimized K-Means Clustering which is the combined approach of Particle Swarm Optimization (PSO) as well as K-Means Clustering for improve the clustering efficiency. We choose the ‘optimal’ cluster centers by Particle Swarm Optimization (PSO) algorithm for improving the clustering efficiency. During the process of pre-processing, these segmentation results suffer from few drawbacks such as outliers, edge and boundary leakage problems. In this regard, post-processing is necessary to minimize the obstacles, so we are implementing pre-processing results by using level-set method for smoothed and accurate segmentation of regions from biomedical images such as MRI brain images over existing level set methods.
Бесплатно
Self Adaptive Trust Model for Secure Geographic Routing in Wireless Sensor Networks
Статья научная
The presence of malicious nodes in the ad hoc and sensor networks poses serious security attacks during routing which affects the network performance. To address such attacks, numerous researchers have proposed defense techniques using a human behavior pattern called trust. Among existing solutions, direct observations based trust models have gained significant attention in the research community. In this paper, the authors propose a Self Adaptive Trust Model (SATM) of secure geographic routing in wireless sensor networks (WSNs). Unlike conventional weight based trust models, SATM intelligently assigns the weights associated with the network activities. These weights are applied to compute the final trust value. SATM considers direct observations to restrict the reputation based attacks. Due to the flexible and intelligent weight computation, SATM dynamically detects the malicious nodes and direct the traffic towards trustworthy nodes. SATM has been incorporated into Greedy Perimeter Stateless Routing (GPSR) protocol. Simulation results using the network simulator NS-2 have shown that GPSR with SATM is robust against detecting malicious nodes.
Бесплатно
Self-Load Balanced Clustering Algorithm for Routing in Wireless Sensor Networks
Статья научная
Energy-efficient routing is an extremely critical issue in unattended, tiny and battery equipped Wireless Sensor Networks (WSNs). Clustering the network is a promising approach for energy aware routing in WSN, as it has a hierarchical structure. The Connected Dominating Set (CDS) is an appropriate and prominent approach for cluster formation. This paper proposes an Energy-efficient Self-load Balanced Clustering algorithm (SLBC) for routing in WSN. SLBC has two phases: The first phase clusters the network by constructing greedy connected dominating set and the nodes are evenly distributed among them, using the defined parent fitness cost. The second phase performs data manipulations and new on-demand re-clustering. The efficiency of the proposed algorithm is analysed through simulation study. The obtained results show that SLBC outperforms than the recent algorithms like GSTEB and DGA-EBCDS in terms of network lifetime, CDS size, load dissemination, and efficient energy utilization of the network.
Бесплатно
Self-Organization and Autonomy in Computational Networks:Agents-based Contractual Workflow Paradigm
Статья научная
We describe an agents-based contractual workflow paradigm for Self-organization and autonomy in computational networks. The agent-based paradigm can be interpreted as the outcome arising out of deterministic, nondeterministic or stochastic interaction among a set of agents that includes the environment. These interactions are like chemical reactions and result in self-organization. Since the reaction rules are inherently parallel, any number of actions can be performed cooperatively or competitively among the subsets of elements, so that the agents carry out the required actions. Also we describe the application of this paradigm in finding short duration paths, chemical- patent mining, and in cloud computing services.
Бесплатно
Selfie sign language recognition with convolutional neural networks
Статья научная
Extraction of complex head and hand movements along with their constantly changing shapes for recognition of sign language is considered a difficult problem in computer vision. This paper proposes the recognition of Indian sign language gestures using a powerful artificial intelligence tool, convolutional neural networks (CNN). Selfie mode continuous sign language video is the capture method used in this work, where a hearing-impaired person can operate the Sign language recognition (SLR) mobile application independently. Due to non-availability of datasets on mobile selfie sign language, we initiated to create the dataset with five different subjects performing 200 signs in 5 different viewing angles under various background environments. Each sign occupied for 60 frames or images in a video. CNN training is performed with 3 different sample sizes, each consisting of multiple sets of subjects and viewing angles. The remaining 2 samples are used for testing the trained CNN. Different CNN architectures were designed and tested with our selfie sign language data to obtain better accuracy in recognition. We achieved 92.88 % recognition rate compared to other classifier models reported on the same dataset.
Бесплатно
Статья научная
This paper describes a method for semantic analysis of natural language queries for Natural Language Interface to Database (NLIDB) using domain ontology. Implementation of NLIDB for serious applications like railway inquiry, airway inquiry, corporate or government call centers requires higher precision. This can be achieved by increasing role of language knowledge and domain knowledge at semantic level. Also design of semantic analyzer should be such that it can easily be ported for other domains as well. In this paper a design of semantic analyzer for railway inquiry domain is reported. Intermediate result of the system is evaluated for a corpus of natural language queries collected from casual users who were not involved in the system design.
Бесплатно
Semantic Enabled Role Based Social Network
Статья научная
Communication is the most common but an intricate activity that we perform every day. Sender sends message, discussions, greetings, gestures, emotics and texts through numerous channels, (e.g. e-mail, messengers, social networks and so on) intending the receiver to understand. The means of personal or group communication has been radically changed over last decade. Geographical, ethnicity, nationality, race, religion are no more hindrance for the sake of social communication. Forms of communication, event, gathering, greetings almost have altered into virtual society. But this hi-tech society has still yet enough room to strengthen its semantic nature. We have made an endeavor to conglomerate the socio-psycho-technical aspect of so-called social networks which could be more realistic, logically inferable and convincible towards people to claim its analogousness with real society. Our devised SN is able to eliminate some weird problems that we face in current SNs, imperfect relationship assignment policies and possibility of data interference among desired and intruder groups.
Бесплатно
Semantic Schema Matching Using DBpedia
Статья научная
In semantic computing, Match is an operator that takes as an input two graph-like structures; it can be database schemas or XML schemas and generates a mapping between the corresponding nodes of the two graphs. In semantic schema matching, we attempt to explore the mappings between the two schemas; based on their semantics by employing any semantic similarity measure. In this study, we have defined taxonomy of all possible semantic similarity measures; moreover we also proposed an approach that exploits semantic relations stored in the DBpedia dataset while utilizing a hybrid ranking system to dig out the similarity between nodes of the two graphs.
Бесплатно
Статья научная
This paper focuses on the construction of a Semi Automatic Ontological tree in the domain of Pilgrimage Tourism in South India for the purpose of enhancing the efficiency in the online Information Retrieval. The proposed system uses two languages Tamil and English for the input query and document retrieval. The user can pose the query in either Tamil or English and the resultant document will be displayed in the query language. In order to retrieve more relevant documents, a semi-automatic Ontology tree has been constructed. The semi automatic ontological tree uses only the English language. Machine Translation approach is used to translate the retrieved result to the language that of the user’s query. Our system produces the better results for the simple user’s query about Pilgrimage Tourism in South India for which the answers could be retrieved from the updated semi automatic ontological tree itself.
Бесплатно
Sensitive Data Protection Based on Intrusion Tolerance in Cloud Computing
Статья научная
Service integration and supply on-demand coming from cloud computing can significantly improve the utilization of computing resources and reduce power consumption of per service, and effectively avoid the error of computing resources. However, cloud computing is still facing the problem of intrusion tolerance of the cloud computing platform and sensitive data of new enterprise data center. In order to address the problem of intrusion tolerance of cloud computing platform and sensitive data in new enterprise data center, this paper constructs a virtualization intrusion tolerance system based on cloud computing by researching on the existing virtualization technology, and then presents a method of intrusion tolerance to protect sensitive data in cloud data center based on virtual adversary structure by utilizing secret sharing. This system adopts the method of hybrid fault model, active and passive replicas, state update and transfer, proactive recovery and diversity, and initially implements to tolerate F faulty replicas in N=2F+1 replicas and ensure that only F+1 active replicas to execute during the intrusion-free stage. The remaining replicas are all put into passive mode, which significantly reduces the resource consuming in cloud platform. At last we prove the reconstruction and confidentiality property of sensitive data by utilizing secret sharing.
Бесплатно
Sensitivity Analysis Using Simple Additive Weighting Method
Статья научная
The output of a multiple criteria decision method often has to be analyzed using some sensitivity analysis technique. The SAW MCDM method is commonly used in management sciences and there is a critical need for a robust approach to sensitivity analysis in the context that uncertain data is often present in decision models. Most of the sensitivity analysis techniques for the SAW method involve Monte Carlo simulation methods on the initial data. These methods are computationally intensive and often require complex software. In this paper, the SAW method is extended to include an objective function which makes it easy to analyze the influence of specific changes in certain criteria values thus making easy to perform sensitivity analysis.
Бесплатно
Статья научная
Social Networks such as Facebook, Twitter, Linked In etc… are rich in opinion data and thus Sentiment Analysis has gained a great attention due to the abundance of this ever growing opinion data. In this research paper our target set is movie reviews. There are diverge range of mechanisms to express their data which may be either subjective, objective or a mixture of both. Besides the data collected from World Wide Web consists of lot of noisy data. It is very much true that we are going to apply some pre-processing techniques and compare the accuracy using Machine Learning algorithm Naïve Bayes Classifier. With ever growing demand to mine the Big Data the open source software technologies such as Hadoop using map reducing paradigm has gained a lot of pragmatic importance. This paper illustrates a comparitive study of sentiment analysis of movie reviews using Naïve Bayes Classifier and Apache Hadoop in order to calculate the performance of the algorithms and show that Map Reduce paradigm of Apache Hadoop performed better than Naïve Bayes Classifier.
Бесплатно
Sentiment Analysis on Twitter Data: Comparative Study on Different Approaches
Статья научная
Social media has become incredibly popular these days for communicating with friends and for sharing opinions. According to current statistics, almost 2.22 billion people use social media in 2016, which is roughly one third of the world population and three times of the entire population in Europe. In social media people share their likes, dislikes, opinions, interests, etc. so it is possible to know about a person’s thoughts about a specific topic from the shared data in social media. Since, twitter is one of the most popular social media in the world; it is a very good source for opinion mining and sentiment analysis about different topics. In this research, SVM with different kernel functions and Adaboost are experimented using CPD and Chi-square feature extraction techniques to explore the best sentiment classification model. The reported average accuracy of Adaboost for Chi-square and CPD are 70.2% and 66.9%. The SVM radial basis kernel and polynomial kernel with Chi-square n-grams reported average accuracy of 73.73% and 68.67% respectively. Among the performed experimentation, SVM sigmoid kernel with Chi-square n-grams provided the maximum accuracy that is 74.4%.
Бесплатно
Sentiment Analysis: A Perspective on its Past, Present and Future
Статья научная
The proliferation of Web-enabled devices, including desktops, laptops, tablets, and mobile phones, enables people to communicate, participate and collaborate with each other in various Web communities, viz., forums, social networks, blogs. Simultaneously, the enormous amount of heterogeneous data that is generated by the users of these communities, offers an unprecedented opportunity to create and employ theories & technologies that search and retrieve relevant data from the huge quantity of information available and mine for opinions thereafter. Consequently, Sentiment Analysis which automatically extracts and analyses the subjectivities and sentiments (or polarities) in written text has emerged as an active area of research. This paper previews and reviews the substantial research on the subject of sentiment analysis, expounding its basic terminology, tasks and granularity levels. It further gives an overview of the state- of – art depicting some previous attempts to study sentiment analysis. Its practical and potential applications are also discussed, followed by the issues and challenges that will keep the field dynamic and lively for years to come.
Бесплатно
Sentiment Predictions using Support Vector Machines for Odd-Even Formula in Delhi
Статья научная
This paper analyzes the odd-even formula in Delhi using tweets posted on Twitter from December 2015 to August 2016. Twitter is a social network where users post their feelings, opinions and sentiments for any event using hashtags and mentions. The tweets posted publicly can be viewed by anyone interested. This paper transforms the unstructured tweets into structured information using open source libraries. Further objective is to build a model using Support Vector Machines (SVM) to classify unseen tweets on the same context. This paper collects tweets on this event under the hashtag "#oddeven formula". This study explores four freely available resources in the form of Application Programming Interfaces (APIs)/Packages for labeling tweets for academic research. Four machine learning models using SVM multi-class classifier were built using the labels provided by the APIs/Packages. The performances of these four models are evaluated through standard evaluation metrics. The experimental results reveal that TextBlob and Pattern python packages outperformed Vivekn and Meaning Cloud APIs. This study may also help in decision making of this event to some extent.
Бесплатно
Sequential Adaptive Fuzzy Inference System Based Intelligent Control of Robot Manipulators
Статья научная
The present paper is dedicated to the presentation and implementation of an optimized technique allowing an on-line estimation of a robot manipulator parameters to use them in a computed torque control. Indeed the proposed control law needs the exact robot model to give good performances. The complexity of the robot manipulator and its strong non-linearity makes it hard to know its parameters. Therefore, we propose in this paper to use neuro-fuzzy networks Sequential Adaptive Fuzzy Inference System (SAFIS) to estimate the parameters of the controlled robot manipulator.
Бесплатно
Sequential Adaptive RBF-Fuzzy Variable Structure Control Applied to Robotics Systems
Статья научная
In this paper, we present a combination of sequential trained radial basis function networks and fuzzy techniques to enhance the variable structure controllers dedicated to robotics systems. In this aim, four RBFs networks were used to estimate the model based part parameters (Inertia, Centrifugal and Coriolis, Gravity and Friction matrices) of a variable structure controller so to respond to model variation and disturbances, a sequential online training algorithm based on Growing-Pruning "GAP" strategy and Kalman filter was implemented. To eliminate the chattering effect, the corrective control of the VS control was computed by a fuzzy controller. Simulations are carried out to control three degrees of freedom SCARA robot manipulator where the obtained results show good disturbance rejection and chattering elimination.
Бесплатно
Simplified real-, complex-, and quaternion-valued neuro-fuzzy learning algorithms
Статья научная
The conventional real-valued neuro-fuzzy method (RNF) is based on classic fuzzy systems with antecedent membership functions and consequent singletons. Rules in RNF are made by all the combinations of membership functions; thus, the number of rules as well as total parameters increase rapidly with the number of inputs. Although network parameters are relatively less in the recently developed complex-valued neuro-fuzzy (CVNF) and quaternion neuro-fuzzy (QNF), parameters increase with number of inputs. This study investigates simplified fuzzy rules that constrain rapid increment of rules with inputs; and proposed simplified RNF (SRNF), simplified CVNF (SCVNF) and simplified QNF (SQNF) employing the proposed simplified fuzzy rules in conventional methods. The proposed simplified neuro-fuzzy learning methods differ from the conventional methods in their fuzzy rule structures. The methods tune fuzzy rules based on the gradient descent method. The number of rules in these methods are equal to the number of divisions of input space; and hence they require significantly less number of parameters to be tuned. The proposed methods are tested on function approximations and classification problems. They exhibit much less execution time than the conventional counterparts with equivalent accuracy. Due to less number of parameters, the proposed methods can be utilized for the problems (e.g., real-time control of large systems) where the conventional methods are difficult to apply due to time constrain.
Бесплатно
