检索结果-内蒙古大学图书馆

39th IEEE international conference on Computer Communications (IEEE INFOCOM)

作者： Hu, Shaoling Chen, Wei Tsinghua Univ Beijing Natl Res Ctr Informat Sci & Technol Dept Elect Engn Beijing 100084 Peoples R China

ISBN: (纸本)9781728186955

Real-time status updating plays a pivotal role in automated control, situational awareness, and networked monitoring. However, how to balance data freshness and its distortion due to lossy compression remains open. In this paper, we are interested in the optimal cross-layer policy that minimizes the Age-of-Information (AoI) and distortion simultaneously over an ON/OFF channel. Specifically, we formulate a hierarchical framework to jointly schedule the lossy compression in the application layer and the packet scheduling in the physical layer. In the application layer, we characterize the compression loss using age or forgetting factor weighted distortion. the optimal tradeoff between the age reduction and compression loss is then revealed via convex optimizations. It allows us to further determine how many packets to send in the physical layer based on a probabilistic scheduling policy. To this end, a Constrained Markov Decision Process (CMDP) problem is formulated and solved by Linear programming (LP), which gives the optimal tradeoff between the data freshness and distortion, as well as, the optimal cross-layer strategy to strike the AoI-distortion tradeoff.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

InterLock: An Intercorrelated logic and Routing Locking 20

InterLock: An Intercorrelated Logic and Routing Locking

引用

39th IEEE/ACM international conference On Computer Aided Design (ICCAD)

作者： Kamali, Hadi Mardani Azar, Kimia Zamiri Homayoun, Houman Sasan, Avesta George Mason Univ Fairfax VA 22030 USA Univ Calif Davis Davis CA 95616 USA

ISBN: (纸本)9781665423243

In this paper, we propose a canonical prune-and-SAT (CP&SAT) attack for breaking state-of-the-art routing-based obfuscation techniques. In the CP&SAT attack, we first encode the key-programmable routing blocks (keyRBs) based on an efficient SAT encoding mechanism suited for detailed routing constraints, and then efficiently re-encode and reduce the CNF corresponded to the keyRB using a bounded variable addition (BVA) algorithm. In the CP&SAT attack, this is done before subjecting the circuit to the SAT attack. We illustrate that this encoding and BVA-based pre-processing significantly reduces the size of the CNF corresponded to the routing-based obfuscated circuit, in the result of which we observe 100% success rate for breaking prior art routing-based obfuscation techniques. Further, we propose a new intercorrelated logic and routing locking technique, or in short InterLock, as a countermeasure to mitigate the CP&SAT attack. In Interlock, in addition to hiding the connectivity, a part of the logic (gates) in the selected timing paths are also implemented in the keyRB(s). We illustrate that when the logic gates are twisted with keyRBs, the BVA could not provide any advantage as a pre-processing step. Our experimental results show that, by using InterLock, with only three 8x8 or only two 16x16 keyRBs (twisted with actual logic gates), the resilience against existing attacks as well as our new proposed CP&SAT attack would be guaranteed while, on average, the delay/area overhead is less than 10% for even medium-size benchmark circuits.

关键词： logic Obfuscation Routing Obfuscation the SAT Attack

来源：评论

学校读者我要写书评

暂无评论

Automated Traffic Engineering in SDWAN: Beyond Reinforcement Learning

Automated Traffic Engineering in SDWAN: Beyond Reinforcement...

引用

39th IEEE international conference on Computer Communications (IEEE INFOCOM)

作者： Liu, Libin Chen, Li Xu, Hong Shao, Hua Tencent Shenzhen Peoples R China Huawei Shenzhen Peoples R China City Univ Hong Kong Hong Kong Peoples R China Tsinghua Univ Beijing Peoples R China

ISBN: (纸本)9781728186955

Traffic engineering (TE) is a critical and difficult problem that involves assigning traffic with various requirements to paths with different constraints. Recently, machine learning algorithms, especially deep neural networks (DNN), are applied to TE, yet they all assume that the network is a black box, limiting them to only model-free reinforcement learning (RL) algorithms. In this paper, we introduce differentiable programming to TE, and show that the network environment can be sufficiently modeled for TE optimization. Specifically, we design a fully-differentiable network environment, ONE, that can be directly integrated into any DNN models. With ONE, we can differentiate with respect to control parameters, and directly evaluate gradients between actions and states to facilitate gradient descent based training of DNN models. We show with a proof-of-concept prototype that ONE accelerates DNN training for TE by 228x and achieves higher scalability compared to existing network simulators. Most importantly, dNE opens up the possibility to apply arbitrary deep learning models to TE beyond RL.

关键词： Differentiable programming deep neural networks (DNN) traffic engineering (TE)

来源：评论

学校读者我要写书评

暂无评论

TOPOLOGY OPTIMIZATION OF CABLE-ACTUATED, SHAPE-CHANGING, TENSEGRITY SYSTEMS FOR PAth GENERATION

TOPOLOGY OPTIMIZATION OF CABLE-ACTUATED, SHAPE-CHANGING, TEN...

引用

American-Society-of-Mechanical-Engineers(ASME) international Design Engineering Technical conferences / 39th American-Society-of-Mechanical-Engineers(ASME) Computers and Information in Engineering conference (IDETC-CIE)

作者： Myszka, David H. Joo, James J. Woods, Daniel C. Murray, Andrew P. Univ Dayton Dayton OH 45469 USA Air Force Res Lab Wright Patterson AFB OH 45433 USA

ISBN: (纸本)9780791859247

this paper presents a topology optimization methodology synthesize cable-actuated, shape-changing, tensegrity sysns specified through path generation requirements. Estabished segrity topology optimization procedures exist for static struces. For active tensegrity systems, motion characteristics are ically explored after the structural topology is determined. e work presented in this paper extends the established procere to introduce prescribed motion into the topology optimizan. A ground structure approach is used in conjunction with the sign space. the topology optimization problem is formulated o a mixed integer linear programming problem. Desired mon is prescribed by identifying trace points in the design space I corresponding paths. the result of this methodology is the ation of a tensegrity system that can achieve shape-change as cified with prescribed paths.

关键词： Cables Optimization Shapes Topology Tensegrity Design Integer programming

来源：评论

学校读者我要写书评

暂无评论

COALA: Concurrently Assigning Wire Segments to Layers for 2D Global Routing 20

COALA: Concurrently Assigning Wire Segments to Layers for 2D...

引用

39th IEEE/ACM international conference On Computer Aided Design (ICCAD)

作者： Jiang, Yun-Jhe Fang, Shao-Yun Natl Taiwan Univ Sci & Technol Dept Elect Engn Taipei 106 Taiwan

ISBN: (纸本)9781665423243

Two-dimensional (2D) global routing followed by layer assignment is a common and popular strategy to obtain a good trade-off between runtime and routing performance. Yet, the huge gap between 2D routing patterns and the final 3D routing paths often results in inevitable overflow after layer assignment. State-of-the-art studies on layer assignment usually adopt dynamic programming-based approaches to sequentially find an optimal solution for each net in terms of overflow or/and the number of vias. However, a fixed assignment ordering severely restricts the solution space, and the distributed overflows can hardly be resolved with any existing refinement approach. this paper proposes a novel layer assignment framework that concurrently considers all the wire segments of nets and iteratively assigns them from the lowest available layer to the highest one. the concurrent scheme facilitates the maximal utilization of routing resource on each layer, contributing to an effective re-routing procedure that greatly reduces inevitable overflows. Experimental results show that compared to the sequential layer assignment solutions that also refined by the same re-routing procedure, the proposed framework can averagely reduce the maximum overflow in a tile by 32% and reduce the number of tiles with overflows by 28% with much less runtime, which shows the significant advantage of concurrent layer assignment over sequential methods.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Integration of Normative Decision-Making and Batch Sampling for Global Metamodeling

引用

JOURNAL OF MECHANICAL DESIGN 2020年第3期142卷 1-11页

作者： van Beek, Anton Tao, Siyu Plumlee, Matthew Apley, Daniel W. Chen, Wei Northwestern Univ Dept Mech Engn 2145 Sheridan RdRoom AG14 Evanston IL 60208 USA Northwestern Univ Dept Ind Engn & Management Sci 2145 Sheridan RdRoom M233 Evanston IL 60208 USA

the cost of adaptive sampling for global metamodeling depends on the total number of costly function evaluations and to which degree these evaluations are performed in parallel. Conventionally, samples are taken through a greedy sampling strategy that is optimal for either a single sample or a handful of samples. the limitation of such an approach is that they compromise optimality when more samples are taken. In this paper, we propose a thrifty adaptive batch sampling (TABS) approach that maximizes a multistage reward function to find an optimal sampling policy containing the total number of sampling stages, the number of samples per stage, and the spatial location of each sample. Consequently, the first batch identified by TABS is optimal with respect to all potential future samples, the available resources, and is consistent with a modeler's preference and risk attitude. Moreover, we propose two heuristic-based strategies that reduce numerical complexity with a minimal reduction in optimality. through numerical examples, we show that TABS outperforms or is comparable with greedy sampling strategies. In short, TABS provides modelers with a flexible adaptive sampling tool for global metamodeling that effectively reduces sampling costs while maintaining prediction accuracy.

关键词： adaptive sampling metamodeling dynamic programming approximation-basedoptimal design decision theory

来源：评论

学校读者我要写书评

暂无评论

Age of Incorrect Information for Remote Estimation of a Binary Markov Source

Age of Incorrect Information for Remote Estimation of a Bina...

引用

39th IEEE international conference on Computer Communications (IEEE INFOCOM)

作者： Kam, Clement Kompella, Sastry Ephremides, Anthony Naval Res Lab Informat Technol Div Washington DC 20375 USA Univ Maryland Elect & Comp Engn Dept College Pk MD 20742 USA

ISBN: (数字)9781728186955

ISBN: (纸本)9781728186955

For monitoring applications, the Age of Information (AoI) metric has been the primary focus of recent research, but closely related to monitoring is the problem of real-time or remote estimation. Age of Information has been shown to be insufficient for minimizing remote estimation error, but recently a metric known as Age of Incorrect Information (AoII) was proposed that characterizes the cost of a monitor being in an erroneous state over time. In this work, we study the AoII metric in the simple context of monitoring a symmetric binary information source over a delay system with feedback. We compare three different performance metrics: real-time error, AoI, and AoII. For each metric, we formulate the optimal sampling problem as a Markov decision process and apply a dynamic programming algorithm to compute the optimal performance and policy. We also simulate the system for two sampling policies: sample-at-change and zero-wait, and we observe which policy coincides with the optimal policy for each metric. For a variety of delay distributions and AoII penalty functions, we observe that the optimal policy for the real-time error and for AoII are equal to the sample-at-change policy, whereas the optimal policy for AoI is a threshold policy.

关键词： Real-time systems Monitoring Delays Markov processes Estimation Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Adaptable and Divergent Synthetic Benchmark Generation for Hardware Security 20

Adaptable and Divergent Synthetic Benchmark Generation for H...

引用

39th IEEE/ACM international conference On Computer Aided Design (ICCAD)

作者： Amir, Sarah Forte, Domenic Univ Florida Gainesville FL 32611 USA

ISBN: (纸本)9781665423243

Benchmarking can drive the development of technologies by facilitating standardization of features for comparison of different methods. While hardware security has seen an exponential growth in innovation throughout the last decade, the lack of sufficient benchmarks for data-driven analysis is prominent. Researchers must currently rely on decades-old VLSI benchmarks, which in most cases were not designed with security evaluation in mind. Considering the present day computational power, these benchmarks lack in both quality and quantity for usage in hardware security topics such as obfuscation and hardware Trojans. Many advanced techniques, like statistical analysis and machine learning, require a large number of samples in order to sufficiently examine the feature space. In an attempt to resolve this issue, we have developed the first synthetic benchmark generation process flow. this paper describes our novel technique that utilizes linear optimization to generate an endless number of synthetic combinational benchmarks that are adaptable to user input constraints and divergent in quantifiable structural features from input reference benchmarks. thus, our framework offers customization for generating richer and more challenging benchmarks for data-driven hardware security. through experimentation, we verify that our benchmarks offers more structural variation than the current benchmark suites.

关键词： Synthetic benchmark hardware security linear programming

来源：评论

学校读者我要写书评

暂无评论

Meshed Stack Via Design Considering Complicated Design Rules with Automatic Constraint Generation 20

Meshed Stack Via Design Considering Complicated Design Rules...

引用

39th IEEE/ACM international conference On Computer Aided Design (ICCAD)

作者： Yang, Kai-Chuan Yu, Tao-Chun Fang, Shao-Yun Cheng, Teng-Yuan Liu, Yang-Chun Shen, Cindy Chin-Fang Natl Taiwan Univ Sci & Technol Dept Elect Engn Taipei 106 Taiwan Synopsys Taiwan Co Ltd Taipei 106 Taiwan

ISBN: (纸本)9781665423243

In advanced semiconductor processes, the dramatic shrink of layout features has made a significant impact on circuit delay and electromigration (EM). Recently, meshed stack vias (MSVs) have been proposed as a solution to improve circuit timing and signal integrity, each of which is a multi-layer mesh structure composed of parallel metal shapes and vias. Due to the introduced MSV rules and more and more complicated design rules, MSV design becomes a very challenging problem, while no previous work has addressed this issue. In this paper, we propose the first work of MSV design by developing two different methods: an integer linear programming (ILP)-based and a dynamic programming (DP)based methods. Unlike most previous works devoting themselves to formulating sophisticated constraints for each complicated design rule, we propose an automatic constraint generation (ACG) framework to iteratively resolve design rule violations (DRVs) without any effort in understanding all design rules, which contributes to a general MSV design methodology applicable to different technology nodes. Experimental results show that both the ILP-based and DP-based approaches can averagely achieve 92% MSV insertion rate for a set of industrial benchmarks. In addition, by adopting the proposed ACG framework, 100% MSV insertion rate can be achieved without causing any DRV.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Minimizing the Age of Synchronization in Power-Constrained Wireless Networks with Unreliable Time-Varying Channels

Minimizing the Age of Synchronization in Power-Constrained W...

引用

39th IEEE international conference on Computer Communications (IEEE INFOCOM)

作者： Zhang, Qining Tang, Haoyue Wang, Jintao Tsinghua Univ Dept Elect Engn Beijing Natl Res Ctr Informat Sci & Technol BNRis Beijing Peoples R China Tsinghua Univ Shenzhen Res Inst Shenzhen Peoples R China

ISBN: (数字)9781728186955

ISBN: (纸本)9781728186955

We study a network with a central controller collecting random updates from power-limited sensors. the time varying channels between sensors and the central controller are modeled as ergodic Markov chains while packet-loss may happen due to decoding error. We measure the data freshness from the central controller by the metric Age of Synchronization (AoS), i.e., the average time elapsed since information about a sensor becomes desynchronized. To minimize the average AoS under all aforementioned bandwidth and power constraints, we first relax the hard bandwidth limit and decouple the multi-sensor problem into a single-sensor constrained Markov decision process (CMDP), which is then solved through linear programming (LP). We then propose an asymptotic optimal scheduling policy to solve the original hard-bandwidth-constrained problem. It is revealed that sensors are more likely to send updates under better channel states and higher AoS to save energy and avoid packet-loss.

关键词： Sensors Bandwidth Wireless sensor networks Synchronization Markov processes Linear programming

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：