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

3rd International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM 2007)

作者： Yin, Guisheng Yang, Guang Yang, Wu Sheng, Yan Zhu, Jinfang Harbin Engn Univ Coll Comp Sci & Technol Harbin Heilongjiang Pr Peoples R China Harbin Engn Univ Coll Comp Sci & Technol Informat Secur Res Ctr Harbin Peoples R China

ISBN: (纸本)9781424413119

Wireless sensor networks (WSNs) is believed to be the first of the top ten technologies that will change the world in the future. With the development of WSNs in the military and commercial fields, the security of WSNs is becoming more and more important. The classical security mechanisms, namely authentication and encryption, can prevent some outsider attacks;however, these mechanisms are inefficient in detecting selective forwarding attacks on compromised nodes. Based on the observations above, in this paper, an improved greedy algorithm based on reputation evaluation mechanism is proposed to enforce cooperation among the nodes of WSNs and defend against the selective forwarding attacks. The performance of the improved greedy algorithm is verified by simulation, and the simulation result shows that the proposed algorithm can effectively resist the attacks of internal malicious nodes, it has better performance than the original greedy algorithm in terms of packet delivery ratio and drop ratio while there exist attack nodes.

关键词： wireless sensor networks reputation evaluation mechanism routing greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal Placement of PMUs using greedy algorithm and State Estimation 1

Optimal Placement of PMUs using Greedy Algorithm and State E...

引用

1st IEEE International Conference on Power Electronics, Intelligent Control, and Energy Systems (ICPEICES)

作者： Jaiswal, Varsha Thakur, Siddhartha Sankar Mishra, Biswaranjan Lovely Profess Univ Sch Elect & Elect Phagwara India Natl Inst Technol Elect Engn Dept Durgapur India

ISBN: (纸本)9781467385879

This paper proposes a new technique of state estimation (SE) for electric power systems. In the proposed scheme, the Phasor Measurement Units (PMU) are first placed optimally using greedy algorithm for cost reduction, while complete observability of system is also obtained. The SE uses a linear measurement model to obtain the estimated states directly, without any iteration, thereby improves the quality of the estimated data base. To reveal the efficacy of the proposed scheme it has been tested on standard IEEE 5-bus, 14-bus, 30-bus, 57-bus and 118-Bus test systems and the test results are presented.

关键词： Phasor Measurement Unit Synchronized Measurement Optimal PMU Placement greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

A greedy algorithm FOR HABIT FORMATION UNDER MULTIPLICATIVE UTILITY

引用

INTERNATIONAL JOURNAL OF THEORETICAL AND APPLIED FINANCE 2024年第3N04期27卷

作者： Kirusheva, Snezhana Salisbury, Thomas S. Univ Toronto Mississauga Dept Math & Computat Sci 3359 Mississauga Rd Mississauga ON L5L 1C6 Canada York Univ Dept Math & Stat 4700 Keele St Toronto ON M3J 1P3 Canada

In this paper, we consider the problem of optimizing lifetime consumption under a habit formation model, both with and without an exogenous pension. Unlike much of the existing literature, we apply a power utility to the ratio of consumption to habit, rather than to their difference. The martingale/duality method becomes intractable in this setting, so we develop a greedy version of this method that is solvable using Monte Carlo simulation. We investigate the behavior of the greedy solution, and explore what parameter values make the greedy solution a good approximation to the optimal one.

关键词： Optimal consumption multiplicative habit formation greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

A Query Answering greedy algorithm for Selecting Materialized Views

A Query Answering Greedy Algorithm for Selecting Materialize...

引用

2nd International Conference on Computational Collective Intelligence: Technologies and Applications

作者： Kumar, T. V. Vijay Haider, Mohammad Jawaharlal Nehru Univ Sch Comp & Syst Sci New Delhi 110067 India

ISBN: (纸本)9783642167317

Materialized views aim to improve the response time of analytical queries posed on a data warehouse. This entails that they contain information that provides answers to most future queries. The selection of such information from the data warehouse is referred to as view selection. View selection deals with selection of appropriate sets of views to improve the query response time. Several view selection algorithms exist in literature, most of them being greedy based. The greedy algorithm HRUA, which selects top-k views from a multidimensional lattice, is considered the most fundamental greedy based algorithm. It selects views having the highest benefit, computed in terms of size, for materialization. Though the views selected using HRUA are beneficial with respect to size, they may not account for a large number of future queries and may hence become an unnecessary overhead. This problem is addressed by the Query Answering greedy algorithm (QAGA) proposed in this paper. QAGA uses both the size of the view, and the frequency of previously posed queries answered by each view, to compute the profits of all views in each iteration. Thereafter it selects, from among them, the most profitable view for materialization. QAGA is able to select views which are beneficial with respect to size and have a greater likelihood of answering future queries. Further, experimental results show that QAGA, as compared to HRUA, is able to select views capable of answering greater number of queries. Though HRUA incurs a lower total cost of evaluating all the views, QAGA has a lower total cost of answering all the queries leading to an improvement in the average query response time. This in turn facilitates decision making.

关键词： Data Warehouse Materialized View Selection greedy algorithm Query Response Time

来源：评论

学校读者我要写书评

暂无评论

Object-Oriented Data Flow Diagram Similarity Measurement Using greedy algorithm 1

Object-Oriented Data Flow Diagram Similarity Measurement Usi...

引用

1st International Conference on Cybernetics and Intelligent System (ICORIS)

作者： Irhamn, Firli Siahaan, Daniel Univ Trunojoyo Dept Informat Syst Bangkalan Indonesia Inst Teknol Sepuluh Nopember Dept Informat Surabaya Indonesia

ISBN: (纸本)9781728114743

Measuring software similarity base on software design artifacts has been one of the research topics in software engineering. Software similarity measurement is used in software reuse, clone detection, and learning assessment. Previous research focus on universal modeling language design artifacts. These design artifacts concern on the semantic and structure of a set of objects within a system and their interaction with themselves and objects outside the system. There are also design artifacts that model how data or information transformed into different forms, sizes, and time. This study focus on developing diagram similarity measurement base on one of those artifacts, i.e., object-oriented data flow diagrams. The measurement uses the greedy approach to calculate the similarity score of two diagrams using four elements derived from elements of object oriented data flow diagram, i.e. external entities, processes, data stores, and classes. The initial experimentation result shows that the proposed diagram similarity measurement is feasible.

关键词： diagram similarity measurement greedy algorithm object-oriented data flow diagram

来源：评论

学校读者我要写书评

暂无评论

greedy algorithm-based compensation for target speckle phase in heterodyne detection

引用

INFRARED PHYSICS & TECHNOLOGY 2021年 116卷 103753-103753页

作者： Feng, Songmeng Feng, Zhejun Cao, Changqing Zeng, Xiaodong Geng, Jinni Li, Jing Liu, Liangqi Wu, Qifan Xidian Univ Sch Phys & Optoelect Engn Xian 710071 Peoples R China

Speckle is a significant problem that hinders optical heterodyne signal detection via the array detector method, with the efficiency of existing phase compensation algorithms severely limited by the number of array elements. This study simplifies the original phase compensation model and proposes a phase compensation calculation method based on a greedy algorithm. Numerical and experimental results show that the proposed algorithm is stable and 3-4 orders of magnitude faster than the others, avoiding the performance degradation typically associated with an increasing array number, enabling real-time data processing. This suggests that high application potential in areas such as synthetic aperture lidar and laser vibration measurement.

关键词： Array detector Phase compensation Decoherence greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

greedy algorithm for local heating problem

引用

DISCRETE OPTIMIZATION 2021年 39卷 100627-100627页

作者： Fink, Jiri Hurink, Johann L. Univ Twente Fac Elect Engn Math & Comp Sci POB 217 NL-7500 AE Enschede Netherlands Charles Univ Prague Fac Math & Phys Dept Theoret Comp Sci & Math Log Malostranske Namesti 25 Prague 11800 Czech Republic

This paper studies a planning problem for heating water. Hereby, boilers (e.g. gas or electric boilers, heat pumps or microCHPs) are used to heat the water and store it for domestic demands. We consider a simple boiler which is either turned on or turned off and has a buffer of limited capacity. The energy needed to run the boiler has to be bought on a day-ahead market, so we are interested in a planning which minimizes the cost to supply the boiler with energy. We present a greedy algorithm whose time complexity is O(T alpha(T)) where T is the number of time intervals and alpha is the inverse of Ackermann function. (C) 2021 Elsevier B.V. All rights reserved.

关键词： greedy algorithm Union-find data structure Smart Grids

来源：评论

学校读者我要写书评

暂无评论

An Iterated greedy algorithm for the Binary Quadratic Programming Problem

An Iterated Greedy Algorithm for the Binary Quadratic Progra...

引用

6th International Conference on Soft Computing and Intelligent Systems (SCIS) / 13th International Symposium on Advanced Intelligence Systems (ISIS)

作者： Toyama, Fubito Shoji, Kenji Mori, Hiroshi Miyamichi, Juichi Utunomiya Univ Grad Sch Engn 7-1-2 Yoto Utsunomiya Tochigi 3218585 Japan

ISBN: (纸本)9781467327435;9781467327428

The binary quadratic programming problem (BQP) is an NP-hard problem and has a large number of applications. In this paper, an iterated greedy algorithm with k-opt local search (IGKLS) is proposed for the BQP. Iterated greedy (IG) algorithm has already been applied to a variety of optimization problems, and shown to be simple but with excellent search performance. The proposed iterated greedy algorithm consists of two central phases, destruction and construction phases. As a local search algorithm, k-opt local search is applied after the construction phase. The computational results showed that the proposed iterated greedy algorithm outperformed state-of-the-art methods for huge size BQP instances.

关键词： greedy algorithm construction phase quadratic programming Nondeterministic polynomial-time hard Binary

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Resource Allocation Downlink for MIMO-OFDMA System using greedy algorithm 6

Performance Analysis of Resource Allocation Downlink for MIM...

引用

6th IEEE International Conference on Control System, Computing and Engineering (ICCSCE)

作者： Idris, Azlina Samaon, Azrinawati Idris, Mohd Syarhan Univ Teknol MARA UiTM Wireless Commun Technol Grp Fak Kejuruteraan Elekt Shah Alam 40450 Selangor Malaysia

ISBN: (纸本)9781509011780

Finding the optimization of power allocation of subcarrier is always a challenge in MIMO-OFDMA schemes in order to maximize the capacity of the system. Resources allocation is process how set of network is decide in wireless system. This research is to study restriction of proportional rate and total power among user in MIMO-OFDMA scheme and the power allocation and capacity of subcarrier in the scheme. The objectives are to suggest by using greedy Power Allocation for capacity increment in MIMO-OFDMA system and to evaluate the system by greedy Subcarrier Allocation. Simulation results show that the proposed algorithm can improve the capacity of the network compared with the waterfilling when using signal-to-noise ratio (SNR) with value 6dB. The proposed algorithm shows comparison between the noise to sub-channel ratio and power allocation in the midst of data sub-channel for 25, 75 and 100 users. It shows that there is no significant difference in power allocation of data subcarriers even if the number of users is increased.

关键词： Resource Allocation MIMO-OFDMA greedy algorithm Power Allocation Subcarrier Allocation

来源：评论

学校读者我要写书评

暂无评论

greedyAgent: Crafting Efficient Agents for Meta-learning from Learning Curves via greedy algorithm Selection 20th

GreedyAgent: Crafting Efficient Agents for Meta-learning fro...

引用

20th International Conference on Intelligent Computing (ICIC)

作者： He, Jinyu Song, Xiaowei Yan, Xiaohan Wang, Nan Miao, Yuqi Jiang, Zijian Chao, Fei Zhang, Yan Zhang, Shengchuan Ji, Rongrong Xiamen Univ Sch Informat Xiamen 361005 Peoples R China Tongji Univ Coll Elect & Informat Engn Shanghai 201804 Peoples R China

ISBN: (纸本)9789819756629;9789819756636

With the rapid development of artificial intelligence and machine learning technologies, Automated Machine Learning (AutoML) has become a hot research area in recent years. Meta-learning plays an increasingly important role in AutoML. Akey sub-problem-meta-learning from learning curves is an immature but gradually gaining attention are awithin the field ofmeta-learning. For instance, in MetaLC, the organizers designed a competition on meta-learning from learning curves, whose goal is to achieve the highest all-time performance, based on the algorithm's selection strategy learned by past learning curves. This competition aims to simulate the meta-learning process in an environment like reinforcement learning, where the strategies provided by the participants act as agents interacting with the environment. We innovatively propose a training strategy for agents called greedyAgent, based on an approximate greedy algorithm. After reducing the problem of meta-learning from learning curves to a 0-1 knapsack problem, we proved that our greedy method could replace the dynamic programming method to find an approximate optimal solution. In both the development phase and the final evaluation phase, our method achieved state-of-the-art in test results. We compared five baseline methods and selected representative cases for detailed analysis. The competition's second round has been accepted by the first AutoML Conference. Besides, our solution ranked 1st among the 14 methods participating in the competition. The code of our method has been released: https://***/dragonbra/MetaLC-2nd-Round.

关键词： AutoML Meta-learning Learning curves greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：