Pub Date : 2014-10-02DOI: 10.1109/ELINFOCOM.2014.6914435
Y. Shi, D. Musicki, Tae Han Kim, T. Song
This paper presents an algorithm for high pulserepetition frequency (HPRF) radar tracking in clutter. A most serious problem with HPRF radar is the range ambiguity. This paper proposes a solution to this problem by using the Gaussian Mixture Model - Integrated Track Splitting (GMM-ITS) algorithm, which also gives out the probability of target existence (PTE) as the track quality measure. This track quality measure is used for false track discrimination in clutter.
{"title":"Gaussian mixture measurement model for high pulse-repetition frequency radar tracking in clutter","authors":"Y. Shi, D. Musicki, Tae Han Kim, T. Song","doi":"10.1109/ELINFOCOM.2014.6914435","DOIUrl":"https://doi.org/10.1109/ELINFOCOM.2014.6914435","url":null,"abstract":"This paper presents an algorithm for high pulserepetition frequency (HPRF) radar tracking in clutter. A most serious problem with HPRF radar is the range ambiguity. This paper proposes a solution to this problem by using the Gaussian Mixture Model - Integrated Track Splitting (GMM-ITS) algorithm, which also gives out the probability of target existence (PTE) as the track quality measure. This track quality measure is used for false track discrimination in clutter.","PeriodicalId":360207,"journal":{"name":"2014 International Conference on Electronics, Information and Communications (ICEIC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131278508","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-10-02DOI: 10.1109/ELINFOCOM.2014.6914414
Muhammad Rizal Khaefi, Dong-Seong Kim
This paper proposes scheme called LIDA-ATR (Learning Intelligent Distribution Agent-Automatic Target Recognition). The main idea of this scheme is LIDA integration with object detection feature for the development of automatic target recognition (ATR) system. By using human inspired cognitive systems of LIDA, LIDA-ATR offers autonomous and intelligent solutions that differ with another ATR approaches. Simulation result performed by using sample data represents equilateral and non-equilateral two dimensional objects. Simulation result shows that the proposed scheme has 91.67 % success ratio to detect sample data that placed less than 45 cm from the sensor.
本文提出了LIDA-ATR (Learning Intelligent Distribution Agent-Automatic Target Recognition)方案。该方案的主要思想是将LIDA与目标检测特征相结合，开发自动目标识别(ATR)系统。通过使用LIDA的人类认知系统，LIDA-ATR提供了与其他ATR方法不同的自主和智能解决方案。使用样本数据进行的仿真结果表示等边和非等边二维物体。仿真结果表明，该方法对距离传感器小于45 cm的样本数据的检测成功率为91.67%。
{"title":"LIDA-ATR for object detection in Automatic Target Recognition system","authors":"Muhammad Rizal Khaefi, Dong-Seong Kim","doi":"10.1109/ELINFOCOM.2014.6914414","DOIUrl":"https://doi.org/10.1109/ELINFOCOM.2014.6914414","url":null,"abstract":"This paper proposes scheme called LIDA-ATR (Learning Intelligent Distribution Agent-Automatic Target Recognition). The main idea of this scheme is LIDA integration with object detection feature for the development of automatic target recognition (ATR) system. By using human inspired cognitive systems of LIDA, LIDA-ATR offers autonomous and intelligent solutions that differ with another ATR approaches. Simulation result performed by using sample data represents equilateral and non-equilateral two dimensional objects. Simulation result shows that the proposed scheme has 91.67 % success ratio to detect sample data that placed less than 45 cm from the sensor.","PeriodicalId":360207,"journal":{"name":"2014 International Conference on Electronics, Information and Communications (ICEIC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131352044","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-10-02DOI: 10.1109/ELINFOCOM.2014.6914403
Seungwon Lee, Seung Hun Kim, W. Ro
Utilization of a core with delay faults by frequency scaling reduces performance degradation in a multicore processor. When the frequency of a delay fault core is decreased, frequencies of the rest cores can be increased within a fixed power budget since the amount of dynamic power is proportional to the clock frequency. We propose two speedup models based on modified Amdahl's law for the frequency scaling of a multicore architecture. From the models, we derive an attainable maximum speedup of a multicore processor with a delay fault core.
{"title":"Multicore speedup models using frequency scaling with fixed power budget","authors":"Seungwon Lee, Seung Hun Kim, W. Ro","doi":"10.1109/ELINFOCOM.2014.6914403","DOIUrl":"https://doi.org/10.1109/ELINFOCOM.2014.6914403","url":null,"abstract":"Utilization of a core with delay faults by frequency scaling reduces performance degradation in a multicore processor. When the frequency of a delay fault core is decreased, frequencies of the rest cores can be increased within a fixed power budget since the amount of dynamic power is proportional to the clock frequency. We propose two speedup models based on modified Amdahl's law for the frequency scaling of a multicore architecture. From the models, we derive an attainable maximum speedup of a multicore processor with a delay fault core.","PeriodicalId":360207,"journal":{"name":"2014 International Conference on Electronics, Information and Communications (ICEIC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131028962","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-10-02DOI: 10.1109/ELINFOCOM.2014.6914386
N. Chong, M. D. Wong, Y. Kho
Catadioptric omnidirectional view sensor has a convenient 360 degree field of view that favours various robotic applications. The distortion nature in omnidirectional view images allows the discovery of a new robust image feature in the form of vertical/central propagating lines. In this paper, we proposed an improvement to the existing vertical line detection algorithm using Haar wavelet transform under integral image environment. Subsequently, a new lightweight descriptor scheme is developed using the same Haar wavelet response that complies with the nature of line features.
{"title":"Vertical line-based descriptor for omnidirectional view image","authors":"N. Chong, M. D. Wong, Y. Kho","doi":"10.1109/ELINFOCOM.2014.6914386","DOIUrl":"https://doi.org/10.1109/ELINFOCOM.2014.6914386","url":null,"abstract":"Catadioptric omnidirectional view sensor has a convenient 360 degree field of view that favours various robotic applications. The distortion nature in omnidirectional view images allows the discovery of a new robust image feature in the form of vertical/central propagating lines. In this paper, we proposed an improvement to the existing vertical line detection algorithm using Haar wavelet transform under integral image environment. Subsequently, a new lightweight descriptor scheme is developed using the same Haar wavelet response that complies with the nature of line features.","PeriodicalId":360207,"journal":{"name":"2014 International Conference on Electronics, Information and Communications (ICEIC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132891577","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-10-02DOI: 10.1109/ELINFOCOM.2014.6914355
Emmanuel C. Manasseh, S. Ohno, Toru Yamamoto, A. Mvuma
Demand-side management (DSM) will play an important role in balancing the energy distribution and demand in future smart grids. Indeed DSM is one of the important functions in a smart grid that allows customers to make informed decisions regarding their energy consumption, and help the energy providers reduce the peak load demand and reshape the load profile [1]-[4]. Achieving effective DSM is crucial to the success of the smart grid. The success of DSM programs mainly depends on how big a portion of the total energy load is controllable. Efficient DSM, promote immediate change of consumption by shifting or reducing load through incentives or pricing mechanisms [3]. In this article, we consider load control in a multiple residence setup, where energy consumption scheduler (ECS) devices in smart meters are employed for DSM. Several residential endusers share the same energy source and each residential user has non-adjustable loads, adjustable loads and a storage device. Residential users utilize ECS deployed inside their smart meters for the adjustable loads as well as charging and discharging of their storage devices. The smart meters with ECS functions interact automatically by running a centralized algorithm to find the optimal energy consumption schedule for each user in order to reduce the total energy cost as well as the peak-to-average-ratio (PAR) in load demands. The objective is to minimize the energy cost in the system as well as PAR. Simulation results demonstrate that our proposed scheme significantly reduces the PAR and the total cost of electricity.
{"title":"Autonomous demand-side optimization with load uncertainty","authors":"Emmanuel C. Manasseh, S. Ohno, Toru Yamamoto, A. Mvuma","doi":"10.1109/ELINFOCOM.2014.6914355","DOIUrl":"https://doi.org/10.1109/ELINFOCOM.2014.6914355","url":null,"abstract":"Demand-side management (DSM) will play an important role in balancing the energy distribution and demand in future smart grids. Indeed DSM is one of the important functions in a smart grid that allows customers to make informed decisions regarding their energy consumption, and help the energy providers reduce the peak load demand and reshape the load profile [1]-[4]. Achieving effective DSM is crucial to the success of the smart grid. The success of DSM programs mainly depends on how big a portion of the total energy load is controllable. Efficient DSM, promote immediate change of consumption by shifting or reducing load through incentives or pricing mechanisms [3]. In this article, we consider load control in a multiple residence setup, where energy consumption scheduler (ECS) devices in smart meters are employed for DSM. Several residential endusers share the same energy source and each residential user has non-adjustable loads, adjustable loads and a storage device. Residential users utilize ECS deployed inside their smart meters for the adjustable loads as well as charging and discharging of their storage devices. The smart meters with ECS functions interact automatically by running a centralized algorithm to find the optimal energy consumption schedule for each user in order to reduce the total energy cost as well as the peak-to-average-ratio (PAR) in load demands. The objective is to minimize the energy cost in the system as well as PAR. Simulation results demonstrate that our proposed scheme significantly reduces the PAR and the total cost of electricity.","PeriodicalId":360207,"journal":{"name":"2014 International Conference on Electronics, Information and Communications (ICEIC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121399228","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-10-02DOI: 10.1109/ELINFOCOM.2014.6914389
A. Azman, S. Z. Ibrahim, Qinggang Meng, E. Edirisinghe
This paper discusses about lips and eyebrows are used to detect driver cognitive distraction by using faceAPI toolkit. A few number of classification algorithms like Support Vector Machine (SVM), Logistic Regression (LR) and Static Bayesian Network (SBN) and Dynamic Bayesian Network (DBN) have been used for accuracy rate comparison.
{"title":"Physiological measurement used in real time experiment to detect driver cognitive distraction","authors":"A. Azman, S. Z. Ibrahim, Qinggang Meng, E. Edirisinghe","doi":"10.1109/ELINFOCOM.2014.6914389","DOIUrl":"https://doi.org/10.1109/ELINFOCOM.2014.6914389","url":null,"abstract":"This paper discusses about lips and eyebrows are used to detect driver cognitive distraction by using faceAPI toolkit. A few number of classification algorithms like Support Vector Machine (SVM), Logistic Regression (LR) and Static Bayesian Network (SBN) and Dynamic Bayesian Network (DBN) have been used for accuracy rate comparison.","PeriodicalId":360207,"journal":{"name":"2014 International Conference on Electronics, Information and Communications (ICEIC)","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124359887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-10-02DOI: 10.1109/ELINFOCOM.2014.6914361
Juho Kim, Seunghak Yu, Sungroh Yoon
Understanding the regulation of gene expression is one of the major research problems in biology. An important part of this problem is to identify the binding sites in DNA for transcription factors. These binding sites are called motifs. The performance of de novo motif discovery algorithms is limited. To address the issue, ensemble methods have been proposed in order to enhance the prediction accuracy by exploiting the information obtained from multiple algorithms. This paper reviews the latest developments of integrated algorithms in DNA motif finding.
{"title":"Ensemble algorithms for DNA motif finding","authors":"Juho Kim, Seunghak Yu, Sungroh Yoon","doi":"10.1109/ELINFOCOM.2014.6914361","DOIUrl":"https://doi.org/10.1109/ELINFOCOM.2014.6914361","url":null,"abstract":"Understanding the regulation of gene expression is one of the major research problems in biology. An important part of this problem is to identify the binding sites in DNA for transcription factors. These binding sites are called motifs. The performance of de novo motif discovery algorithms is limited. To address the issue, ensemble methods have been proposed in order to enhance the prediction accuracy by exploiting the information obtained from multiple algorithms. This paper reviews the latest developments of integrated algorithms in DNA motif finding.","PeriodicalId":360207,"journal":{"name":"2014 International Conference on Electronics, Information and Communications (ICEIC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125467797","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-10-02DOI: 10.1109/ELINFOCOM.2014.6914424
Bo-Kyeong Kim, Chang-Jun Yeo, Dong-Ho Lee
A NAND flash SSD has been widely used as a storage device because of its fast access speed and low power consumption. It inherits distinctive features such as no in-place update because it consists of NAND flash arrays. When implementing a B-tree on flash SSDs, the performance degradation occurs due to intensive updates in the same node. In this paper, we propose a B-tree employing a cascade memory node on NAND flash SSDs in order to reduce intensive overwrites. Our B-tree keeps the modified data so as to delay write operations and performs the flushing of memory node in batch process. Through the experiment, we show the superiority of our B-tree compared to related techniques.
{"title":"A B-tree employing a cascade memory node on NAND flash SSDs","authors":"Bo-Kyeong Kim, Chang-Jun Yeo, Dong-Ho Lee","doi":"10.1109/ELINFOCOM.2014.6914424","DOIUrl":"https://doi.org/10.1109/ELINFOCOM.2014.6914424","url":null,"abstract":"A NAND flash SSD has been widely used as a storage device because of its fast access speed and low power consumption. It inherits distinctive features such as no in-place update because it consists of NAND flash arrays. When implementing a B-tree on flash SSDs, the performance degradation occurs due to intensive updates in the same node. In this paper, we propose a B-tree employing a cascade memory node on NAND flash SSDs in order to reduce intensive overwrites. Our B-tree keeps the modified data so as to delay write operations and performs the flushing of memory node in batch process. Through the experiment, we show the superiority of our B-tree compared to related techniques.","PeriodicalId":360207,"journal":{"name":"2014 International Conference on Electronics, Information and Communications (ICEIC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129495628","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-01-01DOI: 10.1109/ELINFOCOM.2014.6914365
Y. K. Lee, A. Teoh
Gabor-based region covariance matrices (GRCM) or known as tensor are a powerful face image descriptor and have shown promising result in face recognition. The GRCM lie on tensor manifold is inherently non-Euclidean. As such the distance measure on tensor manifold should take the geometry characteristic of the curvature into account. Presently, Affine Invariant Riemannian Metric is the most popular geodesic distance used in literature despite its heavy computation load. This paper studies several alternative distance measures and investigate their tradeoff between performance and computation time.
{"title":"A study on distance measures of tensor manifold for face recognition","authors":"Y. K. Lee, A. Teoh","doi":"10.1109/ELINFOCOM.2014.6914365","DOIUrl":"https://doi.org/10.1109/ELINFOCOM.2014.6914365","url":null,"abstract":"Gabor-based region covariance matrices (GRCM) or known as tensor are a powerful face image descriptor and have shown promising result in face recognition. The GRCM lie on tensor manifold is inherently non-Euclidean. As such the distance measure on tensor manifold should take the geometry characteristic of the curvature into account. Presently, Affine Invariant Riemannian Metric is the most popular geodesic distance used in literature despite its heavy computation load. This paper studies several alternative distance measures and investigate their tradeoff between performance and computation time.","PeriodicalId":360207,"journal":{"name":"2014 International Conference on Electronics, Information and Communications (ICEIC)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124567708","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/ELINFOCOM.2014.6914417
Patrachart Komolkiti, Katan Vattanaviboon, C. Aswakul
In cognitive radio network, transmission power must be carefully controlled to maximize the channel usage. This paper investigates the relationship of transmission power among primary and secondary users under the game theory framework. Both cooperative and non-cooperative games are considered. Particularly, two variations of cooperative games are formulated, differed by the total utility functions. In all cases, QoS protection of the primary users is embedded in the utility functions. The results show the existence of Nash equilibrium in each case, as well as the trade-off among the total capacity, power consumption, and fairness.
{"title":"Cooperative and non-cooperative power control games in downlink cognitive radio network with primary user protection","authors":"Patrachart Komolkiti, Katan Vattanaviboon, C. Aswakul","doi":"10.1109/ELINFOCOM.2014.6914417","DOIUrl":"https://doi.org/10.1109/ELINFOCOM.2014.6914417","url":null,"abstract":"In cognitive radio network, transmission power must be carefully controlled to maximize the channel usage. This paper investigates the relationship of transmission power among primary and secondary users under the game theory framework. Both cooperative and non-cooperative games are considered. Particularly, two variations of cooperative games are formulated, differed by the total utility functions. In all cases, QoS protection of the primary users is embedded in the utility functions. The results show the existence of Nash equilibrium in each case, as well as the trade-off among the total capacity, power consumption, and fairness.","PeriodicalId":360207,"journal":{"name":"2014 International Conference on Electronics, Information and Communications (ICEIC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122953568","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：