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

Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights

OPTIMIZATION LETTERS 2021年第6期15卷 2311-2319页

作者： Lv, Dan-Yang Wang, Ji-Bo Shenyang Aerosp Univ Sch Sci Shenyang Peoples R China

In a recent paper, Jiang et al. (EngOptim 52(1):37-52, 2020) considered proportionate flowshop scheduling with position-dependent weights. For common and slack due-date assignment problems, they proved that both of these two problems can be solved in O(n(2) log n) time, where n is the number of jobs. The contribution of this paper is that we show that these two problems can be optimally solved by a lower-order algorithm, i.e., in O(n log n) time.

关键词： Scheduling Proportionate flowshop Due-date assignment Optimal solution algorithm algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

THE NEW DESIGN OF THE THREADED BINARY-TREES

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1993年第3-4期49卷 177-186页

作者： HE, DK Department of Applied Mathematics Xidian University Xi'an 710071 China

The LNR/LRN New-type Threaded Binary Tree (LNR/LRN NTBT for short) is first proposed in this paper. It is shown that n, the number of nodes of the binary tree, is the time complexity* of the LNR-NTBT traversal algorithm, if there is a special pointer pointing to the first node in LNR order. But under the same condition, the time complexity of ordinary traversal algorithms for traditional LNR threaded binary trees is approximate to 2n. So the LNR-NTBT and its traversal algorithm are the best. The LRN-NTBT and its traversal algorithm are also very efficient.

关键词： DATA STRUCTURES THREADED BINARY TREE TRAVERSAL algorithm algorithm complexity DIRECTED GRAPH

来源：评论

学校读者我要写书评

暂无评论

Extended multiscale finite element method: its basis and applications for mechanical analysis of heterogeneous materials

引用

COMPUTATIONAL MECHANICS 2014年第4期53卷 659-685页

作者： Zhang, H. W. Liu, Y. Zhang, S. Tao, J. Wu, J. K. Chen, B. S. Dalian Univ Technol Fac Vehicle Engn & Mech Dept Engn Mech State Key Lab Struct Anal Ind Equipment Dalian 116024 Peoples R China

Extended multiscale finite element method (EMsFEM) has been proved to be an efficient method for the mechanical analysis of heterogeneous materials. The key factor for efficiency and accuracy of EMsFEM is the numerical base functions (NBFs). The paper summarizes the general method for constructing NBFs and proposes a generalized isoparametric interpolation based on the rigid displacement properties (RDPs) of NBFs. We prove that the NBFs constructed by linear, periodic and rotational angle boundary conditions satisfy the RDPs, which is independent with the shape and material properties of unit cells. The properties of NBFs for oversampling technique are also comprehensively discussed. The algorithm complexity is discussed in theoretical and numerical aspects, which concludes that the computation quantity of EMsFEM is much smaller than the direct solutions. The algorithm is validated by linear analysis of the materials with random impurities and holes and the efficiency is improved further by parallel computing.

关键词： Extended multiscale finite element method (EMsFEM) Numerical base function Heterogeneous material algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

Weight-proportional space partitioning using adaptive Voronoi diagrams

引用

GEOINFORMATICA 2007年第3期11卷 383-405页

作者： Reitsma, Rene Trubin, Stanislav Mortensen, Eric Oregon State Univ Coll Business Corvallis OR 97331 USA Oregon State Univ Sch Elect Engn & Comp Sci Corvallis OR 97331 USA

Traditional application of Voronoi diagrams for space partitioning results in Voronoi regions, each with a specific area determined by the generators' relative locations and weights. Particularly in the area of information space (re)construction, however, there is a need for inverse solutions;i.e., finding weights that result in regions with predefined area ratios. In this paper, we formulate an adaptive Voronoi solution and propose a raster-based optimization method for finding the associated weight set. The solution consists of a combination of simple, fixed-point iteration with an optional spatial resolution refinement along the regions' boundaries using quadtree decomposition. We present the corresponding algorithm and its complexity analysis. The method is successfully tested on a series of ideal-typical cases and the interactions between the adaptive technique and boundary resolution refinement are explored and assessed.

关键词： information space space partitioning Voronoi diagrams adaptive algorithm area-weight proportional fixed-point iteration quadtree decomposition optimization spatial resolution algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

A self-stabilizing algorithm for minimum-depth search of graphs

引用

INFORMATION SCIENCES 1999年第1-4期118卷 241-249页

作者： Chaudhuri, P Kuwait Univ Dept Elect & Comp Engn Safat Kuwait

This paper presents a self-stabilizing algorithm for the minimum-depth search (MDS) of a connected undirected graph on an asynchronous distributed or network model of computation. The algorithm produces a minimum-depth spanning tree (MDST) of the given graph in a distributed manner so that each node of the graph knows its depth and parent. The algorithm is resilient to transient faults and does not require initialization. It has been proved that the algorithm is correct and requires O(n(2)) time, where n is the number of nodes of the graph. (C) 1999 Elsevier Science Inc. All rights reserved.

关键词： self-stabilizing algorithm transient faults undirected graph minimum-depth search algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

TECHNIQUES FOR IMPROVING STABILITY RATE OF LINEAR PREDICTIVE IMAGE-CODING SCHEMES

引用

IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES 1988年第6期135卷 298-306页

作者： ANDREWS, M NGUYEN, DT Machine Intelligence Group Department of Electrical & Electronic Engineering University of Auckland Auckland New Zealand

Following the considerable success that linear predictive coding (LPC) has had in speech compression, the technique has been applied to the coding of two-dimensional (2-D) signals such as natural images. Unlike its one-dimensional (1-D) counterpart, the 2-D technique is not guaranteed to be stable. It is found that too much correlation in the signal causes a significant proportion of the analysis frames to produce unstable prediction filters, rendering the decoded image unintelligible. The paper introduces two methods for systematically reducing the signal correlation, and hence improving the so called ‘stability rate’ of a 2-D LPC system. The first method is based on the 2-D Fourier transform, and the second is based on the 2-D Hadamard transform. The effectiveness of each method is illustrated followed by a cost analysis based on algorithm complexity and bit-rate overhead.

关键词： stability rate natural images Integral transforms data compression signal correlation two-dimensional signals linear predictive image coding schemes encoding bit-rate overhead algorithm complexity unstable prediction filters 2-D Fourier transform Optical information, image and video signal processing Information theory Fourier transforms 2-D Hadamard transform picture processing speech compression

来源：评论

学校读者我要写书评

暂无评论

Design and performance analysis of modified two dimensional Golomb code for optical code division multiple access networks

引用

TELECOMMUNICATION SYSTEMS 2018年第1期69卷 77-94页

作者： Singhdeo, Sutikshna Bhanja, Urmila IISER Dept Math Mohali India IGIT Dept Elect & Telecommun Engn Dhenkanal India

In this work, a two dimensional (2D) wavelength/time code is developed. The 64 bit 2D code is constructed by a technique based on folding of Golomb rulers referred in this work as modified Golomb code (2D MGC) and the proposed 2D code is generated using Java 8.1 software. The performance of the proposed 2D MGC is evaluated in terms of bit error rate (BER), received signal power, and time domain analysis of multiple users. In this experiment, it is found that the BER increases with multiple numbers of simultaneous users due to multiple access interference. The proposed 2D code yields better network performance in terms of BER compared to that of different existing 2D OCDMA codes. In this work, mathematical analysis is also carried out to prove that the proposed 64 bit code is optimal satisfying auto and cross correlation properties. Furthermore, the complexity analysis of the proposed 64 bit optical code division multiple access (OCDMA) code is analysed. The OCDMA model is validated using the optisystem software.

关键词： Golomb code OCDMA Multiple access interference algorithm complexity Code optimality Fiber non-linearity

来源：评论

学校读者我要写书评

暂无评论

algorithmS FOR THE MONO-DIMENSIONAL AND BI-DIMENSIONAL FOURIER AND COSINE TRANSFORMS

引用

ANNALES DES TELECOMMUNICATIONS-ANNALS OF TELECOMMUNICATIONS 1985年第9-10期40卷 466-476页

作者： VETTERLI, M NUSSBAUMER, HJ 1.Ecole polytechnique fédérale de Lausanne 16 chemin de Bellerive CH-1007 Lausanne Suisse

Cet article présente un algorithme rapide pour le calcul de la transformée de Fourier discrète et de la transformée en cosinus discrète, et ceci lorsque la longueur de la transformation est une puissance de 2. Il atteint le nombre minimal connu d’opérations (multiplications et additions) pour la transformation de Fourier discrète de séquences réelles, complexes, symétriques et antisymétriques, pour la transformation de Fourier discrète impaire ainsi que pour la transformation en cosinus discrète. L’extension au cas bidimensionnel des transformations de Fourier et cosinus discrètes est également présentée.

关键词： algorithme Transformation Fourier discrète Transformation cosinus Complexité algorithme Symétrie Signal discret Signal bidimensionnel Mise en ?uvre algorithm Discrete Fourier transformation Cosinus transformation algorithm complexity Symmetry Discrete signal Two dimensional signal Implementation

来源：评论

学校读者我要写书评

暂无评论

PROCESS SYNCHRONIZATION - DESIGN AND PERFORMANCE EVALUATION OF DISTRIBUTED algorithmS

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1989年第9期15卷 1053-1065页

作者： BAGRODIA, R Department of Computer Science University of California at Los Angeles Los Angeles CA 90024

The concept of multiway rendezvous has been proposed to implement synchronous communication among an arbitrary number of concurrent, asynchronous processes. The synchronization and exclusion problems associated with implementing multiway rendezvous are expressed succinctly in the context of the committee coordination problem. A variety of techniques to solve the synchronization and exclusion problems may be combined to design algorithms for the committee coordination problem. This paper presents a simple solution for the problem and shows how it can be implemented to develop a family of algorithms. The algorithms use message counts to solve synchronization and solve the exclusion problem by using a circulating token, or by using auxiliary resources as in the solutions for the dining or drinking philosophers problems. The paper also presents the results of a simulation study on the performance of the algorithms. The experiments measured the response time and message complexity of each algorithm as a result of variations in different model parameters including network topology and level of conflict in the system. The results from the study show that the response time for algorithms proposed in this paper is significantly better than an existing algorithm, whereas the message complexity is considerably worse. [ABSTRACT FROM AUTHOR]

关键词： algorithm complexity mutual exclusion rendezvous synchronization synchronous communication

来源：评论

学校读者我要写书评

暂无评论

Screening Experiments with Many Factors

引用

COMMUNICATIONS IN STATISTICS-THEORY AND METHODS 2011年第10期40卷 1879-1892页

作者： Webb, Steve 809 Grayling Bay Costa Mesa CA 92626 USA

A new procedure is introduced for conducting screening experiments to find a small number of influential factors from among a large number of factors with negligible effects. It is intended for experiments in which the factors are easily controlled, as in simulation models. It adds observations sequentially after conducting a small initial experiment. The performance of the procedure is investigated using simulation, and evidence is presented that this and other procedures scale as the logarithm of the total number of factors if the number of influential factors is fixed. An investigation of the new procedure for 1-3 active factors shows that it compares favorably with competing methods, particularly when the size of the nonzero effects is 1-2 times the standard deviation. A limited look at the procedure for up to 6 active factors is also presented.

关键词： algorithm complexity Computer experiments Design of experiments Sensitivity analysis Sequential design

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：