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

Design of logical topologies for wavelength-routed optical networks

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 1996年第5期14卷 840-851页

作者： Ramaswami, R Sivarajan, KN INDIAN INST SCI BANGALORE 560012 KARNATAKA INDIA

This paper studies the problem of designing a logical topology over a wavelength-routed all-optical network (AON) physical topology, The physical topology consists of the nodes and fiber links in the network, On an AON physical topology, we can set up lightpaths between pairs of nodes, where a lightpath represents a direct optical connection without any intermediate electronics, The set of lightpaths along with the nodes constitutes the logical topology, For a given network physical topology and traffic pattern (relative traffic distribution among the source-destination pairs), our objective is to design the logical topology and the routing algorithm on that topology so as to minimize the network congestion while constraining the average delay seen by a source-destination pair and the amount of processing required at the nodes (degree of the logical topology), We will see that ignoring the delay constraints can result in fairly convoluted logical topologies with very long delays, On the other hand, in all our examples, imposing it results in a minimal increase in congestion, While the number of wavelengths required to imbed the resulting logical topology on the physical all optical topology is also a constraint in general, we find that in many cases of interest this number can be quite small, We formulate the combined logical topology design and routing problem described above (ignoring the constraint on the number of available wavelengths) as a mixed integer linear programming problem which we then solve for a number of cases of a six-node network, Since this programming problem is computationally intractable for larger networks, we split it into two subproblems: logical topology design, which is computationally hard and will probably require heuristic algorithms, and routing, which can be solved by a linear program, We then compare the performance of several heuristic topology design algorithms (that do take wavelength assignment constraints into account) against

关键词： Optical design Network topology Optical fiber networks Circuit topology Routing Algorithm design and analysis Delay All-optical networks Telecommunication traffic mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Dynamic project selection and funding under risk: A decision tree based MILP approach

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 1996年第2期95卷 284-298页

作者： Heidenberger, K Institut für Betriebswirtschaftslehre Universit?t Wien Briinner Stra?e 72 A-1210 Wien Austria

This paper presents a mixed integer linear programming (MILP) model for a new class of dynamic project selection and funding problems under risk given multiple scarce resources of different qualifications. The underlying stochastic decision tree concept extends classical approaches mainly in that it adds a novel node type that allows for the continuous control of discrete branching probability distributions. The control functions are piecewise linear and are convex for the costs and concave for the benefits. The MILP-model has been embedded in a prototype Decision Support System (DSS). With respect to the proposed solution the DSS provides complete probability distributions for both costs and benefits.

关键词： resource allocation investment cost benefit analysis decision tree mixed integer linear programming R&D project management

来源：评论

学校读者我要写书评

暂无评论

Minimization of adders in fast FIR digital filters and its application to filter design

Minimization of adders in fast FIR digital filters and its a...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： M. Yagyu A. Nishihara N. Fujii Department of Pliysical Electronics Tokyo Institute of Technology Japan

This paper proposes fast FIR digital filter structures using the minimal number of adders. Filter coefficients are expressed with canonic signed digit (CSD) code and Hartley's technique is used to minimize the number of adders and subtractors. The proposed filters implemented as wired logic are fast because the structure having the shortest critical path is selected. An algorithm is given to obtain such fast structures. In many examples the critical path length of the filter structures obtained using the proposed method is equal to that of the conventional CSD structures. This paper also presents a new design method of FIR filters using MILP. Utilization of common expressions in Hartley's technique widen the CSD coefficient space. Thus the mixed integer linear programming (MILP) may lead to better frequency responses. Superior frequency responses are actually obtained in many simulations.

关键词： Finite impulse response filter Digital filters Adders Frequency response Electronic mail Logic Design methodology mixed integer linear programming Hardware Costs

来源：评论

学校读者我要写书评

暂无评论

SCALING PROPERTIES OF NEURAL NETWORKS FOR JOB-SHOP SCHEDULING

引用

NEUROCOMPUTING 1995年第1期8卷 79-91页

作者： FOO, SY TAKEFUJI, Y SZU, H CASE WESTERN RESERVE UNIV DEPT ELECT ENGN & APPL PHYSCLEVELANDOH 44106 FLORIDA STATE UNIV COLL ENGNFAMUDEPT ELECT ENGNTALLAHASSEEFL 32316

This paper investigates the scaling properties of neural networks for solving job-shop scheduling problems. Specifically, the Tank-Hopfield linear programming network is modified to solve mixed integer linear programming with the addition of step-function amplifiers. Using a linear energy function, our approach avoids the traditional problems associated with most Hopfield networks using quadratic energy functions. Although our approach requires more hardware (in terms of processing elements and resistive interconnects) than a recent approach by Zhou et al. [2], the neurons in the modified Tank-Hopfieid network do not perform extensive calculations unlike those described by Zhou et al.

关键词： OPTIMIZATION SCHEDULING mixed integer linear programming TANK-HOPFIELD NEURAL NETWORKS

来源：评论

学校读者我要写书评

暂无评论

WATER-SUPPLY OPERATIONS DURING DROUGHT - A DISCRETE HEDGING RULE

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 1995年第1期82卷 163-175页

作者： SHIH, JS REVELLE, C JOHNS HOPKINS UNIV DEPT GEOG & ENVIRONM ENGNBALTIMOREMD 21218 CARNEGIE MELLON UNIV CTR ENERGY & ENVIRONMPITTSBURGHPA 15213

A mixed integer programming model is constructed for the operation of a single water supply reservoir during drought and impending drought. Operating on a critical sequence of low flows, the model determines trigger volumes of storage plus anticipated inflow which signal the need for each of the several phases of rationing. The trigger volumes are examined as the allowed frequency of the various phases of rationing are varied.

关键词： DROUGHT WATER RATIONING RESERVOIR OPERATING RULE MATHEMATICAL programming mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

GREY integer programming - AN APPLICATION TO WASTE MANAGEMENT PLANNING UNDER UNCERTAINTY

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 1995年第3期83卷 594-620页

作者： HUANG, GH BAETZ, BW PATRY, GG MCMASTER UNIV DEPT CIVIL ENGNHAMILTONON L8S 4L7CANADA UNIV OTTAWA FAC ENGNOTTAWAON K1N 6N5CANADA

This paper introduces a grey integer programming (GIP) method for facility expansion planning under uncertainty, by incorporating the concepts of grey number and grey mathematical programming into a mixed integer linear programming optimization framework. The approach is an improvement upon previous integer programming methods in terms of its technical characteristics and applicability. It allows uncertain information to be effectively communicated into the optimization process and the resulting solutions. It also has low computational requirements and is thus applicable to practical problems. The modelling approach is applied to a hypothetical planning problem of waste flow allocation and treatment/disposal facility expansion within a regional solid waste management system. The binary variable solutions provide the ranges of different development alternatives within a multi-period, multi-facility and multi-scale context, and the continuous variable solutions provide optimal schemes for waste flow allocation corresponding to the upper and lower bounds of the objective function value. The results indicate that reasonable and useful solutions can be achieved through the developed approach.

关键词： GREY integer programming mixed integer linear programming REGIONAL SOLID WASTE MANAGEMENT OPTIMIZATION UNCERTAINTY

来源：评论

学校读者我要写书评

暂无评论

COMPUTING CIRCUMSCRIPTIVE DATABASES .1. THEORY AND ALGORITHMS

引用

INFORMATION AND COMPUTATION 1995年第1期116卷 58-80页

作者： NERODE, A NG, RT SUBRAHMANIAN, VS UNIV BRITISH COLUMBIA DEPT COMP SCIVANCOUVERBCCANADA UNIV MARYLAND INST ADV COMP STUDIESCOLLEGE PKMD 20742 UNIV MARYLAND DEPT COMP SCICOLLEGE PKMD 20742

Though circumscription was introduced by McCarthy over a decade ago, there has been relatively little work on algorithms for computing circumscriptive databases. In this paper, we develop algorithms to compute the preferred models of circumscriptive databases at compile-time using mixed integer linear programming techniques. Two advantages of this (bottom-up) approach are that it makes efficient re-use of previous computations and it provides much faster run-time performance. Some other advantages of using linear programming to automate deduction at compile time are that its re-optimization facilities elegantly accommodate database updates and also that it leads to a completely declarative formulation in which ordering of rules and literals in rule bodies plays no real role. Finally, we plan to use a standard relational database system as our run-time environment;this should yield relatively fast run-time processing, and provide a more expressive query language in which aggregates and the like can be expressed easily. (C) 1995 Academic Press. Inc.

关键词： Logic Formal logic linear programming data base language theories Runtime nonmonotonic reasoning Relational database systems DEDUCTION algorithms Rule compile time Database mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A FRAMEWORK FOR INVESTIGATING SCHEDULE ROBUSTNESS UNDER UNCERTAINTY

引用

COMPUTERS & CHEMICAL ENGINEERING 1995年第Sup1期19卷 S615-S620页

作者： MIGNON, DJ HONKOMP, SJ REKLAITIS, GV PURDUE UNIV SCH CHEM ENGNW LAFAYETTEIN 47907 UNIV CATHOLIQUE LOUVAIN DEPT PROC ENGNB-1348 LOUVAINBELGIUM

The batch processing manufacturing environment is subject to a high degree of uncertainty. One of the key issues in producing practical process schedules in such an unfavourable environment is the assessment of their robustness under uncertainty. This paper shows how Monte-Carlo based simulation models, implemented within the framework of the BATCHES simulator, can be used for this purpose, starting with the automated implementation of a given schedule into the simulation models, then running the various replicates of the simulation acid finally analysing their results. In addition, the possibility of feeding back the simulation results to the scheduling model is also discussed, paving the way towards the development of a more effective reactive scheduling system.

关键词： CHEMICAL PROCESS BATCH PROCESSES OPTIMIZATION SCHEDULING SIMULATION mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Optimal hydro generation and interchange scheduling with flow-dependent channel constraints

Optimal hydro generation and interchange scheduling with flo...

引用

International Conference on Energy Management and Power Delivery (EMPD)

作者： W. Grubauer R. Underwood M. Telgenhoff R. Frowd Siemens AG Vienna Austria Seattle City Light Seattle WA USA Minnetonka MN USA

This paper describes the mathematical formulation, algorithm and some sample results of the advanced short-term hydroelectric generation scheduling function that has been developed as part of a new energy management system. An approach to consider nonlinear, noncontinuous constraints in linear optimization problems, is presented in this paper. The hydroelectric generation and interchange is scheduled to maximize the profit from buying and selling energy while meeting these hydro operating constraints. This problem has been successfully solved for up to a 168 hour time frame using mixed integer linear programming (MILP). This method is well suited to solving this optimization problem with the complete set of hydro constraints, including the flow dependent ramp limits. This paper includes some details of results obtained for some actual operational scenarios, where it can be clearly demonstrated that the new algorithm produces hydro and interchange schedules which maximize the generation over the heavy load hours (in which the energy can be sold at a higher price) and minimize generation over the light load hours while meeting all constraints on the hydro system.

关键词： Reservoirs Aquaculture Marketing and sales Rivers Scheduling algorithm Constraint optimization Page description languages Cities and towns Energy management mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Concurrent timing optimization of latch-based digital systems

Concurrent timing optimization of latch-based digital system...

引用

IEEE International Conference on Computer Design: VLSI in Computers and Processors, (ICCD)

作者： Hong-Yean Hsieh Wentai Liu R.K. Cavin C.T. Gray Department of Electrical and Computer Engineering North Carolina State University USA IBM Corporation NC USA

Many techniques have been proposed to optimize digital system timing. Each technique can be advantageous in particular applications, however they are most often applied individually rather than concurrently. The framework presented here allows for concurrent timing optimization using retiming, intentional clock skew, and wave pipelining for latch-based designed systems with single or multi-phase clocking. This optimization is formulated as a mixed integer linear program. Our integrated framework also includes a new optimization technique called resynchronization which allows for the insertion of latches in the shortest paths and thus avoids race conditions. Our work has been applied to several designs and is able to significantly reduce the clock period.

关键词： Timing Digital systems Clocks Pipeline processing Design optimization Safety Propagation delay Synchronization Application software mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：