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

38th IEEE International Conference on Data Engineering (ICDE)

作者： Sun, H. Wang, N. Jia, J. Huang, J. Xiong, H. He, L. Liu, X. Zhang, S. Qiao, S. Zhao, J. Xi An Jiao Tong Univ Sch Comp Sci & Technol Xian Peoples R China Xidian Univ Sch Comp Sci & Technol Xian Peoples R China Hong Kong Univ Sci & Technol Dept Artificial Intelligence Thrust Guangzhou Peoples R China Natl Univ Def Technol Sch Comp Changsha Peoples R China Chengdu Univ Informat Technol Chengdu Peoples R China

ISBN: (数字)9781665408837

ISBN: (纸本)9781665408837

Online Event-based social networks (EBSNs), such as Meetup and Whova, which provide platforms for users to publish, arrange and participate in events, have become increasingly popular. A major challenge for managing EBSNs is to generate the most satisfactory event arrangement. Existing approaches usually focus on assigning a set of events organized to time intervals, but ignore the competitive relationships among different event organizers, which will lead to event time allocations unacceptable to organizers. Thus, a more intelligent EBSNs platform that allocates social events properly in a global view (i.e. the perspective of platform) is desired. In this work, we first formally define the problem of Platform-oriented Event Time Allocation (PETA), which contains two parts: the prediction of event feasible time period and the event time allocation. We propose a method to calculate event feasible time period based on event time prediction, and design a greedy algorithm and two approximation algorithms to solve the PETA problem. Extensive experiments on both real and synthetic datasets demonstrate that the proposed algorithms have high effectiveness and efficiency.

关键词： Social event arrangement event time allocation social network platform-oriented approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Synthesis of the Algorithm for Assessing Vehicle Lane Based on a Local Positioning System Using Ultra-Wideband Signals

Synthesis of the Algorithm for Assessing Vehicle Lane Based ...

引用

International Youth Conference on Radio Electronics, Electrical and Power Engineering (REEPE)

作者： Igor B. Galuev Nikita I. Petukhov Stepan V. Orobchenko Adam A. Khabachirov Pavel A. Bondarev Alisa O. Kozhevnikova Radio Systems Department National Research University “MPEI” Moscow Russian Federation

ISBN: (数字)9798331531836

ISBN: (纸本)9798331531843

The task of determining the lane of a vehicle is an urgent task. Such solutions can be used in traffic control systems and toll collection systems on toll roads. Ultra-wideband technology is promising for solving this problem due to the high accuracy of determining the coordinates of an object. This article discusses a vehicle lane detection system using a local navigation system based on ultra-wideband signals. In this work, methods of system design, computer modeling and experimental research were used. As a result of the research, an algorithm was developed and tested, which demonstrated high accuracy in modeling and in practical experiments. The use of the nonlinear range difference approximation method significantly reduced the error in determining the bandwidth, ensuring reliable operation of the algorithm.

关键词： Power engineering Accuracy Computational modeling Roads Traffic control approximation algorithms Systems simulation Reliability System analysis and design Ultra wideband technology

来源：评论

学校读者我要写书评

暂无评论

A Construction of a Sequence of Feedback Controls for Discrete Control Problems Using Asymptotics

A Construction of a Sequence of Feedback Controls for Discre...

引用

International Russian Smart Industry Conference (SmartIndustryCon)

作者： Yulia Danik Mikhail Dmitriev Department 71 Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences Moscow Russia

ISBN: (数字)9798331511241

ISBN: (纸本)9798331511258

This paper explores the possibility of obtaining a symbolic description of a parametric family of synthesizing controls for nonlinear systems without control constraints using the Padé approximation method and the SDRE-based approach for control synthesis. On an example of a discrete optimal control problem with a positive parameter in the system dynamic equations an algorithm for constructing the first terms of a minimizing sequence of controls is proposed, where each term of the obtained control sequence is represented in the state feedback form. This construction is based on a set of neurons by which we understand various asymptotic approximations, Padé approximations (PA), and functions derived from them. Depending on a particular dynamic system a certain number of neurons will be used to get good quality approximation for the control. Asymptotic approximations and the PAs constructed on their basis capture the qualitative structure of the exact solution. Moreover, PAs can be improved through additional optimization procedures and modifications. The process of neurons selection, or activation, can be interpreted as a reinforcement learning algorithm in a certain neural network.

关键词： Training State feedback Regulators System dynamics Neurons Riccati equations Reinforcement learning Artificial neural networks approximation algorithms Feedback control

来源：评论

学校读者我要写书评

暂无评论

Fourth-Order Cumulant Based 3-D Near-Field Underdetermined Parameter Estimation With Exact Spatial Propagation Model

Fourth-Order Cumulant Based 3-D Near-Field Underdetermined P...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Longsheng Jin Hua Chen Jiaxiong Fang Wei Liu Ye Tian Gang Wang Faculty of Electrical Engineering and Computer Science Ningbo University China Department of Electrical and Electronic Engineering The Hong Kong Polytechnic University China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Based on the exact spherical wavefront model, an under-determined estimation method for three-dimensional (3-D) parameters of near-field (NF) sources using L-shaped nested arrays is proposed, referred to as the cumulant algorithm. This algorithm leverages the temporal-spatial domain cumulants of NF sources by constructing virtual data through delayed fourth-order cumulant (FOC) calculations of the original received data. Subsequently, a spatial-spectrum-based subspace method is applied for 3-D NF localization, which involves a 3-D spectral search procedure. Additionally, the maximum number of identifiable NF sources of the proposed algorithm is analyzed. Simulation results demonstrate that, based on the exact spherical wavefront model, the proposed algorithm can achieve underdetermined 3-D parameter estimation of NF sources without any matching process, and it performs better in localization than existing methods.

关键词： Location awareness Solid modeling Three-dimensional displays Parameter estimation Simulation Signal processing algorithms Estimation approximation algorithms Noise measurement Speech processing

来源：评论

学校读者我要写书评

暂无评论

Automation of Node Redundancy for Stable Operation of Various Types of Blockchain Nodes

Automation of Node Redundancy for Stable Operation of Variou...

引用

IEEE International Conference on Consumer Electronics (ICCE)

作者： Kohei Ichihara Souki Aoba Masataka Morishita Advanced Technology Laboratory The Japan Research Institute Limited Tokyo Japan Digital Strategy Department Sumitomo Mitsui Banking Corporation Tokyo Japan Platform Department Ginco Inc. Tokyo Japan CTO Ginco Inc. Tokyo Japan

ISBN: (数字)9798331521165

ISBN: (纸本)9798331521172

This paper describes automation of node redundancy for stable operation of many types of blockchain nodes. In recent years, traditional large companies have gradually begun to consider the use of public blockchains. When using blockchain for mission-critical purposes, it is necessary to operate a large number of nodes to increase redundancy and ensure stable operation. However, as public blockchain technology is rapidly advancing and the number of types is increasing, it is difficult for many companies to efficiently operate nodes. To overcome this difficulty, Ginco Inc. developed a system on the cloud that mainly consists of three main technologies. By automatically creating a snapshot of a volume containing chain data and attaching it to a new node, Ginco Inc. reduced the time required to start up a node. Additionally, in order to prevent requests from clients from being routed to nodes with low chain block heights, Ginco Inc. implemented a function for the load balancer to grasp the block height of each node. Furthermore, when reassigning clients to nodes due to a node failure, Ginco Inc. is able to do the reassignment evenly by using consistent hashing as the mapping algorithm. Using these automatic redundancy technologies, Ginco Inc. was able to implement node services for about 30 types of blockchains with just a few infrastructure engineers. The node services have continued to operate without any large system failure for over 5 years since its launch.

关键词： Hands Automation Redundancy Mission critical systems Companies Routing Load management approximation algorithms Blockchains Consumer electronics

来源：评论

学校读者我要写书评

暂无评论

Hybrid Approaches based on Simulated Annealing, Tabu Search and Ant Colony Optimization for Solving the k-Minimum Spanning Tree Problem

引用

INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS 2021年第2期12卷 708-712页

作者： Addou, El Houcine Serghini, Abelhafid Mermri, El Bekkaye Mohammed I Univ LANO Lab FSO ESTO BV Mohamed VI BP 717 Oujda 60000 Morocco Mohammed I Univ FSO BV Mohamed VI BP 717 Oujda 60000 Morocco

In graph theory, the k-minimum spanning tree problem is considered to be one of the well-known NP hard problems to solve. This paper address this problem by proposing several hybrid approximate approaches based on the combination of simulated annealing, tabu search and ant colony optimization algorithms. The performances of the proposed methods are compared to other approaches from the literature using the same well-known library of benchmark instances.

关键词： k-Minimum spanning tree metaheuristics simulated annealing ant colony optimization algorithms tabu search approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Exploring the Limitations of Structured Orthogonal Dictionary Learning

arXiv

引用

arXiv 2025年

作者： Dash, Anirudh Siripuram, Aditya Department of Electrical Engineering Indian Institute of Technology Hyderabad Pakistan

This work is motivated by recent applications of structured dictionary learning, in particular when the dictionary is assumed to be the product of a few Householder atoms. We investigate the following two problems: 1) How do we approximate an orthogonal matrix V with a product of a specified number of Householder matrices, and 2) How many samples are required to learn a structured (Householder) dictionary from data? For 1) we discuss an algorithm that decomposes V as a product of a specified number of Householder matrices. We see that the algorithm outputs the decomposition when it exists, and give bounds on the approximation error of the algorithm when such a decomposition does not exist. For 2) given data Y = HX, we show that when assuming a binary coefficient matrix X, the structured (Householder) dictionary learning problem can be solved with just 2 samples (columns) in Y. © 2025, CC BY.

关键词： approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

CRIS-b: A High-Speed Unified Modulo Reduction Algorithm and Hardware Architecture for CRYSTALS-Kyber

CRIS-b: A High-Speed Unified Modulo Reduction Algorithm and ...

引用

International Conference on VLSI Design

作者： Alip Majumdar Rahul Shrestha School of Computing and Electrical Engineering Indian Institute of Technology Mandi

ISBN: (数字)9798331522445

ISBN: (纸本)9798331522452

This paper presents highly reliable algorithm and high-speed hardware architecture for a unified modulo reduction for CRYSTALS-Kyber. This new architecture for modulo reduction is capable of operating at a maximum clock frequency of 351.62 MHz on Artix-7 FPGA platform, consuming a latency of 5 clock cycles, which is approximately 35.24% faster than state-of-the-art implementations. In this work, we have alleviated the size expansion problem of intermediate value of the conventional Barrett algorithm (which is one of the fastest and most reliable algorithm for modulo reduction, reported in literature) by suggesting a new technique, referred as “Conditional $R$ -index Switching for $b$ -value Minimization (CRIS-b)”. We propose a unified modulo reduction design handling both positive and negative spectrum numbers for all arithmetic modulo operations in a butterfly unit of Number Theoretic Transform(NTT).

关键词： Accuracy Switches Very large scale integration Reliability theory approximation algorithms Minimization Hardware Quantum cryptography Clocks Arithmetic

来源：评论

学校读者我要写书评

暂无评论

Robust and Sample Optimal algorithms for PSD Low Rank approximation

Robust and Sample Optimal Algorithms for PSD Low Rank Approx...

引用

Annual IEEE Symposium on Foundations of Computer Science

作者： Ainesh Bakshi Nadiia Chepurko David P. Woodruff CMU MIT

ISBN: (数字)9781728196213

ISBN: (纸本)9781728196220

Recently, Musco and Woodruff (FOCS, 2017) showed that given an n×n positive semidefinite (PSD) matrix A, it is possible to compute a (1+ε-approximate relative-error low-rank approximation to A by querying Õ(nk/ε 2.5 ) entries of A in time Õ(nk/ε 2.5 +nk ω-1 /ε 2(ω-1) ). They also showed that any relative-error low-rank approximation algorithm must query Ω(nk/ε) entries of A, this gap has since remained open. Our main result is to resolve this question by obtaining an optimal algorithm that queries Õ(nk/ε) entries of A and outputs a relative-error low-rank approximation in Õ(n·(k/ε) ω-1 ) time. Note, our running time improves that of Musco and Woodruff, and matches the information-theoretic lower bound if the matrix-multiplication exponent ω is 2. We then extend our techniques to negative-type distance matrices. Here, our input is a pair-wise distance matrix A corresponding to a point set P={x 1 , x 2 , ..., x n } such that A i, j =||x i -x j ||2 2 . Bakshi and Woodruff (NeurIPS, 2018) showed a bi-criteria, relative-error low-rank approximation for negative-type metrics. Their algorithm queries Õ(nk/ε 2.5 ) entries and outputs a rank-( k+4) matrix. We show that the bi-criteria guarantee is not necessary and obtain an Õ(nk/ε) query algorithm, which is optimal. Our algorithm applies to all distance matrices that arise from metrics satisfying negative-type inequalities, including l 1 ,l 2 , spherical metrics, hypermetrics and effective resistances on a graph. We also obtain faster algorithms for ridge regression. Next, we introduce a new robust low-rank approximation model which captures PSD matrices that have been corrupted with noise. We assume that the Frobenius norm of the corruption is bounded. Here, we relax the notion of approximation to additive-error, since it is information-theoretically impossible to obtain a relative-error approximation in this setting. While a sample complexity lower bound precludes sublinear algorithms for arbitrary PSD matrices, we provid

关键词： approximation algorithms Measurement Covariance matrices Complexity theory Correlation Matrix decomposition Computational modeling

来源：评论

学校读者我要写书评

暂无评论

A Simulation Model of Air Levitation for Reinforcement Learning Applications

A Simulation Model of Air Levitation for Reinforcement Learn...

引用

Cybernetics & Informatics (K&I)

作者： Michal Hlavatý Alena Kozáková Gabriel Gálik Štefan Kozák Slovak University of Technology in Bratislava FEI Bratislava Slovakia Faculty of Informatics Pan-European University Bratislava Slovakia

ISBN: (数字)9798331541811

ISBN: (纸本)9798331541828

In automatic control, Artificial Neual Networks (ANN) can be used to replace any term of the control loop. Mostly, they are used to model highly nonlinear plants with complex dynamics or are designed to mimic standard controllers and further trained for improved performance. Reinforcement Learning (RL) algorithms can also be used as controllers and do not need to be trained on the real plant. Due to the length of the training process and other aspects, it is difficult to select the optimal algorithm and tune its hyperparameters on a real device. Instead, simulation environments are used. The paper presents development of the air levitation simulation environment in the OpenAI Gymnasium framework that supports RL applications. The environment models the challenging complex nonlinear dynamics exhibited by air levitation plants. Using this safe and effective RL algorithm training platform, multiple agents can train in parallel without a threat of damaging physical equipment. The Soft Actor-Critic (SAC) algorithm from the StableBaselines3 library is used to demonstrate efficiency of the developed environment.

关键词： Training Heuristic algorithms Atmospheric modeling Laboratories Reinforcement learning Artificial neural networks Levitation approximation algorithms Libraries Standards

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：