2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)最新文献_第7页

Graph-Theoretic Analyses of MIMO Channels in Diffusive Networks 扩散网络中MIMO信道的图论分析

2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2019-09-01 DOI: 10.1109/ALLERTON.2019.8919659

Kasra Koorehdavoudi, Sandip Roy

引用次数: 0

Opportunistic Synthesis in Reactive Games under Information Asymmetry 信息不对称条件下反应性游戏的机会综合

2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2019-09-01 DOI: 10.1109/ALLERTON.2019.8919818

A. Kulkarni, Jie Fu

引用次数: 4

A Novel Expression for Computing Time Response of LTI Systems of Arbitrary Order with Applications to Fractional and Stochastic Control 一种计算任意阶LTI系统时间响应的新表达式及其在分数阶和随机控制中的应用

2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2019-09-01 DOI: 10.1109/ALLERTON.2019.8919669

Taha Ameen ur Rahman, S. Mukhopadhyay, Shereen Farhana

引用次数: 0

Sparse Random Linear Network Coding For Low Latency Allcast 低延迟全播稀疏随机线性网络编码

2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2019-09-01 DOI: 10.1109/ALLERTON.2019.8919833

M. Graham, A. Ganesh, R. Piechocki

引用次数: 1

From Alignment to Acyclic Chains: Lexicographic Performance Bounds for Index Coding 从对齐到无环链:索引编码的字典学性能界限

2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2019-09-01 DOI: 10.1109/ALLERTON.2019.8919678

Yucheng Liu, P. Sadeghi

{"title":"From Alignment to Acyclic Chains: Lexicographic Performance Bounds for Index Coding","authors":"Yucheng Liu, P. Sadeghi","doi":"10.1109/ALLERTON.2019.8919678","DOIUrl":"https://doi.org/10.1109/ALLERTON.2019.8919678","url":null,"abstract":"In this work, we study the information-theoretic performance bounds for the index coding problem. Recently, weighted alignment chain models were proposed by generalizing the alignment chain model of Maleki et al. This led to derivation of single-letter performance bounds that are strictly tighter than both the well-known maximum acyclic induced subgraph (MAIS) bound and the internal conflict bound. Here, we propose a more general chain model, namely the acyclic chain. Unlike weighted alignment chains that are constructed by individual messages, acyclic chains can deal with set of messages as their components. This allows a recursive development of new performance bounds. The new acyclic chain bounds subsume the weighted alignment chain bounds and can be strictly tighter. Moreover, a key drawback of the weighted alignment chain bounds is that their improvement over the MAIS bound is limited to a fixed constant value that does not scale with the problem size. In contrast, we show that the new acyclic chain bounds have a desired multiplicative property under the lexicographic product of the index coding side information graphs. As such, the gap between these new bounds and the MAIS bound is not fixed, but can be magnified to a multiplicative factor which is polynomial in the problem size.","PeriodicalId":120479,"journal":{"name":"2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125402987","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}

引用次数: 1

Lagrange Coded Computing with Sparsity Constraints 稀疏约束下的拉格朗日编码计算

2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2019-09-01 DOI: 10.1109/ALLERTON.2019.8919966

Mohammad Fahim, V. Cadambe

引用次数: 14

Information Bottleneck Problem Revisited 重新审视信息瓶颈问题

2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2019-09-01 DOI: 10.1109/ALLERTON.2019.8919752

Farhang Bayat, Shuangqing Wei

引用次数: 5

Comparison principle for linear differential equations with periodic impulsive action 具有周期脉冲作用的线性微分方程的比较原理

2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2019-09-01 DOI: 10.1109/ALLERTON.2019.8919911

V. Bivziuk, V. Slyn'ko

引用次数: 1

Allerton 2019 Past Chairs 2019年阿勒顿过去的主席

2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2019-09-01 DOI: 10.1109/allerton.2019.8919899

引用次数: 0

pSConv: A Pre-defined S parse Kernel Based Convolution for Deep CNNs 基于深度cnn的预定义S解析核卷积

2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2019-09-01 DOI: 10.1109/ALLERTON.2019.8919683

Souvik Kundu, Saurav Prakash, H. Akrami, P. Beerel, K. Chugg

{"title":"pSConv: A Pre-defined S parse Kernel Based Convolution for Deep CNNs","authors":"Souvik Kundu, Saurav Prakash, H. Akrami, P. Beerel, K. Chugg","doi":"10.1109/ALLERTON.2019.8919683","DOIUrl":"https://doi.org/10.1109/ALLERTON.2019.8919683","url":null,"abstract":"The high demand for computational and storage resources severely impedes the deployment of deep convolutional neural networks (CNNs) in limited resource devices. Recent CNN architectures have proposed reduced complexity versions (e.g,. SuffleNet and MobileNet) but at the cost of modest decreases in accuracy. This paper proposes pSConv, a pre-defined sparse 2D kernel based convolution, which promises significant improvements in the trade-off between complexity and accuracy for both CNN training and inference. To explore the potential of this approach, we have experimented with two widely accepted datasets, CIFAR-10 and Tiny ImageNet, in sparse variants of both the ResNet18 and VGG16 architectures. Our approach shows a parameter count reduction of up to 4.24× with modest degradation in classification accuracy relative to that of standard CNNs. Our approach outperforms a popular variant of ShuffleNet using a variant of ResNet18 with pSConv having 3 × 3 kernels with only four of nine elements not fixed at zero. In particular, the parameter count is reduced by 1.7× for CIFAR-10 and 2.29× for Tiny ImageNet with an increased accuracy of ∼ 4%.","PeriodicalId":120479,"journal":{"name":"2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129945999","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}

引用次数: 12