Статьи журнала - International Journal of Intelligent Systems and Applications

Все статьи: 1173

Simulation on Different Proportions of Coal and Natural Gas Co-combustion in a Rotary Lime Kiln

Simulation on Different Proportions of Coal and Natural Gas Co-combustion in a Rotary Lime Kiln

Hongyu Gu, Peng He, Shuxia Mei, Junlin Xie, Lixin Song

Статья научная

Co-combustion of coal and natural gas is a promising technology in the production of active lime. For this technology, proper fuel proportion of coal and natural gas (α) is one of the key parameters that requires significant thought. By means of numerical simulation, contrast studies on co-combustion with five different fuel proportions were carried out. This paper firstly puts forward the models used to describe the system based on the actual conditions. Then, numerical simulation results were analysed in detail to illustrate the co-combustion process and the velocity and temperature distribution in the kiln. Finally, comparisons of high temperature region, char conversion, length of calcining zone, CO and NOx emission and total heat transfer rate to the material bed were made in order to make a decision on fuel proportion. Synthetically considering, α=30% is a balance between benefits and costs for the rotary lime kiln studied.

Бесплатно

Single and Multi-Area Optimal Dispatch by Modified Salp Swarm Algorithm

Single and Multi-Area Optimal Dispatch by Modified Salp Swarm Algorithm

Deepak Kumar Sharma, Hari Mohan Dubey, Manjaree Pandit

Статья научная

This paper presents modified salp swarm algorithm (MSSA) for solution of power system scheduling problems with diverse complexity level. Salp swarm algorithm (SSA) is a recently proposed efficient nature inspired (NI) optimization method inspired by foraging behaviour of salps found in deep ocean. SSA sometimes suffers to stagnation at local minima, to overcome this problem and enhancing searching capability by both exploration and exploitation MSSA is proposed in this paper. MSSA applied and tested on two types of problems. Type one is having five benchmark functions of diverse nature, whereas type two is related with real world problem of power system scheduling of a standard IEEE 114 bus system with 54 thermal units for (i) single area system, (ii) two area system and (iii) three area system. Finally Outcome of simulation results are validated with reported results by other method available in literature.

Бесплатно

Single and Multiple Hand Gesture Recognition Systems: A Comparative Analysis

Single and Multiple Hand Gesture Recognition Systems: A Comparative Analysis

Siddharth Rautaray, Manjusha Pandey

Статья научная

With the evolution of higher computing speed, efficient communication technologies, and advanced display techniques the legacy HCI techniques become obsolete and are no more helpful in accurate and fast flow of information in present day computing devices. Hence the need of user friendly human machine interfaces for real time interfaces for human computer interaction have to be designed and developed to make the man machine interaction more intuitive and user friendly. The vision based hand gesture recognition affords users with the ability to interact with computers in more natural and intuitive ways. These gesture recognition systems generally consist of three main modules like hand segmentation, hand tracking and gesture recognition from hand features, designed using different image processing techniques which are further integrated with different applications. An increase use of new interfaces based on hand gesture recognition designed to cope up with the computing devices for interaction. This paper is an effort to provide a comparative analysis between such real time vision based hand gesture recognition systems which are based on interaction using single and multiple hand gestures. Single hand gesture based recognition systems (SHGRS) have fewer complexes to implement, with a constraint to the count of different gestures which is large enough with various permutations and combinations of gesture, which is possible with multiple hands in multiple hand gesture recognition systems (MHGRS). The thorough comparative analysis has been done on various other vital parameters for the recognition systems.

Бесплатно

Skin Diseases Expert System using Dempster-Shafer Theory

Skin Diseases Expert System using Dempster-Shafer Theory

Andino Maseleno, Md. Mahmud Hasan

Статья научная

Based on World Health Organization (WHO) report in the 2011 Skin diseases still remain common in many rural communities in developing countries, with serious economic and social consequences as well as health implications. Directly or indirectly, skin diseases are responsible for much disability (and loss of economic potential), disfigurement, and distress due to symptoms such as itching or pain. In this research, we are using Dempster-Shafer Theory for detecting skin diseases and displaying the result of detection process. We describe five symptoms as major symptoms which include blister, itch, scaly skin, fever, and pain in the rash. Dempster-Shafer theory to quantify the degree of belief, our approach uses Dempster-Shafer theory to combine beliefs under conditions of uncertainty and ignorance, and allows quantitative measurement of the belief and plausibility in our identification result. The result reveal that Skin Diseases Expert System has been successfully detecting skin diseases and displaying the result of identification process.

Бесплатно

Sky-CNN: a CNN-based learning approach for skyline scene understanding

Sky-CNN: a CNN-based learning approach for skyline scene understanding

Ameni Sassi, Wael Ouarda, Chokri Ben Amar, Serge Miguet

Статья научная

Skyline scenes are a scientific matter of interest for some geographers and urbanists. These scenes have not been well-handled in computer vision tasks. Understanding the context of a skyline scene could refer to approaches based on hand-crafted features combined with linear classifiers; which are somewhat side-lined in favor of the Convolutional Neural Networks based approaches. In this paper, we proposed a new CNN learning approach to categorize skyline scenes. The proposed model requires a pre-processing step enhancing the deep-learned features and the training time. To evaluate our suggested system; we constructed the SKYLINEScene database. This new DB contains 2000 images of urban and rural landscape scenes with a skyline view. In order to examine the performance of our Sky-CNN system, many fair comparisons were carried out using well-known CNN architectures and the SKYLINEScene DB for tests. Our approach shows it robustness in Skyline context understanding and outperforms the hand-crafted approaches based on global and local features.

Бесплатно

Smart Parking System with Image Processing Facility

Smart Parking System with Image Processing Facility

M.O. Reza, M.F. Ismail, A.A. Rokoni, M.A.R. Sarkar

Статья научная

Smart Parking Systems obtain information about available parking spaces, process it and then place the car at a certain position. A prototype of the parking assistance system based on the proposed architecture was constructed here. The adopted hardware, software, and implementation solutions in this prototype construction are described in this paper. The effective circular design is introduced here having rack-pinion special mechanism which is used to lift and place the car in the certain position. The design of rack pinion mechanism is also simulated using AUTODESK INVENTOR and COMSOL software.

Бесплатно

Smart Warehouse Management using Hybrid Architecture of Neural Network with Barcode Reader 1D / 2D Vision Technology

Smart Warehouse Management using Hybrid Architecture of Neural Network with Barcode Reader 1D / 2D Vision Technology

Mbida Mohamed

Статья научная

Manually, to manage stocks amounts spending the every day in the rays to count for each product the number which it remains in stores, or to record by a scanner head barcode information dependent of each product. However, the mission become increasingly difficult if several warehouses are found, that involves much time to pass from a product to another, moreover that requires agents to carry out these spots. In this article we use a network architecture neuron combined with the readers bar code of technology vision, this method allows to know in real time information concerning each product in stock. It will allow besides introducing the concept of real stocks rather than physical. However The basic classical use of data and to feed it will be completely changed by the spheres of knowledge which generates the NN (Neural Network) to store information on the quantity at a given time (Dynamic inventory), the entries(delivery of suppliers ) and the outputs ( delivery or sale with the customers and use of manufacturing pieces or repair ).

Бесплатно

Solving Economic Load Dispatch Problem Using Particle Swarm Optimization Technique

Solving Economic Load Dispatch Problem Using Particle Swarm Optimization Technique

Hardiansyah, Junaidi, Yohannes MS

Статья научная

Economic load dispatch (ELD) problem is a common task in the operational planning of a power system, which requires to be optimized. This paper presents an effective and reliable particle swarm optimization (PSO) technique for the economic load dispatch problem. The results have been demonstrated for ELD of standard 3-generator and 6-generator systems with and without consideration of transmission losses. The final results obtained using PSO are compared with conventional quadratic programming and found to be encouraging.

Бесплатно

Solving Practical Economic Dispatch Problems Using Improved Artificial Bee Colony Method

Solving Practical Economic Dispatch Problems Using Improved Artificial Bee Colony Method

Belkacem MAHDAD, Kamel Srairi

Статья научная

This paper presents an improved artificial bee colony (IABC) optimization method to solving practical economic dispatch taking into account the nonlinear generator characteristics such as valve-point loading effects. In order to exploit the performance of this new variant based ABC method to solving practical economic dispatch, a new local search mechanism (LSM) associated to the original ABC algorithm; it allows exploiting effectively the promising region to locate the best solution. The proposed approach has been examined and applied to many practical electrical power systems, the 13 generating units, and to the large electrical system with 40 generating units considering valve point loading effects. From the different case studies, it is observed that the results compared with the other recent techniques demonstrate the potential of the proposed approach and show clearly its effectiveness to solve practical and large ED.

Бесплатно

Solving a Class of Non-Smooth Optimal Control Problems

Solving a Class of Non-Smooth Optimal Control Problems

M. H. Noori Skandari, H. R. Erfanian, A.V. Kamyad, M. H. Farahi

Статья научная

In this paper, we first propose a new generalized derivative for non-smooth functions and then we utilize this generalized derivative to convert a class of non-smooth optimal control problem to the corresponding smooth form. In the next step, we apply the discretization method to approximate the obtained smooth problem to the nonlinear programming problem. Finally, by solving the last problem, we obtain an approximate optimal solution for main problem.

Бесплатно

Solving a Linear Programming with Fuzzy Constraint and Objective Coefficients

Solving a Linear Programming with Fuzzy Constraint and Objective Coefficients

Hamid Reza Erfanian, Mohammad Javad Abdi, Sahar Kahrizi

Статья научная

In this paper, we consider a method for solving a linear programming problem with fuzzy objective and coefficient matrix, where the fuzzy numbers are supposed to be triangular. By the proposed method, the Decision Maker will have the flexibility of choosing. The solving method is based on the Pareto algorithm, which converts the problem to a weighted-objective linear programming. For more illustration, after discussing the problem and the algorithm, we present an example, which its solutions are independent from the objective weights.

Бесплатно

Solving school bus routing problem using genetic algorithm-based model

Solving school bus routing problem using genetic algorithm-based model

Samuel A. Oluwadare, Iyanu P. Oguntuyi, John C. Nwaiwu

Статья научная

School Bus Routing Problem is an optimization problem which falls under the class of the Vehicle Routing Problem. It involves the use of a fleet of vehicles to efficiently and optimally transport students to and from their schools. To solve this problem, optimal school bus routes are found by minimizing the number of buses, the number of routes and the total distance traversed along all routes. Manual routing of school buses have led to creation of many routes, increased number of buses and several buses navigating the same route, thereby incurring more cost. One of such methods used in solving school bus routing problems is meta-heuristic method which has proven better results in terms of optimal solution and reduced time complexity. In this study, Genetic algorithm is utilized to solve the school bus routing problem because of its simplicity and ability to generate many possible solutions. The algorithm is implemented in C# programming language and tested using secondary data obtained from Ondo State Free-School Bus Shuttle Scheme, Akure, Nigeria. The result shows that of all four nodes (bus stops) used in performance evaluation, Alakure to Oke-Aro junction bus stop presents as the best route which covers a total of 69 nodes with a total distance of 34.5km. This shows that there can be less number of buses in use and reduced number of routes in which the buses are assigned.

Бесплатно

Some Results of Intuitionistic Fuzzy Soft Matrix

Some Results of Intuitionistic Fuzzy Soft Matrix

Mamoni Dhar

Статья научная

The purpose of this article is to consider the notions of intuitionistic fuzzy soft matrices and some basic results. This work deals particularly with the definition of transpose of intuitionistic fuzzy soft matrices and then some properties of transpose of intuitionistic fuzzy soft matrices are studied. After that symmetric intuitionistic fuzzy matrices are also defined and some properties are discussed. Numerical examples are provided to make the concept clear.

Бесплатно

Sorted r-Train: an improved dynamic data structure for handling big data

Sorted r-Train: an improved dynamic data structure for handling big data

Mohd Abdul Ahad, Ranjit Biswas

Статья научная

In today’s computing era, the world is dealing with big data which has enormously expanded in terms of 7Vs (volume, velocity, veracity, variability, value, variety, visualization). The conventional data structures like arrays, linked list, trees, graphs etc. are not able to effectively handle these big data. Therefore new and dynamic tools and techniques which can handle these big data effectively and efficiently are the need of the hour. This paper aims to provide an enhancement to the recently proposed “dynamic” data structure “r-Train” for handling big data. With the emergence of the “Internet of Things (IoT)” technology, real-time handling of requests and services are pivotal. Therefore it becomes necessary to promptly fetch the required data as and when required from the enormous piles of big data that are generally located at different sites. Therefore an effective searching and retrieval mechanism must be provided that can handle these challenging issues. The primary aim of this proposed refinement is to provide an effective means of insertion, deletion and searching techniques to efficiently handle the big data.

Бесплатно

Source Code Author Attribution Using Author's Programming Style and Code Smells

Source Code Author Attribution Using Author's Programming Style and Code Smells

Muqaddas Gull, Tehseen Zia, Muhammad Ilyas

Статья научная

Source code is an intellectual property and using it without author's permission is a violation of property right. Source code authorship attribution is vital for dealing with software theft, copyright issues and piracies. Characterizing author's signature for identifying their footprints is the core task of authorship attribution. Different aspects of source code have been considered for characterizing signatures including author's coding style and programming structure, etc. The objective of this research is to explore another trait of authors' coding behavior for personifying their footprints. The main question that we want to address is that "can code smells are useful for characterizing authors' signatures? A machine learning based methodology is described not only to address the question but also for designing a system. Two different aspects of source code are considered for its representation into features: author's style and code smells. The author's style related feature representation is used as baseline. Results have shown that code smell can improves the authorship attribution.

Бесплатно

Speed up linear scan in high-dimensions by sorting one-dimensional projections

Speed up linear scan in high-dimensions by sorting one-dimensional projections

Jiangtao Cui, Bin Xiao, Gengdai Liu, Lian Jiang

Статья научная

High-dimensional indexing is a pervasive challenge faced in multimedia retrieval. Existing indexing methods applying linear scan strategy, such as VA-file and its variations, are still efficient when the dimensionality is high. In this paper, we propose a new access idea implemented on linear scan based methods to speed up the nearest-neighbor queries. The idea is to map high-dimensional points into two kinds of one-dimensional values using projection and distance computation. The projection values on the line determined by the first Principal Component are sorted and indexed using a B+-tree, and the distances of each point to a reference point are also embedded into leaf node of the B+-tree. When performing nearest neighbor search, the Partial Distortion Searching and triangular inequality are employed to prune search space. In the new search algorithm, only a small portion of data points need to be linearly accessed by computing the bounded distance on the one-dimensional line, which can reduce the I/O and processor time dramatically. Experiment results on large image databases show that the new access method provides a faster search speed than existing high-dimensional index methods.

Бесплатно

Spiking neural network and bull genetic algorithm for active vibration control

Spiking neural network and bull genetic algorithm for active vibration control

Medhat H. A. Awadalla

Статья научная

Systems with flexible structures display vibration as a characteristic property. However, when exposed to disturbing forces, then the component and/or structural nature of such systems are damaged. Therefore, this paper proposes two heuristics approaches to reduce the unwanted structural response delivered due to the external excitation; namely, bull genetic algorithm and spiking neural network. The bull genetic algorithm is based on a new selection property inherited from the bull concept. On the other hand, spiking neural network possess more than one synaptic terminal between each neural network layer and each synaptic terminal is modelled with a different period of delay. Extensive simulations have been conducted using simulated platform of a flexible beam vibration. To validate the proposed approaches, we performed a qualitative comparison with other related approaches such as traditional genetic algorithm, general regression neural network, bees algorithm, and adaptive neuro-fuzzy inference system. Based on the obtained results, it is found that the proposed approaches have outperformed other approaches, while bull genetic algorithm has a 5.2% performance improvement over spiking neural network.

Бесплатно

Stability Analysis and Evaluation of Soil Cave Foundation under the role of Groundwater in Karst Area

Stability Analysis and Evaluation of Soil Cave Foundation under the role of Groundwater in Karst Area

E’chuan Yan, Jiangtao Cheng, Li Liu

Статья научная

Soil cave foundation is a common type in the soil foundation in karst area, the stability of the foundation will be directly affected by the soil cave collapse destruction. Currently, the stability evaluation of soil cave foundation is mostly focus on the quantitative evaluation, such as the collapse mechanism and prevention, while the qualitative assessment is rare. Based on the plastoelasticity theory, firstly analyze the stress state of the soil cave wallsurrounding body in the foundation, distinguish the stress concentration influence area, then improve the soil cave foundation stability computation model by using Molecoulomb strength criterion, finally, take a soil cave foundation stability evaluation as the example in Tongren area, Guizhou, confirming the feasibility and reliability of the improvement model. The influence of the foundation bed size, buried depth, soil cave shape and groundwater level depth was further studied, which reveals the mechanism of the soil cave collapse destruction. And the research indicated that the improved model is feasible, when the foundation bed size is smaller, the buried depth is shallower, the hole shape is more spiky and the groundwater level depth is shallower, the soil cave stability coefficient will be bigger, which is more advantageous to the stability, and the influence of groundwater level depth is more sensitive to the soil cave stability, once the groundwater level depth dropped a little, the stable soil cave will become into failure and instability. Therefore, the quantitative evaluation should be paid more attention in soil cave foundation stability evaluation, particularly under the ground water environment, simultaneously, the calculation results, like soil cave foundation maximum size, the critical buried depth, the maximum water level buried depth, have the strong directive function to the soil cave foundation treatment and design.

Бесплатно

Static Security Enhancement and Loss Minimization Using Simulated Annealing

Static Security Enhancement and Loss Minimization Using Simulated Annealing

A.Y. Abdelaziz, S. F. Mekhamer, M. A. L. Badr, H. M. Khattab

Статья научная

This paper presents a developed algorithm for optimal placement of thyristor controlled series capacitors (TCSC’s) for enhancing the power system static security and minimizing the system overall power loss. Placing TCSC’s at selected branches requires analysis of the system behavior under all possible contingencies. A selective procedure to determine the locations and settings of the thyristor controlled series capacitors is presented. The locations are determined by evaluating contingency sensitivity index (CSI) for a given power system branch for a given number of contingencies. This criterion is then used to develop branches prioritizing index in order to rank the system branches possible for placement of the thyristor controlled series capacitors. Optimal settings of TCSC’s are determined by the optimization technique of simulated annealing (SA), where settings are chosen to minimize the overall power system losses. The goal of the developed methodology is to enhance power system static security by alleviating/eliminating overloads on the transmission lines and maintaining the voltages at all load buses within their specified limits through the optimal placement and setting of TCSC’s under single and double line outage network contingencies. The proposed algorithm is examined using different IEEE standard test systems to shown its superiority in enhancing the system static security and minimizing the system losses.

Бесплатно

Static Timing Analysis of Different SRAM Controllers

Static Timing Analysis of Different SRAM Controllers

Jabin Sultana, S.M. Shamsul Alam

Статья научная

Timing-critical path analysis is one of the most significant terms for the VLSI designer. For the formal verification of any kinds of digital chip, static timing analysis (STA) plays a vital role to check the potentiality and viability of the design procedures. This indicates the timing status between setup and holding times required with respect to the active edge of the clock. STA can also be used to identify time sensitive paths, simulate path delays, and assess Register transfer level (RTL) dependability. Four types of Static Random Access Memory (SRAM) controllers in this paper are used to handle with the complexities of digital circuit timing analysis at the logic level. Different STA parameters such as slack, clock skew, data latency, and multiple clock frequencies are investigated here in their node-to-node path analysis for diverse SRAM controllers. Using phase lock loop (ALTPLL), single clock and dual clock are used to get the response of these controllers. For four SRAM controllers, the timing analysis shows that no data violation exists for single and dual clock with 50 MHz and 100 MHz frequencies. Result also shows that the slack for 100MHz is greater than that of 50MHz. Moreover, the clock skew value in our proposed design is lower than in the other three controllers because number of paths, number of states are reduced, and the slack value is higher than in 1st and 2nd controllers. In timing path analysis, slack time determines that the design is working at the desired frequency. Although 100MHz is faster than 50MHz, our proposed SRAM controller meets the timing requirements for 100MHz including the reduction of node to node data delay. Due to this reason, the proposed controller performs well compared to others in terms slack and clock skew.

Бесплатно

Журнал