cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kota yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
Indonesian Journal of Electrical Engineering and Computer Science
Published by Institute of Advanced Engineering and Science
ISSN : 25024752     EISSN : 25024760     DOI : -
Core Subject :
Arjuna Subject : -
Articles 9,199 Documents
 112   113   114   115   116 
An Efficient Framework to Improve QoS of CSP using Enhanced Minimal Resource Optimization based Scheduling Algorithm Ravi Mahadevan; Neelamegam Anbazhagan
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 3: December 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i3.pp1179-1186

Abstract

Online Nowadays, the enterprises & individuals are contributing their workloads on cloud service providers which are going to increase on daily basis. There are   large amount CSP are available to offer virtualized and dynamic resource on pay and use basis. However, there are almost CSP failed to maintain quality of service (QOS) and minimal resource optimization. Some of the existing approaches are highly dedicated on scheduling policy but, it does not considered reliable services with optimized QOS. To offer best solution of above problem, the framework proposes Enhanced Minimal Resource Optimization based Scheduling Algorithm to minimize the resources and maintain the QOS.  The method avoids delay in Request-Response model in cloud environment. To avoid overload for resource allocation, the proposed design utilized optimized scheduling policy.  Proposed mechanisms utilized optimized service brokering policy to reduce the delay response in cloud environment. The framework also help cloud user to prefer best CSP according to their prior services. The method offers rising trend of resource based structure to reduce the placement churn extensively. Proposed system utilized efficient scheduling policy to transmit data request to CSP with minimal data processing time. The entire utilization is to improve the QOS of cloud service provider in the features of multi-dimensional resource. Based on experimental evaluations, proposed technique improves the CPT (Computation Processing Time) 301.72 milliseconds, BU (Bandwidth Utilization) 20 Mbps, CPUU (CPU Utilization) 5% & MRU (Memory Resource Utilization) 3% on given input parameters compare than existing methodology.
Energy Harvesting Device Based on Spatial Electric Field in Substations Hongwei Li; Ganrong Peng
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 6: June 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i6.pp4771-4777

Abstract

It is rich in electric field energy in high voltage substations while it is hardly collected and utilized. A novel energy harvesting device based on spatial electric field is presented in this paper, which is composed of capacitive energy collector and conditioning circuit. A simulation model of the energy collector is established to study the relationship between output voltage and its structural parameters and is verified by no-load tests. There are some restraining factors such as output voltage unstable in the traditional conditioning circuit. A new conditioning circuit is designed to overcome the problems and this new circuit is more effectively. This paper designs a new device to harvest the electric field energy within substations and it can provide broad potential use in the future.
A Framework of Fingerprint Scaling Chunxiao Ren; Jianmin Guo; Dong Qiu; Guolei Chang; Yuxiao Wu
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 3: March 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Fingerprint scaling refers to the adjustment of fingerprint images to solve the problem of sensor interoperability. In this paper, we present an innovative framework of fingerprint scaling with minimum modification to existing systems. For the purpose of facilitating system configuration, we have developed a series of scaling methods, including scaling factors, graph- and template-based scaling methods. In graph-based scaling methods, we have explored the application of various technologies in estimation of the average inter-ridge distance. In template-based scaling methods, we have developed an estimation method using Delaunay triangulation algorithm. The experiments show that the performance achieved by using this framework is better than that of original system. With a scaling module, the average EER in our experiments drops from 27.78% to 13.89%. DOI: http://dx.doi.org/10.11591/telkomnika.v11i3.2304
Process Mining: Measuring Key Performance Indicator Container Dwell Time Bambang Jokonowo; Riyanarto Sarno; Siti Rochimah; Bagus Priambodo
Indonesian Journal of Electrical Engineering and Computer Science Vol 16, No 1: October 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v16.i1.pp401-411

Abstract

The issues measures duration of stay the container logistic processes at ports in developing countries is often a major problem. Therefore, a knowledge process discovery, i.e., Heuristics Miner and Fuzzy Miner, can be used to discover the insight of process by creating a process model. The container import dwell time (DT) processes can be modeled based on the event log data sources are extracted from the terminal operating system (TOS). The L* life-cycle model is used to perform the process behavior analysis steps. The results of analysis and verification show that the container import DT processes have a median duration of 5.5 days and a mean duration of 6.07 days.
Toward semantic similarity measure between concepts in an ontology Suwan Tongphu; Boontawee Suntisrivaraporn; Pakinee Aimmanee
Indonesian Journal of Electrical Engineering and Computer Science Vol 14, No 3: June 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v14.i3.pp1356-1372

Abstract

A similarity measure is one classical problem in Description Logic which aims at identifying the similarity between concepts in an ontology. Finding a hierarchy distance among concepts in an ontology is one popular technique. However, one major drawback of such a technique is that it usually ignores a concept definition analysis. This work introduces a new method for similarity measure. The proposed system semantically analyzes structures of two concept descriptions and then computes the similarity score based on the number of shared features. The efficiency of the proposed algorithm is measured by means of the satisfaction of desirable properties and intensive experiments on the Snomed ct ontology.
Query Processing for Time Efficient Data Retrieval Muhammad Qasim Memon; Jingsha He; Aasma Memon; Khurram Gulzar Rana; Muhammad Salman Pathan
Indonesian Journal of Electrical Engineering and Computer Science Vol 9, No 3: March 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v9.i3.pp784-788

Abstract

In database management system (DBMS) retrieving data through structure query language is an essential aspect to find better execution plan for performance. In this paper, we incorporated database objects to optimize query execution time and its cost by vanishing poorly SQL statements. We proposed a method of evolving and inserting database constraints as database objects embedded with queries either to add them for the sake of transactions required by user to detect those queries for the betterment of performance. We took analysis on several databases while processing queries itself and assimilate real time database workload with the bunch of transactions are invoked in comparison with tuning approaches. These database objects are coded in procedural language environment pertaining rules to make it worth and are merged into queries offering improved execution plan.
Achieving robust global bandwidth along with bypassing geo-restriction for internet users Gazi Zahirul Islam; Aman Ullah Juman; Al- Nahian Bin Emran; Md. Abbas Ali Khan; Md. Fokhray Hossain; Md. Tarek Habib
Indonesian Journal of Electrical Engineering and Computer Science Vol 18, No 1: April 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v18.i1.pp112-123

Abstract

Not all Internet Service Providers provide a sufficient amount of bandwidth to their users. Although the amount of local bandwidth is reasonable, global bandwidth is not satisfactory at all. Based on bandwidth allocation, location and price; service providers capped their users’ global bandwidth i.e., reducing global internet speed. As a consequence, we observe severe global bandwidth limitation among Internet users. In this article, we implement a flexible and pragmatic solution for Internet users to bypass global bandwidth restriction. To achieve robust global bandwidth, we utilize a combination of communication technologies and devices namely, Internet Exchange Point, Virtual Private Network, chain VPN technology etc. In this project, we show that internet speed of international route i.e., global bandwidth can enhance significantly if there are multiple ISPs use a common IXP and at least one of those ISPs provides pleasant global bandwidth. Usually, regional ISPs use a common IXP to route their local traffic using local bandwidth within the region without wasting global bandwidth. We show that using our proposed method global internet speed of a user can raise several times effectively utilizing assigned local bandwidth. In addition, we also implement a geo-restriction bypassing technique integrating an offshore ISP with local ISP using VPN. Thus, we enjoy tremendous Internet speed along with unrestricted access to the websites.
Summarize of Electric Vehicle Electric System Fault and Fault-tolerant Technology Zhang Liwei; Huang Xianjin; Yang Yannan; Xu Chen; Liu Jie
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 2: February 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Electric vehicle drive system is a multi-variable function, running environment complexed and changeable system, so it’s failure form is complicated. In this paper, according to the fault happens in different position, establish vehicle fault table, analyze the consequences of failure may cause and the causes of failure. Combined with hardware limitations, and the maximum guarantee system performance requirements, passive software redundancy fault-tolerant strategy is put forward, give an example to analysis the pros and cons of this method. DOI : http://dx.doi.org/10.11591/telkomnika.v12i2.4410
Mitigation of SSR Oscillations in Series Compensated Line using LCAP Subsynchronous Damping Controller Sanjiv Kumar; Narendra Kumar
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 12: December 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Subsynchronous Resonance (SSR) is a growing problem in power systems having series compensated transmission lines. Subsynchronous resonance with low frequency that surpasses aggregate fatigue threshold of the generator shaft frequently could significantly reduce the shaft service life, which is a new problem that emerges in recent years. Flexible AC transmission systems (FACTS) controllers are widely applied to alleviate subsynchronous resonance. A line current and active power (LCAP) supplementary subsynchronous damping controller (SSDC) is proposed to damp subsynchronous resonance caused by series capacitors. Both eigenvalue investigation and time-domain simulation results verify that the proposed control strategy can effectively damping power system oscillations of the power system with SVS and SSDC. Time domain simulations using the nonlinear system model are also carried out to demonstrate the effectiveness of the proposed damping controller. The recommended control approach has been accumulated with the IEEE first benchmark model for SSR study.  The analysis indicates that SVS using the proposed control strategy has better alleviation effect and output characteristics. All the simulations are validated by using MATLAB/Simulink environment. http://dx.doi.org/10.11591/telkomnika.v12i12.6726 
On Sparse Compression Complexity of Speech Signals Ahmed Omara; Alaa Hefnawy; Abdelhalim Zekry
Indonesian Journal of Electrical Engineering and Computer Science Vol 1, No 2: February 2016
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v1.i2.pp329-340

Abstract

In this paper, we have addressed the issue of the sparse compression complexity for the speech signals. First of all, this work illustrated the effect of the signal length on the complexity levels of Matching Pursuit (MP) and Orthogonal Matching Pursuit (OMP) algorithms. Also, this paper introduced a study of possibility to reduce that complexity by exploiting the shared atoms among the contiguous speech compressions. By comparing the shared atoms levels and a threshold level induced by an analytic model based on the both the central and non-central hyper-geometric distributions, we proved the ability of the shared atoms criterion to detect if there is biasing towards a subspace of atoms or not, and to decide if the biasing occurs due to the redundancy in the dictionary of atoms, or due to the redundancy in the signal itself. Moreover, we suggested a subspace bias-based approaches for complexity reduction called "Atoms Reuse" and "Active Cluster". Both methods exploits the higher levels of the shared atoms to reduce the compression complexity by reducing the search space during the pursuit iterations.

Page 114 of 920 | Total Record : 9199

 112   113   114   115   116 

Filter by Year

2012 2026


Reset
Filter By Issues
All Issue Vol 41, No 3: March 2026 Vol 41, No 2: February 2026 Vol 41, No 1: January 2026 Vol 40, No 3: December 2025 Vol 40, No 2: November 2025 Vol 40, No 1: October 2025 Vol 39, No 3: September 2025 Vol 39, No 2: August 2025 Vol 39, No 1: July 2025 Vol 38, No 3: June 2025 Vol 38, No 2: May 2025 Vol 38, No 1: April 2025 Vol 37, No 3: March 2025 Vol 37, No 2: February 2025 Vol 37, No 1: January 2025 Vol 36, No 3: December 2024 Vol 36, No 2: November 2024 Vol 36, No 1: October 2024 Vol 35, No 3: September 2024 Vol 35, No 2: August 2024 Vol 35, No 1: July 2024 Vol 34, No 3: June 2024 Vol 34, No 2: May 2024 Vol 34, No 1: April 2024 Vol 33, No 3: March 2024 Vol 33, No 2: February 2024 Vol 33, No 1: January 2024 Vol 32, No 3: December 2023 Vol 32, No 1: October 2023 Vol 31, No 3: September 2023 Vol 31, No 2: August 2023 Vol 31, No 1: July 2023 Vol 30, No 3: June 2023 Vol 30, No 2: May 2023 Vol 30, No 1: April 2023 Vol 29, No 3: March 2023 Vol 29, No 2: February 2023 Vol 29, No 1: January 2023 Vol 28, No 3: December 2022 Vol 28, No 2: November 2022 Vol 28, No 1: October 2022 Vol 27, No 3: September 2022 Vol 27, No 2: August 2022 Vol 27, No 1: July 2022 Vol 26, No 3: June 2022 Vol 26, No 2: May 2022 Vol 26, No 1: April 2022 Vol 25, No 3: March 2022 Vol 25, No 2: February 2022 Vol 25, No 1: January 2022 Vol 24, No 3: December 2021 Vol 24, No 2: November 2021 Vol 24, No 1: October 2021 Vol 23, No 3: September 2021 Vol 23, No 2: August 2021 Vol 23, No 1: July 2021 Vol 22, No 3: June 2021 Vol 22, No 2: May 2021 Vol 22, No 1: April 2021 Vol 21, No 3: March 2021 Vol 21, No 2: February 2021 Vol 21, No 1: January 2021 Vol 20, No 3: December 2020 Vol 20, No 2: November 2020 Vol 20, No 1: October 2020 Vol 19, No 3: September 2020 Vol 19, No 2: August 2020 Vol 19, No 1: July 2020 Vol 18, No 3: June 2020 Vol 18, No 2: May 2020 Vol 18, No 1: April 2020 Vol 17, No 3: March 2020 Vol 17, No 2: February 2020 Vol 17, No 1: January 2020 Vol 16, No 3: December 2019 Vol 16, No 2: November 2019 Vol 16, No 1: October 2019 Vol 15, No 3: September 2019 Vol 15, No 2: August 2019 Vol 15, No 1: July 2019 Vol 14, No 3: June 2019 Vol 14, No 2: May 2019 Vol 14, No 1: April 2019 Vol 13, No 3: March 2019 Vol 13, No 2: February 2019 Vol 13, No 1: January 2019 Vol 12, No 3: December 2018 Vol 12, No 2: November 2018 Vol 12, No 1: October 2018 Vol 11, No 3: September 2018 Vol 11, No 2: August 2018 Vol 11, No 1: July 2018 Vol 10, No 3: June 2018 Vol 10, No 2: May 2018 Vol 10, No 1: April 2018 Vol 9, No 3: March 2018 Vol 9, No 2: February 2018 Vol 9, No 1: January 2018 Vol 8, No 3: December 2017 Vol 8, No 2: November 2017 Vol 8, No 1: October 2017 Vol 7, No 3: September 2017 Vol 7, No 2: August 2017 Vol 7, No 1: July 2017 Vol 6, No 3: June 2017 Vol 6, No 2: May 2017 Vol 6, No 1: April 2017 Vol 5, No 3: March 2017 Vol 5, No 2: February 2017 Vol 5, No 1: January 2017 Vol 4, No 3: December 2016 Vol 4, No 2: November 2016 Vol 4, No 1: October 2016 Vol 3, No 3: September 2016 Vol 3, No 2: August 2016 Vol 3, No 1: July 2016 Vol 2, No 3: June 2016 Vol 2, No 2: May 2016 Vol 2, No 1: April 2016 Vol 1, No 3: March 2016 Vol 1, No 2: February 2016 Vol 1, No 1: January 2016 Vol 16, No 3: December 2015 Vol 16, No 2: November 2015 Vol 16, No 1: October 2015 Vol 15, No 3: September 2015 Vol 15, No 2: August 2015 Vol 15, No 1: July 2015 Vol 14, No 3: June 2015 Vol 14, No 2: May 2015 Vol 14, No 1: April 2015 Vol 13, No 3: March 2015 Vol 13, No 2: February 2015 Vol 13, No 1: January 2015 Vol 12, No 12: December 2014 Vol 12, No 11: November 2014 Vol 12, No 10: October 2014 Vol 12, No 9: September 2014 Vol 12, No 8: August 2014 Vol 12, No 7: July 2014 Vol 12, No 6: June 2014 Vol 12, No 5: May 2014 Vol 12, No 4: April 2014 Vol 12, No 3: March 2014 Vol 12, No 2: February 2014 Vol 12, No 1: January 2014 Vol 11, No 12: December 2013 Vol 11, No 11: November 2013 Vol 11, No 10: October 2013 Vol 11, No 9: September 2013 Vol 11, No 8: August 2013 Vol 11, No 7: July 2013 Vol 11, No 6: June 2013 Vol 11, No 5: May 2013 Vol 11, No 4: April 2013 Vol 11, No 3: March 2013 Vol 11, No 2: February 2013 Vol 11, No 1: January 2013 Vol 10, No 8: December 2012 Vol 10, No 7: November 2012 Vol 10, No 6: October 2012 Vol 10, No 5: September 2012 Vol 10, No 4: August 2012 Vol 10, No 3: July 2012 More Issue