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

6th International Conference on Control Engineering and Information Technology (CEIT)

作者： Entekhabi, Sina Karatas, Ahmet Serkan Oguztuzun, Halit Middle East Tech Univ Comp Engn Dept Ankara Turkey

ISBN: (纸本)9781538676417

dynamically reconfigurable systems are able to respond to changes in their operational environments by reconfiguring themselves automatically. dynamic software product lines are dynamically reconfigurable systems with an explicit variability model that guides the reconfiguration. In this work, feature models are used as the variability model. An emerging situation in the environment can lead to some relevant changes to the current configuration: some features must be activated, and some must be deactivated. Due to constraint propagation, the status of other features might need to be changed as well. However, considering the feature state migration cost, one would like to mitigate the cost to the greatest extent possible. Furthermore, the configuration with a proper cost has to be reached in an acceptable time. In this paper, we devised a set of feature model heuristics for a constraint satisfaction problem algorithm that considers the efficiency and the cost of feature state changes to be applied to the current configuration while confronting the changes in the environment so that the requirements of the new situation will be efficiently satisfied with the minimum cost.

关键词： feature Model online reconfiguration dynamic algorithm dynamic software product line heuristics

来源：评论

学校读者我要写书评

暂无评论

A New dynamic PV Firming Control algorithm Using Grid-Tied Three-Port Micro-Converter 33

A New Dynamic PV Firming Control Algorithm Using Grid-Tied T...

引用

33rd Annual IEEE Applied Power Electronics Conference and Exposition (APEC)

作者： Alharbi, Mahmood Pise, Anirudh Hu Haibing Batarseh, Issa Univ Cent Florida Dept Elect & Comp Engn Orlando FL 32816 USA

ISBN: (纸本)9781538611807

With the demand increase for electricity, the ever-increasing awareness of environmental issues, coupled with rolling blackouts, the role of renewable energy generation will become even more significant. Instead of the traditional high-power energy storage and management system at the utility scale to implement PV firming, this paper proposes a new PV (panel-level) firming control algorithm using grid-tied three-port bidirectional converter. The topology with the control algorithm and PV intermittency data collected in real time are discussed and analyzed in MATLAB/SIMULINK. The preliminary experimental results verify the proposed PV firming algorithm.

关键词： DC/DC converter DC/AC inverter PV firming dynamic algorithm storage three-port converter

来源：评论

学校读者我要写书评

暂无评论

dynamic Load Balancing algorithm of Distributed Systems 13

Dynamic Load Balancing Algorithm of Distributed Systems

引用

13th International Conference on Modern Problems of Radio Engineering, Telecommunications and Computer Science (TCSET)

作者： Kirichenko, Lyudmila Ivanisenko, Igor Radivilova, Tamara Kharkiv Natl Univ Radioelect Ave Sci 14 UA-61166 Kharkov Ukraine

ISBN: (纸本)9786176078067

The dynamic load balancing algorithm based on the monitoring server load, self-similar characteristics of passing traffic have to provide a statistically uniform load distribution on servers, high performance, fault tolerance and capacity, low response time, the amount of overhead and losses was propose in work. Integrated measurement for the total imbalance level of the system were entered.

关键词： Load balancing system dynamic algorithm Self-similar Parameter Hurst Monitoring

来源：评论

学校读者我要写书评

暂无评论

Fast RankClus algorithm via dynamic Rank Score Tracking on Bi-type Information Networks 21

Fast RankClus Algorithm via Dynamic Rank Score Tracking on B...

引用

21st International Conference on Information Integration and Web-Based Applications and Services (iiWAS)

作者： Yamazaki, Kotaro Matsugu, Shohei Shiokawa, Hiroaki Kitagawa, Hiroyuki Univ Tsukuba Grad Sch SIE Tsukuba Ibaraki Japan Univ Tsukuba Ctr Computat Sci Tsukuba Ibaraki Japan

ISBN: (纸本)9781450371797

Given a bi-type information network, which is an extended model of well-known bipartite graphs, how can clusters be efficiently found in graphs? Graph clustering is now a fundamental tool to understand overviews from graph-structured data. The RankClus framework accurately performs clustering for bi-type information networks using ranking-based graph clustering techniques. It integrates a graph ranking algorithms such as PageRank or HITS into graph clustering procedures to improve the clustering quality. However, this integration incurs a high computational cost to handle large bi-type information networks since RankClus repeatedly computes the ranking algorithm for all nodes and edges until the clustering procedure converges. To overcome this runtime limitation, herein we present a novel RankClus algorithm that reduces the running time for large bi-type information networks. Our proposed method employs dynamic graph processing techniques into the ranking procedures included in RankClus. By dynamically updating ranking results, our proposal reduces the number of computed nodes and edges during repeated ranking procedures. We experimentally verify using real-world datasets that our proposed method successfully reduces the running time while maintaining the clustering quality of RankClus.

关键词： Graph dynamic algorithm Clustering

来源：评论

学校读者我要写书评

暂无评论

dynamic LOAD REBALANCING algorithm FOR PRIVATE CLOUD

DYNAMIC LOAD REBALANCING ALGORITHM FOR PRIVATE CLOUD

引用

1st International Conference on Advancements in Automation and Control (ICAAC)

作者： Priya, Shenbaga Bharatha A. Ganesh, J. Mareeswari, Devi M. Dr Sivanthi Aditanar Coll Engn Dept Informat Technol Tuticorin 628215 Tamil Nadu India

ISBN: (纸本)9783038351245

Infrastructure-As-A-Service (IAAS) provides an environmental setup under any type of cloud. In Distributed file system (DFS), nodes are simultaneously serve computing and storage functions;that is parallel Data Processing and storage in cloud. Here, file is considered as a data or load. That file is partitioned into a number of File chunks (FC) allocated in distinct nodes so that Map Reduce tasks can be performed in parallel over the nodes. Files and Nodes can be dynamically created, deleted, and added. This results in load imbalance in a distributed file system;that is, the file chunks are not distributed as uniformly as possible among the Chunk Servers (CS). Emerging distributed file systems in production systems strongly depend on a central node for chunk reallocation or Distributed node to maintain global knowledge of all chunks. This dependence is clearly inadequate in a large-scale, failure-prone environment because the central load balancer is put under considerable workload that is linearly scaled with the system size, it may thus become the performance bottleneck and the single point of failure and memory wastage in distributed nodes. So, we have to enhance the Client side module with server side module to create, delete and update the file chunks in Client Module. And manage the overall private cloud and apply dynamic load balancing algorithm to perform auto scaling options in private cloud. In this project, a fully distributed load rebalancing algorithm is presented to cope with the load imbalance problem.

关键词： Infrastructure-As-A-Service Parallel Data Processing Distributed File System Cloud Computing dynamic algorithm Auto Scaling Elasticity

来源：评论

学校读者我要写书评

暂无评论

The Power of dynamic Distance Oracles: Efficient dynamic algorithms for the Steiner Tree 15

The Power of Dynamic Distance Oracles: Efficient Dynamic Alg...

引用

47th Annual ACM Symposium on Theory of Computing (STOC) held as part of the Federated Computing Research Conference

作者： Lacki, Jakub Ocwieja, Jakub Pilipczuk, Marcin Sankowski, Piotr Zych, Anna Univ Warsaw Warsaw Poland Univ Warwick Warwick England

ISBN: (纸本)9781450335362

In this paper we study the Steiner tree problem over a dynamic set of terminals. We consider the model where we are given an n-vertex graph G = (V, E, w) with positive real edge weights, and our goal is to maintain a tree which is a good approximation of the minimum Steiner tree spanning a terminal set S subset of V, which changes over time. The changes applied to the terminal set are either terminal additions (incremental scenario), terminal removals (decremental scenario), or both (fully dynamic scenario). Our task here is twofold. We want to support updates in sublinear o(n) time, and keep the approximation factor of the algorithm as small as possible. We show that we can maintain a (6 + epsilon)-approximate Steiner tree of a general graph in (O) over tilde(root n log D) time per terminal addition or removal. Here, D denotes the stretch of the metric induced by G. For planar graphs we achieve the same running time and the approximation ratio of (2 + epsilon). Moreover, we show faster algorithms for incremental and decremental scenarios. Finally, we show that if we allow higher approximation ratio, even more efficient algorithms are possible. In particular we show a polylogarithmic time (4 + epsilon)-approximate algorithm for planar graphs. One of the main building blocks of our algorithms are dynamic distance oracles for vertex-labeled graphs, which are of independent interest. We also improve and use the online algorithms for the Steiner tree problem.

关键词： Steiner tree dynamic algorithm dynamic distance oracles approximation

来源：评论

学校读者我要写书评

暂无评论

Performance of dynamic algorithms on the dynamic Distance Minimization Problem 19

Performance of Dynamic Algorithms on the Dynamic Distance Mi...

引用

Genetic and Evolutionary Computation Conference (GECCO)

作者： Helbig, Marde Zille, Heiner Javadi, Mahrokh Mostaghim, Sanaz Univ Pretoria Dept Comp Sci Pretoria South Africa Otto Von Guericke Univ Fac Comp Sci Magdeburg Germany

ISBN: (纸本)9781450367486

In the area of multi-objective optimization, a special challenge is dynamic optimization problems. These problems change their optimal values or optimal configurations of input variables over time, making it harder for metaheuristic algorithms to track these changes and find the new optima. To test the search ability of such dynamic multi-objective algorithms, a dynamic benchmark called the dynamic Distance Minimization Problem (dDMP) was proposed in the literature. The dDMP implements multiple changes, not only in location and fitness values of the Pareto-optimal sets, but also in the complexity of the problem. This work aims to test the performance of two well-known dynamic multi-objective algorithms on different instances of the dDMP with varying complexity. This involves changes in the number of objectives and changes of the distance metric at runtime, which has not been done before with this problem in the literature. The results show that both algorithms struggled to recover after the number of objectives was reduced and then increased again. When the distance metric was changed over time both algorithms performed reasonable well. However, there were gaps in the found Pareto fronts when switching between the Euclidean and the Manhattan distance metrics.

关键词： dynamic optimization Multi-objective optimization dynamic algorithm Distance minimization problem

来源：评论

学校读者我要写书评

暂无评论

Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs

Proceedings of the ACM on Management of Data

引用

Proceedings of the ACM on Management of Data 2025年第1期3卷 1-27页

作者： Meihao Liao Cheng Li Rong-Hua Li Guoren Wang Beijing Institute of Technology Beijing China

In this paper, we study a problem of index maintenance on evolving graphs for effective resistance computation. Unlike an existing matrices-based index, we show that the index can be efficiently maintained by directly preserving samples of random walks and loop-erased walks. This approach not only enables efficient storage and rapid query response but also supports effective maintenance. We propose a novel approach to convert edge updates into landmark node updates. Building upon this, we present two new update algorithms for random walk and loop-erased walk samples respectively. Both algorithms update samples without requiring complete resampling, ensuring accuracy and high efficiency. A particularly challenging and innovative technique involves updating loop-erased walks. Here we develop a novel and powerful cycle decomposition technique for loop-erased walks, enabling us to update samples at the cycle level rather than the node level, significantly enhancing efficiency. Furthermore, we show that both of our methods achieve an Õ (1) time complexity per edge update in real-world graphs under a mild assumption. We conduct extensive experiments using 10 large real-world datasets to evaluate the performance of our approaches. The results show that our best algorithm can be up to two orders of magnitude faster than the baseline methods.

关键词： dynamic algorithm effective resistance index maintenance

来源：评论

学校读者我要写书评

暂无评论

dynamic CONSTRAINT SATISFACTION algorithm FOR RECONFIGURATION OF FEATURE MODELS

DYNAMIC CONSTRAINT SATISFACTION ALGORITHM FOR RECONFIGURATIO...

引用

作者： SINA ENTEKHABI MIDDLE EAST TECHNICAL UNIVERSITY

学位级别：硕士

dynamically reconfigurable systems are able to respond to changes in their oper- ational environments by reconfiguring themselves automatically. dynamic soft- ware product lines are dynamically reconfigurable systems with an explicit vari- ability model that guides the reconfiguration. In this work, feature models are used as the variability model. Features are assumed to be mapped to system's components that realize them. A feature model corresponds to a constraint sat- isfaction problem (CSP), and determines the valid configurations of the system. An emerging situation in the environment can lead to some relevant changes to the current configuration: some features must be activated, and some must be deactivated. Due to constraint propagation, the status of other features might need to be changed as well. However, considering the feature state migration costs, one would like to avoid such changes to the greatest extent possible in order to mitigate the cost of the disruption to the system's operation. In this work, we devised a dynamic constraint satisfaction algorithm that efficiently considers feature state changes to be applied to the current configuration while confronting changes in the environment so that the new configuration will be valid and the requirements of the new situation will be satisfied with the mini- mum cost. A set of heuristics regarding feature model relations and the overall structure of feature models are also proposed to enhance the efficiency of the algorithm.

关键词： dynamic Reconfiguration Feature Model dynamic algorithm dynamic Constraint Satisfaction Problem

来源：评论

学校读者我要写书评

暂无评论

A dynamic HIERARCHICAL SUBDIVISION algorithm FOR COMPUTING DELAUNAY TRIANGULATIONS AND OTHER CLOSEST-POINT PROBLEMS

引用

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE 1990年第3期16卷 275-292页

作者： PALACIOSVELEZ, O RENAUD, BC Colegio de Postgraduados Chapingo Mexico

A new, dynamic, hierarchical subdivision and recursive algorithm for computing Delaunay triangulations is presented. The algorithm has four main steps: (1) location of the already formed triangle that contains the point to be inserted, (2) identification of other adjoining triangles whose circumcircle contains the point, (3) formation of the new triangles, and (4) database update. Different search procedures are analyzed. It is shown that the "oriented walk" search has a better performance than the asymptotically optimal "hierarchical subdivision" search, when the total number of points is less than 417 or when the points are presorted by distance or coordinates. The algorithm has point-deletion capabilities which are discussed in detail.

关键词： CLOSEST POINT PROBLEMS COMPUTATIONAL GEOMETRY DELAUNAY TRIANGULATION dynamic algorithm HIERARCHICAL SEARCH

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：