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

2013 IEEE 4th International Conference on Electronics Information and Emergency Communication

作者： Ratapong Wongpiang Pornsiri Muenchaisri Center of Excellence in Software Engineering Department of Computer Engineering Chulalongkorn University Bangkok 10330Thailand

ISBN: (纸本)9781467349345

Refactoring is the process of changing the internal structure of software but it preserves external behavior of software. To improve software maintainability, we may apply several refactoring techniques to source code. Applying different sequence of refactoring techniques to different parts of source code results in different code changes and different level of software maintainability. We propose an approach for selecting sequence of refactoring techniques usage for code changing using greedy algorithm. To get optimal software maintainability, we create possible sequences of refactoring techniques usage and apply each refactoring technique to source code. greedy algorithm is used to separate the optimal sequence of refactoring techniques usage from possible sequences of refactoring techniques. We evaluate the approach with source code containing Long Method, Large Class and Feature Envy bad smells by comparing the changed source code result between applying the approach and without applying sequence of refactoring techniques usage. The compared results show that the changed source code by applying our approach can improve software maintainability better than the changed source code without sequencing refactoring techniques usage.

关键词： Refactoring Refactoring Sequencing Software Maintainability greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

A greedy algorithm for Checking Normality of Cryptographic Boolean Functions

A Greedy Algorithm for Checking Normality of Cryptographic B...

引用

International Symposium on Information Theory and its Applications (ISITA)

作者： Kolokotronis, Nicholas Limniotis, Konstantinos Univ Peloponnese Dept Comp Sci & Technol End Karaiskaki St Tripolis 22100 Greece Hellen Data Protect Author Athens 11523 Greece Univ Athens Dept Informat & Telecomm Athens 15784 Greece

ISBN: (纸本)9784885522673

The cryptographic property of normality for cubic Boolean functions is studied in this paper. This property is highly relevant for the analysis and design of important building blocks in cryptosystems. We develop a novel greedy algorithm to find whether a given function is normal and the affine subspace where this property occurs. Our algorithm exploits the fact that cubic functions admit a matrix representation to work with tools having fast implementations. Thus, the proposed algorithm achieves a much lower complexity than other well known general techniques in the literature.

关键词： greedy algorithm Boolean functions normality Matrix representation cryptography Building blocks

来源：评论

学校读者我要写书评

暂无评论

A GPU accelerated parallel heuristic for the 2D knapsack problem with rectangular pieces 9

A GPU accelerated parallel heuristic for the 2D knapsack pro...

引用

9th Annual IEEE Ubiquitous Computing, Electronics and Mobile Communication Conference (UEMCON)

作者： Rashid, Mohammad Harun Pace Univ New York NY 10038 USA

ISBN: (纸本)9781538676936

The 2D Knapsack Problem is a NP hard problem in combinatorial optimization which can be described easily, but it is very difficult to solve. If we take a rectangular container as well as a set of rectangular pieces into consideration, the two dimensional knapsack problem (2D-KP) consists of packing a subset of the rectangular pieces in the rectangular container in such a way that the sum of the total values of the packed rectangular pieces is maximized. If we consider the value of a rectangular piece by the area, the goal here is to maximizing the covered area of the rectangular container. It is not only very time consuming for Central Processing Units (CPU) but also very difficult to obtain an optimized solution when solving large problem instances. So, parallelism can be a good technique for reducing the time complexity, as well as improving the solution quality. Nowadays Graphics Processing Units (GPUs) have evolved supporting general purpose computing. In this paper, we propose GPU accelerated parallel heuristics for 2D Knapsack Problem and our experimental evaluation shows that this optimization algorithm efficiently accelerated on GPUs can provide with higher quality solutions within a reasonable time for 2D-KP.

关键词： GPU combinatorial optimization 2D Knapsack Problem parallel heuristics algorithms greedy algorithm local search

来源：评论

学校读者我要写书评

暂无评论

A New Two Level Cluster-based Routing Protocol for Vehicular Ad hoc NETwork (VANET) 20

A New Two Level Cluster-based Routing Protocol for Vehicular...

引用

20th UKSim-AMSS International Conference on Computer Modelling and Simulation (UKSim)

作者： Hamedani, Parisa Saraj Rezazadeh, Arshin Shahid Chamran Univ Ahvaz Fac Engn Dept Comp Engn Ahvaz Iran

ISBN: (纸本)9781538658789

Vehicular ad hoc networks (VANETs) are a subset of mobile ad hoc networks (MANETs). These networks do not have a specific structure, in which network-forming nodes are moving vehicles. Therefore, routing is essential for data dissemination in these networks. The problem of the link failure between vehicles is one of the principal challenges in these networks. In this paper, a reliable two-layer cluster-based algorithm has been introduced in VANETs to mitigate the link failure problem. Using two-layer routing makes route maintaining and the possibility of self-organization easier when topology does not have a steady shape. At the first level of new method, selecting the strong link and at the second level, the greedy algorithm is used in order to select the best route. Velocity, direction, ST and location are all effective parameters involved in this new algorithm. The proposed protocol that was simulated by NS-2.35 improves the network parameters such as end-to-end delay and packet delivery ratio compared with two similar measured protocols. Increased packet delivery ratio and decreased end to end delay compared with previous protocols showed better performance of the new method.

关键词： VANET greedy algorithm routing protocol ad hoc network

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Offloading in Mobile Edge Computing with Edge-Cloud Collaboration 18th

Energy-Efficient Offloading in Mobile Edge Computing with Ed...

引用

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;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

来源：评论

学校读者我要写书评

暂无评论

A predictive Energy Management Strategy for Hybrid Electric Bus Based on greedy algorithm

A predictive Energy Management Strategy for Hybrid Electric ...

引用

10th World Congress on Intelligent Control and Automation (WCICA)

作者： Pan, Zheng Song, Chunyue Zhejiang Univ Inst Ind Proc Control State Key Lab Ind Control Technol Hangzhou 310027 Zhejiang Peoples R China

ISBN: (纸本)9781467313988

Buses run on fix routes, which makes it possible to design a predictive Energy Management Strategy (EMS) for hybrid electric bus to achieve better overall efficiency. A new predictive EMS is proposed based on the prediction of the bus's velocity profile. Firstly, the bus's velocity profile is predicted via historic driving data and real-time driving data, which provide the future power demand. Then according to the prediction of the velocity profile, the torque spilt is optimized by greedy algorithm. The obtained EMS requires very little computational time and is suitable for real-time implement. Simulation shows that the fuel economy of the presented approach is better than the electric assist control strategy in the Advanced Vehicle Simulator (ADVISOR).

关键词： energy management hybrid electric bus predictive velocity model greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

An Improved Dynamic Spectrum Access Protocol Based on the greedy algorithm

An Improved Dynamic Spectrum Access Protocol Based on the Gr...

引用

8th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM)

作者： Wang, Hui Zhang, Yun Gao, Ren Hubei Univ Econ Dept Elect Engn Wuhan Peoples R China Wuhan Univ Int Sch Software Wuhan Peoples R China

ISBN: (纸本)9781612846835;9781612846828

In cognitive radio networks, media access control protocol decides the method how the nodes in the networks receive and send data by shared wireless channels. Whether the MAC protocol can use the limited channel effectively plays a very important role in the performance of the cognitive radio network. Focusing on designing and implementation an excellent MAC protocol in cognitive radio networks, this paper describes an improved dynamic spectrum access protocol based on the greedy algorithm. The simulation results shows it's good performance.

关键词： Cognitive Radio Networks Dynamic Spectrum Access greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

A greedy sparse meshless method for solving heat conduction problems

引用

ENGINEERING WITH COMPUTERS 2017年第3期33卷 631-645页

作者： Fadaei, Y. Moghadam, M. Mohseni Shahid Bahonar Univ Kerman Dept Math Kerman Iran

In this paper, we introduce a greedy approximation algorithm for solving the transient heat conduction problem. This algorithm can overcome on some of challenges of the full meshless kernel-based methods such as ill-conditioning and computational cost associated with the dense linear systems that arise. In addition, the greedy algorithm allows to control the consistency error by explicit calculation. First, the space derivatives of the heat conduction equation are discretized to a finite number of test functional equations, and a greedy sparse discretization is applied for approximating the linear functionals. Each functional is stably approximated by some few trial points with an acceptable accuracy. Then a time-stepping method is employed for the time derivative. Stability of the scheme is also discussed. Finally, numerical results are presented in three test cases. These experiments show that greedy approximation approach is accurate and fast, and yields the better conditioning in contrast with the fully meshless methods.

关键词： Meshless methods greedy algorithm Transient heat conduction problem Radial basis functions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：