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

Sustainable renewable energy resources utilization in rural areas

RENEWABLE & SUSTAINABLE ENERGY REVIEWS 2016年 66卷 1-9页

作者： Woldeyohannes, Abraham Debebe Woldemichael, Dereje Engida Baheta, Aklilu Tesfamichael Caledonian Coll Engn POB 2322CPO Seeb 111 Seeb Oman Univ Teknol PETRONAS Bandar Seri Iskandar 32610 Perak Malaysia

This paper aims to address the issues related to renewable energy (RE) resources optimization in the areas where providing power from main grid is challenging. A region having ten different sub-regions has been considered for the optimization based on transportation algorithm. The partitions are made based on customer segmentation to ensure that various scattered demand for the RE is represented at the best location to enhance energy optimization by minimizing the energy loss during transmission. Three cases, i.e., when the demand and supply are equal, when there is more demand than supply, and when the supply is greater than demand are considered for the analysis. For the first case, the total energy requirement and the energy potential available from the regions is 1.26 GW h/year. For this scenario, most of the regions (seven regions) received the energy requirements from single RE source;three regions received the required energy from two different RE sources. The annual optimized total cost of energy supply for this scenario is determined to be $187,961.68. Results obtained from the transportation model have been validated based on other RE studies in the area. For the similar case study considered, it is noted that the minimized total cost obtained using transportation algorithm depicts an improvement in cost over integrated renewable energy system (IRES) models. The developed optimization model could be used as a decision making support tool to evaluate and select various alternative renewable energy resources and to determine the optimal locations for developing these resources. (C) 2016 Published by Elsevier Ltd.

关键词： Renewable Energy Optimization transportation algorithm transportation model Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Integer Programming Approach to PCB Assembly Optimization of Modular Mounters

Integer Programming Approach to PCB Assembly Optimization of...

引用

2010 IEEE World Congress on Computational Intelligence

作者： Park, Tae-Hyoung Kim, Kyung-Min Chungbuk Natl Univ Dept Control & Robot Eng CBITRC Cheongju 361763 Chungbuk South Korea Samsung Elect Co Mobile Commun Ctr Suwon 433742 Kyunggi South Korea

ISBN: (纸本)9781424481262

We propose an optimization method to maximize the productivity of PCB (printed circuit board) assembly of modular mounters. The modular mounter is a series of compact SMD (surface mount device) placement modules, where each module has assembly head and feeder lanes. The throughput of the mounter is maximized by balancing the assembly time of each module. We indentify the problem as an integer programming problem, and divide the problem into feeder arrangement problem and mount sequence problem by decoupling the path into forward arcs and backward arcs. The integer-programming based algorithms such as branch-and-bound algorithm and transportation algorithm are applied to solve the formulated problems. Simulation results are presented to verify the usefulness of the proposed method.

关键词： PCB assembly optimization assembling assembly time branch-and-bound algorithm feeder arrangement problem integer programming integer programming based algorithm integer programming problem modular mounter mount sequence problem optimisation printed circuit board assembly printed circuit manufacture printed circuits productivity surface mount device placement module transportation algorithm

来源：评论

学校读者我要写书评

暂无评论

Merger of Malaysian banks: Selecting appropriate partners

引用

Managerial Finance 2004年第4期30卷 19-28页

作者： Guru, Balachandher K. Avvari, Mohan Balachandran Faculty of Management Multimedia University Jalan Multimedia Cyberjaya Selangor 63100 Malaysia

The Malaysian government is rushing banks to merge. The Central Bank has decided that there must be only 10 banks instead of a current total of 20. As a result, the local banks were being forced to merge with other banks. The problem lies in the non-existence of a systematic means of identifying potential merger partner(s). This study thus, proposes to use the concept of the transportation algorithm to select potential merger partners for Malaysian banks, which would maximize the net worth of the merged entity. The methodology employed in this paper may not yield the best merger partner(s) but it should at least narrow down the choices to a select few where together with other rigorous financial, technical, strategic and even qualitative analysis may be used to determine the ultimate merger partner(s). © Emerald Group Publishing Limited 2004.

关键词： Banking Efficiency Malaysia Merger Merger partner transportation algorithm

来源：评论

学校读者我要写书评

暂无评论

Effective algorithms for designing power distribution networks

引用

MICROPROCESSORS AND MICROSYSTEMS 1996年第4期20卷 251-258页

作者： Wong, YK Shi, KL Chan, TF Department of Electrical Engineering Hong Kong Polytechnic University Hunghom Kowloon Hong Kong

In transmission planning, we need a good network design to minimize the construction cost and to determine the optimal location of substations. This paper presents a feasible design method, using two mathematical techniques (Dijkstra's algorithm and transportation algorithm) to optimize substation sizes and service boundaries, given alternative locations for the substations under reliability constraints. A reliability index, the Average Annual Customer Interruption Rate (AACIR) is used to determine the reliability of loads. Appropriate measures can then be taken to increase the reliability of the system.

关键词： distribution network optimization Dijkstra's algorithm transportation algorithm

来源：评论

学校读者我要写书评

暂无评论

SCHEDULING INDEPENDENT JOBS ON UNIFORM PARALLEL MACHINES TO MINIMIZE TARDINESS CRITERIA

引用

JOURNAL OF INTELLIGENT MANUFACTURING 1995年第2期6卷 95-103页

作者： GUINET, A Laboratoire d'Informatique des Systèmes de Production Industrielle Institut National des Sciences Appliquées de Lyon Villeurbanne France

The problem of scheduling N jobs on M uniform parallel machines is studied. The objective is to minimize the mean tardiness or the weighted sum of tardiness with weights based on jobs, on periods or both. For the mean tardiness criteria in the preemptive case, this problem is NP-hard but good solutions can be calculated with a transportation problem algorithm. In the nonpreemptive case the problem is therefore NP-hard, except for the cases with equal job processing times or with job due dates equal to job processing times. No dominant heuristic is known in the general nonpreemptive case. The author has developed a heuristic to solve the nonpreemptive scheduling problem with unrelated job processing times. Initially, the algorithm calculates a basic solution. Next, it considers the interchanges of job subsets to equal processing time sum interchanging resources (i.e. a machine for a given period). This paper models the scheduling problem. It presents the heuristic and its result quality, solving 576 problems for 18 problem sizes. An application of school timetable scheduling illustrates the use of this heuristic.

关键词： SCHEDULING PARALLEL MACHINES transportation algorithm SIMULATED ANNEALING

来源：评论

学校读者我要写书评

暂无评论

The principle of least commitment in the analysis of chromosome images 2

The principle of least commitment in the analysis of chromos...

引用

Conference on Applications of Fuzzy Logic Technology II

作者： KELLER, JM GADER, P CALDWELL, CW UNIV MISSOURI DEPT ELECT & COMP ENGNCOLUMBIAMO 65211

ISBN: (纸本)0819418463

The automation of chromosome identification and visualization for a complete cell (karyotyping) has been the subject of considerable research. While rather high classification rates are possible on individual chromosomes, the cell level classification rates are still quite low. We describe a system which uses partial confidence values generated by neural and fuzzy classifiers with optimization to increase the cell level recognition rates. This is consistent with Marr's Principle of Least Commitment for the design of intelligent computer vision algorithms. © 1995 Proceedings of SPIE - The International Society for Optical Engineering. All rights reserved.

关键词： CHROMOSOME IMAGES KARYOTYPING FUZZY LOGIC NEURAL NETWORKS transportation algorithm COMPUTER VISION PRINCIPLE OF LEAST COMMITMENT

来源：评论

学校读者我要写书评

暂无评论

A HYBRID METHOD FOR AUTOMATIC CHROMOSOME KARYOTYPING

引用

PATTERN RECOGNITION LETTERS 1994年第1期15卷 87-96页

作者： KLEINSCHMIDT, P MITTERREITER, I RANK, C Lehrstuhl f&uuml r Wirtschaftsinformatik Wirtschaftswissenschaftliche Fakult&auml t Universit&auml t Passau Innstr. 29 D-94032 Passau Germany

We present a method which automatically produces reliable statements about the quality of automatically generated chromosome classifications (karyotypes). Rejecting cells which our method labels as 'bad' or 'medium' we obtain extremely good karyotypes for the remaining set of cells. Moreover, for each classified cell we can identify chromosomes which are classified correctly with a high probability. Our approach may also be useful for other classification problems.

关键词： CHROMOSOME CLASSIFICATION KARYOTYPING transportation algorithm CLASSIFICATION QUALITY QUALITY JUDGMENT

来源：评论

学校读者我要写书评

暂无评论

AN EFFICIENT transportation algorithm FOR AUTOMATIC CHROMOSOME KARYOTYPING

引用

PATTERN RECOGNITION LETTERS 1991年第2期12卷 117-126页

作者： TSO, M KLEINSCHMIDT, P MITTERREITER, I GRAHAM, J UNIV PASSAU FAK MATH & INFORMATW-8390 PASSAUGERMANY UNIV MANCHESTER DEPT MED BIOPHYSMANCHESTER M13 9PTLANCSENGLAND

We have implemented an algorithm for the special case of the transportation problem with unit demands to assist in the automatic classification (karyotyping) of human chromosomes by image analysis. Use of the algorithm permits prior knowledge of the number of chromosomes of a certain type in a normal human cell to constrain the classification. A study involving the classification of three large datasets is described and a comparison is made of the maximum likelihood and Bayesian approaches.

关键词： CHROMOSOME CLASSIFICATION KARYOTYPING transportation algorithm IMAGE PROCESSING CONTEXT CONSTRAINED CLASSIFICATION MAXIMUM LIKELIHOOD BAYESIAN METHODS

来源：评论

学校读者我要写书评

暂无评论

AUTOMATED DETECTION OF MAMMOGRAPHIC ASYMMETRY USING ANATOMICAL FEATURES

引用

International Journal of Pattern Recognition and Artificial Intelligence 1993年第6期7卷 1461-1476页

作者： PETER MILLER SUE ASTLEY Department of Medical Biophysics University of Manchester Stopford Building Oxford Road Manchester M13 9PT England

Breast asymmetry is an important radiological sign of cancer. This paper describes the first approach aiming to detect all types of asymmetry; previous asymmetry-based research has been focussed on the detection of mass lesions. The conventional approach is to search for brightness or texture differences between corresponding locations on left and right breast images. Due to the difficulty in accurately identifying corresponding locations, asymmetry cues generated in this way are insufficiently specific to be used as prompts for small and subtle abnormalities in a computer-aided diagnosis system. We have undertaken studies to discover more about the visual cues utilized by radiologists. As a result, we propose a new automatic method for detecting asymmetry based on the comparison of corresponding anatomical structures, identified by an automatic segmentation of breast tissue types. We describe methods for comparing the shape and brightness distribution of these regions, and we present promising results obtained by combining evidence for asymmetry.

关键词： Mammographic image analysis asymmetry detection texture segmentation shape analysis transportation algorithm

来源：评论

学校读者我要写书评

暂无评论

The transportation algorithm as an aid to chromosome classification

引用

PATTERN RECOGNITION LETTERS 1983年第5-6期1卷 489-496页

作者： Tso, M. K. S. Graham, J. UMIST Dept Math Manchester M60 9PT Lancs England Univ Manchester Dept Med Biophys Manchester M13 9PT Lancs England

An algorithm is presented which obtains a constrained maximum likelihood classification of homogeneously stained chromosomes. Significantly improved results over both a context-free and a plausible context-driven clas... 详细信息

关键词： Classification maximum likelihood automated chromosome analysis transportation algorithm linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：