Articles

Access the latest knowledge in applied science, electrical engineering, computer science and information technology, education, and health.

Advanced Search
Filter Icon

Filters article

Years

FAQ Arrow
Single Year
Range Year
0
0

Source Title

FAQ Arrow

Authors

FAQ Arrow

29,734 Article Results

A hybrid algorithm to reduce energy consumption management in cloud data centers

10.11591/ijece.v9i1.pp554-561
Mehran Tarahomi , Mohammad Izadi
There are several physical data centers in cloud environment with hundreds or thousands of computers. Virtualization is the key technology to make cloud computing feasible. It separates virtual machines in a way that each of these so-called virtualized machines can be configured on a number of hosts according to the type of user application. It is also possible to dynamically alter the allocated resources of a virtual machine. Different methods of energy saving in data centers can be divided into three general categories: 1) methods based on load balancing of resources; 2) using hardware facilities for scheduling; 3) considering thermal characteristics of the environment. This paper focuses on load balancing methods as they act dynamically because of their dependence on the current behavior of system. By taking a detailed look on previous methods, we provide a hybrid method which enables us to save energy through finding a suitable configuration for virtual machines placement and considering special features of virtual environments for scheduling and balancing dynamic loads by live migration method.
Volume: 9
Issue: 1
Page: 554-561
Publish at: 2019-02-01

Deep learning for pose-invariant face detection in unconstrained environment

10.11591/ijece.v9i1.pp577-584
Shivkaran Ravidas , M. A. Ansari
In the recent past, convolutional neural networks (CNNs) have seen resurgence and have performed extremely well on vision tasks.  Visually the model resembles a series of layers each of which is processed by a function to form a next layer. It is argued that CNN first models the low level features such as edges and joints and then expresses higher level features as a composition of these low level features. The aim of this paper is to detect multi-view faces using deep convolutional neural network (DCNN). Implementation, detection and retrieval of faces will be obtained with the help of direct visual matching technology. Further, the probabilistic measure of the similarity of the face images will be done using Bayesian analysis. Experiment detects faces with ±90 degree out of plane rotations. Fine tuned AlexNet is used to detect pose invariant faces. For this work, we extracted examples of training from AFLW (Annotated Facial Landmarks in the Wild) dataset that involve 21K images with 24K annotations of the face.
Volume: 9
Issue: 1
Page: 577-584
Publish at: 2019-02-01

A modified backward/forward sweep-based method for reconfiguration of unbalanced distribution networks

10.11591/ijece.v9i1.pp85-101
Michel Duran-Quintero , John E. Candelo , Jose Soto-Ortiz
A three-phase unbalanced power flow method can provide a more realistic scenario of how distribution networks operate. The backward/forward sweep-based power flow method (BF-PF) has been used for many years as an important computational tool to solve the power flow for unbalanced and radial power systems. However, some of the few available research tools produce many errors when they are used for network reconfiguration because the topology changesafter multiple switch actions and the nodes are disorganized continually. This paper presents a modifiedBF-PF for three-phase unbalanced radial distribution networks that is capable of arranging the system topology when reconfiguration changes the branch connections. A binary search is used to determine the connections between nodes, allowing the algorithm to avoid those problems when reconfiguration is carried out, regardless of node numbers. Tests are made to verify the usefulness of the proposed algorithm in both the IEEE 13-node test feeder and the 123-node test feeder, converging in every run where constraints are accomplished. This approach can be used easily for a large-scale feeder network reconfiguration. The full version of this modified backward/forward sweep algorithm is available for research at MathWorks.
Volume: 9
Issue: 1
Page: 85-101
Publish at: 2019-02-01

Opinion mining framework using proposed RB-bayes model for text classication

10.11591/ijece.v9i1.pp477-484
Rajni Bhalla , Amandeep Bagga
Information mining is a capable idea with incredible potential to anticipate future patterns and conduct. It alludes to the extraction of concealed information from vast data sets by utilizing procedures like factual examination, machine learning, grouping, neural systems and genetic algorithms. In naive baye’s, there exists a problem of zero likelihood. This paper proposed RB-Bayes method based on baye’s theorem for prediction to remove problem of zero likelihood. We also compare our method with few existing methods i.e. naive baye’s and SVM. We demonstrate that this technique is better than some current techniques and specifically can analyze data sets in better way. At the point when the proposed approach is tried on genuine data-sets, the outcomes got improved accuracy in most cases. RB-Bayes calculation having precision 83.333.
Volume: 9
Issue: 1
Page: 477-484
Publish at: 2019-02-01

Hardware/software co-design for a parallel three-dimensional bresenham’s algorithm

10.11591/ijece.v9i1.pp148-156
Sarmad Ismael , Omar Tareq , Yahya Taher Qassim
Line plotting is the one of the basic operations in the scan conversion. Bresenham’s line drawing algorithm is an efficient and high popular algorithm utilized for this purpose. This algorithm starts from one end-point of the line to the other end-point by calculating one point at each step. As a result, the calculation time for all the points depends on the length of the line thereby the number of the total points presented. In this paper, we developed an approach to speed up the Bresenham algorithm by partitioning each line into number of segments, find the points belong to those segments and drawing them simultaneously to formulate the main line. As a result, the higher number of segments generated, the faster the points are calculated. By employing 32 cores in the Field Programmable Gate Array, a line of length 992 points is formulated in 0.31μs only. The complete system is implemented using Zybo board that contains the Xilinx Zynq-7000 chip (Z-7010).
Volume: 9
Issue: 1
Page: 148-156
Publish at: 2019-02-01

Comparative analysis of the performance of various active queue management techniques to varying wireless network conditions

10.11591/ijece.v9i1.pp359-368
Okokpujie Kennedy , Emmanuel Chukwu , Olamilekan Shobayo , Etinosa Noma-Osaghae , Imhade Okokpujie , Modupe Odusami
This paper demonstrates the robustness of active queue management techniques to varying load, link capacity and propagation delay in a wireless environment. The performances of four standard   controllers used in Transmission Control Protocol/Active Queue Management (TCP/AQM) systems were compared. The active queue management controllers were the Fixed-Parameter Proportional Integral (PI), Random Early Detection (RED), Self-Tuning Regulator (STR) and the Model Predictive Control (MPC). The robustness of the congestion control algorithm of each technique was documented by simulating the varying conditions using MATLAB® and Simulink® software. From the results obtained, the MPC controller gives the best result in terms of response time and controllability in a wireless network with varying link capacity and propagation delay. Thus, the MPC controller is the best bet when adaptive algorithms are to be employed in a wireless network environment. The MPC controller can also be recommended for heterogeneous networks where the network load cannot be estimated.
Volume: 9
Issue: 1
Page: 359-368
Publish at: 2019-02-01

Hardware simulation for exponential blind equal throughput algorithm using system generator

10.11591/ijece.v9i1.pp170-180
Yusmardiah Yusuf , Darmawaty Mohd Ali , Norsuzila Ya’acob
Scheduling mechanism is the process of allocating radio resources to User Equipment (UE) that transmits different flows at the same time. It is performed by the scheduling algorithm implemented in the Long Term Evolution base station, Evolved Node B. Normally, most of the proposed algorithms are not focusing on handling the real-time and non-real-time traffics simultaneously. Thus, UE with bad channel quality may starve due to no resources allocated for quite a long time. To solve the problems, Exponential Blind Equal Throughput (EXP-BET) algorithm is proposed. User with the highest priority metrics is allocated the resources firstly which is calculated using the EXP-BET metric equation. This study investigates the implementation of the EXP-BET scheduling algorithm on the FPGA platform. The metric equation of the EXP-BET is modelled and simulated using System Generator. This design has utilized only 10% of available resources on FPGA. Fixed numbers are used for all the input to the scheduler. The system verification is performed by simulating the hardware co-simulation for the metric value of the EXP-BET metric algorithm. The output from the hardware co-simulation showed that the metric values of EXP-BET produce similar results to the Simulink environment.  Thus, the algorithm is ready for prototyping and Virtex-6 FPGA is chosen as the platform.
Volume: 9
Issue: 1
Page: 170-180
Publish at: 2019-02-01

A novel approach to dynamic profiling of e-customers considering click stream data and online reviews

10.11591/ijece.v9i1.pp602-612
Houda Zaim , Adil Haddi , Mohammed Ramdani
In this paper, we present an approach for mining change in customer’s behavior for the purpose of maintaining robust profiling model over time. Most of previous studies leave important questions unanswered: In developing B2C e-commerce strategies, how do managers implicitly load customer’s profiles based on their satisfaction over the online store characteristics? And: What kind of feedback segments do they have? Our proposed approach does not force customers to explicitly express their preference information over the online service but rather capture their preference from their online activities. The challenge does not only lay in analyzing how customer’s classifier model change and when it does so but also to adapt it to the customer’s click stream data using a new decision tree generation algorithm which takes as inputs new set of variables; categorical, continuous and fuzzy variables. Customer’s online reviews rates are considered as classes. Experiments show that this work performed well in identifying relevant customer’s stream data to judge the chinese e-commerce website “Tmall”. The extracted values of the website’s features are also useful to identifying the satisfaction level when the customer’s rate is not available. 
Volume: 9
Issue: 1
Page: 602-612
Publish at: 2019-02-01

Automated PCB identification and defect-detection system (APIDS)

10.11591/ijece.v9i1.pp297-306
Shams Ur Rehman , Ka Fei Thang , Nai Shyan Lai
Ever growing PCB industry requires automation during manufacturing process to produce defect free products. Machine Vision is widely used as popular means of inspection to find defects in PCBs. However, it is still largely dependent on user input to select algorithm set for the PCB under inspection prior to the beginning of the process. Continuous increase in computation power of computers and image quality of image acquisition devices demands new methods for further automation. This paper proposes a new method to achieve further automation by identifying the type of PCB under inspection prior to begin defect inspection process. Identification of PCB is achieved by using local feature detectors SURF and ORB and using the orientation data acquired to transform the PCB image to the reference image for inspection of defects. A close-loop system is produced as a prototype to reflect the practicality of the idea. A Graphical User Interface was developed using MATLAB to present the proposed system. Test data contained 29 PCBs. Each PCB was tested 5 times for camera acquired images and 3 times for database images. The identification accuracy is 98.66% for database images and 100% for images acquired from the camera. The time taken to detect the model of PCB is recorded and is significantly lower for ORB based identification than SURF based. The system is also a close loop system which detects defects in PCB units. The detection of defects has highest accuracy of 92.3% for best controlled environment scenario. With controlled environment, the system could detect defects in PCB pertaining to smallest of components such as SMDs.
Volume: 9
Issue: 1
Page: 297-306
Publish at: 2019-02-01

ASIC design of low power-delay product carry pre-computation based multiplier

10.11591/ijeecs.v13.i2.pp845-852
Chaitanya CVS , Sundaresan C , P R Venkateswaran
High speed and efficient multipliers are essential components in today’s computational circuits like digital signal processing, algorithms for cryptography and high performance processors. Invariably, almost all processing units will contain hardware multipliers based on some algorithm that fits the application requirement. Tremendous advances in VLSI technology over the past several years resulted in an increased need for high speed multipliers and compelled the designers to go for trade-offs among speed, power consumption and area. Amongst various methods of multiplication, Vedic multipliers are gaining ground due to their expected improvement in performance. A novel multiplier design for high speed VLSI applications using Urdhva-Tiryagbhyam sutra of Vedic Multiplication has been presented in this paper. The proposed architecture modeled using Verilog HDL, simulated using Cadence NCSIM and synthesized using Cadence RTL Compiler with 65nm TSMC library.The proposed multiplier architecture is compared with the existing multipliers and the results show significant improvement in speed and power dissipation.
Volume: 13
Issue: 2
Page: 845-852
Publish at: 2019-02-01

Analyzing bootsrap and foundation font-end frameworks : a comparative study

10.11591/ijece.v9i1.pp713-722
Majida Laaziri , Khaoula Benmoussa , Samira Khoulji , Kerkeb Mohamed Larbi , Abir El Yamami
Most modern web applications use some kind of front-end frameworks for designing and creating content in a faster and more efficient way, which saves valuable time when creating responsive web sites. There are many front-end frameworks that vary enormously in terms of features and benefits, which could make the choice of front-end framework for the developer tricky. In this context, this paper focuses on an effective analysis of two of today's most popular front-end frameworks, Boostrap and Foundation, The results show that our analysis can be beneficial for developers to select the appropriate front end framework to customize their web applications.
Volume: 9
Issue: 1
Page: 713-722
Publish at: 2019-02-01

High speed script execution for GUI automation using computer vision

10.11591/ijece.v9i1.pp231-236
M. Narayana , Raghu Ram Reddy , Hyndavi Reddy N.
Software testing by using open source tool like Selenium windows applications cannot be automated, citrix based applications, flash websites and games. Computer vision based automation tools can be used to automate these kinds of applications.  These automation tools works based on screenshots of GUI objects like button, radio button, text box, images, dropdowns etc. In this paper a prototype of automation tool has been developed which can execute the automation scripts much faster than existing tools like Sikuli, which takes much time to run the Automation scripts. The execution time can be reduced by using this proposed tool.
Volume: 9
Issue: 1
Page: 231-236
Publish at: 2019-02-01

Performance analysis on telecommunication companies in malaysia with TOPSIS model

10.11591/ijeecs.v13.i2.pp744-751
Lam Weng Hoe , Lam Weng Siew , Liew Kah Fai
Emergence of telecommunication companies is springing up due to the high demand from the consumers. The invention of telecommunication has made the world more knowledgeable as information can be transmitted easily. Based on the past studies, telecommunication is not commonly investigated especially in financial management field. Thereore, this study aims to propose a conceptual framework to evaluate, compare and rank the financial performance of the listed telecommunication companies in Malaysia using TOPSIS model. Financial ratios are employed to examine the financial performance of the telecommunication companies. The data of this study consists of DIGI, MAXIS, AXIATA and TM which are listed telecommunication companies in Malaysia stock market. The results of this study show that DIGI achieves the first ranking, followed by MAXIS, AXIATA and TM within the study period of year 2011-2015. This study is significant because it helps to evaluate, compare and rank the financial performance of the listed telecommunication companies in Malaysia with the proposed conceptual framework based on TOPSIS model.
Volume: 13
Issue: 2
Page: 744-751
Publish at: 2019-02-01

A review on various optimization techniques of resource provisioning in cloud computing

10.11591/ijece.v9i1.pp629-634
K. Sumalatha , M. S. Anbarasi
Cloud computing is the provision of IT resources (IaaS) on-demand using a pay as you go model over the internet.It is a broad and deep platform that helps customers builds sophisticated, scalable applications. To get the full benefits, research on a wide range of topics is needed. While resource over-provisioning can cost users more than necessary, resource under provisioning hurts the application performance. The cost effectiveness of cloud computing highly depends on how well the customer can optimize the cost of renting resources (VMs) from cloud providers. The issue of resource provisioning optimization from cloud-consumer potential is a complicated optimization issue, which includes much uncertainty parameters. There is a much research avenue available for solving this problem as it is in the real-world. Here, in this paper we provide details about various optimization techniques for resource provisioning.
Volume: 9
Issue: 1
Page: 629-634
Publish at: 2019-02-01

Efficient energy, cost reduction, and QoS based routing protocol for wireless sensor networks

10.11591/ijece.v9i1.pp496-504
Ghassan Samara , Mohammad Aljaidi
Recent developments and widespread in wireless sensor network have led to many routing protocols, many of these protocols consider the efficiency of energy as the ultimate factor to maximize the WSN lifetime. The quality of Service (QoS) requirements for different applications of wireless sensor networks has posed additional challenges. Imaging and data transmission needs both QoS aware routing and energy to ensure the efficient use of sensors. In this paper, we propose an Efficient, Energy-Aware, Least Cost, (ECQSR) quality of service routing protocol for sensor networks which can run efficiently with best-effort traffic processing. The protocol aims to maximize the lifetime of the network out of balancing energy consumption across multiple nodes, by using the concept of service differentiation, finding lower cost by finding the shortest path using nearest neighbor algorithm (NN), also put certain constraints on the delay of the path for real-time data from where link cost that captures energy nodes reserve, energy of the transmission, error rate and other parameters. The results show that the proposed protocol improves the network lifetime and low power consumption.
Volume: 9
Issue: 1
Page: 496-504
Publish at: 2019-02-01
1 2 3
...
1982 1983
Show 1329 of 1983

Discover Our Library

Embark on a journey through our expansive collection of articles and let curiosity lead your path to innovation.

Explore Now
Library 3D Ilustration