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

37th Chinese Control Conference (CCC)

作者： Seo, Min-Guk Shin, Hyo-Sang Tsourdos, Antonios Cranfield Univ Sch Aerosp Transport & Mfg Cranfield Beds England

ISBN: (纸本)9789881563958

This paper addresses the application of task allocation algorithm for agricultural remote sensing using a group of UAVs. A task allocation problem is formulated as a form of reward function maximization problem. The reward function is defined by considering the following three aspects. The first aspect is to assign tasks to UAVs with proper sensors to detect the most severe hazards for the crop raised in each field at the observation season. The minimization of the total operation time of UAVs is another aspect for short observation time and small fuel consumption. The last aspect is to assign tasks uniformly to the UAVs to prevent overloads on certain UAVs. in order to apply submodular maximization-based algorithm, the subexponential submodularity tester is applied to verify the submodularity of the defined reward function. A greedy algorithm-based task allocation method is applied to the designed task allocation problem as an example of submodular maximization-based algorithm. Simulations are conducted to show the characteristics of the designed reward function and to compare the results of the task allocation method with the optimal solutions.

关键词： Task Allocation Precision Agriculture Submodular Maximization greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

GPS Signal Acquisition Based on Compressive Sensing 18

GPS Signal Acquisition Based on Compressive Sensing

引用

18th IEEE International Conference on Communication Technology (IEEE ICCT)

作者： He, Guodong Song, Maozhong Song, Peng Key Lab Jiangsu Prov Internet Things & Control Te Nanjing Jiangsu Peoples R China Nanjing Univ Aeronaut & Astronaut Coll Elect & Informat Engn Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781538676356

The first task of GPS receiver is to acquire the signal, which tests the all likely 2-D hypotheses of the code phase and the Doppler frequency of the incoming GPS signal. If the code phase and frequency of locally generated matches the incoming signal, the output will be significantly higher than others, so the signal is sparse. Compressive sensing (CS) is a new signal sampling theory, for sparse signal, the signal can be sampled at a lower rate. In this paper, a new GPS signal acquisition method is proposed based on compressive sensing. We designed a GPS signal sparse representation dictionary;the position of sparse corresponds to the code phase and Doppler frequency. The greedy algorithm is used to recover the GPS sparse signal. Numerical simulations illustrate that GPS signal is sparse in the designed dictionary, and the greedy algorithm can recover the GPS sparse spike signal effectively.

关键词： compressive sensing GPS signal acquisition greedy algorithm matching pursuit

来源：评论

学校读者我要写书评

暂无评论

Delay-Aware Secure Computation Offloading Mechanism in a Fog-Cloud Framework 16

Delay-Aware Secure Computation Offloading Mechanism in a Fog...

引用

16th IEEE ISPA / 17th IEEE IUCC / 8th IEEE BDCloud / 11th IEEE SocialCom / 8th IEEE SustainCom

作者： Yang, Yang Chang, Xiaolin Han, Zhen Li, Lin Beijing Jiaotong Univ Sch Comp & Informat Technol Beijing Key Lab Secur & Privacy Intelligent Trans Beijing Peoples R China

ISBN: (纸本)9781728111414

Fog-Cloud framework is being regarded as a more promising technology to provide performance guarantee for IoT applications, which not only have higher requirements on computation resources, but also are delay and/or security sensitive. In this framework, a delay and security-sensitive computation task is usually divided into several sub-tasks, which could be offloaded to either fog or cloud computing servers, referred to as offloading destinations. Sub-tasks may exchange information during their processing and then have requirement on transmission bandwidth. Different destinations produce different completion delays of a sub-task, affecting the corresponding task delay. The existing offloading approaches either considered only a single type of offloading destinations or ignored delay and/or security constraint. This paper studies a computation offloading problem in the fog-cloud scenario where not only computation and security capabilities of offloading destinations may be different, but also bandwidth and delay of links may be different. We first propose a joint offloading approach by formulating the problem as a form of Mixed Integer Programming Multi-Commodity Flow to maximize the fog-cloud provider's revenue without sacrificing performance and security requirements of users. We also propose a greedy algorithm for the problem. Extensive simulation results under various network scales show that the proposed computation offloading mechanism achieves higher revenue than the conventional single-type computation offloading under delay and security constraints.

关键词： Fog-cloud computing IoT application Mixed integer programming Security greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

Multi-person 3D Pose Estimation and Tracking in Sports

Multi-person 3D Pose Estimation and Tracking in Sports

引用

IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops

作者： Lewis Bridgeman Marco Volino Jean-Yves Guillemaut Adrian Hilton CVSSP University of Surrey

ISBN: (数字)9781728125060

ISBN: (纸本)9781728125077

We present an approach to multi-person 3D pose estimation and tracking from multi-view video. Following independent 2D pose detection in each view, we: (1) correct errors in the output of the pose detector;(2) apply a fast greedy algorithm for associating 2D pose detections between camera views;and (3) use the associated poses to generate and track 3D skeletons. Previous methods for estimating skeletons of multiple people suffer long processing times or rely on appearance cues, reducing their applicability to sports. Our approach to associating poses between views works by seeking the best correspondences first in a greedy fashion, while reasoning about the cyclic nature of correspondences to constrain the search. The associated-poses can be used to generate 3D skeletons, which we produce via robust triangulation. Our method can track 3D skeletons in the presence of missing detections, substantial occlusions, and large calibration error. We believe ours is the first method for full-body 3D pose estimation and tracking of multiple players in highly dynamic sports scenes. The proposed method achieves a significant improvement in speed over state-of-the-art methods.

关键词： Sports tracking pose estimation greedy algorithm Skeletons test error Three Dimensions View Reasoning

来源：评论

学校读者我要写书评

暂无评论

EFSM-oriented Minimal Traces Set Generation Approach for Web Applications 42

EFSM-oriented Minimal Traces Set Generation Approach for Web...

引用

42nd Annual IEEE-Computer-Society Computers, Software and Applications (COMPSAC) Conference - Staying Smarter in a Smartening World

作者： Wang, Weiwei Guo, Junxia Li, Zheng Zhao, Ruilian Beijing Univ Chem Technol Coll Informat Sci & Technol Beijing Peoples R China

ISBN: (纸本)9781538626672

Most of web applications models focus on sequencing of events, where the ignored parameters or DOM elements changes and the relationship between the execution conditions and web states are crucial for analyzing and testing the behavior of client-side of client-server web applications. In this paper, we first define a novel trace, which can represent dynamic behaviors of web applications more accurately. Then an EFSM-oriented minimal traces set generation approach is proposed for modelling web applications. In order to ensure the integrity of the EFSM model and improve the effectiveness of the modelling process, three adequacy criteria with respect to all events, JS branches and DOM structures, are applied to compensate the traces and to guide the minimal traces set generation by greedy algorithm. Finally, the minimal traces set is abstracted into an EFSM as the behavior model for web applications. We implement a prototype tool for the proposed approach and empirically evaluate that the minimal traces set generation approach based on two web applications. The results show that the traces generated by the approach is effective and the all JavaScript branches coverage criteria is most appropriate to select the minimal traces set used for modelling.

关键词： web applications user behavior trace minimal trace set generation EFSM model greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

A greedy MLPG method for identifying a control parameter in 2D parabolic PDEs

引用

INVERSE PROBLEMS IN SCIENCE AND ENGINEERING 2018年第11期26卷 1676-1694页

作者： Takhtabnoos, Fariba Shirzadi, Ahmad Persian Gulf Univ Dept Math Bushehr Iran

In this paper, we consider coefficient inverse problems, which are associated with the identification of unknown time dependent control parameter and unknown solution of two-dimensional parabolic inverse problem with overspecialization at a point in the spatial domain. After suitable finite difference approximation of time variable, an MLPG method is used for spatial discretization. To improve the efficiency of the MLPG method, a greedy algorithm is used. In fact, using the greedy algorithm, we avoid using more points from the data site than absolutely necessary and therefore, the method becomes more efficient. Comparison of the different kind of point selection and the effect of noisy data are performed for four test problems while our last test problem considers a problem with unknown solution. The results reveal that the method is efficient.

关键词： MLPG control parameter radial basis functions greedy algorithm inverse problem

来源：评论

学校读者我要写书评

暂无评论

Charging base Stations Deployment algorithms for Wireless Rechargeable Sensor Networks

Charging base Stations Deployment Algorithms for Wireless Re...

引用

IEEE Wireless Power Transfer Conference (WPTC)

作者： Peng Wan Baoyu Wu Yuhua Cheng Gaofeng Wang Hangzhou Dianzi University Hangzhou China

ISBN: (数字)9781728107059

ISBN: (纸本)9781728107066

One of the important problems in wireless rechargeable sensor networks is the deployment of charging base stations. Based on a convergent charging scheme, two new algorithms are proposed, by combining the solution of the Fermat point problem with the advantages of the greedy algorithm. Different from the existing solutions where the charging base stations are restricted on some special locations (like grid points), the charging base stations are more flexible in new algorithms. Instead of setting a charging circle, the specific variation of the power transfer efficiency with distance is used in the new algorithms to optimize the number of the charging base stations more accurately. The simulation results show that for different numbers of sensors, the proposed two algorithms can get a smaller number of base stations. Furthermore, the convex vertices priority algorithm has the advantage of less candidate base stations and consequently less time consuming.

关键词： Wireless rechargeable sensor network convergent charging greedy algorithm generalized Fermat point problem BASE STATION greedy algorithm CHARGING(ACCOUNTTNG) Wireless sensor networks algorithms deployment TRANSFER EFFICIENCY Sensor networks

来源：评论

学校读者我要写书评

暂无评论

MATCHING PROJECTION DECODING METHOD FOR AMBISONICS SYSTEM

MATCHING PROJECTION DECODING METHOD FOR AMBISONICS SYSTEM

引用

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

作者： Qu, Tianshu Huang, Zhichao Qiao, Yue Wu, Xihong Peking Univ Speech & Hearing Res Ctr Key Lab Machine Percept Minist Educ Beijing Peoples R China

ISBN: (纸本)9781538646588

The basic Ambisonics decoding method will break down when the playback loudspeakers distribute unevenly. This paper proposes a modified Ambisonics method, the matching projection decoding method, for solving this problem. The matching projection decoding method is a kind of the greedy algorithm. It firstly calculates the projection value of the object Ambisonics signal over each Ambisonics signal of loudspeakers, then the maximum projection value is assigned to the corresponding loudspeaker. This process is repeated until all the loudspeakers have been assigned a gain value. The objective and subjective experiments were performed to evaluate the proposed system and the basic system. Objective evaluation results show that the accuracy of the sound field generated by the matching projection decoding method is better than that of the basic method;and the subjective evaluation results show a more correct directional perception of the matching projection decoding method than the basic one.

关键词： HOA Ambisonics encoding Ambisonics decoding Sound field reproduction greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient Computation of MSE Lower Bounds via Matching Pursuit 10

Efficient Computation of MSE Lower Bounds via Matching Pursu...

引用

10th IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM)

作者： Shalom, Shahar Sar Tabrikian, Joseph Ben Gurion Univ Negev Dept Elect & Comp Engn IL-84105 Beer Sheva Israel

ISBN: (纸本)9781538647523

The classes of large-error bounds that are based on the covariance inequality, in both Bayesian and non-Bayesian approaches, are characterized as projection-based bounds. Tightening of bounds in these classes involves high computational complexity due to multidimensional optimization procedure. Consequently, projection-based large-error bounds have little popularity, while small-error bounds are frequently preferred, although they are not necessarily tight. In this letter, we first introduce a unified formulation for Bayesian and non-Bayesian projection-based lower bounds and set a general framework, which allows for their approximation via a greedy-based method. This framework is then used to propose the use of optimized orthogonal matching pursuit approach for computing projection-based large-error bounds. We analyze the complexity of the proposed algorithm and show that it is significantly lower than the complexity of the conventional approach. Finally, we apply the algorithm for the problem of multitone estimation and show that for fixed computational resources, the Weiss-Weinstein bound implemented with the proposed algorithm, provides a tighter bound compared to conventional approaches.

关键词： Barankin bound greedy algorithm matching pursuit mean-squared-error (MSE) bounds weiss-weinstein class

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Offloading in Mobile Edge Computing with Edge-Cloud Collaboration 1

引用

18th International Conference on algorithms and Architectures for Parallel Processing (ICA3PP)

作者： Long, Xin Wu, Jigang Chen, Long Guangdong Univ Technol Sch Comp Sci & Technol Guangzhou Peoples R China

ISBN: (数字)9783030050573

ISBN: (纸本)9783030050573;9783030050566

Multiple access mobile edge computing is an emerging technique to bring computation resources close to end mobile users. By deploying edge servers at WiFi access points or cellular base stations, the computation capabilities of mobile users can be extended. Existing works mostly assume the remote cloud server can be viewed as a special edge server or the edge servers are willing to cooperate, which is not practical. In this work, we propose an edge-cloud cooperative architecture where edge servers can rent for the remote cloud servers to expedite the computation of tasks from mobile users. With this architecture, the computation offloading problem is modeled as a mixed integer programming with delay constraints, which is NP-hard. The objective is to minimize the total energy consumption of mobile devices. We propose a greedy algorithm with approximation radio of (1 + epsilon) as well as a simulated annealing algorithm to effectively solve the problem. Extensive simulation results demonstrate that, the proposed greedy algorithm can achieve the same application completing time budget performance of the Brute Force optional algorithm with only 31% extra energy cost.

关键词： Mobile edge computing Cooperate greedy algorithm Remote cloud Task dependency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：