2020
Mohammad Mamduhi, Dipankar Maity, John Baras, Karl Johansson
In the design of cyber-physical systems (CPS) where multiple heterogeneous physical systems are coupled via a communication network, a key aspect is to study how network services are distributed among the users. The authors derive the joint optimal time-sensitive control and service allocation policies for each physical system.
KTH Royal Institute of Technology, Stockholm
Erfaun Noorani, Yagiz Savas, Alec Koppel, John Baras, Ufuk Topcu, Brian M. Sadler
In this wireless networks paper, the authors formulate a subset selection problem that aims to find a subset of agents, each of which is equipped with an idealisotropic antenna, that forms a reliable communication linkwith a client through beamforming. They present three algorithms for solving the subset selection problem, and discussed their computational complexity and optimality. All the proposed algorithms can be thought of as attempts towards approximate trade-off analysis and attempts towards finding desirable Pareto points.
arXiv.org
2020
Zitan Chen, Alexander Barg
The work focuses on cyclic constructions of LRC codes and derives conditions on the zeros of the code that support the property of hierarchical locality. The authors obtain a general family of hierarchical LRC codes for a new range of code parameters.
arXiv.org
Zitan Chen, Min Ye, Alexander Barg
Reed-Solomon codes possess a repair scheme that supports repair of failed nodes with optimal repair bandwidth. This paper extends this result in two directions.
arXiv.org
2020
Meng Wang, Wei Chen, Anthony Ephremides
One of the most critical problems for the emerging Internet of Things is the real-time remote reconstruction of ongoing signals (or their functions) from a set of measurements that are under-sampled and delayed in the network. The authors address this problem under three special sampling policies.
IEEE Transactions on Information Theory
Emmanouil Fountoulakis, Nikolaos Pappas, Marian Codreanu, Anthony Ephremides
Considers the problem of minimizing the time average cost of sampling and transmitting status updates by users over a wireless channel subject to average Age of Information constraints. A stochastic optimization problem is formulated and solved with a dynamic algorithm that takes decisions in a slot-by-slot basis.
arXiv.org
Antzela Kosta, Nikolaos Pappas, Anthony Ephremides, Vangelis Angelakis
Investigates a sample path of the age of information (AoI) stochastic process and provides a general framework that establishes a relation among the AoI, the system delay, and the peak AoI. The aim is to be able to analyze any non-linear function of AoI and provide a wide range of potential uses of information ageing depending on the application.
arXiv.org
Ali Maatouk, Yin Sun, Anthony Ephremides, Mohamad Assaad
Introduces the idea of lex-age-optimality that captures both age-optimality and the order of time-cruciality betweeen streams in a general multi-class priority-based scheduling scenario.
Laboratoire des Signaux & Systemes, L2S Central Supelec, France
Ali Maatouk, Saad Kriouile, Mohamad Assaad, Tony Ephremides
The authors prove that the Whittle’s index policy is age-optimal for the general asymmetrical case in the burgeoning many-users regime of Internet of Things interconnected devices.
arXiv.org
2019
Song Huang, Di Yuan, Anthony Ephremides
This article related to spectrum scarcity studies bandwidth partition and allocation to optimize spectrum utilitzation in cognitive communications under the interweave paradigm.
IEEE Journal of Communications & Networks
2019
Nadee Seneviratne, Ganesh Sivaraman, Carol Espy-Wilson
This paper proposes a multi-corpus speech inversion system for automatic speech recognition, pronounciation training and speech therapy.
Interspeech 2019
Carol Espy-Wilson, Adam Lammert, Nadee Seneviratne, Thomas Quatieri
A new articulary inversion process provides a potentially powerful way of detecting depression based on speech patterns.
Interspeech 2019
Saurabh Sahu, Vikramjit Mitra, Nadee Seneviratne, Carol Espy-Wilson
The paper leverages multi-modal learning and automated speech recognition (ASR) systems toward building a speech-only emotion recognition model.
Interspeech 2019
2020
Michael Lin, Richard La
Develops a new algorithm to position depots where bridge inspection robots would be stored and recharged, and determines a set of sites for each robot to inspect on the bridge.
arXiv.org
Michael Lin, Nuno Martins, Richard La
This work expands on stabilizability results recently obtained for a framework to establish methods to design scheduling policies that not only stabilize the queue but also reduce the utilization rate—understood as the infinite-horizon time-averaged expected portion of time the server is working.
arXiv.org
2019
Zhenyu Tang, Hsien-Yu Meng, Dinesh Manocha
This paper proposes a method for generating low-frequency compensated synthetic impulse responses that improve the performance of automatic speech recognition, lowering word error rates. This method generates more realistic synthetic IRs with low-frequency compensation for far-field ASR training.
2020
Michael Lin, Nuno Martins, Richard La
This work expands on stabilizability results recently obtained for a framework to establish methods to design scheduling policies that not only stabilize the queue but also reduce the utilization rate—understood as the infinite-horizon time-averaged expected portion of time the server is working.
arXiv.org
2020
Xueyan Wang, Jianlei Yang, Yinglin Zhao, Xiaotao Jia, Gang Qu, Weisheng Zhao
Computing-in-memory (CIM) could alleviate the processor-memory data transfer bottleneck in traditional Von-Neumann architectures, and spintronics-based magnetic memory has demonstrated many facilitations in implementing CIM paradigm. Hardware security has become one of the major concerns in circuit designs. This paper, for the first time, investigates spin-based CIM from a security perspective.
ACM Journal on Emerging Technologies in Computing Systems
Aikiao Cui, Mengyang Li, Gang Qu, Huawei Li
A proposal to use 'cryptographic hash' to thwart attackers seeking the cipher keys of sensitive integrated circuits during manufacturing and testing.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Pengfei Qiu, Dongsheng Wang, Yongqiang Lyu, Gang Qu
Intel software-guard extensions (SGX) allows applications to run in a trusted space (enclave), which provides a highly secure primitive for the running codes and data. The authors propose the first fault injection attack to break SGX by using voltage-induced hardware faults.
voltjockey.com
2019
Pengfei Qiu, Dongsheng Wang, Yongqiang Lyu, Gang Qu
VoltJockey is an innovative software-controlled, hardware fault-based attack on multi-core processors that adopt dynamic voltage and frequency scaling (DVFS) techniques for energy efficiency.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security
Jiliang Zhang, Gang Qu
In many Industry Internet of Things (IIoT) applications, resources like CPU, memory, and battery power are limited and cannot afford the classic cryptographic security solutions. Silicon Physical Unclonable Function (PUF) is a lightweight security primitive that exploits manufacturing variations during the chip fabrication process for key generation and/or device authentication. The paper proposes a PUF-based key sharing method for the first time.
IEEE Transactions on Industrial Electronics
Zhaojun Lu, Qian Wang, Xi Chen, Gang Qu, Yongqiang Lyu, Zhenglin Liu
Controller Area Network is standard for in-vehicle communications, but attackers can compromise to remotely control vehicles. The researchers have developed a low-cost, high-efficiency encryption and authentication protocol to improve security.
arXiv.org
Zhaojun Lu, Zhenglin Liu, Carson Dunbar, Mingze Gao, Gang Qu
This paper on intelligent transportation systems proposes pass and run protocol for vehicular delay tolerant networks to address vehicle location privacy in communicating with roadside units.
IEEE Design & Test
2020
Ankit Mondal, Ankur Srivastava
The Ising model has been explored as a framework for modeling NP-hard problems, with several diverse systems proposed to solve it. The Magnetic Tunnel Junction (MTJ)-based Magnetic RAM is capable of replacing CMOS in memory chips. The authors propose the use of MTJs for representing the units of an Ising model and leveraging its intrinsic physics for finding the ground state of the system through annealing.
...
Ankur Srivastava , Zhiyuan Yang, Bruce Jacob, Shang Li, Dhiraj Reddy
The paper develops DRAMsim3, a successor to the earlier simulator DRAMSim2 developed by Jacob and his two former students Paul Rosenfeld (ECE Ph.D. 2014), and Elliott Cooper-Balis (ECE Ph.D. 2012). It is is a fast, cycle-accurate, validated, thermal-capable DRAM simulator that can simulate and model almost all modern DRAM protocols along with many of their unique features.
IEEE Computer Architecture Letters
2019
Abhishek Chakraborty and Ankur Srivastava
Paper on hardware-software co-design based obfuscation of hardware accelerators proposes hardware-software co-design based obfuscation approach to render unactivated accelerator chip functionally useless.
IEEE Annual Symposium on VLSI 2019
Ankit Mondal, Ankur Srivastava
The research proposes the use of magnetic tunnel junctions as stochastic number generators in an SC-based hardware implementation of neural networks. The proposed algorithm brings about a 40% reduction in energy consumption with less than 1% accuracy loss on the 2-layer MNIST network.
ACM Journal on Emerging Technologies in Computing Systems
Abhishek Chakraborty, Nithyashankari Gummidipoondi Jayasankaran, Yuntao Liu, Jeyavijayan Rajendran, Ozgur Sinanoglu, Ankur Srivastava, Yang Xie, Muhammad Yasin, Michael Zuzak
A survey of the evolution of logic locking and a primer for researchers interested in developing novel techniques in new domains. The authors introduce various “cat and mouse” games involved in logic locking along with its novel applications—including, processor pipelines, graphics-processing units, and analog circuits.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
2020
Brian Kim, Yalin Sagduyu, Kemal Davaslioglu, Tugba Erpek, Sennur Ulukus
Demonstrates the feasibility of covert communications in a wireless communication system when a cooperative jammer designs its perturbation signal to fool an eavesdropper's DL-based classfier into classifying ongoing transmissions as noise.
arXiv.org
Brian Kim, Yalin E. Sagduyu, Kemal Davaslioglu, Tugba Erpek, Sennur Ulukus
Presents over-the-air adversarial attacks against deep learning-based modulation classifiers, accounting for realistic channel and broadcast transmission effects. A certified defense method using randomized smoothing is also included.
arXiv.org
Melih Bastopcu, Baturalp Buyukates, Sennur Ulukus
Proposes a selective encoding scheme for a status updating system in which an information source generates independent and identically distributed update packets based on an observed random variable X which takes n values based on a known pmf.
arXiv.org
Sajani Vithana, Karim Banawan, Sennur Ulukus
The paper proposes two achievable schemes for achieving semantic private information retrieval capacity.
arXiv.org
Baturalp Buyukates, Sennur Ulukus
This work looks at an information update system in which status update packets are generated by a sampler and sent to a monitor node through a server node. Two scenarios are considered: Gilbert-Elliot service times and i.i.d. interarrival times; and Gilbert-Elliot interarrival times and i.i.d. service times. The authors determined the average age at the monitor node for both scenarios and characterized the age-optimal state transition matrix for the underlying Markov chain with and without an average cost constraint on the operation of the system.
arXiv.org
Melih Bastopcu, Sennur Ulukus
This work considers an information updating system where a source produces updates as requested by a transmitter, and observes a tradeoff between the attained average age and the mutual information between the original and partial updates.
arXiv.org
Melih Bastopcu, Sennur Ulukus
This work addresses the problem of optimal operation of a resource-constrained sampler that wishes to track multiple independent counting processes in a way that is as up to date as possible.
arXiv.org
Melih Bastopcu, Baturalp Buyukates, Sennur Ulukus
The researchers consider a status updating system in which an information source generates independent and identically distributed update packets based on an observed random variable X which takes n values based on a known probability mass function (pmf). The proposed selective policy achieves a lower average age than encoding all the realizations and determine the age-optimal k values for arbitrary pmfs.
arXiv.org
Baturalp Buyukates, Alkan Soysal, Sennur Ulukus
A study of age of information in a multiple source-multiple destination setting with a focus on its scaling in large wireless networks.
ece.umd.edu
Zhusheng Wang, Karim Banawan, Sennur Ulukus
An information theoretic approach to the Private Set Intersection (PSI) problem shows that it can be successfully recast as a multi-message symmetric private information retrieval (MM-SPIR) problem with message size 1.
arXiv.org
2019
Melih Bastopcu, Sennur Ulukus
The authors design an information update system that strikes a desired balance between information quality and freshness by solving for the optimum update scheme subject to a desired distortion level.
arXiv.org
Baturalp Buyukates, Sennur Ulukus
Investigates the age performance of uncoded and coded computation distribution algorithms and shows that a minimum data set-coded task distribution scheme asymptotically outperforms uncoded and repetition coded schemes.
arXiv.org
Karim Banawan, Sennur Ulukus
Explores the secure degrees of freedom of three new channel models: broadcast channel with combating helper, interference channel with selfish users, and multiple-access wiretap channel with deviating users. The paper investigates various malicious interactions that arise in networks, including active adversaries, and proves that a deviating user can drive the secure degrees of freedom to zero. However, the remaining users can exploit the intentional jamming signals as cooperative jamming signals against the eavesdropper and achieve an optimum secure degrees of freedom.
Entropy
