Integrated generalized zero-shot learning for fine-grained classification
- Shermin, Tasfia, Teng, Shyh, Sohel, Ferdous, Murshed, Manzur, Lu, Guojun
- Authors: Shermin, Tasfia , Teng, Shyh , Sohel, Ferdous , Murshed, Manzur , Lu, Guojun
- Date: 2022
- Type: Text , Journal article
- Relation: Pattern Recognition Vol. 122, no. (2022), p.
- Full Text:
- Reviewed:
- Description: Embedding learning (EL) and feature synthesizing (FS) are two of the popular categories of fine-grained GZSL methods. EL or FS using global features cannot discriminate fine details in the absence of local features. On the other hand, EL or FS methods exploiting local features either neglect direct attribute guidance or global information. Consequently, neither method performs well. In this paper, we propose to explore global and direct attribute-supervised local visual features for both EL and FS categories in an integrated manner for fine-grained GZSL. The proposed integrated network has an EL sub-network and a FS sub-network. Consequently, the proposed integrated network can be tested in two ways. We propose a novel two-step dense attention mechanism to discover attribute-guided local visual features. We introduce new mutual learning between the sub-networks to exploit mutually beneficial information for optimization. Moreover, we propose to compute source-target class similarity based on mutual information and transfer-learn the target classes to reduce bias towards the source domain during testing. We demonstrate that our proposed method outperforms contemporary methods on benchmark datasets. © 2021 Elsevier Ltd
- Authors: Shermin, Tasfia , Teng, Shyh , Sohel, Ferdous , Murshed, Manzur , Lu, Guojun
- Date: 2022
- Type: Text , Journal article
- Relation: Pattern Recognition Vol. 122, no. (2022), p.
- Full Text:
- Reviewed:
- Description: Embedding learning (EL) and feature synthesizing (FS) are two of the popular categories of fine-grained GZSL methods. EL or FS using global features cannot discriminate fine details in the absence of local features. On the other hand, EL or FS methods exploiting local features either neglect direct attribute guidance or global information. Consequently, neither method performs well. In this paper, we propose to explore global and direct attribute-supervised local visual features for both EL and FS categories in an integrated manner for fine-grained GZSL. The proposed integrated network has an EL sub-network and a FS sub-network. Consequently, the proposed integrated network can be tested in two ways. We propose a novel two-step dense attention mechanism to discover attribute-guided local visual features. We introduce new mutual learning between the sub-networks to exploit mutually beneficial information for optimization. Moreover, we propose to compute source-target class similarity based on mutual information and transfer-learn the target classes to reduce bias towards the source domain during testing. We demonstrate that our proposed method outperforms contemporary methods on benchmark datasets. © 2021 Elsevier Ltd
A novel OFDM format and a machine learning based dimming control for lifi
- Nowrin, Itisha, Mondal, M., Islam, Rashed, Kamruzzaman, Joarder
- Authors: Nowrin, Itisha , Mondal, M. , Islam, Rashed , Kamruzzaman, Joarder
- Date: 2021
- Type: Text , Journal article
- Relation: Electronics (Switzerland) Vol. 10, no. 17 (2021), p.
- Full Text:
- Reviewed:
- Description: This paper proposes a new hybrid orthogonal frequency division multiplexing (OFDM) form termed as DC‐biased pulse amplitude modulated optical OFDM (DPO‐OFDM) by combining the ideas of the existing DC‐biased optical OFDM (DCO‐OFDM) and pulse amplitude modulated discrete multitone (PAM‐DMT). The analysis indicates that the required DC‐bias for DPO‐OFDM-based light fidelity (LiFi) depends on the dimming level and the components of the DPO‐OFDM. The bit error rate (BER) performance and dimming flexibility of the DPO‐OFDM and existing OFDM schemes are evaluated using MATLAB tools. The results show that the proposed DPO‐OFDM is power efficient and has a wide dimming range. Furthermore, a switching algorithm is introduced for LiFi, where the individual components of the hybrid OFDM are switched according to a target dimming level. Next, machine learning algorithms are used for the first time to find the appropriate proportions of the hybrid OFDM components. It is shown that polynomial regression of degree 4 can reliably predict the constellation size of the DCO‐OFDM component of DPO‐OFDM for a given constellation size of PAM‐DMT. With the component switching and the machine learning algorithms, DPO‐OFDM‐based LiFi is power efficient at a wide dimming range. © 2021 by the authors. Licensee MDPI, Basel, Switzerland.
- Authors: Nowrin, Itisha , Mondal, M. , Islam, Rashed , Kamruzzaman, Joarder
- Date: 2021
- Type: Text , Journal article
- Relation: Electronics (Switzerland) Vol. 10, no. 17 (2021), p.
- Full Text:
- Reviewed:
- Description: This paper proposes a new hybrid orthogonal frequency division multiplexing (OFDM) form termed as DC‐biased pulse amplitude modulated optical OFDM (DPO‐OFDM) by combining the ideas of the existing DC‐biased optical OFDM (DCO‐OFDM) and pulse amplitude modulated discrete multitone (PAM‐DMT). The analysis indicates that the required DC‐bias for DPO‐OFDM-based light fidelity (LiFi) depends on the dimming level and the components of the DPO‐OFDM. The bit error rate (BER) performance and dimming flexibility of the DPO‐OFDM and existing OFDM schemes are evaluated using MATLAB tools. The results show that the proposed DPO‐OFDM is power efficient and has a wide dimming range. Furthermore, a switching algorithm is introduced for LiFi, where the individual components of the hybrid OFDM are switched according to a target dimming level. Next, machine learning algorithms are used for the first time to find the appropriate proportions of the hybrid OFDM components. It is shown that polynomial regression of degree 4 can reliably predict the constellation size of the DCO‐OFDM component of DPO‐OFDM for a given constellation size of PAM‐DMT. With the component switching and the machine learning algorithms, DPO‐OFDM‐based LiFi is power efficient at a wide dimming range. © 2021 by the authors. Licensee MDPI, Basel, Switzerland.
ADMM-based adaptive sampling strategy for nonholonomic mobile robotic sensor networks
- Le, Viet-Anh, Nguyen, Linh, Nghiem, Truong
- Authors: Le, Viet-Anh , Nguyen, Linh , Nghiem, Truong
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Sensors Journal Vol. 21, no. 13 (2021), p. 15369-15378
- Full Text:
- Reviewed:
- Description: This paper discusses the adaptive sampling problem in a nonholonomic mobile robotic sensor network for efficiently monitoring a spatial field. It is proposed to employ Gaussian process to model a spatial phenomenon and predict it at unmeasured positions, which enables the sampling optimization problem to be formulated by the use of the log determinant of a predicted covariance matrix at next sampling locations. The control, movement and nonholonomic dynamics constraints of the mobile sensors are also considered in the adaptive sampling optimization problem. In order to tackle the nonlinearity and nonconvexity of the objective function in the optimization problem we first exploit the linearized alternating direction method of multipliers (L-ADMM) method that can effectively simplify the objective function, though it is computationally expensive since a nonconvex problem needs to be solved exactly in each iteration. We then propose a novel approach called the successive convexified ADMM (SC-ADMM) that sequentially convexify the nonlinear dynamic constraints so that the original optimization problem can be split into convex subproblems. It is noted that both the L-ADMM algorithm and our SC-ADMM approach can solve the sampling optimization problem in either a centralized or a distributed manner. We validated the proposed approaches in 1000 experiments in a synthetic environment with a real-world dataset, where the obtained results suggest that both the L-ADMM and SC-ADMM techniques can provide good accuracy for the monitoring purpose. However, our proposed SC-ADMM approach computationally outperforms the L-ADMM counterpart, demonstrating its better practicality. © 2001-2012 IEEE.
- Authors: Le, Viet-Anh , Nguyen, Linh , Nghiem, Truong
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Sensors Journal Vol. 21, no. 13 (2021), p. 15369-15378
- Full Text:
- Reviewed:
- Description: This paper discusses the adaptive sampling problem in a nonholonomic mobile robotic sensor network for efficiently monitoring a spatial field. It is proposed to employ Gaussian process to model a spatial phenomenon and predict it at unmeasured positions, which enables the sampling optimization problem to be formulated by the use of the log determinant of a predicted covariance matrix at next sampling locations. The control, movement and nonholonomic dynamics constraints of the mobile sensors are also considered in the adaptive sampling optimization problem. In order to tackle the nonlinearity and nonconvexity of the objective function in the optimization problem we first exploit the linearized alternating direction method of multipliers (L-ADMM) method that can effectively simplify the objective function, though it is computationally expensive since a nonconvex problem needs to be solved exactly in each iteration. We then propose a novel approach called the successive convexified ADMM (SC-ADMM) that sequentially convexify the nonlinear dynamic constraints so that the original optimization problem can be split into convex subproblems. It is noted that both the L-ADMM algorithm and our SC-ADMM approach can solve the sampling optimization problem in either a centralized or a distributed manner. We validated the proposed approaches in 1000 experiments in a synthetic environment with a real-world dataset, where the obtained results suggest that both the L-ADMM and SC-ADMM techniques can provide good accuracy for the monitoring purpose. However, our proposed SC-ADMM approach computationally outperforms the L-ADMM counterpart, demonstrating its better practicality. © 2001-2012 IEEE.
An adaptive hierarchical sliding mode controller for autonomous underwater vehicles
- Van Vu, Quang, Dinh, Tuan, Van Nguyen, Thien, Tran, Hoang, Nguyen, Linh
- Authors: Van Vu, Quang , Dinh, Tuan , Van Nguyen, Thien , Tran, Hoang , Nguyen, Linh
- Date: 2021
- Type: Text , Journal article
- Relation: Electronics (Switzerland) Vol. 10, no. 18 (2021), p.
- Full Text:
- Reviewed:
- Description: The paper addresses a problem of efficiently controlling an autonomous underwater vehicle (AUV), where its typical underactuated model is considered. Due to critical uncertainties and nonlinearities in the system caused by unavoidable external disturbances such as ocean currents when it operates, it is paramount to robustly maintain motions of the vehicle over time as expected. Therefore, it is proposed to employ the hierarchical sliding mode control technique to design the closed-loop control scheme for the device. However, exactly determining parameters of the AUV control system is impractical since its nonlinearities and external disturbances can vary those parameters over time. Thus, it is proposed to exploit neural networks to develop an adaptive learning mechanism that allows the system to learn its parameters adaptively. More importantly, stability of the AUV system controlled by the proposed approach is theoretically proved to be guaranteed by the use of the Lyapunov theory. Effectiveness of the proposed control scheme was verified by the experiments implemented in a synthetic environment, where the obtained results are highly promising. © 2021 by the authors. Licensee MDPI, Basel, Switzerland. **Please note that there are multiple authors for this article therefore only the name of the first 5 including Federation University Australia affiliate “Linh Nguyen" is provided in this record**
- Authors: Van Vu, Quang , Dinh, Tuan , Van Nguyen, Thien , Tran, Hoang , Nguyen, Linh
- Date: 2021
- Type: Text , Journal article
- Relation: Electronics (Switzerland) Vol. 10, no. 18 (2021), p.
- Full Text:
- Reviewed:
- Description: The paper addresses a problem of efficiently controlling an autonomous underwater vehicle (AUV), where its typical underactuated model is considered. Due to critical uncertainties and nonlinearities in the system caused by unavoidable external disturbances such as ocean currents when it operates, it is paramount to robustly maintain motions of the vehicle over time as expected. Therefore, it is proposed to employ the hierarchical sliding mode control technique to design the closed-loop control scheme for the device. However, exactly determining parameters of the AUV control system is impractical since its nonlinearities and external disturbances can vary those parameters over time. Thus, it is proposed to exploit neural networks to develop an adaptive learning mechanism that allows the system to learn its parameters adaptively. More importantly, stability of the AUV system controlled by the proposed approach is theoretically proved to be guaranteed by the use of the Lyapunov theory. Effectiveness of the proposed control scheme was verified by the experiments implemented in a synthetic environment, where the obtained results are highly promising. © 2021 by the authors. Licensee MDPI, Basel, Switzerland. **Please note that there are multiple authors for this article therefore only the name of the first 5 including Federation University Australia affiliate “Linh Nguyen" is provided in this record**
Cross-compiler bipartite vulnerability search
- Authors: Black, Paul , Gondal, Iqbal
- Date: 2021
- Type: Text , Journal article
- Relation: Electronics (Switzerland) Vol. 10, no. 11 (2021), p.
- Full Text:
- Reviewed:
- Description: Open-source libraries are widely used in software development, and the functions from these libraries may contain security vulnerabilities that can provide gateways for attackers. This paper provides a function similarity technique to identify vulnerable functions in compiled programs and proposes a new technique called Cross-Compiler Bipartite Vulnerability Search (CCBVS). CCBVS uses a novel training process, and bipartite matching to filter SVM model false positives to improve the quality of similar function identification. This research uses debug symbols in programs compiled from open-source software products to generate the ground truth. This automatic extraction of ground truth allows experimentation with a wide range of programs. The results presented in the paper show that an SVM model trained on a wide variety of programs compiled for Windows and Linux, x86 and Intel 64 architectures can be used to predict function similarity and that the use of bipartite matching substantially improves the function similarity matching performance. © 2021 by the authors. Licensee MDPI, Basel, Switzerland.
- Authors: Black, Paul , Gondal, Iqbal
- Date: 2021
- Type: Text , Journal article
- Relation: Electronics (Switzerland) Vol. 10, no. 11 (2021), p.
- Full Text:
- Reviewed:
- Description: Open-source libraries are widely used in software development, and the functions from these libraries may contain security vulnerabilities that can provide gateways for attackers. This paper provides a function similarity technique to identify vulnerable functions in compiled programs and proposes a new technique called Cross-Compiler Bipartite Vulnerability Search (CCBVS). CCBVS uses a novel training process, and bipartite matching to filter SVM model false positives to improve the quality of similar function identification. This research uses debug symbols in programs compiled from open-source software products to generate the ground truth. This automatic extraction of ground truth allows experimentation with a wide range of programs. The results presented in the paper show that an SVM model trained on a wide variety of programs compiled for Windows and Linux, x86 and Intel 64 architectures can be used to predict function similarity and that the use of bipartite matching substantially improves the function similarity matching performance. © 2021 by the authors. Licensee MDPI, Basel, Switzerland.
Deep matrix factorization for trust-aware recommendation in social networks
- Wan, Liangtian, Xia, Feng, Kong, Xiangjie, Hsu, Ching-Hsien, Huang, Runhe, Ma, Jianhua
- Authors: Wan, Liangtian , Xia, Feng , Kong, Xiangjie , Hsu, Ching-Hsien , Huang, Runhe , Ma, Jianhua
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Transactions on Network Science and Engineering Vol. 8, no. 1 (2021), p. 511-528
- Full Text:
- Reviewed:
- Description: Recent years have witnessed remarkable information overload in online social networks, and social network based approaches for recommender systems have been widely studied. The trust information in social networks among users is an important factor for improving recommendation performance. Many successful recommendation tasks are treated as the matrix factorization problems. However, the prediction performance of matrix factorization based methods largely depends on the matrixes initialization of users and items. To address this challenge, we develop a novel trust-aware approach based on deep learning to alleviate the initialization dependence. First, we propose two deep matrix factorization (DMF) techniques, i.e., linear DMF and non-linear DMF to extract features from the user-item rating matrix for improving the initialization accuracy. The trust relationship is integrated into the DMF model according to the preference similarity and the derivations of users on items. Second, we exploit deep marginalized Denoising Autoencoder (Deep-MDAE) to extract the latent representation in the hidden layer from the trust relationship matrix to approximate the user factor matrix factorized from the user-item rating matrix. The community regularization is integrated in the joint optimization function to take neighbours' effects into consideration. The results of DMF are applied to initialize the updating variables of Deep-MDAE in order to further improve the recommendation performance. Finally, we validate that the proposed approach outperforms state-of-the-art baselines for recommendation, especially for the cold-start users. © 2013 IEEE.
- Authors: Wan, Liangtian , Xia, Feng , Kong, Xiangjie , Hsu, Ching-Hsien , Huang, Runhe , Ma, Jianhua
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Transactions on Network Science and Engineering Vol. 8, no. 1 (2021), p. 511-528
- Full Text:
- Reviewed:
- Description: Recent years have witnessed remarkable information overload in online social networks, and social network based approaches for recommender systems have been widely studied. The trust information in social networks among users is an important factor for improving recommendation performance. Many successful recommendation tasks are treated as the matrix factorization problems. However, the prediction performance of matrix factorization based methods largely depends on the matrixes initialization of users and items. To address this challenge, we develop a novel trust-aware approach based on deep learning to alleviate the initialization dependence. First, we propose two deep matrix factorization (DMF) techniques, i.e., linear DMF and non-linear DMF to extract features from the user-item rating matrix for improving the initialization accuracy. The trust relationship is integrated into the DMF model according to the preference similarity and the derivations of users on items. Second, we exploit deep marginalized Denoising Autoencoder (Deep-MDAE) to extract the latent representation in the hidden layer from the trust relationship matrix to approximate the user factor matrix factorized from the user-item rating matrix. The community regularization is integrated in the joint optimization function to take neighbours' effects into consideration. The results of DMF are applied to initialize the updating variables of Deep-MDAE in order to further improve the recommendation performance. Finally, we validate that the proposed approach outperforms state-of-the-art baselines for recommendation, especially for the cold-start users. © 2013 IEEE.
Detecting outlier patterns with query-based artificially generated searching conditions
- Yu, Shuo, Xia, Feng, Sun, Yuchen, Tang, Tao, Yan, Xiaoran, Lee, Ivan
- Authors: Yu, Shuo , Xia, Feng , Sun, Yuchen , Tang, Tao , Yan, Xiaoran , Lee, Ivan
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Transactions on Computational Social Systems Vol. 8, no. 1 (2021), p. 134-147
- Full Text:
- Reviewed:
- Description: In the age of social computing, finding interesting network patterns or motifs is significant and critical for various areas, such as decision intelligence, intrusion detection, medical diagnosis, social network analysis, fake news identification, and national security. However, subgraph matching remains a computationally challenging problem, let alone identifying special motifs among them. This is especially the case in large heterogeneous real-world networks. In this article, we propose an efficient solution for discovering and ranking human behavior patterns based on network motifs by exploring a user's query in an intelligent way. Our method takes advantage of the semantics provided by a user's query, which in turn provides the mathematical constraint that is crucial for faster detection. We propose an approach to generate query conditions based on the user's query. In particular, we use meta paths between the nodes to define target patterns as well as their similarities, leading to efficient motif discovery and ranking at the same time. The proposed method is examined in a real-world academic network using different similarity measures between the nodes. The experiment result demonstrates that our method can identify interesting motifs and is robust to the choice of similarity measures. © 2014 IEEE.
- Authors: Yu, Shuo , Xia, Feng , Sun, Yuchen , Tang, Tao , Yan, Xiaoran , Lee, Ivan
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Transactions on Computational Social Systems Vol. 8, no. 1 (2021), p. 134-147
- Full Text:
- Reviewed:
- Description: In the age of social computing, finding interesting network patterns or motifs is significant and critical for various areas, such as decision intelligence, intrusion detection, medical diagnosis, social network analysis, fake news identification, and national security. However, subgraph matching remains a computationally challenging problem, let alone identifying special motifs among them. This is especially the case in large heterogeneous real-world networks. In this article, we propose an efficient solution for discovering and ranking human behavior patterns based on network motifs by exploring a user's query in an intelligent way. Our method takes advantage of the semantics provided by a user's query, which in turn provides the mathematical constraint that is crucial for faster detection. We propose an approach to generate query conditions based on the user's query. In particular, we use meta paths between the nodes to define target patterns as well as their similarities, leading to efficient motif discovery and ranking at the same time. The proposed method is examined in a real-world academic network using different similarity measures between the nodes. The experiment result demonstrates that our method can identify interesting motifs and is robust to the choice of similarity measures. © 2014 IEEE.
Forced oscillation detection amid communication uncertainties
- Surinkaew, Tossaporn, Shah, Rakibuzzaman, Nadarajah, Mithulananthan, Muyeen, S., Emami, Kianoush, Ngamroo, Issarachai
- Authors: Surinkaew, Tossaporn , Shah, Rakibuzzaman , Nadarajah, Mithulananthan , Muyeen, S. , Emami, Kianoush , Ngamroo, Issarachai
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Systems Journal Vol. 15, no. 3 (SEP 2021), p. 4644-4655
- Full Text:
- Reviewed:
- Description: This article proposes a novel technique for the detection of forced oscillation (FO) in a power system with the uncertainty in the measured signals. The impacts of communication uncertainties on measured signals are theoretically investigated based on the mathematical models developed in this article. A data recovery method is proposed and applied to reconstruct the signal under the effects of communication losses. The proposed FO detection with communication uncertainties is evaluated in the modified 14-machine Southeast Australian power system. A rigorous comparative analysis is made to validate the effectiveness of the proposed data recovery and FO detection methods.
- Authors: Surinkaew, Tossaporn , Shah, Rakibuzzaman , Nadarajah, Mithulananthan , Muyeen, S. , Emami, Kianoush , Ngamroo, Issarachai
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Systems Journal Vol. 15, no. 3 (SEP 2021), p. 4644-4655
- Full Text:
- Reviewed:
- Description: This article proposes a novel technique for the detection of forced oscillation (FO) in a power system with the uncertainty in the measured signals. The impacts of communication uncertainties on measured signals are theoretically investigated based on the mathematical models developed in this article. A data recovery method is proposed and applied to reconstruct the signal under the effects of communication losses. The proposed FO detection with communication uncertainties is evaluated in the modified 14-machine Southeast Australian power system. A rigorous comparative analysis is made to validate the effectiveness of the proposed data recovery and FO detection methods.
Generalized bregman envelopes and proximity operators
- Burachik, Regina, Dao, Minh, Lindstrom, Scott
- Authors: Burachik, Regina , Dao, Minh , Lindstrom, Scott
- Date: 2021
- Type: Text , Journal article
- Relation: Journal of Optimization Theory and Applications Vol. 190, no. 3 (2021), p. 744-778
- Full Text:
- Reviewed:
- Description: Every maximally monotone operator can be associated with a family of convex functions, called the Fitzpatrick family or family of representative functions. Surprisingly, in 2017, Burachik and Martínez-Legaz showed that the well-known Bregman distance is a particular case of a general family of distances, each one induced by a specific maximally monotone operator and a specific choice of one of its representative functions. For the family of generalized Bregman distances, sufficient conditions for convexity, coercivity, and supercoercivity have recently been furnished. Motivated by these advances, we introduce in the present paper the generalized left and right envelopes and proximity operators, and we provide asymptotic results for parameters. Certain results extend readily from the more specific Bregman context, while others only extend for certain generalized cases. To illustrate, we construct examples from the Bregman generalizing case, together with the natural “extreme” cases that highlight the importance of which generalized Bregman distance is chosen. © 2021, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
- Authors: Burachik, Regina , Dao, Minh , Lindstrom, Scott
- Date: 2021
- Type: Text , Journal article
- Relation: Journal of Optimization Theory and Applications Vol. 190, no. 3 (2021), p. 744-778
- Full Text:
- Reviewed:
- Description: Every maximally monotone operator can be associated with a family of convex functions, called the Fitzpatrick family or family of representative functions. Surprisingly, in 2017, Burachik and Martínez-Legaz showed that the well-known Bregman distance is a particular case of a general family of distances, each one induced by a specific maximally monotone operator and a specific choice of one of its representative functions. For the family of generalized Bregman distances, sufficient conditions for convexity, coercivity, and supercoercivity have recently been furnished. Motivated by these advances, we introduce in the present paper the generalized left and right envelopes and proximity operators, and we provide asymptotic results for parameters. Certain results extend readily from the more specific Bregman context, while others only extend for certain generalized cases. To illustrate, we construct examples from the Bregman generalizing case, together with the natural “extreme” cases that highlight the importance of which generalized Bregman distance is chosen. © 2021, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
How to optimize an academic team when the outlier member is leaving?
- Yu, Shuo, Liu, Jiaying, Wei, Haoran, Xia, Feng, Tong, Hanghang
- Authors: Yu, Shuo , Liu, Jiaying , Wei, Haoran , Xia, Feng , Tong, Hanghang
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Intelligent Systems Vol. 36, no. 3 (May-Jun 2021), p. 23-30
- Full Text:
- Reviewed:
- Description: An academic team is a highly cohesive collaboration group of scholars, which has been recognized as an effective way to improve scientific output in terms of both quality and quantity. However, the high staff turnover brings about a series of problems that may have negative influences on team performance. To address this challenge, we first detect the tendency of the member who may potentially leave. Here, the outlierness is defined with respect to familiarity, which is quantified by using collaboration intensity. It is assumed that if a team member has a higher familiarity with scholars outside the team, then this member might probably leave the team. To minimize the influence caused by the leaving of such an outlier member, we propose an optimization solution to find a proper candidate who can replace the outlier member. Based on random walk with graph kernel, our solution involves familiarity matching, skill matching, as well as structure matching. The proposed approach proves to be effective and outperforms existing methods when applied to computer science academic teams.
- Authors: Yu, Shuo , Liu, Jiaying , Wei, Haoran , Xia, Feng , Tong, Hanghang
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Intelligent Systems Vol. 36, no. 3 (May-Jun 2021), p. 23-30
- Full Text:
- Reviewed:
- Description: An academic team is a highly cohesive collaboration group of scholars, which has been recognized as an effective way to improve scientific output in terms of both quality and quantity. However, the high staff turnover brings about a series of problems that may have negative influences on team performance. To address this challenge, we first detect the tendency of the member who may potentially leave. Here, the outlierness is defined with respect to familiarity, which is quantified by using collaboration intensity. It is assumed that if a team member has a higher familiarity with scholars outside the team, then this member might probably leave the team. To minimize the influence caused by the leaving of such an outlier member, we propose an optimization solution to find a proper candidate who can replace the outlier member. Based on random walk with graph kernel, our solution involves familiarity matching, skill matching, as well as structure matching. The proposed approach proves to be effective and outperforms existing methods when applied to computer science academic teams.
Industrial IoT based condition monitoring for wind energy conversion system
- Hossain, Md Liton, Abu-Siada, Ahmed, Muyeen, S., Hasan, Mubashwar, Rahman, Md Momtazur
- Authors: Hossain, Md Liton , Abu-Siada, Ahmed , Muyeen, S. , Hasan, Mubashwar , Rahman, Md Momtazur
- Date: 2021
- Type: Text , Journal article
- Relation: CSEE Journal of Power and Energy Systems Vol. 7, no. 3 (2021), p. 654-664
- Full Text:
- Reviewed:
- Description: Wind energy has been identified as the second dominating source in the world renewable energy generation after hydropower. Conversion and distribution of wind energy has brought technology revolution by developing the advanced wind energy conversion system (WECS) including multilevel inverters (MLIs). The conventional rectifier produces ripples in their output waveforms while the MLI suffers from voltage balancing issues across the DC-link capacitor. This paper proposes a simplified proportional integral (PI)-based space vector pulse width modulation (SVPWM) to minimize the output waveform ripples, resolve the voltage balancing issue and produce better-quality output waveforms. WECS experiences various types of faults particularly in the DC-link capacitor and switching devices of the power converter. These faults, if not detected and rectified at an early stage, may lead to catastrophic failures to the WECS and continuity of the power supply. This paper proposes a new algorithm embedded in the proposed PI-based SVPWM controller to identify the fault location in the power converter in real time. Since most wind power plants are located in remote areas or offshore, WECS condition monitoring needs to be developed over the internet of things (IoT) to ensure system reliability. In this paper, an industrial IoT algorithm with an associated hardware prototype is proposed to monitor the condition of WECS in the real-time environment. © 2015 CSEE.
- Authors: Hossain, Md Liton , Abu-Siada, Ahmed , Muyeen, S. , Hasan, Mubashwar , Rahman, Md Momtazur
- Date: 2021
- Type: Text , Journal article
- Relation: CSEE Journal of Power and Energy Systems Vol. 7, no. 3 (2021), p. 654-664
- Full Text:
- Reviewed:
- Description: Wind energy has been identified as the second dominating source in the world renewable energy generation after hydropower. Conversion and distribution of wind energy has brought technology revolution by developing the advanced wind energy conversion system (WECS) including multilevel inverters (MLIs). The conventional rectifier produces ripples in their output waveforms while the MLI suffers from voltage balancing issues across the DC-link capacitor. This paper proposes a simplified proportional integral (PI)-based space vector pulse width modulation (SVPWM) to minimize the output waveform ripples, resolve the voltage balancing issue and produce better-quality output waveforms. WECS experiences various types of faults particularly in the DC-link capacitor and switching devices of the power converter. These faults, if not detected and rectified at an early stage, may lead to catastrophic failures to the WECS and continuity of the power supply. This paper proposes a new algorithm embedded in the proposed PI-based SVPWM controller to identify the fault location in the power converter in real time. Since most wind power plants are located in remote areas or offshore, WECS condition monitoring needs to be developed over the internet of things (IoT) to ensure system reliability. In this paper, an industrial IoT algorithm with an associated hardware prototype is proposed to monitor the condition of WECS in the real-time environment. © 2015 CSEE.
Malware variant identification using incremental clustering
- Black, Paul, Gondal, Iqbal, Bagirov, Adil, Moniruzzaman, Md
- Authors: Black, Paul , Gondal, Iqbal , Bagirov, Adil , Moniruzzaman, Md
- Date: 2021
- Type: Text , Journal article
- Relation: Electronics Vol. 10, no. 14 (2021), p.
- Relation: http://purl.org/au-research/grants/arc/DP190100580
- Full Text:
- Reviewed:
- Authors: Black, Paul , Gondal, Iqbal , Bagirov, Adil , Moniruzzaman, Md
- Date: 2021
- Type: Text , Journal article
- Relation: Electronics Vol. 10, no. 14 (2021), p.
- Relation: http://purl.org/au-research/grants/arc/DP190100580
- Full Text:
- Reviewed:
Matching algorithms : fundamentals, applications and challenges
- Ren, Jing, Xia, Feng, Chen, Xiangtai, Liu, Jiaying, Sultanova, Nargiz
- Authors: Ren, Jing , Xia, Feng , Chen, Xiangtai , Liu, Jiaying , Sultanova, Nargiz
- Date: 2021
- Type: Text , Journal article , Review
- Relation: IEEE Transactions on Emerging Topics in Computational Intelligence Vol. 5, no. 3 (2021), p. 332-350
- Full Text:
- Reviewed:
- Description: Matching plays a vital role in the rational allocation of resources in many areas, ranging from market operation to people's daily lives. In economics, the term matching theory is coined for pairing two agents in a specific market to reach a stable or optimal state. In computer science, all branches of matching problems have emerged, such as the question-answer matching in information retrieval, user-item matching in a recommender system, and entity-relation matching in the knowledge graph. A preference list is the core element during a matching process, which can either be obtained directly from the agents or generated indirectly by prediction. Based on the preference list access, matching problems are divided into two categories, i.e., explicit matching and implicit matching. In this paper, we first introduce the matching theory's basic models and algorithms in explicit matching. The existing methods for coping with various matching problems in implicit matching are reviewed, such as retrieval matching, user-item matching, entity-relation matching, and image matching. Furthermore, we look into representative applications in these areas, including marriage and labor markets in explicit matching and several similarity-based matching problems in implicit matching. Finally, this survey paper concludes with a discussion of open issues and promising future directions in the field of matching. © 2017 IEEE. **Please note that there are multiple authors for this article therefore only the name of the first 5 including Federation University Australia affiliate “Jing Ren, Xia Feng, Nargiz Sultanova" is provided in this record**
- Authors: Ren, Jing , Xia, Feng , Chen, Xiangtai , Liu, Jiaying , Sultanova, Nargiz
- Date: 2021
- Type: Text , Journal article , Review
- Relation: IEEE Transactions on Emerging Topics in Computational Intelligence Vol. 5, no. 3 (2021), p. 332-350
- Full Text:
- Reviewed:
- Description: Matching plays a vital role in the rational allocation of resources in many areas, ranging from market operation to people's daily lives. In economics, the term matching theory is coined for pairing two agents in a specific market to reach a stable or optimal state. In computer science, all branches of matching problems have emerged, such as the question-answer matching in information retrieval, user-item matching in a recommender system, and entity-relation matching in the knowledge graph. A preference list is the core element during a matching process, which can either be obtained directly from the agents or generated indirectly by prediction. Based on the preference list access, matching problems are divided into two categories, i.e., explicit matching and implicit matching. In this paper, we first introduce the matching theory's basic models and algorithms in explicit matching. The existing methods for coping with various matching problems in implicit matching are reviewed, such as retrieval matching, user-item matching, entity-relation matching, and image matching. Furthermore, we look into representative applications in these areas, including marriage and labor markets in explicit matching and several similarity-based matching problems in implicit matching. Finally, this survey paper concludes with a discussion of open issues and promising future directions in the field of matching. © 2017 IEEE. **Please note that there are multiple authors for this article therefore only the name of the first 5 including Federation University Australia affiliate “Jing Ren, Xia Feng, Nargiz Sultanova" is provided in this record**
Mobile robotic sensors for environmental monitoring using gaussian markov random field
- Nguyen, Linh, Kodagoda, Sarath, Ranasinghe, Ravindra, Dissanayake, Gamini
- Authors: Nguyen, Linh , Kodagoda, Sarath , Ranasinghe, Ravindra , Dissanayake, Gamini
- Date: 2021
- Type: Text , Journal article
- Relation: Robotica Vol. 39, no. 5 (2021), p. 862-884
- Full Text:
- Reviewed:
- Description: This paper addresses the issue of monitoring spatial environmental phenomena of interest utilizing information collected by a network of mobile, wireless, and noisy sensors that can take discrete measurements as they navigate through the environment. It is proposed to employ Gaussian Markov random field (GMRF) represented on an irregular discrete lattice by using the stochastic partial differential equations method to model the physical spatial field. It then derives a GMRF-based approach to effectively predict the field at unmeasured locations, given available observations, in both centralized and distributed manners. Furthermore, a novel but efficient optimality criterion is then proposed to design centralized and distributed adaptive sampling strategies for the mobile robotic sensors to find the most informative sampling paths in taking future measurements. By taking advantage of conditional independence property in the GMRF, the adaptive sampling optimization problem is proven to be resolved in a deterministic time. The effectiveness of the proposed approach is compared and demonstrated using pre-published data sets with appealing results. Copyright © The Author(s), 2020. Published by Cambridge University Press.
- Authors: Nguyen, Linh , Kodagoda, Sarath , Ranasinghe, Ravindra , Dissanayake, Gamini
- Date: 2021
- Type: Text , Journal article
- Relation: Robotica Vol. 39, no. 5 (2021), p. 862-884
- Full Text:
- Reviewed:
- Description: This paper addresses the issue of monitoring spatial environmental phenomena of interest utilizing information collected by a network of mobile, wireless, and noisy sensors that can take discrete measurements as they navigate through the environment. It is proposed to employ Gaussian Markov random field (GMRF) represented on an irregular discrete lattice by using the stochastic partial differential equations method to model the physical spatial field. It then derives a GMRF-based approach to effectively predict the field at unmeasured locations, given available observations, in both centralized and distributed manners. Furthermore, a novel but efficient optimality criterion is then proposed to design centralized and distributed adaptive sampling strategies for the mobile robotic sensors to find the most informative sampling paths in taking future measurements. By taking advantage of conditional independence property in the GMRF, the adaptive sampling optimization problem is proven to be resolved in a deterministic time. The effectiveness of the proposed approach is compared and demonstrated using pre-published data sets with appealing results. Copyright © The Author(s), 2020. Published by Cambridge University Press.
Smart sensing-enabled decision support system for water scheduling in orange orchard
- Khan, Rahim, Zakarya, Muhammad, Balasubramanian, Venki, Jan, Mian, Menon, Varun
- Authors: Khan, Rahim , Zakarya, Muhammad , Balasubramanian, Venki , Jan, Mian , Menon, Varun
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Sensors Journal Vol. 21, no. 16 (2021), p. 17492-17499
- Full Text:
- Reviewed:
- Description: The scarcity of water resources throughout the world demands its optimum utilization in various sectors. Smart Sensing-enabled irrigation management systems are the ideal solutions to ensure the optimum utilization of water resources in the agriculture sector. This paper presents a wireless sensor network-enabled Decision Support System (DSS) for developing a need-based irrigation schedule for the orange orchard. For efficient monitoring of various in-field parameters, our proposed approach uses the latest smart sensing technology such as soil moisture, leaf-wetness, temperature and humidity. The proposed smart sensing-enabled test-bed was deployed in the orange orchard of our institute for approximately one year and successfully adjusted its irrigation schedule according to the needs and demands of the plants. Moreover, a modified Longest Common SubSequence (LCSS) mechanism is integrated with the proposed DSS for distinguishing multi-valued noise from the abrupt changing scenarios. To resolve the concurrent communication problem of two or more wasp-mote sensor boards with a common receiver, an enhanced RTS/CTS handshake mechanism is presented. Our proposed DSS compares the most recently refined data with pre-defined threshold values for efficient water management in the orchard. Irrigation activity is scheduled if water deficit criterion is met and the farmer is informed accordingly. Both the experimental and simulation results show that the proposed scheme performs better in comparison to the existing schemes. © 2001-2012 IEEE.
- Authors: Khan, Rahim , Zakarya, Muhammad , Balasubramanian, Venki , Jan, Mian , Menon, Varun
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Sensors Journal Vol. 21, no. 16 (2021), p. 17492-17499
- Full Text:
- Reviewed:
- Description: The scarcity of water resources throughout the world demands its optimum utilization in various sectors. Smart Sensing-enabled irrigation management systems are the ideal solutions to ensure the optimum utilization of water resources in the agriculture sector. This paper presents a wireless sensor network-enabled Decision Support System (DSS) for developing a need-based irrigation schedule for the orange orchard. For efficient monitoring of various in-field parameters, our proposed approach uses the latest smart sensing technology such as soil moisture, leaf-wetness, temperature and humidity. The proposed smart sensing-enabled test-bed was deployed in the orange orchard of our institute for approximately one year and successfully adjusted its irrigation schedule according to the needs and demands of the plants. Moreover, a modified Longest Common SubSequence (LCSS) mechanism is integrated with the proposed DSS for distinguishing multi-valued noise from the abrupt changing scenarios. To resolve the concurrent communication problem of two or more wasp-mote sensor boards with a common receiver, an enhanced RTS/CTS handshake mechanism is presented. Our proposed DSS compares the most recently refined data with pre-defined threshold values for efficient water management in the orchard. Irrigation activity is scheduled if water deficit criterion is met and the farmer is informed accordingly. Both the experimental and simulation results show that the proposed scheme performs better in comparison to the existing schemes. © 2001-2012 IEEE.
State estimation within ied based smart grid using kalman estimates
- Rashed, Muhammad, Gondal, Iqbal, Kamruzzaman, Joarder, Islam, Syed
- Authors: Rashed, Muhammad , Gondal, Iqbal , Kamruzzaman, Joarder , Islam, Syed
- Date: 2021
- Type: Text , Journal article
- Relation: Electronics (Switzerland) Vol. 10, no. 15 (2021), p.
- Full Text:
- Reviewed:
- Description: State Estimation is a traditional and reliable technique within power distribution and control systems. It is used for building a topology of the power grid network based on state measurements and current operational state of different nodes & buses. The protection of sensors and measurement units such as Intelligent Electronic Devices (IED) in Central Energy Management System (CEMS) against False Data Injection Attacks (FDIAs) is a big concern to grid operators. These are special kind of cyber-attacks that are directed towards the state & measurement data in such a way that mislead the CEMS into making incorrect decisions and create generation load imbalance. These are known to bypass the traditional bad data detection systems within central estimators. This paper presents the use of an additional novel state estimator based on Kalman filter along with traditional Distributed State Estimation (DSE) which is based on Weighted Least Square (WLS). Kalman filter is a feedback control mechanism that constantly updates itself based on state prediction and state correction technique and shows improvement in the estimates. The additional estimator output is compared with the results of DSE in order to identify anomalies and injection of false data. We evaluated our methodology by simulating proposed technique using MATPOWER over IEEE-14, IEEE-30, IEEE-118, IEEE-300 bus. The results clearly demonstrate the superiority of the proposed method over traditional state estimation. © 2021 by the authors. Licensee MDPI, Basel, Switzerland.
- Authors: Rashed, Muhammad , Gondal, Iqbal , Kamruzzaman, Joarder , Islam, Syed
- Date: 2021
- Type: Text , Journal article
- Relation: Electronics (Switzerland) Vol. 10, no. 15 (2021), p.
- Full Text:
- Reviewed:
- Description: State Estimation is a traditional and reliable technique within power distribution and control systems. It is used for building a topology of the power grid network based on state measurements and current operational state of different nodes & buses. The protection of sensors and measurement units such as Intelligent Electronic Devices (IED) in Central Energy Management System (CEMS) against False Data Injection Attacks (FDIAs) is a big concern to grid operators. These are special kind of cyber-attacks that are directed towards the state & measurement data in such a way that mislead the CEMS into making incorrect decisions and create generation load imbalance. These are known to bypass the traditional bad data detection systems within central estimators. This paper presents the use of an additional novel state estimator based on Kalman filter along with traditional Distributed State Estimation (DSE) which is based on Weighted Least Square (WLS). Kalman filter is a feedback control mechanism that constantly updates itself based on state prediction and state correction technique and shows improvement in the estimates. The additional estimator output is compared with the results of DSE in order to identify anomalies and injection of false data. We evaluated our methodology by simulating proposed technique using MATPOWER over IEEE-14, IEEE-30, IEEE-118, IEEE-300 bus. The results clearly demonstrate the superiority of the proposed method over traditional state estimation. © 2021 by the authors. Licensee MDPI, Basel, Switzerland.
Toward a substation automation system based on IEC 61850
- Kumar, Shantanu, Abu-Siada, Ahmed, Das, Narottam, Islam, Syed
- Authors: Kumar, Shantanu , Abu-Siada, Ahmed , Das, Narottam , Islam, Syed
- Date: 2021
- Type: Text , Journal article
- Relation: Electronics (Switzerland) Vol. 10, no. 3 (2021), p. 1-16
- Full Text:
- Reviewed:
- Description: With the global trend to digitalize substation automation systems, International Electro technical Commission 61850, a communication protocol defined by the International Electrotechnical Commission, has been given much attention to ensure consistent communication and integration of substation high-voltage primary plant assets such as instrument transformers, circuit breakers and power transformers with various intelligent electronic devices into a hierarchical level. Along with this transition, equipment of primary plants in the switchyard, such as non-conventional instrument transformers, and a secondary system including merging units are expected to play critical roles due to their fast-transient response over a wide bandwidth. While a non-conventional instrument transformer has advantages when compared with the conventional one, extensive and detailed performance investigation and feasibility studies are still required for its full implementation at a large scale within utilities, industries, smart grids and digital substations. This paper is taking one step forward with respect to this aim by employing an optimized network engineering tool to evaluate the performance of an Ethernet-based network and to validate the overall process bus design requirement of a high-voltage non-conventional instrument transformer. Furthermore, the impact of communication delay on the substation automation system during peak traffic is investigated through a detailed simulation analysis. © 2021 by the authors. Licensee MDPI, Basel, Switzerland.
- Authors: Kumar, Shantanu , Abu-Siada, Ahmed , Das, Narottam , Islam, Syed
- Date: 2021
- Type: Text , Journal article
- Relation: Electronics (Switzerland) Vol. 10, no. 3 (2021), p. 1-16
- Full Text:
- Reviewed:
- Description: With the global trend to digitalize substation automation systems, International Electro technical Commission 61850, a communication protocol defined by the International Electrotechnical Commission, has been given much attention to ensure consistent communication and integration of substation high-voltage primary plant assets such as instrument transformers, circuit breakers and power transformers with various intelligent electronic devices into a hierarchical level. Along with this transition, equipment of primary plants in the switchyard, such as non-conventional instrument transformers, and a secondary system including merging units are expected to play critical roles due to their fast-transient response over a wide bandwidth. While a non-conventional instrument transformer has advantages when compared with the conventional one, extensive and detailed performance investigation and feasibility studies are still required for its full implementation at a large scale within utilities, industries, smart grids and digital substations. This paper is taking one step forward with respect to this aim by employing an optimized network engineering tool to evaluate the performance of an Ethernet-based network and to validate the overall process bus design requirement of a high-voltage non-conventional instrument transformer. Furthermore, the impact of communication delay on the substation automation system during peak traffic is investigated through a detailed simulation analysis. © 2021 by the authors. Licensee MDPI, Basel, Switzerland.
A robust forgery detection method for copy-move and splicing attacks in images
- Islam, Mohammad, Karmakar, Gour, Kamruzzaman, Joarder, Murshed, Manzur
- Authors: Islam, Mohammad , Karmakar, Gour , Kamruzzaman, Joarder , Murshed, Manzur
- Date: 2020
- Type: Text , Journal article
- Relation: Electronics Vol. 9, no. 9 (2020), p. 1-22
- Full Text:
- Reviewed:
- Description: Internet of Things (IoT) image sensors, social media, and smartphones generate huge volumes of digital images every day. Easy availability and usability of photo editing tools have made forgery attacks, primarily splicing and copy-move attacks, effortless, causing cybercrimes to be on the rise. While several models have been proposed in the literature for detecting these attacks, the robustness of those models has not been investigated when (i) a low number of tampered images are available for model building or (ii) images from IoT sensors are distorted due to image rotation or scaling caused by unwanted or unexpected changes in sensors' physical set-up. Moreover, further improvement in detection accuracy is needed for real-word security management systems. To address these limitations, in this paper, an innovative image forgery detection method has been proposed based on Discrete Cosine Transformation (DCT) and Local Binary Pattern (LBP) and a new feature extraction method using the mean operator. First, images are divided into non-overlapping fixed size blocks and 2D block DCT is applied to capture changes due to image forgery. Then LBP is applied to the magnitude of the DCT array to enhance forgery artifacts. Finally, the mean value of a particular cell across all LBP blocks is computed, which yields a fixed number of features and presents a more computationally efficient method. Using Support Vector Machine (SVM), the proposed method has been extensively tested on four well known publicly available gray scale and color image forgery datasets, and additionally on an IoT based image forgery dataset that we built. Experimental results reveal the superiority of our proposed method over recent state-of-the-art methods in terms of widely used performance metrics and computational time and demonstrate robustness against low availability of forged training samples.
- Description: This research was funded by Research Priority Area (RPA) scholarship of Federation University Australia.
- Authors: Islam, Mohammad , Karmakar, Gour , Kamruzzaman, Joarder , Murshed, Manzur
- Date: 2020
- Type: Text , Journal article
- Relation: Electronics Vol. 9, no. 9 (2020), p. 1-22
- Full Text:
- Reviewed:
- Description: Internet of Things (IoT) image sensors, social media, and smartphones generate huge volumes of digital images every day. Easy availability and usability of photo editing tools have made forgery attacks, primarily splicing and copy-move attacks, effortless, causing cybercrimes to be on the rise. While several models have been proposed in the literature for detecting these attacks, the robustness of those models has not been investigated when (i) a low number of tampered images are available for model building or (ii) images from IoT sensors are distorted due to image rotation or scaling caused by unwanted or unexpected changes in sensors' physical set-up. Moreover, further improvement in detection accuracy is needed for real-word security management systems. To address these limitations, in this paper, an innovative image forgery detection method has been proposed based on Discrete Cosine Transformation (DCT) and Local Binary Pattern (LBP) and a new feature extraction method using the mean operator. First, images are divided into non-overlapping fixed size blocks and 2D block DCT is applied to capture changes due to image forgery. Then LBP is applied to the magnitude of the DCT array to enhance forgery artifacts. Finally, the mean value of a particular cell across all LBP blocks is computed, which yields a fixed number of features and presents a more computationally efficient method. Using Support Vector Machine (SVM), the proposed method has been extensively tested on four well known publicly available gray scale and color image forgery datasets, and additionally on an IoT based image forgery dataset that we built. Experimental results reveal the superiority of our proposed method over recent state-of-the-art methods in terms of widely used performance metrics and computational time and demonstrate robustness against low availability of forged training samples.
- Description: This research was funded by Research Priority Area (RPA) scholarship of Federation University Australia.
An efficient 3-D model for remaining wall thicknesses of cast iron pipes in nondestructive testing
- Authors: Nguyen, Linh , Miro, Jaime
- Date: 2020
- Type: Text , Journal article
- Relation: IEEE Sensors Letters Vol. 4, no. 7 (2020), p.
- Full Text:
- Reviewed:
- Description: Over 50% of global pipes have been made of cast iron, and most of them are aging. In order to effectively estimate possibilities of their failures, which is paramount for efficiently managing asset infrastructures, it requires the remaining wall thickness (RWT) of a pipe to be known. In fact, RWT of the cast iron pipes can be primarily measured by the magnetism based nondestructive testing technologies though they are quite slow. To speed up the inspection process, it is proposed to sense RWT of a part of a pipe and then employ a model to predict RWT in the rest. Thus, this letter introduces a 3-D model to efficiently represent RWT of a pipe given measurements collected intermittently on the pipe's surface. The proposed model first transforms 3-D cylindrical coordinates to 3-D Cartesian coordinates before modeling RWT by Gaussian processes (GP). The transformation allows GP to work properly on RWT data gathered on a cylindrical pipe and effectively predict RWT at unmeasured locations. Moreover, periodicity of RWT along circumference of the pipe is naturally integrated. The effectiveness of the proposed approach is demonstrated by implementation in two real life inservice aging cast iron pipes, where the obtained results are highly promising. © 2017 IEEE.
- Authors: Nguyen, Linh , Miro, Jaime
- Date: 2020
- Type: Text , Journal article
- Relation: IEEE Sensors Letters Vol. 4, no. 7 (2020), p.
- Full Text:
- Reviewed:
- Description: Over 50% of global pipes have been made of cast iron, and most of them are aging. In order to effectively estimate possibilities of their failures, which is paramount for efficiently managing asset infrastructures, it requires the remaining wall thickness (RWT) of a pipe to be known. In fact, RWT of the cast iron pipes can be primarily measured by the magnetism based nondestructive testing technologies though they are quite slow. To speed up the inspection process, it is proposed to sense RWT of a part of a pipe and then employ a model to predict RWT in the rest. Thus, this letter introduces a 3-D model to efficiently represent RWT of a pipe given measurements collected intermittently on the pipe's surface. The proposed model first transforms 3-D cylindrical coordinates to 3-D Cartesian coordinates before modeling RWT by Gaussian processes (GP). The transformation allows GP to work properly on RWT data gathered on a cylindrical pipe and effectively predict RWT at unmeasured locations. Moreover, periodicity of RWT along circumference of the pipe is naturally integrated. The effectiveness of the proposed approach is demonstrated by implementation in two real life inservice aging cast iron pipes, where the obtained results are highly promising. © 2017 IEEE.
An existence result for quasi-equilibrium problems via Ekeland’s variational principle
- Cotrina, John, Théra, Michel, Zúñiga, Javier
- Authors: Cotrina, John , Théra, Michel , Zúñiga, Javier
- Date: 2020
- Type: Text , Journal article
- Relation: Journal of Optimization Theory and Applications Vol. 187, no. 2 (2020), p. 336-355
- Full Text:
- Reviewed:
- Description: This paper deals with the existence of solutions to equilibrium and quasi-equilibrium problems without any convexity assumption. Coverage includes some equivalences to the Ekeland variational principle for bifunctions and basic facts about transfer lower continuity. An application is given to systems of quasi-equilibrium problems. © 2020, Springer Science+Business Media, LLC, part of Springer Nature.
- Description: Research of M. Théra is supported by the Australian Research Council (ARC) Grant DP160100854 and benefited from the support of the FMJH Program PGMO and from the support of EDF. http://purl.org/au-research/grants/arc/DP160100854
- Authors: Cotrina, John , Théra, Michel , Zúñiga, Javier
- Date: 2020
- Type: Text , Journal article
- Relation: Journal of Optimization Theory and Applications Vol. 187, no. 2 (2020), p. 336-355
- Full Text:
- Reviewed:
- Description: This paper deals with the existence of solutions to equilibrium and quasi-equilibrium problems without any convexity assumption. Coverage includes some equivalences to the Ekeland variational principle for bifunctions and basic facts about transfer lower continuity. An application is given to systems of quasi-equilibrium problems. © 2020, Springer Science+Business Media, LLC, part of Springer Nature.
- Description: Research of M. Théra is supported by the Australian Research Council (ARC) Grant DP160100854 and benefited from the support of the FMJH Program PGMO and from the support of EDF. http://purl.org/au-research/grants/arc/DP160100854