Nano-Engineered Carbon Fibre-Based Piezoelectric Smart Composites for Energy Harvesting and Self-Powered Sensing

The integration of piezoelectric materials onto carbon fiber (CF) can add energy harvesting and self-power sensing capabilities enabling great potential for “Internet of Things” (IoT) applications in motion tracking, environmental sensing, and personal portable electronics. Herein, a CF-based smart composite is developed by integrating piezoelectric poly(3,4-ethylenedioxythiophene) (PEDOT)/CuSCN-coated ZnO nanorods onto the CF surfaces with no detrimental effect on the mechanical properties of the composite, forming composites using two different polymer matrices: highly flexible polydimethylsiloxane (PDMS) and more rigid epoxy. The PDMS-coated piezoelectric smart composite can serve as an energy harvester and a self-powered sensor for detecting variations in impact acceleration with increasing output voltage from 1.4 to 7.6 V under impact acceleration from 0.1 to 0.4 m s⁻². Using epoxy as the matrix for a CF-reinforced plastic (CFRP) device with sensing and detection functions produces a voltage varying from 0.27 to 3.53 V when impacted at acceleration from 0.1 to 0.4 m s⁻², with a lower output compared to the PDMS-coated device attributed to the greater stiffness of the matrix. Finally, spatially sensitive detection is demonstrated by positioning two piezoelectric structures at different locations, which can identify the location as well as the level of the impacting force from the fabricated device.     

Sparse CCA using a Lasso with positivity constraints

Canonical correlation analysis (CCA) describes the relationship between two sets of variables by finding linear combinations of the variables with maximal correlation. A sparse version of CCA is proposed that reduces the chance of including unimportant variables in the canonical variates and thus improves their interpretation. A version of the Lasso algorithm incorporating positivity constraints is implemented in tandem with alternating least squares (ALS), to obtain sparse canonical variates. The proposed method is demonstrated on simulation studies and a data set from market basket analysis.     

Deciding k-Colorability of P 5-Free Graphs in Polynomial Time

The problem of computing the chromatic number of a P ₅-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show that for every fixed integer k, there exists a polynomial-time algorithm determining whether or not a P ₅-free graph admits a k-coloring, and finding one, if it does.     

Partitioning large networks without breaking communities

The identification of cohesive communities is a key process in social network analysis. However, the algorithms that are effective for finding communities do not scale well to very large problems, as their time complexity is worse than linear in the number of edges in the graph. This is an important issue for those interested in applying social network analysis techniques to very large networks, such as networks of mobile phone subscribers. In this respect, the contributions of this paper are twofold. First, we demonstrate these scaling issues using a prominent community-finding algorithm as a case study. Then, we show that a two-stage process, whereby the network is first decomposed into manageable subnetworks using a multilevel graph partitioning procedure, is effective in finding communities in networks with more than 10⁶ nodes.     

Discriminating between disturbance and process model mismatch in model predictive control

A novel method for discriminating faults in model predictive control is presented. The proposed method monitors the Kalman filter innovations to detect the presence of autocorrelation, which is an indication of suboptimal state estimation. The cause of the suboptimal state estimation is diagnosed by the observability of this innovations process. This task involves determining the order of the autocorrelation present in the innovations. The proposed MPC fault discrimination method is demonstrated on a SISO process and a MIMO process.     

New statistical methods for investigating submarine pockmarks

We investigate the applicability of some novel spatial analysis techniques, developed for studies of astrophysical datasets, to the analysis of spatial point data in sedimentary basins. The techniques are evaluated and compared with standard methods using two test areas that contain large numbers of submarine pockmarks developed in distributed arrays. The familiar Ripley K and Voronoi tesselation techniques are used, and the results are then compared with those obtained using more novel techniques, the correlation length and minimal spanning tree. The correlation length technique is found to identify the precise distances at which clustering occurs more accurately, making a physical interpretation more clear than is possible using the Ripley K. The minimal spanning tree is found to be powerful at identifying the space-filling nature of the pockmark distribution, and has the advantage of being immune to edge effects. The use of these two novel techniques permits more information to be extracted from the datasets, and demonstrates clear statistically significant differences between them, which are not detectable using standard techniques.     

Real time video frames allocation in mobile networks using cooperative pre-fetching

In this paper, we study the bandwidth allocation problem for serving video requests in a mobile real-time video player system. One of the main issues to maintain the quality of services (QoS) in mobile video playback is to ensure sufficient number of video frames available at the client side while a video is being played. However, due to the limited bandwidth of a mobile network and variable workload streaming video, this is not easy to achieve in practice. In addition, the communication link between mobile clients and a video server is subject to frequent errors and temporary disconnection. In this paper, we propose to use the notion of buffered bandwidth in addition to the network bandwidth to support real-time playback of videos at mobile clients. Based on this, we designed a bandwidth allocation scheme called Cooperative Pre-Fetching (CP) in which the amount of bandwidth to be allocated to serve a video request depends on the current buffer level of the video at the client relative to the target buffer level of the client. In determining the target buffer level, we consider the errors in communication to the client as well as the other clients who are concurrently served by the system. The buffered video frames at the clients are then used to minimize the impact of error in communications on the overall QoS of video playbacks in the whole system.