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

ESTIMATION OF FLEXIBILITY COEFFICIENTS FOR RECURSIVE programming models - ALTERNATIVE APPROACHES

AMERICAN JOURNAL OF AGRICULTURAL ECONOMICS 1974年第2期56卷 344-350页

作者： SAHI, RK CRADDOCK, WJ AGR CANADA RES DIVECON BRANCHOTTAWAONTARIOCANADA UNIV MANITOBA WINNEPEGMANITOBACANADA

This paper presents a critical evaluation of some methods commonly used in estimating flexibility coefficients for recursive programming models. It also suggests an alternative procedure for estimating coefficients that vary from year to year depending upon economic and noneconomic conditions. This method was found empirically superior to some previous approaches.

关键词： Estimation methods Crops Modeling Land use Prairies programming models Crop economics Variable coefficients Crop production

来源：评论

学校读者我要写书评

暂无评论

COMPETITIVE DEMAND STRUCTURES UNDER RISK IN AGRICULTURAL LINEAR-programming models

引用

AMERICAN JOURNAL OF AGRICULTURAL ECONOMICS 1974年第2期56卷 235-244页

作者： HAZELL, PBR SCANDIZZ.PL INT BANK RECONSTRUCTION & DEV DEV RES CTR WASHINGTON DC 20000 USA

A method is presented for solving agricultural sector models under risk to obtain perfectly competitive levels of outputs and prices in all product markets when producers behave according to an E, V decision criterion. The nature of market equilibrium behavior is considerably more complicated under risk than in a deterministic setting. This presents difficulties in designing models which will always provide meaningful economic answers. These difficulties are overcome by stipulating conditions under which the proposed model is applicable. The resultant model is a quadratic programming problem, and linearization techniques are suggested which enable solutions to be obtained through conventional linear programming computer codes. [ABSTRACT FROM AUTHOR]

关键词： Supply Market prices Determinism Risk aversion Peasant agriculture Economic models programming models Financial risk Linear programming Objective functions

来源：评论

学校读者我要写书评

暂无评论

A systematic mapping study of cloud policy languages and programming models

引用

JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES 2021年第7期33卷 761-768页

作者： Odun-Ayo, Isaac Goddy-Worlu, Rowland Yahaya, Jamaiah Geteloma, Victor Covenant Univ Comp & Informat Sci Ota Nigeria Univ Kebangsaan Malaysia Fac Informat Sci & Technol Bangi Selangor Malaysia

Cloud computing can be considered as a disruptive technology that is making life easier for Cloud users. Determining a focus of research in a specific subject area is sometimes challenging. A systematic map enables a synthesis of a scheme for categorizing data in a field of interest. The goal of this research paper is to carry out a systematic mapping study of policy language and programming models on the cloud. The mapping involved contribution category such as method, research category such as evaluation and major topics extracted from the abstracts of primary studies. The result indicated there are more publications on evaluation research in term of security with 8.9%. There were more papers published on validation research, solution proposal and experience research on the topic of paradigms with 7.53%, 6.85% and 4.11% respectively. Also, there were more publications on philosophical research in terms of privacy with 4.11%. In addition, there were more articles published on opinion research in terms of the survey with 4.11%. On the other hand, there were no articles on metric in terms of framework, paradigms and accountability, and reliability to the best of the researchers' knowledge. The outcome of this systematic study will be of benefit to cloud users, researchers, practitioners and providers. (c) 2019 The Authors. Production and hosting by Elsevier B.V. on behalf of King Saud University. This is an

关键词： Cloud computing Cloud computing policy languages programming models Systematic mapping

来源：评论

学校读者我要写书评

暂无评论

Special Issue on Parallel programming models and Systems Software for High-End Computing

引用

PARALLEL COMPUTING 2016年 51卷 1-2页

作者： Balaji, Pavan Vishnu, Abhinav Chen, Yong Argonne Natl Lab Argonne IL 60439 USA Pacific NW Natl Lab Richland WA 99352 USA Texas Tech Univ Lubbock TX 79409 USA

This special issue features a collection of papers that extend the literature in unique ways, improving the state of art of programming models and systems software for high-end computing systems.

关键词： programming models Systems Software

来源：评论

学校读者我要写书评

暂无评论

INCORPORATING RISK-AVERSION INTO DYNAMIC-programming models - REPLY

引用

AMERICAN JOURNAL OF AGRICULTURAL ECONOMICS 1994年第4期76卷 965-967页

作者： KRAUTKRAEMER, JA VANKOOTEN, GC YOUNG, DL WASHINGTON STATE UNIV DEPT AGR ECONPULLMANWA 99164 UNIV BRITISH COLUMBIA DEPT AGR ECONVANCOUVER V6T 1W5BCCANADA

Presents the authors response to a commentary on their article `Incorporating Risk Aversion into Dynamic programming models' published in the November 1992 issue of the `American Journal of Agricultural Economics.' Association of interyear risk with soil moisture level uncertainty; Determination of importance of temporal uncertainty.

关键词： Risk aversion Expected utility Soil water Recursive functions Temporal resolution programming models Dynamic programming Dynamic modeling Conditional probabilities Expected values

来源：评论

学校读者我要写书评

暂无评论

DYNAMIC-programming models OF NONSERIAL CRITICAL PATH-COST PROBLEM

引用

MANAGEMENT SCIENCE 1977年第2期24卷 200-209页

作者： ESOGBUE, AO MARKS, BR ST MARYS UNIV HALIFAX B3H 3C3NSCANADA

One of the major contributions to the planning and management of Research and Development organizations is the evolution of methods for dealing with PERT-Cost or CPM-Cost problems. Classically however, variations of the critical path-cost (CPM-Cost) problem, arising when different cost duration relationships are assumed, have been mostly studied via techniques other than dynamic programming. If the precedence relations possess a serial structure, one can develop two essentially equivalent dynamic programming formulations, of the resource allocation variety, by minimizing either the project cost or the completion time. When nonserial precedence relationships are involved, this problem cannot be solved by routine invocation of conventional dynamic programming formulations or algorithms. The intent of this paper is to show that efficient nonserial dynamic programming formulations can be developed for several complex nonserial CPM-Cost problem situations. In particular, the project time minimization procedure results in less complex dynamic programming models and is thus employed in this paper. Three recent computational reduction techniques based primarily on the introduction of the artifice of pseudo-tasks and pseudo-stages are invoked to treat different variations of this essentially nonserial critical path-cost problem. Considerable savings in computational requirements are achieved by consolidating all phases preceding a junction node prior to the invocation of the dynamic programming procedure. The advantages of these approaches over existing mathematical programming methods include their ability to handle nonlinear cost functions and constraints, as well as their highly efficient parametrization capabilities. Further, the complexity of the dynamic programming formulation does not, unlike other methods, increase with the number of phases (tasks) but only with the degree in which the additional tasks change the structure of the precedence relations.

关键词： Dynamic programming programming models Minimization of cost Completion costs Scheduling Dynamic efficiency Dynamic modeling Algorithms Mathematical functions Management science

来源：评论

学校读者我要写书评

暂无评论

EVALUATION OF ALTERNATIVE FLEXIBILITY RESTRAINT PROCEDURES FOR RECURSIVE programming models USED FOR PREDICTION

引用

AMERICAN JOURNAL OF AGRICULTURAL ECONOMICS 1972年第1期54卷 68-&页

作者： MILLER, TA Economic Research Service USDAStationed at Colorado State UniversityFort Collins

Recursive programming models for estimating production response may be generalized from the original "recursive" formulation to a formulation that simply attempts to limit the linear programming solution to a reasonable subset. This article outlines a framework for evaluating the effect of alternative flexibility restraint procedures on the accuracy of such recursive programming models. Statistical estimates are developed for the total expected error of predictions, given a specified set of population and model characteristics. The analysis suggests that recursive programming models achieve some measure of statistical accuracy.

关键词： Error rates Coefficients Modeling Least squares programming models Statistical variance Estimation methods Estimate reliability Approximation

来源：评论

学校读者我要写书评

暂无评论

A Comparison of programming models for Multiprocessors with Explicitly Managed Memory Hierarchies

A Comparison of Programming Models for Multiprocessors with ...

引用

14th ACM SIGPLAN Symposium on Principles and Practice of Parallel programming

作者： Schneider, Scott Yeom, Jae-Seung Rose, Benjamin Linford, John C. Sandu, Adrian Nikolopoulos, Dimitrios S. Virginia Tech Dept Comp Sci Blacksburg VA 24060 USA

ISBN: (纸本)9781605583976

On multiprocessors with explicitly managed memory hierarchies (EMM), software has the responsibility of moving data in and out of fast local memories. This task can be complex and error-prone even for expert programmers. Before we can allow compilers to handle the complexity for us, we must identify the abstractions that are general enough to allow us to write applications with reasonable effort, yet specific enough to exploit the vast on-chip memory bandwidth of EMM multi-processors. To this end, we compare two programming models against hand-tuned codes on the STI Cell, paying attention to programmability and performance. The first programming model, Sequoia, abstracts the memory hierarchy as private address spaces, each corresponding to a parallel task. The second, Cellgen, is a new framework which provides OpenMP-like semantics and the abstraction of a shared address spaces divided into private and shared data. We compare three applications programmed using these models against their hand-optimized counterparts in terms of abstractions, programming complexity, and performance.

关键词： Design Languages Cell BE Explicitly Managed Memory Hierarchies programming models

来源：评论

学校读者我要写书评

暂无评论

AMA: Asynchronous Management of Accelerators for Task-based programming models

AMA: Asynchronous Management of Accelerators for Task-based ...

引用

15th Annual International Conference on Computational Science (ICCS)

作者： Planas, Judit Badia, Rosa M. Ayguade, Eduard Labarta, Jesus CNS BSC Barcelona Spain Univ Politecn Cataluna Barcelona Spain CSIC Spanish Natl Res Council IIIA Artificial Intelligence Res Inst Madrid Spain

Computational science has benefited in the last years from emerging accelerators that increase the performance of scientific simulations, but using these devices hinders the programming task. This paper presents AMA: a set of optimization techniques to efficiently manage multi-accelerator systems. AMA maximizes the overlap of computation and communication in a blocking-free way. Then, we can use such spare time to do other work while waiting for device operations. Implemented on top of a task-based framework, the experimental evaluation of AMA on a quad-GPU node shows that we reach the performance of a hand-tuned native CUDA code, with the advantage of fully hiding the device management. In addition, we obtain up to more than 2x performance speed-up with respect to the original framework implementation.

关键词： accelerator management asynchronous devices programming models multi-GPU systems

来源：评论

学校读者我要写书评

暂无评论

Evaluation of OpenAI Codex for HPC Parallel programming models Kernel Generation 23

Evaluation of OpenAI Codex for HPC Parallel Programming Mode...

引用

52nd International Conference on Parallel Processing (ICPP)

作者： Godoy, William F. Valero-Lara, Pedro Teranishi, Keita Balaprakash, Prasanna Vetter, Jeffrey S. Oak Ridge Natl Lab Oak Ridge TN 37830 USA

ISBN: (纸本)9798400708428

We evaluate AI-assisted generative capabilities on fundamental numerical kernels in high-performance computing (HPC), including AXPY, GEMV, GEMM, SpMV, Jacobi Stencil, and CG. We test the generated kernel codes for a variety of language-supported programming models, including (1) C++ (e.g., OpenMP [including offload], OpenACC, Kokkos, SyCL, CUDA, and HIP), (2) Fortran (e.g., OpenMP [including offload] and OpenACC), (3) Python (e.g., numpy, Numba, cuPy, and pyCUDA), and (4) Julia (e.g., Threads, ***, ***, and ***). We use the GitHub Copilot capabilities powered by the GPT-based OpenAI Codex available in Visual Studio Code as of April 2023 to generate a vast amount of implementations given simple + <programming model> + prompt variants. To quantify and compare the results, we propose a proficiency metric around the initial 10 suggestions given for each prompt. Results suggest that the OpenAI Codex outputs for C++ correlate with the adoption and maturity of programming models. For example, OpenMP and CUDA score really high, whereas HIP is still lacking. We found that prompts from either a targeted language such as Fortran or the more general-purpose Python can benefit from adding code keywords, while Julia prompts perform acceptably well for its mature programming models (e.g., Threads and ***). We expect for these benchmarks to provide a point of reference for each programming model's community. Overall, understanding the convergence of large language models, AI, and HPC is crucial due to its rapidly evolving nature and how it is redefining human-computer interactions.

关键词： GPT large language models LLM programming models generative AI numerical kernels high-performance computing HPC GitHub Copilot OpenAI Codex

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：