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

On partitioning Multivariate Self-Affine Time Series

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 2017年第6期21卷 845-862页

作者： Taylor, Christopher Michael Salhi, Abdellah Univ Essex Dept Math Sci Colchester CO4 3SQ Essex England

Given a multivariate time series, possibly of high dimension, with unknown and time-varying joint distribution, it is of interest to be able to completely partition the time series into disjoint, contiguous subseries, each of which has different distributional or pattern attributes from the preceding and succeeding subseries. An additional feature of many time series is that they display self-affinity, so that subseries at one time scale are similar to subseries at another after application of an affine transformation. Such qualities are observed in time series from many disciplines, including biology, medicine, economics, finance, and computer science. This paper defines the relevant multiobjective combinatorial optimization problem with limited assumptions as a biobjective one, and a specialized evolutionary algorithm is presented which finds optimal self-affine time series partitionings with a minimum of choice parameters. The algorithm not only finds partitionings for all possible numbers of partitions given data constraints, but also for self-affinities between these partitionings and some fine-grained partitioning. The resulting set of Pareto-efficient solution sets provides a rich representation of the self-affine properties of a multivariate time series at different locations and time scales.

关键词： Finance fractals genetic algorithms optimization methods Pareto optimization partitioning algorithms time series analysis

来源：评论

学校读者我要写书评

暂无评论

partitioning POLYHEDRAL OBJECTS INTO NONINTERSECTING PARTS

引用

IEEE COMPUTER GRAPHICS AND APPLICATIONS 1988年第1期8卷 53-67页

作者： SEGAL, M SEQUIN, CH Dept. of Electr. Eng. California Univ. Berkeley CA USA

An algorithm is described for partitioning intersecting polyhedrons into disjoint pieces and, more generally, removing intersections from sets of planar polygons embedded in three space. Polygons, or faces, need not be convex and may contain multiple holes. Intersections are removed by considering pairs of faces and slicing the faces apart along their regions of intersection. To reduce the number of face pairs examined, bounding boxes around groups of faces are checked for overlap. The intersection algorithm also computes set-theoretic operations on polyhedrons. Information gathered during face cutting is used to determine which portions of the original boundaries may be present in the result of an intersection, a union, or a difference of solids. The method includes provisions to detect and in some cases overcome, the effects of numerical inaccuracy on the topological decisions that the algorithm must make. The regions in which ambiguous results are possible are flagged so that the user can take appropriate action.

关键词： Face Detection partitioning algorithms Solids

来源：评论

学校读者我要写书评

暂无评论

Optimal Spectrum partitioning and Licensing in Tiered Access Under Stochastic Market Models

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2021年第5期29卷 1948-1961页

作者： Saha, Gourav Abouzeid, Alhussein A. Rensselaer Polytech Inst Dept Elect Comp & Syst Engn Troy NY 12180 USA

We consider the problem of partitioning a spectrum band into M channels of equal bandwidth, and then further assigning theseM channels into P licensed channels andM- P unlicensed channels. Licensed channels can be accessed both for licensed and opportunistic use following a tiered structure that has a higher priority for licensed use. Unlicensed channels can be accessed only for opportunistic use. We address the following question in this paper. Given a market setup, what values of M and P maximize the net spectrum utilization of the spectrum band? While this problem is fundamental, it is highly relevant practically, e.g., in the context of partitioning the recently proposed Citizens Broadband Radio Service band. IfM is too high or too low, it may decrease spectrum utilization due to limited channel capacity or due to wastage of channel capacity, respectively. If P is too high (low), it will not incentivize the wireless operators who are primarily interested in unlicensed channels (licensed channels) to join the market. These tradeoffs are captured in our optimization problem which manifests itself as a two-stage Stackelberg game. We design an algorithm to solve the Stackelberg game and hence find the optimal M and P. The algorithm design also involves an efficient Monte Carlo integrator to evaluate the expected value of the involved random variables like spectrum utilization and operators' revenue. We also benchmark our algorithms using numerical simulations.

关键词： Licenses Wireless communication Games Bandwidth Monte Carlo methods Gallium arsenide partitioning algorithms Spectrum auction opportunistic spectrum access CBRS band Stackelberg game iterated removal of strictly dominated strategies Monte Carlo integration optimization

来源：评论

学校读者我要写书评

暂无评论

partitioning Stateful Data Stream Applications in Dynamic Edge Cloud Environments

引用

IEEE TRANSACTIONS ON SERVICES COMPUTING 2022年第4期15卷 2368-2381页

作者： Ding, Shaoshuai Yang, Lei Cao, Jiannong Cai, Wei Tan, Mingkui Wang, Zhenyu South China Univ Technol Sch Software Engn Guangzhou 510641 Peoples R China Hong Kong Polytech Univ Dept Comp Hong Kong Peoples R China Chinese Univ Hong Kong Sch Sci & Engn Shenzhen 518000 Guangdong Peoples R China Shenzhen Inst Artificial Intelligence & Robot Soc Shenzhen 518000 Peoples R China

Computation partitioning is an important technique to improve the application performance by selectively offloading some computations from the mobile devices to the nearby edge cloud. In a dynamic environment in which the network bandwidth to the edge cloud may change frequently, the partitioning of the computation needs to be updated accordingly. The frequent updating of partitioning leads to high state migration cost between the mobile side and edge cloud. However, existing works don't take the state migration overhead into consideration. Consequently, the partitioning decisions may cause significant network congestion and increase overall completion time tremendously. In this article, with considering the state migration overhead, we propose a set of novel algorithms to update the partitioning based on the changing network bandwidth. To the best of our knowledge, this is the first work on computation partitioning for stateful data stream applications in dynamic environments. The algorithms aim to alleviate the network congestion and minimize the make-span through selectively migrating state in dynamic edge cloud environments. Extensive simulations show our solution not only could selectively migrate state but also outperforms other classical benchmark algorithms in terms of make-span. The proposed model and algorithms will enrich the scheduling theory for stateful tasks, which has not been explored before.

关键词： Cloud computing Mobile handsets partitioning algorithms Heuristic algorithms Object tracking Data models Servers Edge cloud computation partitioning stateful data stream applications

来源：评论

学校读者我要写书评

暂无评论

A Probabilistic Niching Evolutionary Computation Framework Based on Binary Space partitioning

引用

IEEE TRANSACTIONS ON CYBERNETICS 2022年第1期52卷 51-64页

作者： Huang, Ting Gong, Yue-Jiao Chen, Wei-Neng Wang, Hua Zhang, Jun South China Univ Technol Sch Comp Sci & Engn Guangzhou 510006 Peoples R China Univ Victoria ISILC Melbourne Vic 8001 Australia

Multimodal optimization problems have multiple satisfactory solutions to identify. Most of the existing works conduct the search based on the information of the current population, which can be inefficient. This article proposes a probabilistic niching evolutionary computation framework that guides the future search based on more sufficient historical information, in order to locate diverse and high-quality solutions. A binary space partition tree is built to structurally organize the space visiting information. Based on the tree, a probabilistic niching strategy is defined to reinforce exploration and exploitation by making full use of the structural historical information. The proposed framework is universal for incorporating various baseline niching algorithms. In this article, we integrate the proposed framework with two niching algorithms: 1) a distance-based differential evolution algorithm and 2) a topology-based particle swarm optimization algorithm. The two new algorithms are evaluated on 20 multimodal optimization test functions. The experimental results show that the proposed framework helps the algorithms obtain competitive performance. They outperform a number of state-of-the-art niching algorithms on most of the test functions.

关键词： Sociology Statistics partitioning algorithms Topology Vegetation Probabilistic logic Optimization Binary space partition (BSP) evolutionary algorithm (EA) multimodal optimization probabilistic niching computation

来源：评论

学校读者我要写书评

暂无评论

PDD: partitioning DAG-Topology DNNs for Streaming Tasks

引用

IEEE INTERNET OF THINGS JOURNAL 2024年第6期11卷 9258-9268页

作者： Wu, Liantao Gao, Guoliang Yu, Jing Zhou, Fangtong Yang, Yang Wang, Tengfei East China Normal Univ Software Engn Inst Shanghai Key Lab Trustworthy Comp Shanghai 200062 Peoples R China ShanghaiTech Univ Sch Informat Sci & Technol Shanghai 201210 Peoples R China Hong Kong Univ Sci & Technol Guangzhou IoT Thrust Guangzhou 510000 Peoples R China Wuhan Univ Technol State Key Lab Maritime Technol & Safety Wuhan 430063 Peoples R China Wuhan Univ Technol Sch Transportat & Logist Engn Wuhan 430063 Peoples R China

To enable the inference of high-precision deep neural networks (DNNs) on resource-constrained devices, DNN offloading has been widely explored in recent years. Some works have also integrated the chain-topology DNN (CDNN) offloading with pipeline processing to further reduce inference delay when processing streaming tasks. To improve the accuracy of the inference results, the topology of DNN tends to evolve from chain topology to directed acyclic graph (DAG) topology. However, most of the existing works do not study partitioning and offloading DAG-topology DNNs (DDNNs) for streaming tasks. Moreover, when partitioning computationally expensive DNN models, multipartitioning probably outperforms the bi-partitioning method, and most of the works do not study multipartitioning DAG-topology DNNs. In this article, we propose a more general multipartitioning and offloading method for large-scale DDNNs to process streaming tasks, which can adaptively partition DDNNs into multiple parts considering the computing power and bandwidth of all available computing units. Specifically, we first present a transforming method based on topological sorting that can losslessly transform DAG-topology DNNs into CDNNs. Then, based on greedy and dichotomy ideas, a multipartitioning algorithm is designed to partition and offload CDNNs. In this way, we can solve DDNNs' multipartitioning problem based on the proposed transforming and partitioning algorithms. Experimentshttps://***/sreasearcher/PDD-Code show that the method proposed in this article significantly outperforms bi-partitioning and nonpartitioning methods when offloading computationally expensive DNN models.

关键词： Computational modeling Task analysis Artificial neural networks Delays Copper partitioning algorithms Topology Directed acyclic graph (DAG) topology deep neural network (DNN) partitioning streaming tasks

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT HEURISTIC partitioning ALGORITHM FOR PARALLEL-PROCESSING OF LARGE POWER-SYSTEMS NETWORK EQUATIONS

引用

IEE PROCEEDINGS-GENERATION TRANSMISSION AND DISTRIBUTION 1995年第6期142卷 625-630页

作者： CHAN, KW DUNN, RW DANIELS, AR Sch. of Electron. & Electr. Eng. Bath Univ. UK

An efficient heuristic algorithm for automatic partitioning of a power system network is presented. The algorithm was designed to be used in conjunction with a diakoptics-based coarse grain parallel method for solving large, sparse linear systems arising from network analysis. It exploits the techniques of factorisation path graph partitioning and equivalent post-ordering. Test results for systems up to 811 busbars and 1476 transmission lines are included for comparison purposes. This indicates that the method is able to divide a power system network model into a number of equal sized subnetworks in order to optimise the use of parallel computer systems for network analysis while the resultant number of fill-in elements is kept to a minimum.

关键词： HIGH POWER Heuristics power systems partitioning algorithms PARALLEL PROCESSING (COMPUTERS) system network Transmission Lines Clinical Test Result Network analysis

来源：评论

学校读者我要写书评

暂无评论

The Mutex Watershed and its Objective: Efficient, Parameter-Free Graph partitioning

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2021年第10期43卷 3724-3738页

作者： Wolf, Steffen Bailoni, Alberto Pape, Constantin Rahaman, Nasim Kreshuk, Anna Kothe, Ullrich Hamprecht, Fred A. Heidelberg Univ HCI IWR D-69120 Heidelberg Germany EMBL D-69117 Heidelberg Germany

Image partitioning, or segmentation without semantics, is the task of decomposing an image into distinct segments, or equivalently to detect closed contours. Most prior work either requires seeds, one per segment;or a threshold;or formulates the task as multicut / correlation clustering, an NP-hard problem. Here, we propose an efficient algorithm for graph partitioning, the "Mutex Watershed". Unlike seeded watershed, the algorithm can accommodate not only attractive but also repulsive cues, allowing it to find a previously unspecified number of segments without the need for explicit seeds or a tunable threshold. We also prove that this simple algorithm solves to global optimality an objective function that is intimately related to the multicut / correlation clustering integer linear programming formulation. The algorithm is deterministic, very simple to implement, and has empirically linearithmic complexity. When presented with short-range attractive and long-range repulsive cues from a deep neural network, the Mutex Watershed gives the best results currently known for the competitive ISBI 2012 EM segmentation benchmark.

关键词： Clustering algorithms partitioning algorithms Image segmentation Image edge detection Merging Correlation Vegetation Image segmentation partitioning algorithms greedy algorithms optimization integer linear programming machine learning convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Geometric multiscale community detection: Markov stability and vector partitioning

引用

JOURNAL OF COMPLEX NETWORKS 2018年第2期6卷 157-172页

作者： Liu, Zijing Barahona, Mauricio Imperial Coll London Dept Math South Kensington Campus London SW7 2AZ England Imperial Coll London Dept Chem South Kensington Campus London SW7 2AZ England

Multiscale community detection can be viewed from a dynamical perspective within the Markov stability framework, which uses the diffusion of a Markov process on the graph to uncover intrinsic network substructures across all scales. Here we reformulate multiscale community detection as a max-sum length vector partitioning problem with respect to the set of time-dependent node vectors expressed in terms of eigenvectors of the transition matrix. This formulation provides a geometric interpretation of Markov stability in terms of a time-dependent spectral embedding, where the Markov time acts as an inhomogeneous geometric resolution factor that zooms the components of the node vectors at different rates. Our geometric formulation encompasses both modularity and the multi-resolution Potts model, which are shown to correspond to vector partitioning in a pseudo-Euclidean space, and is also linked to spectral partitioning methods, where the number of eigenvectors used corresponds to the dimensionality of the underlying embedding vector space. Inspired by the Louvain optimization for community detection, we then propose an algorithm based on a graph-theoretical heuristic for the vector partitioning problem. We apply the algorithm to the spectral optimization of modularity and Markov stability community detection. The spectral embedding based on the transition matrix eigenvectors leads to improved partitions with higher information content and higher modularity than the eigen-decomposition of the modularity matrix. We illustrate the results with random network benchmarks.

关键词： multiscale community detection spectral methods partitioning algorithms modularity Markov stability

来源：评论

学校读者我要写书评

暂无评论

Hypergraph partitioning With Embeddings

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2022年第6期34卷 2771-2782页

作者： Sybrandt, Justin Shaydulin, Ruslan Safro, Ilya Clemson Univ Sch Comp Clemson SC 29634 USA

Problems in scientific computing, such as distributing large sparse matrix operations, have analogous formulations as hypergraph partitioning problems. A hypergraph is a generalization of a traditional graph wherein "hyperedges" may connect any number of nodes. As a result, hypergraph partitioning is an NP-Hard problem to both solve or approximate. State-of-the-art algorithms that solve this problem follow the multilevel paradigm, which begins by iteratively "coarsening" the input hypergraph to smaller problem instances that share key structural features. Once identifying an approximate problem that is small enough to be solved directly, that solution can be interpolated and refined to the original problem. While this strategy represents an excellent trade off between quality and running time, it is sensitive to coarsening strategy. In this work we propose using graph embeddings of the initial hypergraph in order to ensure that coarsened problem instances retrain key structural features. Our approach prioritizes coarsening within self-similar regions within the input graph, and leads to significantly improved solution quality across a range of considered hypergraphs. Reproducibility: All source code, plots and experimental data are available at https://***/2019/partition.

关键词： partitioning algorithms Bipartite graph Approximation algorithms Machine learning Message systems Interpolation Contracts

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：