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

Parallel Machine Scheduling models with Fuzzy Parameters and Precedence Constraints: A Credibility Approach

Journal of Beijing Institute of Technology 2007年第2期16卷 231-236页

作者：侯福均吴祈宗 School of Management and Economics Beijing Institute of Technology

A method for modeling the parallel machine scheduling problems with fuzzy parameters and precedence constraints based on credibility measure is provided. For the given n jobs to be processed on m machines, it is assumed that the processing times and the due dates are nonnegative fuzzy numbers and all the weights are positive, crisp numbers. Based on credibility measure, three parallel machine scheduling problems and a goal-programming model are formulated. Feasible schedules are evaluated not only by their objective values but also by the credibility degree of satisfaction with their precedence constraints. The genetic algorithm is utilized to find the best solutions in a short period of time. An illustrative numerical example is also given. Simulation results show that the proposed models are effective, which can deal with the parallel machine scheduling problems with fuzzy parameters and precedence constraints based on credibility measure.

关键词： parallel machine scheduling programming model possibility measure credibility measure fuzzy number genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

IMPACT OF PESTICIDE RESTRICTIONS ON REGIONAL PRODUCTION PATTERNS

引用

WATER AIR AND SOIL POLLUTION 1978年第1期10卷 105-114页

作者： VOCKE, G HEADY, EO The Centre for Agricultural and Rural Development Iowa State University 50011 Ames Iowa USA

A national and interregional programming model analyzes the effects of banning chlordane and heptachlor from USA agriculture. The model has sectors for land and water resources, crop and livestock production, commodity transportation and domestic and foreign demand. The central Corn Belt would lose production to other regions. Soybeans and small grains would replace corn on low lands and the value of land would decline. Crop rotations would include somewhat less corn.

关键词： Corn Transportation Water Resource programming model Crop Rotation

来源：评论

学校读者我要写书评

暂无评论

Non-competitive market behaviour in the international coking coal market

引用

ENERGY ECONOMICS 1999年第3期21卷 195-212页

作者： Graham, P Thorpe, S Hogan, L Australian Bur Agr & Resource Econ Minerals Energ Canberra ACT 2601 Australia

n this paper, a primal dual programming model of international coking coal trade is constructed to test for non-competitive market behaviour. World trade in 1996 is simulated under perfect competition and various non-competitive market structures. Statistical tests are used to compare simulated trade flows with actual data. Assuming Cournot-Nash behaviour, an all consumer oligopsony market structure is preferred to alternative models. Under an all consumer oligopsony world coking coal prices and trade are lower than under perfect competition. Under an oligopsonistic structure welfare gains from productivity increases in Australian coal mines might largely accrue to coal buyers. (C) 1999 Published by Elsevier Science.

关键词： market structure coal programming model

来源：评论

学校读者我要写书评

暂无评论

HIERARCHICAL CONCENTRATOR LOCATION PROBLEM

引用

COMPUTER COMMUNICATIONS 1992年第3期15卷 185-191页

作者： NARASIMHAN, S PIRKUL, H OHIO STATE UNIV COLL BUSINESSCOLUMBUSOH 43210

This paper addresses the problem of locating concentrators in a computer communications network where a concentrator could be connected to another concentrator in a hierarchy. A mathematical programming model is developed. The objective is to minimize the costs of setting up and operating the. communications network subject to capacity constraints. A Lagrangian relaxation approach is used to develop a heuristic solution procedure which is both efficient and effective. Extensive computational experiments were conducted to test the performance of the solution procedure. Problems with up to 200 terminal and 10 potential concentrator locations were studied. The gap between the feasible solution value and the best lower bound was used to judge the quality of the procedure. The mean gaps were in the range of 3-12% across a wide range of problem structures.

关键词： COMMUNICATIONS NETWORK CONCENTRATORS programming model

来源：评论

学校读者我要写书评

暂无评论

EXPERIMENTS IN MIXED-INTEGER LINEAR-programming USING PSEUDO-COSTS

引用

MATHEMATICAL programming 1977年第1期12卷 26-47页

作者： GAUTHIER, JM RIBIERE, G IBM FRANCE CTR PROGRAM PRODPARISFRANCE

This paper discusses heuristic “branch and bound” methods for solving mixed integer linear programming problems. The research presented on here is the follow on to that recorded in [3].After a resumé of the concept of pseudo-costs and estimations, new heuristic rules for generating a tree which make use of pseudo-costs and estimations are presented. Experiments have shown that models having a low percentage of integer variables behave in a radically different way from models with a high percentage of integer variables. The new heuristic rules seem to apply generally to the first type of ***, other heuristic rules are presented that are used with models having a high percentage of integer variables and with models having a special structure (models including special ordered sets.)The rules introduced here have been implemented in the IBM Mathematical programming System Extended/370. They are used to solve large mixed integer linear programming *** results that permit comparisons to be made among the different rules are provided and discussed.

关键词： Mathematical Method programming Problem programming model Mathematical Program Special Structure

来源：评论

学校读者我要写书评

暂无评论

AtomiS: Data-Centric Synchronization Made Practical

引用

PROCEEDINGS OF THE ACM ON programming LANGUAGES-PACMPL 2023年第OOPSLA期7卷 116–145页

作者： Paulino, Herve Matos, Ana Almeida Cederquist, Jan Giunti, Marco Matos, Joao Ravara, Antonio NOVA Univ Lisbon Dept Comp Sci NOVA LINCS Caparica Portugal NOVA Univ Lisbon FCT NOVA Caparica Portugal Inst Telecomunicacoes SQIG Aveiro Portugal Univ Lisbon Dept Comp Sci & Engn & IST Lisbon Portugal Univ Lisbon Dept Comp Sci IST Lisbon Portugal

Data-Centric Synchronization (DCS) shifts the reasoning about concurrency restrictions from control structures to data declaration. It is a high-level declarative approach that abstracts away from the actual concurrency control mechanism(s) in use. Despite its advantages, the practical use of DCS is hindered by the fact that it may require many annotations and/or multiple implementations of the same method to cope with differently qualified parameters. To overcome these limitations, in this paper we present AtomiS, a new DCS approach that requires only qualifying types of parameters and return values in interface definitions, and of fields in class definitions. The latter may also be abstracted away in type parameters, rendering class implementations virtually annotationfree. From this high level specification, a static analysis infers the atomicity constraints that are local to each method, considering valid only the method variants that are consistent with the specification, and performs code generation for all valid variants of each method. The generated code is then the target for automatic injection of concurrency control primitives that are responsible for ensuring the absence of data-races, atomicity-violations and deadlocks. We provide a Java implementation and showcase the applicability of AtomiS in real-life code. For the benchmarks analysed, AtomiS requires fewer annotations than the original number of regions requiring locks, as well as fewer annotations than Atomic Sets (a reference DCS proposal).

关键词： Concurrency Data-Centric programming model Inference and Synthesis

来源：评论

学校读者我要写书评

暂无评论

A smooth concurrency revolution with free objects

引用

IEEE INTERNET COMPUTING 2007年第4期11卷 82-85页

作者： Guerraoui, Rachid Ecole Polytech Fed Lausanne Lausanne Switzerland

In this paper, the author propose viewing a program as a collection of "free" objects, each of which has its own thread of control and executes its operations within atomic transactions. Such objects would communicate by asynchronous message passing with futures - objects that encapsulate the results of server invocations and let clients retrieve them while hiding the actual state of readiness from the client. Except for the unleashing of newly created free objects, theres no need for specific language constructs other than those already available in 00 languages. After all, C++ has been successful in part because it looked like C, Java has been successful in part because it looked like C++, and C# looks like both. With free objects, the program looks exactly like a traditional OO program, with one exception: certain object creations fork new activity threads and must be distinguished as such. This column discusses how to do that.

关键词： Concurrency Application Development programming model Object Oriented programming

来源：评论

学校读者我要写书评

暂无评论

Mapping applications of cellular automata into applications of cellular automata networks

引用

COMPUTER PHYSICS COMMUNICATIONS 2002年第1-2期147卷 724-728页

作者： Calidonna, CR Di Gregorio, S Furnari, MM CNR Ist Cibernet Eduardo Caianiello I-80078 Pozzuoli NA Italy Univ Calabria Dipartimento Matemat I-87036 Arcavacata Di Rende CS Italy

Cellular automata proved to be a promising model to simulate several complex systems: the requirement is that space and time, taken into account, have to be discretizable, while the system to be simulated has to satisfy locality and uniformity in the evolutionary space. Often, in dealing with the simulation of real complex systems some properties of locality are lost and consequently standard CA model application is very difficult. For this reason it is useful to extend the classical CA model and introduce feasible mechanisms in order to take advantage of the parallelism source of this computational model. With this aim the Cellular Automata Network (CAN) model was conceived that includes the advantages of classical CA models and introduces a new source of parallelism, i.e. the network of cellular automata. In this paper we deal with a sort of heuristics in order to map CA applications into CANs. This mapping can also be extremely useful as a proposal of a methodology to drive the modeling and simulation activity of complex phenomena that can be easily fragmented according to local interaction and components. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： cellular automata programming model complex system simulation data and task parallelism

来源：评论

学校读者我要写书评

暂无评论

ANALYTICAL SOLUTION OF A DYNAMIC TRANSACTION FLOW PROBLEM

引用

MATHEMATICAL programming 1976年第2期10卷 214-229页

作者： STANFORD, RE AUBURN UNIV AUBURNAL 36830

We analyze a mathematical programming model of a fractional flow process which consists ofn sectors and all possible time-dependent streams of flow between, into and out of the sectors. Assuming specific constraints on flow, least cost policies are determined for control of the system transactions involved over a given finite time horizon and over an infinite horizon. Several applications of the model are presented and discussed.

关键词： Mathematical Method Time Horizon programming model Mathematical programming Finite Time

来源：评论

学校读者我要写书评

暂无评论

A large-scale heterogeneous computing framework for non-uniform sampling two-dimensional convolution applications

引用

CCF TRANSACTIONS ON HIGH PERFORMANCE COMPUTING 2024年第2期6卷 221-239页

作者： Lu, Yu Yu, Ce Xiao, Jian Wang, Hao Fu, Hao Kang, Bo Zheng, Gang Tianjin Univ Coll Intelligence & Comp Tianjin Peoples R China Natl Supercomp Ctr Tianjin Tianjin Peoples R China

Non-uniform sampling two-dimensional convolution (NUSC) maps spatially sampling data with irregular distribution to a regular grid by convolution. As the data scale and growth rate continue to increase, accelerating NUSC with the heterogeneous computing platform is a feasible way. However, the complex hardware architecture and storage hierarchy of the heterogeneous computing platform poses a challenge to programming and performance tuning. Therefore, this paper proposes a heterogeneous parallel programming model and runtime framework named AutoNUSC. For the programming difficulties of NUSC in heterogeneous computing environments, AutoNUSC abstracts and encapsulates the parallel execution process of NUSC. Task scheduling, data division, node communication, fault-tolerant recovery, and other parallelization tasks are managed by AutoNUSC. For the performance tuning issues of NUSC, this paper implements performance optimization strategies for AutoNUSC, including vectorization, memory access optimization, data reuse, etc. The experiments show that AutoNUSC effectively reduces the workload of users in developing NUSC applications in heterogeneous computing environments. Performance acceleration of up to 339 times is achieved within a single node compared to the serial program. AutoNUSC can efficiently perform task scheduling and fault-tolerant recovery across multiple nodes, with desirable scalability and robustness.

关键词： Heterogeneous Computing NUSC programming model Runtime Framework

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：