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

A principle of stream arrangement based on uniformity factor for heat exchanger networks synthesis

APPLIED THERMAL ENGINEERING 2013年第2期61卷 93-100页

作者： He, Qiaole Cui, Guomin Shanghai Univ Sci & Technol Sch Energy & Power Engn Shanghai 20093 Peoples R China

Heat exchanger network synthesis (HENS) has been one of the most extensively studied synthesis problem in chemical engineering. The methodologies commonly used to solve a heat exchanger network (HEN) problem are based on heuristic methods instead of deterministic methods which, theoretically, only with feasible initial HEN configuration enumeration, can find global optima. But enumeration always leads to unacceptable computational time. This paper presents a principle of process stream arrangement and the related deterministic algorithm for synthesizing HEN. The implementation of the principle based on the uniformity factor which proposed to describe the degree of the energy distribution of HEN configuration under different process stream arrangement is aimed to decrease the space of configuration enumeration. Thus, through the part of smaller uniformity factor network structure are optimized, deterministic methods are effectively suitable for medium-size problem with global optima in a reasonable brief computational time. Notably, using examples of 8SP1, 10SP, 10SP1, 14SP1, we demonstrate that our approach finds superior networks compared to those known in the literature. (C) 2013 Published by Elsevier Ltd.

关键词： Heat exchanger network synthesis Stream arrangement Uniformity factor deterministic algorithm

来源：评论

学校读者我要写书评

暂无评论

On Calculating the Minimum Rate for the Cooperative Data Exchange Problem Over Fully Connected Networks

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2021年第9期69卷 5817-5827页

作者： Li, Su Gastpar, Michael Ecole Polytech Fed Lausanne EPFL Sch Comp & Commun Sci CH-1015 Lausanne Switzerland

We study the cooperative data exchange problem for fully connected networks. In this problem, nodes make broadcast transmissions to recover a file consisting of K independent packets. Each node initially only possesses a subset of the packets. We propose (d, K)-Basis Searching, a deterministic polynomial-time minimization approach, to calculate the minimum rate for this problem. (d, K)-Basis Searching has strictly reduced complexity compared with the state-of-the-art algorithms, which are based on submodular function minimization. We extend our algorithm to a generalized problem: the so-called successive local omniscience problem.

关键词： Cooperative data exchange linear codes deterministic algorithm successive local omniscience

来源：评论

学校读者我要写书评

暂无评论

Heuristics for two-dimensional strip packing problem with 90° rotations

引用

EXPERT SYSTEMS WITH APPLICATIONS 2013年第14期40卷 5542-5550页

作者： He, Kun Jin, Yan Huang, Wenqi Huazhong Univ Sci & Technol Sch Comp Sci & Technol Wuhan 430074 Peoples R China

This paper proposes a deterministic heuristic algorithm (DHA) for two-dimensional strip packing problem where 90 rotations of pieces are allowed and there is no guillotine packing constraint. The objective is to place all pieces without overlapping into a strip of given width so as to minimize the total height of the pieces. Based on the definition of action space, a new sorting rule for candidate placements is proposed such that the position for the current piece is as low as possible, the distance between the current piece and other inside pieces is as close as possible, and the adverse impact for further placements is as little as possible. Experiments on four groups of benchmarks showed the proposed DHA achieved highly competitive results in comparison with the state-of-the-art algorithms in the literature. Also, as a deterministic algorithm, the DHA could achieve high quality solutions by only one independent run on both small-scale and large-scale problem instances and the results are repeatable. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： Combinatorial optimization Strip packing Heuristics deterministic algorithm

来源：评论

学校读者我要写书评

暂无评论

Priority rules-based algorithmic design on two-sided assembly line balancing

引用

PRODUCTION ENGINEERING-RESEARCH AND DEVELOPMENT 2018年第1期12卷 95-108页

作者： Li, Yuchen Coit, David Beijing Univ Technol Coll Econ & Management Beijing Peoples R China Rutgers State Univ Ind & Syst Engn New Brunswick NJ USA

The two-sided assembly line becomes very popular in recent years. In this paper, a priority rules-based algorithmic design is developed for optimizing two-sided assembly line. Five elementary rules and 90 composite rules are tested on the benchmark data sets and their performance are provided. Two enumerative principles, which are specific to two-sided assembly lines are proposed to enhance the performance of the rules. Further, priority rules are embedded into a bounded dynamic programming framework to form a deterministic algorithm where the use of a bound can reduce the solution space as the algorithm is advanced stage-by-stage. These approaches offer distinct advantages over the methods proposed in the literature, such as less fine-tuning effort and more stable results. Computational results show that the novel algorithm can generate good solutions efficiently, especially in large sized problems.

关键词： Two-sided assembly line balancing Priority rules-based methods Bounded dynamic programming Solution space reduction approaches deterministic algorithm

来源：评论

学校读者我要写书评

暂无评论

SVD-based algorithms for tensor wheel decomposition

引用

ADVANCES IN COMPUTATIONAL MATHEMATICS 2024年第5期50卷 1-23页

作者： Wang, Mengyu Cui, Honghua Li, Hanyu Chongqing Univ Coll Math & Stat Chongqing Peoples R China Xiamen Univ Wang Yanan Inst Studies Econ Fujian Peoples R China Chongqing Univ Key Lab Nonlinear Anal & its Applicat Minist Educ Chongqing Peoples R China

Tensor wheel (TW) decomposition combines the popular tensor ring and fully connected tensor network decompositions and has achieved excellent performance in tensor completion problem. A standard method to compute this decomposition is the alternating least squares (ALS). However, it usually suffers from slow convergence and numerical instability. In this work, the fast and robust SVD-based algorithms are investigated. Based on a result on TW-ranks, we first propose a deterministic algorithm that can estimate the TW decomposition of the target tensor under a controllable accuracy. Then, the randomized versions of this algorithm are presented, which can be divided into two categories and allow various types of sketching. Numerical results on synthetic and real data show that our algorithms have much better performance than the ALS-based method and are also quite robust. In addition, with one SVD-based algorithm, we also numerically explore the variability of TW decomposition with respect to TW-ranks and the comparisons between TW decomposition and other famous formats in terms of the performance on approximation and compression.

关键词： Tensor wheel decomposition SVD Alternating least squares deterministic algorithm Randomized algorithm Sketching

来源：评论

学校读者我要写书评

暂无评论

UAVs's efficient controlled mobility management for mobile heterogeneous wireless sensor networks

引用

JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES 2022年第6期34卷 2461-2470页

作者： Guezouli, Lyamine Barka, Kamel Djehiche, Asma Univ Batna 2 L STIC Lab Dept Comp Sci Batna Algeria

Mobile Heterogeneous Wireless Sensor Networks (Heterogeneous WSNs) are mainly characterized by their internal diversity. In such networks, the variety of properties in each component provides profitable outcomes related to many metrics such as network lifetime and hardware cost. Although it offers remarkable advantages, random mobility causes major difficulties in the management of Heterogeneous WSNs. The purpose of this paper is to introduce a controlled mobility approach for Heterogeneous WSNs using Unmanned Aerial Vehicles (UAVs). According to experiments, the proposed deterministic and genetic methods can efficiently deal with the complexity of Mobile Heterogeneous WSNs compared to the previously applied random strategies. The obtained results prove that our suggested techniques can achieve a greater delivery ratio, a faster coverage time, and a faster latency. (C) 2020 The Authors. Published by Elsevier B.V. on behalf of King Saud University.

关键词： Heterogeneous wireless networks Mobility management Controlled mobility Unmanned aerial vehicles deterministic algorithm Genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

A simplified (O)over-tilde(nm) time edge-splitting algorithm in undirected graphs

引用

algorithmICA 2000年第1期26卷 50-67页

作者： Nagamochi, H Nakamura, S Ibaraki, T Kyoto Univ Grad Sch Informat Dept Appl Math & Phys Kyoto 6068501 Japan

Let G = (V, E) be a multigraph which has a designated vertex s is an element of V with an even degree. For two edges e(1) = (s, u(1)) and e(2) = (s, u(2)), we say that a multigraph G' is obtained from G by splitting e(1) and e(2) at s if two edges e(1) and e(2) are replaced with a single edge (u(1), u(2)). It is known that all edges incident to s can be split without losing the edge-connectivity of G in V - s. This complete splitting plays an important role in solving many graph connectivity problems. The currently fastest algorithm for a complete splitting [14] runs in O(n(m + n log n) log n) time, where n = \V\ and m is the number of pairs of vertices between which G has an edge. Their algorithm is first designed for Eulerian multigraphs, and then extended for general multigraphs. Although the part for Eulerian multigraphs is simple, the rest for general multigraphs is considerably complicated. This paper proposes a much simpler O (n (m + n log n) log n) time algorithm for finding a complete splitting. A new edge-splitting theorem derived from our algorithm is also presented.

关键词： undirected graph multigraph edge-connectivity edge splitting minimum cut polynomial algorithm deterministic algorithm

来源：评论

学校读者我要写书评

暂无评论

algorithms generating images of attractors of generalized iterated function systems

引用

NUMERICAL algorithmS 2016年第2期73卷 477-499页

作者： Jaros, Patrycja Maslanka, Lukasz Strobin, Filip Lodz Univ Technol Div Dynam Stefanowskiego 1-15 PL-90924 Lodz Poland Lodz Univ Technol Inst Math Wolczanska 215 PL-93005 Lodz Poland

The paper is devoted to searching algorithms which will allow to generate images of attractors of generalized iterated function systems (GIFS in short), which are certain generalization of classical iterated function systems, defined by Mihail and Miculescu in 2008, and then intensively investigated in the last years (the idea is that instead of selfmaps of a metric space X, we consider mappings form the Cartesian product Xx...xX to X). Two presented algorithms are counterparts of classical deterministic algorithm and so-called chaos game. The third and fourth one is fitted to special kind of GIFSs - to affine GIFS, which are, in turn, also investigated.

关键词： Fractal Iterated function system Generalized iterated function system Chaos game deterministic algorithm Affine mappings

来源：评论

学校读者我要写书评

暂无评论

Derandomizing the HSSW algorithm for 3-SAT

引用

algorithmICA 2013年第2期67卷 112-124页

作者： Makino, Kazuhisa Tamaki, Suguru Yamamoto, Masaki Univ Tokyo Grad Sch Informat Sci & Technol Tokyo Japan Kyoto Univ Grad Sch Informat Kyoto Japan Seikei Univ Dept Comp & Informat Sci Tokyo Japan

We present a (full) derandomization of HSSW algorithm for 3-SAT, proposed by Hofmeister, Schoning, Schuler, and Watanabe (in STACS 2002, pp. 192-202, 2002). Thereby, we obtain an O(1.3303 (n) )-time deterministic algo... 详细信息

关键词： 3-SAT deterministic algorithm Derandomization

来源：评论

学校读者我要写书评

暂无评论

deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports

引用

ACM TRANSACTIONS ON algorithmS 2014年第2期11卷 10-10页

作者： Dieudonne, Yoann Pelc, Andrzej Univ Picardie Jules Verne Lab MIS F-80039 Amiens France Univ Quebec Dept Informat Hull PQ J8X 3X7 Canada

A team consisting of an unknown number of mobile agents starting from different nodes of an unknown network, possibly at different times, have to explore the network: Every node must be visited by at least one agent, and all agents must eventually stop. Agents are anonymous (identical), execute the same deterministic algorithm, and move in synchronous rounds along links of the network. They are silent: They cannot send any messages to other agents or mark visited nodes in any way. In the absence of any additional information, exploration with termination of an arbitrary network in this model, devoid of any means of communication between agents, is impossible. Our aim is to solve the exploration problem by giving to agents very restricted local traffic reports. Specifically, an agent that is at a node nu in a given round is provided with three bits of information answering the following questions: Am I alone at nu? Did any agent enter nu in this round? Did any agent exit v in this round? We show that this small amount of information permits us to solve the exploration problem in arbitrary networks. More precisely, we give a deterministic terminating exploration algorithm working in arbitrary networks for all initial configurations that are not perfectly symmetric;that is, in which there are agents with different views of the network. The algorithm works in polynomial time in the (unknown) size of the network. A deterministic terminating exploration algorithm working for all initial configurations in arbitrary networks does not exist.

关键词： deterministic algorithm anonymous mobile agents exploration graphs network

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：