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

International Conference on Solid-State and Integrated Circuit Technology

作者： Tianyu Zhang Fan Ye Shunli Ma State-key Laboratory of ASIC and System Fudan University Shanghai China

ISBN: (数字)9798350361834

ISBN: (纸本)9798350361841

This paper proposes a multi-sampling mode capacitor DAC (CDAC) for a 12-bit 200MS/s pipelined-SAR ADC, addressing the issue of overfitting in neural network-based calibrations. By implementing normal, offset, and proportional sampling modes, the design ensures the linearity of the ADC's transfer function. The proposed CDAC utilizes a bottom-plate sampling method and a high-linearity bootstrap circuit. Simulation results demonstrate that the proposed ADC achieves an SFDR of around 75dB and an ENOB of approximately 10.8bits across all sampling modes, validating the effectiveness of the design in enhancing ADC performance.

关键词： Integrated circuit technology Simulation Capacitors Transfer functions Linearity Logic gates Sampling methods approximation algorithms Calibration Overfitting

来源：评论

学校读者我要写书评

暂无评论

Target Tracking Algorithm Based on Variational Bayes

Target Tracking Algorithm Based on Variational Bayes

引用

Intelligent Computing and Human-Computer Interaction (ICHCI), International Conference on

作者： Yin Li Yongchao Lu Yang Mu Northwest Institute of Mechanical & Electrical Engineering Xianyang China Northwestern Polytechnical University School of Marine Science and Technology Xi'an China

ISBN: (数字)9798350368284

ISBN: (纸本)9798350368291

To address the problem of low tracking accuracy caused by unknown excitation and measurement noise in radar systems, a tracking algorithm based on variational Bayes is proposed. This algorithm leverages variational Bayes theory to treat the unknown excitation and measurement noise as hidden variables, enabling the computation of the likelihood probability of the target motion state. By decoupling these hidden variables under the expected maximum criterion and field theory, an approximate estimation of the hidden variables is obtained. These estimates are then combined with the unscented Kalman filter to achieve target state estimation. Through iterative updates of the target state, excitation, and measurement noise parameters, high-precision target tracking is achieved. Additionally, an evaluation method to terminate the iterative process is proposed. Simulation results demonstrate that the variational Bayes-based target tracking algorithm can effectively suppress tracking divergence issues caused by unknown parameters, leading to stable tracking performance and significant improvements in target state estimation accuracy. The algorithm consistently achieves stable target tracking across various target motion models, measurement errors, noise errors, and iteration termination values. These results indicate that the proposed method holds promising potential for practical applications.

关键词： Target tracking Accuracy Noise Radar tracking approximation algorithms Iterative algorithms Bayes methods Noise measurement Kalman filters State estimation

来源：评论

学校读者我要写书评

暂无评论

Obfuscating Quantum Hybrid-Classical algorithms for Security and Privacy

Obfuscating Quantum Hybrid-Classical Algorithms for Security...

引用

IEEE International Symposium on Quality Electronic Design

作者： Suryansh Upadhyay Swaroop Ghosh The Pennsylvania State University University Park PA USA

ISBN: (数字)9798350309270

ISBN: (纸本)9798350309287

As quantum computing gains popularity, it’s crucial to tackle security and privacy issues upfront. One major concern is the involvement of third-party tools and hardware. With more quantum computing services available, even from less reputable sources, users might be drawn in by lower costs and easier access. However, usage of untrusted hardware could present the risk of intellectual property (IP) theft. For instance, popular algorithms like Quantum Approximate Optimization Algorithm (QAOA) encode graph properties in parameterized quantum circuits, opening the door to potential risks. For mission critical applications like power grid optimization, the graph structure can reveal the power grid and their connectivity (an IP that should be protected). To mitigate this risk, we propose an edge pruning obfuscation method for QAOA along with a split iteration methodology. The basic idea is to, (i) create two flavors of QAOA circuit each with few distinct edges eliminated from the problem graph for obfuscation, (ii) iterate the circuits alternately during optimization process to uphold the optimization quality, and (iii) send the circuits to two different untrusted hardware provider so that the adversary has access to partial graph protecting the IP. We demonstrate that combining edge pruning obfuscation with split iteration on two different hardware secures the IP and increases the difficulty of reconstruction while limiting performance degradation to a maximum of 10% ($\approx 5$% on average) and maintaining low overhead costs (less than 0.5X for QAOA with single layer implementation).

关键词： Privacy Costs Limiting Mission critical systems approximation algorithms Hardware Power grids

来源：评论

学校读者我要写书评

暂无评论

Mapping of Debris Cover with Thematic Indices and Mono-Window Algorithm Over Zemu Glacier in Sikkim Himalaya

Mapping of Debris Cover with Thematic Indices and Mono-Windo...

引用

Geoscience and Remote Sensing Symposium (M2GARSS), Mediterranean and Middle-East

作者： Nikita Roy Mukherjee A. P. Krishna Department of Remote Sensing Birla Institute of Technology Mesra Jharkhand India

ISBN: (数字)9798350358582

ISBN: (纸本)9798350358599

Zemu Glacier, a prominent glacier in the eastern Himalayas, remains largely unexplored in various glacier research endeavors. Satellite remote sensing and GIS techniques function as valuable tools for appraising temporal changes in remote glacial terrains that are challenging to reach. The scope of this study explores the distinguished prospective routes of automated mapping of glacial land cover using visible and thermal-infrared (TIR) bands of Landsat series along with the Mono-Window algorithm to calculate Glacial surface temperature (GST) for the spatial distribution of debris cover and Shuttle Radar Topographic Mission (SRTM) Digital Elevation Model (DEM) for slope and aspect. The temporal change analysis of debris-cover portrays more than 50% of the approximate change from the year 1989 to 2022.

关键词： Surface cleaning Temperature distribution Satellites Spaceborne radar Snow Land surface approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Whittle Index Learning algorithms for Restless Bandits with Constant Stepsizes

Whittle Index Learning Algorithms for Restless Bandits with ...

引用

Conference on Information and Communication Technology (CICT)

作者： Vishesh Mittal Rahul Meshram Surya Prakash ECE Deptt. IIIT Allahabad EE Deptt. IIT Madras

ISBN: (数字)9798331531539

ISBN: (纸本)9798331531546

We study the Whittle index learning algorithm with Q-Iearning for restless multi-armed bandits. We first discuss Q-learning algorithm with exploration policies-E-greedy, softmax, e-softmax with constant stepsizes. We extend the study of Q-learning to index learning for single-armed restless bandit. The algorithm of index learning is two-timescale variant of stochastic approximations. On slower timescales, we update index and on faster timescales, we update Q-Iearning by assuming fixed index value. Here, Q-Iearning updates are in asynchronous manner. We study constant stepsizes two timescale stochastic approximations algorithm. Further, we study on index learning with deep Q-networks (DQN) learning and linear function approximations using state-aggregations method. We describe the performance of our algorithms using numerical examples and it illustrates that index learning with Q learning DQN and function approximations learns the Whittle index.

关键词： Q-learning approximation algorithms Information and communication technology Indexes Function approximation

来源：评论

学校读者我要写书评

暂无评论

Fine-Grained Privacy Guarantees for Coverage Problems

arXiv

引用

arXiv 2024年

作者： Dhulipala, Laxman Li, George Z. University of Maryland MD United States

We introduce a new notion of neighboring databases for coverage problems such as Max Cover and Set Cover under differential privacy. In contrast to the standard privacy notion for these problems, which is analogous to node-privacy in graphs, our new definition gives a more fine-grained privacy guarantee, which is analogous to edge-privacy. We illustrate several scenarios of Set Cover and Max Cover where our privacy notion is desired one for the application. Our main result is an ǫ-edge differentially private algorithm for Max Cover which obtains an (1 − 1/e − η, Õ(k/ǫ))-approximation with high probability. Furthermore, we show that this result is nearly tight: we give a lower bound show that an additive error of Ω(k/ǫ) is necessary under edge-differential privacy. Via group privacy properties, this implies a new algorithm for ǫ-node differentially private Max Cover which obtains an (1 − 1/e − η, Õ(fk/ǫ))-approximation, where f is the maximum degree of an element in the set system. When f k, this improves over the best known algorithm for Max Cover under pure (node) differential privacy, which obtains an (1 − 1/e, Õ(k2/ǫ))-approximation. We show that our techniques also apply to the Set Cover problem under differential privacy. Like previous work [GLM+10], we consider the problem of outputting an implicit set cover solution and give a O(poly log n/ǫ)-approximation algorithm for the problem under ǫ-edge differential privacy. Again via group privacy guarantees, this implies an O(f · poly log n/ǫ)-approximation algorithm for the problem under ǫ-node differential privacy. In particular, this is the first non-trivial approximation algorithm for outputting an implicit set cover under pure node-differential privacy. Previous work only guarantees the weaker notion of approximate node differential privacy. © 2024, CC BY.

关键词： approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Approximate Counting of Permutation Patterns

arXiv

引用

arXiv 2024年

作者： Ben-Eliezer, Omri Mitrović, Slobodan Srivastava, Pranjal Department of Computer Science Technion Haifa Israel UC Davis CA United States Massachusetts Institute of Technology CambridgeMA United States

We consider the problem of counting the copies of a length-k pattern σ in a sequence f: [n] → R, where a copy is a subset of indices i1 k ∈ [n] such that f(ij) ) if and only if σ(j) Ω(k/ log k) [Berendsohn, Kozma, and Marx 2019] and is expected to be polynomially harder than detection as early as k = 4, given its equivalence to counting 4-cycles in graphs [Dudek and Gawrychowski, 2020]. In this work, we design a deterministic near-linear time (1 + Ε)-approximation algorithm for counting σ-copies in f for all k ≤ 5. Combined with the conditional lower bound for k = 4, this establishes the first known separation between approximate and exact algorithms for pattern counting. Interestingly, our algorithm leverages the Birgé decomposition – a sublinear tool for monotone distributions widely used in distribution testing – which, to our knowledge, has not been applied in a pattern counting context before. Copyright © 2024, The Authors. All rights reserved.

关键词： approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

A (1.5 + Ε)-approximation Algorithm for Weighted Connectivity Augmentation

arXiv

引用

arXiv 2022年

作者： Traub, Vera Zenklusen, Rico Research Institute for Discrete Mathematics and Hausdorff Center for Mathematics University of Bonn Germany Department of Mathematics ETH Zurich Zurich Switzerland

Connectivity augmentation problems are among the most elementary questions in Network Design. Many of these problems admit natural 2-approximation algorithms, often through various classic techniques, whereas it remains open whether approximation factors below 2 can be achieved. One of the most basic examples thereof is the Weighted Connectivity Augmentation Problem (WCAP). In WCAP, one is given an undirected graph together with a set of additional weighted candidate edges, and the task is to find a cheapest set of candidate edges whose addition to the graph increases its edge-connectivity. We present a (1.5 + Ε)-approximation algorithm for WCAP, showing for the first time that factors below 2 are achievable. On a high level, we design a well-chosen local search algorithm, inspired by recent advances for Weighted Tree Augmentation. To measure progress, we consider a directed weakening of WCAP and show that it has highly structured planar solutions. Interpreting a solution of the original problem as one of this directed weakening allows us to describe local exchange steps in a clean and algorithmically amenable way. Leveraging these insights, we show that we can efficiently search for good exchange steps within a component class for link sets that is closely related to bounded treewidth subgraphs of circle graphs. Moreover, we prove that an optimum solution can be decomposed into smaller components, at least one of which leads to a good local search step as long as we did not yet achieve the claimed approximation guarantee. Copyright © 2022, The Authors. All rights reserved.

关键词： approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Congestion-aware Routing and Content Placement in Elastic Cache Networks

Congestion-aware Routing and Content Placement in Elastic Ca...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Jinkun Zhang Edmund Yeh Department of Electrical and Computer Engineering Northeastern University US

ISBN: (数字)9798350383508

ISBN: (纸本)9798350383515

Caching can be leveraged to significantly improve network performance and mitigate congestion. However, characterizing the optimal tradeoff between routing cost and cache deployment cost remains an open problem. In this paper, for a network with arbitrary topology and congestion-dependent nonlinear cost functions, we aim to jointly determine the cache deployment, content placement, and hop-by-hop routing strategies, so that the sum of routing cost and cache deployment cost is minimized. We tackle this mixed-integer nonlinear problem starting with a fixed-routing setting, and then generalize to a dynamic-routing setting. For the fixed-routing setting, a Gradient-combining Frank-Wolfe algorithm with $\left( {\frac{1}{2},1} \right)$-approximation is presented. For the general dynamic-routing setting, we obtain a set of KKT conditions, and devise a distributed and adaptive online algorithm based on these conditions. We demonstrate via extensive simulation that our algorithms significantly outperform a number of baselines.

关键词： Costs Network topology Heuristic algorithms Routing approximation algorithms Cost function Topology

来源：评论

学校读者我要写书评

暂无评论

Inverse Linear Quadratic Regulator Problem for Discrete-Time Systems via LMI

Inverse Linear Quadratic Regulator Problem for Discrete-Time...

引用

Automation, Robotics and Computer Engineering (ICARCE), International Conference on

作者： Qiang Li Wenwu Fan Junlin Xiong School of Information Science and Technology University of Science and Technology of China Hefei China

ISBN: (数字)9798331529505

ISBN: (纸本)9798331529512

This paper focuses on the inverse optimal control problem for discrete-time systems with unknown cost functions using linear matrix inequalities (LMIs). Based on Pontryagin's minimum principle, a novel model-based algorithm is proposed to reconstruct the weight matrices of an unknown quadratic cost function. This algorithm is formulated using LMIs to find a solution to the algebraic Riccati equation, which is then used to determine the weight matrices. We prove that the solution obtained from LMIs belongs to the set of solutions for the inverse optimal control problem. On this basis, a noniterative model-free algorithm is presented to solve the problem without requiring system matrices. The collected data is used to estimate the unknown weight matrices, and we prove that our algorithm can obtain an approximate optimal solution. Finally, an example illustrates the effectiveness of our algorithms, and comparisons show that our algorithms outperform others.

关键词： Discrete-time systems System dynamics Heuristic algorithms Optimal control approximation algorithms Cost function Mathematical models Linear matrix inequalities Numerical models Robots

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：