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

33rd Annual IEEE Military Communications Conference on Affordable Mission Success - Meeting the Challenge (MILCOM)

作者： Wen, Qingsong Ma, Xiaoli Georgia Inst Technol Sch Elect & Comp Engn Atlanta GA 30332 USA

ISBN: (纸本)9781479967704

Lenstra-Lenstra-Lovasz (LLL) algorithm has been adopted as a lattice reduction (LR) technique for multiple-input multiple-output (MIMO) detection to improve error performance without exponential complexity. However, implementing the LLL algorithm is still challenging. During the execution of each LLL iteration, the column swap operations may not happen in some cases, which is not efficient in terms of convergence speed. To address this issue, some greedy LLL variants have recently been proposed, which only select the iterations with column swap each time so that the number of LLL iterations can be reduced compared to the original LLL algorithm. In this paper, we propose an efficient greedy LLL algorithm, based on the relaxed Lovasz condition to search the candidate set of LLL iterations and the relaxed decrease of LLL potential to select an LLL iteration each time. Besides, we also present an efficient implementation of the proposed algorithm. Compared to the existing greedy LLL algorithms, simulations show that the proposed greedy LLL not only converges faster but also exhibits much lower complexity (save over 55% and 62% complexity in average for 4 x 4 and 8 x 8 MIMO systems) while maintaining similar error performance in LR-aided MIMO detectors.

关键词： Detection greedy algorithm lattice reduction LLL MIMO systems

来源：评论

学校读者我要写书评

暂无评论

Adaptive Decompositions in Monogenic Reproducing Kernel Hilbert Spaces of Paley-Wiener Type

引用

COMPLEX ANALYSIS AND OPERATOR THEORY 2022年第7期16卷 98-98页

作者： Dang, Pei Mai, Weixiong Qian, Tao Macau Univ Sci & Technol Fac Innovat Engn Taipa Macao Peoples R China Macau Univ Sci & Technol Macao Ctr Math Sci Taipa Macao Peoples R China

In the Clifford algebra setting, the present study develops efficient approximations by linear combinations of the parameterized kernel functions in monogenic reproducing kernel Hilbert spaces of Paley-Wiener type, wh... 详细信息

关键词： Reproducing kernel Paley-Wiener theorem Monogenic function greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

Adaptive Traffic Management with VANET in V to I Communication Using greedy Forwarding algorithm

Adaptive Traffic Management with VANET in V to I Communicati...

引用

International Conference on Information Communication and Embedded Systems (ICICES)

作者： Yugapriya, R. Dhivya, P. Dhivya, M. M. Kirubakaran, S. Bannari Amman Inst Technol Dept ECE Sathyamangalam India

ISBN: (纸本)9781479938346

Vehicular ad hoc networks (VANETs) are used to collect and aggregate real-time speed and position information on individual vehicles to optimize signal control at traffic intersections. VANET can be used to group vehicles into approximately equal-sized platoons, which can then be scheduled using OJF. greedy forwarding algorithm is proposed to use in the traffic management as it offer the better transfer. Vehicle to infrastructure method is used to transfer the message from the platoon to the vehicle thus increases the safety. The road block information is transfer from platoon to V to I and from one V to I it is transfer to another. greedy Forwarding algorithm is used to forwarded message to the neighboring node which is "closest" to the destination. In this paper greedy Forwarding is used to increase the delivery rate and throughput. This algorithm is also used to reduce the load traffic. greedy algorithm has computationally efficient and can find the error in early stage. Under heavy vehicular traffic load, the greedy algorithm performs the same as the platooning algorithm but still produces low delays, and high throughput.

关键词： VANET (Vehicular ad hoc networks) greedy algorithm V to I I to V

来源：评论

学校读者我要写书评

暂无评论

Cross-Server Computation Offloading for Multi-Task Mobile Edge Computing

引用

INFORMATION 2020年第2期11卷 96-96页

作者： Shi, Yongpeng Xia, Yujie Gao, Ya Luoyang Normal Univ Sch Phys & Elect Informat Henan Key Lab E Commerce Big Data Proc & Anal Luoyang 471934 Peoples R China

As an emerging network architecture and technology, mobile edge computing (MEC) can alleviate the tension between the computation-intensive applications and the resource-constrained mobile devices. However, most available studies on computation offloading in MEC assume that the edge severs host various applications and can cope with all kinds of computation tasks, ignoring limited computing resources and storage capacities of the MEC architecture. To make full use of the available resources deployed on the edge servers, in this paper, we study the cross-server computation offloading problem to realize the collaboration among multiple edge servers for multi-task mobile edge computing, and propose a greedy approximation algorithm as our solution to minimize the overall consumed energy. Numerical results validate that our proposed method can not only give near-optimal solutions with much higher computational efficiency, but also scale well with the growing number of mobile devices and tasks.

关键词： mobile edge computing cross-server computation offloading energy consumption minimization greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

A unified way of analyzing some greedy algorithms

引用

JOURNAL OF FUNCTIONAL ANALYSIS 2019年第12期277卷 108286-000页

作者： Dereventsov, A., V Temlyakov, V. N. Univ South Carolina Dept Math Columbia SC 29208 USA Steklov Inst Math Moscow 119991 Russia Lomonosov Moscow State Univ Moscow 119991 Russia

In this paper we propose a unified way of analyzing a certain kind of greedy-type algorithms in Banach spaces. We define a class of the Weak Biorthogonal greedy algorithms that contains a wide range of greedy algorithms. In particular, we show that the following well-known algorithms - the Weak Chebyshev greedy algorithm and the Weak greedy algorithm with Free Relaxation - belong to this class. We investigate the properties of convergence, rate of convergence, and numerical stability of the Weak Biorthogonal greedy algorithms. Numerical stability is understood in the sense that the steps of the algorithm are allowed to be performed with controlled computational inaccuracies. We carry out a thorough analysis of the connection between the magnitude of those inaccuracies and the convergence properties of the algorithm. To emphasize the advantage of the proposed approach, we introduce here a new greedy algorithm - the Rescaled Weak Relaxed greedy algorithm - from the above class, and derive the convergence results without analyzing the algorithm explicitly. Additionally, we explain how the proposed approach can be extended to some other types of greedy algorithms. (C) 2019 Elsevier Inc. All rights reserved.

关键词： Banach space greedy approximation greedy algorithm Weak Biorthogonal greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal Programming of Cyclist Power Allocation Based on Genetic algorithm

Optimal Programming of Cyclist Power Allocation Based on Gen...

引用

作者： Jingjing Zhao HuiXiang Dai Department of Computer Science and Engineering North China Electric Power University Department of Electrical Engineering North China Electric Power University

In this paper,we have analyzed the way of bicycle road *** establishing relevant models,the power curves of different types of athletes are ***,we use the least-squares method to optimize the function,and introduce two different types of passengers and get specific ***,by constructing the fatigue degree,energy consumption model and cyclic motion model,the genetic algorithm is used to solve the problem,and the optimal energy distribution of different athletes on different tracks is *** addition,considering the influence of uncertain factors brought by the weather and other environments,the scheme that the driver and the directeur sportif would obtain the local optimal solution and actively change the power distribution is analyzed,and the process of the team time trial is ***,the generality and sensitivity of the model are tested,and the advantages and disadvantages of the model are evaluated.

关键词： Least squares optimization method genetic algorithm greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

Complexity and relaxation methods for minimising total average cycle stock subject to practical constraints

引用

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 2020年第8期71卷 1301-1305页

作者： Myung, Young-Soo Moon, Ilkyeong Dankook Univ Business Adm Yongin South Korea Seoul Natl Univ Ind Engn Seoul 08826 South Korea

This paper considers the problem of minimising total average cycle stock that is subject to practical constraints, as first studied by Silver and Moon and later by Hsieh, and Billionnet. For the problem, reorder intervals of a population of items are restricted to a given set, and the total number of replenishments allowed per unit time is limited. Previous researchers proposed different mathematical programming formulations and relaxation methods without identifying the computational complexity of the problem. In this study, we investigate the computational complexity of the problem and analyse the proposed relaxation methods. We identify NP-hard and polynomial time solvable cases of the problem and compare three different relaxations in terms of the lower bounds provided by each relaxation method. We also show that the relaxation with the strongest bound can be solved using a linear time greedy algorithm instead of a general-purpose linear programming algorithm.

关键词： Inventory complexity greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

A first approach to learning a best basis for gravitational field modelling

引用

GEM-INTERNATIONAL JOURNAL ON GEOMATHEMATICS 2020年第1期11卷 1-26页

作者： Michel, Volker Schneider, Naomi Univ Siegen Dept Math Geomath Grp Walter Flex Str 3 D-57068 Siegen Germany

Gravitational field modelling is an important tool for inferring past and present dynamic processes of the Earth. Functions on the sphere such as the gravitational potential are usually expanded in terms of either spherical harmonics or radial basis functions (RBFs). The (Regularized) Functional Matching Pursuit and its variants use an overcomplete dictionary of diverse trial functions to build a best basis as a sparse subset of the dictionary. They also compute a model, for instance, of the gravitational field, in this best basis. Thus, one advantage is that the best basis can be built as a combination of spherical harmonics and RBFs. Moreover, these methods represent a possibility to obtain an approximative and stable solution of an ill-posed inverse problem. The applicability has been practically proven for the downward continuation of gravitational data from the satellite orbit to the Earth's surface, but also other inverse problems in geomathematics and medical imaging. A remaining drawback is that, in practice, the dictionary has to be finite and, so far, could only be chosen by rule of thumb or trial-and-error. In this paper, we develop a strategy for automatically choosing a dictionary by a novel learning approach. We utilize a non-linear constrained optimization problem to determine best-fitting RBFs (Abel-Poisson kernels). For this, we use the Ipopt software package with an HSL subroutine. Details of the algorithm are explained and first numerical results are shown.

关键词： Dictionary learning Downward continuation greedy algorithm Inverse problem Matching pursuit Nonlinear optimization Radial basis functions Spherical harmonics

来源：评论

学校读者我要写书评

暂无评论

HYPERFINITE GRAPHINGS AND COMBINATORIAL OPTIMIZATION

引用

ACTA MATHEMATICA HUNGARICA 2020年第2期161卷 516-539页

作者： Lovasz, L. Hungarian Acad Sci Budapest Hungary Eotvos Lorand Univ Budapest Hungary

We exhibit an analogy between the problem of pushing forward measurable sets under measure preserving maps and linear relaxations in combinatorial optimization. We show how invariance of hyperfiniteness of graphings under local isomorphism can be reformulated as an infinite version of a natural combinatorial optimization problem, and how one can prove it by extending well-known proof techniques (linear relaxation, greedy algorithm, linear programming duality) from the finite case to the infinite.

关键词： hyperfinite splitting set greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

An algorithmic Approach for Maritime Transportation

引用

INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS 2020年第2期11卷 764-775页

作者： Pinakpani, Peri Polisetty, Aruna Rao, G. Bhaskar N. Sunil, Harrison D. Kumar, B. Mohan Deepthi, Dandamudi Sidhireddy, Aneesh GITAM Univ HBS Hyderabad 502329 TS India GITAM IoM Visakhapatnam 530045 Andhra Pradesh India Manipal Univ MAHE DoC Manipal 576104 India Blue Hora Univ Coll Business & Econ Hagere Maryam Ethiopia Aurora PG Coll Hyderabad Ethiopia Princeton Review Hyderabad 500072 TS Ethiopia VIT Univ Vellore 632014 Tamil Nadu India

Starting from the 3rd millennium BC, Indian maritime trade has augmented the life of a common man and businesses alike. This study, finds that India can leverage on the 7,500 long coast line and derive holistic development in terms of interconnected ports with hinterland connectivity and realize lower expenditure coupled with reduced carbon emission. This research analyzed a decade of cargo data from origination to destination and found that around 82.95 per cent (953 MMTPA in 2017-18) of road based consignments in India comprised of Fertilizers, Hydrocarbons, Coal, Lubricants and Oil. Essentially, a quantum of this i.e. 78.39 per cent of MMTPA cargo consignments (State Owned Hydrocarbons) traverses on Indian roads. The study drew parameters of this transportation paradigm and modeled the same using Artificial Intelligence to depict a monumental opportunity to rationalize costs, improve efficiency and reduce carbon emission to strengthen the argument for the employment of Multimodal Logistics in the Maritime Sector. Subsequent to model derivation the same set of parameters are plotted as an efficient transit map of Interstate transit lines connecting 16 major hubs which now handle bulk cargo shipped by all modes of transport. For the pollution segment a collaborative game theoretic approach i.e., Shapley value is proposed for improved decision making. This study presents data driven and compelling research evidence to portray the benefits of collaboration between firms in terms of time and cost. The study also proposes the need and method to improve hinterland connectivity using a scalable greedy algorithm which is tested with real time data of Coal and Bulk Cargo. As a scientific value addition, this study presents a mathematical model that can be implemented across geographies seamlessly using Information Communication Technology.

关键词： Maritime transport multimodal logistics game theory greedy algorithm freight management intermodal transportation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：