Outputs (216)

SecSVA: Secure Storage, Verification, and Auditing of Big Data in the Cloud Environment (2018)
Journal Article
Aujla, G. S., Chaudhary, R., Kumar, N., Das, A. K., & Rodrigues, J. J. (2018). SecSVA: Secure Storage, Verification, and Auditing of Big Data in the Cloud Environment. IEEE Communications Magazine, 56(1), https://doi.org/10.1109/mcom.2018.1700379

SDN-Enabled Multi-Attribute-Based Secure Communication for Smart Grid in IIoT Environment (2018)
Journal Article
Chaudhary, R., Aujla, G. S., Garg, S., Kumar, N., & Rodrigues, J. J. (2018). SDN-Enabled Multi-Attribute-Based Secure Communication for Smart Grid in IIoT Environment. IEEE Transactions on Industrial Informatics, 14(6), https://doi.org/10.1109/tii.2018.2789442

Single Image Watermark Retrieval from 3D Printed Surfaces via Convolutional Neural Networks (2018)
Presentation / Conference Contribution
Zhang, X., Wang, Q., & Ivrissimtzis, I. (2018, December). Single Image Watermark Retrieval from 3D Printed Surfaces via Convolutional Neural Networks. Presented at EG UK Computer Graphics & Visual Computing, Swansea, UK

In this paper we propose and analyse a method for watermarking 3D printed objects, concentrating on the watermark retrieval problem. The method embeds the watermark in a planar region of the 3D printed object in the form of small semi-spherical or cu... Read More about Single Image Watermark Retrieval from 3D Printed Surfaces via Convolutional Neural Networks.

Disconnected Cuts in Claw-free Graphs (2018)
Presentation / Conference Contribution
Martin, B., Paulusma, D., & van Leeuwen, E. J. (2018, August). Disconnected Cuts in Claw-free Graphs. Presented at 26th Annual European Symposium on Algorithms (ESA 2018)., Helsinki, Finland

A disconnected cut of a connected graph is a vertex cut that itself also induces a disconnected subgraph. The corresponding decision problem is called Disconnected Cut. It is known that Disconnected Cut is NP-hard on general graphs, while polynomial-... Read More about Disconnected Cuts in Claw-free Graphs.

On the price of independence for vertex cover, feedback vertex set and odd cycle transversal (2018)
Presentation / Conference Contribution
Dabrowski, K. K., Johnson, M., Paesani, G., Paulusma, D., & Zamaraev, V. (2018, August). On the price of independence for vertex cover, feedback vertex set and odd cycle transversal. Presented at 43nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)., Liverpool, UK

Let vc(G), fvs(G) and oct(G) denote, respectively, the size of a minimum vertex cover, minimum feedback vertex set and minimum odd cycle transversal in a graph G. One can ask, when looking for these sets in a graph, how much bigger might they be if w... Read More about On the price of independence for vertex cover, feedback vertex set and odd cycle transversal.

Stacked Denoising Autoencoders for Mortality Risk Prediction Using Imbalanced Clinical Data (2018)
Presentation / Conference Contribution
Alhassan, Z., McGough, A. S., Alshammari, R., Daghstani, T., Budgen, D., & Al Moubayed, N. (2018, December). Stacked Denoising Autoencoders for Mortality Risk Prediction Using Imbalanced Clinical Data. Presented at IEEE 17th International Conference on Machine Learning and Applications (ICMLA 2018)., Orlando, Fl, USA

Clinical data, such as evaluations, treatments, vital sign and lab test results, are usually observed and recorded in hospital systems. Making use of such data to help physicians to evaluate the mortality risk of in-hospital patients provides an inva... Read More about Stacked Denoising Autoencoders for Mortality Risk Prediction Using Imbalanced Clinical Data.