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

IEEE Vehicular Technology Conference

作者： Sheng Xu Shaowei Wang School of Electronic Science and Engineering Nanjing University

ISBN: (纸本)9781509016990

Cloud Radio Access Network (C-RAN) is deemed as a promising architecture to enhance the spectrum and energy efficiency of the cellular systems. The key feature of the C-RAN is that most of signal processing functions are conducted in a centralized baseband unit (BBU) pool. As a result, the remote radio heads (RRHs) that are relatively simple can be distributed in the large network in a cost-efficient manner. In this paper, we investigate the BBU pool placement problem in the C-RAN, where we try to minimize the deployment cost of the BBUs while considering their processing capacities, the traffic demands of RRHs and the signal synchronization between RRHs and BBUs. Our general problem formulation leads to an NP-hard integer programming optimization task. We propose an efficient local search algorithm to address it. Numerical results show that the proposed algorithm converges quickly and always yields a performance-guaranteed solution to the BBU pool planning.

关键词： BBU pool planning C-RAN Local search efficient algorithm Wireless networks POOLS Problem Formulation Clouds SEARCHING algorithm signal processing Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

An efficient Slope Stability algorithm with Physically Consistent Parametrisation of Slip Surfaces

引用

INTERNATIONAL JOURNAL OF CIVIL ENGINEERING 2025年第4期23卷 671-682页

作者： Lalicata, Leonardo Maria Bressan, Andrea Pittaluga, Simone Tamellini, Lorenzo Gallipoli, Domenico Univ Genoa Dept Civil Chem & Environm Engn Genoa Italy CNR Ist Matemat Applicata & Tecnol Informat E Magenes Via Ferrata5-A I-27100 Pavia Italy CNR Ist Matemat Applicata & Tecnol Informat E Magenes Via Marini 6 I-16149 Genoa Italy

This paper presents an optimised algorithm implementing the method of slices for slope stability analysis. The algorithm features a novel physically based parameterisation of slip surfaces, defined by their geometric characteristics at the endpoints, capturing all and only valid failure mechanisms. The algorithm also employs a hybrid discrete-continuous search strategy to identify the critical slip surface, beginning with a discrete computation of the factor of safety over a coarse grid spanning the entire parameter space, followed by a focused continuous exploration of the most promising region via a simplex optimisation. This methodology reduces computational time up to 92% compared to conventional fully discrete algorithms that compute the factor of safety over a fine grid spanning the entire search domain. The novel physically based parametrisation and the hybridisation of the search algorithm allow consideration of slip geometries that are necessarily neglected by conventional fully discrete approaches, leading to an accuracy gain of about 5%. Furthermore, compared to recent fully continuous algorithms, which perform an unbroken exploration of the entire search domain, the computational effort is reduced by up to 33 times while preserving accuracy. These efficiency gains are particularly advantageous for numerically demanding applications like the statistical assessment of slopes with uncertain hydro-mechanical and geometrical properties.

关键词： Slope stability Bishop method Simplex optimisation efficient algorithm

来源：评论

学校读者我要写书评

暂无评论

A efficient algorithm for Molecular Dynamics Simulation on Hybrid CPU-GPU Computing Platforms

A Efficient Algorithm for Molecular Dynamics Simulation on H...

引用

International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery

作者： Dapu Li Wei Ai Yu Ye Jie Liang College of Information Science and Engineering Hunan University Changsha Hunan 410082 China

ISBN: (纸本)9781509040940

In this article, an efficient parallel algorithm for a hybrid CPU-GPU platform is proposed to enable large-scale molecular dynamics (MD) simulations of the metal solidification process. The results, implemented the parallel algorithm program on the hybrid CPU-GPU platform shows better performance than the program based on previous algorithms running on the CPU cluster platform. By contrast, the total execution time of the new program has been obviously decreased. Particularly, because of the use of the modified load balancing method, the neighbor list update time is approximately zero. The parallel program based on the CUDA+OpenMP model shows a factor of 6 16-core calculation speedups compared to the parallel program based on the MPI+OpenMP model, and the optimal computational efficiency is achieved in the simulation system including 10,000,000 aluminum atoms. Finally, the good consistency between them verifies the correctness of the algorithm efficiently, by comparison of the theoretical results and experimental results.

关键词： Graphics processing units Computational modeling Parallel algorithms Mathematical model Runtime Load modeling Heuristic algorithms Parallel algorithms Load modeling Runtime Heuristic algorithms Computational modeling Mathematical Model efficient algorithm Parallel programming Graphics Processing Unit Molecular Dynamics Simulation Platform Simulation Systems execution time

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm for Computing High-Quality Paths amid Polygonal Obstacles 16

An Efficient Algorithm for Computing High-Quality Paths amid...

引用

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete algorithms

作者： Pankaj K. Agarwal Kyle Fox Oren Salzman Duke University Tel Aviv University

ISBN: (纸本)9781510819672

We study a path-planning problem amid a set O of obstacles in R~2, in which we wish to compute a short path between two points while also maintaining a high clearance from O; the clearance of a point is its distance from a nearest obstacle in O. Specifically, the problem asks for a path minimizing the reciprocal of the clearance integrated over the length of the path. We present the first polynomial-time approximation scheme for this problem. Let n be the total number of obstacle vertices and let ε ∈ (0, 1]. Our algorithm computes in time O(n~2/ε~2 log n/ε) a path of total cost at most (1 + ε) times the cost of the optimal path.

关键词： efficient algorithm Byways oxygen optimal path barriers Total Costs Paths

来源：评论

学校读者我要写书评

暂无评论

A New efficient algorithm to Detect Current Transformer Saturation

A New Efficient Algorithm to Detect Current Transformer Satu...

引用

IEEE Power and Energy Society General Meeting

作者： Kanhaiya Kumar Ganesh B. Kumbhar Satish Mahajan Dept. Electrical Engg. Indian Institute of Technology-Roorkee Dept. of Electrical and Computer Engg. Tennessee Tech University

ISBN: (纸本)9781509041695

This paper presents an algorithm to precisely detect the saturation of Current Transformers (CTs). The algorithm is based on first difference of magnitudes of Lissajous Curve. These Lissajous curves are generated using secondary current signal and its first derivative. PSCAD was used to generate secondary current signals for various practical cases of fault currents and MATLAB was used to implement the proposed algorithm. The algorithm is tested for various cases of severe and mild CT saturation. Moreover, the effects of various factors, such as remnant magnetic flux density, noise and burden power factor are studied. Test results reflect that the proposed algorithm efficiently detect the start and end instants of CT Saturation for almost all cases.

关键词： Current transformer (CT) Lissajous Curve Saturation detection Adaptive threshold adaptive thresholding first difference fault currents secondary current Bowditch curve Saturated MATLAB efficient algorithm current transformers algorithms Transformer

来源：评论

学校读者我要写书评

暂无评论

Design of an efficient algorithm to Determine a Near-Optimal Location of Parking Areas for Dangerous Goods in the European Road Transport Network 6th

Design of an Efficient Algorithm to Determine a Near-Optimal...

引用

6th International Conference on Computational Logistics (ICCL)

作者： Caro, Maria D. Fedriani, Eugenio M. Tenorio, Angel F. Pablo de Olavide Univ Dept Econ Quantitat Methods & Econ Hist Seville 41013 Spain

ISBN: (纸本)9783319242644;9783319242637

This paper deals with the problem of locating the minimal number of parking areas being necessary for dangerous goods in the European Road Transport Network. To obtain a near-optimal solution for this problem, we introduce the design of a new graph-based algorithm to locate parking areas in such a way that drivers can obey the regulations related to driving and resting times. This restriction is imposed to the problem as follows: each point in the European Road Transport Network has to be at a distance lower than 200 km from a parking area in the Network.

关键词： efficient algorithm Near-optimal solution Dangerous goods Parking areas European Road Transport Network

来源：评论

学校读者我要写书评

暂无评论

A Parallel and Memory efficient algorithm for Constructing the Contour Tree 8

A Parallel and Memory Efficient Algorithm for Constructing t...

引用

IEEE Pacific Visualization Symposium (PacificVis)

作者： Acharya, Aditya Natarajan, Vijay Indian Inst Sci Supercomp Educ & Res Ctr Bangalore Karnataka India Indian Inst Sci Supercomp Educ & Res Ctr Dept Comp Sci & Automat Bangalore Karnataka India

ISBN: (纸本)9781467368797

The contour tree is a topological structure associated with a scalar function that tracks the connectivity of the evolving level sets of the function. It supports intuitive and interactive visual exploration and analysis of the scalar function. This paper describes a fast, parallel, and memory efficient algorithm for constructing the contour tree of a scalar function on shared memory systems. Comparisons with existing implementations show significant improvement in both the running time and the memory expended. The proposed algorithm is particularly suited for large datasets that do not fit in memory. For example, the contour tree for a scalar function defined on a 8.6 billion vertex domain (2048 x 2048 x 2048 volume data) can be efficiently constructed using less than 10GB of memory.

关键词： I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling SCALAR FUNCTIONS efficient algorithm Memory Memory contour Trees topological structure

来源：评论

学校读者我要写书评

暂无评论

efficient algorithmS FOR FINITE Z-ALGEBRAS

引用

GROUPS COMPLEXITY CRYPTOLOGY 2023年第2期15卷

作者： Kreuzer, Martin Walsh, Florian Univ Passau Fak Informat & Math D-94030 Passau Germany

For a finite Z-algebra R, i.e., for a Z-algebra which is a finitely generated Z-module, we assume that R is explicitly given by a system of Z-module generators G, its relation module Syz(G), and the structure constants of the multiplication in R. In this setting we develop and analyze efficient algorithms for computing essential information about R. First we provide polynomial time algorithms for solving linear systems of equations over R and for basic ideal-theoretic operations in R. Then we develop ZPP (zero-error probabilitic polynomial time) algorithms to compute the nilradical and the maximal ideals of 0-dimensional affine algebras K[x(1),& mldr;,x(n)]/I with K=Q or K=F-p. The task of finding the associated primes of a finite Z-algebra R is reduced to these cases and solved in ZPPIF (ZPP plus one integer factorization). With the same complexity, we calculate the connected components of the set of minimal associated primes minPrimes(R) and then the primitive idempotents of R. Finally, we prove that knowing an explicit representation of R is polynomial time equivalent to knowing a strong Gr & ouml;bner basis of an ideal I such that R=Z[x(1),& mldr;,x(n)]/I.

关键词： Finite Z algebra efficient algorithm polynomial complexity primary decomposi tion primitive idempotents.

来源：评论

学校读者我要写书评

暂无评论

Binary Perceptron: efficient algorithms Can Find Solutions in a RareWell-Connected Cluster 2022

Binary Perceptron: Efficient Algorithms Can Find Solutions i...

引用

54th Annual ACM SIGACT Symposium on Theory of Computing (STOC)

作者： Abbe, Emmanuel Li, Shuangping Sly, Allan Ecole Polytech Fed Lausanne CH-1015 Lausanne Switzerland Princeton Univ Princeton NJ 08544 USA

ISBN: (纸本)9781450392648

It was recently shown that almost all solutions in the symmetric binary perceptron are isolated, even at low constraint densities, suggesting that finding typical solutions is hard. In contrast, some algorithms have been shown empirically to succeed in finding solutions at low density. This phenomenon has been justified numerically by the existence of subdominant and dense connected regions of solutions, which are accessible by simple learning algorithms. In this paper, we establish formally such a phenomenon for both the symmetric and asymmetric binary perceptrons. We show that at low constraint density (equivalently for overparametrized perceptrons), there exists indeed a subdominant connected cluster of solutions with almost maximal diameter, and that an efficient multiscale majority algorithm can find solutions in such a cluster with high probability, settling in particular an open problem posed by Perkins-Xu in STOC'21. In addition, even close to the critical threshold, we show that there exist clusters of linear diameter for the symmetric perceptron, as well as for the asymmetric perceptron under additional assumptions.

关键词： perceptron model neural networks solution space efficient algorithm binary perceptron

来源：评论

学校读者我要写书评

暂无评论

Compact and efficient algorithm for Color Demosaicing

Compact and Efficient Algorithm for Color Demosaicing

引用

International Conference on Advanced Technologies for communications (ATC)

作者： Tien Ho-Phuoc Dung-Nghi Truong Cong Univ Danang Univ Sci & Technol Dept Elect & Telecommun Engn Danang Vietnam Ho Chi Minh City Univ Technol Fac Elect & Elect Engn Ho Chi Minh City Vietnam

ISBN: (纸本)9781467383745

The present paper proposes a new method for color image demosaicing. This method separates luminance from chrominance and allows luminance to be extracted directly from known pixel values. Since interpolation for missing pixels is applied only to chrominance channels, it can reduce artifacts. Moreover, in chrominance channels the proposed method tries to interpolate pixels along edges. As consequence, edges are better preserved in the demosaiced image and false colors, which are a popular problem in demosaicing, are correctly eliminated. Comparisons with other algorithms show satisfying performances of our method in both qualitative and quantitative criteria. Another advantage of the proposed method relates to its low computational complexity, which can facilitate hardware implementation.

关键词： demosaicing Chromaticity efficient algorithm luminance Compact Compact Pattern pixel false color Interpolation complexity classes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：